Low Complexity Sphere Decoding for Spatial Multiplexing MIMO

TL;DR

This paper introduces a low complexity, near-optimal sphere decoding algorithm for MIMO systems that combines SD and ZF techniques, optimized for hardware implementation with a focus on large antenna arrays.

Contribution

A novel sphere decoding method that reduces complexity and maintains high performance for large MIMO systems by limiting iterations and prioritizing ill-conditioned matrices.

Findings

Achieves near-optimal decoding with reduced complexity

Suitable for hardware implementation in large MIMO systems

Effectively handles matrices with high condition numbers

Abstract

In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance constant time modified sphere decoding algorithm. This algorithm was designed especially for large number of transmit antennas, and allows efficient implementation in hardware. We do this by limiting the number of overall SD iterations. Moreover, we make sure that matrices with high condition number are more likely to undergo SD.