| 摘要 |
Method and apparatuses for decoding codewords over a MIMO channel are provided. According to one aspect of the disclosure, a cost function is computed for each constellation point of an Mth rank or spatial layer and N cand of those constellation points having minimum cost are preserved as candidate points, where N cand is a parameter specified to the decoding algorithm. In addition, a cost function may be computed for all possible transitions from the N cand candidate points of the Mth rank to ail possible constellations points of the (M-1)th spatial layer, and A^ of those transitions having minimum cost are preserved as candidate points. The process is repeated for all spatial layers, resulting in the identification of N cand candidate codewords and their associated cost functions. The algorithm is derived from the list sphere decoding method. |
