Lattice codes are elegant and powerful structures that not only can achieve the capacity of the AWGN channel but also are a key ingredient to many multiterminal schemes that exploit linearity properties. However, constructing lattice codes that can realize these benefits with low complexity is still a challenging problem. In this paper, efficient encoding and decoding algorithms are proposed for multilevel binary LDPC lattices constructed via Construction D' whose complexity is linear in the total number of coded bits. Moreover, a generalization of Construction D' is proposed that relaxes some of the nesting constraints on the component codes, leading to a simpler and improved design. Based on this construction, low-complexity multilevel LDPC lattices are designed whose performance under multistage lattice decoding is comparable to that of polar lattices on the power-unconstrained AWGN channel and close to that of conventional (non-lattice) coded modulation schemes on the power-constrained AWGN channel.
A lattice code consists of the intersection of a lattice (a discrete additive subgroup of the Euclidean space) and a bounded region, also called a shaping region. While it is well-known that lattice codes can achieve the capacity of the AWGN channel (see @cite_0 and references therein), renewed interest in the topic can be traced to the seminal paper by Erez and Zamir @cite_28 , who showed that capacity can be achieved by nested lattice codes with lattice decoding (a suboptimal decoding approach which effectively ignores the shaping region). Since then, several applications of lattice codes to multiterminal information theory have been proposed based on their results, including: distributed source coding @cite_5 , physical-layer security @cite_6 , and communication over Gaussian networks @cite_25 ---in particular, lattice codes are essential to the compute-and-forward strategy for relay networks @cite_19 and to integer-forcing methods for MIMO channels @cite_27 .
@cite_28 @cite_6 @cite_0 @cite_19 @cite_27 @cite_5 @cite_25
1512015702 2098653764 2101872481 2400872280
We address an open question, regarding whether a lattice code with lattice decoding (as opposed to maximum-likelihood (ML) decoding) can achieve the additive white Gaussian noise (AWGN) channel capacity. We first demonstrate how minimum mean-square error (MMSE) scaling along with dithering (lattice randomization) techniques can transform the power-constrained AWGN channel into a modulo-lattice additive noise channel, whose effective noise is reduced by a factor of spl radic (1+SNR SNR). For the resulting channel, a uniform input maximizes mutual information, which in the limit of large lattice dimension becomes 1 2 log (1+SNR), i.e., the full capacity of the original power constrained AWGN channel. We then show that capacity may also be achieved using nested lattice codes, the coarse lattice serving for shaping via the modulo-lattice transformation, the fine lattice for channel coding. We show that such pairs exist for any desired nesting ratio, i.e., for any signal-to-noise ratio (SNR). Furthermore, for the modulo-lattice additive noise channel lattice decoding is optimal. Finally, we show that the error exponent of the proposed scheme is lower bounded by the Poltyrev exponent. In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity @math of the additive white Gaussian-noise (AWGN) channel for any signal-to-noise ratio (SNR). Our construction follows the multilevel approach of , where on each level we construct a capacity-achieving polar code. The component polar codes are naturally nested, thereby fulfilling the requirement of the multilevel lattice construction. We prove that polar lattices are AWGN-good, in the sense that the error probability (for infinite lattice decoding) vanishes for any fixed volume-to-noise ratio (VNR) greater than @math . Furthermore, using the technique of source polarization, we propose discrete Gaussian shaping over the polar lattice to satisfy the power constraint. The proposed polar lattices permit low-complexity multistage successive cancellation decoding. Both the construction and shaping are explicit, and the overall complexity of encoding and decoding is @math for any fixed target error probability. It has been conjectured that lattice codes are good for (almost) everything. As an additional bit of evidence for this claim, we offer a few results showing the utility of lattice codes for the AWGN relay channel. We show that the decode-and-forward rates of the relay channel can be achieved using lattice encoding and decoding. We present an encoding decoding technique that uses a doubly-nested lattice code. Encoding is accomplished using a combination of superposition encoding and block Markov encoding, while decoding is accomplished using a strategy reminiscent of Cover and El Gamal's list decoding. Our technique can be extended to a wide variety of relay topologies, including the half-duplex relay channel and the cooperative multiple-access channel. Lattice codes used under the Compute-and-Forward paradigm suggest an alternative strategy for the standard Gaussian multiple-access channel (MAC): The receiver successively decodes integer linear combinations of the messages until it can invert and recover all messages. In this paper, this strategy is developed and analyzed. For the two-user MAC, it is shown that without time-sharing, the entire capacity region can be attained with a single-user decoder as soon as the signal-to-noise ratios are above @math . A partial analysis is given for more than two users. Lastly the strategy is extended to the so-called dirty MAC where two interfering signals are known non-causally to the two transmitters in a distributed fashion. Our scheme extends the previously known results and gives new achievable rate regions.