The Community for Technology Leaders
Green Image
Issue No. 12 - December (1970 vol. 19)
ISSN: 0018-9340
pp: 1139-1145
ABSTRACT
It is shown that the inverse transform of a rational fraction (in s or z frequency variable) can be computed by a "real-time deconvolver." Previous techniques (such as those of Fielder, Pierre, Stanley?Reis, and Ahmed?Rao) are deduced in a natural way both for continuous and sampled-data systems. Since the new method is obtained by considering the ratio of a transformed output sequence to a transformed input sequence, it also provides a procedure for dividing two power series, hence "on-line" linear system identification. Deconvolution then appears as the link between linear systems and automata and suggests a metamodel for algorithm representation.
INDEX TERMS
Algorithm representations, combinatorial analysis, deconvolution, error propagation, indentification, ladder networks, polymaton, real-time processing, spectral transforms.
CITATION

M. Depeyrot, "Linear System Identification Using Real-Time Deconvolution," in IEEE Transactions on Computers, vol. 19, no. , pp. 1139-1145, 1970.
doi:10.1109/T-C.1970.222852
171 ms
(Ver 3.3 (11022016))