High performance error correcting code of the high-dimensional discrete torus knot

M. Hata, E. Yamaguchi, Y. Hamasuna, Toshio Ishizaka, I. Takumi
{"title":"High performance error correcting code of the high-dimensional discrete torus knot","authors":"M. Hata, E. Yamaguchi, Y. Hamasuna, Toshio Ishizaka, I. Takumi","doi":"10.1109/ITCC.2001.918854","DOIUrl":null,"url":null,"abstract":"The new high-dimensional torus knot code with respect to its geometrical structure has been studied. The special features of the code are presented. (1) The code block is wound up into a small, compact code ball, so the code passes hardly damaged through the channel of a dense shower of error-making disturbances. (2) The torus knot winding works as block-size interleaving, which distributes the received burst errors randomly in the parity check cycles, so the code exhibits excellent burst error correction capability. (3) Majority logic decoding of each code digit based on the erroneous parity lines can be made up of a high-speed logic circuit thanks to the cyclical properties of the code parity check function. The four-dimensional, size-five 4Dm5-code was burned onto a 50-kilogate, 0.6-micron-order VLSI chip. The code block length and the transmission rate are 625 bits and 0.41, respectively. It was operated at a clock speed of 50 MHz, with a throughput of 6.25 Gbps. Through 100000 block trials, it was proven that the chip can perfectly correct a mean BER of 0.021 for burst and random mixed error situations.","PeriodicalId":318295,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Information Technology: Coding and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITCC.2001.918854","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The new high-dimensional torus knot code with respect to its geometrical structure has been studied. The special features of the code are presented. (1) The code block is wound up into a small, compact code ball, so the code passes hardly damaged through the channel of a dense shower of error-making disturbances. (2) The torus knot winding works as block-size interleaving, which distributes the received burst errors randomly in the parity check cycles, so the code exhibits excellent burst error correction capability. (3) Majority logic decoding of each code digit based on the erroneous parity lines can be made up of a high-speed logic circuit thanks to the cyclical properties of the code parity check function. The four-dimensional, size-five 4Dm5-code was burned onto a 50-kilogate, 0.6-micron-order VLSI chip. The code block length and the transmission rate are 625 bits and 0.41, respectively. It was operated at a clock speed of 50 MHz, with a throughput of 6.25 Gbps. Through 100000 block trials, it was proven that the chip can perfectly correct a mean BER of 0.021 for burst and random mixed error situations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高维离散环面结的高性能纠错代码
从几何结构的角度研究了新的高维环面结码。介绍了该代码的特点。(1)代码块被缠绕成一个小而紧凑的代码球,因此代码通过密集的错误干扰的通道几乎没有损坏。(2)环面结缠绕作为块大小的交错,将接收到的突发错误随机分布在奇偶校验周期内,使编码具有良好的突发纠错能力。(3)基于错误奇偶校验线对每个码位进行多数逻辑解码,利用码偶校验功能的周期性,可组成高速逻辑电路。这个四维5码4dm5被刻录在一个50千米、0.6微米级的VLSI芯片上。码块长度为625位,传输速率为0.41位。它以50兆赫的时钟速度运行,吞吐量为6.25 Gbps。通过100000个分组试验,证明该芯片可以很好地校正突发和随机混合错误情况下的平均误码率为0.021。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Advanced research issues for tomorrow's multimedia networks Adaptive thresholding of document images based on Laplacian sign Special sessions on multimedia security and watermarking applications Content-based retrieval and data mining of a skin cancer image database Building perception for scheduling and executing a task using multi-agent systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1