Le département Signal & Communications est spécialisé dans le domaine des Mathématiques et Traitement de l’Information. Il s’intéresse à la fois aux aspects méthodologiques et théoriques mais également aux problèmes de mise en œuvre et des implémentations des algorithmes étudiés notamment via les techniques de radio logicielle. Les domaines d’applications concernent principalement la Mer, la Défense et les Télécommunications.
Le département Signal & Communications est composé en 2018 de quelques 54 membres dont 17 permanents.
Recherche
Enseignement
Innovation
International
L'actualité du département
Les prochains événements du département
Il n'y a pas d'événement en cours ou à venir pour le département.
Les dernières publications du département
Article dans une revue
Sánchez-Román A., Gómez-Navarro L., Fablet Ronan, Oro D., Mason E., Arcos J., Ruiz S., Pascual A.
Rafting behaviour of seabirds as a proxy to describe surface ocean currents in the Balearic Sea
Scientific Reports, Nature Publishing Group, 2019, 9 (1)
Détails
Citer
Bibtext :
@article{sanchezroman:hal-02005270,
TITLE = {{Rafting behaviour of seabirds as a proxy to describe surface ocean currents in the Balearic Sea}},
AUTHOR = {S{\'a}nchez-Rom{\'a}n, A. and G{\'o}mez-Navarro, L. and Fablet, Ronan and Oro, D. and Mason, E. and Arcos, J. and Ruiz, S. and Pascual, A.},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02005270},
JOURNAL = {{Scientific Reports}},
PUBLISHER = {{Nature Publishing Group}},
VOLUME = {9},
NUMBER = {1},
YEAR = {2019},
MONTH = Dec,
HAL_ID = {hal-02005270},
HAL_VERSION = {v1},
}
TITLE = {{Rafting behaviour of seabirds as a proxy to describe surface ocean currents in the Balearic Sea}},
AUTHOR = {S{\'a}nchez-Rom{\'a}n, A. and G{\'o}mez-Navarro, L. and Fablet, Ronan and Oro, D. and Mason, E. and Arcos, J. and Ruiz, S. and Pascual, A.},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02005270},
JOURNAL = {{Scientific Reports}},
PUBLISHER = {{Nature Publishing Group}},
VOLUME = {9},
NUMBER = {1},
YEAR = {2019},
MONTH = Dec,
HAL_ID = {hal-02005270},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Rafting behaviour of seabirds as a proxy to describe surface ocean currents in the Balearic Sea
%+ Lab-STICC_IMTA_CID_TOMS
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Miquel Marques, 21
%+ Laboratoire de Chimie des Polymères Organiques (LCPO)
%A Sánchez-Román, A.
%A Gómez-Navarro, L.
%A Fablet, Ronan
%A Oro, D.
%A Mason, E.
%A Arcos, J.
%A Ruiz, S.
%A Pascual, A.
%< avec comité de lecture
%@ 2045-2322
%J Scientific Reports
%I Nature Publishing Group
%V 9
%N 1
%8 2019-12
%D 2019
%Z Environmental Sciences/Biodiversity and Ecology
%Z Sciences of the Universe [physics]/Ocean, AtmosphereJournal articles
%G English
%L hal-02005270
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02005270
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ SDE
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ GIP-BE
%~ INC-CNRS
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA
%~ IMTA_SC
%~ PRACOM
%T Rafting behaviour of seabirds as a proxy to describe surface ocean currents in the Balearic Sea
%+ Lab-STICC_IMTA_CID_TOMS
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Miquel Marques, 21
%+ Laboratoire de Chimie des Polymères Organiques (LCPO)
%A Sánchez-Román, A.
%A Gómez-Navarro, L.
%A Fablet, Ronan
%A Oro, D.
%A Mason, E.
%A Arcos, J.
%A Ruiz, S.
%A Pascual, A.
%< avec comité de lecture
%@ 2045-2322
%J Scientific Reports
%I Nature Publishing Group
%V 9
%N 1
%8 2019-12
%D 2019
%Z Environmental Sciences/Biodiversity and Ecology
%Z Sciences of the Universe [physics]/Ocean, AtmosphereJournal articles
%G English
%L hal-02005270
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02005270
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ SDE
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ GIP-BE
%~ INC-CNRS
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA
%~ IMTA_SC
%~ PRACOM
Communication dans un congrès
Lassami Nacerredine, Aissa El Bey Abdeldjalil, Abed-Meraim Karim
adaptive blind sparse source separation Based on Shear and Givens Rotations
IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), May 2019, Brighton, United Kingdom. pp.4225 - 4229, ⟨10.1109/ICASSP.2019.8683276⟩
Détails
Citer
Bibtext :
@inproceedings{lassami:hal-02059638,
TITLE = {{adaptive blind sparse source separation Based on Shear and Givens Rotations}},
AUTHOR = {Lassami, Nacerredine and Aissa El Bey, Abdeldjalil and Abed-Meraim, Karim},
URL = {https://hal.archives-ouvertes.fr/hal-02059638},
BOOKTITLE = {{IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)}},
ADDRESS = {Brighton, United Kingdom},
HAL_LOCAL_REFERENCE = {19585},
PAGES = {4225 - 4229},
YEAR = {2019},
MONTH = May,
DOI = {10.1109/ICASSP.2019.8683276},
KEYWORDS = {Blind source separation ; Sparse signals ; Adaptive algorithm ; Shear and Givens rotations},
HAL_ID = {hal-02059638},
HAL_VERSION = {v1},
}
TITLE = {{adaptive blind sparse source separation Based on Shear and Givens Rotations}},
AUTHOR = {Lassami, Nacerredine and Aissa El Bey, Abdeldjalil and Abed-Meraim, Karim},
URL = {https://hal.archives-ouvertes.fr/hal-02059638},
BOOKTITLE = {{IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)}},
ADDRESS = {Brighton, United Kingdom},
HAL_LOCAL_REFERENCE = {19585},
PAGES = {4225 - 4229},
YEAR = {2019},
MONTH = May,
DOI = {10.1109/ICASSP.2019.8683276},
KEYWORDS = {Blind source separation ; Sparse signals ; Adaptive algorithm ; Shear and Givens rotations},
HAL_ID = {hal-02059638},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T adaptive blind sparse source separation Based on Shear and Givens Rotations
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Laboratoire Pluridisciplinaire de Recherche en Ingénierie des Systèmes, Mécanique et Energétique (PRISME)
%A Lassami, Nacerredine
%A Aissa El Bey, Abdeldjalil
%A Abed-Meraim, Karim
%< avec comité de lecture
%Z 19585
%( Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
%B IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
%C Brighton, United Kingdom
%P 4225 - 4229
%8 2019-05-12
%D 2019
%R 10.1109/ICASSP.2019.8683276
%K Blind source separation
%K Sparse signals
%K Adaptive algorithm
%K Shear and Givens rotations
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X This paper addresses the problem of adaptive blind sparse source separation in the time domain of an over-determined instantaneous noisy mixture. A two-step approach is proposed: first, the data are projected on the signal subspace estimated using the principal subspace tracker FAPI. In the second step, an L1 criterion is used to represent the sparsity property of the signal sources. For the optimization of this cost function, an adaptive method based on Givens and Shear rotations is used. This algorithm, referred to SGDS-FAPI, guarantees low computational complexity which is essential in the adaptive context. Numerical simulations have been performed, and showed that the proposed algorithm outperforms existing solutions in both convergence speed and estimation quality.
%G English
%L hal-02059638
%U https://hal.archives-ouvertes.fr/hal-02059638
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ MSL
%~ MSL-THESE
%~ ENIB
%~ LAB-STICC
%~ UNIV-ORLEANS
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ PRISME-CVL
%~ IMTA_SC
%~ LAB-STICC_IMTA
%~ PRACOM
%~ ENSI-BOURGES
%T adaptive blind sparse source separation Based on Shear and Givens Rotations
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Laboratoire Pluridisciplinaire de Recherche en Ingénierie des Systèmes, Mécanique et Energétique (PRISME)
%A Lassami, Nacerredine
%A Aissa El Bey, Abdeldjalil
%A Abed-Meraim, Karim
%< avec comité de lecture
%Z 19585
%( Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
%B IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
%C Brighton, United Kingdom
%P 4225 - 4229
%8 2019-05-12
%D 2019
%R 10.1109/ICASSP.2019.8683276
%K Blind source separation
%K Sparse signals
%K Adaptive algorithm
%K Shear and Givens rotations
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X This paper addresses the problem of adaptive blind sparse source separation in the time domain of an over-determined instantaneous noisy mixture. A two-step approach is proposed: first, the data are projected on the signal subspace estimated using the principal subspace tracker FAPI. In the second step, an L1 criterion is used to represent the sparsity property of the signal sources. For the optimization of this cost function, an adaptive method based on Givens and Shear rotations is used. This algorithm, referred to SGDS-FAPI, guarantees low computational complexity which is essential in the adaptive context. Numerical simulations have been performed, and showed that the proposed algorithm outperforms existing solutions in both convergence speed and estimation quality.
%G English
%L hal-02059638
%U https://hal.archives-ouvertes.fr/hal-02059638
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ MSL
%~ MSL-THESE
%~ ENIB
%~ LAB-STICC
%~ UNIV-ORLEANS
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ PRISME-CVL
%~ IMTA_SC
%~ LAB-STICC_IMTA
%~ PRACOM
%~ ENSI-BOURGES
Communication dans un congrès
Nguyen Duong, Kirsebom Oliver S., Frazão Fábio, Fablet Ronan, Matwin Stan
Recurrent Neural Networks with Stochastic Layers for Acoustic Novelty Detection
International Conference on Acoustics, Speech, and Signal Processing, May 2019, Brighton, United Kingdom
Bibtext :
@inproceedings{nguyen:hal-02018277,
TITLE = {{Recurrent Neural Networks with Stochastic Layers for Acoustic Novelty Detection}},
AUTHOR = {Nguyen, Duong and Kirsebom, Oliver S. and Fraz{\~a}o, F{\'a}bio and Fablet, Ronan and Matwin, Stan},
URL = {https://hal.archives-ouvertes.fr/hal-02018277},
BOOKTITLE = {{International Conference on Acoustics, Speech, and Signal Processing}},
ADDRESS = {Brighton, United Kingdom},
YEAR = {2019},
MONTH = May,
KEYWORDS = {acoustic modeling ; novelty detection ; variational recurrent neural network ; stochastic recurrent neural network},
PDF = {https://hal.archives-ouvertes.fr/hal-02018277/file/Recurrent%20Neural%20Networks%20with%20Stochastic%20Layers%20for%20Acoustic%20Novelty%20Detection.pdf},
HAL_ID = {hal-02018277},
HAL_VERSION = {v1},
}
TITLE = {{Recurrent Neural Networks with Stochastic Layers for Acoustic Novelty Detection}},
AUTHOR = {Nguyen, Duong and Kirsebom, Oliver S. and Fraz{\~a}o, F{\'a}bio and Fablet, Ronan and Matwin, Stan},
URL = {https://hal.archives-ouvertes.fr/hal-02018277},
BOOKTITLE = {{International Conference on Acoustics, Speech, and Signal Processing}},
ADDRESS = {Brighton, United Kingdom},
YEAR = {2019},
MONTH = May,
KEYWORDS = {acoustic modeling ; novelty detection ; variational recurrent neural network ; stochastic recurrent neural network},
PDF = {https://hal.archives-ouvertes.fr/hal-02018277/file/Recurrent%20Neural%20Networks%20with%20Stochastic%20Layers%20for%20Acoustic%20Novelty%20Detection.pdf},
HAL_ID = {hal-02018277},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Recurrent Neural Networks with Stochastic Layers for Acoustic Novelty Detection
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Lab-STICC_TB_CID_TOMS
%+ Institute for Big Data Analytics, Dalhousie
%+ Lab-STICC_TB_CID_TOMS
%+ Institute of Computer Science, Polish Academy of Sciences
%A Nguyen, Duong
%A Kirsebom, Oliver S.
%A Frazão, Fábio
%A Fablet, Ronan
%A Matwin, Stan
%< avec comité de lecture
%B International Conference on Acoustics, Speech, and Signal Processing
%C Brighton, United Kingdom
%8 2019-05
%D 2019
%K acoustic modeling
%K novelty detection
%K variational recurrent neural network
%K stochastic recurrent neural network
%Z Computer Science [cs]/Machine Learning [cs.LG]
%Z Computer Science [cs]/Signal and Image ProcessingConference papers
%X In this paper, we adapt Recurrent Neural Networks with Stochastic Layers, which are the state-of-the-art for generating text, music and speech, to the problem of acoustic novelty detection. By integrating uncertainty into the hidden states, this type of network is able to learn the distribution of complex sequences. Because the learned distribution can be calculated explicitly in terms of probability, we can evaluate how likely an observation is then detect low-probability events as novel. The model is robust, highly unsupervised, end-to-end and requires minimum preprocessing, feature engineering or hyperparameter tuning. An experiment on a benchmark dataset shows that our model outperforms the state-of-the-art acoustic novelty detectors.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02018277/document
%2 https://hal.archives-ouvertes.fr/hal-02018277/file/Recurrent%20Neural%20Networks%20with%20Stochastic%20Layers%20for%20Acoustic%20Novelty%20Detection.pdf
%L hal-02018277
%U https://hal.archives-ouvertes.fr/hal-02018277
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_TOMS
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ LAB-STICC_IMTA
%~ PRACOM
%F Oral
%T Recurrent Neural Networks with Stochastic Layers for Acoustic Novelty Detection
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Lab-STICC_TB_CID_TOMS
%+ Institute for Big Data Analytics, Dalhousie
%+ Lab-STICC_TB_CID_TOMS
%+ Institute of Computer Science, Polish Academy of Sciences
%A Nguyen, Duong
%A Kirsebom, Oliver S.
%A Frazão, Fábio
%A Fablet, Ronan
%A Matwin, Stan
%< avec comité de lecture
%B International Conference on Acoustics, Speech, and Signal Processing
%C Brighton, United Kingdom
%8 2019-05
%D 2019
%K acoustic modeling
%K novelty detection
%K variational recurrent neural network
%K stochastic recurrent neural network
%Z Computer Science [cs]/Machine Learning [cs.LG]
%Z Computer Science [cs]/Signal and Image ProcessingConference papers
%X In this paper, we adapt Recurrent Neural Networks with Stochastic Layers, which are the state-of-the-art for generating text, music and speech, to the problem of acoustic novelty detection. By integrating uncertainty into the hidden states, this type of network is able to learn the distribution of complex sequences. Because the learned distribution can be calculated explicitly in terms of probability, we can evaluate how likely an observation is then detect low-probability events as novel. The model is robust, highly unsupervised, end-to-end and requires minimum preprocessing, feature engineering or hyperparameter tuning. An experiment on a benchmark dataset shows that our model outperforms the state-of-the-art acoustic novelty detectors.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02018277/document
%2 https://hal.archives-ouvertes.fr/hal-02018277/file/Recurrent%20Neural%20Networks%20with%20Stochastic%20Layers%20for%20Acoustic%20Novelty%20Detection.pdf
%L hal-02018277
%U https://hal.archives-ouvertes.fr/hal-02018277
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_TOMS
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ LAB-STICC_IMTA
%~ PRACOM
Communication dans un congrès
Lassami Nacerredine, Aissa El Bey Abdeldjalil, Abed-Meraim Karim
Low Cost Sparse Subspace Tracking Algorithm based on Shear and Givens Rotations
1st Conference on Electrical Engineering, Apr 2019, Alger, Algeria. Proceedings 1st Conference on Electrical Engineering, 2019
Détails
Citer
Bibtext :
@inproceedings{lassami:hal-02087639,
TITLE = {{Low Cost Sparse Subspace Tracking Algorithm based on Shear and Givens Rotations}},
AUTHOR = {Lassami, Nacerredine and Aissa El Bey, Abdeldjalil and Abed-Meraim, Karim},
URL = {https://hal.archives-ouvertes.fr/hal-02087639},
BOOKTITLE = {{1st Conference on Electrical Engineering}},
ADDRESS = {Alger, Algeria},
HAL_LOCAL_REFERENCE = {19599},
PAGES = {.},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {Subspace tracking ; Sparse subspace ; Shear Givens rotations ; Adaptive estimation},
HAL_ID = {hal-02087639},
HAL_VERSION = {v1},
}
TITLE = {{Low Cost Sparse Subspace Tracking Algorithm based on Shear and Givens Rotations}},
AUTHOR = {Lassami, Nacerredine and Aissa El Bey, Abdeldjalil and Abed-Meraim, Karim},
URL = {https://hal.archives-ouvertes.fr/hal-02087639},
BOOKTITLE = {{1st Conference on Electrical Engineering}},
ADDRESS = {Alger, Algeria},
HAL_LOCAL_REFERENCE = {19599},
PAGES = {.},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {Subspace tracking ; Sparse subspace ; Shear Givens rotations ; Adaptive estimation},
HAL_ID = {hal-02087639},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Low Cost Sparse Subspace Tracking Algorithm based on Shear and Givens Rotations
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Laboratoire Pluridisciplinaire de Recherche en Ingénierie des Systèmes, Mécanique et Energétique (PRISME)
%A Lassami, Nacerredine
%A Aissa El Bey, Abdeldjalil
%A Abed-Meraim, Karim
%< avec comité de lecture
%Z 19599
%( Proceedings 1st Conference on Electrical Engineering
%B 1st Conference on Electrical Engineering
%C Alger, Algeria
%P .
%8 2019-04-22
%D 2019
%K Subspace tracking
%K Sparse subspace
%K Shear Givens rotations
%K Adaptive estimation
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X In this paper, we consider the problem of tracking the signal subspace under a sparsity constraint over the weight basis matrix. In the same spirit of our previous work [1, 2], we propose a new low cost algorithm which has at every iteration two stages. First, it estimates adaptively an orthogonal basis for the signal subspace. Then, it uses the Shear and Givens rotations to minimize the sparsity criterion. The proposed algorithm has a approximately the same performance compared to our previous best proposition in [2]. However, the new algorithm has a low (linear) computational complexity. Moreover, simulation results show that it outperforms the state of art solutions.
%G English
%L hal-02087639
%U https://hal.archives-ouvertes.fr/hal-02087639
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENSI-BOURGES
%~ MSL
%~ MSL-THESE
%~ ENIB
%~ LAB-STICC
%~ UNIV-ORLEANS
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ PRISME-CVL
%~ IMTA_SC
%~ PRACOM
%~ LAB-STICC_IMTA
%T Low Cost Sparse Subspace Tracking Algorithm based on Shear and Givens Rotations
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Laboratoire Pluridisciplinaire de Recherche en Ingénierie des Systèmes, Mécanique et Energétique (PRISME)
%A Lassami, Nacerredine
%A Aissa El Bey, Abdeldjalil
%A Abed-Meraim, Karim
%< avec comité de lecture
%Z 19599
%( Proceedings 1st Conference on Electrical Engineering
%B 1st Conference on Electrical Engineering
%C Alger, Algeria
%P .
%8 2019-04-22
%D 2019
%K Subspace tracking
%K Sparse subspace
%K Shear Givens rotations
%K Adaptive estimation
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X In this paper, we consider the problem of tracking the signal subspace under a sparsity constraint over the weight basis matrix. In the same spirit of our previous work [1, 2], we propose a new low cost algorithm which has at every iteration two stages. First, it estimates adaptively an orthogonal basis for the signal subspace. Then, it uses the Shear and Givens rotations to minimize the sparsity criterion. The proposed algorithm has a approximately the same performance compared to our previous best proposition in [2]. However, the new algorithm has a low (linear) computational complexity. Moreover, simulation results show that it outperforms the state of art solutions.
%G English
%L hal-02087639
%U https://hal.archives-ouvertes.fr/hal-02087639
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENSI-BOURGES
%~ MSL
%~ MSL-THESE
%~ ENIB
%~ LAB-STICC
%~ UNIV-ORLEANS
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ PRISME-CVL
%~ IMTA_SC
%~ PRACOM
%~ LAB-STICC_IMTA
Communication dans un congrès
Meslem Yacine, Aissa El Bey Abdeldjalil, Djeddou Mustapha
A Simple ADMM Solution To Sparse-Modeling-Based Detectors For Massive MIMO Systems
1st Conference on Electrical Engineering, Apr 2019, Alger, Algeria. Proceedings 1st Conference on Electrical Engineering, 2019
Détails
Citer
Bibtext :
@inproceedings{meslem:hal-02087659,
TITLE = {{A Simple ADMM Solution To Sparse-Modeling-Based Detectors For Massive MIMO Systems}},
AUTHOR = {Meslem, Yacine and Aissa El Bey, Abdeldjalil and Djeddou, Mustapha},
URL = {https://hal.archives-ouvertes.fr/hal-02087659},
BOOKTITLE = {{1st Conference on Electrical Engineering}},
ADDRESS = {Alger, Algeria},
HAL_LOCAL_REFERENCE = {19600},
PAGES = {.},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {Alternating Direction Method of Multipliers ; Massive MIMO ; Sparse decomposition},
HAL_ID = {hal-02087659},
HAL_VERSION = {v1},
}
TITLE = {{A Simple ADMM Solution To Sparse-Modeling-Based Detectors For Massive MIMO Systems}},
AUTHOR = {Meslem, Yacine and Aissa El Bey, Abdeldjalil and Djeddou, Mustapha},
URL = {https://hal.archives-ouvertes.fr/hal-02087659},
BOOKTITLE = {{1st Conference on Electrical Engineering}},
ADDRESS = {Alger, Algeria},
HAL_LOCAL_REFERENCE = {19600},
PAGES = {.},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {Alternating Direction Method of Multipliers ; Massive MIMO ; Sparse decomposition},
HAL_ID = {hal-02087659},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T A Simple ADMM Solution To Sparse-Modeling-Based Detectors For Massive MIMO Systems
%+ Ecole militaire polytechnique d'Alger (.) (EMP Alger)
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%A Meslem, Yacine
%A Aissa El Bey, Abdeldjalil
%A Djeddou, Mustapha
%< avec comité de lecture
%Z 19600
%( Proceedings 1st Conference on Electrical Engineering
%B 1st Conference on Electrical Engineering
%C Alger, Algeria
%P .
%8 2019-04-22
%D 2019
%K Alternating Direction Method of Multipliers
%K Massive MIMO
%K Sparse decomposition
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X We give a simple yet efficient Alternating Direction Method of Multipliers algorithm for solving sparse-modeling-based detectors [7, 9] for massive MIMO systems. Our solution relies on a special reformulation of the associated optimization problem by describing the constraints as a Cartesian power of the probability simplex. Simulation results show that the proposed algorithm is as accurate as the best known solvers (interior point methods), while its complexity remains linear with respect to the size of the system.
%G English
%L hal-02087659
%U https://hal.archives-ouvertes.fr/hal-02087659
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ PRACOM
%~ LAB-STICC_IMTA
%T A Simple ADMM Solution To Sparse-Modeling-Based Detectors For Massive MIMO Systems
%+ Ecole militaire polytechnique d'Alger (.) (EMP Alger)
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%A Meslem, Yacine
%A Aissa El Bey, Abdeldjalil
%A Djeddou, Mustapha
%< avec comité de lecture
%Z 19600
%( Proceedings 1st Conference on Electrical Engineering
%B 1st Conference on Electrical Engineering
%C Alger, Algeria
%P .
%8 2019-04-22
%D 2019
%K Alternating Direction Method of Multipliers
%K Massive MIMO
%K Sparse decomposition
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X We give a simple yet efficient Alternating Direction Method of Multipliers algorithm for solving sparse-modeling-based detectors [7, 9] for massive MIMO systems. Our solution relies on a special reformulation of the associated optimization problem by describing the constraints as a Cartesian power of the probability simplex. Simulation results show that the proposed algorithm is as accurate as the best known solvers (interior point methods), while its complexity remains linear with respect to the size of the system.
%G English
%L hal-02087659
%U https://hal.archives-ouvertes.fr/hal-02087659
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ PRACOM
%~ LAB-STICC_IMTA
Communication dans un congrès
Hmamouche Yassine, Benjillali Mustapha, Saoudi Samir
A Stochastic Geometry Based Approach to Tractable 5G RNPO with a New H-LOS Model
IEEE Wireless Communications and Networking Conference (WCNC), Apr 2019, Marrakech, Morocco
Bibtext :
@inproceedings{hmamouche:hal-02067720,
TITLE = {{A Stochastic Geometry Based Approach to Tractable 5G RNPO with a New H-LOS Model}},
AUTHOR = {Hmamouche, Yassine and Benjillali, Mustapha and Saoudi, Samir},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720},
BOOKTITLE = {{IEEE Wireless Communications and Networking Conference (WCNC)}},
ADDRESS = {Marrakech, Morocco},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720/file/PID5762903.pdf},
HAL_ID = {hal-02067720},
HAL_VERSION = {v1},
}
TITLE = {{A Stochastic Geometry Based Approach to Tractable 5G RNPO with a New H-LOS Model}},
AUTHOR = {Hmamouche, Yassine and Benjillali, Mustapha and Saoudi, Samir},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720},
BOOKTITLE = {{IEEE Wireless Communications and Networking Conference (WCNC)}},
ADDRESS = {Marrakech, Morocco},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720/file/PID5762903.pdf},
HAL_ID = {hal-02067720},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T A Stochastic Geometry Based Approach to Tractable 5G RNPO with a New H-LOS Model
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Institut National de Postes et Télécommunications [Rabat] (INPT)
%A Hmamouche, Yassine
%A Benjillali, Mustapha
%A Saoudi, Samir
%< avec comité de lecture
%B IEEE Wireless Communications and Networking Conference (WCNC)
%C Marrakech, Morocco
%8 2019-04-15
%D 2019
%Z Engineering Sciences [physics]
%Z Mathematics [math]Conference papers
%X We consider a 3D cellular network in which generalized shadowing and radio network planning and optimisation (RNPO) parameters (e.g., antenna height, antenna tilt/azimuth, power biaising...) are incorporated into the cell-selection model. Using tools from stochastic geometry (SG), we derive an equivalent 2D network in which no shadowing and RNPO parameters are considered. Next, we derive coverage probability for a tractable case-study network, and the regimes where coverage probability is maximized in addition to the interference-limited one are investigated. An intermediary result is a closed-form expression generator encompassing the Q-function based-expression in [1]. Numerical results confirm the accuracy of our approximations.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720/file/PID5762903.pdf
%L hal-02067720
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSMI
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ PRACOM
%F Oral
%T A Stochastic Geometry Based Approach to Tractable 5G RNPO with a New H-LOS Model
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Institut National de Postes et Télécommunications [Rabat] (INPT)
%A Hmamouche, Yassine
%A Benjillali, Mustapha
%A Saoudi, Samir
%< avec comité de lecture
%B IEEE Wireless Communications and Networking Conference (WCNC)
%C Marrakech, Morocco
%8 2019-04-15
%D 2019
%Z Engineering Sciences [physics]
%Z Mathematics [math]Conference papers
%X We consider a 3D cellular network in which generalized shadowing and radio network planning and optimisation (RNPO) parameters (e.g., antenna height, antenna tilt/azimuth, power biaising...) are incorporated into the cell-selection model. Using tools from stochastic geometry (SG), we derive an equivalent 2D network in which no shadowing and RNPO parameters are considered. Next, we derive coverage probability for a tractable case-study network, and the regimes where coverage probability is maximized in addition to the interference-limited one are investigated. An intermediary result is a closed-form expression generator encompassing the Q-function based-expression in [1]. Numerical results confirm the accuracy of our approximations.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720/file/PID5762903.pdf
%L hal-02067720
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067720
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSMI
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ PRACOM
Communication dans un congrès
Hmamouche Yassine, Benjillali Mustapha, Saoudi Samir
Stochastic Analysis of UDNs With Resource Capacity and User Scheduling
IEEE Wireless Communications and Networking Conference (WCNC), Apr 2019, Marrakech, Morocco
Bibtext :
@inproceedings{hmamouche:hal-02067730,
TITLE = {{Stochastic Analysis of UDNs With Resource Capacity and User Scheduling}},
AUTHOR = {Hmamouche, Yassine and Benjillali, Mustapha and Saoudi, Samir},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730},
BOOKTITLE = {{IEEE Wireless Communications and Networking Conference (WCNC)}},
ADDRESS = {Marrakech, Morocco},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730/file/PID5795429.pdf},
HAL_ID = {hal-02067730},
HAL_VERSION = {v1},
}
TITLE = {{Stochastic Analysis of UDNs With Resource Capacity and User Scheduling}},
AUTHOR = {Hmamouche, Yassine and Benjillali, Mustapha and Saoudi, Samir},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730},
BOOKTITLE = {{IEEE Wireless Communications and Networking Conference (WCNC)}},
ADDRESS = {Marrakech, Morocco},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730/file/PID5795429.pdf},
HAL_ID = {hal-02067730},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Stochastic Analysis of UDNs With Resource Capacity and User Scheduling
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Institut National de Postes et Télécommunications [Rabat] (INPT)
%A Hmamouche, Yassine
%A Benjillali, Mustapha
%A Saoudi, Samir
%< avec comité de lecture
%B IEEE Wireless Communications and Networking Conference (WCNC)
%C Marrakech, Morocco
%8 2019-04-15
%D 2019
%Z Mathematics [math]
%Z Engineering Sciences [physics]Conference papers
%X In this paper, we investigate the impact of antenna elevation, resource capacity and user scheduling on the performance of ultra-dense networks (UDNs). Using tools from stochas-tic geometry (SG), we extend a recently introduced definition of coverage probability by inducing a generic thinning that can capture BSs with available resource capacity to transmit users data. Analytical results are then derived for the coverage probability and the average achievable rate, where we obtain closed-form expressions allowing to assess UDNs performance in a more tractable and meaningful fashion compared to the conventional definition of coverage probability. Moreover, we show that the average rate under the new definition requires only the computation of a twofold numerical integral rather than a four-fold integral in the previous works, which is expected to significantly reduce computational complexity. Comparing the obtained results, we find that the impact of parameters, such as resource capacity, BS transmit power as well as the implementation complexity of scheduling schemes are irrelevant as network density increases, which suggests new insights into the role of these parameters in UDNs.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730/file/PID5795429.pdf
%L hal-02067730
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSMI
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ PRACOM
%F Oral
%T Stochastic Analysis of UDNs With Resource Capacity and User Scheduling
%+ Lab-STICC_IMTA_CACS_COM
%+ Département Signal et Communications (IMT Atlantique - SC)
%+ Institut National de Postes et Télécommunications [Rabat] (INPT)
%A Hmamouche, Yassine
%A Benjillali, Mustapha
%A Saoudi, Samir
%< avec comité de lecture
%B IEEE Wireless Communications and Networking Conference (WCNC)
%C Marrakech, Morocco
%8 2019-04-15
%D 2019
%Z Mathematics [math]
%Z Engineering Sciences [physics]Conference papers
%X In this paper, we investigate the impact of antenna elevation, resource capacity and user scheduling on the performance of ultra-dense networks (UDNs). Using tools from stochas-tic geometry (SG), we extend a recently introduced definition of coverage probability by inducing a generic thinning that can capture BSs with available resource capacity to transmit users data. Analytical results are then derived for the coverage probability and the average achievable rate, where we obtain closed-form expressions allowing to assess UDNs performance in a more tractable and meaningful fashion compared to the conventional definition of coverage probability. Moreover, we show that the average rate under the new definition requires only the computation of a twofold numerical integral rather than a four-fold integral in the previous works, which is expected to significantly reduce computational complexity. Comparing the obtained results, we find that the impact of parameters, such as resource capacity, BS transmit power as well as the implementation complexity of scheduling schemes are irrelevant as network density increases, which suggests new insights into the role of these parameters in UDNs.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730/file/PID5795429.pdf
%L hal-02067730
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02067730
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSMI
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ PRACOM
Communication dans un congrès
Nguyen Alex The Phuong, Le Bidan Raphaël, Guilloud Frédéric
Superimposed Frame Synchronization Optimization for Finite Blocklength Regime
WCNC Mathematical Tools for IoT Networks Modeling (MoTION), Apr 2019, Marrakech, Morocco
Bibtext :
@inproceedings{nguyen:hal-02076366,
TITLE = {{Superimposed Frame Synchronization Optimization for Finite Blocklength Regime}},
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-02076366},
BOOKTITLE = {{WCNC Mathematical Tools for IoT Networks Modeling (MoTION)}},
ADDRESS = {Marrakech, Morocco},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {preamble design ; short-packet transmissions ; finite blocklength ; URLLC ; mMTC ; frame synchronization},
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02076366/file/_WCNC2019__Superimposed_Frame_Sync_for_FBL_regime%20%281%29.pdf},
HAL_ID = {hal-02076366},
HAL_VERSION = {v1},
}
TITLE = {{Superimposed Frame Synchronization Optimization for Finite Blocklength Regime}},
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-02076366},
BOOKTITLE = {{WCNC Mathematical Tools for IoT Networks Modeling (MoTION)}},
ADDRESS = {Marrakech, Morocco},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {preamble design ; short-packet transmissions ; finite blocklength ; URLLC ; mMTC ; frame synchronization},
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02076366/file/_WCNC2019__Superimposed_Frame_Sync_for_FBL_regime%20%281%29.pdf},
HAL_ID = {hal-02076366},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Superimposed Frame Synchronization Optimization for Finite Blocklength Regime
%+ Département Signal et Communications (IMT Atlantique - 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 WCNC Mathematical Tools for IoT Networks Modeling (MoTION)
%C Marrakech, Morocco
%8 2019-04-15
%D 2019
%K preamble design
%K short-packet transmissions
%K finite blocklength
%K URLLC
%K mMTC
%K frame synchronization
%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 Considering a short frame length, which is typical in Ultra-Reliable Low-Latency and massive Machine Type Communications, a trade-off exists between improving the performance of frame synchronization (FS) and improving the performance of information throughput. In this paper, we consider the case of continuous transmission over AWGN channels where the synchronization sequence is superimposed to the data symbols, as opposed to being added as a frame header. The advantage of this superposition is that the synchronization length is as long as the frame length. On the other hand, its power has to be traded-off not to degrade the code performance. We first provide the analysis of FS error probability using an approximation of the probability distribution of the overall received signal. Numerical evaluations show the tightness of our analytic results. Then we optimize the fraction of power allocated to the superimposed synchronization sequence in order to maximize the probability of receiving a frame without synchronization errors nor decoding errors. Comparison of the theoretical model predictions to a practical setup show very close optimal power allocation policies.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02076366/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02076366/file/_WCNC2019__Superimposed_Frame_Sync_for_FBL_regime%20%281%29.pdf
%L hal-02076366
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02076366
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSMI
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ PRACOM
%F Oral
%T Superimposed Frame Synchronization Optimization for Finite Blocklength Regime
%+ Département Signal et Communications (IMT Atlantique - 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 WCNC Mathematical Tools for IoT Networks Modeling (MoTION)
%C Marrakech, Morocco
%8 2019-04-15
%D 2019
%K preamble design
%K short-packet transmissions
%K finite blocklength
%K URLLC
%K mMTC
%K frame synchronization
%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 Considering a short frame length, which is typical in Ultra-Reliable Low-Latency and massive Machine Type Communications, a trade-off exists between improving the performance of frame synchronization (FS) and improving the performance of information throughput. In this paper, we consider the case of continuous transmission over AWGN channels where the synchronization sequence is superimposed to the data symbols, as opposed to being added as a frame header. The advantage of this superposition is that the synchronization length is as long as the frame length. On the other hand, its power has to be traded-off not to degrade the code performance. We first provide the analysis of FS error probability using an approximation of the probability distribution of the overall received signal. Numerical evaluations show the tightness of our analytic results. Then we optimize the fraction of power allocated to the superimposed synchronization sequence in order to maximize the probability of receiving a frame without synchronization errors nor decoding errors. Comparison of the theoretical model predictions to a practical setup show very close optimal power allocation policies.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02076366/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02076366/file/_WCNC2019__Superimposed_Frame_Sync_for_FBL_regime%20%281%29.pdf
%L hal-02076366
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02076366
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSMI
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ PRACOM
Communication dans un congrès
Nguyen Alex The Phuong, Le Bidan Raphaël, Guilloud Frédéric
Superimposed Frame Synchronization Optimization for Finite Blocklength Regime
2019 WCNC Workshop on Mathematical Tools and technologies for IoT and mMTC Networks Modeling (MoTION), Apr 2019, Marrakech, Morocco
Bibtext :
@inproceedings{nguyen:hal-02083425,
TITLE = {{Superimposed Frame Synchronization Optimization for Finite Blocklength Regime}},
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-02083425},
BOOKTITLE = {{2019 WCNC Workshop on Mathematical Tools and technologies for IoT and mMTC Networks Modeling (MoTION)}},
ADDRESS = {Marrakech, Morocco},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {Frame synchronization ; preamble design ; short- packet transmission ; finite blocklength ; mMTC ; URLLC ; 5G},
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02083425/file/1810.07834.pdf},
HAL_ID = {hal-02083425},
HAL_VERSION = {v1},
}
TITLE = {{Superimposed Frame Synchronization Optimization for Finite Blocklength Regime}},
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-02083425},
BOOKTITLE = {{2019 WCNC Workshop on Mathematical Tools and technologies for IoT and mMTC Networks Modeling (MoTION)}},
ADDRESS = {Marrakech, Morocco},
YEAR = {2019},
MONTH = Apr,
KEYWORDS = {Frame synchronization ; preamble design ; short- packet transmission ; finite blocklength ; mMTC ; URLLC ; 5G},
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02083425/file/1810.07834.pdf},
HAL_ID = {hal-02083425},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Superimposed Frame Synchronization Optimization for Finite Blocklength Regime
%+ Département Signal et Communications (IMT Atlantique - 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 2019 WCNC Workshop on Mathematical Tools and technologies for IoT and mMTC Networks Modeling (MoTION)
%C Marrakech, Morocco
%8 2019-04-15
%D 2019
%K Frame synchronization
%K preamble design
%K short- packet transmission
%K finite blocklength
%K mMTC
%K URLLC
%K 5G
%Z Computer Science [cs]/Information Theory [cs.IT]
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X Considering a short frame length, which is typical in Ultra-Reliable Low-Latency and massive Machine Type Communications , a trade-off exists between improving the performance of frame synchronization (FS) and improving the performance of information throughput. In this paper, we consider the case of continuous transmission over AWGN channels where the synchronization sequence is superimposed to the data symbols, as opposed to being added as a frame header. The advantage of this superposition is that the synchronization length is as long as the frame length. On the other hand, its power has to be traded-off not to degrade the code performance. We first provide the analysis of FS error probability using an approximation of the probability distribution of the overall received signal. Numerical evaluations show the tightness of our analytic results. Then we optimize the fraction of power allocated to the superimposed synchronization sequence in order to maximize the probability of receiving a frame without synchronization errors nor decoding errors. Comparison of the theoretical model predictions to a practical setup show very close optimal power allocation policies.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02083425/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02083425/file/1810.07834.pdf
%L hal-02083425
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02083425
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ PRACOM
%~ LAB-STICC_IMTA
%F Oral
%T Superimposed Frame Synchronization Optimization for Finite Blocklength Regime
%+ Département Signal et Communications (IMT Atlantique - 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 2019 WCNC Workshop on Mathematical Tools and technologies for IoT and mMTC Networks Modeling (MoTION)
%C Marrakech, Morocco
%8 2019-04-15
%D 2019
%K Frame synchronization
%K preamble design
%K short- packet transmission
%K finite blocklength
%K mMTC
%K URLLC
%K 5G
%Z Computer Science [cs]/Information Theory [cs.IT]
%Z Engineering Sciences [physics]/Signal and Image processingConference papers
%X Considering a short frame length, which is typical in Ultra-Reliable Low-Latency and massive Machine Type Communications , a trade-off exists between improving the performance of frame synchronization (FS) and improving the performance of information throughput. In this paper, we consider the case of continuous transmission over AWGN channels where the synchronization sequence is superimposed to the data symbols, as opposed to being added as a frame header. The advantage of this superposition is that the synchronization length is as long as the frame length. On the other hand, its power has to be traded-off not to degrade the code performance. We first provide the analysis of FS error probability using an approximation of the probability distribution of the overall received signal. Numerical evaluations show the tightness of our analytic results. Then we optimize the fraction of power allocated to the superimposed synchronization sequence in order to maximize the probability of receiving a frame without synchronization errors nor decoding errors. Comparison of the theoretical model predictions to a practical setup show very close optimal power allocation policies.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02083425/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02083425/file/1810.07834.pdf
%L hal-02083425
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02083425
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA_CACS_COM
%~ IMTA_SC
%~ INSTITUT-TELECOM
%~ PRACOM
%~ LAB-STICC_IMTA
Communication dans un congrès
Mouchet Maxime, Chonavel Thierry, Vaton Sandrine
Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models
IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019), Apr 2019, Washington, DC, United States
Bibtext :
@inproceedings{mouchet:hal-02010099,
TITLE = {{Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models}},
AUTHOR = {Mouchet, Maxime and Chonavel, Thierry and Vaton, Sandrine},
URL = {https://hal.archives-ouvertes.fr/hal-02010099},
BOOKTITLE = {{IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019)}},
ADDRESS = {Washington, DC, United States},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal.archives-ouvertes.fr/hal-02010099/file/AnNet_2019.pdf},
HAL_ID = {hal-02010099},
HAL_VERSION = {v1},
}
TITLE = {{Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models}},
AUTHOR = {Mouchet, Maxime and Chonavel, Thierry and Vaton, Sandrine},
URL = {https://hal.archives-ouvertes.fr/hal-02010099},
BOOKTITLE = {{IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019)}},
ADDRESS = {Washington, DC, United States},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal.archives-ouvertes.fr/hal-02010099/file/AnNet_2019.pdf},
HAL_ID = {hal-02010099},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models
%+ Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA)
%+ Département Informatique (IMT Atlantique - INFO)
%+ Université Bretagne Loire (UBL)
%+ Lab-STICC_TB_CID_TOMS
%+ Département Signal et Communications (IMT Atlantique - SC)
%A Mouchet, Maxime
%A Chonavel, Thierry
%A Vaton, Sandrine
%< avec comité de lecture
%B IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019)
%C Washington, DC, United States
%8 2019-04-08
%D 2019
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The study of round-trip time (RTT) measurements on the Internet is of particular importance for improving real-time applications, enforcing QoS with traffic engineering, or detecting unexpected network conditions. On large timescales, from 1 hour to several days, RTT measurements exhibit characteristic patterns due to inter and intra-AS routing changes and traffic engineering, in addition to link congestion. We propose the use of a nonparametric Bayesian model, the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM), to characterize RTT timeseries. The parameters of the HMM, including the number of states, as well as the values of hidden states are estimated from delay observations by Gibbs sampling. No assumptions are made on the number of states, and a nonparametric mixture model is used to represent a wide range of delay distribution in each state for more flexibility. We validate the model through three applications: on RIPE Atlas measurements we show that 80% of the states learned on RTTs match only one AS path; on a labelled delay changepoint dataset we show that the model is competitive with state-of-the-art changepoint detection methods in terms of precision and recall; and we show that the predictive ability of the model allows us to reduce the monitoring cost by 90% in routing overlays using Markov decision processes.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02010099/document
%2 https://hal.archives-ouvertes.fr/hal-02010099/file/AnNet_2019.pdf
%L hal-02010099
%U https://hal.archives-ouvertes.fr/hal-02010099
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ IRISA_SET
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA
%~ INRIA-AUT
%~ IMTA_SC
%~ IMTA_INFO
%~ INSA-GROUPE
%~ UNIV-RENNES1
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ TEST-UR-CSS
%~ IRISA_IMTA
%~ UNIV-RENNES
%~ PRACOM
%T Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models
%+ Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA)
%+ Département Informatique (IMT Atlantique - INFO)
%+ Université Bretagne Loire (UBL)
%+ Lab-STICC_TB_CID_TOMS
%+ Département Signal et Communications (IMT Atlantique - SC)
%A Mouchet, Maxime
%A Chonavel, Thierry
%A Vaton, Sandrine
%< avec comité de lecture
%B IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019)
%C Washington, DC, United States
%8 2019-04-08
%D 2019
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The study of round-trip time (RTT) measurements on the Internet is of particular importance for improving real-time applications, enforcing QoS with traffic engineering, or detecting unexpected network conditions. On large timescales, from 1 hour to several days, RTT measurements exhibit characteristic patterns due to inter and intra-AS routing changes and traffic engineering, in addition to link congestion. We propose the use of a nonparametric Bayesian model, the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM), to characterize RTT timeseries. The parameters of the HMM, including the number of states, as well as the values of hidden states are estimated from delay observations by Gibbs sampling. No assumptions are made on the number of states, and a nonparametric mixture model is used to represent a wide range of delay distribution in each state for more flexibility. We validate the model through three applications: on RIPE Atlas measurements we show that 80% of the states learned on RTTs match only one AS path; on a labelled delay changepoint dataset we show that the model is competitive with state-of-the-art changepoint detection methods in terms of precision and recall; and we show that the predictive ability of the model allows us to reduce the monitoring cost by 90% in routing overlays using Markov decision processes.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02010099/document
%2 https://hal.archives-ouvertes.fr/hal-02010099/file/AnNet_2019.pdf
%L hal-02010099
%U https://hal.archives-ouvertes.fr/hal-02010099
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ IRISA_SET
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA
%~ INRIA-AUT
%~ IMTA_SC
%~ IMTA_INFO
%~ INSA-GROUPE
%~ UNIV-RENNES1
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ TEST-UR-CSS
%~ IRISA_IMTA
%~ UNIV-RENNES
%~ PRACOM
Contacts