Recursive Computation of Trispectrum

Khalid Mahmood AAMIR; Mohammad Ali MAUD; Asim LOAN

doi:10.1093/ietfec/e89-a.10.2914

Recursive Computation of Trispectrum

Khalid Mahmood AAMIR, Mohammad Ali MAUD, Asim LOAN

Full Text Views

0

Share
Cite this

Summary :

If the signal is not Gaussian, then the power spectral density (PSD) approach is insufficient to analyze signals and we resort to estimate the higher order spectra of the signal. However, estimation of the higher order spectra is even more time consuming, for example, the complexity of trispectrum is O(N ⁴). This problem becomes even more serious when short time Fourier transform (STFT) is computed - computation of the trispectrum is required after every shift of the window. In this paper, a method to recursively compute trispectrum has been presented and it is shown that the computational complexity, for a window size of N, is reduced to be O(N ³) and is the same as the space complexity.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.10 pp.2914-2916

Publication Date: 2006/10/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.10.2914

Type of Manuscript: LETTER

Category: Digital Signal Processing

Cite this

Copy

Khalid Mahmood AAMIR, Mohammad Ali MAUD, Asim LOAN, "Recursive Computation of Trispectrum" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 10, pp. 2914-2916, October 2006, doi: 10.1093/ietfec/e89-a.10.2914.
Abstract: If the signal is not Gaussian, then the power spectral density (PSD) approach is insufficient to analyze signals and we resort to estimate the higher order spectra of the signal. However, estimation of the higher order spectra is even more time consuming, for example, the complexity of trispectrum is O(N ⁴). This problem becomes even more serious when short time Fourier transform (STFT) is computed - computation of the trispectrum is required after every shift of the window. In this paper, a method to recursively compute trispectrum has been presented and it is shown that the computational complexity, for a window size of N, is reduced to be O(N ³) and is the same as the space complexity.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.10.2914/_p

Copy

@ARTICLE{e89-a_10_2914,
author={Khalid Mahmood AAMIR, Mohammad Ali MAUD, Asim LOAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Recursive Computation of Trispectrum},
year={2006},
volume={E89-A},
number={10},
pages={2914-2916},
abstract={If the signal is not Gaussian, then the power spectral density (PSD) approach is insufficient to analyze signals and we resort to estimate the higher order spectra of the signal. However, estimation of the higher order spectra is even more time consuming, for example, the complexity of trispectrum is O(N ⁴). This problem becomes even more serious when short time Fourier transform (STFT) is computed - computation of the trispectrum is required after every shift of the window. In this paper, a method to recursively compute trispectrum has been presented and it is shown that the computational complexity, for a window size of N, is reduced to be O(N ³) and is the same as the space complexity.},
keywords={},
doi={10.1093/ietfec/e89-a.10.2914},
ISSN={1745-1337},
month={October},}

Copy

TY - JOUR
TI - Recursive Computation of Trispectrum
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2914
EP - 2916
AU - Khalid Mahmood AAMIR
AU - Mohammad Ali MAUD
AU - Asim LOAN
PY - 2006
DO - 10.1093/ietfec/e89-a.10.2914
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2006
AB - If the signal is not Gaussian, then the power spectral density (PSD) approach is insufficient to analyze signals and we resort to estimate the higher order spectra of the signal. However, estimation of the higher order spectra is even more time consuming, for example, the complexity of trispectrum is O(N ⁴). This problem becomes even more serious when short time Fourier transform (STFT) is computed - computation of the trispectrum is required after every shift of the window. In this paper, a method to recursively compute trispectrum has been presented and it is shown that the computational complexity, for a window size of N, is reduced to be O(N ³) and is the same as the space complexity.
ER -