A proof of the identifiability of a subspace-based blind channel estimation for OFDM systems

被引:3
作者
Zeng, YH [1 ]
Ng, TS [1 ]
机构
[1] Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R China
关键词
blind channel identification; cyclic prefix; identifiability; orthogonal frequency division multiplexing (OMM); subspace method;
D O I
10.1109/LSP.2004.833584
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Muquet et al. 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.
引用
收藏
页码:756 / 759
页数:4
相关论文
共 6 条
[1]  
ABEDMERAIN K, 1997, IEEE T INFORM THEORY, V32, P499
[2]  
Ding Z., 2001, BLIND EQUALIZATION I
[3]  
GIANNAKIS GB, 2001, SIGNAL PROCESSING AD, V1
[4]  
HEISKALA J, 2002, OFDM WIRELESS WIRELE
[5]   SUBSPACE METHODS FOR THE BLIND IDENTIFICATION OF MULTICHANNEL FIR FILTERS [J].
MOULINES, E ;
DUHAMEL, P ;
CARDOSO, JF ;
MAYRARGUE, S .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1995, 43 (02) :516-525
[6]   Subspace-based blind and semi-blind channel estimation for OFDM systems [J].
Muquet, B ;
de Courville, M ;
Duhamel, P .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2002, 50 (07) :1699-1712