期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2012
卷号：1
期号：6
页码：185-190
出版社：Shri Pannalal Research Institute of Technolgy
摘要：Numerous wireless contact systems such as IS-54, superior data tariff for the GSM succession (EDGE), universal interoperability for microwave access (WiMAX) and long term progression (LTE) have adopted low-density parity-check (LDPC), tail-biting intricacy, and turbo codes as the forward error correcting codes (FEC) method on behalf of information and transparency channels. Consequently, several well- organized algorithms have been projected for decoding these codes. Conversely, the dissimilar decoding approach for these two families of codes frequently pilot to dissimilar hardware frameworks. From the time when these codes work side by side in these new broadcasting schemes, it's an tremendous suggestion headed to forge a universal decoder to seize these two heirs of codes. The current work exploits the parity-check matrix (H) illustration of tail biting helix and turbo cipher thus permitting decoding through a amalgamated belief propagation (BP) algorithm. undeniably, the BP algorithm provides a exceedingly efficient wide-ranging slant for devising low-intricacy iterative decoding algorithms in favor of all gyration code classes in addition to turbo codes. Where as a miniature recital thrashing is pragmatic when decoding turbo codes with BP as an alternative of MAP, It is counterbalance by the inferior complication of the BP algorithm and the inborn benefit of a amalgamated decoding structural design.
