跳到主要导航 跳到搜索 跳到主要内容

A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes

  • Qiuju Diao*
  • , Qin Huang
  • , Shu Lin
  • , K. Abdel-Ghaffar
  • *此作品的通讯作者
  • Xidian University
  • University of California at Davis

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Several classes of quasi-cyclic LDPC codes have been proposed in the literature and shown to have excellent performance over noisy channels when decoded with iterative message-passing algorithms. However, by and large, important properties of the codes, including their dimensions, are only given for specific codes based on computer programming. Using Fourier transforms, it is shown that the ranks of parity-check matrices of quasi-cyclic codes can be computed. From these ranks, the dimensions of the codes can be determined. The approach, which unifies most of the known algebraic constructions, is given in detail for three large classes of quasi-cyclic LDPC codes which appear in the literature.

源语言英语
主期刊名2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
366-370
页数5
DOI
出版状态已出版 - 2011
已对外发布
活动2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, 俄罗斯联邦
期限: 31 7月 20115 8月 2011

出版系列

姓名IEEE International Symposium on Information Theory - Proceedings
ISSN(印刷版)2157-8104

会议

会议2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
国家/地区俄罗斯联邦
St. Petersburg
时期31/07/115/08/11

指纹

探究 'A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes' 的科研主题。它们共同构成独一无二的指纹。

引用此