A low complexity joint semi-blind estimation ...
Type de document :
Communication dans un congrès avec actes
Titre :
A low complexity joint semi-blind estimation of CFO and channel for OFDM systems
Auteur(s) :
Ramadhan, Masmoudi [Auteur]
جامعة جيلالي اليابس [سيدي بلعباس، الجزائر] = Université Djillali Liabès [Sidi Bel Abbès, Algérie] = Djillali Liabes University [Sidi Bel Abbès, Algeria] [UDL]
Djebbar, Ahmed Bouzidi [Auteur]
جامعة جيلالي اليابس [سيدي بلعباس، الجزائر] = Université Djillali Liabès [Sidi Bel Abbès, Algérie] = Djillali Liabes University [Sidi Bel Abbès, Algeria] [UDL]
Dayoub, Iyad [Auteur]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - Département Opto-Acousto-Électronique - UMR 8520 [IEMN-DOAE]
COMmunications NUMériques - IEMN [COMNUM - IEMN]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
جامعة جيلالي اليابس [سيدي بلعباس، الجزائر] = Université Djillali Liabès [Sidi Bel Abbès, Algérie] = Djillali Liabes University [Sidi Bel Abbès, Algeria] [UDL]
Djebbar, Ahmed Bouzidi [Auteur]
جامعة جيلالي اليابس [سيدي بلعباس، الجزائر] = Université Djillali Liabès [Sidi Bel Abbès, Algérie] = Djillali Liabes University [Sidi Bel Abbès, Algeria] [UDL]
Dayoub, Iyad [Auteur]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - Département Opto-Acousto-Électronique - UMR 8520 [IEMN-DOAE]
COMmunications NUMériques - IEMN [COMNUM - IEMN]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
Titre de la manifestation scientifique :
2017 5th International Conference on Electrical Engineering - Boumerdes (ICEE-B)
Ville :
Boumerdes
Pays :
Algérie
Date de début de la manifestation scientifique :
2017-10-29
Éditeur :
IEEE
Mot(s)-clé(s) en anglais :
"OFDM"
"Complexity theory"
"Maximum likelihood estimation"
"Approximation algorithms"
"Cost function"
"Taylor series"
"Complexity theory"
"Maximum likelihood estimation"
"Approximation algorithms"
"Cost function"
"Taylor series"
Discipline(s) HAL :
Informatique [cs]
Informatique [cs]/Réseaux et télécommunications [cs.NI]
Informatique [cs]/Intelligence artificielle [cs.AI]
Sciences de l'ingénieur [physics]
Sciences de l'ingénieur [physics]/Traitement du signal et de l'image [eess.SP]
Sciences de l'ingénieur [physics]/Electronique
Informatique [cs]/Réseaux et télécommunications [cs.NI]
Informatique [cs]/Intelligence artificielle [cs.AI]
Sciences de l'ingénieur [physics]
Sciences de l'ingénieur [physics]/Traitement du signal et de l'image [eess.SP]
Sciences de l'ingénieur [physics]/Electronique
Résumé en anglais : [en]
It is well known that the maximum likelihood (ML) algorithm is characterized by their complexity, which is very high. This paper presents a low-complexity semi-blind algorithm to jointly estimating the Carrier Frequency ...
Lire la suite >It is well known that the maximum likelihood (ML) algorithm is characterized by their complexity, which is very high. This paper presents a low-complexity semi-blind algorithm to jointly estimating the Carrier Frequency Offset (CFO) and channel based on oversampling in the receiving part for an Orthogonal Frequency Division Multiplexing (OFDM) system. The idea is to substitute the exponential term in the cost function by the first order of Taylor series approximation and to estimate the CFO iteratively until obtaining a low residual value. In addition to demonstrating the effectiveness of our algorithms, we derive the Cramer-Rao bound CRB.Lire moins >
Lire la suite >It is well known that the maximum likelihood (ML) algorithm is characterized by their complexity, which is very high. This paper presents a low-complexity semi-blind algorithm to jointly estimating the Carrier Frequency Offset (CFO) and channel based on oversampling in the receiving part for an Orthogonal Frequency Division Multiplexing (OFDM) system. The idea is to substitute the exponential term in the cost function by the first order of Taylor series approximation and to estimate the CFO iteratively until obtaining a low residual value. In addition to demonstrating the effectiveness of our algorithms, we derive the Cramer-Rao bound CRB.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Source :