arXiv subjects

Derrick Wing Kwan Ng

Publications and source records attributed to Derrick Wing Kwan Ng.

At least 55 records · Page 3Linked to original sources

arXiv2025

Rotatable Antenna-Enabled Spectrum Sharing in Cognitive Radio Systems

Non-fixed flexible antenna architectures, such as fluid antenna system (FAS), movable antenna (MA), and pinching antenna, have garnered significant interest in recent years. Among them, rotatable antenna (RA) technology has recently drawn significant attention in wireless systems owing to its unique ability to exploit additional spatial degrees-of-freedom (DoFs) by dynamically adjusting the three-dimensional (3D) boresight direction of each antenna. In this letter, we propose a new RA-assisted cognitive radio (CR) system designed to achieve efficient spectrum sharing while mitigating interference between primary and secondary communication links. Specifically, we formulate an optimization problem for the joint design of the transmit beamforming and the boresight directions of RAs at the secondary transmitter (ST), aimed at maximizing the received signal-to-interference-plus-noise ratio (SINR) at the secondary receiver (SR), while satisfying both interference constraint at the primary receiver (PR) and the maximum transmit power constraint at the ST. Although the formulated problem is challenging to solve due to its non-convexity and coupled variables, we develop an efficient algorithm by leveraging alternating optimization (AO) and successive convex approximation (SCA) techniques to acquire high-quality solutions. Numerical results demonstrate that the proposed RA-assisted system substantially outperforms conventional benchmark schemes in spectrum-sharing CR systems, validating RA's capability to simultaneously enhance the communication quality at the SR and mitigate interference at the PR.

eess.SP↗

arXiv2025

Fluid Antenna Meets RIS: Random Matrix Analysis and Two-Timescale Design for Multi-User Communications

The reconfigurability of fluid antenna systems (FASs) and reconfigurable intelligent surfaces (RISs) provides significant flexibility in optimizing channel conditions by jointly adjusting the positions of fluid antennas and the phase shifts of RISs. However, it is challenging to acquire the instantaneous channel state information (CSI) for both fluid antennas and RISs, while frequent adjustment of antenna positions and phase shifts will significantly increase the system complexity. To tackle this issue, this paper investigates the two-timescale design for FAS-RIS multi-user systems with linear precoding, where only the linear precoder design requires instantaneous CSI of the end-to-end channel, while the FAS and RIS optimization relies on statistical CSI. The main challenge comes from the complex structure of channel and inverse operations in linear precoding, such as regularized zero-forcing (RZF) and zero-forcing (ZF). Leveraging on random matrix theory (RMT), we first investigate the fundamental limits of FAS-RIS systems with RZF/ZF precoding by deriving the ergodic sum rate (ESR). This result is utilized to determine the minimum number of selected antennas to achieve a given ESR. Based on the evaluation result, we propose an algorithm to jointly optimize the antenna selection, regularization factor of RZF, and phase shifts at the RIS. Numerical results validate the accuracy of performance evaluation and demonstrate that the performance gain brought by joint FAS and RIS design is more pronounced with a larger number of users.

cs.IT↗

arXiv2025

Near-field Spatial-domain Channel Extrapolation for XL-MIMO Systems

Extremely large-scale multiple-input multiple-output (XL-MIMO) systems are pivotal to next-generation wireless communications, where dynamic RF chain architectures offer enhanced performance. However, efficient precoding in such systems requires accurate channel state information (CSI) obtained with low complexity. To address this challenge, spatial-domain channel extrapolation has attracted growing interest. Existing methods often overlook near-field spherical wavefronts or rely heavily on sparsity priors, leading to performance degradation. In this paper, we propose an adaptive near-field channel extrapolation framework for multi-subcarrier XL-MIMO systems, leveraging a strategically selected subset of antennas. Subsequently, we develop both on-grid and off-grid algorithms, where the latter refines the former's estimates for improved accuracy. To further reduce complexity, a cross-validation (CV)-based scheme is introduced. Additionally, we analytically formulate the mutual coherence of the sensing matrix and propose a coherence-minimizing-based random pattern to ensure robust extrapolation. Numerical results validate that the proposed algorithms significantly outperform existing methods in both extrapolation accuracy and achievable rate, while maintaining low computational complexity. In particular, our proposed CV ratio offers a flexible trade-off between accuracy and efficiency, and the corresponding off-grid algorithm achieves high accuracy with complexity comparable to conventional on-grid methods.

