Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Reduced Complexity Sphere Decoding Boyu Li and Ender Ayanoglu
 

Summary: Reduced Complexity Sphere Decoding
Boyu Li and Ender Ayanoglu
Center for Pervasive Communications and Computing
Department of Electrical Engineering and Computer Science
The Henry Samueli School of Engineering
University of California - Irvine
Irvine, California 92697-2625
Email: boyul@uci.edu, ayanoglu@uci.edu
Abstract--In multiple-input multiple-output (MIMO) systems,
sphere decoding (SD) achieves performance equivalent to full
search maximum likelihood decoding with reduced complex-
ity. Several researchers reported techniques that reduced the
complexity of SD further. In this paper, a new technique is
introduced which reduces the computational complexity of SD
substantially, without sacrificing performance. The reduction is
accomplished by deconstructing the decoding metric to reduce
the number of computations to their minimum and exploiting
the structure of a lattice representation. Simulation results show
that this approach achieves substantial gains for the average
number of real multiplications and real additions needed to

  

Source: Ayanoglu, Ender - Department of Electrical and Computer Engineering, University of California, Irvine

 

Collections: Engineering