The computational complexity of time-frequency distributions
暂无分享,去创建一个
[1] C. Thompson. Area-time complexity for VLSI , 1979, STOC 1979.
[2] Jean Vuillemin,et al. A combinatorial limit to the computing power of V.L.S.I. circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[3] S. Winograd. Arithmetic complexity of computations , 1980 .
[4] Jean Vuillemin,et al. A Combinatorial Limit to the Computing Power of VLSI Circuits , 1983, IEEE Transactions on Computers.
[5] Thompson. Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.
[6] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .
[7] Shmuel Winograd,et al. Computing the ambiguity surface , 1985, IEEE Trans. Acoust. Speech Signal Process..
[8] Françoise Peyrin,et al. A unified definition for the discrete-time, discrete-frequency, and discrete-time/Frequency Wigner distributions , 1986, IEEE Trans. Acoust. Speech Signal Process..
[9] Boualem Boashash,et al. An efficient real-time implementation of the Wigner-Ville distribution , 1987, IEEE Trans. Acoust. Speech Signal Process..
[10] T. Saramaki,et al. Efficient multirate realization for narrow transition-band FIR filters , 1988, 1988., IEEE International Symposium on Circuits and Systems.
[11] Stéphane Mallat,et al. Multifrequency channel decompositions of images and wavelet models , 1989, IEEE Trans. Acoust. Speech Signal Process..
[12] Martin Vetterli,et al. Wavelets and filter banks: relationships and new results , 1990, International Conference on Acoustics, Speech, and Signal Processing.
[13] Garry M. Jacyna,et al. WIGNER TRANSFORMS, GABOR COEFFICIENTS, AND WEYL-HEISENBERG WAVELETS , 1991 .