Sphere decoding algorithm for multiuser detection in a distributed antenna system


Abstract: In this paper, the impact of initial search radius on the complexity and performance of a sphere decoding algorithm is investigated for different user positions within a distributed antenna system. In a distributed antenna system, users can take up random positions within the cell clusters. The channel matrix can therefore take up infinitely different forms. In the presented work, a distributed antenna system with three different user positions in the cooperating cells is considered by employing different channel matrices. The effect on the complexity and performance of the sphere decoder due to the choice of the initial sphere radius is investigated for these user positions. It is shown that the signal lattice volume changes considerably for different user positions within the cells. A dynamic radius allocation algorithm is proposed in which the behavior is exploited by dynamically adjusting the initial sphere radius based on the knowledge of the channel path gain matrix. The simulation results show that the proposed algorithm results in a considerable reduction in the complexity of the sphere decoder in a distributed antenna system. Additionally, the performance of the sphere decoder in different coupling scenarios within the distributed antenna system has been investigated for a different number of candidates. It is shown that the performance of cell edge users can be considerably enhanced with high channel diversity, which otherwise could severely deteriorate the overall system performance.

Keywords: Sphere decoding, distributed antenna system, sphere radius, multiuser detection,

Full Text: PDF