首页> 外文期刊>IEEE Journal on Selected Areas in Communications >Joint iterative channel estimation and decoding in flat correlatedRayleigh fading
【24h】

Joint iterative channel estimation and decoding in flat correlatedRayleigh fading

机译:平面相关瑞利衰落中的联合迭代信道估计和解码

获取原文
获取原文并翻译 | 示例
           

摘要

This paper addresses the design and performance evaluation withnrespect to capacity of M-PSK turbo-coded systems operating innfrequency-flat time-selective Rayleigh fading. The receiver jointlynperforms channel estimation and turbo decoding, allowing the twonprocesses to benefit from each other. To this end, we introduce ansuitable Markov model with a finite number of states, designed tonapproximate both the values and the statistical properties of thencorrelated flat fading channel phase, which poses a more severenchallenge to PSK transmission than amplitude hiding. Then, thenforward-backward algorithm determines both the maximum a posteriorinprobability (MAP) value for each symbol in the data sequence and the MAPnchannel phase in each iteration. Simulations show good performance innstandard correlated Rayleigh fading channels. A sequence ofnprogressively tighter upper bounds to the capacity of a simplifiednMarkov-phase channel is derived, and performance of a turbo code withnjoint iterative channel estimation and decoding is demonstrated tonapproach these capacity bounds
机译:本文针对在频率平坦时间选择性瑞利衰落下运行的M-PSK Turbo编码系统的容量进行了设计和性能评估。接收器联合执行信道估计和Turbo解码,从而使两个进程能够彼此受益。为此,我们引入了一个有限状态数的合适的马尔可夫模型,其设计与当时相关的平坦衰落信道相位的值和统计特性都近似逼近,这对PSK传输构成了比幅度隐藏更为严峻的挑战。然后,向前-向后算法确定数据序列中每个符号的最大后验概率(MAP)值和每次迭代中的MAPnchannel相位。仿真显示了在非标准相关瑞利衰落信道中的良好性能。推导了一个简化的n马尔可夫相位信道的容量逐渐严格的上限序列,并证明了在接近这些容量边界的情况下具有不伴随迭代信道估计和解码的turbo码的性能

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号