MIMO Cube Decoder
Abstract
An insight on the lattice decoder for flat-fading multiple antenna wireless communications systems is presented in this paper. In particular, we show that by formulating the decoding problem as a bounded-error subset selection, the resultant decoder finds the nearest lattice point to the received signal vector such that the search is bounded inside a hypercube centered at the received vector. The dimensions and orientation of the hypercube can be adjusted based on the diversity of the channel in order to improve its performance. The search for the nearest codeword to the received signal vector is solved by modeling the problem as an Integer Program (IP). Simulation shows that the proposed decoder is inferior to the Sphere Decoder (SD) by about 1-dB while its complexity is superior to the Sphere Decoder at very low signal to noise ratio.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
M. Alghoniemy and A. Tewfik, "MIMO Cube Decoder," in Journal of Communications Software and Systems, vol. 7, no. 3, pp. 104-108, September 2011, doi: 10.24138/jcomss.v7i3.176
@article{alghoniemy2011mimocube,
author = {Masoud Alghoniemy and Ahmed H. Tewfik},
title = {MIMO Cube Decoder},
journal = {Journal of Communications Software and Systems},
month = {9},
year = {2011},
volume = {7},
number = {3},
pages = {104--108},
doi = {10.24138/jcomss.v7i3.176},
url = {https://doi.org/10.24138/jcomss.v7i3.176}
}