Low-density parity-check codes for nonergodic block-fading channels
We design 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. Since optimal constructions for maximum-likelihood decoding do not perf...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | Universitat Pompeu Fabra |
| Repositorio: | Repositorio Digital de la UPF |
| OAI Identifier: | oai:repositori.upf.edu:10230/20436 |
| Acceso en línea: | http://hdl.handle.net/10230/20436 http://dx.doi.org/10.1109/TIT.2010.2053890 |
| Access Level: | acceso abierto |
| Palabra clave: | Comunicació sense fil, Sistemes de Block-fading (BF) channel Iterative decoding Low-density parity-check (LDPC) codes Maximum-likelihood (ML) decoding Maximum-distance separable (MDS) codes Outage probability |
| Sumario: | We design 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. Since optimal constructions for maximum-likelihood decoding do not perform/nwell under iterative decoding, we 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 favorably with multiplexed parallel turbo codes for nonergodic channels. |
|---|