ABSTRACT
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applications, such as finite impulse response (FIR) filters and linear transforms. Although low-complexity high-performance multiplier architectures have been proposed for the constant multiplications, the area and delay optimization of the MCM operation has often been accomplished by synthesizing the constant multiplications using only addition/subtraction and shifting operations in the shift-adds architecture. To obtain further reductions in area, delay, and power consumption in the shift-adds design of the MCM operation, efficient high-level algorithms have also been proposed. In this paper, we introduce a computer-aided design tool for the synthesis of low-complexity digital FIR filters that includes both high and low level synthesis phases. In the high-level synthesis phase, the MCM operation is optimized in terms of high-level area and delay parameters and the digital FIR filter with the optimized MCM operation is implemented at gate-level in the low-level synthesis phase. It is observed from the experimental results that the design of the MCM operation in shifts-add architecture with the use of high-level algorithms achieves significant area improvements on filter implementations with respect to designs whose MCM operations are implemented in array multiplier architecture.
- L. Aksoy, E. Costa, P. Flores, and J. Monteiro. Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications. IEEE TCAD, 27(6):1013--1026, 2008. Google ScholarDigital Library
- L. Aksoy and E. O. Gunes. An Approximate Algorithm for the Multiple Constant Multiplications Problem. In SBCCI, pages 58--63, 2008. Google ScholarDigital Library
- L. Aksoy, E. O. Gunes, and P. Flores. An Exact Breadth-First Search Algorithm for the Multiple Constant Multiplications Problem. In Norchip, pages 41--46, 2008.Google ScholarCross Ref
- L. Aksoy, E. O. Gunes, and P. Flores. Optimization of Area under a Delay Constraint in Multiple Constant Multiplications. In WSEAS ICC, accepted for publication, 2009. Google ScholarDigital Library
- A. Avizienis. Signed-digit Number Representation for Fast Parallel Arithmetic. IRE Tran. on Electronic Computers, EC-10:389--400, 1961.Google ScholarCross Ref
- P. Cappello and K. Steiglitz. Some Complexity Issues in Digital Signal Processing. IEEE Tran. on Acoustics, Speech, and Signal Processing, 32(5):1037--1041, 1984.Google Scholar
- E. Costa, S. Bampi, and J. Monteiro. A New Architecture for Signed Radix 2m Pure Array Multipliers. In ICCD, pages 112--117, 2002. Google ScholarDigital Library
- S. Demirsoy, A. Dempster, and I. Kale. Power Analysis of Multiplier Blocks. In ISCAS, pages 297--300, 2002.Google ScholarCross Ref
- A. Dempster, S. Demirsoy and I. Kale. Designing Multiplier Blocks with Low Logic Depth. In ISCAS, pages 773--776, 2002.Google ScholarCross Ref
- A. Dempster and M. Macleod. Use of Minimum-Adder Multiplier Blocks in FIR Digital Filters. IEEE TCAS II, 42(9):569--577, 1995.Google Scholar
- W. L. Gallagher and E. E. Swartzlander. High Radix Booth Multipliers using Reduced Area Adder Trees. In Asilomar Conference on Signals, Systems and Computers, pages 545--549, 1994.Google ScholarCross Ref
- O. Gustafsson and L. Wanhammar. ILP Modelling of the Common Subexpression Sharing Problem. In ICECS, pages 1171--1174, 2002.Google ScholarCross Ref
- R. Hartley. Subexpression Sharing in Filters using Canonic Signed Digit Multipliers. IEEE TCAS II, 43(10):677--688, 1996.Google Scholar
- A. Hosangadi, F. Fallah, and R. Kastner. Simultaneous Optimization of Delay and Number of Operations in Multiplierless Implementation of Linear Systems. In IWLS, 2005.Google Scholar
- K. Johansson, O. Gustafsson, and L. Wanhammar. Bit-Level Optimization of Shift-and-Add Based FIR Filters. In ICECS, pages 713--716, 2007.Google ScholarCross Ref
- H-J. Kang and I-C. Park. FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders. IEEE TCAS II, 48(8):770--777, 2001.Google Scholar
- H. Nguyen and A. Chatterjee. Number-Splitting with Shift-and-Add Decomposition for Power and Hardware Optimization in Linear DSP Synthesis. IEEE Tran. on VLSI, 8(4):419--424, 2000. Google ScholarDigital Library
- I-C. Park and H-J. Kang. Digital Filter Synthesis Based on Minimal Signed Digit Representation. In DAC, pages 468--473, 2001. Google ScholarDigital Library
- Y. Voronenko and M. Püschel. Multiplierless Multiple Constant Multiplication. ACM Tran. on Algorithms, 3(2), 2007. Google ScholarDigital Library
- C. S. Wallace. A Suggestion for a Fast Multiplier. IEEE Tran. on Electronic Computers, 13(1):14--17, 1964.Google ScholarCross Ref
Index Terms
- Design of low complexity digital FIR filters
Recommendations
A Tutorial on Multiplierless Design of FIR Filters: Algorithms and Architectures
Finite impulse response (FIR) filtering is a ubiquitous operation in digital signal processing systems and is generally implemented in full custom circuits due to high-speed and low-power design requirements. The complexity of an FIR filter is dominated ...
Design of digit-serial FIR filters: algorithms, architectures, and a CAD tool
In the last two decades, many efficient algorithms and architectures have been introduced for the design of low-complexity bit-parallel multiple constant multiplications (MCM) operation which dominates the complexity of many digital signal processing ...
Hybrid structures for low-complexity variable fractional-delay FIR filters
This paper proposes a pair of new structures for implementing low-complexity odd-order and even-order variable fractional-delay (VFD) FIR filters using hybrid structures with both even-order and odd-order subfilters. For odd-order VFD filter design, the ...
Comments