| 摘要 |
<p>Circuits are provided for detecting symbols transmitted from multiple transmitting antennas (1, 2, 3, 4) to multiple receiving antennas using QR decomposition and a modified version of the K-best algorithm. At each step of the K-best algorithm, which step corresponds to a transmitting antenna, each candidate (212, 214,..., 234) is assigned to a bin of a plurality of bins (A, B, C, D), each bin containing a range of partial Euclidean distances. The candidate is assigned to a bin according to its partial Euclidean distance from a received signal vector. A selector then selects, amongst candidates, a predetermined number K of candidates (212, 226, 230) for a successive transmitting antenna from the bins having the smaller ranges (A). At the final step, an identifier block detects the symbol with the lowest partial Euclidean distance (244).</p> |
