A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
2006 Fortieth Asilomar Conference on Signals, Systems and Computers
1 We propose a soft sphere detection algorithm where search-bounds are determined based on the distribution of candidates found inside the sphere for different search levels. Detection accuracy of unbounded search is preserved while significant saving of memory space and reduction of latency is achieved. This probabilistic search algorithm provides significantly better frame-error rate performance than the soft K-best solution and has comparable performance and smaller computational complexitydoi:10.1109/acssc.2006.354940 fatcat:tndga25yb5c73ndfspofxvaggu