基于rs的QC-LDPC码低复杂度编码算法

2014 Information Theory and Applications Workshop (ITA) Pub Date : 2014-04-24 DOI:10.1109/ITA.2014.6804249

Mu Zhang, Li Tang, Qin Huang, Zulin Wang

{"title":"基于rs的QC-LDPC码低复杂度编码算法","authors":"Mu Zhang, Li Tang, Qin Huang, Zulin Wang","doi":"10.1109/ITA.2014.6804249","DOIUrl":null,"url":null,"abstract":"This paper presents a novel encoding algorithm for QC-LDPC codes constructed from Reed-Solomon codes. The encoding is performed in the transform domain via Galois Fourier transformation. Message bits are encoded in sections corresponding to sub-matrices of the parity-check matrix in the transform domain. Because of the structure of the parity-check matrices of these LDPC codes, the encoding can be easily implemented with some linear-feedback shift registers, thus efficiently reduces the hardware cost.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Low complexity encoding algorithm of RS-based QC-LDPC codes\",\"authors\":\"Mu Zhang, Li Tang, Qin Huang, Zulin Wang\",\"doi\":\"10.1109/ITA.2014.6804249\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel encoding algorithm for QC-LDPC codes constructed from Reed-Solomon codes. The encoding is performed in the transform domain via Galois Fourier transformation. Message bits are encoded in sections corresponding to sub-matrices of the parity-check matrix in the transform domain. Because of the structure of the parity-check matrices of these LDPC codes, the encoding can be easily implemented with some linear-feedback shift registers, thus efficiently reduces the hardware cost.\",\"PeriodicalId\":338302,\"journal\":{\"name\":\"2014 Information Theory and Applications Workshop (ITA)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Information Theory and Applications Workshop (ITA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITA.2014.6804249\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Information Theory and Applications Workshop (ITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITA.2014.6804249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

本文提出了一种基于Reed-Solomon码构造的QC-LDPC码的新编码算法。通过伽罗瓦傅里叶变换在变换域中进行编码。消息位被编码成与变换域中奇偶校验矩阵的子矩阵相对应的部分。由于这些LDPC码的奇偶校验矩阵的结构，可以很容易地使用一些线性反馈移位寄存器来实现编码，从而有效地降低了硬件成本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Low complexity encoding algorithm of RS-based QC-LDPC codes

This paper presents a novel encoding algorithm for QC-LDPC codes constructed from Reed-Solomon codes. The encoding is performed in the transform domain via Galois Fourier transformation. Message bits are encoded in sections corresponding to sub-matrices of the parity-check matrix in the transform domain. Because of the structure of the parity-check matrices of these LDPC codes, the encoding can be easily implemented with some linear-feedback shift registers, thus efficiently reduces the hardware cost.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 Information Theory and Applications Workshop (ITA)

自引率

0.00%

发文量