By Topic

Delayed block LMS algorithm and concurrent architecture for high-speed implementation of adaptive FIR filters

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)
Mohanty, B.K. ; Dept. of Electron. & Commun. Eng., Jaypee Inst. of Eng. & Technol., Guna ; Meher, P.K.

In this paper, we propose a block least mean square algorithm with delayed weight adaptation for hardware implementation of finite impulse response (FIR) adaptive filters. We have referred to the proposed algorithm as delayed block least mean square (DBLMS) algorithm. Unlike the delayed least mean square (DLMS) algorithm, the DBLMS algorithm takes a block of L input samples and yields a block of L output in every training cycle. The simulation result shows that the DBLMS algorithm has convergence performance equivalent to that of the DLMS algorithm. We have exploited the parallelism inherent in the DBLMS algorithm to derive a highly concurrent systolic architecture for FIR adaptive filters. The proposed architecture can support L time higher sampling rate compared with the best of the existing pipelined designs and, therefore, it would involve less samples of adaptation delays and would provide a more efficient implementation of LMS-based adaptive filters.

Published in:

TENCON 2008 - 2008 IEEE Region 10 Conference

Date of Conference:

19-21 Nov. 2008