Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and...Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and experimental reesult proves that distribution search is superior to binary search.展开更多
In this article a bridge between the expected complexity and performance of sphere decoding （SD） is built. The expected complexity of SD for infinite lattices is then investigated, which naturally is the upper-bound...In this article a bridge between the expected complexity and performance of sphere decoding （SD） is built. The expected complexity of SD for infinite lattices is then investigated, which naturally is the upper-bound of those for all the finite lattices if given by the same channel matrix and signal noise ratio （SNR）. Such expected complexity is an important characterization of SD in multi-antenna systems, because no matter what modulation scheme is used in practice （generally it has finite constellation size） this upper-bound holds. Above bridge also leads to a new method of determining the radius for SD. The numerical results show both the real value and upper-bound of average searched number of candidates in SD for 16-QAM modulated system using the proposed sphere radius determining method. Most important of all new understandings of expected complexity of SD are given based on above mentioned theoretic analysis and numerical results.展开更多
文摘Provided an algorithm for the distribution search and proves the time complexity of the algorithm. This algorithm uses a mathematical formula to search n elements in the sequence of n elements in O(n)expected time,and experimental reesult proves that distribution search is superior to binary search.
基金supported by the National Natural Science Foundation of China (60572120, 60602058)the Hi-Tech Research and Development Program of China (2006AA01Z257)the National Basic Research Program of China (2007CB310602)
文摘In this article a bridge between the expected complexity and performance of sphere decoding （SD） is built. The expected complexity of SD for infinite lattices is then investigated, which naturally is the upper-bound of those for all the finite lattices if given by the same channel matrix and signal noise ratio （SNR）. Such expected complexity is an important characterization of SD in multi-antenna systems, because no matter what modulation scheme is used in practice （generally it has finite constellation size） this upper-bound holds. Above bridge also leads to a new method of determining the radius for SD. The numerical results show both the real value and upper-bound of average searched number of candidates in SD for 16-QAM modulated system using the proposed sphere radius determining method. Most important of all new understandings of expected complexity of SD are given based on above mentioned theoretic analysis and numerical results.
