In this paper we propose low complexity LDPC code design and decoding in Z_4 which may be useful to combat phase ambiguities in wireless links affected by strong phase noise. We approximate messages exchanged on the Tanner graph using separable probability density functions. This allows a substantial reduction of decoder memory and complexity, with a negligible performance penalty, compared to ideal Z_4 decoding. Furthermore, we show that the Density Evolution analysis of this suboptimal decoder leads to irregular LDPC designs matching the criteria of binary LDPC codes.

Low-Complexity Z_4 LDPC Code Design under a Gaussian Approximation

FERRARI, MARCO PIETRO;BELLINI, SANDRO;TOMASONI, ALESSANDRO
2012-01-01

Abstract

In this paper we propose low complexity LDPC code design and decoding in Z_4 which may be useful to combat phase ambiguities in wireless links affected by strong phase noise. We approximate messages exchanged on the Tanner graph using separable probability density functions. This allows a substantial reduction of decoder memory and complexity, with a negligible performance penalty, compared to ideal Z_4 decoding. Furthermore, we show that the Density Evolution analysis of this suboptimal decoder leads to irregular LDPC designs matching the criteria of binary LDPC codes.
LDPC codes; density evolution; Z_4
File in questo prodotto:
File Dimensione Formato  
Z4_LDPC.pdf

Accesso riservato

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 147.2 kB
Formato Adobe PDF
147.2 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/706924
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? ND
social impact