Cube decoding

A novel lattice decoder called the cube decoder (CD) is proposed in this paper. The cube decoder finds the nearest lattice point to the received signal vector inside a hypercube centered at the received vector. The dimensions of the hypercube depends on the modulating lattice. This is achieved by reformulating the detection problem as a bounded-error subset selection (BESS) and solving a binary integer program. In this paper, it is assumed that the channel is known to the receiver. The proposed decoder uses the lattice reduction technique to reduce the interference introduced by the channel. Simulation shows that the CD gives near-optimal performance. Unlike the sphere decoder (SD), the complexity of the CD shows weak dependence on SNR.