Skip to Main content Skip to Navigation
New interface
Journal articles

Performance Study of a Near Maximum Likelihood Code-Aided Timing Recovery Technique

Abstract : In this paper, we propose a new code-aided (CA) timing recovery algorithm for various linear constant modulus constellations based on the Maximum Likelihood (ML) estimator. The first contribution is the derivation of a soft estimator expression of the transmitted symbol instead of its true or hard estimated value which is fed into the timing error detector (TED) equation. The proposed expression includes the Log-Likelihood Ratios (LLRs) obtained from a turbo decoder. Our results show that the proposed CA approach achieves almost as good results as the data-aided (DA) approach over a large interval of SNR values while achieving a higher spectral efficiency. We also derive the corresponding CA Cramer Rao Bounds (CRB) for various modulation orders. Contrarily to former work, we develop here the CRB analytical expression for different M-PSK modulation orders and validate them through comparison to empirical CRB obtained by Monte Carlo iterations. The proposed CA estimator realizes an important gain over the non data-aided approach (NDA) and achieves a smaller gap when compared to its relative CA CRB, especially at moderate SNR values where modern systems are constrained to work.
Document type :
Journal articles
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Benoit Geller Connect in order to contact the contributor
Submitted on : Friday, December 25, 2015 - 9:58:18 PM
Last modification on : Wednesday, May 11, 2022 - 3:20:03 PM
Long-term archiving on: : Saturday, March 26, 2016 - 10:40:48 AM


Files produced by the author(s)



Imen Nasr, Benoit Geller, Leila Najjar Atallah, Sofiane Cherif. Performance Study of a Near Maximum Likelihood Code-Aided Timing Recovery Technique. IEEE Transactions on Signal Processing, 2016, ⟨10.1109/TSP.2015.2489602⟩. ⟨hal-01248388⟩



Record views


Files downloads