부산대학교 도서관

Sphere decoding is a very powerful algorithm in searching the optimal solution of multiple input and multiple output systems. However, it cannot perform in parallel directly. Sphere decoding can be depicted as searching in a tree. In this paper, we propose a parallel mode of the sphere decoding algorithm. We proposed that the searching tree can be partitioned into several sub-trees. The searching is divided into two stages. In the first stage, the partial Euclidean distances of sub-tree root nodes are calculated. In the second stage, several sub-trees perform their searching simultaneously. The Euclidean distance of the early finished sub-tree helps to reduce the calculation in the later finished sub-trees search. Simulation results sho