arXiv subjects

Yijie Mao

Publications and source records attributed to Yijie Mao.

At least 55 records · Page 3Linked to original sources

arXiv2024

Max-Min Fairness for Uplink Rate-Splitting Multiple Access with Finite Blocklength

In this letter, we investigate the performance of Max Minimum Fairness (MMF) for uplink Rate-Splitting Multiple Access (RSMA) in short-packet communications. Specifically, considering a Single-Input Single-Output (SISO) Multiple Access Channel (MAC), we optimize the transmit power allocation between the splitting user messages to maximize the minimum rate among users with Finite Blocklength (FBL) constraints. To tackle this problem, we propose a Successive Convex Approximation (SCA)-based approach. Additionally, we introduce a low-complexity scheme to design the decoding order at the receiver. Numerical results show that RSMA outperforms conventional transmission schemes such as Non-orthogonal Multiple Access (NOMA) in terms of MMF.

cs.IT↗

arXiv2024

Multiple Access Techniques for Intelligent and Multi-Functional 6G: Tutorial, Survey, and Outlook

Multiple access (MA) is a crucial part of any wireless system and refers to techniques that make use of the resource dimensions to serve multiple users/devices/machines/services, ideally in the most efficient way. Given the needs of multi-functional wireless networks for integrated communications, sensing, localization, computing, coupled with the surge of machine learning / artificial intelligence (AI) in wireless networks, MA techniques are expected to experience a paradigm shift in 6G and beyond. In this paper, we provide a tutorial, survey and outlook of past, emerging and future MA techniques and pay a particular attention to how wireless network intelligence and multi-functionality will lead to a re-thinking of those techniques. The paper starts with an overview of orthogonal, physical layer multicasting, space domain, power domain, ratesplitting, code domain MAs, and other domains, and highlight the importance of researching universal multiple access to shrink instead of grow the knowledge tree of MA schemes by providing a unified understanding of MA schemes across all resource dimensions. It then jumps into rethinking MA schemes in the era of wireless network intelligence, covering AI for MA such as AI-empowered resource allocation, optimization, channel estimation, receiver designs, user behavior predictions, and MA for AI such as federated learning/edge intelligence and over the air computation. We then discuss MA for network multi-functionality and the interplay between MA and integrated sensing, localization, and communications. We finish with studying MA for emerging intelligent applications before presenting a roadmap toward 6G standardization. We also point out numerous directions that are promising for future research.

cs.IT↗

arXiv2023

Optimal Beamforming Structure and Efficient Optimization Algorithms for Generalized Multi-Group Multicast Beamforming Optimization

In this work, we focus on solving non-smooth non-convex maximization problems in multi-group multicast transmission. Leveraging Karush-Kuhn-Tucker (KKT) optimality conditions and successive incumbent transcending (SIT) duality, we thoroughly analyze the optimal beamforming structure for a set of optimization problems characterized by a general utility-based objective function. By exploiting the identified optimal structure, we further unveil inherent low-dimensional beamforming structures within the problems, which are asymptotically optimal in various regimes of transmit signal-to-noise ratios (SNRs) or the number of transmit antennas. Building upon the discovered optimal and low-dimensional beamforming structures, we then propose highly efficient and toolbox-free optimization algorithms to solve a specific multi-group multicast optimization problem based on the weighted sum rate (WSR) utility function. The proposed algorithms first use the cyclic maximization (CM) framework to decompose the problem into multiple subproblems, each has an optimal or low-dimensional closed-form beamforming solution structure. Then, we propose the projected adaptive gradient descent (PAGD) algorithm to compute the optimal Lagrangian dual variables for each subproblem. Numerical results show that the proposed algorithms maintain comparable or improved WSR performance compared to baseline algorithms, while dramatically reducing the computational complexity. Notably, the proposed ultra-low-complexity algorithms based on low-dimensional beamforming structures achieve near optimal WSR performance with extremely low computational complexity. This complexity remains independent of the number of transmit antennas, making them promising and practical for extremely large multiple-input multiple-output (XL-MIMO) applications in 6G.

cs.IT↗

arXiv2023

A Low-Complexity Beamforming Design for Beyond-Diagonal RIS aided Multi-User Networks

