F. Vatta, A. Graell i Amat, A. Banerjee, D. Costello
{"title":"非系统涡轮码:有效自由距离的设计与限制","authors":"F. Vatta, A. Graell i Amat, A. Banerjee, D. Costello","doi":"10.1109/ISITA.2008.4895621","DOIUrl":null,"url":null,"abstract":"In this paper, we address the design of turbo codes employing nonsystematic constituent encoders. Nonsystematic encoders have superior effective free distances compared to equivalent systematic encoders of the same complexity, and hence they are capable of achieving lower error floors. We derive bounds on the effective free distance of turbo codes employing nonsystematic constituent encoders and compare their distance and convergence properties with systematic turbo codes.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Nonsystematic turbo codes: Design and bounds on effective free distance\",\"authors\":\"F. Vatta, A. Graell i Amat, A. Banerjee, D. Costello\",\"doi\":\"10.1109/ISITA.2008.4895621\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the design of turbo codes employing nonsystematic constituent encoders. Nonsystematic encoders have superior effective free distances compared to equivalent systematic encoders of the same complexity, and hence they are capable of achieving lower error floors. We derive bounds on the effective free distance of turbo codes employing nonsystematic constituent encoders and compare their distance and convergence properties with systematic turbo codes.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895621\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Nonsystematic turbo codes: Design and bounds on effective free distance
In this paper, we address the design of turbo codes employing nonsystematic constituent encoders. Nonsystematic encoders have superior effective free distances compared to equivalent systematic encoders of the same complexity, and hence they are capable of achieving lower error floors. We derive bounds on the effective free distance of turbo codes employing nonsystematic constituent encoders and compare their distance and convergence properties with systematic turbo codes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
