#### Filter Results:

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper outlines a three-step procedure for determining the low bit error rate performance curve of a wide class of LDPC codes of moderate length. The traditional method to estimate code performance in the higher SNR region is to use a sum of the contributions of the most dominant error events to the probability of error. These dominant error events will… (More)

The traditional method to estimate code performance in the higher SNR region is to use a sum of the contributions of the most dominant error events to the probability of error. If an ML decoder is used, these events will be minimum distance codewords; the traditional decoder used in LDPC codes, some variant of the message passing algorithm, will introduce… (More)

Although the standard Belief Propagation (BP) message passing algorithm (MPA) performs the exact maximum aposteriori (MAP) bit probability calculation for LDPC graphs with no cycles, there is no reason to believe that this algorithm is optimal for graphs with cycles. A number of modifications to the BP algorithm have been proposed, some of which simplify… (More)

Regular LDPC codes are a special class of low-density codes having an equal number of ones in each row and column of the parity check matrix describing the linear code. The uniform structure of regular LDPC codes allows a practical hardware implementation which can efficiently utilize the inherent paral-lelism of the message passing algorithm (MPA) commonly… (More)

- ‹
- 1
- ›