SYSTEM AND METHOD FOR ACCELERATING A MAXIMUM LIKELIHOOD DECODER IN A MIMO SYSTEM

摘要

A decoder to search a tree graph to decode a received signal y. The tree graph may have a plurality of levels, each level having a plurality of nodes and each node representing a different value of an element of a candidate transmit signal s corresponding to the received signal y. The decoder may include a first module to execute a branch prediction at each branch node of the tree graph to select one of a plurality of candidate nodes stemming from the branch node that has a smallest distance increment. The decoder may include a second module, running in parallel to the first module, to evaluate the branch prediction made by the first module at each branch node by computing an accumulated distance of the selected node. If the accumulated distance of the selected node is greater than or equal to a search radius, the first module may override the branch prediction and select an alternative candidate node.

主权项

1. A method of decoding in a MIMO system by searching a tree graph for a transmit signal s most likely to correspond to a received signal y, the tree graph having a plurality of levels, each level having a plurality of nodes and each node representing a different value of an element of a candidate transmit signal s, the method comprising:
executing a branch prediction at each branch node of the tree graph to select one of a plurality of candidate nodes stemming from the branch node that has a smallest distance increment between the received signal y and the transmit signal s variables represented by the candidate node; in a separate module running in parallel to a module executing the branch prediction, evaluating the branch prediction at each branch node by computing an accumulated distance of the selected node adding the distance increments computed along a search path from a root node to the selected node; and if the accumulated distance of the selected node is greater than or equal to a search radius, overriding the branch prediction and selecting an alternative one of the plurality of candidate nodes that has a next smallest distance increment.