ScholarLens Back to search
1981•IEEE Transactions on Circuits and SystemsRequires access

Comparison of optimal and local search methods for designing finite wordlength FIR digital filters

Dušan M. Kodek, K. Steiglitz

Open publisher page 91 citations

Abstract

This paper presents a comparison between an optimal (branch-and-bound) algorithm and a suboptimal (loca search) algorithm for the design of finite wordlength finite-impulse-response (FIR) digital filters. Experimental results are described for 11 examples of length 15 to 35. We conclude that when computer resources are not available for the optimal method, it is still worth applying the local search method to the filter with rounded coefficients.

About this research paper

What this paper is about

This paper presents a comparison between an optimal (branch-and-bound) algorithm and a suboptimal (loca search) algorithm for the design of finite wordlength finite-impulse-response (FIR) digital filters. Experimental results are described for 11 examples of length 15 to 35. We conclude that when computer resources are not available for the optimal method, it is still worth applying the local search method to the filter with rounded coefficients.

Why it matters

OpenAlex reports 91 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a comparison between an optimal (branch-and-bound) algorithm and a suboptimal (loca search) algorithm for the design of finite wordlength finite-impulse-response (FIR) digital filters. Experimental results are described for 11 examples of length 15 to 35. We conclude that when computer resources are not available for the optimal method, it is still worth applying the local search method to the filter with rounded coefficients.

Key concepts: Finite impulse response, Digital filter, Algorithm, Linear filter, Mathematics, Infinite impulse response, Mathematical optimization, Impulse response

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Comparison of optimal and local search methods for designing finite wordlength FIR digital filters — Research Paper | ScholarLens