Deriving Good LDPC Convolutional Codes from LDPC Block Codes

Details Deriving Good LDPC Convolutional Codes from LDPC Block Codes Deriving Good LDPC Convolutional Codes from LDPC Block Codes

2010-04-28

arxiv.org/abs/1004.5157v3

Computer Science

Information Theory

Submitted to IEEE Transactions on Information Theory, April 2010; revised August 2010, revised November 2010 (essentially fina

Scientific paper

Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant and time-varying LDPC convolutional codes from LDPC block codes and show how earlier proposed LDPC convolutional code constructions can be presented within this framework. Some of the constructed convolutional codes significantly outperform the underlying LDPC block codes. We investigate some possible reasons for this "convolutional gain," and we also discuss the --- mostly moderate --- decoder cost increase that is incurred by going from LDPC block to LDPC convolutional codes.

Affiliated with

Also associated with

No associations

Rating

Deriving Good LDPC Convolutional Codes from LDPC Block 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 Deriving Good LDPC Convolutional Codes from LDPC Block Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deriving Good LDPC Convolutional Codes from LDPC Block Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284222