Reduced-complexity synchronization for high-order coded modulations

Martalo M.;
2015-01-01

Abstract

This paper focuses on phase noise-impaired communications. An efficient Maximum A-posteriori Probability (MAP) iterative synchronization algorithm, where detection and decoding are performed separately from phase estimation, is proposed. This approach has the following key advantages: (i) its computational complexity is relatively low and its performance is near optimal; (ii) it requires very limited statistical knowledge of the phase noise process; and (iii) it enables the direct use of 'off-the-shelf' demodulation and decoding blocks. These features are particularly attractive from the implementation viewpoint, as they lead to the design of effective pragmatic high-order coded modulated schemes. The proposed iterative synchronization and decoding algorithm, evaluated for Low-Density Parity-Check (LDPC)-coded pilot symbol-assisted Quadrature Amplitude Modulation (QAM) schemes, entails a negligible energy efficiency loss with respect to optimized joint decoding and phase estimation approaches, with significantly lower computational complexity.
2015
Inglese
2015 Proceedings of IEEE Int. Conf. on Communications (ICC 2015)
978-1-4673-6432-4
Institute of Electrical and Electronics Engineers
USA
STATI UNITI D'AMERICA
4721
4726
6
http://ieeexplore.ieee.org/document/7249069/
2015 IEEE Int. Conf. on Communications (ICC 2015)
Esperti anonimi
8-12 giugno 2015
Londra, UK
internazionale
scientifica
iterative decoding
Maximum A Posteriori (MAP) receiver
Phase noise suppression
synchronization
no
4 Contributo in Atti di Convegno (Proceeding)::4.1 Contributo in Atti di convegno
Martalo, M.; Ferrari, G.; Asim, M.; Gambini, J.; Mazzucco, C.; Cannalire, G.; Bianchi, S.; Raheli, R.
273
8
4.1 Contributo in Atti di convegno
reserved
info:eu-repo/semantics/conferencePaper
File in questo prodotto:
File Dimensione Formato  
07249069.pdf

Solo gestori archivio

Dimensione 818.23 kB
Formato Adobe PDF
818.23 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.

Questionario e social

Condividi su:
Impostazioni cookie