Beyond-diagonal reconfigurable intelligent surface (BD-RIS) has been proposed recently as a novel and generalized RIS architecture that offers enhanced wave manipulation flexibility and large coverage expansion. However, the beyond-diagonal mathematical model in BD-RIS inevitably introduces additional optimization challenges in beamforming design. In this letter, we derive a closed-form solution for the BD-RIS passive beamforming matrix that maximizes the sum of the effective channel gains among users. We further propose a computationally efficient two-stage beamforming framework to jointly design the active beamforming at the base station and passive beamforming at the BD-RIS to enhance the sum-rate for a BD-RIS aided multi-user multi-antenna network.Numerical results show that our proposed algorithm achieves a higher sum-rate while requiring less computation time compared to state-of-the-art algorithms. The proposed algorithm paves the way for practical beamforming design in BD-RIS aided wireless networks.

cs.IT↗

arXiv2023

Optimal Beamforming Structure for Rate Splitting Multiple Access

In this paper, we aim at maximizing the weighted sum-rate (WSR) of rate splitting multiple access (RSMA) in multi-user multi-antenna transmission networks through the joint optimization of rate allocation and beamforming. Unlike conventional methods like weighted minimum mean square error (WMMSE) and standard fractional programming (FP), which tackle the non-convex WSR problem iteratively using disciplined convex subproblems and optimization toolboxes, our work pioneers a novel toolbox-free approach. For the first time, we identify the optimal beamforming structure and common rate allocation for WSR maximization in RSMA by leveraging FP and Lagrangian duality. Then we propose an algorithm based on FP and fixed point iteration to optimize the beamforming and common rate allocation without the need for optimization toolboxes. Our numerical results demonstrate that the proposed algorithm attains the same performance as standard FP and classical WMMSE methods while significantly reducing computational time.

cs.IT↗

arXiv2023

A Practical Max-Min Fair Resource Allocation Algorithm for Rate-Splitting Multiple Access

This letter introduces a novel resource allocation algorithm for achieving max-min fairness (MMF) in a rate-splitting multiple access (RSMA) empowered multi-antenna broadcast channel. Specifically, we derive the closed-form solution for the optimal allocation of the common rate among users and the power between the common and private streams for a given practical low-complexity beamforming direction design. Numerical results show that the proposed algorithm achieves 90% of the MMF rate on average obtained by the conventional iterative optimization algorithm while only takes an average of 0.1 millisecond computational time, which is three orders of magnitude lower than the conventional algorithm. It is therefore a practical resource allocation algorithm for RSMA.

cs.IT↗

arXiv2023

A Bi-level Globalization Strategy for Non-convex Consensus ADMM and ALADIN

In this paper, we formally analyze global convergence in the realm of distributed consensus optimization. Current solutions have explored such analysis, particularly focusing on consensus alternating direction method of multipliers (CADMM), including convex and non-convex cases. While such efforts on non-convexity offer elegant theory guaranteeing global convergence, they entail strong assumptions and complicated proof techniques that are increasingly pose challenges when adopted to real-world applications. To resolve such tension, we propose a novel bi-level globalization strategy that not only guarantees global convergence but also provides succinct proofs, all while requiring mild assumptions. We begin by adopting such a strategy to perform global convergence analysis for the non-convex cases in C-ADMM. Then, we employ our proposed strategy in consensus augmented Lagrangian based alternating direction inexact Newton method (C-ALADIN), a more recent and generalization of C-ADMM. Surprisingly, our analysis shows that C-ALADIN globally converges to local optimizer, complementary to the prior work on C-ALADIN, which had primarily focused on analyzing local convergence for non-convex cases.

math.OC↗

arXiv2023

Weighted Sum-Rate Maximization for Rate-Splitting Multiple Access Based Multi-antenna Broadcast Channel with Confidential Messages

In this paper, we take all users' secrecy rate requirements into consideration and propose a rate-splitting multiple access (RSMA)-based secure beamforming approach to maximize the weighted sum-rate (WSR), where multi-user interference (MUI) is partially decoded and partially treated as noise. User messages are split and encoded into common and private streams. Each user not only decodes the common stream and the intended private stream, but also eavesdrops other users' private streams. To solve the introduced non-convex security constraints in the formulated problem, a successive convex approximation (SCA)-based approach is first proposed to maximize the instantaneous WSR under perfect channel state information at the transmitter (CSIT). When only imperfect CSIT is available, to ensure robustness, a weighted ergodic sum-rate maximization problem is formulated. Then, a joint weighted minimum mean square error and SCA-based alternating optimization algorithm is proposed to optimize the precoder. Numerical results demonstrate that, compared with baseline schemes, the performance advantage of the proposed RSMA-based secure beamforming design has been shown in terms of WSR and robustness to channel errors while ensuring all users' security requirements thanks to its powerful interference management capability.