eess.SP↗

arXiv2025

Fluid Antenna System-assisted Physical Layer Secret Key Generation

This paper investigates physical-layer key generation (PLKG) in multi-antenna base station systems, by leveraging a fluid antenna system (FAS) to dynamically customize radio environments. Without requiring additional nodes or extensive radio frequency chains, the FAS effectively enables adaptive antenna port selection by exploiting channel spatial correlation to enhance the key generation rate (KGR) at legitimate nodes. To comprehensively evaluate the efficiency of the FAS in PLKG, we propose an FAS-assisted PLKG model that integrates transmit beamforming and sparse port selection under independent and identically distributed and spatially correlated channel models, respectively. Specifically, the PLKG utilizes reciprocal channel probing to derive a closed-form KGR expression based on the mutual information between legitimate channel estimates. Nonconvex optimization problems for these scenarios are formulated to maximize the KGR subject to transmit power constraints and sparse port activation. We propose an iterative algorithm by capitalizing on successive convex approximation and Cauchy-Schwarz inequality to obtain a locally optimal solution. A reweighted $\ell_1$-norm-based algorithm is applied to advocate for the sparse port activation of FAS-assisted PLKG. Furthermore, a low-complexity sliding window-based port selection is proposed to substitute reweighted $\ell_1$-norm method based on Rayleigh-quotient analysis. Simulation results demonstrate that the FAS-PLKG scheme significantly outperforms the FA-PLKG scheme in both independent and spatially correlated environments. The sliding window-based port selection method introduced in this paper has been shown to yield superior KGR, compared to the reweighted $\ell_1$-norm method. It is shown that the FAS achieves higher KGR with fewer RF chains through dynamic sparse port selection.

cs.CR↗

arXiv2025

Two-Timescale Sum-Rate Maximization for Movable Antenna Enhanced Systems

This paper studies a novel movable antenna (MA)-enhanced multiuser multiple-input multiple-output downlink system designed to improve wireless communication performance. We aim to maximize the average achievable sum rate through two-timescale optimization exploiting instantaneous channel state information at the receiver (I-CSIR) for receive antenna position vector (APV) design and statistical channel state information at the transmitter (S-CSIT) for transmit APV and covariance matrix design. We first decompose the resulting stochastic optimization problem into a series of short-term problems and one long-term problem. Then, a gradient ascent algorithm is proposed to obtain suboptimal receive APVs for the short-term problems for given I-CSIR samples. Based on the output of the gradient ascent algorithm, a series of convex objective/feasibility surrogates for the long-term problem are constructed and solved utilizing the constrained stochastic successive convex approximation (CSSCA) algorithm. Furthermore, we propose a planar movement mode for the receive MAs to facilitate efficient antenna movement and the development of a low-complexity primal-dual decomposition-based stochastic successive convex approximation (PDD-SSCA) algorithm, which finds Karush-Kuhn-Tucker (KKT) solutions almost surely. Our numerical results reveal that, for both the general and the planar movement modes, the proposed two-timescale MA-enhanced system design significantly improves the average achievable sum rate and the feasibility of the formulated problem compared to benchmark schemes.

cs.IT↗

arXiv2025

Communication Efficient Robotic Mixed Reality with Gaussian Splatting Cross-Layer Optimization

Realizing low-cost communication in robotic mixed reality (RoboMR) systems presents a challenge, due to the necessity of uploading high-resolution images through wireless channels. This paper proposes Gaussian splatting (GS) RoboMR (GSMR), which enables the simulator to opportunistically render a photo-realistic view from the robot's pose by calling ``memory'' from a GS model, thus reducing the need for excessive image uploads. However, the GS model may involve discrepancies compared to the actual environments. To this end, a GS cross-layer optimization (GSCLO) framework is further proposed, which jointly optimizes content switching (i.e., deciding whether to upload image or not) and power allocation (i.e., adjusting to content profiles) across different frames by minimizing a newly derived GSMR loss function. The GSCLO problem is addressed by an accelerated penalty optimization (APO) algorithm that reduces computational complexity by over $10$x compared to traditional branch-and-bound and search algorithms. Moreover, variants of GSCLO are presented to achieve robust, low-power, and multi-robot GSMR. Extensive experiments demonstrate that the proposed GSMR paradigm and GSCLO method achieve significant improvements over existing benchmarks on both wheeled and legged robots in terms of diverse metrics in various scenarios. For the first time, it is found that RoboMR can be achieved with ultra-low communication costs, and mixture of data is useful for enhancing GS performance in dynamic scenarios.

