A block floating point treatment to finite precision realization of the adaptive decision feedback equalizer

Authors:
Rafi Ahamed Shaik;Mrityunjoy Chakraborty
Affiliations:
Department of Electronics and Electrical Engineering,, Indian Institute of Technology, Guwahati-781 039, India;Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology, Kharagpur-721 302, India
Venue:
Signal Processing
Year:
2013

Citing 9
Cited 0

Block floating-point implementation of digital filters using the DSP56000

Microprocessors & Microsystems
New tools for localization of limit cycles in recursive block floating point systems

Signal Processing
Fast communication: An efficient decision feedback equalizer for the ATSC DTV receiver

Signal Processing
Low-complexity adaptive decision-feedback equalization of MIMO channels

Signal Processing
A block floating-point treatment to the LMS algorithm: efficient realization and a roundoff error analysis

IEEE Transactions on Signal Processing
Realization of block floating-point digital filters and applicationto block implementations

IEEE Transactions on Signal Processing
Roundoff errors in block-floating-point systems

IEEE Transactions on Signal Processing
Absolute error bounds for block floating-point direct-form digitalfilters

IEEE Transactions on Signal Processing
Calculating the FHT in hardware

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

A scheme for efficient realization of the adaptive decision feedback equalizer (ADFE) is presented using the block floating point (BFP) data format which enables the ADFE to process rapidly varying data over a wide dynamic range, at a fixed point like complexity. The proposed scheme adopts appropriate BFP format for the data as well as the filter weights and works out separate update relations for the filter weight mantissas and exponents. Overflows at the feed forward and the feedback filter output are prevented by certain dynamic scaling of the respective input, while overflow in weight update calculations is avoided by imposing certain upper bound on the algorithm step size @m which is shown to be less than the convergence bound. The proposed scheme deploys mostly simple fixed point operations and is shown to achieve considerable computational gain over its floating point based counterpart.