cs.IT↗

arXiv2023

Transmitter Side Beyond-Diagonal Reconfigurable Intelligent Surface for Massive MIMO Networks

This letter focuses on a transmitter or base station (BS) side beyond-diagonal reflecting intelligent surface (BD-RIS) deployment strategy to enhance the spectral efficiency (SE) of a time-division-duplex massive multiple-input multiple-output (MaMIMO) network. In this strategy, the active antenna array utilizes a BD-RIS at the BS to serve multiple users in the downlink. Based on the knowledge of statistical channel state information (CSI), the BD-RIS coefficients matrix is optimized by employing a novel manifold algorithm, and the power control coefficients are then optimized with the objective of maximizing the minimum SE. Through numerical results we illustrate the SE performance of the proposed transmission framework and compare it with that of a conventional MaMIMO transmission for different network settings.

cs.IT↗

arXiv2023

Vertical Federated Learning over Cloud-RAN: Convergence Analysis and System Optimization

Vertical federated learning (FL) is a collaborative machine learning framework that enables devices to learn a global model from the feature-partition datasets without sharing local raw data. However, as the number of the local intermediate outputs is proportional to the training samples, it is critical to develop communication-efficient techniques for wireless vertical FL to support high-dimensional model aggregation with full device participation. In this paper, we propose a novel cloud radio access network (Cloud-RAN) based vertical FL system to enable fast and accurate model aggregation by leveraging over-the-air computation (AirComp) and alleviating communication straggler issue with cooperative model aggregation among geographically distributed edge servers. However, the model aggregation error caused by AirComp and quantization errors caused by the limited fronthaul capacity degrade the learning performance for vertical FL. To address these issues, we characterize the convergence behavior of the vertical FL algorithm considering both uplink and downlink transmissions. To improve the learning performance, we establish a system optimization framework by joint transceiver and fronthaul quantization design, for which successive convex approximation and alternate convex search based system optimization algorithms are developed. We conduct extensive simulations to demonstrate the effectiveness of the proposed system architecture and optimization framework for vertical FL.

cs.IT↗

arXiv2023

Green Federated Learning Over Cloud-RAN with Limited Fronthual Capacity and Quantized Neural Networks

In this paper, we propose an energy-efficient federated learning (FL) framework for the energy-constrained devices over cloud radio access network (Cloud-RAN), where each device adopts quantized neural networks (QNNs) to train a local FL model and transmits the quantized model parameter to the remote radio heads (RRHs). Each RRH receives the signals from devices over the wireless link and forwards the signals to the server via the fronthaul link. We rigorously develop an energy consumption model for the local training at devices through the use of QNNs and communication models over Cloud-RAN. Based on the proposed energy consumption model, we formulate an energy minimization problem that optimizes the fronthaul rate allocation, user transmit power allocation, and QNN precision levels while satisfying the limited fronthaul capacity constraint and ensuring the convergence of the proposed FL model to a target accuracy. To solve this problem, we analyze the convergence rate and propose efficient algorithms based on the alternative optimization technique. Simulation results show that the proposed FL framework can significantly reduce energy consumption compared to other conventional approaches. We draw the conclusion that the proposed framework holds great potential for achieving a sustainable and environmentally-friendly FL in Cloud-RAN.

eess.SP↗

arXiv2023

Reconfigurable Intelligent Surfaces Empowered Green Wireless Networks with User Admission Control

