Tail behavior of sphere-decoding complexity in random lattices


Dominik Seethaler, Joakim Jaldén, Christoph Studer, and Helmut Bölcskei


Proc. of IEEE International Symposium on Information Theory (ISIT), Seoul, South Korea, pp. 729-733, June 2009

DOI: 10.1109/ISIT.2009.5205679

[BibTeX, LaTeX, and HTML Reference]


We analyze the (computational) complexity distribution of sphere-decoding (SD) for random infinite lattices. In particular, we show that under fairly general assumptions on the statistics of the lattice basis matrix, the tail behavior of the SD complexity distribution is solely determined by the inverse volume of a fundamental region of the underlying lattice. Particularizing this result to NxM, N>=M, i.i.d. Gaussian lattice basis matrices, we find that the corresponding complexity distribution is of Pareto-type with tail exponent given by N-M+1. We furthermore show that this tail exponent is not improved by lattice-reduction, which includes layer-sorting as a special case.


MIMO wireless, data detection, sphere-decoding, maximum-likelihood, complexity, random lattices

Download this document:


Copyright Notice: © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.