A Non-Disjoint Group Shuffled Decoding for LDPC Codes

Details A Non-Disjoint Group Shuffled Decoding for LDPC Codes A Non-Disjoint Group Shuffled Decoding for LDPC Codes

2012-02-06

arxiv.org/abs/1202.1060v1

Computer Science

Information Theory

5 pages, 6 figures, submitted to ISIT2012

Scientific paper

To reduce the implementation complexity of a belief propagation (BP) based low-density parity-check (LDPC) decoder, shuffled BP decoding schedules, which serialize the decoding process by dividing a complete parallel message-passing iteration into a sequence of sub-iterations, have been proposed. The so-called group horizontal shuffled BP algorithm partitions the check nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes a new grouping technique to accelerate the message-passing rate. Performance of the proposed algorithm is analyzed by a Gaussian approximation approach. Both analysis and numerical experiments verify that the new algorithm does yield a convergence rate faster than that of existing conventional or group shuffled BP decoder with the same computing complexity constraint.

Affiliated with

Also associated with

No associations

Rating

A Non-Disjoint Group Shuffled Decoding for LDPC Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Non-Disjoint Group Shuffled Decoding for LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Non-Disjoint Group Shuffled Decoding for LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-117950