The Experts below are selected from a list of 2361 Experts worldwide ranked by ideXlab platform
Jean-claude Belfiore - One of the best experts on this subject based on the ideXlab platform.
-
Universal Lattice Codes for MIMO Channels
IEEE Transactions on Information Theory, 2018Co-Authors: Antonio Campello, Cong Ling, Jean-claude BelfioreAbstract:We propose a coding scheme that achieves the capacity of the compound MIMO Channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned Channel Realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. These techniques, along with algebraic properties of the proposed lattices, are then used to construct a sub-optimal de-coupled coding scheme that achieves a constant gap to compound capacity by decoding in a lattice that does not dependent on the Channel Realization. The gap is characterized in terms of algebraic invariants of the code and is shown to be significantly smaller than previous schemes in the literature. We also exhibit alternative algebraic constructions that achieve the capacity of ergodic (SISO) fading Channels.
-
Universal Lattice Codes for MIMO Channels
arXiv: Information Theory, 2016Co-Authors: Antonio Campello, Cong Ling, Jean-claude BelfioreAbstract:We propose a coding scheme that achieves the capacity of the compound MIMO Channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned Channel Realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. These techniques, along with algebraic properties of the proposed lattices, are then used to construct a sub-optimal de-coupled coding schemes that achieves a gap to compound capacity by decoding in a lattice that does not depend of the Channel Realization. The gap is characterized in terms of algebraic invariants of the codes, and shown to be significantly smaller than previous schemes in the literature. We also exhibit alternative algebraic constructions that achieve the capacity of ergodic fading Channels.
-
VTC Spring - An Adaptive MIMO Decoder
VTC Spring 2009 - IEEE 69th Vehicular Technology Conference, 2009Co-Authors: Rym Ouertani, Ghaya Rekaya Ben-othman, Jean-claude BelfioreAbstract:In existing MIMO systems, either optimal or sub-optimal decoders can be used according to the required performance. However, the optimal decoders give ML performance but have very high complexity and the sub-optimal decoders give low complexity but poor performance. Moreover for ML decoding, the variable decoding time at a fixed SNR for the different Channel Realizations and also the big gap in the complexity between low and high SNRs represent a critical point for practical implementation. We propose here an adaptive decoder that allows to switch between optimal and sub-optimal decoders according to the Channel Realization and the system specifications. This decoder offers an almost constant complexity while keeping good performance.
-
An adaptive MIMO decoder
IEEE Vehicular Technology Conference, 2009Co-Authors: Rym Ouertani, Ghaya Rekaya Ben-othman, Jean-claude BelfioreAbstract:In existing MIMO systems, either optimal or suboptimal decoders can be used according to the required performance. However, the optimal decoders give ML performance but have very high complexity and the sub-optimal decoders give low complexity but poor performance. Moreover for ML decoding, the variable decoding time at a fixed SNR for the different Channel Realizations and also the big gap in the complexity between low and high SNRs represent a critical point for practical implementation. We propose here an adaptive decoder that allows to switch between optimal and sub-optimal decoders according to the Channel Realization and the system specifications. This decoder offers an almost constant complexity while keeping good performance. © 2009 IEEE.
Antonio Campello - One of the best experts on this subject based on the ideXlab platform.
-
Universal Lattice Codes for MIMO Channels
IEEE Transactions on Information Theory, 2018Co-Authors: Antonio Campello, Cong Ling, Jean-claude BelfioreAbstract:We propose a coding scheme that achieves the capacity of the compound MIMO Channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned Channel Realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. These techniques, along with algebraic properties of the proposed lattices, are then used to construct a sub-optimal de-coupled coding scheme that achieves a constant gap to compound capacity by decoding in a lattice that does not dependent on the Channel Realization. The gap is characterized in terms of algebraic invariants of the code and is shown to be significantly smaller than previous schemes in the literature. We also exhibit alternative algebraic constructions that achieve the capacity of ergodic (SISO) fading Channels.
-
Multilevel code construction for compound fading Channels
2017 IEEE International Symposium on Information Theory (ISIT), 2017Co-Authors: Antonio Campello, Cong LingAbstract:We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading Channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with negligible probability of error for any Channel Realization and normalized log-density approaching the Poltyrev limit. Capacity analyses and numerical results on the achievable rates for each partition level are provided. The proposed codes have several enjoyable properties such as constructiveness and good decoding complexity, as compared to random one-level codes. Numerical results for finite-dimensional multi-level lattices based on polar codes are exhibited.
-
Universal Lattice Codes for MIMO Channels
arXiv: Information Theory, 2016Co-Authors: Antonio Campello, Cong Ling, Jean-claude BelfioreAbstract:We propose a coding scheme that achieves the capacity of the compound MIMO Channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned Channel Realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. These techniques, along with algebraic properties of the proposed lattices, are then used to construct a sub-optimal de-coupled coding schemes that achieves a gap to compound capacity by decoding in a lattice that does not depend of the Channel Realization. The gap is characterized in terms of algebraic invariants of the codes, and shown to be significantly smaller than previous schemes in the literature. We also exhibit alternative algebraic constructions that achieve the capacity of ergodic fading Channels.
Cong Ling - One of the best experts on this subject based on the ideXlab platform.
-
Universal Lattice Codes for MIMO Channels
IEEE Transactions on Information Theory, 2018Co-Authors: Antonio Campello, Cong Ling, Jean-claude BelfioreAbstract:We propose a coding scheme that achieves the capacity of the compound MIMO Channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned Channel Realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. These techniques, along with algebraic properties of the proposed lattices, are then used to construct a sub-optimal de-coupled coding scheme that achieves a constant gap to compound capacity by decoding in a lattice that does not dependent on the Channel Realization. The gap is characterized in terms of algebraic invariants of the code and is shown to be significantly smaller than previous schemes in the literature. We also exhibit alternative algebraic constructions that achieve the capacity of ergodic (SISO) fading Channels.
-
Multilevel code construction for compound fading Channels
2017 IEEE International Symposium on Information Theory (ISIT), 2017Co-Authors: Antonio Campello, Cong LingAbstract:We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading Channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with negligible probability of error for any Channel Realization and normalized log-density approaching the Poltyrev limit. Capacity analyses and numerical results on the achievable rates for each partition level are provided. The proposed codes have several enjoyable properties such as constructiveness and good decoding complexity, as compared to random one-level codes. Numerical results for finite-dimensional multi-level lattices based on polar codes are exhibited.
-
Universal Lattice Codes for MIMO Channels
arXiv: Information Theory, 2016Co-Authors: Antonio Campello, Cong Ling, Jean-claude BelfioreAbstract:We propose a coding scheme that achieves the capacity of the compound MIMO Channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned Channel Realizations. To shape the constellation, a discrete Gaussian distribution over the lattice points is applied. These techniques, along with algebraic properties of the proposed lattices, are then used to construct a sub-optimal de-coupled coding schemes that achieves a gap to compound capacity by decoding in a lattice that does not depend of the Channel Realization. The gap is characterized in terms of algebraic invariants of the codes, and shown to be significantly smaller than previous schemes in the literature. We also exhibit alternative algebraic constructions that achieve the capacity of ergodic fading Channels.
Erik G. Larsson - One of the best experts on this subject based on the ideXlab platform.
-
Achievable Outage Rate Regions for the MISO Interference Channel
IEEE Wireless Communications Letters, 2013Co-Authors: Johannes Lindblom, Eleftherios Karipidis, Erik G. LarssonAbstract:We consider the slow-fading two-user multiple-input single-output (MISO) interference Channel. We want to understand which rate points can be achieved, allowing a non-zero outage probability. We do so by defining four different outage rate regions. The definitions differ on whether the rates are declared in outage jointly or individually and whether the transmitters have instantaneous or statistical Channel state information (CSI). The focus is on the instantaneous CSI case with individual outage, where we propose a stochastic mapping from the rate point and the Channel Realization to the beamforming vectors. A major contribution is that we prove that the stochastic component of this mapping is independent of the actual Channel Realization.
-
ICASSP - New results on adaptive computational resource allocation in soft MIMO detection
2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2011Co-Authors: Mirsad Cirkic, Daniel Persson, Erik G. LarssonAbstract:The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent Channel Realizations. We develop methods that adaptively allocate computational resources to the detection problems of each Channel Realization, under a total per-codeword complexity constraint. The new results consist of a new algorithm, a new performance measure, and a thorough complexity discussion.
-
Optimization of computational resource allocation for soft MIMO detection
2009 Conference Record of the Forty-Third Asilomar Conference on Signals Systems and Computers, 2009Co-Authors: Mirsad Cirkic, Daniel Persson, Erik G. LarssonAbstract:We consider soft MIMO detection for the case of block fading. That is, the transmitted codeword spans over several independent Channel Realizations and several instances of the detection problem must be solved for each such Realization. We develop methods that adaptively allocate the computational resources to the detection problems of each Channel Realization, under a total per-codeword complexity constraint. Our main results are a formulation of the problem as a mathematical optimization problem and a greedy algorithm to approximate it in a computationally feasible fashion.
Holger Boche - One of the best experts on this subject based on the ideXlab platform.
-
Capacity region continuity of the compound broadcast Channel with confidential messages
2015 IEEE Information Theory Workshop (ITW), 2015Co-Authors: Andrea Grigorescu, Holger Boche, Rafael F. Schaefer, Vincent H. PoorAbstract:The compound broadcast Channel with confidential messages (BCC) generalizes the BCC by modeling the uncertainty of the Channel. For the compound BCC, it is known only that the actual Channel Realization belongs to a pre-specified uncertainty set of Channels and that it is constant during the entire transmission. For reliable and secure communication it is necessary to operate at a rate pair within the compound BCC capacity region. Therefore, the question of whether small variations of the uncertainty set lead to large losses of the compound BCC capacity region is of interest, and this problem is studied here. In particular, it is shown that the compound BCC model is robust, i.e., the capacity region depends continuously on the uncertainty set.
-
Strong secrecy in compound broadcast Channels with confidential messages
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Rafael F. Wyrembelski, Holger BocheAbstract:In this paper the compound broadcast Channel with confidential messages is studied, where it is only known to the transmitter and receivers that the actual Channel Realization is fixed and from a pre-specified set of Channels. An achievable rate region for the strong secrecy criterion is derived. Further, a multi-letter outer bound is given, which establishes, together with the achievable rate region, a multi-letter expression of the strong secrecy capacity region.
-
ISIT - Strong secrecy in compound broadcast Channels with confidential messages
2012 IEEE International Symposium on Information Theory Proceedings, 2012Co-Authors: Rafael F. Wyrembelski, Holger BocheAbstract:In this paper the compound broadcast Channel with confidential messages is studied, where it is only known to the transmitter and receivers that the actual Channel Realization is fixed and from a pre-specified set of Channels. An achievable rate region for the strong secrecy criterion is derived. Further, a multi-letter outer bound is given, which establishes, together with the achievable rate region, a multi-letter expression of the strong secrecy capacity region.