When digital filters are designed with power-of-two 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 is designed to find and update the power-of-two coefficients of an adaptive filter. 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 fact that the coefficients are power-of-two, yields in computational complexity of O(N) additions and no multiplications. Examples are given for adaptive linear prediction. The results are very promising and illustrative the performance of the new algorithm.
|Original language||English (US)|
|Number of pages||5|
|Journal||Conference Record of the Asilomar Conference on Signals, Systems and Computers|
|State||Published - Jan 1 2001|
ASJC Scopus subject areas
- Signal Processing
- Computer Networks and Communications