By Topic

A block floating-point realization of the gradient adaptive lattice filter

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Chakraborty ; Dept. of Electron. & Electr. Commun. Eng., Indian Inst. of Technol., Kharagpur, India ; A. Mitra

We present a novel scheme to implement the gradient adaptive lattice (GAL) algorithm using block floating point (BFP) arithmetic that permits processing of data over a wide dynamic range at a cost significantly less than that of a floating point (FP) processor. Appropriate formats for the input data, the prediction errors, and the reflection coefficients are adopted, taking care so that for the prediction errors and the reflection coefficients, they remain invariant to the respective order and time update processes. Care is also taken to prevent overflow during prediction error computation and reflection coefficient updating by using an appropriate exponent assignment algorithm and an upper bound on the step-size mantissa.

Published in:

IEEE Signal Processing Letters  (Volume:12 ,  Issue: 4 )