Sphere Decoding

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