2000
DOI: 10.1109/82.847077
|View full text |Cite
|
Sign up to set email alerts
|

Power-of-two adaptive filters using tabu search

Abstract: Digital filters with power-of-two or a sum of power-of-two coefficients can be built using simple and fast shift registers instead of slower floating-point multipliers, such a strategy can reduce both the VLSI silicon area and the computational time. Due to the quantization and the nonuniform distribution of the coefficients through their domain, in the case of adaptive filters, classical steepest descent based approaches cannot be successfully applied. Methods for adaptation processes, as in the least mean sq… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2002
2002
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…The optimisation process is handled with the non-dominated sorting genetic algorithm (NSGA-II) in its second version. Evolutionary algorithms are already manipulated for the optimisation of IIR filter stability (Ma and Cowan, 1996) and FIR filters (Traferro et al, 1999;Traferro and Uncini, 2000).…”
Section: Introductionmentioning
confidence: 99%
“…The optimisation process is handled with the non-dominated sorting genetic algorithm (NSGA-II) in its second version. Evolutionary algorithms are already manipulated for the optimisation of IIR filter stability (Ma and Cowan, 1996) and FIR filters (Traferro et al, 1999;Traferro and Uncini, 2000).…”
Section: Introductionmentioning
confidence: 99%
“…This approach has become very popular and many different algorithms have been proposed. These include the linear programming technique [4,9,12], the stochastic optimization techniques such as simulated annealing [1,2,5], tabu search [15], simulated evolution [14], and other heuristic methods such as the proportional relation-preserve method [21].…”
Section: Introductionmentioning
confidence: 99%
“…The tabu search (TS) algorithm which is based on the general tenets of intelligent problem solving is a modern heuristic developed particularly for combinatorial optimisation problems. Although it has been proposed for combinatorial problems, it has also produced efficient solutions for numeric problems, too (Glover, 1986;Osman, 1991;Ni Guangzhen and Yan, 1998;Fanni et al, 1999;Traferro and Uncini, 2000;Machado et al, 2001). A basic version of the algorithm employs a neighbourhood search mechanism and uses deterministic transition rules to improve solutions.…”
Section: Introductionmentioning
confidence: 99%