Faster recursions in sphere decoding

IEEE Transactions on Information Theory

Volumn 57, Issue 6, 2011, Pages 3530-3536

  Ghasemmehdi, Arash ^b   Agrell, Erik ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b NONE

Author keywords

Closest point search; Fincke Pohst; lattice; Lenstra Lenstra Lov sz (LLL) reduction; maximum likelihood (ML) detection; multiple input multiple output (MIMO); Schnorr Euchner; sphere decoder

Indexed keywords

CLOSEST POINT SEARCH; FINCKE-POHST; LATTICE; MAXIMUM LIKELIHOOD (ML) DETECTION; MULTIPLE-INPUT MULTIPLE-OUTPUT (MIMO); SCHNORR-EUCHNER; SPHERE DECODER;

DECODING; MAXIMUM LIKELIHOOD; MIMO SYSTEMS;

SPHERES;

EID: 79957668567     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2143830     Document Type: Article

References (24)

1. M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications," SIGSAM Bull., vol. 15, no. 1, pp. 37-44, Feb. 1981.
2. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, no. 170, pp. 463-471, Apr. 1985.
3. W. H. Mow, "Maximum likelihood sequence estimation from the lattice viewpoint," in Proc. IEEE ICCS/ISITA, Singapore, Nov. 1992, vol. 1, pp. 127-131.
4. W. H. Mow, "Maximum likelihood sequence estimation from the lattice viewpoint," IEEE Trans. Inf. Theory, vol. 40, no. 5, pp. 1591-1600, Sep. 1994.
5. E. Viterbo and E. Biglieri, "A universal decoding algorithm for lattice codes," in Proc. 14-ème Colloq. GRETSI, Juan-les-Pins, France, Sep. 1993, pp. 611-614.
6. E.Viterbo and J. J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
7. C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programm., vol. 66, no. 2, pp. 181-199, 1994.
8. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002. (Pubitemid 35017061)
9. M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
10. B. Shim and I. Kang, "Sphere decoding with a probabilistic tree pruning," IEEE Trans. Signal Process., vol. 56, no. 10, pp. 4867-4878, Oct. 2008.
11. R. Gowaikar and B. Hassibi, "Statistical pruning for near-maximum likelihood decoding," IEEE Trans. Signal Process., vol. 55, no. 6, pp. 2661-2675, Jun. 2007. (Pubitemid 46851632)
12. W. Zhao and G. B. Giannakis, "Sphere decoding algorithms with improved radius search," IEEE Trans. Commun., vol. 53, no. 7, pp. 1104-1109, Jul. 2005. (Pubitemid 41179144)
13. W. Zhao and G. B. Giannakis, "Reduced complexity closest point decoding algorithms for random lattices," IEEE Trans. Wireless Commun., vol. 5, no. 1, pp. 101-111, Jan. 2006. (Pubitemid 43131875)
14. K. Su and I. J.Wassell, "A new ordering for efficient sphere decoding," in Proc. IEEE Int. Conf. Commun., Seoul, Korea, May 2005, vol. 3, pp. 1906-1910. (Pubitemid 41241159)
15. 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.
16. W. K. Ma, B. N. Vo, T. N. Davidson, and P. C. Ching, "Blind ML detection of orthogonal space-time block codes: Efficient high-performance implementations," IEEE Trans. Signal Process., vol. 54, no. 2, pp. 738-751, Feb. 2006. (Pubitemid 43141917)
17. A. Burg, M. Borgmann, M. Wenk, M. Zellweger, W. Fichtner, and H. Bölcskei, "VLSI implementation of MIMO detection using the sphere decoding algorithm," IEEE J. Solid-State Circuits, vol. 40, no. 7, pp. 1566-1577, Jul. 2005.
18. E. Agrell and T. Eriksson, "Optimization of lattices for quantization," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1814-1828, Sep. 1998. (Pubitemid 128738553)
19. B. M. Hochwald, C. B. Peel, and A. L. Swindlehurst, "A vector-perturbation technique for near-capacity multiantenna multiuser communication- Part II: Perturbation," IEEE Trans. Commun., vol. 53, no. 3, pp. 537-544, Mar. 2005. (Pubitemid 40564694)
20. L. Brunel and J. J. Boutros, "Lattice decoding for joint detection in direct-sequence CDMA systems," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 1030-1037, Apr. 2003.
21. C. Windpassinger, L. Lampe, R. F. H. Fischer, and T. Hehn, "A performance study of MIMO detectors," IEEE Trans. Wireless Commun., vol. 5, no. 8, pp. 2004-2008, Aug. 2006. (Pubitemid 44376185)
22. J. H. Conway and N. J. A. Sloane, "On the Voronoi regions of certain lattices," SIAM J. Alg. Discrete Meth., vol. 5, no. 3, pp. 294-305, Sep. 1984.
23. A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, no. 4, pp. 515-534, 1982.
24. W. H. Mow, "Universal lattice decoding: Principle and recent advances," Wireless Commun. Mobile Comput., vol. 3, no. 5, pp. 553-569, 2003. (Pubitemid 40183706)