Recent Developments in Statistical Signal Processing

Publisher Summary Determining optimal algorithms and implementing the optimal algorithms are the two major aspects of statistical signal processing. There is considerable scope for application of ideas from linear system theory. One way to restrict complexity is to make further assumptions on the problem. A very common one in the last two decades has been to assume that there is an underlying finite-dimensional state-space model for the problem, in which case the memory can be fixed at the size of the state vector; however, the resulting filters will still be time variant. In any case, the important point is that these new results make for a much more direct link between signal processing theory and digital circuit implementations. This offers some promise in significantly reducing the software bottlenecks encountered in fitting all algorithms into simple general purpose architecture.

[1]  Daniel T. L. Lee.  Canonical ladder form realizations and fast estimation algorithms , 1980 .

[2]  Thomas Kailath,et al.  Schur and Levinson algorithms for nonstationary processes , 1981, ICASSP.

[3]  A tree classification of algorithms for Toeplitz and related equations including generalized Levinson and doubling type algoritms , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[4]  T. Kailath,et al.  Generalized Schur Parametrization of Nonstationary Second-Order Processes , 1982 .

[5]  Thomas Kailath,et al.  Optimized lattice-form adaptive line enhancer for a sinusoidal signal in broad-band noise , 1981 .

[6]  Jack E. Volder.  The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..

[7]  M. Morf,et al.  Recursive least squares ladder estimation algorithms , 1981 .

[8]  J. S. Walther,et al.  A unified algorithm for elementary functions , 1899, AFIPS '71 (Spring).

[9]  Thomas Kailath,et al.  Displacement ranks of a matrix , 1979 .

[10]  L. Ljung,et al.  Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems , 1978 .

[11]  On generalized Schur and Levinson-Szego algorithms for quasistationary processes , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[12]  Jean-Marc Delosme.  Algorithms for finite shift-rank processes , 1982 .

[13]  C. Samson.  A unified treatment of fast algorithms for identification , 1982 .

[14]  L. Ljung,et al.  New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices , 1979 .

[15]  Sun-Yuan Kung.  VLSI Array Processor for Signal Processing. , 1982 .

[16]  M. Morf.  Fast Algorithms for Multivariable Systems , 1974 .

[17]  Martin Morf,et al.  Doubling algorithms for Toeplitz and related equations , 1980, ICASSP.

[18]  M. Morf,et al.  Ladder forms for identification and speech processing , 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.

[19]  M. Morf,et al.  A VLSI speech analysis chip set based on square root normalized ladder forms , 1981, ICASSP.

[20]  Martin Morf,et al.  Fast Algorithms for Speech Modeling. , 1978 .

[21]  M. Morf,et al.  Displacement ranks of matrices and linear equations , 1979 .

[22]  M. Morf,et al.  Inverses of Toeplitz operators, innovations, and orthogonal polynomials , 1975, 1975 IEEE Conference on Decision and Control including the 14th Symposium on Adaptive Processes.

[23]  Hassan Masud Ahmed.  Signal processing algorithms and architectures , 1982 .

[24]  H. T. Kung.  Let's Design Algorithms for VLSI Systems , 1979 .

[25]  Jean-Marc Delosme,et al.  Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.

[26]  David Y. Y. Yun,et al.  Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.