{"title":"拟循环单步多数逻辑可译码的迭代阈值译码","authors":"Karim Rkizat, M. Lahmer, M. Belkasmi","doi":"10.1109/WICT.2015.7489656","DOIUrl":null,"url":null,"abstract":"This paper presents a new class of Quasi-Cyclic One Step Majority logic codes of 1/2 rate constructed from perfect difference set. Theses codes can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding algorithm. Much of these codes is a subfamily of the LDPC codes and can be decoded using belief propagation algorithm. A comparison between our results and those for LDPC code in terms of BER performance are presented.","PeriodicalId":246557,"journal":{"name":"2015 5th World Congress on Information and Communication Technologies (WICT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Iterative threshold decoding of Quasi-Cyclic One Step Majority logic decodable codes\",\"authors\":\"Karim Rkizat, M. Lahmer, M. Belkasmi\",\"doi\":\"10.1109/WICT.2015.7489656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new class of Quasi-Cyclic One Step Majority logic codes of 1/2 rate constructed from perfect difference set. Theses codes can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding algorithm. Much of these codes is a subfamily of the LDPC codes and can be decoded using belief propagation algorithm. A comparison between our results and those for LDPC code in terms of BER performance are presented.\",\"PeriodicalId\":246557,\"journal\":{\"name\":\"2015 5th World Congress on Information and Communication Technologies (WICT)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 5th World Congress on Information and Communication Technologies (WICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WICT.2015.7489656\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 5th World Congress on Information and Communication Technologies (WICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WICT.2015.7489656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Iterative threshold decoding of Quasi-Cyclic One Step Majority logic decodable codes
This paper presents a new class of Quasi-Cyclic One Step Majority logic codes of 1/2 rate constructed from perfect difference set. Theses codes can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding algorithm. Much of these codes is a subfamily of the LDPC codes and can be decoded using belief propagation algorithm. A comparison between our results and those for LDPC code in terms of BER performance are presented.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
