A Matlab/Octave implementation of the eight Sphere Decoding algorithms outlined by A. Ghasemmehdi and E. Agrell, 2011 ("Faster Recursions in Sphere Decoding," IEEE Trans. Inf. Theory, vol. 57, no. 6, pp. 3530-3536).
All algorithms take a lower triangular generator matrix G or G^-1 and a vector y as input. They return u such that u * G is the closest lattice point to y.
For instance:
>> u = decode5([-1.2 2.8], eye(2))
u =
-1 3
You can use all files I am the author of. The only condition is attributing them to me (Marco Falke). Other files (another author is specified) may be restricted in usage.