Hybrid Decoding of Finite Geometry LDPC Codes

Details Hybrid Decoding of Finite Geometry LDPC Codes Hybrid Decoding of Finite Geometry LDPC Codes

2008-01-08

arxiv.org/abs/0801.1208v4

Computer Science

Information Theory

19 pages, 5 figures, 5 tables

Scientific paper

For finite geometry low-density parity-check codes, heavy row and column weights in their parity check matrix make the decoding with even Min-Sum (MS) variants computationally expensive. To alleviate it, we present a class of hybrid schemes by concatenating a parallel bit flipping (BF) variant with an Min-Sum (MS) variant. In most SNR region of interest, without compromising performance or convergence rate, simulation results show that the proposed hybrid schemes can save substantial computational complexity with respect to MS variant decoding alone. Specifically, the BF variant, with much less computational complexity, bears most decoding load before resorting to MS variant. Computational and hardware complexity is also elaborated to justify the feasibility of the hybrid schemes.

Affiliated with

Also associated with

No associations

Rating

Hybrid Decoding of Finite Geometry 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 Hybrid Decoding of Finite Geometry LDPC Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hybrid Decoding of Finite Geometry LDPC Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-421051