Patent Document ID: 20110069785
Application ID: 12866480
Patent Flag: 0

Claim One:
1. 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.