Soft-output sphere decoding algorithms for MIMO systems

Author(s):  
Hsiao-Lan Chiang ◽  
Ping-Heng Kuo ◽  
Pang-An Ting
Author(s):  
L. Ge ◽  
G. J. Chen ◽  
J. A. Chambers

The implementation of cooperative diversity with relays has advantages over point-to-point multiple-input multiple-output (MIMO) systems, in particular, overcoming correlated paths due to small inter-element spacing. A simple transmitter with one antenna may exploit cooperative diversity or space time coding gain through distributed relays. In this paper, similar distributed transmission is considered with the golden code, and the authors propose a new strategy for relay selection, called the maximum-mean selection policy, for distributed transmission with the full maximum-likelihood (ML) decoding and sphere decoding (SD) based on a wireless relay network. This strategy performs a channel strength tradeoff at every relay node to select the best two relays for transmission. It improves on the established one-sided selection strategy of maximum-minimum policy. Simulation results comparing the bit error rate (BER) based on different detectors and a scheme without relay selection, with the maximum-minimum and maximum-mean selection schemes confirm the performance advantage of relay selection. The proposed strategy yields the best performance of the three methods.


2019 ◽  
Vol 9 (21) ◽  
pp. 4624
Author(s):  
Uzokboy Ummatov ◽  
Kyungchun Lee

This paper proposes an adaptive threshold-aided K-best sphere decoding (AKSD) algorithm for large multiple-input multiple-output systems. In the proposed scheme, to reduce the average number of visited nodes compared to the conventional K-best sphere decoding (KSD), the threshold for retaining the nodes is adaptively determined at each layer of the tree. Specifically, we calculate the adaptive threshold based on the signal-to-noise ratio and index of the layer. The ratio between the first and second smallest accumulated path metrics at each layer is also exploited to determine the threshold value. In each layer, in addition to the K paths associated with the smallest path metrics, we also retain the paths whose path metrics are within the threshold from the Kth smallest path metric. The simulation results show that the proposed AKSD provides nearly the same bit error rate performance as the conventional KSD scheme while achieving a significant reduction in the average number of visited nodes, especially at high signal-to-noise ratios.


2005 ◽  
Vol 12 (1) ◽  
pp. 41-44 ◽  
Author(s):  
Zongkai Yang ◽  
Chao Liu ◽  
Jianhua He

Sign in / Sign up

Export Citation Format

Share Document