New unit-memory codes obtained by puncturing periodically time-varying convolutional codes

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.
通过穿刺周期性时变卷积码获得新的单位记忆码
提出了一种新的高速率穿孔卷积码(PCC)。虽然任何已知的PCC都是通过穿刺低速率时不变母码推导出来的,但新的PCC是通过穿刺作为母码的周期性时变卷积码(PTVCC)推导出来的。为了找到新的PCC,我们首先证明任何PTVCC(因此,任何PCC)都等价于一种时不变卷积码。着重于固定单元存储器(UM)代码,我们还表明,在某些条件下,存在一个PTVCC以及一个与该UM代码等效的穿刺模式。然后用组合优化算法搜索存在等效PCC的新优码。我们观察到新的PCC在几个方面比以前已知的PCC有利。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信