cs.RO↗

arXiv2025

A Framework of Arithmetic-Level Variable Precision Computing for In-Memory Architecture: Case Study in MIMO Signal Processing

Computational complexity poses a significant challenge in wireless communication. Most existing attempts aim to reduce it through algorithm-specific approaches. However, the precision of computing, which directly relates to both computing performance and computational complexity, is a dimension that is fundamental but rarely explored in the literature. With the emerging architecture of in-memory computing, variable precision computing (VPC) is enabled, allowing each arithmetic operation to be processed with a distinct and specifically optimized computing precision. In this paper, we establish a unified framework of arithmetic-level variable precision computing (AL-VPC), which aims to determine the optimized computing precision for each arithmetic operation. We first develop an arithmetic propagation error model exploiting stochastic analysis, and then formulate a mathematical optimization problem to strike balance between computing performance and computational complexity. Two algorithms, namely, offline VPC and online VPC, are proposed to solve the problem considering various practical concerns. Particularly, in a case study on zero-forcing (ZF) precoding, we reveal the Pareto boundary between computing performance and complexity, which exhibits up to a 60% sum-rate enhancement or equivalently up to a 30% complexity reduction compared to the traditional fixed-length methods.

eess.SP↗

arXiv2025

SpectrumFM: Redefining Spectrum Cognition via Foundation Modeling

The enhancement of spectrum efficiency and the realization of secure spectrum utilization are critically dependent on spectrum cognition. However, existing spectrum cognition methods often exhibit limited generalization and suboptimal accuracy when deployed across diverse spectrum environments and tasks. To overcome these challenges, we propose a spectrum foundation model, termed SpectrumFM, which provides a new paradigm for spectrum cognition. An innovative spectrum encoder that exploits the convolutional neural networks and the multi-head self attention mechanisms is proposed to effectively capture both fine-grained local signal structures and high-level global dependencies in the spectrum data. To enhance its adaptability, two novel self-supervised learning tasks, namely masked reconstruction and next-slot signal prediction, are developed for pre-training SpectrumFM, enabling the model to learn rich and transferable representations. Furthermore, low-rank adaptation (LoRA) parameter-efficient fine-tuning is exploited to enable SpectrumFM to seamlessly adapt to various downstream spectrum cognition tasks, including spectrum sensing (SS), anomaly detection (AD), and wireless technology classification (WTC). Extensive experiments demonstrate the superiority of SpectrumFM over state-of-the-art methods. Specifically, it improves detection probability in the SS task by 30% at -4 dB signal-to-noise ratio (SNR), boosts the area under the curve (AUC) in the AD task by over 10%, and enhances WTC accuracy by 9.6%.

eess.SP↗

arXiv2025

Energy-Efficient Hybrid Beamfocusing for Near-Field Integrated Sensing and Communication

Integrated sensing and communication (ISAC) is a pivotal component of sixth-generation (6G) wireless networks, leveraging high-frequency bands and massive multiple-input multiple-output (M-MIMO) to deliver both high-capacity communication and high-precision sensing. However, these technological advancements lead to significant near-field effects, while the implementation of M-MIMO \mbox{is associated with considerable} hardware costs and escalated power consumption. In this context, hybrid architecture designs emerge as both hardware-efficient and energy-efficient solutions. Motivated by these considerations, we investigate the design of energy-efficient hybrid beamfocusing for near-field ISAC under two distinct target scenarios, i.e., a point target and an extended target. Specifically, we first derive the closed-form Cramér-Rao bound (CRB) of joint angle-and-distance estimation for the point target and the Bayesian CRB (BCRB) of the target response matrix for the extended target. Building on these derived results, we minimize the CRB/BCRB by optimizing the transmit beamfocusing, while ensuring the energy efficiency (EE) of the system and the quality-of-service (QoS) for communication users. To address the resulting \mbox{nonconvex problems}, we first utilize a penalty-based successive convex approximation technique with a fully-digital beamformer to obtain a suboptimal solution. Then, we propose an efficient alternating \mbox{optimization} algorithm to design the analog-and-digital beamformer. \mbox{Simulation} results indicate that joint distance-and-angle estimation is feasible in the near-field region. However, the adopted hybrid architectures inevitably degrade the accuracy of distance estimation, compared with their fully-digital counterparts. Furthermore, enhancements in system EE would compromise the accuracy of target estimation, unveiling a nontrivial tradeoff.

