Reduced complexity sphere decoding using forcing rules

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn 1, Issue , 2004, Pages 1218-1221

  Cui, Tao ^a   Tellambura, Chintha ^a   Chen, Wen ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODE DIVISION MULTIPLE ACCESS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; INFORMATION THEORY; INTEGER PROGRAMMING; RECEIVING ANTENNAS; VECTOR QUANTIZATION;

COST FUNCTION; FORCING RULES; LATTICE CODES; TRANSFER MATRIX;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 21644474526     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. J. H. Conway and N. J. Sloane, Sphere packing, Lattices and Groups, 3rd ed. New York: Springer-Verlag, 1998.
2. P. van Emde Boas, "Another NP-complete problem and the complexity of computing short vectors in a lattice," 1981, Tech. Report 81-04, Mathematische Instituut, University of Amsterdam.
3. D. Micciancio, "The hardness of the closest vector problem with preprocessing," IEEE Trans. Inform. Theory, vol. 46, pp. 1584-1589, July 2000.
4. S. Arora, L. Babai, J. Stern, and E. Z. Sweedyk, "The hardness of approximate optima in lattices,codes,and systems of linear equations," J. Comput. System Sci., vol. 54, pp. 317-331, 1997.
5. I. Dinur, G. Kindler, and S. Safra, "Approximating CVP to within almost-polynomial factors is np-hard," in Proceedings of 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1998.
6. M. Ajtai, "The shortest vector problem in L2 is NP-hard for randomized reductions," in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 10-19.
7. D. Micciancio, "The shortest vector in a lattice is hard to approximate to within some constant," SIAM J. Comput., vol. 30, no. 6, pp. 2008-2035, 2001.
8. U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, inlcuding a complexity analysis," Math. Computation, vol. 44, pp. 463-471, Apr. 1985.
9. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Communications Letters, vol. 4, no. 5, pp. 161 - 163, May 2000.
10. H. Vikalo and B. Hassibi, "On maximum-likelihood sequence detection for multiple antenna systems over dispersive channels," EURASIP Journal on Applied Signal Processing, vol. Special Issue on Space-Time Coding, pp. 525-531, May 2002.
11. E. Viterbo and E. Biglieri, "A universal lattice decoder," Juan-les-Pins, France, Sept. 1993, pp. 611-614.
12. L. Brunel and J. Boutros, "Euclidean space lattice decoding for joint detection in CDMA systems," in Proceedings of IEEE Information Theory and Communications Workshop, June 1999, p. 129.
13. G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky, "Detection algorithm and initial laboratory results using the V-BLAST space-time communication architecture," Electronics Letters, vol. 35, no. 1, pp. 14-15, Jan. 1999.
14. P. Hansen, "Methods of nonlinear 0-1 programming," Annals of Discrete Mathematics, vol. 5, pp. 53-70, 1979.
15. P. M. Pardolos and G. P. Rodgers, "Parallel branch and bound algorithms for unconstrained zero-one programming," in Impacts of Recent Computer Advances on Operations Research, R. Sharda, Ed. New York: North-Holland, 1989, pp. 131-143.
16. P. M. Pardalos and G. P. Rodgers, "Computational aspects of a branch and bound algorithm for quadratic zero-one programming," Computing, vol. 45, pp. 131-144, 1990.
17. P. M. Pardalos, "Construction of test problems in quadratic bivalent programming," ACM Transactions on Mathematical Software, vol. 17, pp. 74-87, 1991.
18. B. Hassibi and H. Vikalo, "On the sphere decoding algorithm: Part I, the expected complexity," IEEE Transactions on Signal Processing, submitted.