By Topic

Overlapped message passing technique with resource sharing for high speed CMMB LDPC decoder

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Joo-Yul Park ; Dept. of Electron., Comput. & Commun. Eng., Hanyang Univ., Seoul, South Korea ; Ki-Seok Chung

Today, demands for high speed digital communication are getting bigger due to wide deployment of 4G mobile communications and mobile TV services. Requirement for high speed data processing makes forward error correction crucial. LDPC is one of the most popular error correcting codes. In this paper, we propose a novel LDPC decoder for the China Multimedia Mobile Broadcasting (CMMB) standard. The LDPC decoding is carried out iteratively, which leads to relatively long decoding latency. Also, due to long code words, the amount of required memory is huge. To resolve these issues, we propose a novel Overlapped Message Passing (OMP) algorithm with an efficient resource sharing technique. Using the proposed method, we find the best permuted parity check matrix of the CMMB to improve the throughput while minimizing the memory requirement. Using the OMP algorithm only, we could improve the performance by 10%. To avoid potential memory access conflicts, a memory grouping technique to improve pipelining performance is also proposed. By applying all the techniques that we propose in this paper, we could improve the performance up to by 451.

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:57 ,  Issue: 4 )