{"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