Two High-Performance Adaptive Filter Implementation Schemes Using Distributed Arithmetic
Citations Over TimeTop 10% of 2011 papers
Abstract
Distributed arithmetic (DA) is performed to design bit-level architectures for vector-vector multiplication with a direct application for the implementation of convolution, which is necessary for digital filters. In this brief, two novel DA-based implementation schemes are proposed for adaptive finite-impulse response filters. Different from conventional DA techniques, our proposed schemes use coefficients as addresses to access a series of lookup tables (LUTs) storing sums of delayed and scaled input samples. Two smart LUT updating methods are developed, and least-mean-square adaptation is performed to update the weights and minimize the mean square error between the estimated and desired output. Results show that our two high-performance designs achieve high speed, low computation complexities, and low area cost.
Related Papers
- → New approach to LUT implementation and accumulation for memory-based multiplication(2009)31 cited
- → FPGA Implementation of an Optimized Coefficients Pulse Shaping FIR Filters(2006)4 cited
- EFFICIENT FPGA REALIZATION OF DA-BASED RECONFIGURABLE FIR DIGITAL FILTER(2015)
- Improvement of The FIR Multiplication Module Based on FPGA(2009)
- Enhanced LUT for Modified Distributed Arithematic Architecture - FIR Filter(2013)