LDPC Lattice Codes for Full Full-Duplex Relay Channels
Abstract: Low-density parity-check check (LDPC) lattices were the first family of lattices to show efficient decoding in high dimensions. We consider a case of these lattices with one binary LDPC code as an underlying code. We employ encoding and decoding of the LDPC lattices ices in a cooperative transmission framework. We establish two efficient shaping based on hypercube and Voronoi shaping, to obtain LDPC lattice codes. Then, we propose the implementation of block Markov encoding for oneone way and two-way way relay networks using LDPC lattice codes. An efficient method is also required for decomposing full full-rate rate codebook into lower rate codebooks. We apply different decomposition schemes for one one-way and two-way way relay channels, which are the altered versions of the decomposition met methods hods of low density lattice code (LDLC) lattices. Due to the lower complexity of the decoding for LDPC lattices comparing with LDLCs, the complexity of our schemes is significantly lower than the ones proposed for LDLCs. The efficiency of the proposed schemes sche is presented using simulation results that indicate the outperforming behavior of LDLCs over LDPC lattice codes in the same dimensions. However, having lower decoding complexity enables us to increase the dimension of the lattice to compensate the existing ting gap between the performance of the LDPC lattice codes and the LDLCs.