Optimal Complexity Architectures for Pipelined Distributed Arithmetic-Based LMS Adaptive Filter

This paper presents three optimal-complexity structures (I, II, III) for pipelined distributed arithmetic (DA) based least-mean-square (LMS) adaptive filter. The complexity of proposed structures is reduced by implementing offset-binary-coding (OBC) combinations of input samples on hardware. However...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on circuits and systems. I, Regular papers Vol. 66; no. 2; pp. 630 - 642
Main Authors:	Khan, Mohd. Tasleem, Shaik, Rafi Ahamed
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.02.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Adaptive filters Arithmetic Binary codes Complexity Complexity theory Convergence Distributed arithmetic (DA) Encoding Finite impulse response filters Flip-flops Hardware least mean square (LMS) look-up table (LUT) offset binary coding (OBC) Table lookup Weight
ISSN:	1549-8328, 1558-0806
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!