We present a new algorithm for joint detection and decoding of iteratively decodable codes transmitted over channels affected by a time-varying phase noise (PN) and a constant frequency offset. The proposed algorithm is obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori distribution of the information symbols and the channel parameters given the channel output. The resulting algorithm employs the soft-output information on the coded symbols provided by the decoder and performs forward-backward recursions, taking into account the joint probability distribution of phase and frequency offset. We present simulation results for high-order coded modulation schemes based on low-density parity-check codes and serially concatenated convolutional codes, showing that, despite its low complexity, the algorithm is able to cope with a strong PN and a significant uncompensated frequency offset, thus avoiding the use of complicated data-aided frequency-estimation schemes operating on a known preamble. The robustness of the algorithm in the presence of a time-varying frequency offset is also discussed.
Joint iterative detection and decoding in the presence of phase noise and frequency offset / Alan, Barbieri; Colavolpe, Giulio; Giuseppe, Caire. - In: IEEE TRANSACTIONS ON COMMUNICATIONS. - ISSN 0090-6778. - 55:(2007), pp. 171-179. [10.1109/TCOMM.2006.887501]
Joint iterative detection and decoding in the presence of phase noise and frequency offset
COLAVOLPE, Giulio;
2007-01-01
Abstract
We present a new algorithm for joint detection and decoding of iteratively decodable codes transmitted over channels affected by a time-varying phase noise (PN) and a constant frequency offset. The proposed algorithm is obtained as an application of the sum-product algorithm to the factor graph representing the joint a posteriori distribution of the information symbols and the channel parameters given the channel output. The resulting algorithm employs the soft-output information on the coded symbols provided by the decoder and performs forward-backward recursions, taking into account the joint probability distribution of phase and frequency offset. We present simulation results for high-order coded modulation schemes based on low-density parity-check codes and serially concatenated convolutional codes, showing that, despite its low complexity, the algorithm is able to cope with a strong PN and a significant uncompensated frequency offset, thus avoiding the use of complicated data-aided frequency-estimation schemes operating on a known preamble. The robustness of the algorithm in the presence of a time-varying frequency offset is also discussed.File | Dimensione | Formato | |
---|---|---|---|
j31.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
584.08 kB
Formato
Adobe PDF
|
584.08 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.