Reduced complexity closest point decoding algorithms for random lattices

  title={Reduced complexity closest point decoding algorithms for random lattices},
  author={Wanlun Zhao and Georgios B. Giannakis},
  journal={IEEE Transactions on Wireless Communications},
Abstract-Closest point algorithms find wide applications in decoding block transmissions encountered with single- or multiuser communication links relying on a single or multiple antennas. Capitalizing on the random channel and noise models typically encountered in wireless communications, the sphere decoding algorithm (SDA) and related complexity-reducing techniques are approached in this paper from a probabilistic perspective. With both theoretical analysis and simulations, combining SDA with… CONTINUE READING
Highly Cited
This paper has 61 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 43 extracted citations

62 Citations

Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 16 references

Euclidean space lattice decoding for joint detection in CDMA systems,

  • L. Brunel, J. Boutros
  • in Proc. of Inform. Theory Workshop,
  • 1999
Highly Influential
5 Excerpts

and L

  • J. Luo, K. Pattipati, P. Willett
  • Brunel, “Branch-and-bound-based fast optimal…
  • 2003

Sphere Packings

  • J. H. Conway, N.J.A. Sloane
  • Lattices, and Groups, 3rd Ed., Springer-Verlag…
  • 1999
1 Excerpt

V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel,

  • P. W. Wolniansky, G. J. Foschini, G. D. Golden, R. A. Valenzuela
  • Proc. ISSSE,
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…