![]() Vu, Thang Xuan ![]() ![]() ![]() in IEEE Transactions on Wireless Communications (2021), 20(6), 3710-3722 We investigate the performance of multi-user multiple-antenna downlink systems in which a base station (BS) serves multiple users via a shared wireless medium. In order to fully exploit the spatial ... [more ▼] We investigate the performance of multi-user multiple-antenna downlink systems in which a base station (BS) serves multiple users via a shared wireless medium. In order to fully exploit the spatial diversity while minimizing the passive energy consumed by radio frequency (RF) components, the BS is equipped with M RF chains and N antennas, where M < N. Upon receiving pilot sequences to obtain the channel state information (CSI), the BS determines the best subset of M antennas for serving the users. We propose a joint antenna selection and precoding design (JASPD) algorithm to maximize the system sum rate subject to a transmit power constraint and quality of service (QoS) requirements. The JASPD overcomes the non-convexity of the formulated problem via a doubly iterative algorithm, in which an inner loop successively optimizes the precoding vectors, followed by an outer loop that tries all valid antenna subsets. Although approaching the (near) global optimality, the JASPD suffers from a combinatorial complexity, which may limit its application in real-time network operations. To overcome this limitation, we propose a learning-based antenna selection and precoding design algorithm (L-ASPA), which employs a deep neural network (DNN) to establish underlaying relations between the key system parameters and the selected antennas. The proposed L-ASPD is robust against the number of users and their locations, BS's transmit power, as well as the small-scale channel fading. With a well-trained learning model, it is shown that the L-ASPD significantly outperforms baseline schemes based on the block diagonalization and a learning-assisted solution for broadcasting systems and achieves higher effective sum rate than that of the JASPA under limited processing time. In addition, we observed that the proposed L-ASPD can reduce the computation complexity by 95% while retaining more than 95% of the optimal performance. [less ▲] Detailed reference viewed: 130 (31 UL)![]() ; Trinh, van Chien ![]() in IEEE Wireless Communications Letters (2020) Taking into account imperfect channel state information, this letter formulates and solves a joint active/passive beamforming optimization problem in multiple-input single-output systems with the support ... [more ▼] Taking into account imperfect channel state information, this letter formulates and solves a joint active/passive beamforming optimization problem in multiple-input single-output systems with the support of an intelligent reflecting surface. In particular, we introduce an optimization problem to minimize the total transmit power subject to maintaining the users' signal-to-interference-plus-noise-ratio coverage probability above a predefined target. Due to the presence of probabilistic constraints, the proposed optimization problem is non-convex. To circumvent this issue, we first recast the proposed problem in a convex form by adopting the Bernstein-type inequality, and we then introduce a converging alternating optimization approach to iteratively find the active/passive beamforming vectors. In particular, the transformed robust optimization problem can be effectively solved by using standard interior-point methods. Numerical results demonstrate the effectiveness of jointly optimizing the active/passive beamforming vectors. [less ▲] Detailed reference viewed: 90 (7 UL)![]() ; ; et al in IEEE Transactions on Vehicular Technology (2020) Cell-free (CF) massive multiple-input-multiple-output (MIMO) has emerged as an alternative deployment for conventional cellular massive MIMO networks. As revealed by its name, this topology considers no ... [more ▼] Cell-free (CF) massive multiple-input-multiple-output (MIMO) has emerged as an alternative deployment for conventional cellular massive MIMO networks. As revealed by its name, this topology considers no cells, while a large number of multi-antenna access points (APs) serves simultaneously a smaller number of users over the same time/frequency resources through time-division duplex (TDD) operation. Prior works relied on the strong assumption (quite idealized) that the APs are uniformly distributed, and actually, this randomness was considered during the simulation and not in the analysis. However, in practice, ongoing and future networks become denser and increasingly irregular. Having this in mind, we consider that the AP locations are modeled by means of a Poisson point process (PPP) which is a more realistic model for the spatial randomness than a grid or uniform deployment. In particular, by virtue of stochastic geometry tools, we derive both the downlink coverage probability and achievable rate. Notably, this is the only work providing the coverage probability and shedding light on this aspect of CF massive MIMO systems. Focusing on the extraction of interesting insights, we consider small-cells (SCs) as a benchmark for comparison. Among the findings, CF massive MIMO systems achieve both higher coverage and rate with comparison to SCs due to the properties of favorable propagation, channel hardening, and interference suppression. Especially, we showed for both architectures that increasing the AP density results in a higher coverage which saturates after a certain value and increasing the number of users decreases the achievable rate but CF massive MIMO systems take advantage of the aforementioned properties, and thus, outperform SCs. In general, the performance gap between CF massive MIMO systems and SCs is enhanced by increasing the AP density. Another interesting observation concerns that a higher path-loss exponent decreases the rate while the users closer to the APs affect more the performance in terms of the rate. [less ▲] Detailed reference viewed: 93 (5 UL)![]() Vu, Thang Xuan ![]() in IEEE Signal Processing Letters (2015), 22(9), 1354-1358 Detailed reference viewed: 119 (10 UL)![]() Vu, Thang Xuan ![]() in IEEE Transactions on Wireless Communications (2015), 14(8), 4369-4378 Detailed reference viewed: 102 (3 UL)![]() Vu, Thang Xuan ![]() in 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC) (2013, June) Detailed reference viewed: 101 (4 UL)![]() Vu, Thang Xuan ![]() in EURASIP Journal on Advances in Signal Processing (2013), 170 Detailed reference viewed: 93 (2 UL)![]() Vu, Thang Xuan ![]() in Abstract book of 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC) (2013) Detailed reference viewed: 92 (3 UL) |
||