Recursive Computation of Trispectrum
| Autor: | Asim Loan, Khalid Mahmood Aamir, Mohammad Ali Maud |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
Computational complexity theory
Applied Mathematics Speech recognition Computation Gaussian Short-time Fourier transform Spectral density Astrophysics::Cosmology and Extragalactic Astrophysics Computer Graphics and Computer-Aided Design Signal symbols.namesake Signal Processing symbols Trispectrum Electrical and Electronic Engineering Algorithm Bispectrum Mathematics |
| Zdroj: | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :2914-2916 |
| ISSN: | 1745-1337 0916-8508 |
| DOI: | 10.1093/ietfec/e89-a.10.2914 |
| Popis: | 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(N4). 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(N3) and is the same as the space complexity. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|