cs.IT↗

arXiv2025

CRB-Rate Tradeoff for Bistatic ISAC with Gaussian Information and Deterministic Sensing Signals

In this paper, we investigate a bistatic integrated sensing and communications (ISAC) system, consisting of a multi-antenna base station (BS), a multi-antenna sensing receiver, a single-antenna communication user (CU), and a point target to be sensed. Specifically, the BS transmits a superposition of Gaussian information and deterministic sensing signals. The BS aims to deliver information symbols to the CU, while the sensing receiver aims to estimate the target's direction-of-arrival (DoA) with respect to the sensing receiver by processing the echo signals. For the sensing receiver, we assume that only the sequences of the deterministic sensing signals and the covariance matrix of the information signals are perfectly known, whereas the specific realizations of the information signals remain unavailable. Under this setup, we first derive the corresponding Cramér-Rao bounds (CRBs) for DoA estimation and propose practical estimators to accurately estimate the target's DoA. Subsequently, we formulate the transmit beamforming design as an optimization problem aiming to minimize the CRB, subject to a minimum signal-to-interference-plus-noise ratio (SINR) requirement at the CU and a maximum transmit power constraint at the BS. When the BS employs only Gaussian information signals, the resulting beamforming optimization problem is convex, enabling the derivation of an optimal solution. In contrast, when both Gaussian information and deterministic sensing signals are transmitted, the resulting problem is non-convex and a locally optimal solution is acquired by exploiting successive convex approximation (SCA). Finally, numerical results demonstrate that employing Gaussian information signals leads to a notable performance degradation for target sensing and the proposed transmit beamforming design achieves a superior ISAC performance boundary compared with various benchmark schemes.

eess.SP↗

arXiv2025

Robust ISAC Transceiver Beamforming Design under Low-Resolution AD/DA Converters

In this letter, we investigate the robust beamforming design for an integrated sensing and communication (ISAC) system featuring low-resolution digital-to-analog converters (DACs) and analog-to-digital converters (ADCs). Taking into account quantization noise, we aim at maximizing the radar signal-to-quantization-plus-noise ratio (SQNR) while guaranteeing the minimum required signal-to-quantization-plus-interference-plus-noise ratio (SQINR) for communication users. To address this nonconvex design problem, we first examine a scenario involving a point target and uniform-resolution DACs, where the globally optimal solution is obtained by applying the semidefinite relaxation (SDR) technique. For more general scenarios, including those with mixed-DACs and/or an extended target, we develop a low-complexity majorization-minimization (MM)-based algorithm to tackle the problem iteratively. Compared to the non-robust algorithm, the proposed algorithm demonstrates improved detection performance under practical quantization. Simulation results confirm the robustness and efficacy of our proposed algorithm in low-resolution quantization scenarios.

eess.SP↗

arXiv2025

Sum-Rate Maximization for Movable-Antenna Array Enhanced Downlink NOMA Systems

Movable antenna (MA) systems have recently attracted significant attention in the field of wireless communications owing to their exceptional capability to proactively reconfigure wireless channels via flexible antenna movements. In this paper, we investigate the resource allocation design for an MA array-enhanced downlink non-orthogonal multiple access (NOMA) system, where a base station deploys multiple MAs to serve multiple single-antenna users. Our goal is to maximize the sum rate of all users by jointly optimizing the transmit beamforming, positions of MAs, successive interference cancellation (SIC) decoding order, and users' corresponding decoding indicator matrix, while adhering to constraints on the maximum transmit power and finite MA moving region. The formulated problem is inherently highly non-convex, rendering it challenging to acquire a globally optimal solution. As a compromise, we propose a low-complexity two-stage optimization algorithm to obtain an effective suboptimal solution. Specifically, in stage one, the SIC decoding order is first determined by solving a channel gain maximization problem. Then, in stage two, with the given SIC decoding order, the beamforming vectors, MA positions, and users' decoding indicator matrix are iteratively optimized by capitalizing on alternating optimization, successive convex approximation (SCA), and genetic algorithm (GA). Simulation results unveil that the sum-rate performance of the proposed MA-enabled downlink NOMA system significantly outperforms that of conventional fixed-position antenna (FPA) systems. Moreover, the results also show that the antenna position optimization in the proposed algorithm can further enhance the advantages of NOMA over space division multiple access (SDMA).

