Multiplierless adaptive filtering

Tamal Bose, Anand Venkatachalam, Ratchaneekorn Thamvichai

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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
Volume12
Issue number1
DOIs
StatePublished - Jan 2002
Externally publishedYes

Fingerprint

Adaptive filtering
Genetic algorithms
Adaptive filters
Digital filters
Computational complexity
Identification (control systems)

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Multiplierless adaptive filtering. / Bose, Tamal; Venkatachalam, Anand; Thamvichai, Ratchaneekorn.

In: Digital Signal Processing: A Review Journal, Vol. 12, No. 1, 01.2002, p. 107-118.

Research output: Contribution to journalArticle

Bose, Tamal ; Venkatachalam, Anand ; Thamvichai, Ratchaneekorn. / Multiplierless adaptive filtering. In: Digital Signal Processing: A Review Journal. 2002 ; Vol. 12, No. 1. pp. 107-118.
@article{ff20310e73b448a7bd42002f173d4bff,
title = "Multiplierless adaptive filtering",
abstract = "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.",
author = "Tamal Bose and Anand Venkatachalam and Ratchaneekorn Thamvichai",
year = "2002",
month = "1",
doi = "10.1006/dspr.2001.0407",
language = "English (US)",
volume = "12",
pages = "107--118",
journal = "Digital Signal Processing: A Review Journal",
issn = "1051-2004",
publisher = "Elsevier Inc.",
number = "1",

}

TY - JOUR

T1 - Multiplierless adaptive filtering

AU - Bose, Tamal

AU - Venkatachalam, Anand

AU - Thamvichai, Ratchaneekorn

PY - 2002/1

Y1 - 2002/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036170135&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036170135&partnerID=8YFLogxK

U2 - 10.1006/dspr.2001.0407

DO - 10.1006/dspr.2001.0407

M3 - Article

AN - SCOPUS:0036170135

VL - 12

SP - 107

EP - 118

JO - Digital Signal Processing: A Review Journal

JF - Digital Signal Processing: A Review Journal

SN - 1051-2004

IS - 1

ER -