ScholarLens Back to search
2006•Journal of Wuhan University of Science and TechnologyRequires access

A Fast Algorithm for Determining the Stability of Filter with Integer Coefficients

Feng Qin-rong

Open publisher page 0 citations

Abstract

In the design of filter,especially for the real time signal processing,the demand on the filter performance is not as high as that on the filter velocity.And in this case,a simple integer-coefficients filter is a wise choice,and quick determination of whether the integer-coefficients filter is stable is crucial.This paper offers a fast algorithm for determining the stability of filter with integer coefficients,whose complexity is O(n~2),where n is the degree of denominator of transmission function of simulated filter.

About this research paper

What this paper is about

In the design of filter,especially for the real time signal processing,the demand on the filter performance is not as high as that on the filter velocity.And in this case,a simple integer-coefficients filter is a wise choice,and quick determination of whether the integer-coefficients filter is stable is crucial.This paper offers a fast algorithm for determining the stability of filter with integer coefficients,whose complexity is O(n~2),where n is the degree of denominator of transmission function of simulated filter.

Why it matters

A significance statement is not available in the OpenAlex record.

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

In the design of filter,especially for the real time signal processing,the demand on the filter performance is not as high as that on the filter velocity.And in this case,a simple integer-coefficients filter is a wise choice,and quick determination of whether the integer-coefficients filter is stable is crucial.This paper offers a fast algorithm for determining the stability of filter with integer coefficients,whose complexity is O(n~2),where n is the degree of denominator of transmission function of simulated filter.

Key concepts: Filter design, Filter (signal processing), Integer (computer science), Kernel adaptive filter, Algorithm, Mathematics, Stability (learning theory), Root-raised-cosine filter

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Fast Algorithm for Determining the Stability of Filter with Integer Coefficients — Research Paper | ScholarLens