eess.SP↗

arXiv2025

Globally Optimal Movable Antenna-Enhanced multiuser Communication: Discrete Antenna Positioning, Motion Power Consumption, and Imperfect CSI

Movable antennas (MAs) represent a promising paradigm to enhance the spatial degrees of freedom of conventional multi-antenna systems by dynamically adapting the positions of antenna elements within a designated transmit area. In particular, by employing electro-mechanical MA drivers, the positions of the MA elements can be adjusted to shape a favorable spatial correlation for improving system performance. Although preliminary research has explored beamforming designs for MA systems, the intricacies of the power consumption and the precise positioning of MA elements are not well understood. Moreover, the assumption of perfect CSI adopted in the literature is impractical due to the significant pilot overhead and the extensive time to acquire perfect CSI. To address these challenges, we model the motion of MA elements through discrete steps and quantify the associated power consumption as a function of these movements. Furthermore, by leveraging the properties of the MA channel model, we introduce a novel CSI error model tailored for MA systems that facilitates robust resource allocation design. In particular, we optimize the beamforming and the MA positions at the BS to minimize the total BS power consumption, encompassing both radiated and MA motion power while guaranteeing a minimum required SINR for each user. To this end, novel algorithms exploiting the branch and bound (BnB) method are developed to obtain the optimal solution for perfect and imperfect CSI. Moreover, to support practical implementation, we propose low-complexity algorithms with guaranteed convergence by leveraging successive convex approximation (SCA). Our numerical results validate the optimality of the proposed BnB-based algorithms. Furthermore, we unveil that both proposed SCA-based algorithms approach the optimal performance within a few iterations, thus highlighting their practical advantages.

eess.SP↗

arXiv2025

A New Pathway to Integrated Learning and Communication (ILAC): Large AI Model and Hyperdimensional Computing for Communication

The rapid evolution of forthcoming sixth-generation (6G) wireless networks necessitates the seamless integration of artificial intelligence (AI) with wireless communications to support emerging intelligent applications that demand both efficient communication and robust learning performance. This dual requirement calls for a unified framework of integrated learning and communication (ILAC), where AI enhances communication through intelligent signal processing and adaptive resource management, while wireless networks support AI model deployment by enabling efficient and reliable data exchanges. However, achieving this integration presents significant challenges in practice. Communication constraints, such as limited bandwidth and fluctuating channels, hinder learning accuracy and convergence. Simultaneously, AI-driven learning dynamics, including model updates and task-driven inference, introduce excessive burdens on communication systems, necessitating flexible, context-aware transmission strategies. Finally, we present a case study on a cost-to-performance optimization problem, where task assignments, model size selection, bandwidth allocation, and transmission power control are jointly optimized, considering computational cost, communication efficiency, and inference accuracy. Leveraging the Dinkelbach and alternating optimization algorithms, we offer a practical and effective solution to achieve an optimal balance between learning performance and communication constraints.

eess.SP↗

arXiv2025

Hybrid Near-Far Field 6D Movable Antenna Design Exploiting Directional Sparsity and Deep Learning

Six-dimensional movable antenna (6DMA) has been identified as a new disruptive technology for future wireless systems to support a large number of users with only a few antennas. However, the intricate relationships between the signal carrier wavelength and the transceiver region size lead to inaccuracies in traditional far-field 6DMA channel model, causing discrepancies between the model predictions and the hybrid-field channel characteristics in practical 6DMA systems, where users might be in the far-field region relative to the antennas on the same 6DMA surface, while simultaneously being in the near-field region relative to different 6DMA surfaces. Moreover, due to the high-dimensional channel and the coupled position and rotation constraints, the estimation of the 6DMA channel and the joint design of the 6DMA positions and rotations and the transmit beamforming at the base station (BS) incur extremely high computational complexity. To address these issues, we propose an efficient hybrid-field generalized 6DMA channel model, which accounts for planar-wave propagation within individual 6DMA surfaces and spherical-wave propagation among different 6DMA surfaces. Furthermore, by leveraging directional sparsity, we propose a low-overhead channel estimation algorithm that efficiently constructs a complete channel map for all potential antenna position-rotation pairs while limiting the training overhead incurred by antenna movement. In addition, we propose a low-complexity design leveraging deep reinforcement learning (DRL), which facilitates the joint design of the 6DMA positions, rotations, and beamforming in a unified manner. Numerical results demonstrate that the proposed hybrid-field channel model and channel estimation algorithm outperform existing approaches and that the DRL-enhanced 6DMA system significantly surpasses flexible antenna systems.

