Multiplierless adaptive filtering

Tamal Bose, Anand Venkatachalam, Ratchaneekorn Thamvichai

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


When digital filters are designed with power-of-2 coefficients, the multiplications can be implemented by simple shifting operations. For VLSI implementations, multiplierless filters are faster and more compact than filters with multipliers. In this paper, an algorithm for finding and updating the power-of-2 coefficients of an adaptive filter is designed. The new method uses the well-known Genetic Algorithm (GA) for this purpose. The GA is used in a unique way in order to reduce computations. Small blocks of data are used for the GA and only one new generation is produced per sample of data. This, coupled with the fact that the coefficients are power-of-2, yields a computational complexity of O (N) additions and no multiplications. The algorithm is investigated for applications in adaptive linear prediction and system identification. The results are very promising and illustrate the performance of the new algorithm.

Original languageEnglish (US)
Pages (from-to)107-118
Number of pages12
JournalDigital Signal Processing: A Review Journal
Issue number1
StatePublished - Jan 2002

ASJC Scopus subject areas

  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Statistics, Probability and Uncertainty
  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'Multiplierless adaptive filtering'. Together they form a unique fingerprint.

Cite this