Abstract
This paper presents a new area and power efficient VLSI architecture for least-mean-square (LMS) adaptive filterusing distributed arithmetic (DA). Conventionally, DA basedLMS adaptive filter requires look-up tables (LUTs) for filteringand weight updating operations. The size of LUTs grows exponentially with filter order. The proposed scheme has reducedthe LUT size to half by storing the offset-binary-coding (OBC) combinations of filter weights and input samples. To make theadaptive filter more area and power efficient, it is not necessary todecompose LUT into two smaller LUTs. Hence, by using the nondecomposed LUT the proposed design achieves significant savingsin area and power over the best existing scheme. In addition, the proposed architecture involves comparatively lesser hardwarecomplexity for the same LUT-size. From synthesis results, it isfound that the proposed design with 32nd order filter offers 19.83% less area and consumes 20.54 % less power; utilizes 16.67 %and 19.04 % less number of LUT and FF respectively over thebest existing scheme.
Original language | English |
---|---|
Title of host publication | 31st International Conference on VLSI Design and 17th International Conference on Embedded Systems |
Publisher | IEEE |
Pages | 283-288 |
Number of pages | 6 |
ISBN (Electronic) | 9781538636923 |
DOIs | |
Publication status | Published - 29 Mar 2018 |
Event | 31st International Conference on VLSI Design 2018 - Pune, India Duration: 6 Jan 2018 → 10 Jan 2018 |
Conference
Conference | 31st International Conference on VLSI Design 2018 |
---|---|
Abbreviated title | VLSID 2018 |
Country/Territory | India |
City | Pune |
Period | 6/01/18 → 10/01/18 |
Keywords
- Distributed Arithmetic (DA)
- finite impulse response (FIR)
- look up table (LUT)
- offset binary coding (OBC).
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering