Low-Area and High-Throughput Architecture for an Adaptive Filter Using Distributed Arithmetic

A high-performance implementation scheme for a least mean square adaptive filter is presented. The architecture is based on distributed arithmetic in which the partial products of filter coefficients are precomputed and stored in lookup tables (LUTs) and the filtering is done by shift-and-accumulate...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on circuits and systems. II, Express briefs Jg. 60; H. 11; S. 781 - 785
Hauptverfasser: Prakash, M. Surya, Shaik, Rafi Ahamed
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.11.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Adaptive filter
Adaptive filters
Architecture
Arithmetic
Clocks
Consumption
distributed arithmetic (DA)
Filtering
Filtration
finite impulse response (FIR)
Finite impulse response filters
least mean square (LMS)
Least mean squares algorithm
Least squares approximations
lookup table (LUT)
Lookup tables
offset binary coding (OBC)
Registers
Table lookup
Throughput
ISSN:1549-7747, 1558-3791
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A high-performance implementation scheme for a least mean square adaptive filter is presented. The architecture is based on distributed arithmetic in which the partial products of filter coefficients are precomputed and stored in lookup tables (LUTs) and the filtering is done by shift-and-accumulate operations on these partial products. In the case of an adaptive filter, it is required that the filter coefficients be updated and, hence, these LUTs are to be recalculated. A new strategy based on the offset binary coding scheme has been proposed in order to update these LUTs from time to time. Simulation results show that the proposed scheme consumes very less chip area and operates at high throughput for large base unit size k ( = N/m) , where m is an integer and N is the number of filter coefficients. For example, a 128-tap finite-impulse-response adaptive filter with the proposed implementation produces 12 times more throughput (for k = 8) and consumes almost 26% less area when compared to the best of existing architectures.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2013.2281747