LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

On Infinite Past Predictability of Cyclostationary Signals

Photo by rebepascual7 from unsplash

This paper explores the asymptotic spectral decomposition of periodically Toeplitz matrices with finite summable elements. As an alternative to polyphase decomposition and other approaches based on Gladyshev representation, the proposed… Click to show full abstract

This paper explores the asymptotic spectral decomposition of periodically Toeplitz matrices with finite summable elements. As an alternative to polyphase decomposition and other approaches based on Gladyshev representation, the proposed route exploits the Toeplitz structure of cyclic autocorrelation matrices, thus leveraging on known asymptotic results and providing a more direct link to the cyclic spectrum and spectral coherence. As a concrete application, the problem of cyclic linear prediction is revisited, concluding with a generalized Kolmogorov-Szegö theorem on the predictability of cyclostationary signals. These results are finally tested experimentally in a prediction setting for an asynchronous mixture of two cyclostationary pulse-amplitude modulation signals.

Keywords: predictability cyclostationary; past predictability; cyclostationary signals; infinite past

Journal Title: IEEE Signal Processing Letters
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.