Performance comparison of combined ECC/RLL codes

C. A. French, Y. Lin
{"title":"Performance comparison of combined ECC/RLL codes","authors":"C. A. French, Y. Lin","doi":"10.1109/ICC.1990.117355","DOIUrl":null,"url":null,"abstract":"The authors present a comparison of several combined error-correcting/run-length-limited codes created by concatenating a convolutional code with a run-length-limited code. Encoding and decoding are accomplished using a single trellis based on the combined code. Half of the codes under investigation use conventional (d,k) run-length-limited codes, where d is the minimum and k is the maximum allowable run of 0s between 1s. The other half use a special class of distance-preserving codes which have the property that the pairwise Hamming distances out of the (d,k) encoder are at least as large as the corresponding distances into the encoder. Thus a combined code, created using a convolutional code concatenated with a distance-preserving (d,k) code, will have a free distance no smaller than that of the original convolutional code. A computer simulation compares the performance of these two types of codes over the binary symmetric channel for various (d,k) constraints, rates, free distances, and numbers of states. Of particular interest for magnetic recording applications ar codes with run-length constraints","PeriodicalId":126008,"journal":{"name":"IEEE International Conference on Communications, Including Supercomm Technical Sessions","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Communications, Including Supercomm Technical Sessions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1990.117355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The authors present a comparison of several combined error-correcting/run-length-limited codes created by concatenating a convolutional code with a run-length-limited code. Encoding and decoding are accomplished using a single trellis based on the combined code. Half of the codes under investigation use conventional (d,k) run-length-limited codes, where d is the minimum and k is the maximum allowable run of 0s between 1s. The other half use a special class of distance-preserving codes which have the property that the pairwise Hamming distances out of the (d,k) encoder are at least as large as the corresponding distances into the encoder. Thus a combined code, created using a convolutional code concatenated with a distance-preserving (d,k) code, will have a free distance no smaller than that of the original convolutional code. A computer simulation compares the performance of these two types of codes over the binary symmetric channel for various (d,k) constraints, rates, free distances, and numbers of states. Of particular interest for magnetic recording applications ar codes with run-length constraints
ECC/RLL组合码的性能比较
作者提出了几个组合纠错/运行长度限制的代码通过连接卷积码与运行长度限制的代码创建的比较。编码和解码使用基于组合代码的单个网格完成。所研究的代码中有一半使用常规的(d,k)运行长度限制代码,其中d是最小值,k是0与1之间允许运行的最大值。另一半则使用一类特殊的距离保持码,其性质是(d,k)编码器外的成对汉明距离至少与编码器内的相应距离一样大。因此,使用卷积码与保持距离(d,k)码连接创建的组合码将具有不小于原始卷积码的自由距离。计算机模拟比较了这两种类型的代码在二进制对称信道上的各种(d,k)约束、速率、自由距离和状态数的性能。对磁记录应用特别感兴趣的是具有运行长度约束的代码
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信