Search

Massive multiple-input-multiple-output (M-MIMO) features a capability for spatial multiplexing of large number of users. This number becomes even more extreme in extra-large (XL-MIMO), a variant of M-MIMO where the antenna array is of very large size. Yet, the problem of signal processing complexity in M-MIMO is further exacerbated by the XL size of the array. The basic processing problem boils down to a sparse system of linear equations that can be addressed by the randomized Kaczmarz (RK) algorithm. This algorithm has recently been applied to devise low-complexity M-MIMO receivers; however, it is limited by the fact that certain configurations of the linear equations may significantly deteriorate the performance of the RK algorithm. In this paper, we embrace the interest in accelerated RK algorithms and introduce three new RK-based low-complexity receiver designs. In our experiments, our methods are not only able to overcome the previous scheme, but they are more robust against inter-user interference (IUI) and sparse channel matrices arising in the XL-MIMO regime. In addition, we show that the RK-based schemes use a mechanism similar to that used by successive interference cancellation (SIC) receivers to approximate the regularized zero-forcing (RZF) scheme., Comment: 12 pages, 6 figures, submitted to IEEE TVT

In this paper, the zero-forcing and regularized zero-forcing schemes operating in crowded extra-large MIMO (XL-MIMO) scenarios with a fixed number of subarrays have been emulated using the randomized Kaczmarz algorithm (rKA). For that, non-stationary properties have been deployed through the concept of visibility regions when considering two different power normalization methods of non-stationary channels. We address the randomness design of rKA based on the exploitation of spatial non-stationary properties. Numerical results show that, in general, the proposed rKA-based combiner applicable to XL-MIMO systems can considerably decrease computational complexity of the signal detector by paying with small performance losses., Comment: 5 pages, 4 figures, conference

To exploit the benefits of massive multiple-input multiple-output (M-MIMO) technology in scenarios where base stations (BSs) need to be cheap and equipped with simple hardware, the computational complexity of classical signal processing schemes for spatial multiplexing of users shall be reduced. This calls for suboptimal designs that perform well the combining/precoding steps and simultaneously achieve low computational complexities. An approach based on the iterative Kaczmarz algorithm (KA) has been recently investigated, assuring well execution without the knowledge of second order moments of the wireless channels in the BS, and with easiness, since no tuning parameters, besides the number of iterations, are required. In fact, the randomized version of KA (rKA) has been used in this context due to global convergence properties. Herein, modifications are proposed on this first rKA-based attempt, aiming to improve its performance-complexity trade-off solution for M-MIMO systems. We observe that long-term channel effects degrade the rate of convergence of the rKA-based schemes. This issue is then tackled herein by means of a hybrid rKA initialization proposal that lands within the region of convexity of the algorithm and assures fairness to the communication system. The effectiveness of our proposal is illustrated through numerical results which bring more realistic system conditions in terms of channel estimation and spatial correlation than those used so far. We also characterize the computational complexity of the proposed rKA scheme, deriving upper bounds for the number of iterations. A case study focused on a dense urban application scenario is used to gather new insights on the feasibility of the proposed scheme to cope with the inserted BS constraints., Comment: 36 pages, 5 figures, full paper

To provide the vast exploitation of the large number of antennas on massive multiple-input-multiple-output (M-MIMO), it is crucial to know as accurately as possible the channel state information in the base station. This knowledge is canonically acquired through channel estimation procedures conducted after a pilot signaling phase, which adopts the widely accepted time-division duplex scheme. However, the quality of channel estimation is very impacted either by pilot contamination or by spatial correlation of the channels. There are several models that strive to match the spatial correlation in M-MIMO channels, the exponential correlation model being one of these. To observe how the channel estimation and pilot contamination are affected by this correlated fading model, this work proposes to investigate an M-MIMO scenario applying the standard minimum mean square error channel estimation approach over uniform linear arrays and uniform planar arrays (ULAs and UPAs, respectively) of antennas. Moreover, the elements of the array are considered to contribute unequally on the communication, owing to large-scale fading variations over the array. Thus, it was perceived that the spatially correlated channels generated by this combined model offer a reduction of pilot contamination, consequently the estimation quality is improved. The UPA acquired better results regarding pilot contamination since it has been demonstrated that this type of array generates stronger levels of spatial correlation than the ULA. In contrast to the favorable results in channel estimation, the channel hardening effect was impaired by the spatially correlated channels, where the UPA imposes the worst performance of this effect for the discussed model., Comment: 26 pages, 9 figures