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 via a Reordered Lattice Representation
 

Summary: 1
Reduced Complexity Sphere Decoding
via a Reordered Lattice Representation
Luay Azzam, Student Member, IEEE, and Ender Ayanoglu, Fellow, IEEE
Center for Pervasive Communications and Computing
Department of Electrical Engineering and Computer Science
University of California, Irvine
Irvine, CA 92697-2625
Abstract
In this letter, we propose a reordering of the channel representation for Sphere Decoding (SD) where
the real and imaginary parts of each jointly detected symbol are decoded independently. Making use of
the proposed structure along with a scalar quantization technique, we reduce the decoding complexity
substantially. We show that this approach achieves 85% reduction in the overall complexity compared
to the conventional SD for a 22 system, and 92% reduction for the 44 and 66 cases at low SNR
values, and almost 50% at high SNR, thus relaxing the requirements for hardware implementation.
Index Terms
Maximum-likelihood detection, multiple-input multiple-output channels, sphere decoding.
I. INTRODUCTION
Consider a MIMO system with N transmit and M receive antennas. The received signal is
given by

  

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

 

Collections: Engineering