System and Method for Low Complexity Sphere Decoding for Spatial Multiplexing MIMO
AssigneeRuncom Technologies Ltd.
InventorsDoron Ezri, Vadim Neder, Zion Hadad
Life of this patent
Estimating the term…
Abstract
In this application, an algorithm for decoding multiple input-multiple output (MIMO) transmission for communication systems is provided; the algorithm 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, that allows efficient implementation in hardware—this is done by limiting the number of overall SD iterations; moreover, we make sure that matrices with high condition number are more likely to undergo SD.
Claims2
A low complexity sphere decoding method for SM MIMO communication systems, comprising:
- A. Computing the linear ZF decoder matrix H+ wherein:
- ŝ=H+y=(H*H)−1 H*y for each of K SM inputs;
- B. Calculating a condition number for all of the K matrices or providing this data;
- C. Ordering the K matrices according to the calculated condition number of step B in descending order (largest first), thus the more problematic matrices in terms of decoding are first in order;
- D. Selecting each time a matrix from the ordered matrices beginning from the first, this may also be done in parallel, so that more than one matrix would be processed at the same time;
- E. Performing SD for the selected matrix as long as clock budget remains, else proceed to step G;
- F. If there are matrices left, of the K matrices, returning to step D for the next matrix;
- G. Providing K matrices:
- matrices that have not undergone SD, will be provided with their existing ZF solution, while matrices that have undergone SD will be provided with the SD solution.
Dependencies are inferred from the claim text.