Recently it was shown that a lattice code with lattice decoding can achieve the capacity of the additive white Gaussian noise (AWGN) channel. This was achieved by using a minimum mean-square error (MMSE) scaling and dithering to transform the AWGN channel into a modulo-lattice additive noise (mod-Λ) channel. Further, Liu et. al. have shown that lattice decoding can achieve the error exponent of the AWGN channel using a scaling other than the MMSE scaling at rates above the critical rate of the channel. We present a simple geometric explanation for this result.
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattice...
In this thesis, we propose a new class of lattices based on polar codes, namely polar lattices. Pola...
Abstract—“Naive Lattice Decoding ” (NLD) and its low-complexity approximations such as lattice reduc...
Abstract—We address an open question, regarding whether a lattice code with lattice decoding (as opp...
Abstract—We investigate the value of MMSE scaling for practical lattice codes. For ideal lattices, M...
Abstract—In this paper, the performance limits and the compu-tational complexity of the lattice sequ...
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the...
lattice codes for communication over additive white Gaussian noise (AWGN) channels. We introduce Con...
In this paper we show that any sequence of infinite lattice constellations which is good for the unc...
International audienceThe problem of communicating over the additive white Gaussian noise (AWGN) cha...
We propose a lattice coding scheme that achieves the capacity of the compound block-fading channel. ...
Abstract—We present a novel combinatorial geometrical ap-proach for evaluating the performance of mu...
Abstract-Currently for the nT × nR MIMO channel, any explicitly constructed space-time (ST) designs ...
Abstract—The problem of searching the closest lattice point in large dimensional lattices finds many...
Random nested lattice codes have played an important role in network information theory. However, t...
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattice...
In this thesis, we propose a new class of lattices based on polar codes, namely polar lattices. Pola...
Abstract—“Naive Lattice Decoding ” (NLD) and its low-complexity approximations such as lattice reduc...
Abstract—We address an open question, regarding whether a lattice code with lattice decoding (as opp...
Abstract—We investigate the value of MMSE scaling for practical lattice codes. For ideal lattices, M...
Abstract—In this paper, the performance limits and the compu-tational complexity of the lattice sequ...
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the...
lattice codes for communication over additive white Gaussian noise (AWGN) channels. We introduce Con...
In this paper we show that any sequence of infinite lattice constellations which is good for the unc...
International audienceThe problem of communicating over the additive white Gaussian noise (AWGN) cha...
We propose a lattice coding scheme that achieves the capacity of the compound block-fading channel. ...
Abstract—We present a novel combinatorial geometrical ap-proach for evaluating the performance of mu...
Abstract-Currently for the nT × nR MIMO channel, any explicitly constructed space-time (ST) designs ...
Abstract—The problem of searching the closest lattice point in large dimensional lattices finds many...
Random nested lattice codes have played an important role in network information theory. However, t...
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattice...
In this thesis, we propose a new class of lattices based on polar codes, namely polar lattices. Pola...
Abstract—“Naive Lattice Decoding ” (NLD) and its low-complexity approximations such as lattice reduc...