Two High-Performance Adaptive Filter Implementation Schemes Using Distributed Arithmetic

doi:10.1109/TCSII.2011.2161168

Two High-Performance Adaptive Filter Implementation Schemes Using Distributed Arithmetic

2011-09-01

59

PRE

AI

DOI：10.1109/TCSII.2011.2161168

原文链接

原文求助

摘要

En 中文

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.

Keyword:

Adaptive filter

distributed arithmetic (DA)

finite-impluse response (FIR)

least mean square (LMS)

lookup table (LUT)

multiply accumulate ( MAC)

offset-binary coding (OBC)

Two High-Performance Adaptive Filter Implementation Schemes Using Distributed Arithmetic

摘要

AI总结

期刊

机构