An exponential lower bound on the expected complexity of sphere decoding

This publication has 8 references indexed in Scilit:

• A new reduced-complexity sphere decoder for multiple antenna systems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Achieving near-capacity on a multiple-antenna channel
  IEEE Transactions on Communications, 2003
• Further results on the sphere decoder
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• High-rate codes that are linear in space and time
  IEEE Transactions on Information Theory, 2002
• Lattice code decoder for space-time codes
  IEEE Communications Letters, 2000
• A universal lattice code decoder for fading channels
  IEEE Transactions on Information Theory, 1999
• Computational complexity of optimum multiuser detection
  Algorithmica, 1989
• Integer and Combinatorial Optimization
  Published by Wiley ,1988