A robust parallel DFE using extended LMS
Alan Gatherer, T.H. Meng
Abstract
Alan Gatherer, T.H. Meng
Abstract
A parallelizable ADFE (adaptive decision feedback equalizer) is presented which performs at an error rate close to that of the serial DFE. The complexity of the parallel architecture grows linearly with the speedup, with the constant of growth being unity. This allows for parallelization of the DFE to a reasonable level without a prohibitive increase in complexity. The complexity of each section of the parallel DFE is on the order of s/sup 2/ where s is the number of taps in the serial DFE. For a serial DFE the complexity is of order s. Therefore, for a speedup of T, one requires a hardware complexity that is on the order sT times that of the serial DFE. The increase in complexity is therefore linear in both speedup and number of taps.>
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A parallelizable ADFE (adaptive decision feedback equalizer) is presented which performs at an error rate close to that of the serial DFE. The complexity of the parallel architecture grows linearly with the speedup, with the constant of growth being unity. This allows for parallelization of the DFE to a reasonable level without a prohibitive increase in complexity. The complexity of each section of the parallel DFE is on the order of s/sup 2/ where s is the number of taps in the serial DFE. For a serial DFE the complexity is of order s. Therefore, for a speedup of T, one requires a hardware complexity that is on the order sT times that of the serial DFE. The increase in complexity is therefore linear in both speedup and number of taps.>
Key concepts: Speedup, Parallelizable manifold, Computer science, Parallel computing, Computational complexity theory, Parallel algorithm, Algorithm