A Lattice-Partition Framework of Downlink Non-Orthogonal Multiple Access Without SIC

Abstract

In this paper, a novel lattice-partition-based downlink non-orthogonal multiple access framework is proposed. This framework is motivated by recognizing the algebraic structure behind the previous scheme recently proposed by Shieh and Huang as a lattice partition in Z and is in fact a generalization of the scheme to any base lattice. The schemes in the proposed framework enjoy many desirable properties such as explicit and systematic design and discrete input distributions. Moreover, the proposed method only requires a limited knowledge of channel parameters. The rates achieved by the proposed scheme with any base lattice and with single-user decoding (i.e., without successive interference cancellation) are analyzed, and a universal upper bound on the gap to the multiuser capacity is obtained as a function of the normalized second moment of the base lattice. Since the proposed framework has a substantially larger design space than that of the previous scheme of Shieh and Huang whose base lattice is a 1-D lattice, one can easily find instances in larger dimensions that can provide superior performance. Design examples with the base lattices A <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> , D <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub> , E <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">8</sub> , and Construction A lattices, respectively, are provided, and both theoretical and simulation results exhibit smaller gaps to the multiuser capacity as dimensions increase.