双串接卷积码的s型置换设计

A. Huebner, D. Costello
{"title":"双串接卷积码的s型置换设计","authors":"A. Huebner, D. Costello","doi":"10.1109/ITW.2006.1633808","DOIUrl":null,"url":null,"abstract":"In this paper the impact of S-type permutors, i.e., permutors that provide a non-trivial separation, on the minimum distance of double serially concatenated convolutional codes is considered. A joint design of the outer and inner permutor is presented on the basis of a newly introduced permutor parameter - the so-called symbol span. This design guarantees that the minimum distance of the overall code is lower bounded by the product of the free distances of all three component codes. Simulation results are presented and comparisons with single serially concatenated and double/generalized repeat accumulate codes are briefly sketched.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"123 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the Design of S-type Permutors for Double Serially Concatenated Convolutional Codes\",\"authors\":\"A. Huebner, D. Costello\",\"doi\":\"10.1109/ITW.2006.1633808\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper the impact of S-type permutors, i.e., permutors that provide a non-trivial separation, on the minimum distance of double serially concatenated convolutional codes is considered. A joint design of the outer and inner permutor is presented on the basis of a newly introduced permutor parameter - the so-called symbol span. This design guarantees that the minimum distance of the overall code is lower bounded by the product of the free distances of all three component codes. Simulation results are presented and comparisons with single serially concatenated and double/generalized repeat accumulate codes are briefly sketched.\",\"PeriodicalId\":293144,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"volume\":\"123 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2006.1633808\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2006.1633808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文考虑了s型置换元(即提供非平凡分离的置换元)对双序列串联卷积码最小距离的影响。根据新引入的电流子符号跨度参数,提出了内外电流子的联合设计方法。这种设计保证了整个代码的最小距离是由所有三个组件代码的自由距离的乘积的下界。给出了仿真结果,并与单串接码和双/广义重复累积码进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the Design of S-type Permutors for Double Serially Concatenated Convolutional Codes
In this paper the impact of S-type permutors, i.e., permutors that provide a non-trivial separation, on the minimum distance of double serially concatenated convolutional codes is considered. A joint design of the outer and inner permutor is presented on the basis of a newly introduced permutor parameter - the so-called symbol span. This design guarantees that the minimum distance of the overall code is lower bounded by the product of the free distances of all three component codes. Simulation results are presented and comparisons with single serially concatenated and double/generalized repeat accumulate codes are briefly sketched.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Backward Channels in Multiterminal Source Coding Regret Minimization Under Partial Monitoring Scaling Law of the Sum-Rate for Multi-Antenna Broadcast Channels with Deterministic or Selective Binary Feedback Non-coherent Mutual Information of the Multipath Rayleigh Fading Channel in the Low SNR Regime Successive Refinement for Pattern Recognition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1