28 search results - page 3 / 6 » An Efficient Tree Search for Reduced Complexity Sphere Decod... |
GLOBECOM
2008
IEEE
13 years 8 months ago
2008
IEEE
—In this paper, we present a near ML-achieving sphere search technique that reduces the number of search operations significantly over existing sphere decoding (SD) algorithms. ...
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
Ternary content addressable (TCAM) is favorable for high-speed search due to its parallel architecture and ability for searching arbitrary-length keys. However, the usage of TCAM ...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, we propose a memory-constrained tree search (MCTS) algorithm for the detection in multiple-input multiple-output (MIMO) systems. The MCTS algorithm offers a wide...
ISCAS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...