B.F. Uchoa Filho, R. Palazzo, C. de Almeida, A. Said
{"title":"New unit-memory codes obtained by puncturing periodically time-varying convolutional codes","authors":"B.F. Uchoa Filho, R. Palazzo, C. de Almeida, A. Said","doi":"10.1109/ITS.1998.718451","DOIUrl":null,"url":null,"abstract":"New good high-rate punctured convolutional codes (PCC) are presented. While any previously known PCC was derived by puncturing a low-rate time-invariant mother code, the new PCC are shown to be derived by puncturing a periodically time-varying convolutional code (PTVCC) acting as the mother code. To find the new PCC, we first show that any PTVCC (hence, any PCC) is equivalent to a type of time-invariant convolutional code. Focusing on a fixed unit-memory (UM) code, we also show that under certain conditions there exists a PTVCC along with a puncturing pattern that is equivalent to that UM code. A combinatorial optimization algorithm is then used to search for the new good UM codes for which equivalent PCC do exist. We observe that the new PCC compare favorably to the previously known PCC in several respects.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.1998.718451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
New good high-rate punctured convolutional codes (PCC) are presented. While any previously known PCC was derived by puncturing a low-rate time-invariant mother code, the new PCC are shown to be derived by puncturing a periodically time-varying convolutional code (PTVCC) acting as the mother code. To find the new PCC, we first show that any PTVCC (hence, any PCC) is equivalent to a type of time-invariant convolutional code. Focusing on a fixed unit-memory (UM) code, we also show that under certain conditions there exists a PTVCC along with a puncturing pattern that is equivalent to that UM code. A combinatorial optimization algorithm is then used to search for the new good UM codes for which equivalent PCC do exist. We observe that the new PCC compare favorably to the previously known PCC in several respects.