Abstract
In this paper, deterministic pilot pattern design for sparse channel estimation in orthogonal frequency division multiplexing (OFDM) systems is investigated. Pilot subcarriers are essential for channel estimation and especially the selection of pilot subcarriers significantly affect compressive sensing based channel estimation performance. With straightforward searching and based on minimizing the coherence of the measurement matrix, three greedy deterministic pilot pattern optimization algorithms for sparse channel estimation in OFDM systems is proposed. In addition, a minimum distance term is introduced, which distance of pilots to each other must be integer multiples of this minimum distance term. By using the proposed minimum distance term, the algorithm only searches possible subcarriers, which lead to fast runtime and low complexity. Orthogonal matching pursuit is used as the recovery method for estimation of the channel taps. Simulation results demonstrate that the proposed algorithms are more efficient than the exhaustive search for pilot pattern design.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
