北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (2): 110-113.doi: 10.13190/jbupt.200702.110.116

• 研究报告 • 上一篇    下一篇

快衰落信道下MLSD接收机的简化

周寒冰1 ,刘海涛2 ,李道本1   

  1. (1. 北京邮电大学 信息工程学院, 北京100876; 2. 中国民航大学 通信学院 天津,300300)
  • 收稿日期:2006-03-28 修回日期:1900-01-01 出版日期:2007-04-30 发布日期:2007-04-30
  • 通讯作者: 周寒冰

The MLSD Receiver’s Simplified over Fast Fading Channel

ZHOU Han-bing1 , LIU Hai-tao2, LI Dao-ben1   

  1. (1. School of Information Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China;
    2. School of Communication, Civil Aviation University of China, Tianjin 300300, China)
  • Received:2006-03-28 Revised:1900-01-01 Online:2007-04-30 Published:2007-04-30
  • Contact: ZHOU Han-bing

摘要:

针对快速Rayleigh衰落信道下,逐幸存路径最大似然序列检测(MLSD)接收机中过于复杂的计算量问题和实时信道跟踪难题,综合采用了简化的Kalman信道跟踪算法和减状态的逐幸存路径(RSSE-PSP) Viterbi算法,实现了更简化的最大似然序列检测接收机。仿真结果表明,这种简化了的Kalman-RSSE-PSP最大似然序列检测接收机,具有相对较低的计算复杂度,误码率性能也优于同衰落率条件下采用递归最小二乘(RLS)-RSSE-PSP算法的最大似然序列检测接收机。

关键词: 减状态序列检测, Viterbi算法, Kalman跟踪, 最大似然序列检测

Abstract:

To overcome the high computational complexity problem of per-survivor-processing(PSP) algorithm in maximum likelihood sequence detection(MLSD) method and the real time channel tracking problem for fast Rayleigh fading channel, a reduced-state sequence estimation (RSSE) with per-survivor processing for Viterbi algorithm and reduced complexity Kalman channel tracking technique is studied in maximum likelihood sequence detection receiver. Computer simulation results show that the computational complexity of this simplified Kalman-RSSE-PSP Maximum likelihood sequence detection receiver is less than recursive least square (RLS) -RSSE-PSP MLSD receiver, meanwhile its bit error rate performance is lower than RLS-RSSE-PSP MLSD receiver.

Key words: reduced-state sequence estimation, Viterbi algorithm, Kalman channel tracking, maximum likelihood sequence detection

中图分类号: