Turbo coding behavior in Rayleigh fading channels without perfect interleaving

K. Tepe, J.B. Anderson
{"title":"Turbo coding behavior in Rayleigh fading channels without perfect interleaving","authors":"K. Tepe, J.B. Anderson","doi":"10.1109/MILCOM.2001.986027","DOIUrl":null,"url":null,"abstract":"Turbo coding is investigated for uninterleaved and partially interleaved Rayleigh fading channels. It is compared to ordinary convolutional coding with the same rate and memory 2, 4 and 8 best d/sub free/ encoders. When turbo frames are very long, turbo coding with a channel interleaver gets better bit error rates (BER) than ordinary convolutional coding with a channel interleaver. When the frames are shorter, lower complexity convolutional coding is as good as turbo coding. It is shown by experiment that only after a certain critical frame size does turbo coding get better BER than convolutional coding and the length of this threshold is linearly dependent on the inverse of the fading bandwidth, 1/BT. The effect of the constituent encoders on the error performance is also tested. Memory 2, 4 and 6 constituent encoders are compared. For short to moderate turbo frame size, the memory 2 constituent encoder is as good as the memory 4 and better than the memory 6 encoder. For very long block-lengths, the memory 4 encoder is the best. The memory 6 encoder is always the worst.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.2001.986027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Turbo coding is investigated for uninterleaved and partially interleaved Rayleigh fading channels. It is compared to ordinary convolutional coding with the same rate and memory 2, 4 and 8 best d/sub free/ encoders. When turbo frames are very long, turbo coding with a channel interleaver gets better bit error rates (BER) than ordinary convolutional coding with a channel interleaver. When the frames are shorter, lower complexity convolutional coding is as good as turbo coding. It is shown by experiment that only after a certain critical frame size does turbo coding get better BER than convolutional coding and the length of this threshold is linearly dependent on the inverse of the fading bandwidth, 1/BT. The effect of the constituent encoders on the error performance is also tested. Memory 2, 4 and 6 constituent encoders are compared. For short to moderate turbo frame size, the memory 2 constituent encoder is as good as the memory 4 and better than the memory 6 encoder. For very long block-lengths, the memory 4 encoder is the best. The memory 6 encoder is always the worst.
无完全交织的瑞利衰落信道中的Turbo编码行为
研究了非交织和部分交织瑞利衰落信道的Turbo编码。将其与具有相同速率和内存2,4和8个最佳d/sub /编码器的普通卷积编码进行比较。当turbo帧很长时,使用信道交织器的turbo编码比使用信道交织器的普通卷积编码具有更好的误码率。在帧数较短的情况下,较低复杂度的卷积编码与turbo编码效果相当。实验表明,只有达到一定的临界帧长后,turbo编码的误码率才会优于卷积编码,并且该阈值的长度与衰落带宽的倒数1/BT呈线性关系。测试了编码器的组成对误差性能的影响。对存储器2、4和6组成编码器进行了比较。对于短到中等turbo帧大小,存储器2组成编码器与存储器4一样好,优于存储器6编码器。对于非常长的块长度,存储器4编码器是最好的。记忆编码器总是最糟糕的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信