Polynomial-complexity maximum-likelihood block noncoherent MPSK detection
ICASSP(2008)
摘要
In wireless channels, maximum-likelihood (ML) block noncoherent detection offers significant gains over conventional symbol-by-symbol detection when the fading channel coefficients are not available and cannot be estimated at the receiver. Certainly, in general the complexity of the block detector grows exponentially with the symbol sequence length. However, it has been recently shown that for M-ary phase-shift keying (MPSK) modulation block noncoherent detection can be performed with polynomial complexity. In this work, we develop a new ML block noncoherent detector for MPSK transmission of arbitrary order and multiple-antenna reception. The proposed algorithm introduces auxiliary spherical variables and constructs with polynomial complexity a. polynomial-size set which includes the ML data sequence. It is shown that the complexity of the proposed algorithm is polynomial in the sequence length and at least one order of magnitude lower than the complexity of computational-geometry based noncoherent detection algorithms that have been developed recently.
更多查看译文
关键词
antenna arrays,maximum likelihood detection,phase shift keying,polynomials,wireless channels,M-ary phase-shift keying modulation,ML data sequence,auxiliary spherical variables,maximum-likelihood block noncoherent MPSK detection,multiple-antenna reception,polynomial-complexity,wireless channels,Maximum-likelihood sequence detection,noncoherent detection,single-input multiple-output channels
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络