Computable minimum lattice-like ARMA synthesis

A cascade synthesis for autoregressive moving-average (ARMA) digital filters, which uses the minimum number of delay elements (the degree of the transfer function in z), is described. The resulting structure results in the very convenient lattice from when the zeros of the transmission are not on th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems 1988-05, Vol.35 (5), p.577-583
Main Authors: Newcomb, R., El-Leithy, N., Rodellar, V., Gomez, P., Cordoba, M.
Format: Article
Language:English
Subjects:
Applied sciences
Circuit properties
Concurrent computing
Delay
Digital filters
Electric, optical and optoelectronic circuits
Electronic circuits
Electronics
Entropy
Exact sciences and technology
Filtering theory
Frequency filters
Laboratories
Lattices
Reflection
Scattering parameters
Transfer functions
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A cascade synthesis for autoregressive moving-average (ARMA) digital filters, which uses the minimum number of delay elements (the degree of the transfer function in z), is described. The resulting structure results in the very convenient lattice from when the zeros of the transmission are not on the unit circle. The theory rests on conversion to scattering parameters and the use of a Richards' function, valid for complex zeros of rational functions with complex coefficients. Results of zeros of transmission on the unit circle are obtained by a parallel combination of lattices. By a suitable transformation, the sections are made computable while preserving the cascade form.< >
ISSN:0098-4094
1558-1276
DOI:10.1109/31.1787