On channel identification based on second-order cyclic spectra

Gardener (1991) presented an interesting use of cyclostationarity for channel identification in PAM data communication systems. The present paper presents new results that address the identification of linear rational channels with higher than minimum bandwidth based on the use of second-order cyclic statistics. Unlike the approach taken by Gardener, the present authors show that channel identification is achievable for a class of linear channels without the need for a pilot tone or training periods. Moreover, channel identification based on cyclic statistics does not preclude Gaussian or near-Gaussian inputs.<
>