On the sphere-decoding algorithm I. Expected complexity

By Babak Hassibi, Haris Vikalo. IEEE Transactions on Signal Processing, 2005

1,259 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs (2015, background): “cantly reduced complexity [58], [59], [441]–[443].”
Model Predictive Control for Power Converters and Drives: Advances and Trends (2017, methodology): “It should be noted that SDA is a branch-and-bound algorithm.”
Fixing the Complexity of the Sphere Decoder for MIMO Detection (2008, background): “Thus, the FSD can achieve a quasi-ML performance with a fixed complexity, which is considerably smaller than that of the MLD.”
Perfect Space–Time Block Codes (2006, methodology): “The linearity property of the LD-STBC enables the use of maximumlikelihood (ML) sphere decoding [32], [ 20 ], which exploits the full performance of the code compared to other suboptimal decoders [8].”
On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements (2008, methodology): “Follows from the previous discussion combining (8), (22), (23), (24), (25), and (26).”
A unified framework for tree search decoding: rediscovering the sequential decoder (2005, background): “From [5], for each , one can find an matrix that has the same distribution as the lower part of , and an unitary”