与神话相矛盾:具有大内存顺序的良好涡轮码

P. Massey, O.Y. Takeshita, D. J. Costello
{"title":"与神话相矛盾:具有大内存顺序的良好涡轮码","authors":"P. Massey, O.Y. Takeshita, D. J. Costello","doi":"10.1109/ISIT.2000.866414","DOIUrl":null,"url":null,"abstract":"The purpose of this paper is to contradict a common myth about turbo codes. We are specifically addressing R=1/3 parallel-concatenated codes using systematic, recursive constituent codes. Myth: Turbo codes consisting of constituent codes with large memory order (i.e., a large number of trellis states) are not as effective as the original Berrou-Glavieux-Thitimajshima turbo code (1993) in the waterfall region of small signal-to-noise ratios (SNRs). This myth is contradicted by a turbo code whose recursive constituent codes have 256 states. Decoding this turbo code with the BCJR APP decoder gives bit-error-rate (BER) and frame-error-rate (FER) performance better than the original (Berrou) turbocode at all SNRs.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Contradicting a myth: good turbo codes with large memory order\",\"authors\":\"P. Massey, O.Y. Takeshita, D. J. Costello\",\"doi\":\"10.1109/ISIT.2000.866414\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The purpose of this paper is to contradict a common myth about turbo codes. We are specifically addressing R=1/3 parallel-concatenated codes using systematic, recursive constituent codes. Myth: Turbo codes consisting of constituent codes with large memory order (i.e., a large number of trellis states) are not as effective as the original Berrou-Glavieux-Thitimajshima turbo code (1993) in the waterfall region of small signal-to-noise ratios (SNRs). This myth is contradicted by a turbo code whose recursive constituent codes have 256 states. Decoding this turbo code with the BCJR APP decoder gives bit-error-rate (BER) and frame-error-rate (FER) performance better than the original (Berrou) turbocode at all SNRs.\",\"PeriodicalId\":108752,\"journal\":{\"name\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2000.866414\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2000.866414","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

本文的目的是反驳一个关于涡轮码的常见神话。我们特别使用系统的递归组成代码来处理R=1/3并行连接代码。误解:在小信噪比(SNRs)的瀑布区,由具有大内存阶(即大量格子状态)的组成码组成的Turbo码不如原始的berru - glavieux - thitimajshima Turbo码(1993)有效。这个神话与涡轮码相矛盾,它的递归组成码有256个状态。在所有信噪比下,用BCJR APP解码器解码该涡轮码的误码率(BER)和帧误码率(FER)性能优于原始(Berrou)涡轮码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Contradicting a myth: good turbo codes with large memory order
The purpose of this paper is to contradict a common myth about turbo codes. We are specifically addressing R=1/3 parallel-concatenated codes using systematic, recursive constituent codes. Myth: Turbo codes consisting of constituent codes with large memory order (i.e., a large number of trellis states) are not as effective as the original Berrou-Glavieux-Thitimajshima turbo code (1993) in the waterfall region of small signal-to-noise ratios (SNRs). This myth is contradicted by a turbo code whose recursive constituent codes have 256 states. Decoding this turbo code with the BCJR APP decoder gives bit-error-rate (BER) and frame-error-rate (FER) performance better than the original (Berrou) turbocode at all SNRs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信