A new approach to finite wordlength coefficient fir digital filter design using the branch and bound technique

It has been shown that the branch and bound technique is effective for the design of finite wordlength optimal digital filters. This technique is however expensive in computing time. In this paper, we present a robust branch and bound branching strategy named Sequential and Progressive Search, impro...

Full description

Saved in:
Bibliographic Details
Published in2000 10th European Signal Processing Conference pp. 1 - 4
Main Authors Belbachir, A. N., Boulerial, B., Belbachir, M. F.
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.09.2000
Subjects
Algorithm design and analysis
Algorithms
Computational efficiency
Digital filters
Filtering algorithms
Finite impulse response filters
Frequency response
Mathematical analysis
Microprocessors
Optimization
Searching
Signal processing algorithms
Simulated annealing
Strategy
Online AccessGet full text

Cover

More Information
Summary:It has been shown that the branch and bound technique is effective for the design of finite wordlength optimal digital filters. This technique is however expensive in computing time. In this paper, we present a robust branch and bound branching strategy named Sequential and Progressive Search, improving the design of filters on a large wordlength processor in a reasonable computing cost. The details of the algorithm and many examples are given and compared to the other methods.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISBN:9789521504433
9521504439