{"title":"二进制擦除信道的不规则turbo码设计","authors":"G. Kraidy, V. Savin","doi":"10.1109/TURBOCODING.2008.4658711","DOIUrl":null,"url":null,"abstract":"In this paper, the design of irregular turbo codes for the binary erasure channel is investigated. An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This expression will be used to study the density evolution of turbo codes over the binary erasure channel, that will allow for the design of capacity-approaching irregular turbo codes. Next, we propose a graph-optimal interleaver for irregular turbo codes. Simulation results for different coding rates are shown at the end.","PeriodicalId":284046,"journal":{"name":"2008 5th International Symposium on Turbo Codes and Related Topics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Irregular turbo code design for the binary erasure channel\",\"authors\":\"G. Kraidy, V. Savin\",\"doi\":\"10.1109/TURBOCODING.2008.4658711\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the design of irregular turbo codes for the binary erasure channel is investigated. An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This expression will be used to study the density evolution of turbo codes over the binary erasure channel, that will allow for the design of capacity-approaching irregular turbo codes. Next, we propose a graph-optimal interleaver for irregular turbo codes. Simulation results for different coding rates are shown at the end.\",\"PeriodicalId\":284046,\"journal\":{\"name\":\"2008 5th International Symposium on Turbo Codes and Related Topics\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th International Symposium on Turbo Codes and Related Topics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TURBOCODING.2008.4658711\",\"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 5th International Symposium on Turbo Codes and Related Topics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TURBOCODING.2008.4658711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Irregular turbo code design for the binary erasure channel
In this paper, the design of irregular turbo codes for the binary erasure channel is investigated. An analytic expression of the erasure probability of punctured recursive systematic convolutional codes is derived. This expression will be used to study the density evolution of turbo codes over the binary erasure channel, that will allow for the design of capacity-approaching irregular turbo codes. Next, we propose a graph-optimal interleaver for irregular turbo codes. Simulation results for different coding rates are shown at the end.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
