Signal detection is a serious challenge for uplink massive multiple-input multiple-output (MIMO) systems. The traditional linear minimum-mean-squared error (MMSE) achieves good detection performance for such systems, but involves matrix inversion, which is computationally expensive due to a large number of antennas. Thus, several iterative methods such as Gauss–Seidel (GS) have been studied to avoid the direct matrix inversion required in the MMSE. In this paper, we improve the GS iteration in order to enhance the detection performance of massive MIMO systems with a large loading factor. By exploiting the property of massive MIMO systems, we introduce a novel initialization strategy to render a quick start for the proposed algorithm. While maintaining the same accuracy of the designed detector, the computing load is further reduced by initialization approximation. In addition, an effective preconditioner is proposed that efficiently transforms the original GS iteration into a new one that has the same solution, but a faster convergence rate than that of the original GS. Numerical results show that the proposed algorithm is superior in terms of complexity and performance than state-of-the-art detectors. Moreover, it exhibits identical error performance to that of the linear MMSE with one-order-less complexity.
Direct position determination (DPD) approaches of non-circular (NC) signals for distributed antenna arrays are outstanding in location accuracy and available degrees of freedom. Nevertheless, the existing grid-based DPD approaches involve unnecessary computational costs because of NC phases. Besides, the cost function utilized in DPD could cause performance deterioration as ignoring the non-homogeneity error of the received data. To this end, we propose a DPD approach implemented by polynomial rooting and optimal weighting. Aiming to reduce computational costs, we first construct a computationally efficient cost function. Meanwhile, to mitigate the adverse impact induced by non-homogeneity errors in an effective manner, we assign an optimal weight to each antenna array. Simulation results demonstrate that the proposed approach achieves a good compromise between performance and computational complexity.
15 July 2021 in Mathematical Problems in Engineering
Direct position determination (DPD) for augmented coprime arrays is investigated in this paper. Augmented coprime array expands degree of freedom and array aperture and improves positioning accuracy. Because of poor stability and noise sensitivity of the subspace data fusion (SDF) method, we propose two weighted subspace data fusion (W-SDF) algorithms for direct position determination. Simulation results show that two W-SDF algorithms have a prominent promotion in positioning accuracy than SDF, Capon, and propagator method (PM) algorithm for augmented coprime arrays. SDF based on optimal weighting (OW-SDF) is slightly better than SDF based on SNR weighting (SW-SDF) in positioning accuracy. The performance for DPD of the W-SDF method with augmented coprime arrays is better than that of the W-SDF method with uniform arrays.
Direct position determination (DPD) of noncircular (NC) sources with multiple nested arrays (NA) is investigated in this paper. Noncircular sources are used to expand the dimension of the received signal matrix, so the number of identifiable information sources and the accuracy of direct position determination are improved. Furthermore, nested array increases spatial degree of freedom. In this paper, the high‐dimensional search problem of noncircular sources is investigated. Therefore, we propose algorithm dimension reduction subspace data fusion (RD‐SDF) to reduce complexity and increase positioning accuracy. Simulation results show that the proposed RD‐SDF algorithm for multiple nested arrays with noncircular sources has improved positioning accuracy with higher spatial degree of freedom than SDF, Capon, and two‐step algorithms with uniform linear array and circular sources (CS).
The improved rooting subspace data fusion method (IR-SDF) of non-Gaussian (NG) sources for sensors with augmented coprime arrays (SACA) is introduced into the direct position determination (DPD) problem in this paper. The higher-order cumulants used in parameter estimation for non-Gaussian sources are the fourth-order cumulants which help to expand array properties. The proposed improved rooting subspace data fusion method which combined weighted method and rooting method solves the problems of poor stability and high complexity of spectral peak search for SDF method. Sensor augmented coprime arrays enhance the degree of freedom, and the spatial smoothing method is employed to handle the augmented coprime array for direct position determination. The emulation results demonstrate that the performance of improved rooting subspace data fusion method is superior to rooting SDF (R-SDF), SDF, Capon, maximum likelihood (ML) and two-step method. The proposed method uses cost function of rooting subspace data fusion method to obtain spectral peak searching estimation position so its complexity is lower than SDF, weighted SDF method and Capon method.