Efficient Sequential and Parallel Algorithms for Estimating Higher Order Spectra
Abdullah-Al Mamun, Zigeng Wang, Xingyu Cai, Nalini Ravishanker, and, Sanguthevar Rajasekaran

TL;DR
This paper introduces efficient, generic sequential and parallel algorithms for estimating higher order spectra in big data time series analysis, significantly improving speed and memory efficiency over existing methods.
Contribution
The paper presents the first asymptotically faster and memory-efficient sequential algorithms for higher order spectra and provides optimal parallel implementations on PRAM and mesh models.
Findings
Parallel algorithms achieve significant speedups.
Sequential algorithms outperform existing methods.
Memory efficiency is improved.
Abstract
Polyspectral estimation is a problem of great importance in the analysis of nonlinear time series that has applications in biomedical signal processing, communications, geophysics, image, radar, sonar and speech processing, etc. Higher order spectra (HOS) have been used in unsupervised and supervised clustering in big data scenarios, in testing for Gaussianity, to suppress Gaussian noise, to characterize nonlinearities in time series data, and so on . Any algorithm for computing the th order spectra of a time series of length needs time since the output size will be as well. Given that we live in an era of big data, could be very large. In this case, sequential algorithms might take unacceptable amounts of time. Thus it is essential to develop parallel algorithms. There is also room for improving existing sequential algorithms. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlind Source Separation Techniques · Spectroscopy and Chemometric Analyses · Time Series Analysis and Forecasting
