Frédéric GUILLOUD

Poste

Enseignant-chercheur

Localisation

Brest

Coordonnées :

Tél.

+33 2 29 00 13 56
Publications HAL
Article dans une revue
Messai Malek, Aissa El Bey Abdeldjalil, Amis Cavalec Karine, Guilloud Frédéric
Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints
Signal Processing, Elsevier, 2019, 157, pp.73-77. 〈10.1016/j.sigpro.2018.11.007〉
Bibtext :
@article{messai:hal-01933349,
TITLE = {{Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints}},
AUTHOR = {Messai, Malek and Aissa El Bey, Abdeldjalil and Amis Cavalec, Karine and Guilloud, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01933349},
JOURNAL = {{Signal Processing}},
HAL_LOCAL_REFERENCE = {19289},
PUBLISHER = {{Elsevier}},
VOLUME = {157},
PAGES = {73-77},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1016/j.sigpro.2018.11.007},
KEYWORDS = {l1-minimization ; Block-sparsity recovery ; Finite-alphabet ; LASSO ; Iterative recovery algorithms ; Iterative reweighting},
PDF = {https://hal.archives-ouvertes.fr/hal-01933349/file/letter_singlecolumn_final.pdf},
HAL_ID = {hal-01933349},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Iteratively Reweighted two-Stage LASSO for Block-Sparse Signal Recovery Under Finite-Alphabet Constraints
%+ Département Signal et Communications (SC)
%+ Lab-STICC_IMTA_CACS_COM
%A Messai, Malek
%A Aissa El Bey, Abdeldjalil
%A Amis Cavalec, Karine
%A Guilloud, Frédéric
%< avec comité de lecture
%Z 19289
%@ 0165-1684
%J Signal Processing
%I Elsevier
%V 157
%P 73-77
%8 2019-04
%D 2019
%R 10.1016/j.sigpro.2018.11.007
%K l1-minimization
%K Block-sparsity recovery
%K Finite-alphabet
%K LASSO
%K Iterative recovery algorithms
%K Iterative reweighting
%Z Engineering Sciences [physics]/Signal and Image processingJournal articles
%X In this paper, we derive an efficient iterative algorithm for the recovery of block-sparse signals given the finite data alphabet and the non-zero block probability. The non-zero block number is supposed to be far smaller than the total block number (block-sparse). The key principle is the separation of the unknown signal vector into an unknown support vector s and an unknown data symbol vector a. Both number (‖s‖0) and positions (s ∈ {0, 1}) of non-zero blocks are unknown. The proposed algorithms use an iterative two-stage LASSO procedure consisting in optimizing the recovery problem alternatively with respect to a and with respect to s. The first algorithm resorts on ℓ1-norm of the support vector and the second one applies reweighted ℓ1-norm, which further improves the recovery performance. Performance of proposed algorithms is illustrated in the context of sporadic multiuser communications. Simulations show that the reweighted-ℓ1 algorithm performs close to its lower bound (perfect knowledge of the support vector).
%G English
%2 https://hal.archives-ouvertes.fr/hal-01933349/document
%2 https://hal.archives-ouvertes.fr/hal-01933349/file/letter_singlecolumn_final.pdf
%L hal-01933349
%U https://hal.archives-ouvertes.fr/hal-01933349
%~ IMTA_SC
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ IMT-ATLANTIQUE
%~ LAB-STICC
%~ LAB-STICC_IMTA_CACS_COM
%~ LAB-STICC_IMTA
Article dans une revue
Poda Pasteur, Saoudi Samir, Chonavel Thierry, Guilloud Frédéric, Tapsoba Théodore
Non-parametric kernel-based bit error probability estimation in digital communication systems: An estimator for soft coded QAM BER computation
Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2018, Volume 27 - 2017 - Special issue CARI 2016
Bibtext :
@article{poda:hal-01449035,
TITLE = {{Non-parametric kernel-based bit error probability estimation in digital communication systems: An estimator for soft coded QAM BER computation}},
AUTHOR = {Poda, Pasteur and Saoudi, Samir and Chonavel, Thierry and Guilloud, Fr{\'e}d{\'e}ric and Tapsoba, Th{\'e}odore Marie-Yves},
URL = {https://hal.archives-ouvertes.fr/hal-01449035},
JOURNAL = {{Revue Africaine de la Recherche en Informatique et Math{\'e}matiques Appliqu{\'e}es}},
PUBLISHER = {{INRIA}},
VOLUME = {Volume 27 - 2017 - Special issue CARI 2016},
YEAR = {2018},
MONTH = Aug,
KEYWORDS = {Kernel estimator ; Bit error rate ; Probability density function ; Monte Carlo method ; Bit error probability ; Fonction de densit{\'e} de probabilit{\'e} ; Estimateur {\`a} noyau ; Taux d'erreur binaire ; M{\'e}thode Monte Carlo ; Probabilit{\'e} d'erreur binaire},
PDF = {https://hal.archives-ouvertes.fr/hal-01449035/file/ARIMA-Vol27-101-120.pdf},
HAL_ID = {hal-01449035},
HAL_VERSION = {v3},
}
Endnote :
%0 Journal Article
%T Non-parametric kernel-based bit error probability estimation in digital communication systems: An estimator for soft coded QAM BER computation
%+ Université Polytechnique Nazi Boni Bobo-Dioulasso (UNB)
%+ Département Signal et Communications (SC)
%+ Lab-STICC_IMTA_CACS_COM
%+ IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
%+ Lab-STICC_IMTA_CID_TOMS
%A Poda, Pasteur
%A Saoudi, Samir
%A Chonavel, Thierry
%A Guilloud, Frédéric
%A Tapsoba, Théodore, Marie-Yves
%Z Projet RESEAU SCAC-Ambassade de France au Burkina Faso , FP7 project ICT-317669 METIS
%< avec comité de lecture
%@ 1638-5713
%J Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées
%I INRIA
%V Volume 27 - 2017 - Special issue CARI 2016
%8 2018-08-03
%D 2018
%K Kernel estimator
%K Bit error rate
%K Probability density function
%K Monte Carlo method
%K Bit error probability
%K Fonction de densité de probabilité
%K Estimateur à noyau
%K Taux d’erreur binaire
%K Méthode Monte Carlo
%K Probabilité d’erreur binaire
%Z Engineering Sciences [physics]/Signal and Image processing
%Z Engineering Sciences [physics]/OtherJournal articles
%X The standard Monte Carlo estimations of rare events probabilities suffer from too much computational time. To make estimations faster, kernel-based estimators proved to be more efficient for binary systems whilst appearing to be more suitable in situations where the probability density function of the samples is unknown. We propose a kernel-based Bit Error Probability (BEP) estimator for coded M-ary Quadrature Amplitude Modulation (QAM) systems. We defined soft real bits upon which an Epanechnikov kernel-based estimator is designed. Simulation results showed, compared to the standard Monte Carlo simulation technique, accurate, reliable and efficient BEP estimates for 4-QAM and 16-QAM symbols transmissions over the additive white Gaussian noise channel and over a frequency-selective Rayleigh fading channel.
%X Les estimations de probabilités d'événements rares par la méthode de Monte Carlo classique souffrent de trop de temps de calculs. Des estimateurs à noyau se sont montrés plus efficaces sur des systèmes binaires en même temps qu'ils paraissent mieux adaptés aux situations où la fonction de densité de probabilité est inconnue. Nous proposons un estimateur de Probabilité d'Erreur Bit (PEB) à noyau pour les systèmes M-aires codés de Modulations d'Amplitude en Quadrature (MAQ). Nous avons défini des bits souples à valeurs réelles à partir desquels un estimateur à noyau d'Epanechnikov est conçu. Les simulations ont montré, par rapport à la méthode Monte Carlo, des estimées de PEB précises, fiables et efficaces pour des transmissions MAQ-4 et MAQ-16 sur canaux à bruit additif blanc Gaussien et à évanouïssements de Rayleigh sélectif en fréquence.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01449035v3/document
%2 https://hal.archives-ouvertes.fr/hal-01449035/file/ARIMA-Vol27-101-120.pdf
%L hal-01449035
%U https://hal.archives-ouvertes.fr/hal-01449035
%~ EPISCIENCES
%~ ARIMA
%~ CNRS
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ UNIV-BREST
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_TOMS
%~ IMTA_SC
%~ LAB-STICC_IMTA
%~ LAB-STICC_IMTA_CACS_COM
Communication dans un congrès
Nguyen Alex The Phuong, Le Bidan Raphaël, Guilloud Frédéric
State of the art in short packet communications: a physical layer comparison for block-fading channels
25th International Conference on Telecommunications (ICT), Jun 2018, Saint-Malo, France
Bibtext :
@inproceedings{nguyen:hal-01870522,
TITLE = {{State of the art in short packet communications: a physical layer comparison for block-fading channels}},
AUTHOR = {Nguyen, Alex The Phuong and Le Bidan, Rapha{\"e}l and Guilloud, Fr{\'e}d{\'e}ric},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-01870522},
BOOKTITLE = {{25th International Conference on Telecommunications (ICT)}},
ADDRESS = {Saint-Malo, France},
YEAR = {2018},
MONTH = Jun,
KEYWORDS = {spread spectrum ; Short packet ; IoT ; Sigfox ; LoRa ; NB-IoT},
HAL_ID = {hal-01870522},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T State of the art in short packet communications: a physical layer comparison for block-fading channels
%+ Département Signal et Communications (SC)
%+ Lab-STICC_IMTA_CACS_COM
%A Nguyen, Alex The Phuong
%A Le Bidan, Raphaël
%A Guilloud, Frédéric
%< avec comité de lecture
%B 25th International Conference on Telecommunications (ICT)
%C Saint-Malo, France
%8 2018-06-26
%D 2018
%K spread spectrum
%K Short packet
%K IoT
%K Sigfox
%K LoRa
%K NB-IoT
%Z Computer Science [cs]/Information Theory [cs.IT]
%Z Mathematics [math]/Information Theory [math.IT]
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X Many wireless short packet systems have been recently proposed because of new emerging use-cases in wireless communications. These competing schemes exhibit quite different design choices, at least from the physical layer perspective. An interesting question arising is whether there would be a particular waveform that could best fit the short length requirements in terms of transmission rate. In this paper, we focus on four short packet modulation schemes that are Ultra Narrowband (UNB), Direct Sequence Spread Spectrum (DSSS), Chirp Spread Spectrum (CSS) and CP-OFDM. We propose a discrete model for CSS modulation and compare the best achievable transmission rates of the four modulation
%G English
%L hal-01870522
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-01870522
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-UBS
%~ INSMI
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ UNIV-BREST
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_COM
%~ LAB-STICC_IMTA
Article dans une revue
Messai Malek, Aissa 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 Aissa 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 Aissa 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
Communication dans un congrès
Duan Jialong, Lagrange Xavier, Guilloud Frédéric
Analysis of Different User Grouping Algorithms in a C-RAN Downlink System
ICC 2017 : IEEE International Conference on Communications, May 2017, Paris, France. Proceedings ICC 2017 : IEEE International Conference on Communications, pp.1 - 6, 2017, 〈10.1109/ICC.2017.7996786〉
Bibtext :
@inproceedings{duan:hal-01574029,
TITLE = {{Analysis of Different User Grouping Algorithms in a C-RAN Downlink System}},
AUTHOR = {Duan, Jialong and Lagrange, Xavier and Guilloud, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01574029},
BOOKTITLE = {{ICC 2017 : IEEE International Conference on Communications}},
ADDRESS = {Paris, France},
HAL_LOCAL_REFERENCE = {17910},
PAGES = {1 - 6},
YEAR = {2017},
MONTH = May,
DOI = {10.1109/ICC.2017.7996786},
HAL_ID = {hal-01574029},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Analysis of Different User Grouping Algorithms in a C-RAN Downlink System
%+ Advanced technologies for operated networks (ADOPNET)
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (SC)
%A Duan, Jialong
%A Lagrange, Xavier
%A Guilloud, Frédéric
%< avec comité de lecture
%Z 17910
%( Proceedings ICC 2017 : IEEE International Conference on Communications
%B ICC 2017 : IEEE International Conference on Communications
%C Paris, France
%P 1 - 6
%8 2017-05-21
%D 2017
%R 10.1109/ICC.2017.7996786
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Information Theory [cs.IT]
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X Centralized/Cloud Radio Access Network (C-RAN) separates Baseband Units (BBUs) away from Remote Radio Heads (RRHs) and centralizes BBUs into a BBU pool. This new architecture can facilitate the cooperation between different cells. We apply zero-forcing (ZF) for joint transmission in a C- RAN downlink system. A number of User Elements (UEs) are assigned to be served into different subframes for serving. This paper proposes two user grouping algorithms denoted Global Greedy User Grouping Algorithm (GGUGA) and User Division Algorithm (UDA) to maximize the average achievable sum rate. GGUGA is a typical greedy algorithm. UDA restricts the random selection of UEs groupings into a certain region which increases the chance to make a good choice. GGUGA achieves a similar performance compared to exhaustive enumeration of all possible UEs groupings. The complexity of UDA is much less than the one of GGUGA when the number of UEs for grouping is large at the expense of a small loss in performance.
%G English
%L hal-01574029
%U https://hal.archives-ouvertes.fr/hal-01574029
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ IRISA_SET
%~ ENIB
%~ LAB-STICC
%~ UNIV-RENNES1
%~ UNIV-BREST
%~ IRISA
%~ INRIA2017
%~ INRIA
%~ UR1-HAL
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ IMTA_SRCD
%~ TEST-UNIV-RENNES
%~ TEST-UR-CSS
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ IRISA-ADOPNET-IMTA
%~ UNIV-RENNES
%~ CENTRALESUPELEC
%~ INRIA-AUT
%~ IMT-ATLANTIQUE
%~ IRISA_IMTA
%~ LAB-STICC_IMTA
Communication dans un congrès
Al Bechlawi Carole, Guilloud Frédéric
How lattice codes compare to conventional FEC/modulation schemes ?
JWCC'17 : 18th Joint Workshop on Communications and Coding, Mar 2017, Munich, Germany. Proceedings JWCC'17 : 18th Joint Workshop on Communications and Coding, 2017
Bibtext :
@inproceedings{albechlawi:hal-01863594,
TITLE = {{How lattice codes compare to conventional FEC/modulation schemes ?}},
AUTHOR = {Al Bechlawi, Carole and Guilloud, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01863594},
BOOKTITLE = {{JWCC'17 : 18th Joint Workshop on Communications and Coding}},
ADDRESS = {Munich, Germany},
HAL_LOCAL_REFERENCE = {19169},
PAGES = {.},
YEAR = {2017},
MONTH = Mar,
HAL_ID = {hal-01863594},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T How lattice codes compare to conventional FEC/modulation schemes ?
%+ 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_TB_CACS_COM
%A Al Bechlawi, Carole
%A Guilloud, Frédéric
%F Invité
%< sans comité de lecture
%Z 19169
%3 Proceedings JWCC'17 : 18th Joint Workshop on Communications and Coding
%B JWCC'17 : 18th Joint Workshop on Communications and Coding
%C Munich, Germany
%P .
%8 2017-03-13
%D 2017
%Z Computer Science [cs]/Information Theory [cs.IT]
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X In this presentation, we propose a multilevel lattice construction, employing binary Reed-Muller codes, for the Gaussian and the Rayleigh block fading channels. The construction is performed on a binary two-dimensional lattice partition chain, and a capacity-achieving code is used for each stage. The lattice construction based on number-theoretical con- cepts is explained, and the system's performance is shown for various codeword lengths.
%G English
%L hal-01863594
%U https://hal.archives-ouvertes.fr/hal-01863594
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ LAB-STICC_ENIB
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ UNIV-BREST
%~ IMT-ATLANTIQUE
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_COM
%~ LAB-STICC_IMTA
Communication dans un congrès
Poda Pasteur, Theodore Tapsoba, Saoudi Samir, Chonavel Thierry, Guilloud Frédéric
A Kernel-based soft BER estimator for coded QAM transmission systems
ISIVC 2016 : 8th International Symposium on Signal, Image, Video and Communications, Nov 2016, Tunis, Tunisia. Proceedings ISIVC 2016 : 8th International Symposium on Signal, Image, Video and Communications, 2016
Bibtext :
@inproceedings{poda:hal-01487070,
TITLE = {{A Kernel-based soft BER estimator for coded QAM transmission systems}},
AUTHOR = {Poda, Pasteur and Theodore, Tapsoba and Saoudi, Samir and Chonavel, Thierry and Guilloud, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01487070},
BOOKTITLE = {{ISIVC 2016 : 8th International Symposium on Signal, Image, Video and Communications}},
ADDRESS = {Tunis, Tunisia},
HAL_LOCAL_REFERENCE = {17190},
PAGES = {.},
YEAR = {2016},
MONTH = Nov,
KEYWORDS = {BER estimation ; Kernel density estimator ; Probability density function ; Epanechnikov distribution},
HAL_ID = {hal-01487070},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T A Kernel-based soft BER estimator for coded QAM transmission systems
%+ Lab-STICC_TB_CACS_COM
%+ Université Polytechnique Nazi Boni Bobo-Dioulasso (UNB)
%+ Département Signal et Communications (SC)
%+ Lab-STICC_TB_CID_TOMS
%A Poda, Pasteur
%A Theodore, Tapsoba
%A Saoudi, Samir
%A Chonavel, Thierry
%A Guilloud, Frédéric
%< avec comité de lecture
%Z 17190
%( Proceedings ISIVC 2016 : 8th International Symposium on Signal, Image, Video and Communications
%B ISIVC 2016 : 8th International Symposium on Signal, Image, Video and Communications
%C Tunis, Tunisia
%P .
%8 2016-11-21
%D 2016
%K BER estimation
%K Kernel density estimator
%K Probability density function
%K Epanechnikov distribution
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X This paper addresses the problem of the Monte Carlo method complexity reduction regarding bit error probability (BEP) estimation. A kernel-based BEP estimator is designed for coded M-ary quadrature amplitude modulation (QAM) transmissions schemes. The design of the kernel estimator is made in a context where the soft observations are spread along a bounded support. An Epanechnikov kernel function is chosen. The optimal smoothing parameter is selected based on an asymptotic mean integrated squared error criterion and replacing the unkonwn density function by a reference distribution. Simulations are run for 4-QAM transmission scheme over a frequency-selective Rayleigh fading channel. The proposed estimator is demonstrated reliable and efficient bringing otherwise significative sample size savings.
%G English
%L hal-01487070
%U https://hal.archives-ouvertes.fr/hal-01487070
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ UNIV-BREST
%~ IMTA_SC
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA_CACS_COM
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Communication dans un congrès
Duan Jialong, Lagrange Xavier, Guilloud Frédéric
Maximum Throughput in a C-RAN Cluster with Limited Fronthaul Capacity
WPMC 2016 : The 19th International Symposium on Wireless Personal Multimedia Communications, Nov 2016, Shenzhen, China. Proceedings WPMC 2016 : The 19th International Symposium on Wireless Personal Multimedia Communications, pp.1 - 6, 2016
Bibtext :
@inproceedings{duan:hal-01443677,
TITLE = {{Maximum Throughput in a C-RAN Cluster with Limited Fronthaul Capacity}},
AUTHOR = {Duan, Jialong and Lagrange, Xavier and Guilloud, Fr{\'e}d{\'e}ric},
URL = {https://hal.archives-ouvertes.fr/hal-01443677},
BOOKTITLE = {{WPMC 2016 : The 19th International Symposium on Wireless Personal Multimedia Communications}},
ADDRESS = {Shenzhen, China},
HAL_LOCAL_REFERENCE = {17443},
PAGES = {1 - 6},
YEAR = {2016},
MONTH = Nov,
PDF = {https://hal.archives-ouvertes.fr/hal-01443677/file/main.pdf},
HAL_ID = {hal-01443677},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Maximum Throughput in a C-RAN Cluster with Limited Fronthaul Capacity
%+ Advanced technologies for operated networks (ADOPNET)
%+ Département Réseaux, Sécurité et Multimédia (RSM)
%+ Lab-STICC_TB_CACS_COM
%+ Département Signal et Communications (SC)
%A Duan, Jialong
%A Lagrange, Xavier
%A Guilloud, Frédéric
%< avec comité de lecture
%Z 17443
%( Proceedings WPMC 2016 : The 19th International Symposium on Wireless Personal Multimedia Communications
%B WPMC 2016 : The 19th International Symposium on Wireless Personal Multimedia Communications
%C Shenzhen, China
%P 1 - 6
%8 2016-11-14
%D 2016
%Z Computer Science [cs]/Multimedia [cs.MM]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X Centralized/Cloud Radio Access Network (C-RAN) is a promising future mobile network architecture which can ease the cooperation between different cells to manage interference. However, the feasibility of C-RAN is limited by the large bit rate requirement in the fronthaul. This paper study the maximum throughput of different transmission strategies in a C-RAN cluster with transmission power constraints and fronthaul capacity constraints. Both transmission strategies without cooperation (e.g. "no cooperation transmission") and with cooperation (e.g. "distributed MIMO") between different cells are considered. Simulation results show that "distributed MIMO" has a better performance than "no cooperation transmission" with high RRH power constraint, high fronthaul capacity constraint and when the UEs are located at cell edge area.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01443677/document
%2 https://hal.archives-ouvertes.fr/hal-01443677/file/main.pdf
%L hal-01443677
%U https://hal.archives-ouvertes.fr/hal-01443677
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ IRISA_SET
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ UNIV-RENNES1
%~ INRIA
%~ IRISA
%~ IRISA_TB
%~ LAB-STICC_TB
%~ UR1-HAL
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ TEST-IRISA-TB
%~ TEST-UNIV-RENNES
%~ TEST-UR-CSS
%~ IMTA_SC
%~ UNIV-RENNES
%~ INRIA-AUT
%~ LAB-STICC_IMTA_CACS_COM
%~ IMT-ATLANTIQUE
%~ IMTA_SRCD
%~ IRISA-ADOPNET-IMTA
%~ IRISA_IMTA
%~ LAB-STICC_IMTA
Communication dans un congrès
Guilloud Frédéric, Messai Malek, Amis Cavalec Karine
Continuous Phase Modulation: a "new" waveform for 5G Massive Machine-Type Communications
ACOSIS 2016 : International Conference on Advanced Communication Systems and Information Security, Oct 2016, Marrakesh, Morocco. Proceedings ACOSIS 2016 : International Conference on Advanced Communication Systems and Information Security, 2016
Bibtext :
@inproceedings{guilloud:hal-01667517,
TITLE = {{Continuous Phase Modulation: a ''new'' waveform for 5G Massive Machine-Type Communications}},
AUTHOR = {Guilloud, Fr{\'e}d{\'e}ric and Messai, Malek and Amis Cavalec, Karine},
URL = {https://hal.archives-ouvertes.fr/hal-01667517},
BOOKTITLE = {{ACOSIS 2016 : International Conference on Advanced Communication Systems and Information Security}},
ADDRESS = {Marrakesh, Morocco},
HAL_LOCAL_REFERENCE = {18121},
PAGES = {.},
YEAR = {2016},
MONTH = Oct,
HAL_ID = {hal-01667517},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Continuous Phase Modulation: a "new" waveform for 5G Massive Machine-Type Communications
%+ Lab-STICC_TB_CACS_COM
%+ Département Signal et Communications (SC)
%A Guilloud, Frédéric
%A Messai, Malek
%A Amis Cavalec, Karine
%F Invité
%< sans comité de lecture
%Z 18121
%3 Proceedings ACOSIS 2016 : International Conference on Advanced Communication Systems and Information Security
%B ACOSIS 2016 : International Conference on Advanced Communication Systems and Information Security
%C Marrakesh, Morocco
%P .
%8 2016-10-17
%D 2016
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X Among the new specifications of the future 5G wireless communication era, communications between machines reveals new technical challenges to take up. Radio access for IoT, or Wireless Sensor Networks, are among the most popular applications of machine-type communications. They are to be deployed where wired communications are lacking and where the energy distribution network is hardly available. Hence, most of the transmitters are battery-powered without any chance to be changed. In this context, how to save the energy consumption in order to increase the battery lifetime as long as possible? On the physical layer, several new waveforms are competing for the upcoming 5G standardization, all of them being based on filtered multi-carrier modulations. However, the important signal peak power exhibited by multi-carrier modulations has a huge impact on the battery life and should prevent their implementation on the uplink. This talk will show why continuous phase modulations (CPM) can be an interesting alternative to multi-carrier waveforms for IoT and Wireless Sensor Networks. Some issues raised when dealing with CPM will also be presented together with some perspectives on possible solutions.
%G English
%L hal-01667517
%U https://hal.archives-ouvertes.fr/hal-01667517
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ LAB-STICC_ENIB
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ UNIV-BREST
%~ IMTA_SC
%~ LAB-STICC_IMTA_CACS_COM
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Communication dans un congrès
Poda Pasteur, Saoudi Samir, Chonavel Thierry, Guilloud Frédéric, Theodore Tapsoba
Kernel-based performance evaluation of coded QAM systems
CARI 2016 : 13th African Conference on Research in Computer Science and Applied Mathematics, Oct 2016, Tunis, Tunisia. Proceedings CARI 2016 : 13th African Conference on Research in Computer Science and Applied Mathematics, pp.182 - 191, 2016
Bibtext :
@inproceedings{poda:hal-01487063,
TITLE = {{Kernel-based performance evaluation of coded QAM systems}},
AUTHOR = {Poda, Pasteur and Saoudi, Samir and Chonavel, Thierry and Guilloud, Fr{\'e}d{\'e}ric and Theodore, Tapsoba},
URL = {https://hal.archives-ouvertes.fr/hal-01487063},
BOOKTITLE = {{CARI 2016 : 13th African Conference on Research in Computer Science and Applied Mathematics}},
ADDRESS = {Tunis, Tunisia},
HAL_LOCAL_REFERENCE = {17191},
PAGES = {182 - 191},
YEAR = {2016},
MONTH = Oct,
KEYWORDS = {Bit Error Rate ; Kernel estimator ; Monte Carlo methods ; Probability density function},
HAL_ID = {hal-01487063},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Kernel-based performance evaluation of coded QAM systems
%+ Lab-STICC_TB_CACS_COM
%+ Université Polytechnique Nazi Boni Bobo-Dioulasso (UNB)
%+ Département Signal et Communications (SC)
%+ Lab-STICC_TB_CID_TOMS
%A Poda, Pasteur
%A Saoudi, Samir
%A Chonavel, Thierry
%A Guilloud, Frédéric
%A Theodore, Tapsoba
%< avec comité de lecture
%Z 17191
%( Proceedings CARI 2016 : 13th African Conference on Research in Computer Science and Applied Mathematics
%B CARI 2016 : 13th African Conference on Research in Computer Science and Applied Mathematics
%C Tunis, Tunisia
%P 182 - 191
%8 2016-10-10
%D 2016
%K Bit Error Rate
%K Kernel estimator
%K Monte Carlo methods
%K Probability density function
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X Kernel Bit Error Rate (BER) estimators are of recent interest for Monte Carlo sample size reduction. Until now, they mainly addressed binary modulation systems. In this paper, a kernelbased BER estimator is designed for coded M-ary Quadrature Amplitude Modulation (QAM) systems. The observations from which estimations are made are defined in the form of bounded soft bits. An Epanechnikov kernel function is selected and its smoothing parameter is derived based on the concept of canonical bandwidth. Simulations are run for 4-QAM and 16-QAM systems, involving additive white Gaussian noise and frequency-selective Rayleigh fading channels respectively. Simulation results show that the proposed estimator yields significative sample savings that grow with Eb/N0.
%G English
%L hal-01487063
%U https://hal.archives-ouvertes.fr/hal-01487063
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ UNIV-BREST
%~ IMTA_SC
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA_CACS_COM
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA
Voir toutes les publications