摘要
LDPC码是一种接近香农限的线性分组码。在研究LDPC码的基本理论的基础上,利用计算机仿真码长、列重和迭代次数影响LDPC码的性能。仿真结果表明:LDPC码长码的误码性能优于短码的误码性能,但当码长达到一定值后,再增加码长,LDPC码的误码率降低的幅度将不大;当码长较小时,增加列重,LDPC码的性能将变差;但当码长足够大时,增加列重,LD-PC码的性能将得到改善。若列重达到一定值时,随着列重增加LDPC码的性能将变差。增加译码迭代次数,LDPC码的性能将得到改善;但当迭代次数足够大时,再增加迭代次数,LDPC码的误码率将不会再降低。
LDPC codes is a kind of linear group codes with near Shannon limit.Based on studying the basic theory of LDPC codes,the impact of codes length,column weight and iteration times on BER performance of LDPC codes are demonstrated by computer simulation and theoretical analysis.The simulation experiment indicated that：LDPC code long-code error performance is superior to short-code error performance,but when the code length reaches a certain value,then increase the code length,BER of LDPC codes lower rate would be small.When the code length is small,increasing the column weight,LDPC codes performance will deteriorate;when code length is large enough,increasing the column weight,LDPC codes performance will be improved,but when the column weight reaches a certain value,as set out priority to increasing the performance of LDPC codes will be worse.To increase the number of decoding iterations,LDPC codes performance will be improved;but when the number of iterations is large enough,then increase the number of iterations,LDPC codes will no longer reduce the error rate.
出处
《科学技术与工程》
2010年第10期2472-2475,共4页
Science Technology and Engineering
