Reconfigurable antennas (RAs) utilize the electromagnetic (EM) domain to provide dynamic control over antenna radiation patterns, which offers an effective way to enhance power efficiency in wireless links. Unlike conventional arrays with fixed element patterns, RAs enable on-demand beampattern synthesis by directly controlling each antenna's EM characteristics. While existing research on RAs has primarily focused on improving spectral efficiency, this paper explores their application for downlink localization. Moreover, the majority of existing works focus on far-field scenarios with little attention on near-field (NF). Motivated by these gaps, we consider a synthesis model in which each antenna generates desired beampatterns from a finite set of EM basis functions. We then formulate a joint optimization problem for the baseband (BB) and EM precoders with the objective of minimizing the user equipment (UE) position error bound (PEB) in NF conditions. Our analytical derivations and extensive simulation results demonstrate that the proposed hybrid precoder design for RAs significantly improves UE positioning accuracy compared to traditional non-reconfigurable arrays.

We investigate a multi-low Earth orbit (LEO) satellite system that simultaneously provides positioning and communication services to terrestrial user terminals. To address the challenges of accurately acquiring channel state information in LEO satellite systems, we propose a novel two-timescale positioning-aided channel estimation framework, exploiting the distinct variation rates of position-related parameters and channel gains inherent in LEO satellite channels. Using the misspecified Cramér-Rao bound (MCRB) theory, we systematically analyze positioning performance under practical imperfections, such as inter-satellite clock bias and carrier frequency offset. Furthermore, we theoretically demonstrate how position information derived from downlink positioning can enhance uplink channel estimation accuracy, even in the presence of positioning errors, through an MCRB-based analysis. To address the limited link budgets and communication rates of single-satellite communication, we develop a multi-LEO cooperative beamforming strategy for downlink transmission that leverages cluster-wise satellite cooperation while maintaining reduced complexity. Theoretical analyses and numerical results confirm the effectiveness of the proposed framework in facilitating high-precision downlink positioning under practical imperfections, facilitating uplink channel estimation, and enabling efficient downlink communication.

The integration of pattern-reconfigurable antennas into hybrid multiple-input multiple-output (MIMO) architectures presents a promising path toward high-efficiency and low-cost transceiver solutions. Pattern-reconfigurable antennas can dynamically steer per-antenna radiation patterns, enabling more efficient power utilization and interference suppression. In this work, we study a tri-hybrid MIMO architecture for multi-user communications that integrates digital, analog, and antenna-domain precoding using pattern-reconfigurable antennas. For characterizing the reconfigurability of antenna radiation patterns, we develop two models---Model~I and Model~II. Model~I captures realistic hardware constraints through limited pattern selection, while Model~II explores the performance upper bound by assuming arbitrary pattern generation. Based on these models, we develop two corresponding tri-hybrid precoding algorithms grounded in the weighted minimum mean square error (WMMSE) framework, which alternately optimize the digital, analog, and antenna precoders under practical per-antenna power constraints. Realistic simulations conducted in ray-tracing generated environments are utilized to evaluate the proposed system and algorithms. The results demonstrate the significant potential of the considered tri-hybrid architecture in enhancing communication performance and hardware efficiency. However, they also reveal that the existing hardware is not yet capable of fully realizing these performance gains, underscoring the need for joint progress in antenna design and communication theory development.

Artificial noise (AN) has been recognized as an effective physical-layer security scheme impairing the eavesdropper (Eve). Recently, artificial noise elimination (ANE) has emerged as a promising strategy to mitigate the impact of AN at Eves. However, conventional ANE schemes rely on prior knowledge, such as legitimate channel state information (CSI) or classification information, which may limit their practical applicability. To address these practical challenges, we propose an ANE scheme beyond prior knowledge (BPK) by leveraging machine learning algorithms. Firstly, a coarse projection is applied to partially eliminate the impact of AN using maximum likelihood estimation on the equivalent AN matrix. Secondly, a density clustering algorithm is introduced to obtain classification information based on the coarsely-projected observed vectors. Thirdly, a generalized principal component analysis (PCA)-based ANE algorithm is developed to effectively mitigate the residual AN using the obtained classification information. Furthermore, the artificial-noise-to-signal ratio (ANSR) and computational complexity are analyzed for performance revaluation, and a redefinition of several AN design principles is provided for scenarios involving a powerful Eve equipped with the BPK-ANE scheme by deriving the validity boundary. Finally, numerical results reveal key insights into four principles of AN: 1) Allocating less power to AN; 2) Reducing the randomness of AN; 3) Increasing the number of transmit antennas; and 4) Increasing the modulation order.

