Partial-LUT Designs for Low-Complexity Realization of DA-Based BLMS Adaptive Filter

This brief presents two-optimized partial look-up table (LUT) designs for low-complexity realization of distributed arithmetic (DA) based block least-mean-square (BLMS) adaptive filter (ADF). These are based on the partial add-store (PAS) and partial store-add (PSA) methods. A novel optimization sch...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. II, Express briefs Vol. 68; no. 4; pp. 1188 - 1192
Main Authors Khan, Mohd. Tasleem, Kumar, Jitendra, Ahamed, Shaik Rafi, Faridi, Juhi
Format Journal Article
LanguageEnglish
Published New York IEEE 01.04.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This brief presents two-optimized partial look-up table (LUT) designs for low-complexity realization of distributed arithmetic (DA) based block least-mean-square (BLMS) adaptive filter (ADF). These are based on the partial add-store (PAS) and partial store-add (PSA) methods. A novel optimization scheme is presented which exploits the redundancies between the partial inner-products with sliding-window of input-block. It is found that the PAS method provides shorter critical-path-delay than the PSA method. A case study on echo-cancellation is demonstrated for architectural trade-off between the proposed designs. Synthesis results show that the proposed PSA based BLMS ADF for <inline-formula> <tex-math notation="LaTeX">64^{\text {th}} </tex-math></inline-formula> order offers 41.04% lesser area and 39.38% lesser power, while the PAS based BLMS ADF provides 52.08% lesser area and 50.05% lesser power as compared to the best existing work.
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2020.3035693