{"title":"一种短长度LT码的自适应降周期编码方案","authors":"Xin Song, Yurong Liao, Dan Ding, Fei Teng","doi":"10.1109/ICCSN.2018.8488218","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel cycle decrease encoding (CDE) scheme for short length LT codes over binary additive white gaussian (BIAWGN) channels. Two thresholds are introduced, which are used to decrease the number of cycles of length 4 in LT codes generator matrix. During the encoding process, information nodes whose number of cycles exceeding the threshold are screened continuously, and consequently the probabilities of their participation in latter encoding process are decreased and the degree distribution used by these information nodes are changed. The upper bound and lower bound of the number of cycles in any generator matrix are derived. The analysis is then used to calculate thresholds, enabling a sharp decrease of the number of cycles in generator matrix. Simulation results show that the short length CDE LT codes ($k= 50$ and 200) perform better than the conventional LT codes over BIAWGN channels.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Adaptive Cycle Decrease Encoding Scheme for Short Length LT Codes\",\"authors\":\"Xin Song, Yurong Liao, Dan Ding, Fei Teng\",\"doi\":\"10.1109/ICCSN.2018.8488218\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a novel cycle decrease encoding (CDE) scheme for short length LT codes over binary additive white gaussian (BIAWGN) channels. Two thresholds are introduced, which are used to decrease the number of cycles of length 4 in LT codes generator matrix. During the encoding process, information nodes whose number of cycles exceeding the threshold are screened continuously, and consequently the probabilities of their participation in latter encoding process are decreased and the degree distribution used by these information nodes are changed. The upper bound and lower bound of the number of cycles in any generator matrix are derived. The analysis is then used to calculate thresholds, enabling a sharp decrease of the number of cycles in generator matrix. Simulation results show that the short length CDE LT codes ($k= 50$ and 200) perform better than the conventional LT codes over BIAWGN channels.\",\"PeriodicalId\":243383,\"journal\":{\"name\":\"2018 10th International Conference on Communication Software and Networks (ICCSN)\",\"volume\":\"139 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 10th International Conference on Communication Software and Networks (ICCSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSN.2018.8488218\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2018.8488218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Adaptive Cycle Decrease Encoding Scheme for Short Length LT Codes
This paper proposes a novel cycle decrease encoding (CDE) scheme for short length LT codes over binary additive white gaussian (BIAWGN) channels. Two thresholds are introduced, which are used to decrease the number of cycles of length 4 in LT codes generator matrix. During the encoding process, information nodes whose number of cycles exceeding the threshold are screened continuously, and consequently the probabilities of their participation in latter encoding process are decreased and the degree distribution used by these information nodes are changed. The upper bound and lower bound of the number of cycles in any generator matrix are derived. The analysis is then used to calculate thresholds, enabling a sharp decrease of the number of cycles in generator matrix. Simulation results show that the short length CDE LT codes ($k= 50$ and 200) perform better than the conventional LT codes over BIAWGN channels.