{"title":"用对数域和积算法分析周长为6的QC-LDPC码的性能","authors":"J. Mathur, Alpana Pandey","doi":"10.1109/ICICI.2017.8365366","DOIUrl":null,"url":null,"abstract":"This paper presents Bit error Rate performance Analysis of Quasi Cyclic Low Density Parity Check Codes (QC-LDPC) with girth 6 using Log Domain sum product and Simple Log Domain Sum Product Algorithm for Decoding. The approach to construct Parity Check matrix for LDPC codes is based on sparse Lower Upper decomposition. Then to create QC-LDPC matrix counter shifting, interleave mapping, Set XORing, Circulant Shifting and Randomization processes are being used. The constructed QC-LDPC codes is of a girth 6 on / code Rate have row weight 6 and column weight 3. Bit error rate performance is done through simulation to be calculated for various code length such as code I (960, 480), code II (1980, 990) and code III (1080, 540).","PeriodicalId":369524,"journal":{"name":"2017 International Conference on Inventive Computing and Informatics (ICICI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Performance analysis of QC-LDPC codes with girth 6 using Log Domain sum product algorithm\",\"authors\":\"J. Mathur, Alpana Pandey\",\"doi\":\"10.1109/ICICI.2017.8365366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents Bit error Rate performance Analysis of Quasi Cyclic Low Density Parity Check Codes (QC-LDPC) with girth 6 using Log Domain sum product and Simple Log Domain Sum Product Algorithm for Decoding. The approach to construct Parity Check matrix for LDPC codes is based on sparse Lower Upper decomposition. Then to create QC-LDPC matrix counter shifting, interleave mapping, Set XORing, Circulant Shifting and Randomization processes are being used. The constructed QC-LDPC codes is of a girth 6 on / code Rate have row weight 6 and column weight 3. Bit error rate performance is done through simulation to be calculated for various code length such as code I (960, 480), code II (1980, 990) and code III (1080, 540).\",\"PeriodicalId\":369524,\"journal\":{\"name\":\"2017 International Conference on Inventive Computing and Informatics (ICICI)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Inventive Computing and Informatics (ICICI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICI.2017.8365366\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Inventive Computing and Informatics (ICICI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICI.2017.8365366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance analysis of QC-LDPC codes with girth 6 using Log Domain sum product algorithm
This paper presents Bit error Rate performance Analysis of Quasi Cyclic Low Density Parity Check Codes (QC-LDPC) with girth 6 using Log Domain sum product and Simple Log Domain Sum Product Algorithm for Decoding. The approach to construct Parity Check matrix for LDPC codes is based on sparse Lower Upper decomposition. Then to create QC-LDPC matrix counter shifting, interleave mapping, Set XORing, Circulant Shifting and Randomization processes are being used. The constructed QC-LDPC codes is of a girth 6 on / code Rate have row weight 6 and column weight 3. Bit error rate performance is done through simulation to be calculated for various code length such as code I (960, 480), code II (1980, 990) and code III (1080, 540).