On the Sphere-Decoding Algorithm II. Generalizations, Second-Order Statistics, and Applications to Communications

IEEE Transactions on Signal Processing

Volumn 53, Issue 8, 2005, Pages 2819-2834

  Vikalo, Haris ^a   Hamsibi, Babak ^a  

^a California Institute of Technology   (United States)

Author keywords

Expected complexity; frequency selective channels; multiple antenna systems; polynomial time complexity; sphere decoding; wireless communications

Indexed keywords

EID: 85008006460     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/TSP.2005.850350     Document Type: Article

References (19)

1. E. Viterbo and E. Biglieri, “A universal decoding algorithm for lattice codes,” in Proc. Quatorzieme Colloque GRETSI, 1993, pp. 611–614.
2. A. Banihashemi and A. Khandani, “On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis,” IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 162–171, Feb. 1998.
3. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, “Closest point search in lattices,” IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2001–2214, Aug. 2002.
4. E. Viterbo and J. Boutros, “A universal lattice decoder for fading channels,” IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 1639–1642, Jul. 1999.
5. L. Brunel and J. Boutros, “Euclidean space lattice decoding for joint detection in CDMA systems,” in Proc. IEEE Inf. Theory Commun. Workshop, 1999, p. 129.
6. G. J. Foschini, “Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas,” Bell Labs. Tech. J., vol. 1, no. 2, pp. 41–59, 1996.
7. M. O. Damen, A. Chkeif, and J.-C. Belfiore, “Lattice code decoder for space-time codes,” IEEE Commun. Lett., vol. 4, no. 5, pp. 161–163, May 2000.
8. B. Hassibi and B. Hochwald, “High-rate codes that are linear in space and time,” IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1804–1824, Jul. 2002.
9. W. H. Mow, “Maximum likelihood sequence estimation from the lattice viewpoint,” IEEE Trans. Inf. Theory, vol. 40, no. 9, pp. 1591–1600, Sep. 1994.
10. A. Hassibi and S. Boyd, “Integer parameter estimation in linear models with applications to GPS,” IEEE Trans. Signal Process., vol. 46, no. 11, pp. 2938–2952, Nov. 1998.
11. M. Ajtai, “Generating hard instances of lattice problems,” in Proc. 28th Annu. ACM Symp. Theory Comput., 1996, pp. 99–108.
12. O. Goldreich, S. Goldwasser, and S. Halevi, “Public-key cryptosystems from lattice reduction problems,” in Proc. 17th Annu. Int. Cryptography Conf., 1997, pp. 112–131.
13. R. Fischlin and J. Seifert, “Tensor-based trapdoors for CVP and their application to public key cryptography,” in Proc. 7th IMA Int. Conf., 1999, pp. 244–257.
14. H. Vikalo, “Sphere decoding algorithms for digital communications,” Ph.D. dissertation, Stanford Univ., Stanford, CA, 2003.
15. C. P. Schnorr and M. Euchner, “Lattice basis reduction: improved practical algorithms and solving subset sum problems,” Math. Programming, vol. 66, pp. 181–191, 1994.
16. H. Vikalo, B. Hassibi, and U. Mitra, “Sphere-constrained ML detection for channels with memory,” in Proc. 37th Asilomar Conf. Signals, Syst., Comput., 2003, pp. 672–676.
17. H. Vikalo and B. Hassibi, “On joint ML detection and decoding,” in Proc. IEEE Int. Symp. Inf. Theory, 2003, p. 275.
18. J. Wang, “Average-case computational complexity theory,” Complexity Theory Retrospective II, pp. 295–328, 1997.
19. A. Edelman, “Eigenvalues and condition numbers of random matrices,” Ph.D. dissertation, Dept. of Math., Mass. Inst. Technol., Cambridge, MA, 1989.