Patent Document ID: 20120170689
Application ID: 13084917
Patent Flag: 0

Claim One:
1. A decoding method of a geometry based efficient decoder for underdetermined MIMO systems, comprising the steps of: (1) arbitrarily selecting a point as an initial point x int =[x 1 int x 2 int. .. x N int ] T ∈ N , setting X=x int , and storing the initial point in p and deleting the initial point from X; (2) determining whether X V is empty and p is 0, if yes, all points in X in and their corresponding distances are solutions, otherwise, implementing the step (3); (3) arbitrarily selecting a value of k representing an unsearched dimension of the initial point and calculating: x k , up = p k - Δ y ( p ) w k + C , x k , low = p k - Δ y ( p ) w k - C. where Δy(p)=Σ i=1 N w i p i −y, and deriving all legitimate points between x k,up , x k,low according to the calculated results of x k,up , x k,low ; (4) determining for each derived point whether it exists in x v , if no, adding the point into X, X V and X in , and setting the kth element of the corresponding vector D V to “1”, otherwise, only setting the kth element of the corresponding vector D V to “1”; (5) calculating the corresponding distance from previously derived value of Δy(); (6) deriving candidate points └x k,up +d┘,┌x k,low −d┐ according to x k,up ,x k,low , wherein d is the smallest distance between the points; (7) determining whether the candidate points exist in X V , if no, adding the points into X and X V , and setting the kth element of the corresponding vector D V to “1”, otherwise, only setting the kth element of the corresponding vector D V to “1”; (8) determining whether all the elements of the corresponding vector D V are “1”, if yes, implementing the step (9), otherwise, determining whether p satisfies a current search criteria, if no, implementing the step (9), otherwise, going back to the step (2); and (9) arbitrarily selecting one of the candidate points for substitution of a current point p and deleting the selected point from X.