一个由扩展汉明码组成的非常低复杂度的块涡轮解码器

Yanni Chen, K. Parhi
{"title":"一个由扩展汉明码组成的非常低复杂度的块涡轮解码器","authors":"Yanni Chen, K. Parhi","doi":"10.1109/GLOCOM.2001.965101","DOIUrl":null,"url":null,"abstract":"This paper presents a very low complexity block turbo decoder composed of extended Hamming codes. New efficient complexity reduction algorithms are proposed including simplifying the extrinsic information computation and soft inputs updating algorithm. For performance evaluation, [eHamming (32,26,4)]/sup 2/ and [eHamming (64,57,4)]/sup 2/ block turbo code transmitted over an AWGN channel using BPSK modulation are considered. Extra 0.3 dB to 0.4 dB coding gain is obtained if compared with the scheme proposed in Pyndiah et al., (1996), and the hardware overhead is negligible. The complexity of our new block turbo decoder is about ten times less than that of the near-optimum block turbo decoder with a performance degradation of only 0.5 dB. Other schemes such as reduction of test patterns in the Chase algorithm and memory saving techniques are also presented.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A very low complexity block turbo decoder composed of extended Hamming codes\",\"authors\":\"Yanni Chen, K. Parhi\",\"doi\":\"10.1109/GLOCOM.2001.965101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a very low complexity block turbo decoder composed of extended Hamming codes. New efficient complexity reduction algorithms are proposed including simplifying the extrinsic information computation and soft inputs updating algorithm. For performance evaluation, [eHamming (32,26,4)]/sup 2/ and [eHamming (64,57,4)]/sup 2/ block turbo code transmitted over an AWGN channel using BPSK modulation are considered. Extra 0.3 dB to 0.4 dB coding gain is obtained if compared with the scheme proposed in Pyndiah et al., (1996), and the hardware overhead is negligible. The complexity of our new block turbo decoder is about ten times less than that of the near-optimum block turbo decoder with a performance degradation of only 0.5 dB. Other schemes such as reduction of test patterns in the Chase algorithm and memory saving techniques are also presented.\",\"PeriodicalId\":346622,\"journal\":{\"name\":\"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"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.965101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2001.965101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

提出了一种由扩展汉明码组成的极低复杂度的分组turbo译码器。提出了简化外部信息计算和软输入更新算法等新的高效降复杂度算法。为了进行性能评估,考虑了在AWGN信道上使用BPSK调制传输的[eHamming (32,26,4)]/sup 2/和[eHamming (64,57,4)]/sup 2/块turbo码。与Pyndiah等人(1996)提出的方案相比,可以获得额外的0.3 dB至0.4 dB编码增益,并且硬件开销可以忽略不计。我们的新块涡轮解码器的复杂性比接近最佳的块涡轮解码器的复杂性低约十倍,性能下降仅为0.5 dB。此外,还提出了Chase算法中测试模式的减少和内存节省技术。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A very low complexity block turbo decoder composed of extended Hamming codes
This paper presents a very low complexity block turbo decoder composed of extended Hamming codes. New efficient complexity reduction algorithms are proposed including simplifying the extrinsic information computation and soft inputs updating algorithm. For performance evaluation, [eHamming (32,26,4)]/sup 2/ and [eHamming (64,57,4)]/sup 2/ block turbo code transmitted over an AWGN channel using BPSK modulation are considered. Extra 0.3 dB to 0.4 dB coding gain is obtained if compared with the scheme proposed in Pyndiah et al., (1996), and the hardware overhead is negligible. The complexity of our new block turbo decoder is about ten times less than that of the near-optimum block turbo decoder with a performance degradation of only 0.5 dB. Other schemes such as reduction of test patterns in the Chase algorithm and memory saving techniques are also presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Routing and wavelength assignment in optical passive star networks with non-uniform traffic load Admission control for DS-CDMA systems with fading CIXOB-k: combined input-crosspoint-output buffered packet switch A medium access control protocol with token passing and retransmission by the hub station in the asynchronous transfer mode of Wireless 1394 WDM optical switching to achieve 5 tb/s throughput
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1