Performance analysis of DA based adaptive FIR filter using FPGA

In this paper, the performance is analyzed based on operating speed, area and memory requirement for the least mean square (LMS) adaptive finite impulse response (FIR) filter using distributed arithmetic (DA). DA technique performs the convolution operation by replacing multipliers with look up tables that result in low resource utilization and high throughput. The throughput and resource utilization factors are related with the number of taps in the DA base unit and these DA base units are required to reduce the memory size and to provide fast updating of memory contents. In this paper, we also analyzed the effect of the number of taps in DA base unit on the memory usage and operating speed of the adaptive FIR filter design.

[1]  S. Haykin,et al.  Adaptive Filter Theory , 1986 .

[2]  S. Chivapreecha,et al.  Distributed arithmetic LMS adaptive filter implementation without look-up table , 2012, 2012 9th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology.

[3]  J. Mavor,et al.  New digital adaptive-filter implementation using distributed-arithmetic techniques , 1981 .

[4]  Venkatesh Krishnan,et al.  Implementation of an LMS adaptive filter on an FPGA employing multiplexed multiplier architecture , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[5]  Rafiahamed Shaik,et al.  Low power and less complex implementation of fast block LMS adaptive filter using distributed arithmetic , 2011, IEEE Technology Students' Symposium.

[6]  S.A. White,et al.  Applications of distributed arithmetic to digital signal processing: a tutorial review , 1989, IEEE ASSP Magazine.

[7]  Rui Guo,et al.  Two High-Performance Adaptive Filter Implementation Schemes Using Distributed Arithmetic , 2011, IEEE Transactions on Circuits and Systems II: Express Briefs.