No Arabic abstract
Large-scale antenna (LSA) has gained a lot of attention recently since it can significantly improve the performance of wireless systems. Similar to multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) or MIMO-OFDM, LSA can be also combined with OFDM to deal with frequency selectivity in wireless channels. However, such combination suffers from substantially increased complexity proportional to the number of antennas in LSA systems. For the conventional implementation of LSA-OFDM, the number of inverse fast Fourier transforms (IFFTs) increases with the antenna number since each antenna requires an IFFT for OFDM modulation. Furthermore, zero-forcing (ZF) precoding is required in LSA systems to support more users, and the required matrix inversion leads to a huge computational burden. In this paper, we propose a low-complexity recursive convolutional precoding to address the issues above. The traditional ZF precoding can be implemented through the recursive convolutional precoding in the time domain so that only one IFFT is required for each user and the matrix inversion can be also avoided. Simulation results show that the proposed approach can achieve the same performance as that of ZF but with much lower complexity.
Large-scale antenna (LSA) or massive multiple-input multiple-output (MIMO) has gained a lot of attention due to its potential to significantly improve system throughput. As a natural evolution from traditional MIMO-orthogonal frequency division multiplexing (OFDM), LSA has been combined with OFDM to deal with frequency selectivity of wireless channels in most existing works. As an alternative approach, single-carrier (SC) has also been proposed for LSA systems due to its low implementation complexity. In this article, a comprehensive comparison between LSA-OFDM and LSA-SC is presented, which is of interest to the waveform design for the next generation wireless systems.
This paper proposes a new large-scale mask-compliant spectral precoder (LS-MSP) for orthogonal frequency division multiplexing systems. In this paper, we first consider a previously proposed mask-compliant spectral precoding scheme that utilizes a generic convex optimization solver which suffers from high computational complexity, notably in large-scale systems. To mitigate the complexity of computing the LS-MSP, we propose a divide-and-conquer approach that breaks the original problem into smaller rank 1 quadratic-constraint problems and each small problem yields closed-form solution. Based on these solutions, we develop three specialized first-order low-complexity algorithms, based on 1) projection on convex sets and 2) the alternating direction method of multipliers. We also develop an algorithm that capitalizes on the closed-form solutions for the rank 1 quadratic constraints, which is referred to as 3) semi-analytical spectral precoding. Numerical results show that the proposed LS-MSP techniques outperform previously proposed techniques in terms of the computational burden while complying with the spectrum mask. The results also indicate that 3) typically needs 3 iterations to achieve similar results as 1) and 2) at the expense of a slightly increased computational complexity.
We propose a regularized zero-forcing transmit precoding (RZF-TPC) aided and distance-based adaptive coding and modulation (ACM) scheme to support aeronautical communication applications, by exploiting the high spectral efficiency of large-scale antenna arrays and link adaption. Our RZF-TPC aided and distance-based ACM scheme switches its mode according to the distance between the communicating aircraft. We derive the closed-form asymptotic signal-to-interference-plus-noise ratio (SINR) expression of the RZF-TPC for the aeronautical channel, which is Rician, relying on a non-centered channel matrix that is dominated by the deterministic line-of-sight component. The effects of both realistic channel estimation errors and of the co-channel interference are considered in the derivation of this approximate closed-form SINR formula. Furthermore, we derive the analytical expression of the optimal regularization parameter that minimizes the mean square detection error. The achievable throughput expression based on our asymptotic approximate SINR formula is then utilized as the design metric for the proposed RZF-TPC aided and distance-based ACM scheme. Monte-Carlo simulation results are presented for validating our theoretical analysis as well as for investigating the impact of the key system parameters. The simulation results closely match the theoretical results. In the specific example that two communicating aircraft fly at a typical cruising speed of 920 km/h, heading in opposite direction over the distance up to 740 km taking a period of about 24 minutes, the RZF-TPC aided and distance-based ACM is capable of transmitting a total of 77 Gigabyte of data with the aid of 64 transmit antennas and 4 receive antennas, which is significantly higher than that of our previous eigen-beamforming transmit precoding aided and distance-based ACM benchmark.
Linear precoding techniques can achieve near- optimal capacity due to the special channel property in down- link massive MIMO systems, but involve high complexity since complicated matrix inversion of large size is required. In this paper, we propose a low-complexity linear precoding scheme based on the Gauss-Seidel (GS) method. The proposed scheme can achieve the capacity-approaching performance of the classical linear precoding schemes in an iterative way without complicated matrix inversion, which can reduce the overall complexity by one order of magnitude. The performance guarantee of the proposed GS-based precoding is analyzed from the following three aspects. At first, we prove that GS-based precoding satisfies the transmit power constraint. Then, we prove that GS-based precoding enjoys a faster convergence rate than the recently proposed Neumann-based precoding. At last, the convergence rate achieved by GS-based precoding is quantified, which reveals that GS-based precoding converges faster with the increasing number of BS antennas. To further accelerate the convergence rate and reduce the complexity, we propose a zone-based initial solution to GS-based precoding, which is much closer to the final solution than the traditional initial solution. Simulation results demonstrate that the proposed scheme outperforms Neumann- based precoding, and achieves the exact capacity-approaching performance of the classical linear precoding schemes with only a small number of iterations both in Rayleigh fading channels and spatially correlated channels.
Large-scale distributed-antenna system (L-DAS) with very large number of distributed antennas, possibly up to a few hundred antennas, is considered. A few major issues of the L-DAS, such as high latency, energy consumption, computational complexity, and large feedback (signaling) overhead, are identified. The potential capability of the L-DAS is illuminated in terms of an energy efficiency (EE) throughout the paper. We firstly and generally model the power consumption of an L-DAS, and formulate an EE maximization problem. To tackle two crucial issues, namely the huge computational complexity and large amount of feedback (signaling) information, we propose a channel-gain-based antenna selection (AS) method and an interference-based user clustering (UC) method. The original problem is then split into multiple subproblems by a cluster, and each clusters precoding and power control are managed in parallel for high EE. Simulation results reveal that i) using all antennas for zero-forcing multiuser multiple-input multiple-output (MU-MIMO) is energy inefficient if there is nonnegligible overhead power consumption on MU-MIMO processing, and ii) increasing the number of antennas does not necessarily result in a high EE. Furthermore, the results validate and underpin the EE merit of the proposed L-DAS complied with the AS, UC, precoding, and power control by comparing with non-clustering L-DAS and colocated antenna systems.