A unified framework for tree search decoding: Rediscovering the sequential decoder

IEEE Transactions on Information Theory

Volumn 52, Issue 3, 2006, Pages 933-953

  Murugan, Arul D ^b   El Gamal, Hesham ^a,b   Damen, Mohamed Oussama ^a,c   Caire, Giuseppe ^a,d  

^a IEEE

^b Ohio State University   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d University of Southern California ^*  (United States)

Author keywords

Closest lattice point search (CLPS); Fano decoder; Lattice codes; Sequential decoding; Sphere decoding; Tree search

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBLEM SOLVING; TREES (MATHEMATICS);

CLOSEST LATTICE POINT SEARCH (CLPS); FANO DECODER; LATTICE CODES; SEQUENTIAL DECODING; SPHERE DECODING; TREE SEARCH;

CHANNEL CODING;

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

References (55)

1. M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice codes decoder for space-time codes," IEEE Communi. Lett., vol. 4, no. 5, pp. 161-163, May 2000.
2. L. Babai, "On Lovász lattice reduction and the nearest lattice point problem," Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
3. G. Foschini, "Layered space-time architecture for wireless communication in a fading environment using multi-element antennas," Bell Labs Tech. J., vol. 1, no. 2, pp. 41-59, 1996.
4. 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-2401, Oct. 2003.
5. B. Hassibi and H. Vikalo, "On the sphere-decoding algorithm I. Expected complexity," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2818, Aug. 2005.
6. 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.
7. E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1639-1642, Jul. 1999.
8. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Math. Comput., vol. 44, pp. 463-471, Apr. 1985.
9. 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.
10. J. Jalden and B. Quersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484. Apr. 2005.
11. J. Foschini, G. Golden, R. Valenzuela, and P. Wolniansky, "Simplified processing for high spectral efficiency wireless communication employing multi-element arrays," IEEE J. Sel. Areas Commun., vol. 17, no. 11, pp. 1841-1852, Nov. 1999.
12. 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.
13. A. R. Hammons Jr. and H. El Gamal, "On the theory of space-time codes for PSK modulation," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 524-542, Mar. 2000.
14. H.-F. Lu and P. Kumar, "A unified construction of space-time codes with optimal rate-diversity tradeoff," IEEE Trans. Inf. Theory, vol. 51, no. 5, pp. 1709-1730, May 2005.
15. Y. Liu, M. Fitz, and O. Takeshita, "A rank criterion for QAM space-time codes," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3062-3079, Dec. 2002.
16. A. Duel-Hallen and C. Heegard, "Delayed decision-feedback sequence estimation," IEEE Trans. Commun., vol. 37, no. 5, pp. 428-436, May 1989.
17. J. B. Anderson and S. Mohan, "Sequential coding algorithms: A survey and cost analysis," IEEE Trans. Commun., vol. COM-32, no. 2, pp. 169-176, Feb. 1984.
18. G. D. Forney Jr., "Coset codes. I. Introduction and geometrical classification," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1123-1151, Sep. 1988.
19. _, "Coset codes. II. Binary lattices and related codes," IEEE Trans. Inf. Theory, vol. 34, no. 5. pp. 1152-1187, Sep. 1988.
20. H. El Gamal, G. Caire, and M. O. Damen, "Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 968-985, Jun. 2004.
21. U. Erez and R. Zamir, "Achieving 1/2log(1 + SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004.
22. H. El Gamal and M. O. Damen, "Universal space-time coding," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1097-1119, May 2003.
23. M. O. Damen, H. El Gamal, and N. C. Beaulieu, "Linear threaded algebraic space-time constellations," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2372-2388, Oct. 2003.
24. J.-C. Belfiore, G. Rekaya, and E. Viterbo, "The Golden code: A 2 × 2 full-rate space-time code with nonvanishing determinants," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1432-1436, Apr. 2005.
25. B. A. Sethuraman, B. S. Rajan, and V. Shashidhar, "Full-diversity, high-rate space-time block codes from division algebras," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2596-2616, Oct. 2003.
26. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, 3rd ed. New York: Springer-Verlag, 1999.
27. M. O. Damen, H. El Gamal, and G. Caire, "MMSE-GDFE lattice decoding for under-determined linear channels," in Proc. Conf. Information Science and Systems, Princeton, NJ, Mar. 2004.
28. U. Erez, S. Litsyn, and R. Zamir, "Lattices which are good for (almost) everything," in Proc. IEEE Information Theory Workshop, 2003, Paris, France, Apr. 2003, pp. 271-274.
29. J. M. Cioffi, G. P. Dudevoir, M. V. Eyuboglu, and G. D. Forney Jr., "MMSE decision-feedback equalizers and coding. I. Equalization results," IEEE Trans. Commun., vol. 43, no. 10, pp. 2582-2594, Oct. 1995.
30. H. Cohen, A Course in Computational Algebraic Number Theory. New York: Springer-Verlag, 1995.
31. A. K. Lenstra, A. W. Lenstra Jr., and L. Lovász, "On factoring polynomials with rational coefficients," Math. Annalen, vol. 261, pp. 515-534, 1982.
32. J. Benesty, Y. A. Huang, and J. Chen, "A fast recursive algorithm for optimum sequential signal detection in a BLAST system," IEEE Trans. Signal Process., vol. 51, no. 7, pp. 1722-1731, Jul. 2003.
33. B. Hassibi, "An efficient square-root algorithm for BLAST," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, vol. II, Istanbul, Turkey, Jun. 2000, pp. 737-740.
34. E. L. Lawler and D. E. Wood, "Branch and bound methods: A survey," Oper. Res., pp. 14:699-14:719, 1966.
35. J. Luo, K. R. Pattipati, P. Willett, and G. M. Levchuk, "Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound," IEEE Trans. Commun., vol. 52, no. 4, pp. 632-642, Apr. 2004.
36. R. Gowaikar and B. Hassibi, "Efficient statistical pruning for maximum likelihood decoding," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, vol. V, Hong Kong, China, Apr. 2003, pp. 49-52.
37. J. M. Wozencraft and B. Reiffen, Sequential Decoding. New York: MIT Press/Wiley. 1961.
38. M. Kokkonen and K. Kalliojarvi, "Soft-decision decoding of binary linear codes using the t-algorithm," in Proc. IEEE 8th Int. Symp. Personal, Indoor and Mobile Radio Communications (PIMRC), Finland, Sep. 1997, pp. 1181-1185.
39. B. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Trans. Commun., vol. 51, no. 3, pp. 389-399, Mar. 2003.
40. S. Baro, J. Hagenauer, and M. Witzke, "Iterative detection of MIMO transmission using a list-sequential (LISS) detector," in Proc. IEEE Int. Conf. Communication, Seattle, WA, May 2003, pp. 2653-2657.
41. K. S. Zigangirov, "Some sequential decoding procedures," Probl. Pered. Inform., pp. 19-35, Nov. 1966.
42. F. Jelinek, "A fast sequential decoding algorithm using a stack," IBM J. Res. Devel., vol. 13, pp. 675-685, Nov. 1969.
43. W. Xu, Y. Wang, Z. Zhou, and J. Wang, "A computationally efficient exact ML sphere decoder," in Proc. IEEE Global Telecommunications Conf., 2004., Dallas, TX, Nov. 2004, pp. 2594-2598.
44. 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.
45. _, "Reduced complexity closest point algorithms for random lattices," in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
46. J. Geist, "Search properties of some sequential decoding algorithms," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 519-526, Jul. 1973.
47. R. M. Fano, "A heuristic discussion of probabilistic decoding," IEEE Trans. Inf. Theory, vol. IT-9, no. 2, pp. 64-74, Apr. 1963.
48. H. Yao and G. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," in Proc. IEEE Global Conf. Communications, Taipei, Taiwan, Nov. 2002.
49. C. Windpassinger and R. Fischer, "Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction," in Proc. IEEE Information Theory Workshop, Paris, France, Mar. 2003.
50. P. Dayal and M. K. Varanasi, "A fast generalized sphere decoder for optimum decoding of under-determined MIMO systems," in Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
51. M. O. Damen, K. Abed-Meraim, and J.-C. Belfiore, "Generalized sphere decoder for asymmetrical space-time communication architecture," Electron. Lett., vol. 36, p. 166, Jan. 2000.
52. G. Caire and G. Colavolpe, "On low complexity space-time coding for quasistatic channels," IEEE Trans. Inf. Theory, vol. 49, no. 6, pp. 1400-1416, June 2003.
53. M. Tuchler, R. Koetter, and A. C. Singer, "Turbo equalization: Principles and new results," IEEE Trans. Commun., vol. 50, no. 5, pp. 754-767, May 2002.
54. R. Johannesson and K. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
55. R. van Nee, A. van Zelst, and G. Awater, "Maximum likelihood decoding in a space division multiplexing system," in Proc. IEEE Vehicular Technology Conf, Boston, MA, May 2000, pp. 6-10.