Karine AMIS

Poste

Enseignant-chercheur

Département

Département Signal et Communication

Localisation

Brest

Coordonnées :

Tél.

+33 2 29 00 13 59
Biographie

Maître de conférence au département Signal et Communications depuis décembre 2001

Animatrice de l'axe Télécom de l'équipe COM du pôle CACS du laboratoire CNRS LabSTICC

Cursus universitaire

1998 - Ingénieur de l'ENST Bretagne et Diplôme d'Etudes Approfondies de l'Université de Rennes 1

2001 - Docteur de l'Université de Rennes

2014 - Habilitation à Diriger des Recherches de l'Université de Bretagne Occidentale

2016 - Qualification au poste de Professeur section CNU 61

 

 

 

Codage de l'information et algorithmes de détection

  • Allocation de ressources,
  • Gestion des interférences pour les systèmes MIMO de grande dimension (large-scale MIMO)
  • Transmissions haut débit,
  • Communications machine-to-machine

Projet d'avenir 2017-2021 de l'axe Télécom "Systèmes radio-mobiles 5G et au-delà"

Sonia ZAIBI, "Optimisation conjointe du codage (décodage) source-canal pour la transmission d'images", Thèse Université de Bretagne Occidentale, février 2002

Massinissa LALAM, "Optimisation de la concaténation de codes spatio-temporels et code correcteurs d'erreurs dans une transmission MIMO", Thèse ENST Bretagne en habilitation conjointe avec l'Université de Rennes 1, décembre 2006

Nicolas LE JOSSE, "Turbo égalisation MIMO pour une transmission ST-BICM sur canaux sélectifs en fréquence", Thèse ENST Bretagne en habilitation conjointe avec l'Université de Rennes 1, juin 2007

Patricia ARMANDO, "Systèmes de transmission MIMO codés espace temps sur canaux sélectifs en fréquence pour des applications WiFi ou WiMAX", Thèse TELECOM Bretagne en habilitation conjointe avec l'UBO, décembre 2009

Mohamad SAYED-HASSAN, "Codage espace temps correcteur d'erreur", Thèse TELECOM Bretagne en habilitation conjointe avec l'UBO, décembre 2010

Yizhi YIN, "Codage réseau pour des applications sans fil", Thèse TELECOM Bretagne en habilitation conjointe avec l'Université de Rennes 1, 2012

Yasser FADLALLAH, "Réduction d'interférence dans les systèmes de transmission sans fil", Thèse TELECOM Bretagne en habilitation conjointe avec l'UBO, 2013

Abdelhakim YOUCEF, "Optimisation de la consommation énergétique pour les transmissions acoustiques sous-marines", Thèse TELECOM Bretagne en habilitation conjointe avec l'UBO, 2013

Thanh Nhân VO, "Techniques MIMO pour l'optimisation et l'allocation de ressources des systèmes PLC", Thèse TELECOM Bretagne en habilitation conjointe avec l'UBO, 2015

Malek MESSAI, "Réception robuste des signaux GFSK", Thèse TELECOM Bretagne en habilitation conjointe avec l'UBO, 2015

Nicolas ALIBERT "Algorithmes itératifs de prédistorsion adaptés à la montée en débit des communications par satellite", Thèse Thèse de l'école doctorale MathSTIC (2015-2018) (CIFRE MERCE)

Zahran HAJJI "gestion des interférences dans les systèmes Massive MIMO pour la 5G", Thèse de l'école doctorale MathSTIC, (2015-2018)

Fangping YE "Théorie de l'information pour la télévision interactive : bornes théoriques et schémas de codage", Thèse de l'école doctorale MathSTIC (2016-2019)

Kaoutar ABDELALIM "Etude et optimisation des protocoles PHY et MAC du 802.11 vers une nouvelle génération de Wi-Fi intégrée à la future 5G", Thèse de l'école doctorale MathSTIC (2016-2019) (CIFRE Orange)