Reconfigurable intelligent surface (RIS) has emerged as a cost-effective and energy-efficient technique for 6G. By adjusting the phase shifts of passive reflecting elements, RIS is capable of suppressing the interference and combining the desired signals constructively at receivers, thereby significantly enhancing the performance of communication system. In this paper, we consider a green multi-user multi-antenna cellular network, where multiple RISs are deployed to provide energy-efficient communication service to end users. We jointly optimize the phase shifts of RISs, beamforming of the base stations, and the active RIS set with the aim of minimizing the power consumption of the base station (BS) and RISs subject to the quality of service (QoS) constraints of users and the transmit power constraint of the BS. However, the problem is mixed combinatorial and non-convex, and there is a potential infeasibility issue when the QoS constraints cannot be guaranteed by all users. To deal with the infeasibility issue, we further investigate a user admission control problem to jointly optimize the transmit beamforming, RIS phase shifts, and the admitted user set. Specifically, we first decompose the original non-convex problem into several rank-one constrained optimization subproblems via matrix lifting. A difference-of-convex (DC) algorithm is then developed to solve each decomposed subproblem. The proposed AO framework efficiently minimizes the power consumption of wireless networks as well as user admission control when the QoS constraints cannot be guaranteed by all users. To further address the complexity-sensitive issue for practical implementation, we propose an alternative low-complexity beamforming and RISs phase shifts design algorithm based on zero-forcing (ZF) to enable the green cellular networks.

cs.IT↗

arXiv2023

Sum-Rate Maximization for Active RIS-Aided Downlink RSMA System

In this paper, the problem of sum-rate maximization for an active reconfigurable intelligent surface (RIS) assisted downlink rate-splitting multiple access (RSMA) transmission system is studied. In the considered model, the active RIS is deployed to overcome severe power attenuation, which is caused by the cumulative product of RIS incidence path loss and the reflection path loss. Since the active RIS can adjust both the phase and the amplitude of the incident signal simultaneously, the RIS control scheme requires delicate design to improve RSMA communication performance. To address this issue, a sum-rate maximization problem is formulated to jointly optimize the beamforming vectors, rate allocation vector, and RIS precoding matrix. To solve this non-convex sum-rate maximization problem, an iterative algorithm based on fractional programming (FP) and quadratic constraint quadratic programming (QCQP) is proposed. In particular, the proposed algorithm firstly decomposes the original problem into two subproblems, namely, 1) beamforming and rate allocation optimization and 2) active RIS precoding optimization. The corresponding variables of the two subproblems are optimized through sequential convex approximation (SCA) and block coordinate descent (BCD), respectively. Numerical results show that the proposed active RIS-aided RSMA system could increase the sum-rate by up to 45% over the conventional passive RIS-aided RSMA system with the same energy consumption.

cs.IT↗

arXiv2023

STAR-RIS Assisted Over-the-Air Vertical Federated Learning in Multi-Cell Wireless Networks

Vertical federated learning (FL) is a critical enabler for distributed artificial intelligence services in the emerging 6G era, as it allows for secure and efficient collaboration of machine learning among a wide range of Internet of Things devices. However, current studies of wireless FL typically consider a single task in a single-cell wireless network, ignoring the impact of inter-cell interference on learning performance. In this paper, we investigate a simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) assisted over-the-air computation based vertical FL system in multi-cell networks, in which a STAR-RIS is deployed at the cell edge to facilitate the completion of different FL tasks in different cells. We establish the convergence of the proposed system through theoretical analysis and introduce the Pareto boundary of the optimality gaps to characterize the trade-off among cells. Based on the analysis, we then jointly design the transmit and receive beamforming as well as the STAR-RIS transmission and reflection coefficient matrices to minimize the sum of the gaps of all cells. To solve the non-convex resource allocation problem, we introduce a successive convex approximation based algorithm. Numerical experiments demonstrate that compared with conventional approaches, the proposed STAR-RIS assisted vertical FL model and the cooperative resource allocation algorithm achieve much lower mean-squared error for both uplink and downlink transmission in multi-cell wireless networks, resulting in improved learning performance for vertical FL.

cs.IT↗

arXiv2023

Reconfigurable Intelligent Surface Empowered Rate-Splitting Multiple Access for Simultaneous Wireless Information and Power Transfer

