New Approach to Look-Up-Table Design and Memory-Based Realization of FIR Digital Filter
Author:
- Pramod Kumar MeherPMPramod Kumar Meher
- 18 December 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 57 (3) , 592-603
Abstract
Distributed arithmetic (DA)-based computation is popular for its potential for efficient memory-based implementation of finite impulse response (FIR) filter where the filter outputs are computed as inner-product of input-sample vectors and filter-coefficient vector. In this paper, however, we show that the look-up-table (LUT)-multiplier-based approach, where the memory elements store all the possible values of products of the filter coefficients could be an area-efficient alternative to DA-based design of FIR filter with the same throughput of implementation. By operand and inner-product decompositions, respectively, we have designed the conventional LUT-multiplier-based and DA-based structures for FIR filter of equivalent throughput, where the LUT-multiplier-based design involves nearly the same memory and the same number of adders, and less number of input register at the cost of slightly higher adder-widths than the other. Moreover, we present two new approaches to LUT-based multiplication, which could be used to reduce the memory size to half of the conventional LUT-based multiplication. Besides, we present a modified transposed form FIR filter, where a single segmented memory-core with only one pair of decoders are used to minimize the combinational area. The proposed LUT-based FIR filter is found to involve nearly half the memory-space and $(1/N)$ times the complexity of decoders and input-registers, at the cost of marginal increase in the width of the adders, and additional $\sim(4N\times W)$ AND-OR-INVERT gates and $\sim(2N\times W)$ NOR gates. We have synthesized the DA-based design and LUT-multiplier based design of 16-tap FIR filters by Synopsys Design Compiler using TSMC 90 nm library, and find that the proposed LUT-multiplier-based design involves nearly 15% less area than the DA-based design for the same throughput and lower latency of implementation.
Keywords
This publication has 25 references indexed in Scilit:
- A Fully Pipelined Multiplierless Architecture for 2D Convolution with Quadrant Symmetric Kernels2006
- Trends and challenges of large scale embedded memories2004
- Area-delay tradeoff in distributed arithmetic based implementation of FIR filters2002
- Efficient ROM size reduction for distributed arithmetic2002
- A systolic array algorithm for an efficient unified memory-based implementation of the inverse discrete cosine and sine transforms1999
- Computational RAM: implementing processors in memoryIEEE Design & Test of Computers, 1999
- On the design automation of the memory-based VLSI architectures for FIR filtersIEEE Transactions on Consumer Electronics, 1993
- On the realization of discrete cosine transform using the distributed arithmeticIEEE Transactions on Circuits and Systems I: Regular Papers, 1992
- The efficient memory-based VLSI array designs for DFT and DCTIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992
- A new adaptive noise cancellation scheme in the presence of crosstalk (speech signals)IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992