Algebraic methods for the analysis and design of time-frequency signal processing algorithms

Some results on the study of algebraic methods for the analysis and design of time-frequency signal processing algorithms are presented. A time-frequency signal is defined as a signal whose spectral characteristics vary with time. Time-frequency signal processing is the mathematical treatment of signals with the objective of extracting relevant information. The processing of time-frequency signals is accomplished through the development of suitable algorithms. Emphasis placed on the analysis, design, and modification of time-frequency algorithms for machine implementation, and on the development of an environment to assist on this implementation. This environment is termed a computational mathematics environment (CME).<<ETX>>

[1]  Shmuel Winograd,et al.  Computing the ambiguity surface , 1985, IEEE Trans. Acoust. Speech Signal Process..

[2]  R. W. Johnson,et al.  A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures , 1990 .

[3]  D. Rodriguez.  Tensor product algebra as a tool for VLSI implementation of the discrete Fourier transform , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[4]  W. Kozek,et al.  Time-frequency signal processing based on the Wigner-Weyl framework , 1992, Signal Process..

[5]  Mark J. Shensa,et al.  The discrete wavelet transform: wedding the a trous and Mallat algorithms , 1992, IEEE Trans. Signal Process..