In this paper, we propose scalable distributed beamforming schemes over networked low Earth orbit (LEO) satellite systems that rely solely on statistical channel state information (CSI). We begin by introducing the LEO satellite network system model and presenting pragmatic yet effective analog beamformer and user-scheduling designs. We then derive a closed-form lower bound on the ergodic sum rate, based on the hardening bound, using which we formulate a per-satellite power-constrained sum rate maximization problem for the digital beamformer design. Next, we provide a centralized solution, obtained via the weighted minimum mean squared error (WMMSE) framework, establishes performance limits and motivates decentralized strategies. We subsequently introduce two decentralized optimization schemes, based on approximating the hardening bound and decentralizing the WMMSE framework, for two representative inter-satellite link (ISL) topologies, i.e., Ring and Star topologies. In the Ring topology-based beamforming scheme, satellites update beamformers locally and exchange intermediate parameters sequentially. On the other hand, in the Star topology-based beamforming scheme, edge satellites update beamformers locally and in parallel, achieving consensus on intermediate parameters at a central satellite using a penalty-dual decomposition (PDD) framework. Extensive simulations demonstrate that the proposed distributed beamforming schemes achieve similar performance with the centralized beamforming scheme while improving scalability significantly. Additionally, we reveal the delay–overhead trade-off between the two topologies.

This paper presents an end-to-end deep learning framework in a movable antenna (MA)-enabled multiuser communication system. In contrast to the conventional works assuming perfect channel state information (CSI) for MA placement or adopting a decoupled CSI acquisition and MA placement design paradigm, we address the practical CSI acquisition issue through the design of pilot signals and quantized CSI feedback, and further incorporate the joint optimization of channel estimation, MA placement, and precoding design. The proposed mechanism enables the system to learn an optimized transmission strategy from imperfect channel data, overcoming the limitations of conventional methods that conduct channel estimation and antenna position optimization separately. To balance the performance and overhead, we further extend the proposed framework to optimize the antenna placement based on the statistical CSI. Simulation results demonstrate that the proposed approach consistently outperforms traditional benchmarks in terms of achievable sum-rate of users, especially under limited feedback and sparse channel environments. Notably, it achieves a performance comparable to the widely-adopted gradient-based methods with perfect CSI, while maintaining significantly lower CSI feedback overhead. These results highlight the effectiveness and adaptability of learning-based MA system design for future wireless systems.

We investigate cooperative impersonation jamming on angle-based physical layer authentication (PLA) within 6G systems using hybrid antenna arrays. PLA leverages angle-ofarrival (AoA) information to authenticate user equipment, but remains vulnerable to sophisticated jamming where multiple adversaries cooperate. We extend previous research by formulating a comprehensive model of PLA that integrates hybrid arrays and by developing optimized jamming strategies that consider energy and information constraints. Our results show that analog arrays are more vulnerable to cooperative jamming than hybrid arrays. Additionally, the combiner design in the hybrid array, along with the energy and information constraints on jamming strategies, significantly influences the success of jamming. By identifying vulnerabilities in PLA and studying effective countermeasures, this work contributes to advancing physical layer authentication in 6G systems.

We propose a robust transceiver design for a covert integrated sensing and communications (ISAC) system with imperfect channel state information (CSI). Considering both bounded and probabilistic CSI error models, we formulate worst-case and outage-constrained robust optimization problems of joint transceiver beamforming and radar waveform design to balance the radar performance of multiple targets while ensuring the communications performance and covertness of the system. The optimization problems are challenging due to the non-convexity arising from the semi-infinite constraints (SICs) and the coupled transceiver variables. In an effort to tackle the former difficulty, S-procedure and Bernstein-type inequality are introduced for converting the SICs into finite convex linear matrix inequalities (LMIs) and second-order cone constraints. A robust alternating optimization framework referred to alternating double-checking is developed for decoupling the transceiver design problem into feasibility-checking transmitter- and receiver-side subproblems, transforming the rank-one constraints into a set of LMIs, and verifying the feasibility of beamforming by invoking the matrix-lifting scheme. Numerical results are provided to demonstrate the effectiveness and robustness of the proposed algorithm in improving the performance of covert ISAC systems.