Rate-splitting multiple access (RSMA) and reconfigurable intelligent surface (RIS) have been both recognized as promising techniques for 6G. The benefits of combining the two techniques to enhance the spectral and energy efficiency have been recently exploited in communication-only networks. Inspired by the recent advances on RIS empowered RSMA, in this work we investigate the use of RIS empowered RSMA for simultaneous wireless information and power transfer (SWIPT) with one transmitter concurrently sending information to multiple information receivers (IRs) and transferring energy to multiple energy receivers (ERs). Specifically, we jointly optimize the transmit beamformers and the RIS reflection coefficients to maximize the weighted sum-rate (WSR) of IRs under the harvested energy constraint of ERs and the transmit power constraint. An alternating optimization and successive convex approximation (SCA)-based optimization framework is then proposed to solve the problem. Numerical results show that by marrying the benefits of RSMA and RIS, the proposed RIS empowered RSMA achieves a better tradeoff between the WSR of IRs and energy harvested at ERs. Therefore, we conclude that RIS empowered RSMA is a promising strategy for SWIPT.

eess.SP↗

arXiv2023

A Primer on Rate-Splitting Multiple Access: Tutorial, Myths, and Frequently Asked Questions

Rate-Splitting Multiple Access (RSMA) has emerged as a powerful multiple access, interference management, and multi-user strategy for next generation communication systems. In this tutorial, we depart from the orthogonal multiple access (OMA) versus non-orthogonal multiple access (NOMA) discussion held in 5G, and the conventional multi-user linear precoding approach used in space-division multiple access (SDMA), multi-user and massive MIMO in 4G and 5G, and show how multi-user communications and multiple access design for 6G and beyond should be intimately related to the fundamental problem of interference management. We start from foundational principles of interference management and rate-splitting, and progressively delineate RSMA frameworks for downlink, uplink, and multi-cell networks. We show that, in contrast to past generations of multiple access techniques (OMA, NOMA, SDMA), RSMA offers numerous benefits. We then discuss how those benefits translate into numerous opportunities for RSMA in over forty different applications and scenarios of 6G. We finally address common myths and answer frequently asked questions, opening the discussions to interesting future research avenues. Supported by the numerous benefits and applications, the tutorial concludes on the underpinning role played by RSMA in next generation networks, which should inspire future research, development, and standardization of RSMA-aided communication for 6G.

cs.IT↗

arXiv2022

Max-Min Fairness of Rate-Splitting Multiple Access with Finite Blocklength Communications

Rate-Splitting Multiple Access (RSMA) has emerged as a flexible and powerful framework for wireless networks. In this paper, we investigate the user fairness of downlink multi-antenna RSMA in short-packet communications with/without cooperative (user-relaying) transmission. We design optimal time allocation and linear precoders that maximize the Max-Min Fairness (MMF) rate with Finite Blocklength (FBL) constraints. The relation between the MMF rate and blocklength of RSMA, as well as the impact of cooperative transmission are investigated for a wide range of network loads. Numerical results demonstrate that RSMA can achieve the same MMF rate as Non-Orthogonal Multiple Access (NOMA) and Space Division Multiple Access (SDMA) with smaller blocklengths (and therefore lower latency), especially in cooperative transmission deployment. Hence, we conclude that RSMA is a promising multiple access for guaranteeing user fairness in low-latency communications.

cs.IT↗

arXiv2022

Mitigating Intra-Cell Pilot Contamination in Massive MIMO: A Rate Splitting Approach

Massive multiple-input multiple-output (MaMIMO) has become an integral part of the fifth-generation (5G) standard, and is envisioned to be further developed in beyond 5G (B5G) networks. With a massive number of antennas at the base station (BS), MaMIMO is best equipped to cater prominent use cases of B5G networks such as enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC) and massive machine-type communications (mMTC) or combinations thereof. However, one of the critical challenges to this pursuit is the sporadic access behaviour of a massive number of devices in practical networks that inevitably leads to the conspicuous pilot contamination problem. Conventional linearly precoded physical layer strategies employed for downlink transmission in time division duplex (TDD) MaMIMO would incur a noticeable spectral efficiency (SE) loss in the presence of this pilot contamination. In this paper, we aim to integrate a robust multiple access and interference management strategy named rate-splitting multiple access (RSMA) with TDD MaMIMO for downlink transmission and investigate its SE performance. We propose a novel downlink transmission framework of RSMA in TDD MaMIMO, devise a precoder design strategy and power allocation schemes to maximize different network utility functions. Numerical results reveal that RSMA is significantly more robust to pilot contamination and always achieves a SE performance that is equal to or better than the conventional linearly precoded MaMIMO transmission strategy.

cs.IT↗