Code-aided Maximum-likelihood Ambiguity Resolution Through Free-energy Minimization - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Signal Processing Année : 2010

Code-aided Maximum-likelihood Ambiguity Resolution Through Free-energy Minimization

Résumé

In digital communication receivers, ambiguities in terms of timing and phase need to be resolved prior to data detection. In the presence of powerful error-correcting codes, which operate in low signal to noise ratios (SNR), long training sequences are needed to achieve good performance. In this contribution, we develop a new class of code-aided ambiguity resolution algorithms, which require no training sequence and achieve good performance with reasonable complexity. In particular, we focus on algorithms that compute the maximum-likelihood (ML) solution (exactly or in good approximation) with a tractable complexity, using a factor-graph representation. The complexity of the proposed algorithm is discussed, and reduced complexity variations, including stopping criteria and sequential implementation, are developed.
Fichier principal
Vignette du fichier
manuscript.pdf (249.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00589353 , version 1 (09-01-2012)

Identifiants

  • HAL Id : inria-00589353 , version 1

Citer

Cédric Herzet, Woradit Kampol, Henk Wymeersch, Luc Vandendorpe. Code-aided Maximum-likelihood Ambiguity Resolution Through Free-energy Minimization. IEEE Transactions on Signal Processing, 2010. ⟨inria-00589353⟩
68 Consultations
175 Téléchargements

Partager

Gmail Facebook X LinkedIn More