On the sphere-decoding algorithm I. Expected complexity

DOI10.1109/TSP.2005.850352zbMath1370.94141MaRDI QIDQ5356634

Haris Vikalo, Babak Hassibi

Publication date: 20 September 2017

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Decoding (94B35)

Related Items (7)

A non-commutative cryptosystem based on quaternion algebras ⋮ An improved LLL algorithm ⋮ An efficient algorithm for clustered integer least squares problems ⋮ Code design for multihop wireless relay networks ⋮ Low-complexity receivers for multiuser detection with an unknown number of active users ⋮ The Diagonal Reduction Algorithm Using Fast Givens ⋮ A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals

This page was built for publication: On the sphere-decoding algorithm I. Expected complexity