A Study of Deterministic Pilot Allocation for Sparse Channel Estimation in OFDM Systems

被引:61
作者
Qi, Chenhao [1 ]
Wu, Lenan [1 ]
机构
[1] Southeast Univ, Sch Informat Sci & Engn, Nanjing 210096, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Pilot allocation; channel estimation; discrete stochastic approximation; compressed sensing;
D O I
10.1109/LCOMM.2012.032612.112553
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In this letter, we investigate the deterministic pilot allocation for sparse channel estimation in OFDM systems. Based on the rule of minimizing the coherence of the DFT submatrix, we derive that the pilot design according to the cyclic different set (CDS) is optimal. However, the CDS only exists for some specific number of OFDM subcarriers. For those cases where the CDS is unavailable, we propose a scheme using discrete stochastic approximation to obtain a near-optimal pilot pattern. Simulation results demonstrate that our scheme is much faster convergent and more efficient than the exhaustive search; and it has been shown that substantial improvement for channel estimation can be achieved.
引用
收藏
页码:742 / 744
页数:3
相关论文
共 8 条
[1]  
Applebaum L., P 2011 INT C DIG SIG, P1
[2]   Compressed Channel Sensing: A New Approach to Estimating Sparse Multipath Channels [J].
Bajwa, Waheed U. ;
Haupt, Jarvis ;
Sayeed, Akbar M. ;
Nowak, Robert .
PROCEEDINGS OF THE IEEE, 2010, 98 (06) :1058-1076
[3]  
Berger C. R., P 2011 OCEANS, P1
[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]   Near-optimal signal recovery from random projections: Universal encoding strategies? [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) :5406-5425
[6]   Optimized Pilot Placement for Sparse Channel Estimation in OFDM Systems [J].
Qi, Chenhao ;
Wu, Lenan .
IEEE SIGNAL PROCESSING LETTERS, 2011, 18 (12) :749-752
[7]   Greed is good: Algorithmic results for sparse approximation [J].
Tropp, JA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2231-2242
[8]   Achieving the Welch bound with difference sets [J].
Xia, PF ;
Zhou, SL ;
Giannakis, GB .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (05) :1900-1907