8 search results - page 1 / 2 » Two Methods for Decreasing the Computational Complexity of t... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
GLOBECOM
2008
IEEE
13 years 5 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
13 years 11 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...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—Multi-input multi-output (MIMO) receivers have been designed and their communication performance analyzed under the assumption of additive Gaussian noise. Wireless transceivers,...
TIT
2011
12 years 11 months ago
2011
—Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Mu...