{"title":"基于串行连接的新型LDPC码","authors":"M. Baldi, G. Cancellieri, F. Chiaraluce","doi":"10.1109/AICT.2009.60","DOIUrl":null,"url":null,"abstract":"We propose a novel family of low-density parity-check (LDPC) codes that can be obtained as the serial concatenation of very simple components. Codes designed through the proposed approach exhibit very good performance and have a number of benefits, as high flexibility in length and rate and low complexity encoding. In addition, the systematic form of the component codes ensures rate compatibility, so the proposed codes are suitable for application in type-II hybrid automatic repeat request schemes. We analyze their properties through theoretical arguments and give design examples in order to assess their performance.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"New LDPC Codes Based on Serial Concatenation\",\"authors\":\"M. Baldi, G. Cancellieri, F. Chiaraluce\",\"doi\":\"10.1109/AICT.2009.60\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel family of low-density parity-check (LDPC) codes that can be obtained as the serial concatenation of very simple components. Codes designed through the proposed approach exhibit very good performance and have a number of benefits, as high flexibility in length and rate and low complexity encoding. In addition, the systematic form of the component codes ensures rate compatibility, so the proposed codes are suitable for application in type-II hybrid automatic repeat request schemes. We analyze their properties through theoretical arguments and give design examples in order to assess their performance.\",\"PeriodicalId\":409336,\"journal\":{\"name\":\"2009 Fifth Advanced International Conference on Telecommunications\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth Advanced International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICT.2009.60\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth Advanced International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT.2009.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We propose a novel family of low-density parity-check (LDPC) codes that can be obtained as the serial concatenation of very simple components. Codes designed through the proposed approach exhibit very good performance and have a number of benefits, as high flexibility in length and rate and low complexity encoding. In addition, the systematic form of the component codes ensures rate compatibility, so the proposed codes are suitable for application in type-II hybrid automatic repeat request schemes. We analyze their properties through theoretical arguments and give design examples in order to assess their performance.