Novel Approach to Design Time-Domain Training Sequence for Accurate Sparse Channel Estimation

被引:29
作者
Ma, Xu [1 ]
Yang, Fang [1 ,2 ]
Ding, Wenbo [1 ]
Song, Jian [1 ,3 ]
机构
[1] Tsinghua Univ, Dept Elect Engn, Tsinghua Natl Lab Informat Sci & Technol, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Res Inst Informat Technol, Tsinghua Natl Lab Informat Sci & Technol, Beijing 100084, Peoples R China
[3] Shenzhen City Key Lab Digital TV Syst, Shenzhen 518057, Peoples R China
基金
中国国家自然科学基金;
关键词
Channel estimation; compressive sensing (CS); coherence; cumulative coherence; coherence variance; optimal training sequence; genetic algorithm (GA); ORTHOGONAL MATCHING PURSUIT; MULTIPATH-FADING CHANNELS; SIGNAL RECOVERY; OFDM SYSTEMS; TDS-OFDM; PN-SEQUENCE; SYNCHRONIZATION; NOISE;
D O I
10.1109/TBC.2016.2550760
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Nowadays, orthogonal frequency division multiplexing system plays a more and more important role in telecommunication systems where the training sequence (TS) is usually adopted for synchronization and channel estimation, such as in the digital television/terrestrial multimedia broadcasting system. However, to achieve a channel estimation scheme with both high accuracy and spectrum efficiency is still challenging due to noise interference and delay spread of the propagation channel. In this paper, by applying the compressive sensing (CS) theory into the sparse channel estimation process for time-domain TS, a thorough investigation on the TS design criteria is carried out. Three criteria to optimize the TS design, which are to minimize the hyper-factors for coherence, the cumulative coherence, and the coherence variance, respectively, are proposed to improve the recovery performance. To minimize the corresponding merit factors of the proposed criteria, we first investigate a CS-based inverse discrete Fourier transform pattern of TS with cyclic structure, and then a genetic algorithm is proposed to further lower the merit factors. The simulation results show that by using the proposed optimized TSs, the channel estimation performance outperforms those obtained by either conventional pseudo-random noise sequence or brute force searching sequence in correct recovery probability, mean square error, and bit error rate. Moreover, the proposed criteria II and III have better performance than criterion I, while criterion III has the lowest computational complexity and is the most suitable for application.
引用
收藏
页码:512 / 520
页数:9
相关论文
共 28 条
[1]  
[Anonymous], 1997, RM1225 ITU
[2]   A genetic algorithm for the set covering problem [J].
Beasley, JE ;
Chu, PC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) :392-404
[3]   Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise [J].
Ben-Haim, Zvika ;
Eldar, Yonina C. ;
Elad, Michael .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (10) :5030-5043
[4]   Application of Compressive Sensing to Sparse Channel Estimation [J].
Berger, Christian R. ;
Wang, Zhaohui ;
Huang, Jianzhong ;
Zhou, Shengli .
IEEE COMMUNICATIONS MAGAZINE, 2010, 48 (11) :164-174
[5]   Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise [J].
Cai, T. Tony ;
Wang, Lie .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (07) :4680-4688
[6]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[7]   Universally optimal distribution of points on spheres [J].
Cohn, Henry ;
Kumar, Abhinav .
JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 2007, 20 (01) :99-148
[8]  
Ding W., IEEE T VEH IN PRESS
[9]  
Ding W., IET COMMUN IN PRESS
[10]   Time-Frequency Joint Sparse Channel Estimation for MIMO-OFDM Systems [J].
Ding, Wenbo ;
Yang, Fang ;
Dai, Wei ;
Song, Jian .
IEEE COMMUNICATIONS LETTERS, 2015, 19 (01) :58-61