{"title":"优化的快速解码原型LDPC码的设计","authors":"T. Nguyen, Hieu T. Nguyen","doi":"10.1109/ATC.2016.7764790","DOIUrl":null,"url":null,"abstract":"This paper presents a simple method of designing a protograph-based LDPC codes which has excellent performance with a small number of decoding iterations. In addition to designing LDPC codes based on the iterative decoding threshold as before, we add one more dimension into the design process which is a predefined number of decoding iterations. Simulation results show that the proposed codes have better performance than state-of-the-art protograph codes while the number of decoding iterations is small.","PeriodicalId":225413,"journal":{"name":"2016 International Conference on Advanced Technologies for Communications (ATC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"The design of optimized fast decoding protograph LDPC codes\",\"authors\":\"T. Nguyen, Hieu T. Nguyen\",\"doi\":\"10.1109/ATC.2016.7764790\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a simple method of designing a protograph-based LDPC codes which has excellent performance with a small number of decoding iterations. In addition to designing LDPC codes based on the iterative decoding threshold as before, we add one more dimension into the design process which is a predefined number of decoding iterations. Simulation results show that the proposed codes have better performance than state-of-the-art protograph codes while the number of decoding iterations is small.\",\"PeriodicalId\":225413,\"journal\":{\"name\":\"2016 International Conference on Advanced Technologies for Communications (ATC)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Advanced Technologies for Communications (ATC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATC.2016.7764790\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Advanced Technologies for Communications (ATC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATC.2016.7764790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The design of optimized fast decoding protograph LDPC codes
This paper presents a simple method of designing a protograph-based LDPC codes which has excellent performance with a small number of decoding iterations. In addition to designing LDPC codes based on the iterative decoding threshold as before, we add one more dimension into the design process which is a predefined number of decoding iterations. Simulation results show that the proposed codes have better performance than state-of-the-art protograph codes while the number of decoding iterations is small.