cs.IT↗

arXiv2025

Movable-Antenna Array Enhanced Downlink NOMA

Movable antenna (MA) has gained increasing attention in the field of wireless communications due to its exceptional capability to proactively reconfigure wireless channels via localized antenna movements. In this paper, we investigate the resource allocation design for an MA array-enabled base station serving multiple single-antenna users in a downlink non-orthogonal multiple access (NOMA) system. We aim to maximize the sum rate of all users by jointly optimizing the transmit beamforming and the positions of all MAs at the BS, subject to the constraints of transmit power budget, finite antenna moving region, and the conditions for successive interference cancellation decoding rate. The formulated problem, inherently highly non-convex, is addressed by successive convex approximation (SCA) and alternating optimization methods to obtain a high-quality suboptimal solution. Simulation results unveil that the proposed MA-enhanced downlink NOMA system can significantly improve the sum rate performance compared to both the fixed-position antenna (FPA) system and the traditional orthogonal multiple access (OMA) system.

eess.SP↗

arXiv2025

Polarized 6D Movable Antenna for Wireless Communication: Channel Modeling and Optimization

In this paper, we propose a novel polarized six-dimensional movable antenna (P-6DMA) to enhance the performance of wireless communication cost-effectively. Specifically, the P-6DMA enables polarforming by adaptively tuning the antenna's polarization electrically as well as controls the antenna's rotation mechanically, thereby exploiting both polarization and spatial diversity to reconfigure wireless channels for improving communication performance. First, we model the P-6DMA channel in terms of transceiver antenna polarforming vectors and antenna rotations. We then propose a new two-timescale transmission protocol to maximize the weighted sum-rate for a P-6DMA-enhanced multiuser system. Specifically, antenna rotations at the base station (BS) are first optimized based on the statistical channel state information (CSI) of all users, which varies at a much slower rate compared to their instantaneous CSI. Then, transceiver polarforming vectors are designed to cater to the instantaneous CSI under the optimized BS antennas' rotations. Under the polarforming phase shift and amplitude constraints, a new polarforming and rotation joint design problem is efficiently addressed by a low-complexity algorithm based on penalty dual decomposition, where the polarforming coefficients are updated in parallel to reduce computational time. Simulation results demonstrate the significant performance advantages of polarforming, antenna rotation, and their joint design in comparison with various benchmarks without polarforming or antenna rotation adaptation.

cs.IT↗

arXiv2025

Robust Secure Communications in Near-Field ISCAP Systems with Extremely Large-Scale Antenna Array

This paper investigates robust secure communications in a near-field integrated sensing, communication, and powering (ISCAP) system, in which the base station (BS) is equipped with an extremely large-scale antenna array (ELAA). In this system, the BS transmits confidential messages to a single legitimate communication user (CU), simultaneously providing wireless power transfer to multiple energy receivers (ERs) and performing point target sensing. We consider a scenario in which both the ERs and the sensing target may act as potential eavesdroppers attempting to intercept the confidential messages. To safeguard secure communication, the BS employs a joint beamforming design by transmitting information beams combined with dedicated triple-purpose beams serving as energy and sensing signals, as well as artificial noise (AN) for effectively jamming potential eavesdroppers. It is assumed that only coarse location information of the ERs and sensing targets or eavesdroppers is available at the BS, leading to imperfect channel state information (CSI). Under this setup, we formulate a robust beamforming optimization problem with the objective of maximizing the secrecy rate for the CU, while ensuring worst-case performance requirements on both target sensing and wireless energy harvesting at the ERs. To address the non-convex robust joint beamforming problem and facilitate the deployment of a low-complexity algorithm, we employ the S-procedure alongside an eavesdropping CSI error-bound determination method to acquire a high-quality solution.

eess.SP↗