Abstract

Muquet et al. (2002) have proposed a subspace-based blind method for estimating the channel responses of cyclic-prefixed OFDM systems. Their proof for the channel identifiability uses the roots of channel transfer function and therefore depends on the channel order. When only an upper bound is known for the channel order, the proof fails. In this letter, a new proof for the identifiability is given which does not require knowledge of the precise channel order and can handle various choices of length of the OFDM block.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call