期刊文献+

带宽有效传输的GF(q)上LDPC编码设计 被引量:1

Design of LDPC Codes over GF(q) for Bandwidth Efficient Transmission
下载PDF
导出
摘要 以Davey(1998)提出的Monte-Carlo方法为基础的、适用于二进制PSK调制的二进制LDPC(Low-Density Parity-Check,低密度奇偶校验)码的最优化理论已经在相关文献中得到了验证。但由于q进制星座没有旋转对称性,因而限制了Davey的方法的应用。本文提出了应用在准正规编码类型上的一种有效的Davey型Monte-Carlo最优化编码设计方法。应用这种方法,可直接将GF(q)上的最优LDPC编码和任意的q进制调制结合起来,获得很高的带宽效率。本文采用MQAM和MPSK调制机制与准正规LDPC编码相结合的若干实例来论证该设计方法。 Optimization of binary LDPC (Low-Density Parity-Check) codes for application to binary PSK modulation has been demonstrated in the literature, on the basis of Monte-Carlo method proposed by Davey(1998). The lack of rotational symmetry in a generic q-ary signal constellation, however, limits the application of Davey's method. This paper proposes an efficient Davey-type Monte Carlo technique for code optimization within the category of quasi-regular codes, so that one can directly combine the optimized LDPC code over GF(q) with arbitrary q-ary modulation to achieve bandwidth efficiency in transmission. The validity of the proposed design procedure is illustrated through examples combining quasi-regular LDPC codes with MQAM and MPSK signaling schemes.
出处 《电子与信息学报》 EI CSCD 北大核心 2007年第4期884-887,共4页 Journal of Electronics & Information Technology
基金 国家自然科学基金(60572089) 教育部留学回国人员科研启动基金([2005]383) 重庆市自然科学基金(CSTC2004BB8602) 重庆市留学回国人员科技活动择优资助项目资助课题
关键词 低密度奇偶校验(LDPC)码 带宽有效传输 MONTE-CARLO方法 Low-Density Parity-Check Codes(LDPC) Bandwidth efficient transmission Monte-Carlo method
  • 相关文献

参考文献5

  • 1Gallager R G.Low-Density Parity-Check Codes.Cambridge,Mass.,MIT Press,1963,Chapter 1,4. 被引量:1
  • 2Davey M C and MacKay D J C.Low density parity check codes over GF(q).IEEE Communications Letters,1998,2(6):165-167. 被引量:1
  • 3Davey M C.Error-correction using low-density parity-check codes.[Ph.D Thesis],University of Cambridge,1999.http://www.inference.phy.cam.ac.uk/mcdavey/papers/davey_phd.html/ 被引量:1
  • 4Kschischang F R,Frey B J,and Loeliger H A.Factor graphs and the sum-product algorithm.IEEE Trans.on Inform.Theory,2001,IT-47(2):498-519. 被引量:1
  • 5Li Xiangming and Soleymani M R.A proof of the Hadamard transform decoding of the belief propagation algorithm for LDPCC over GF(q).IEEE Vehicular Technology Conference,VTC2004-Fall,Los Angeles,Sep.26-29,2004,Vol.4:2518-2519. 被引量:1

同被引文献9

  • 1林雪红,吴伟陵.LDPC码的改进译码算法[J].电路与系统学报,2007,12(3):128-130. 被引量:2
  • 2袁燕,王宗欣.一种新的LDPC译码算法[J].信号处理,2007,23(4):536-538. 被引量:1
  • 3PROAKIS J G . Digital communications[M]. 4th ed. New York: McGraw-Hill Higher Education, 2001 : 821-839. 被引量:1
  • 4GALLAGER R G.Low-density parity-check codes[M]. Cambridge, Mass: MIT Press, 1963. 被引量:1
  • 5DAVEY M C. Error-correction using low-density paritycheck codes[D/OL]. [2002-01-18]. http://www.inference.phy. cam.ac.uk/mcdavey/papers/davey_phd.html. 被引量:1
  • 6VITERBO E, BOUTROS J. A universal lattice code decoder for fading channel[J]. IEEE Transaction on Information Theory, 1999, 45(5): 1639-1642. 被引量:1
  • 7DAVEY M C, MACKAY D J C. Low density parity check codes over GF(q)[J]. IEEE Communications Letters, 1998, 2(6): 165-167. 被引量:1
  • 8HONARY B, MOINIAN A, AMMAR B. Construction of well-structured quasi-cyclic low-density parity check codes[J]. IEE Communications Proceedings, 2005, 152(6): 1081-1085. 被引量:1
  • 9MYUNG S, YANG K, KIM J. Quasi-cyclic LDPC codes for fast encoding[J]. IEEE Transactions on Information Theory, 2005, 51(8): 2894-2901. 被引量:1

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部