Computer Science – Information Theory
Scientific paper
2007-02-04
Computer Science
Information Theory
7 pages, 6 figures, proceedings of ITA'07, San Diego
Scientific paper
Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach developed for analysis of the error-floor domain of the codes. Instantons are special, code and decoding specific, configurations of the channel noise contributing most to the Frame-Error-Rate (FER). Instantons are decoded into pseudo-codewords. Instanton/pseudo-codeword with the lowest weight describes the largest Signal-to-Noise-Ratio (SNR) asymptotic of FER, while the whole spectra of the low weight instantons is descriptive of the FER vs SNR profile in the extended error-floor domain. First, we describe a general optimization method that allows to find the instantons for any coding/decoding. Second, we introduce LP-specific pseudo-codeword search algorithm that allows efficient calculations of the pseudo-codeword spectra. Finally, we discuss results of combined BP/LP error-floor exploration experiments for two model codes.
Chertkov Michael
Stepanov Mikhail
No associations
LandOfFree
Searching for low weight pseudo-codewords 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 Searching for low weight pseudo-codewords, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searching for low weight pseudo-codewords will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-714228