Bounds on the performance of sphere decoding of linear block codes
Mostafa El‐Khamy, Haris Vikalo, Babak Hassibi · 2005
A sphere decoder searches for the closest lattice point within a certain search radius. The search radius provides a tradeoff between performance and complexity. We derive tight upper bounds on the performance of sphere decoding of linear block codes. The performance of soft-decision sphere decoding on AWGN channels as well as that of hard-decision sphere decoding on binary symmetric channels is analyzed.