NON-MINIMAL REALIZATIONS OF FIXED-POINT DIGITAL FILTERS THAT ARE FREE OF ALL FINITE WORD-LENGTH LIMIT CYCLES.

Adly T. Fam; Casper W. Barnes

NON-MINIMAL REALIZATIONS OF FIXED-POINT DIGITAL FILTERS THAT ARE FREE OF ALL FINITE WORD-LENGTH LIMIT CYCLES.

Adly T. Fam
, Casper W. Barnes

Department of Electrical Engineering

Research output: Contribution to conference › Paper › peer-review

Abstract

Every linearly stable, fixed-point digital filter has a realization, using standard two's complement arithmetic with rounding, that will be free of all autonomous finite-word limit cycles. Specific structures that will achieve this condition, consisting of combinations of transversal structures and recursive structures, are derived using a state-space formalism. Freedom from limit cycles is obtained by a design procedure that reduces the norm of the matrix in the recursive feedback loop.

Original language	English
Pages	244-248
Number of pages	5
State	Published - 1978
Event	Rec Asilomar Conf Circuits Syst Comput 12th Annu - Pacific Grove, CA, USA Duration: Nov 6 1978 → Nov 8 1978

Conference

Conference	Rec Asilomar Conf Circuits Syst Comput 12th Annu
City	Pacific Grove, CA, USA
Period	11/6/78 → 11/8/78

Cite this

@conference{72d05d74cb29444799b5dcbb279dd25b,

title = "NON-MINIMAL REALIZATIONS OF FIXED-POINT DIGITAL FILTERS THAT ARE FREE OF ALL FINITE WORD-LENGTH LIMIT CYCLES.",

abstract = "Every linearly stable, fixed-point digital filter has a realization, using standard two's complement arithmetic with rounding, that will be free of all autonomous finite-word limit cycles. Specific structures that will achieve this condition, consisting of combinations of transversal structures and recursive structures, are derived using a state-space formalism. Freedom from limit cycles is obtained by a design procedure that reduces the norm of the matrix in the recursive feedback loop.",

author = "Fam, \{Adly T.\} and Barnes, \{Casper W.\}",

year = "1978",

language = "English",

pages = "244--248",

note = "Rec Asilomar Conf Circuits Syst Comput 12th Annu ; Conference date: 06-11-1978 Through 08-11-1978",

}

TY - CONF

T1 - NON-MINIMAL REALIZATIONS OF FIXED-POINT DIGITAL FILTERS THAT ARE FREE OF ALL FINITE WORD-LENGTH LIMIT CYCLES.

AU - Fam, Adly T.

AU - Barnes, Casper W.

PY - 1978

Y1 - 1978

N2 - Every linearly stable, fixed-point digital filter has a realization, using standard two's complement arithmetic with rounding, that will be free of all autonomous finite-word limit cycles. Specific structures that will achieve this condition, consisting of combinations of transversal structures and recursive structures, are derived using a state-space formalism. Freedom from limit cycles is obtained by a design procedure that reduces the norm of the matrix in the recursive feedback loop.

AB - Every linearly stable, fixed-point digital filter has a realization, using standard two's complement arithmetic with rounding, that will be free of all autonomous finite-word limit cycles. Specific structures that will achieve this condition, consisting of combinations of transversal structures and recursive structures, are derived using a state-space formalism. Freedom from limit cycles is obtained by a design procedure that reduces the norm of the matrix in the recursive feedback loop.

UR - https://www.scopus.com/pages/publications/0018285369

M3 - Paper

AN - SCOPUS:0018285369

SP - 244

EP - 248

T2 - Rec Asilomar Conf Circuits Syst Comput 12th Annu

Y2 - 6 November 1978 through 8 November 1978

ER -

NON-MINIMAL REALIZATIONS OF FIXED-POINT DIGITAL FILTERS THAT ARE FREE OF ALL FINITE WORD-LENGTH LIMIT CYCLES.

Abstract

Conference

Other files and links

Fingerprint

Cite this