5 citations · 5 across the 1 of their papers we have counts for
2 papers
cs.IT2019★ 5 cited
Lossless Size Reduction for Integer Least Squares with Application to Sphere Decoding
Mohammad Neinavaie, Mostafa Derakhtian, Sergiy A. Vorobyov
Minimum achievable complexity (MAC) for a maximum likelihood (ML) performance-achieving detection algorithm is derived. Using the derived MAC, we prove that the conventional sphere…
eess.SP2019
A Complexity Efficient DMT-Optimal Tree Pruning Based Sphere Decoding
Mohammad Neinavaie, Mostafa Derakhtian, Negar Daryanavardan +1
We present a diversity multiplexing tradeoff (DMT) optimal tree pruning sphere decoding algorithm which visits merely a single branch of the search tree of the sphere decoding (SD)…