Performance of a Simplified Soft-Distance decoding algorithm for LDPC codes over the Rayleigh fading channel
In this paper, we investigate the performance of a Soft-Input soft-Output decoding algorithm for LDPC codes that uses Euclidean distance as its metric, in the Rayleigh fading channel. It is found that its Bit Error Rate performance is close to that of traditional decoding algorithms like the SumProd...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2013 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/3328 |
| Acceso en línea: | http://hdl.handle.net/11336/3328 |
| Access Level: | acceso abierto |
| Palabra clave: | Ldpc Codes Sof Distance Decoding Rayleigh Channel https://purl.org/becyt/ford/2.2 https://purl.org/becyt/ford/2 |
| Sumario: | In this paper, we investigate the performance of a Soft-Input soft-Output decoding algorithm for LDPC codes that uses Euclidean distance as its metric, in the Rayleigh fading channel. It is found that its Bit Error Rate performance is close to that of traditional decoding algorithms like the SumProduct algorithm and its logarithmic version. Main characteristics of the proposed algorithm and its modification to perform over the Rayleigh channel are described. This algorithm uses squared Euclidean distance as the metric, does not require knowledge of the signal-to-noise ratio of the received signal, and is less complex to implement than other soft-input, soft-output algorithms. |
|---|