Matières enseignées

  • Mathematiques pour l'Ingénieur (algèbre linéaire, analyse, probabilités et processus stochastiques)
  • Traitement du signal
  • Communications Numériques

Responsabilités (thématique d'approfondissement, unités d'enseignement)

  • TAF Ingénierie des systèmes de communication avec M. Morvan (FISE)
  • UE Analyse Traitement du Signal Automatique avec F. Claveau (FISE)
  • UE SIT 130 Mathématiques pour l'Ingénieur (FIP)

 

Publications HAL
Communication dans un congrès
Hajji Zahran, Amis Cavalec Karine, Aissa El Bey Abdeldjalil
Joint channel estimation and simplicity-based detection for large-scale MIMO FEC-coded systems
10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), Dec 2018, Honk-Kong, China. Proceedings 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018
Bibtext :
@inproceedings{hajji:hal-01893584,
TITLE = {{Joint channel estimation and simplicity-based detection for large-scale MIMO FEC-coded systems}},
AUTHOR = {Hajji, Zahran and Amis Cavalec, Karine and Aissa El Bey, Abdeldjalil},
URL = {https://hal.archives-ouvertes.fr/hal-01893584},
BOOKTITLE = {{10th International Symposium on Turbo Codes \& Iterative Information Processing (ISTC)}},
ADDRESS = {Honk-Kong, China},
HAL_LOCAL_REFERENCE = {19247},
PAGES = {.},
YEAR = {2018},
MONTH = Dec,
KEYWORDS = {Channel estimation ; Simplicity ; Massive MIMO ; Turbo-detection},
PDF = {https://hal.archives-ouvertes.fr/hal-01893584/file/1570474591.pdf},
HAL_ID = {hal-01893584},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Joint channel estimation and simplicity-based detection for large-scale MIMO FEC-coded systems
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (SC)
%A Hajji, Zahran
%A Amis Cavalec, Karine
%A Aissa El Bey, Abdeldjalil
%< avec comité de lecture
%Z 19247
%( Proceedings 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
%B 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
%C Honk-Kong, China
%P .
%8 2018-12-03
%D 2018
%K Channel estimation
%K Simplicity
%K Massive MIMO
%K Turbo-detection
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X In this paper, we address the problem of channel estimation and signal detection in large MIMO FEC-coded systems assuming finite alphabet modulations. We consider a semi-blind iterative expectation maximization algorithm which relies on a limited number of pilot sequences to initialize the estimation process. We propose to include the estimation process within a turbo finite-alphabet simplicity (FAS)-based detection receiver. To that purpose we define two estimation updates from the FEC decoder output. Simulations carried out in both determined and undetermined configurations show that the resulting scheme outperforms the state-of-the-art receiver which uses an MMSE estimation criterion and that it reaches the maximum-likelihood lower-bound.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01893584/document
%2 https://hal.archives-ouvertes.fr/hal-01893584/file/1570474591.pdf
%L hal-01893584
%U https://hal.archives-ouvertes.fr/hal-01893584
%~ TELECOM-BRETAGNE
%~ INSTITUT-TELECOM
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ LAB-STICC_IMTA
Article dans une revue
Hajji Zahran, Aïssa-El-Bey Abdeldjalil, Amis Cavalec Karine
Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems
Digital Signal Processing, Elsevier, 2018, 〈10.1016/j.dsp.2018.05.012〉
Bibtext :
@article{hajji:hal-01811519,
TITLE = {{Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems}},
AUTHOR = {Hajji, Zahran and A{\"i}ssa-El-Bey, Abdeldjalil and Amis Cavalec, Karine},
URL = {https://hal.archives-ouvertes.fr/hal-01811519},
JOURNAL = {{Digital Signal Processing}},
HAL_LOCAL_REFERENCE = {18997},
PUBLISHER = {{Elsevier}},
PAGES = {.},
YEAR = {2018},
MONTH = Sep,
DOI = {10.1016/j.dsp.2018.05.012},
KEYWORDS = {Compressed sensing ; Source separation ; Underdetermined systems ; Sparsity ; Simplicity ; Massive MIMO},
PDF = {https://hal.archives-ouvertes.fr/hal-01811519/file/simplicity-based-recovery.pdf},
HAL_ID = {hal-01811519},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Simplicity-based recovery of finite-alphabet signals for large-scale MIMO systems
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (SC)
%A Hajji, Zahran
%A Aïssa-El-Bey, Abdeldjalil
%A Amis Cavalec, Karine
%< avec comité de lecture
%Z 18997
%@ 1051-2004
%J Digital Signal Processing
%I Elsevier
%P .
%8 2018-09
%D 2018
%R 10.1016/j.dsp.2018.05.012
%K Compressed sensing
%K Source separation
%K Underdetermined systems
%K Sparsity
%K Simplicity
%K Massive MIMO
%Z Engineering Sciences [physics]/Signal and Image processingJournal articles
%X In this paper, we consider the problem of finite-alphabet source separation in both determined and underdetermined large-scale systems. First, we address the noiseless case and we propose a linear criterion based on ℓ1-minimization combined with box constraints. We investigate also the system conditions that ensure successful recovery. Next, we apply the approach to the noisy massive MIMO transmission and we propose a quadratic criterion-based detector. Simulation results show the efficiency of the proposed detection methods for various QAM modulations and MIMO configurations. We mention that there is no change in the computational complexity when the constellation size increases. Moreover, the proposed method outperforms the classical Minimum Mean Square Error (MMSE)-based detection algorithms.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01811519/document
%2 https://hal.archives-ouvertes.fr/hal-01811519/file/simplicity-based-recovery.pdf
%L hal-01811519
%U https://hal.archives-ouvertes.fr/hal-01811519
%~ CNRS
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ UNIV-BREST
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Communication dans un congrès
Ye Fangping, Mheich Zeina, Dupraz Elsa, Amis Cavalec Karine
Optimized Short-Length Rate-Adaptive LDPC Codes for Slepian-Wolf Source Coding
ICT 2018 : International Conference on Telecommunication, Jun 2018, Saint Malo, France. Actes ICT 2018 : International Conference on Telecommunication, 2018
Bibtext :
@inproceedings{ye:hal-01845169,
TITLE = {{Optimized Short-Length Rate-Adaptive LDPC Codes for Slepian-Wolf Source Coding}},
AUTHOR = {Ye, Fangping and Mheich, Zeina and Dupraz, Elsa and Amis Cavalec, Karine},
URL = {https://hal.archives-ouvertes.fr/hal-01845169},
BOOKTITLE = {{ICT 2018 : International Conference on Telecommunication}},
ADDRESS = {Saint Malo, France},
HAL_LOCAL_REFERENCE = {19101},
PAGES = {.},
YEAR = {2018},
MONTH = Jun,
KEYWORDS = {LDPC codes ; Source coding},
HAL_ID = {hal-01845169},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Optimized Short-Length Rate-Adaptive LDPC Codes for Slepian-Wolf Source Coding
%+ Département Signal et Communications (SC)
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Lab-STICC_IMTA_CACS_COM
%A Ye, Fangping
%A Mheich, Zeina
%A Dupraz, Elsa
%A Amis Cavalec, Karine
%< avec comité de lecture
%Z 19101
%( Actes ICT 2018 : International Conference on Telecommunication
%B ICT 2018 : International Conference on Telecommunication
%C Saint Malo, France
%P .
%8 2018-06-26
%D 2018
%K LDPC codes
%K Source coding
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X This paper proposes a new construction of rate-adaptive coding schemes based on Low Density Parity Check (LDPC) codes for Slepian Wolf source coding. Unlike standard rate-adaptive source coding schemes, the code construction we propose is based on finite-length code design tools that permit to greatly improve the decoding performance at short to moderate length. In particular, our method permits to limit the number of short cycles in the codes at all rates of interest, and to avoid eliminating some source bits from the code constraints. The proposed method shows a performance improvement of up to an order of magnitude at almost all the considered rates compared to the standard LDPCA construction.
%G French
%L hal-01845169
%U https://hal.archives-ouvertes.fr/hal-01845169
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ UNIV-BREST
%~ IMT-ATLANTIQUE
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_COM
%~ LAB-STICC_IMTA
Communication dans un congrès
Alibert Nicolas, Amis Cavalec Karine, Langlais Charlotte, Castelain Damien
Comparison of signal predistortion schemes based on the contraction mapping for satellite communications with channel identification
25th International Conference on Telecommunications, Jun 2018, Saint-Malo, France. Proceedings 25th International Conference on Telecommunications, 2018
Bibtext :
@inproceedings{alibert:hal-01874080,
TITLE = {{Comparison of signal predistortion schemes based on the contraction mapping for satellite communications with channel identification}},
AUTHOR = {Alibert, Nicolas and Amis Cavalec, Karine and Langlais, Charlotte and Castelain, Damien},
URL = {https://hal.archives-ouvertes.fr/hal-01874080},
BOOKTITLE = {{25th International Conference on Telecommunications}},
ADDRESS = {Saint-Malo, France},
HAL_LOCAL_REFERENCE = {19202},
PAGES = {.},
YEAR = {2018},
MONTH = Jun,
KEYWORDS = {Predistortion ; Power amplifiers ; Contraction mapping theorem ; Satellite communications},
HAL_ID = {hal-01874080},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Comparison of signal predistortion schemes based on the contraction mapping for satellite communications with channel identification
%+ Département Signal et Communications (SC)
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Mitsubishi Electric R&D Centre Europe (Entreprise) (MERCE)
%+ Lab-STICC_IMTA_CACS_COM
%+ Lab-STICC_IMTA_CACS_IAS
%+ Département Electronique (ELEC)
%A Alibert, Nicolas
%A Amis Cavalec, Karine
%A Langlais, Charlotte
%A Castelain, Damien
%< avec comité de lecture
%Z 19202
%( Proceedings 25th International Conference on Telecommunications
%B 25th International Conference on Telecommunications
%C Saint-Malo, France
%P .
%8 2018-06-26
%D 2018
%K Predistortion
%K Power amplifiers
%K Contraction mapping theorem
%K Satellite communications
%Z Engineering Sciences [physics]/Electronics
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X The expected increase of data rates in future satellite communications (DVB-S2X) will require higher-order modula- tions and sharper roll-off, which makes the transmission more sensitive to non-linear interference due to on-board amplifiers. One solution is the predistortion of the signal that is carried out at the transmitter either on the data sequence (data- based) or on the modulated signal (signal-based). In this paper, we focus on single carrier communication and consider two signal-based predistortion techniques relying on the contraction mapping theorem, optimized from an error defined either from the data (data-optimized) or from the modulated signal (signal- optimized). We compare both schemes according to different figures of merit (normalized minimum square error, adjacent channel interference, total degradation and robustness towards channel identification). We show that, under realistic satellite transmission conditions, including satellite channel model and channel identification, the data-optimized signal predistortion scheme outperforms the signal-optimized scheme in terms of total degradation, whereas the signal-optimized scheme minimizes the adjacent channel interference due to spectral regrowth
%G English
%L hal-01874080
%U https://hal.archives-ouvertes.fr/hal-01874080
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ IMTA_ELEC
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_IAS
%~ LAB-STICC_IMTA_CACS_COM
%~ LAB-STICC_IMTA
Communication dans un congrès
Ye Fangping, Dupraz Elsa, Amis Cavalec Karine
Rate-adaptive LDPC code construction for Free-Viewpoint Television
National Conference on Information Theory and Complex Systems (TINKOS),, Jun 2018, Belgrade, Serbia. Proceedings National Conference on Information Theory and Complex Systems (TINKOS),, 2018
Bibtext :
@inproceedings{ye:hal-01847319,
TITLE = {{Rate-adaptive LDPC code construction for Free-Viewpoint Television}},
AUTHOR = {Ye, Fangping and Dupraz, Elsa and Amis Cavalec, Karine},
URL = {https://hal.archives-ouvertes.fr/hal-01847319},
BOOKTITLE = {{National Conference on Information Theory and Complex Systems (TINKOS),}},
ADDRESS = {Belgrade, Serbia},
HAL_LOCAL_REFERENCE = {19103},
PAGES = {.},
YEAR = {2018},
MONTH = Jun,
HAL_ID = {hal-01847319},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Rate-adaptive LDPC code construction for Free-Viewpoint Television
%+ Département Signal et Communications (SC)
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Lab-STICC_IMTA_CACS_COM
%A Ye, Fangping
%A Dupraz, Elsa
%A Amis Cavalec, Karine
%< avec comité de lecture
%Z 19103
%( Proceedings National Conference on Information Theory and Complex Systems (TINKOS),
%B National Conference on Information Theory and Complex Systems (TINKOS),
%C Belgrade, Serbia
%P .
%8 2018-06-18
%D 2018
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X This paper considers source coding for Free-Viewpoint television. It proposes a novel rate-adaptive LDPC code construction that allows to adapt the coding rate depending on the successive user requests. The propose construction greatly reduces the source coding rate compared to existing solutions.
%G English
%L hal-01847319
%U https://hal.archives-ouvertes.fr/hal-01847319
%~ TELECOM-BRETAGNE
%~ INSTITUT-TELECOM
%~ CNRS
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ UNIV-BREST
%~ IMT-ATLANTIQUE
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_COM
%~ LAB-STICC_IMTA
Communication dans un congrès
Hajji Zahran, Amis Cavalec Karine, Aïssa-El-Bey Abdeldjalil
Turbo detection based on signal simplicity and compressed sensing for massive MIMO transmission
IEEE Wireless Communications and Networking Conference (WCNC), Apr 2018, Barcelona, Spain. Proceedings IEEE Wireless Communications and Networking Conference (WCNC), 2018
Bibtext :
@inproceedings{hajji:hal-01770947,
TITLE = {{Turbo detection based on signal simplicity and compressed sensing for massive MIMO transmission}},
AUTHOR = {Hajji, Zahran and Amis Cavalec, Karine and A{\"i}ssa-El-Bey, Abdeldjalil},
URL = {https://hal.archives-ouvertes.fr/hal-01770947},
BOOKTITLE = {{IEEE Wireless Communications and Networking Conference (WCNC)}},
ADDRESS = {Barcelona, Spain},
HAL_LOCAL_REFERENCE = {18546},
PAGES = {.},
YEAR = {2018},
MONTH = Apr,
KEYWORDS = {Source separation ; Massive MIMO ; Turbo detection},
PDF = {https://hal.archives-ouvertes.fr/hal-01770947/file/turbo-detection-based.pdf},
HAL_ID = {hal-01770947},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Turbo detection based on signal simplicity and compressed sensing for massive MIMO transmission
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (SC)
%A Hajji, Zahran
%A Amis Cavalec, Karine
%A Aïssa-El-Bey, Abdeldjalil
%< avec comité de lecture
%Z 18546
%( Proceedings IEEE Wireless Communications and Networking Conference (WCNC)
%B IEEE Wireless Communications and Networking Conference (WCNC)
%C Barcelona, Spain
%P .
%8 2018-04-15
%D 2018
%K Source separation
%K Massive MIMO
%K Turbo detection
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X In this paper, we address the problem of large MIMO detection assuming QAM constellations. We show that the QAM signal becomes a simple signal (that is to say a bounded signal with extreme elements equal to the inferior and superior bounds [1]) after a real transformation. Based on this property, we present a low complexity detection algorithm which significantly outperforms classic algorithms such as zero forcing (ZF) and minimum mean square error (MMSE) algorithms. The proposed detection technique is based on a quadratic programming criterion whose constraints ensure that the detected vector is simple. We implement it successfully in an underdetermined MIMO system (the number of observations is less than the number of sources) and we show the necessary conditions of success detection. Then we consider an outer forward error correcting (FEC) code and we propose a turbo detection scheme. Based on the investigation of the output detector statistics in [2], we propose a symbol to binary converter (SBC) which can feed the FEC decoder with reliable output. On the other side, from the second iteration, the detection scheme resorts to a regularized quadratic criterion so that the searched vector draws near to the estimate resulting from the FEC decoder output. Simulation results show the efficiency of the proposed scheme.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01770947/document
%2 https://hal.archives-ouvertes.fr/hal-01770947/file/turbo-detection-based.pdf
%L hal-01770947
%U https://hal.archives-ouvertes.fr/hal-01770947
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ UNIV-BREST
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Article dans une revue
Nhan Nhat-Quang, Rostaing Philippe, Amis Karine, Collin Ludovic, Radoi Emanuel
Optimization of linear MIMO precoding assuming MMSE-based turbo equalization
Digital Signal Processing, Elsevier, 2018, 75, pp.45 - 55. 〈10.1016/j.dsp.2017.12.010〉
Bibtext :
@article{nhan:hal-01698948,
TITLE = {{Optimization of linear MIMO precoding assuming MMSE-based turbo equalization}},
AUTHOR = {Nhan, Nhat-Quang and Rostaing, Philippe and Amis, Karine and Collin, Ludovic and Radoi, Emanuel},
URL = {https://hal.archives-ouvertes.fr/hal-01698948},
JOURNAL = {{Digital Signal Processing}},
PUBLISHER = {{Elsevier}},
VOLUME = {75},
PAGES = {45 - 55},
YEAR = {2018},
MONTH = Apr,
DOI = {10.1016/j.dsp.2017.12.010},
HAL_ID = {hal-01698948},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Optimization of linear MIMO precoding assuming MMSE-based turbo equalization
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Département Signal et Communications (SC)
%+ Lab-STICC_UBO_CACS_COM
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Lab-STICC_UBO_CACS_COM
%A Nhan, Nhat-Quang
%A Rostaing, Philippe
%A Amis, Karine
%A Collin, Ludovic
%A Radoi, Emanuel
%< avec comité de lecture
%@ 1051-2004
%J Digital Signal Processing
%I Elsevier
%V 75
%P 45 - 55
%8 2018-04
%D 2018
%R 10.1016/j.dsp.2017.12.010
%Z Engineering Sciences [physics]/Signal and Image processing
%Z Computer Science [cs]/Information Theory [cs.IT]Journal articles
%G English
%L hal-01698948
%U https://hal.archives-ouvertes.fr/hal-01698948
%~ CNRS
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ LAB-STICC_ENIB
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_UBO_CACS
%~ UNIV-BREST
%~ LAB-STICC_UBO
%~ LAB-STICC_UBO_CACS_COM
%~ IMTA_SC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Article dans une revue
Messai Malek, Aïssa-El-Bey Abdeldjalil, Amis Cavalec Karine, Guilloud Frédéric
Improved sparse multiuser detection based on modulation-alphabets exploitation
Digital Signal Processing, Elsevier, 2017, 71, pp.27 - 35. 〈10.1016/j.dsp.2017.08.011〉
Bibtext :
@article{messai:hal-01609983,
TITLE = {{Improved sparse multiuser detection based on modulation-alphabets exploitation}},
AUTHOR = {Messai, Malek and A{\"i}ssa-El-Bey, Abdeldjalil and Amis Cavalec, Karine and GUILLOUD, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01609983},
JOURNAL = {{Digital Signal Processing}},
HAL_LOCAL_REFERENCE = {18192},
PUBLISHER = {{Elsevier}},
VOLUME = {71},
PAGES = {27 - 35},
YEAR = {2017},
MONTH = Dec,
DOI = {10.1016/j.dsp.2017.08.011},
KEYWORDS = {Compressed sensing ; Group orthogonal matching pursuit ; L1-minimization ; Sparsity ; Multi-user detection ; Sporadic communication},
HAL_ID = {hal-01609983},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Improved sparse multiuser detection based on modulation-alphabets exploitation
%+ Département Signal et Communications (SC)
%+ Lab-STICC_IMTA_CACS_COM
%A Messai, Malek
%A Aïssa-El-Bey, Abdeldjalil
%A Amis Cavalec, Karine
%A GUILLOUD, Frédéric
%< avec comité de lecture
%Z 18192
%@ 1051-2004
%J Digital Signal Processing
%I Elsevier
%V 71
%P 27 - 35
%8 2017-12
%D 2017
%R 10.1016/j.dsp.2017.08.011
%K Compressed sensing
%K Group orthogonal matching pursuit
%K L1-minimization
%K Sparsity
%K Multi-user detection
%K Sporadic communication
%Z Engineering Sciences [physics]/Signal and Image processingJournal articles
%X In this paper, we focus on sporadic random-access communications and consider compressed-sensing (CS) techniques to perform the multiuser detection (MUD). Since all the users do not necessarily transmit information, MUD consists in detecting the transmitting users (activity detection) and their corresponding transmitted data (data detection). The main results presented here rely on the exploitation of the user signal alphabet knowledge within the detection step. To this aim, several modifications of the group orthogonal matching pursuit (GOMP) algorithm were proposed, differing in the way the modulation alphabet knowledge is considered within the detection stage. These modifications can be extended to any greedy-based CS-MUD. To overcome the error floor occurring at high SNR with a higher number of active users, we then propose an iterative minimization-based MUD algorithm that alternates between activity and data detection. Compared to the existing GOMP-based CS-MUD, the proposed modified GOMP algorithms exhibit a significant gain with almost the same complexity. The iterative minimization-based MUD algorithm has a higher complexity but outperforms all the others without any observed error-floor.
%G English
%L hal-01609983
%U https://hal.archives-ouvertes.fr/hal-01609983
%~ TELECOM-BRETAGNE
%~ INSTITUT-TELECOM
%~ CNRS
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ UNIV-BREST
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_COM
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Article dans une revue
Nhan Nhat-Quang, Rostaing Philippe, Amis Karine, Radoi Emanuel, Zheng Yahong Rosa
Precoded MIMO Systems with Non-Binary LDPC Codes and Many-to-One Mapping
IEEE Transactions on Vehicular Technology, Institute of Electrical and Electronics Engineers, 2017, pp.1 - 1. 〈10.1109/TVT.2017.2778005〉
Bibtext :
@article{nhan:hal-01698947,
TITLE = {{Precoded MIMO Systems with Non-Binary LDPC Codes and Many-to-One Mapping}},
AUTHOR = {Nhan, Nhat-Quang and Rostaing, Philippe and Amis, Karine and Radoi, Emanuel and Zheng, Yahong Rosa},
URL = {https://hal.archives-ouvertes.fr/hal-01698947},
JOURNAL = {{IEEE Transactions on Vehicular Technology}},
PUBLISHER = {{Institute of Electrical and Electronics Engineers}},
PAGES = {1 - 1},
YEAR = {2017},
MONTH = Nov,
DOI = {10.1109/TVT.2017.2778005},
HAL_ID = {hal-01698947},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Precoded MIMO Systems with Non-Binary LDPC Codes and Many-to-One Mapping
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Département Signal et Communications (SC)
%+ Lab-STICC_UBO_CACS_COM
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Missouri University of Science and Technology (Missouri S&T)
%A Nhan, Nhat-Quang
%A Rostaing, Philippe
%A Amis, Karine
%A Radoi, Emanuel
%A Zheng, Yahong Rosa
%< avec comité de lecture
%@ 0018-9545
%J IEEE Transactions on Vehicular Technology
%I Institute of Electrical and Electronics Engineers
%P 1 - 1
%8 2017-11-01
%D 2017
%R 10.1109/TVT.2017.2778005
%Z Engineering Sciences [physics]/Signal and Image processing
%Z Computer Science [cs]/Information Theory [cs.IT]Journal articles
%G English
%L hal-01698947
%U https://hal.archives-ouvertes.fr/hal-01698947
%~ CNRS
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ LAB-STICC_ENIB
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_UBO_CACS
%~ UNIV-BREST
%~ LAB-STICC_UBO
%~ LAB-STICC_UBO_CACS_COM
%~ IMTA_SC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Article dans une revue
Nhan Nhat Quang, Rostaing Philippe, Amis Cavalec Karine, Collin Ludovic, Radoi Emanuel
Complexity Reduction for the Optimization of Linear Precoders over Random MIMO Channels
IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 2017, 65 (10), pp.4205 - 4217. 〈10.1109/TCOMM.2017.2716375〉
Bibtext :
@article{nhan:hal-01656269,
TITLE = {{Complexity Reduction for the Optimization of Linear Precoders over Random MIMO Channels}},
AUTHOR = {Nhan, Nhat Quang and Rostaing, Philippe and Amis Cavalec, Karine and COLLIN, Ludovic and Radoi, Emanuel},
URL = {https://hal.archives-ouvertes.fr/hal-01656269},
JOURNAL = {{IEEE Transactions on Communications}},
HAL_LOCAL_REFERENCE = {17961},
PUBLISHER = {{Institute of Electrical and Electronics Engineers}},
VOLUME = {65},
NUMBER = {10},
PAGES = {4205 - 4217},
YEAR = {2017},
MONTH = Oct,
DOI = {10.1109/TCOMM.2017.2716375},
KEYWORDS = {Linear precoding ; MIMO ; Iterative receiver ; EXIT charts ; Mutual information},
HAL_ID = {hal-01656269},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Complexity Reduction for the Optimization of Linear Precoders over Random MIMO Channels
%+ Département Electronique - UFR Sciences et Techniques - Université de Brest
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (SC)
%A Nhan, Nhat Quang
%A Rostaing, Philippe
%A Amis Cavalec, Karine
%A COLLIN, Ludovic
%A Radoi, Emanuel
%< avec comité de lecture
%Z 17961
%@ 0090-6778
%J IEEE Transactions on Communications
%I Institute of Electrical and Electronics Engineers
%V 65
%N 10
%P 4205 - 4217
%8 2017-10
%D 2017
%R 10.1109/TCOMM.2017.2716375
%K Linear precoding
%K MIMO
%K Iterative receiver
%K EXIT charts
%K Mutual information
%Z Engineering Sciences [physics]/Signal and Image processingJournal articles
%X Precoder optimization with full channel state in- formation (CSI) for finite alphabet signals over multiple-input multiple-output (MIMO) random channels is investigated in this paper. The precoder is represented by a product of power allocation matrix and constellation-forming matrix. There was an optimal algorithm introduced in literature to globally maximize the channel mutual information by iteratively optimizing these two matrices. However, the computational complexity of the optimal algorithm is painfully high, especially when it is used with high-order modulation and high data stream number. In this paper, we propose a novel sub-optimal low-complexity precoding algorithm and compare it with the optimal one. The new algorithm proceeds in two steps. First, the constellation-forming matrix is fixed in order to maximize the minimum Euclidean distance between the received symbols, which ensures high chan- nel mutual information. Then, given the constellation-forming matrix, an iterative algorithm searches for the power allocation matrix that maximizes the channel mutual information. Since optimizing only one matrix instead of two, the new algorithm not only achieves a lower computational complexity but also avoids the use of initial values, which must be carefully selected for each channel and signal-to-noise ratio for fast convergence. Another advantage of the new algorithm is that the resulting precoder has a fixed form of received constellation thanks to the fixed constellation-forming matrix. This allows us to optimize the symbol mapping on the received constellation. Simulation results show that the proposed low-complexity precoder achieves error- rate performance that is close to performance of the optimal one when the conventional mapping is used. In addition, the new precoder used with optimized mapping at received constellation shows significant error-rate performance improvement.
%G English
%L hal-01656269
%U https://hal.archives-ouvertes.fr/hal-01656269
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ UNIV-BREST
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_COM
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Voir toutes les publications