Localization plays an increasingly pivotal role in 5G/6G systems, enabling various applications. This paper focuses on the privacy concerns associated with delay-based localization, where unauthorized base stations attempt to infer the location of the end user. We propose a method to disrupt localization at unauthorized nodes by injecting artificial components into the pilot signal, exploiting model mismatches inherent in these nodes. Specifically, we investigate the effectiveness of two techniques, namely artificial multipath (AM) and artificial noise (AN), in mitigating location leakage. By leveraging the misspecified Cramer-Rao bound framework, we evaluate the impact of these techniques on unauthorized localization performance. Our results demonstrate that pilot manipulation significantly degrades the accuracy of unauthorized localization while minimally affecting legitimate localization. Moreover, we find that the superiority of AM over AN varies depending on the specific scenario.

In this paper, we explore robust transceiver design for an integrated sensing and communications system with bounded channel estimation error. To maximize the minimum sensing performance of multiple targets while satisfying communications requirements, we study the worst-case robust op-timization problem by jointly optimizing the transmitter and receiver variables. The formulated problem is challenging due to the non-convexity arising from the semi-infinite constraints (SICs) and coupled variables. To overcome these difficulties, we adopt the S-procedure to convert the SICs into finite convex linear matrix inequalities (LMIs). Using the alternating opti-mization technique, we decouple the robust transceiver design problem into feasibility-checking subproblems. By exploiting matrix lifting, we transform the rank-one constraints into a set of LMIs, which is leveraged to further check the feasibility of the obtained beamforming scheme. Numerical results are provided to demonstrate the robustness and effectiveness of the proposed algorithm in combating channel errors and improving the performance of ISAC systems.

Terahertz (THz) communication is expected to be one of the core enabling technologies for future systems. Due to the poor scattering and severe reflection loss of THz waves, the line-of-sight (LoS) communication is considered as a leading feature in THz multiple-input–multiple-output (MIMO) systems. To realize LoS communication, beam training is a promising scheme to find the beamforming vectors without leveraging explicit channel state information (CSI). In this context, a crucial issue for THz MIMO is how to design the beam codewords for realizing any expected radiation pattern during the training. In particular, the narrow beams can be realized by array response vectors whereas the wide-beam design is still an open problem. In this article, we propose two high-quality algorithms, namely, successive convex approximation (SCA)-based auxiliary target pursuit (SCA-ATP) and the sum of symmetrical array response vectors (S-SARVs), for offline design and real-time design, respectively. Numerical results show that SCA-ATP yields the best performance in terms of the beam-pattern error (BPE) compared with benchmarks, and S-SARV can achieve a close performance to SCA-ATP with low computational complexity.

In this paper, we study the beamforming schemes via the novel frequency diverse array (FDA) on enhancing covert communications performance. We first consider the ideal scenario where the channel state information (CSI) is perfectly known at the transmitter. Then we characterize the key role of minimizing the correlation of the communication and detection channels in boosting the covertness of the system, which also provides a theoretical design principle for FDA-specific carrier frequency scheduling. By exploiting the optimization framework block successive upper bound minimization (BSUM), we propose a frequency scheduling method which leads to a two-phase beamforming scheme to facilitate the covert transmission. Subsequently, we extend the scenario to the more practical one with partial CSI. By leveraging the convex hull, we manage to transform the formulated semi-infinite programming problem to an equivalent semi-definite one which can be solved optimally. In addition, we present a process to construct the optimal beamforming vector. To mitigate the channel correlations in this scenario, we generalize the steps of BSUM and propose an algorithm to schedule the frequencies efficiently. Afterwards, a three-phase robust beamforming scheme is summarized, which boosts the covert rate significantly. Numerical results are provided to demonstrate the superiority of the proposed schemes.