1. Introduction
Large multiple-input multiple-output (MIMO) systems have received enormous attention from researchers in the field of wireless communication for their high spectral and power efficiency [
1]. However, the promised benefits of large MIMO are expensive in terms of computational complexity at the receiver compared to the conventional MIMO systems [
1,
2]. In conventional MIMO systems, to simplify the exhaustive search of the optimal maximum likelihood (ML) receiver, a sphere decoder (SD) can be employed, which only searches for the ML solution inside a sphere to reduce computational complexity. Furthermore, low-complexity sub-optimal algorithms including parallel interference cancellation (PIC) [
3] and successive interference cancellation (SIC) [
4] can also be considered. However, to approach the channel capacity, it is required to employ a near-optimal receiver such as the SD. Even though the SD performs close to the ML receiver, its complexity grows exponentially with the number of transmit antennas, which results in excessively large complexity in large MIMO systems [
2,
5].
Among variants of SD, K-best SD (KSD) begins its search from the first layer, and
K candidate paths that are associated with the smallest path metrics at each layer are preserved for the subsequent layers until the iteration process reaches the leaf layer [
6,
7]. Then, the one with the smallest path metric is chosen as the hard decision output of the KSD algorithm. The KSD requires fixed detection complexity [
7] and can be implemented in a parallel fashion, which makes it suitable for hardware implementation [
8]. However, to approach the bit-error rate (BER) performance of the original SD, the KSD needs to retain a large number of nodes in each layer, as presented in [
9], which leads to a large computational complexity.
This paper presents an adaptive threshold-aided K-best SD (AKSD) algorithm. Unlike the traditional KSD, where the number of survival nodes is constant, in AKSD, the number of retained nodes dynamically changes in each layer of the tree. Specifically, to reduce the complexity while maintaining the near-optimal BER performance, we keep the nodes whose path metric is smaller than the Kth node’s metric plus threshold . At each layer, the threshold is updated dynamically based on the signal-to-noise ratio (SNR) and the index of the tree-search layer. Furthermore, the ratio between the first and second smallest path metrics is also employed to determine the threshold. Intuitively, if the first minimum path metric is far less than the second, the path associated with the first is very likely to be an ML solution. Therefore, there is no need to keep a large number of nodes. In contrast, if this ratio is small, which decreases the probability that the path with the minimum path metric is the ML solution, then we need to keep a large number of nodes. The main contributions of this study can be summarized as follows:
We propose the AKSD algorithm, in which the adaptive threshold controls the number of visited nodes in each layer of the tree. In this algorithm, the threshold for retaining the most promising nodes at each layer is adaptively determined based on the ratio between the first and second minimum path metrics at each layer, the SNR, and the layer index.
To evaluate the performance of the proposed AKSD algorithm, we have performed simulations for large MIMO systems. The simulation results show that, compared to the conventional KSD algorithm, the AKSD algorithm requires up to 71% less computational complexity.
The rest of this paper is organized as follows.
Section 2 describes the MIMO system model and the conventional SD algorithm.
Section 3 explains the traditional KSD and proposed AKSD algorithm. The simulation results and discussions with respect to the BER performance and computational complexity are presented in
Section 4. Finally, the conclusions of the study are described in
Section 5.
Notations: A boldface capital letter, , is used to denote a matrix, and a boldface lowercase letter, , represents a column vector. The nth row and mth column entry of is denoted by , whereas the nth entry of vector is denoted by . The transpose operation is denoted by , and the norm of a vector is denoted by . Furthermore, and indicate the real and imaginary parts of a matrix or vector, respectively.
4. Simulation Results
The proposed AKSD and the conventional KSD were tested with various values of
K for comparison. The improved K-best SD (IKSD) algorithm [
7] was also considered for comparison. In [
7], three threshold rules were proposed, namely, the adaptive, normalized, and fixed thresholds. In this study, for comparison, we tested the adaptive threshold-based IKSD and the fixed threshold-based IKSD. In addition, the schemes in [
9,
14] were tested for comparison. The radius adaptive
K-best decoder (RAKSD) in [
9] employs tree decomposition and adaptive pruning to reduce the complexity, whereas the dynamic threshold-aided
K-best sphere decoder (DKSD) in [
14] exploits a dynamic threshold to adjust
K. For the threshold in the proposed AKSD algorithm, the constant
was set to 1. For the initial radius, we set
, as in [
8]. The complexity was measured by the average number of visited nodes. Furthermore, the mean values in the simulation results were obtained by averaging over
independent channel realizations. For simulations, we considered two large MIMO configurations:
and
.
In
Figure 1, the BER comparison results for a MIMO system with
,
, and 16-QAM are shown. We can observe that the AKSD scheme with relatively small
K achieves comparable or better BER performance with respect to the conventional KSD scheme with large
K. Specifically, the performance of the proposed AKSD with
is nearly the same as that of the conventional KSD with
at high SNRs, where the AKSD achieves an SNR gain of 0.7 dB over the conventional KSD with
at BER
.
Figure 1 also shows that the AKSD scheme achieves better BER performance compared to the adaptive threshold-based IKSD and fixed threshold-based IKSD. The SNR gains of the AKSD at BER
over the adaptive threshold-based IKSD with
and the fixed threshold-based IKSD with
are approximately
dB and
dB, respectively. Moreover, the AKSD scheme outperforms both the RAKSD and DKSD by approximately
dB and
dB, respectively, at a BER of
.
Figure 2 compares the BER performance for
,
, and 16-QAM. Similar to
Figure 1, it demonstrates that the AKSD scheme achieves nearly the same BER performance with that of the conventional KSD scheme with larger
K at high SNRs. It is also worth noting that the proposed AKSD outperforms the fixed threshold-based IKSD with
, achieving an approximate SNR gain of
dB for BER
. In
Figure 2, it is also observed that the AKSD scheme substantially outperforms the DKSD and RAKSD schemes.
In
Figure 3, the complexity comparison for a MIMO system with
and 16-QAM is shown.
Figure 3 shows that the RAKSD scheme requires lower complexity than the other compared schemes; however, its BER performance is significantly worse than those of the other schemes, as shown in
Figure 1. A similar observation can also be made for the DKSD scheme.
Figure 3 also shows that the proposed scheme requires lower complexity than the other schemes providing comparable BER performances. Specifically, the complexity-reduction ratio of the AKSD at SNR = 20 dB, compared with the conventional KSD with
is approximately
, whereas they achieve comparable BER performance, as shown in
Figure 1. Furthermore, the AKSD scheme provides
and
complexity savings compared with the fixed threshold-based IKSD and the adaptive threshold-based IKSD, respectively. We note that the AKSD scheme outperforms the fixed threshold-based IKSD and adaptive threshold-based IKSD in terms of BER performance. In
Figure 3, it is also observed that the complexity reduction of the proposed scheme becomes larger as the SNR increases. This is because, in the high-SNR region,
in (
8) is large, and the ratio of the second path metric to the first tends to be small, which results in a small number of retained nodes at each layer in the proposed AKSD scheme.
Figure 4 illustrates the comparison of the average number of visited nodes for a MIMO system with
, and 16-QAM. Similar to
Figure 3, it is seen that the proposed AKSD scheme provides significant complexity reduction compared to the other existing schemes that provide comparable performances, i.e., the conventional KSD and IKSD. The complexity reduction ratio of the AKSD at SNR
dB with respect to the conventional KSD with
is approximately
. Furthermore, at SNR
dB, the AKSD scheme achieves approximately
and
complexity reduction compared to the adaptive threshold-based IKSD and fixed threshold-based IKSD with
, respectively.