Title :
Complexity comparison between FFT and DCT based real data Wigner processors
Author_Institution :
Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA
Abstract :
The symmetry of the discrete Wigner distribution (DWD) kernel input and the corresponding DWD output is used to develop an N-point DWD processor that outputs two DWD slices per N/2-point fast Fourier transform (FFT) subsystem. The overhead associated with FFT size reduction and kernel generation are shown to be less than that of the short-time Fourier transform magnitude (STFTM), given an equivalent reduction in FFT size, and the conclusion of double throughput for the DWD over that of the STFTM is validated. An alternative discrete-cosine-transform-based DWD processor is proposed where factorization is performed directly on the cosine matrix and compared in terms of computational complexity to radix-two, radix-four, and radix-2/4 FFT-based DWD processors.<>
Keywords :
computational complexity; computerised signal processing; fast Fourier transforms; spectral analysis; computational complexity; cosine matrix; digital signal processing; discrete Wigner distribution; factorization; fast Fourier transform; kernel generation; real data Wigner processors; short-time Fourier transform magnitude; Computational complexity; Counting circuits; Data engineering; Digital signal processing; Discrete Fourier transforms; Discrete cosine transforms; Fourier transforms; Kernel; Throughput; Time frequency analysis;
Conference_Titel :
System Theory, 1988., Proceedings of the Twentieth Southeastern Symposium on
Conference_Location :
Charlotte, NC, USA
Print_ISBN :
0-8186-0847-1
DOI :
10.1109/SSST.1988.17086