Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

Details Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

2007-10-05

arxiv.org/abs/0710.1182v1

Computer Science

Information Theory

Submitted to the IEEE Transactions on Information Theory

Scientific paper

We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Unfortunately, optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding. To overcome this limitation, we then introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes with multiplexed parallel turbo codes suitable for nonergodic channels and recently reported in the literature.

Affiliated with

Also associated with

No associations

Rating

Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels 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 Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-328923