Efficient Iterative Sphere Detectors Based On the Schnorr-Euchner Enumeration

Two efficient iterative sphere detectors based on the Schnorr-Euchner enumeration are the topic of this manuscript. The first one is capable of finding 'good' candidate lattice points soon enough and its efficiency/performance are controlled by an adaptive radius update strategy. The second is a Max-Log detector. Because of the Schnorr-Euchner nature of the search, estimation of the initial sphere radius is not required and unlike the iterative sphere detector of Vikalo et al. [1], the search step does not require any division or square root operations. In the new sphere detectors, the search step must account for the input a priories and explicit sorting of the branches stemming from the tree nodes must be done.