Design of low complexity digital FIR filters

  • Authors:
  • Levent Aksoy;Diego Jaccottet;Eduardo Costa

  • Affiliations:
  • Istanbul Technical University, Istanbul, Turkey;Universidade Catolica de Pelotas, Pelotas-RS, Brazil;Universidade Catolica de Pelotas, Pelotas-RS, Brazil

  • Venue:
  • Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.