Searcharxiv⌕ Search

arXiv subjects

Liujia Yao

Publications and source records attributed to Liujia Yao.

5 recordsLinked to original sources

Unified Far-field and Near-field Codebook Design for XL-array Systems

While extremely large-scale antenna arrays (XL-arrays) hold immense promise for next-generation wireless networks, the paradigm shift encompassing new near-field communications renders conventional discrete Fourier transform (DFT)-based Type-I codebooks inefficient. Meanwhile, existing near-field alternatives usually impose prohibitively high storage and/or feedback burdens. To tackle these challenges, we propose in this letter a unified codebook applicable to both far-field and near-field XL-array systems. Our key idea is to express the near-field channel steering vector in an equivalent form, which is a Hadamard product of an angular vector and a curvature-related vector. This new representation allows direct reuse of the legacy Type-I codebook for angle quantization, while only a lightweight auxiliary codebook is newly added for additional curvature quantization. Subsequently, we optimize the auxiliary curvature codebook by maximizing the average beamforming gain given the information of user distribution. By leveraging the local monotonicity of the beamforming gain with respect to curvature mismatch, the optimization problem is further reduced to a quantization-error minimization problem, for which suboptimal curvature codewords are obtained. Numerical results demonstrate that the proposed unified codebook achieves near-optimal beamforming performance that approaches its upper bound based on perfect channel state information (CSI), while significantly reducing the required feedback overhead as compared to various benchmark schemes.

cs.IT↗

Generative Deep Learning for CSI Feedback in Massive MIMO via Channel Distribution Prediction

Existing deep-learning-based channel state information (CSI) feedback methods reduce feedback overhead by compressing high-dimensional CSI into low-dimensional representations and/or exploiting historical CSI to predict future CSI. However, these methods may become unreliable when user equipment (UE) suddenly changes its motion. To address this issue, we propose a prediction-aided coding (PAC) framework for generative CSI feedback, which adaptively encodes CSI based on predicted channel/CSI distributions and the observed CSI in real time. Each CSI frame is represented by multiple CSI tokens obtained without using historical CSI, making token generation robust to abrupt UE motion. In the first stage, the conditional distribution, instead of a deterministic value, of the next-frame CSI tokens is predicted based on historical tokens. In the second stage, once the next frame arrives, the predicted distribution is used for variable-length entropy coding of its CSI tokens. To further reduce feedback overhead and inference latency, we propose efficient designs for both stages. For the first stage, a customized causal Transformer with a new positional embedding strategy accurately predicts next-frame token probabilities. For the second stage, a parallel causal decoding strategy reduces the inference latency caused by sequential token decoding. Extensive experiments show that, compared with existing history-aware baselines, PAC reduces feedback overhead by approximately 72% to 84% while achieving higher reconstruction accuracy. Additionally, PAC maintains CSI reconstruction accuracy under random-walk trajectories, whereas existing history-aware baselines suffer sharp degradation in reconstruction accuracy.

eess.SP↗

Codebook Design for Limited Feedback in Near-Field XL-MIMO Systems

In this paper, we study efficient codebook design for limited feedback in extremely large-scale multiple-input-multiple-output (XL-MIMO) frequency division duplexing (FDD) systems. It is worth noting that existing codebook designs for XL-MIMO, such as polar-domain codebook, have not well taken into account user (location) distribution in practice, thereby incurring excessive feedback overhead. To address this issue, we propose in this paper a novel and efficient feedback codebook tailored to user distribution. To this end, we first consider a typical scenario where users are uniformly distributed within a specific polar-region, based on which a sum-rate maximization problem is formulated to jointly optimize angle-range samples and bit allocation among angle/range feedback. This problem is challenging to solve due to the lack of a closed-form expression for the received power in terms of angle and range samples. By leveraging a Voronoi partitioning approach, we show that uniform angle sampling is optimal for received power maximization. For more challenging range sampling design, we obtain a tight lower-bound on the received power and show that geometric sampling, where the ratio between adjacent samples is constant, can maximize the lower bound and thus serves as a high-quality suboptimal solution. We then extend the proposed framework to accommodate more general non-uniform user distribution via an alternating sampling method. Furthermore, theoretical analysis reveals that as the array size increases, the optimal allocation of feedback bits increasingly favors range samples at the expense of angle samples. Finally, numerical results validate the superior rate performance and robustness of the proposed codebook design under various system setups, achieving significant gains over benchmark schemes, including the widely used polar-domain codebook.

cs.IT↗

Rotatable IRS-Assisted 6DMA Communications: A Two-timescale Design

Intelligent reflecting surface (IRS) and movable antenna (MA) are promising technologies to enhance wireless communication by reconfiguring channels at the environment and transceiver sides. However, their performance is constrained by practical limitations. To address this, we propose a multi-functional antenna/surface system that leverages their complementary advantages. A rotatable IRS (R-IRS) is deployed to enhance downlink communications from a six-dimensional MA (6DMA)-equipped base station (BS) to multiple single-antenna users. To reduce the complexity of real-time channel estimation and beamforming, we formulate an optimization problem to maximize the average sum-rate using a two-timescale (TTS) transmission protocol. Specifically, the BS antenna configuration (including position and rotation) and IRS rotation and reflection are optimized based on statistical channel state information (S-CSI), while BS transmit beamforming is designed using instantaneous CSI (I-CSI) in the short timescale. We first consider a single-user case and show that the 6DMA at the BS should form a sparse array for multi-beam transmission towards both the IRS and the user, allowing efficient coordination of direct and reflected channels, while the IRS rotation achieves effective multi-path alignment. For the general multi-user case, the optimization problem is non-convex and challenging to solve. To tackle this, we propose an efficient algorithm combining weighted minimum mean-square error (WMMSE) and stochastic successive convex approximation (SSCA) techniques. A low-complexity algorithm is also proposed to reduce computational complexity. Numerical results validate the proposed system, showing significant performance gains by jointly exploiting the spatial degrees of freedom of the 6DMA-BS and R-IRS under the TTS protocol.

cs.IT↗

Position Optimization for Two-layer Movable Antenna Systems

Movable antenna (MA) is a promising technology for improving the performance of wireless communication systems by providing new degrees-of-freedom (DoFs) in antenna position optimization. However, existing works on MA systems have mostly considered element-wise single-layer MA (SL-MA) arrays, where all the MAs move within the given movable region, hence inevitably incurring high control complexity and hardware cost in practice. To address this issue, we propose in this letter a new two-layer MA array (TL-MA), where the positions of MAs are jointly determined by the large-scale movement of multiple subarrays and the small-scale fine-tuning of per-subarray MAs. In particular, an optimization problem is formulated to maximize the sum-rate of the TL-MA-aided communication system by jointly optimizing the subarray-positions, per-subarray (relative) MA positions, and receive beamforming. To solve this non-convex problem, we propose an alternating optimization (AO)-based particle swarm optimization (PSO) algorithm, which alternately optimizes the positions of subarrays and per-subarray MAs, given the optimal receive beamforming. Numerical results verify that the proposed TL-MA significantly reduces the sum-displacement of MA motors (i.e., the total moving distances of all motors) of element-wise SL-MA, while achieving comparable rate performance.

eess.SP↗