A new iterative channel estimator for the log-MAP & max-log-MAP turbo decoder in Rayleigh fading channel

Wee-Peng Ang, H. K. Garg
{"title":"A new iterative channel estimator for the log-MAP & max-log-MAP turbo decoder in Rayleigh fading channel","authors":"Wee-Peng Ang, H. K. Garg","doi":"10.1109/GLOCOM.2001.966287","DOIUrl":null,"url":null,"abstract":"A new iterative channel estimator for turbo decoding over flat fading channel is studied using the optimum log-MAP turbo decoder and the reduced-complexity sub-optimum max-log-MAP turbo decoder. Initially, pilot symbols are used to estimate the complex channel gain and noise variance. After each decoding iteration, only the detected message bits are fed back to the channel estimator to improve the channel estimates. The moving average filter, the FIR filter and the FFT filter are studied and compared to the optimum Wiener filter. It is shown that under very slow fading rate of f/sub d/T/sub s/ = 0.005, the various filters perform closely to one another. Under a faster fading rate of f/sub d/T/sub s/ = 0.02, the FFT filter and FIR filter respectively achieved performance within about 1/2 dB and 1 dB of that achieved by the optimum Wiener filter for a BER of 3 /spl times/ 10/sup -4/. When the max-log-MAP turbo decoder is used, performance degrades by up to about 0.5 dB for the same BER compared to the case of using the log-MAP turbo decoder.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2001.966287","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

A new iterative channel estimator for turbo decoding over flat fading channel is studied using the optimum log-MAP turbo decoder and the reduced-complexity sub-optimum max-log-MAP turbo decoder. Initially, pilot symbols are used to estimate the complex channel gain and noise variance. After each decoding iteration, only the detected message bits are fed back to the channel estimator to improve the channel estimates. The moving average filter, the FIR filter and the FFT filter are studied and compared to the optimum Wiener filter. It is shown that under very slow fading rate of f/sub d/T/sub s/ = 0.005, the various filters perform closely to one another. Under a faster fading rate of f/sub d/T/sub s/ = 0.02, the FFT filter and FIR filter respectively achieved performance within about 1/2 dB and 1 dB of that achieved by the optimum Wiener filter for a BER of 3 /spl times/ 10/sup -4/. When the max-log-MAP turbo decoder is used, performance degrades by up to about 0.5 dB for the same BER compared to the case of using the log-MAP turbo decoder.
瑞利衰落信道中log-MAP和max-log-MAP turbo译码器的一种新的迭代信道估计器
采用最优log-MAP turbo译码器和降低复杂度次最优max-log-MAP turbo译码器,研究了一种用于平坦衰落信道上turbo译码的迭代信道估计方法。首先,导频符号用于估计复杂信道增益和噪声方差。在每次解码迭代后,仅将检测到的消息位反馈给信道估计器以改进信道估计。对移动平均滤波器、FIR滤波器和FFT滤波器进行了研究,并与最优维纳滤波器进行了比较。结果表明,在f/sub d/T/sub s/ = 0.005这一极慢的衰落速率下,各滤波器的性能非常接近。当衰落速率为f/sub / d/T/sub /s / = 0.02时,FFT滤波器和FIR滤波器的性能分别比最优Wiener滤波器的性能差约1/ 2db和1db,其BER为3 / sp1倍/ 10/sup -4/。当使用max-log-MAP turbo解码器时,与使用log-MAP turbo解码器相比,在相同的误码率下,性能下降最多约0.5 dB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信