##  [Sphere Decoding](/index.php/sphere-decoding) 

  ##  [Sphere Decoding](https://information.quantumdictionary.io/sphere-decoding-0) 

  

 [![Information & Communication Dictionary](/sites/default/files/styles/large/public/2026-01/Information%20%26%20Communication.png.webp?itok=g4emS-T7)](/index.php/topic-specific-dictionaries/information-communication)



**Information & Communication Dictionary**

 







 

 

 

 



 

 

 

 

Definition

A tree‑search algorithm that reduces the complexity of exact maximum‑likelihood detection for discrete lattice problems (e.g., MIMO detection) by restricting candidate lattice points to those lying within a hypersphere of given radius around the received point and using pruning to avoid exploring nodes that cannot yield a better metric; when search radius and pruning are managed correctly the algo