Searching for low weight pseudo-codewords
| dc.creator | Chertkov, M. | |
| dc.creator | Stepanov, M. | |
| dc.date | 2007-02-04 | |
| dc.date | 2007-07-30 | |
| dc.date.accessioned | 2026-07-07T08:20:47Z | |
| dc.date.available | 2026-07-07T08:20:47Z | |
| dc.description | 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. | |
| dc.description | 7 pages, 6 figures, proceedings of ITA'07, San Diego | |
| dc.identifier | https://arxiv.org/abs/cs/0702024 | |
| dc.identifier | http://arxiv.org/abs/cs/0702024 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/135167 | |
| dc.subject | Information Theory | |
| dc.title | Searching for low weight pseudo-codewords | |
| dc.type | text |