Compressive Sensing Based High-Resolution Channel Estimation for OFDM System

被引:79
作者
Meng, Jia [1 ]
Yin, Wotao [2 ]
Li, Yingying [2 ,3 ]
Nam Tuan Nguyen [4 ]
Han, Zhu [4 ,5 ]
机构
[1] CGGVeritas LLC, Houston, TX 77072 USA
[2] Rice Univ, Dept Computat & Appl Math, Houston, TX 77005 USA
[3] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77204 USA
[4] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
[5] Kyung Hee Univ, Dept Elect & Radio Engn, Seoul 130701, South Korea
基金
美国国家科学基金会;
关键词
Channel estimation; compressive sensing; orthogonal frequency division multiplexing (OFDM); SIGNAL RECONSTRUCTION; RECOVERY; CARRIER;
D O I
10.1109/JSTSP.2011.2169649
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Orthogonal frequency division multiplexing (OFDM) is a technique that will prevail in the next-generation wireless communication. Channel estimation is one of the key challenges in OFDM, since high-resolution channel estimation can significantly improve the equalization at the receiver and consequently enhance the communication performances. In this paper, we propose a system with an asymmetric digital-to-analog converter/analog-to-digital converter (DAC/ADC) pair and formulate OFDM channel estimation as a compressive sensing problem. By skillfully designing pilots and taking advantages of the sparsity of the channel impulse response, the proposed system realizes high-resolution channel estimation at a low cost. The pilot design, the use of a high-speed DAC and a regular-speed ADC, and the estimation algorithm tailored for channel estimation distinguish the proposed approach from the existing estimation approaches. We theoretically show that in the proposed system, a N-resolution channel can be faithfully obtained with an ADC speed at M = O(S-2 log(N/S)), where N is also the DAC speed and is the channel impulse response sparsity. Since S is small and increasing the DAC speed to N > M is relatively cheap, we obtain a high-resolution channel at a low cost. We also present a novel estimator that is both faster and more accurate than the typical l(1) minimization. In the numerical experiments, we simulated various numbers of multipaths and different SNRs and let the transmitter DAC run at 16 times the speed of the receiver ADC for estimating channels at the 16x resolution. While there is no similar approaches (for asymmetric DAC/ADC pairs) to compare with, we derive the Cramer-Rao lower bound.
引用
收藏
页码:15 / 25
页数:11
相关论文
共 43 条
[1]  
Afifi W. M., 2009, P INT C COMP ENG SYS
[2]  
[Anonymous], STAT SIGNAL PROCESSI
[3]  
[Anonymous], P IEEE 10 ANN WIR MI
[4]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[5]  
Berger C. R., 2009, P IEEE INT WORKSH SI, P196
[6]   Compressed Sensing for OFDM/MIMO Radar [J].
Berger, Christian R. ;
Zhou, Shengli ;
Willett, Peter ;
Demissie, Bruno ;
Heckenbach, Joerg .
2008 42ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-4, 2008, :213-+
[7]  
Berger CR, 2008, P 11 INT C INF FUS C
[8]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[9]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[10]   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