arXiv subjects

Jian Dang

Publications and source records attributed to Jian Dang.

At least 19 recordsLinked to original sources

arXiv2026

Spatial-Code-Domain Grouped Index Modulation: Fluid-Antenna-Assisted System Design and BER Performance Analysis

Fluid antenna systems (FASs) provide reconfigurable spatial resources within compact apertures. In this paper, we introduce code-domain grouped index modulation (CGIM) and its spatial-code-domain extension, termed SCGIM, for FA-assisted transceivers. CGIM partitions the available orthogonal spreading codes into multiple subsets and jointly maps information onto their in-phase and quadrature indices and constellation symbols. In an Rx-FAS-assisted single-input multiple-output (SIMO) link, group-wise despreading separates the orthogonal code groups for parallel detection, while receive-port selection provides spatial diversity. SCGIM further associates interleaved Tx-FA port subsets with the code subsets, with the Tx-FAS conveying spatial-index information and the Rx-FAS providing selection diversity in a multiple-input multiple-output (MIMO) link. For SCGIM, we develop maximum-likelihood (ML), staged greedy (GD), and cross-domain index message-passing (CD-IMPD) detectors. CD-IMPD exchanges soft information over a cycle-free factor graph to account for the coupling between the spatial and code indices, requiring only one inward and one outward message pass. For CGIM, the BER is derived from the joint decision regions of the despread-domain observations and averaged over the Rx-FAS selected-gain distribution under Rayleigh, Nakagami-m, and additive white Gaussian noise channels. For SCGIM, an average-BER approximation is derived from a full-pair union bound using the selected-gain density ratio and exponentially tilted quadratic-form Laplace transforms. Simulation results validate the BER analysis and show that the proposed schemes achieve lower BER and higher throughput than the considered IM schemes, while CD-IMPD achieves near-ML BER performance with lower detection complexity.

cs.IT↗

arXiv2026

Code-Domain Grouped Index Modulation for Spectrally Efficient Spread-Spectrum Communications

Efficient exploitation of spreading resources is important for improving the transmission efficiency of spread-spectrum communications. Code index modulation (CIM) conveys additional information through spreading-code indices without requiring extra radio-frequency chains. The fixed number of code-index branches in existing CIM schemes limits information allocation between the code-index and modulation-symbol domains as the target rate increases. This paper proposes code-domain grouped index modulation (CGIM), which partitions an orthogonal spreading-code bank into multiple groups and maps the in-phase and quadrature components of one quadrature amplitude modulation (QAM) symbol in each group onto two independent code indices. Group-wise despreading enables parallel detection. Group-wise maximum-likelihood (ML) and low-complexity greedy detection (GD) are developed, with both achieving joint ML decisions under the stated conditions. A pairwise error probability (PEP)-based bit error rate (BER) analysis is derived for Rayleigh and Nakagami-$m$ fading, with additive white Gaussian noise (AWGN) as a benchmark. Numerical results show that CGIM achieves better BER performance than traditional CIM benchmark schemes at the same transmission rate, owing to a more balanced distribution of information bits between the code-index and modulation-symbol domains.

cs.IT↗

arXiv2026

Fluid-Antenna-Assisted Distributed Joint Decoding for Cell-Free Massive MIMO Unsourced Random Access

Unsourced random access (URA) supports massive sporadic connectivity but remains limited by multiuser interference, distributed channel uncertainty, and local fading. This paper proposes a fluid-antenna-assisted distributed joint decoder for cell-free massive MIMO URA. Single-radio-frequencychain access points sequentially sound correlated ports; the central processor then performs correlation-aware expectationmaximization approximate message passing, selects one common payload port per access point, and combines MIMO iterative Gaussian approximation with full-packet channel re-estimation and successive interference cancellation. Fixed-port ablations confirm the complementary benefits of distributed reception, reestimation, and iterative cancellation, while fluid-antenna simulations show improved average and lower-tail received power over fixed-port reception. The framework provides a feasible integration of fluid antennas and cell-free URA and motivates end-to-end evaluation under pilot collisions and switching overhead.

cs.IT↗

arXiv2026

Fluid Antenna Array-Inspired Location-Posterior-Driven Subarray Sizing and Power Control for Two-Hop AF UAV Relaying

This paper develops fluid antenna array (FAA)-inspired subarray sizing and transmit-power design for a two-hop amplify-and-forward (AF) unmanned aerial vehicle (UAV) relay using progressively contracting user-location posteriors. A contiguous reconfigurable subarray is shared by first-hop reception and second-hop forwarding, such that its active size jointly determines the receive gain, forwarding gain, and beamwidth. By adaptively controlling the effective aperture, the proposed design exploits geometric reconfigurability to balance array gain against pointing robustness under location uncertainty. Projecting the position covariance onto the array direction yields a closed-form direction-limited size inversely proportional to directional uncertainty. Posterior samples are propagated through the two-hop rate model, and the subarray size and transmit power are then selected to minimize UAV power subject to a worst-user lower-tail rate requirement and hardware power limits. The planned configuration is further audited over instantaneous two-hop Rician channels at the true user positions. At t = 8 s, the proposed design saves 3.17 dB over full-array narrow-beam transmission on paired feasible geometries and achieves 60.0% service success at a 0.15-W budget, compared with 43.2% for a fixed eight-element subarray.

cs.IT↗

arXiv2026

Sparse Port Selection under Mutual Coupling in Fluid Antenna Arrays

Fluid antenna systems obtain spatial degrees of freedom by reconfiguring antenna positions within a confined region, a principle that extends to beamforming: shaped beams can be synthesized using far fewer radio-frequency feeds than candidate antenna positions. When the candidates are densely arranged, however, electromagnetic mutual coupling changes the relationship among terminal voltages, induced currents, and radiated fields, so an uncoupled model no longer describes the hardware and may activate an unsuitable set of ports, distorting the synthesized pattern. This paper develops a mutual-coupling-aware framework that converts the desired beam amplitude into a finite-aperture-compatible complex target and models the complete antenna lattice as a coupled multiport network, selecting the active ports and their source voltages through the coupled voltage-to-field response. Inactive candidate ports remain part of the network and carry induced currents, and every compared design is evaluated through the same electromagnetic model under the same source-voltage budget. Numerical results show that the mutual-coupling-aware design improves both the average mainlobe signal-to-noise ratio (SNR) and the peak sidelobe level (PSLL) over coupling-unaware selection and a fixed array, demonstrating that mutual coupling should be exploited in the design itself rather than compensated only in the final evaluation.

cs.IT↗

arXiv2026

Off-Grid Position Optimization under Mutual Coupling in Fluid Antenna Arrays

Fluid antenna arrays exploit continuous antenna repositioning within a finite aperture to provide geometry diversity beyond grid-constrained port selection. Every displacement, however, changes both the radiation response and the multiport mutual-impedance network, coupling geometry optimization with the source-voltage constraint. This paper develops an electromagnetic-aware (EM-aware) beamforming framework for planar fluid antenna arrays. Phase retrieval converts an amplitude-only shaped-beam specification into an aperture-compatible complex target, and an EM-aware orthogonal matching pursuit (OMP) method selects grid-constrained initial antenna positions. Continuous refinement then alternates exact voltage-constrained current optimization with movement-constrained projected adaptive moment estimation (Adam) updates of all physical antenna positions. Across independently perturbed symmetric dual-beam targets, the proposed method consistently improves the average mainlobe signal-to-noise ratio (SNR) and reduces the peak sidelobe level (PSLL) over a uniform array and discrete port selection.

cs.IT↗

arXiv2026

Fluid-Antenna-Aided Active User Detection With 1D-CNN Channel Reconstruction for Unsourced Random Access

In this paper, we investigate the application of fluid antenna systems (FAS) for active user detection (AUD) in unsourced random access (URA). A channel reconstruction method based on a one-dimensional convolutional neural network (1D-CNN) is proposed to effectively learn the nonlinear mapping from partial channel observations to the full channel vector. Furthermore, the reconstructed channel information is exploited to improve AUD performance via port selection. Simulation results demonstrate that the proposed 1D-CNN channel reconstructor significantly outperforms traditional methods under varying pilot lengths, achieving superior normalized mean squared error (NMSE) performance. Additionally, the reconstructed channel substantially reduces the AUD error rate compared with conventional approaches relying on traditional antenna configurations.

cs.IT↗

arXiv2026

Fluid Antenna-assisted Unsourced ISAC Massive Access

Unsourced integrated sensing and communication (UNISAC) has emerged as a promising paradigm for supporting massive connectivity in 6G networks. However, existing approaches predominantly rely on fixed-position antennas at the base station (BS) and user equipment (UE). In uplink transmission with huge access density and limited resource budgets (i.e., finite blocklength, FBL), the fixed arrays are constrained by their physical aperture and static spatial sampling, which lead to severe multi-user interference and an unavoidable pilot collision error floor. To conquer the bottleneck derived from fixed-position physical constraint and utilize the abundant spatial diversity within compact space, this paper proposes a novel unsourced ISAC framework incorporating a fluid antenna system (FAS) at the user side. The proposed scheme exploits the positional flexibility of FAS to reconfigure the channel environment by continuously adjusting antenna ports in the spatial domain. Numerical results demonstrate that the proposed FAS-aided approach significantly reduces the per-user probability of error (PUPE) and enhances angle-of-arrival (AOA) sensing accuracy. Specifically, the proposed scheme provides a 40 dB capacity gain over traditional TDMA at 1000 active users. It should be noted that the FAS considered in this paper is only deployed at the transmitter. In our future work, we will try deploying FAS at both the transmitter and receiver.

cs.IT↗

arXiv2026

Fluid Reconfigurable Intelligent Surface Enabling Index Modulation

Fluid reconfigurable intelligent surfaces (FRIS) enable joint position and phase reconfigurability by integrating fluid antennas (FA) with conventional reconfigurable intelligent surfaces (RIS). In this paper, we propose a novel FRIS-based index modulation (IM) framework that exploits the additional spatial degrees of freedom introduced by FRIS element-position reconfiguration. Based on this framework, two transmission schemes are developed, namely FRIS-assisted receiver spatial modulation (FRIS-RSM) and receiver spatial shift keying (FRIS-RSSK), where information bits are conveyed through receiver-antenna index selection. The proposed framework supports both continuous and finite-bit phase control while accounting for FRIS-side spatial correlation. To balance detection complexity and bit error rate (BER) performance, a two-stage reduced-complexity list detector is proposed. For performance analysis under double-Rayleigh cascaded fading with strongest-link selection, tractable post-selection statistics are developed for both continuous-phase and quantized-phase FRIS and incorporated into a moment-generating-function (MGF)-based framework to derive unconditional pairwise error probability (UPEP) and union-bound BER expressions. Simulation results demonstrate significant BER gains over conventional RIS-assisted schemes and verify the accuracy of the analysis.

cs.IT↗

arXiv2026

Fundamental Tradeoffs for ISAC Multiple Access in Finite-Blocklength Regime

This paper investigates the fundamental communication--sensing tradeoffs of uplink dual-functional integrated sensing and communication (ISAC) multiple access under finite blocklength (FBL) constraints. Unlike conventional asymptotic analyses, we explicitly account for the limitations under FBL constraints imposed by short packets and low-latency transmission. By examining the unbiased channel state sensing estimator, we establish a geometric decomposition of the sensing error, indicating that it is jointly determined by the signal-to-noise ratio and the correlation structure of the information codebook. This insight reveals how cross-correlation among active users in the codebook geometry fundamentally constrains dual-functional ISAC performance. Consequently, we derive achievability and converse bounds that characterize the tradeoff between communication code rate and sensing accuracy in the FBL regime, with the converse further bounded by Shannon capacity. Moreover, by treating channel state sensing as a high-level sensing objective, a universal Cram\'er--Rao bound is derived to link channel estimation accuracy to practical sensing parameters. Examples of parameter sensing are also provided based on 3GPP standard. Numerical results validate the theoretical analysis and demonstrate the impact of blocklength, antenna dimensions, and sensing requirements.

cs.IT↗

arXiv2025

Iterative Gaussian Approximation for Random Spreading Unsourced Random Access

Massive machine-type communications (mMTC) demand robust solutions to support extensive connectivity efficiently. Unsourced random access (URA) has emerged as a promising approach, delivering high spectral and energy efficiency. Among URA code structures, the random spreading (RS) category is a key enabler, providing strong anti-interference capabilities through spectrum spreading gain. Notably, RS-URA approaches theoretical performance limits over the Gaussian multiple access channel in scenarios with few active users. In this paper, we propose an iterative Gaussian approximation decoder designed universally for RS-URA categories. The proposed receiver iterates extrinsic and intrinsic soft information to enhance decoding performance, requiring only a few iterations to converge. Numerical results validate the decoder's effectiveness in terms of performance and robustness.

cs.IT↗

arXiv2025

Joint Activity Detection and Channel Estimation For Fluid Antenna System Exploiting Geographical and Angular Information

The fluid antenna system (FAS) refers to a family of reconfigurable antenna technologies that provide substantial spatial gains within a compact, predefined small space, thereby offering extensive degrees of freedom in the physical layer for future communication networks. The acquisition of channel state information (CSI) is critical, as it determines the placement of ports/antennas, which directly impacts FAS-based optimization. Although various channel estimation methods have been developed, significant flaws persist. For instance, the performance of greedy-based algorithms is heavily influenced by signal assumptions, and current model-free methods are infeasible due to prohibitively high computational complexity issue. Consequently, there is a pressing need for a well-balanced solution that exhibits flexibility, feasibility, and low complexity to support massive connectivity in FAS. In this work, we propose methods based on approximate message passing (AMP) integrated with adaptive expectation maximization (EM). The EM-AMP framework uniquely enables efficient large matrix computations with adaptive learning capabilities, independent of prior knowledge of the model or parameters within potential distributions, making it a robust candidate for FAS networks. We introduce two variants of the EM-AMP framework that leverage geographical and angular features in a FAS network. These proposed algorithms demonstrate improved estimation precision, fast convergence, and low computational complexity in large activity regions. Additionally, we analytically elucidate the reasons behind the inherent performance floor of greedy-based methods and highlight the critical role of angular information in algorithm design. Extensive numerical results validate the promising efficacy of the proposed algorithm designs and the derived analytical findings.

cs.IT↗

arXiv2025

Artificial-Noise-Aided Secure Near-Field MIMO With Fluid Antenna Systems

With the evolution of mobile communication systems toward large-scale arrays, high-frequency operation, and reconfigurable antenna architectures, fluid antenna systems (FAS) operating in the near-field (NF) regime provide new degrees of freedom (DoF) for secure and privacy-sensitive mobile access. This paper proposes an artificial-noise (AN)-aided physical layer security (PLS) scheme for NF fluid-antenna multiple-input multiple-output (FA-MIMO) systems, aiming to protect high-rate mobile service links supported by compact or large arrays. An alternating-optimization (AO) framework addresses the sparsity-constrained non-convex design by splitting it into a continuous BF/AN joint-design subproblem and a discrete FAS port-selection subproblem. Closed-form fully digital beamforming (BF)/AN solutions are obtained via a generalized spectral water-filling procedure within a block coordinate descent (BCD) surrogate and realized by a hardware-consistent hybrid beamforming (HBF) architecture with a shared RF network and independent digital BF/AN branches, while preserving the target BF/AN power split under constant-modulus RF constraints. For FAS port selection, a row-energy based prune--refit rule, aligned with Karush--Kuhn--Tucker (KKT) conditions of a group-sparsity surrogate, enables efficient active-port determination under a finite RF-chain budget. Simulation results confirm that the proposed design exploits the geometry and position-domain DoF of FAS and significantly improves secrecy performance, particularly for non-extremely-large arrays where NF beam focusing alone is inadequate. These results demonstrate the potential of AN-aided NF FA-MIMO as a practical secure-transmission architecture for future location-aware and hardware-constrained mobile computing systems.

cs.IT↗

arXiv2025

Fluid Antenna-Enhanced Flexible Beamforming

Fluid antenna systems encompass a broad class of reconfigurable antenna technologies that offer substantial spatial diversity for various optimization objectives and communication tasks. Their capability to enhance spatial resolution within a fixed physical aperture makes fluid antennas particularly attractive for next-generation wireless deployments. In this work, we focus on the beamforming problem using a two-dimensional planar fluid antenna array. Since both narrow-beam and broad-beam patterns are essential in practical communication networks, enabling flexible beamforming through fluid antennas becomes an important and interesting research direction. We establish a unified and flexible framework that connects arbitrary beam-pattern synthesis with fluid-antenna port selection. The resulting formulation transforms beam-pattern reconstruction into a sparse regression problem, which is addressed using a tailored compressive sensing algorithm designed to operate efficiently with the fast Fourier transform (FFT). Furthermore, to ensure physically consistent phase modeling in the desired beam, we introduce an iterative FFT-based phase retrieval method. Owing to its structure, the proposed phase-refinement procedure exhibits low computational complexity and rapid convergence, requiring only one FFT and one inverse FFT per iteration. Simulation results demonstrate the effectiveness of the proposed flexible beamforming framework. Compared with conventional fixed-array architectures, fluid antennas exhibit significantly improved beam-pattern reconstruction accuracy, highlighting their potential for high-resolution and adaptive beamforming in future wireless systems.

cs.IT↗

arXiv2025

Neural Networks-Enabled Channel Reconstruction for Fluid Antenna Systems: A Data-Driven Approach

Fluid antenna systems (FASs) offer substantial spatial diversity by exploiting the electromagnetic port correlation within compact array spaces, thereby generating favorable small-scale fading conditions with beneficial channel gain envelope fluctuations. This unique capability opens new opportunities for a wide range of communication applications and emerging technologies. However, accurate channel state information (CSI) must be acquired before a fluid antenna can be effectively utilized. Although several efforts have been made toward channel reconstruction in FASs, a generally applicable solution to both model-based or model-free scenario with both high precision and efficient computational flow remains lacking. In this work, we propose a data-driven channel reconstruction approach enabled by neural networks. The proposed framework not only achieves significantly enhanced reconstruction accuracy but also requires substantially lower computational complexity compared with existing model-free methods. Numerical results further demonstrate the rapid convergence and robust reconstruction capability of the proposed scheme, outperforming current state-of-the-art techniques.

cs.IT↗

arXiv2025

Low-Complexity CSI Acquisition Exploiting Geographical Diversity in Fluid Antenna System

The fluid antenna system (FAS) employs reconfigurable antennas for high spatial gains in compact spaces, enhancing physical layer flexibility. Channel state information (CSI) acquisition is vital for port selection and FAS optimization. Greedy algorithms rely on signal assumptions, and model-free methods face high complexity. A flexible, low-complexity solution is needed for massive connectivity in FAS. Based on expectation maximization-approximate message passing (EM-AMP) framework, efficient matrix computations and adaptive learning without prior model knowledge naturally suit CSI acquisition for FAS. We propose a EM-AMP variant exploiting FAS geographical priors, improving estimation precision, accelerating convergence, and reducing complexity in large-scale deployment. Simulations validate the efficacy of the proposed algorithm.

cs.IT↗

arXiv2025

Probabilistic ODMA Receiver with Low-Complexity Algorithm for MIMO Unsourced Random Access

In this work, we present the design for both pilot-uncoupled and pilot-free on-off multiple access (ODMA) receivers in unsourced random access (URA) for multiple-input multiple-output (MIMO) systems. Unlike pilot-coupled ODMA, where on-off patterns are linked to pilot selection, pilot-uncoupled and pilot-free ODMA reduce transmission redundancy but face challenges in processing complexity and capacity performance. The joint pattern and data detector (JPDD) design is critical for these schemes, but the current JPDD algorithm has high complexity with quadratic computational costs. To address this, we propose a low-complexity detector based on approximate message passing (AMP), which offers linear complexity, providing reduced cost and improved performance in the under-determined linear regression case. Decoding is initialized via pilot-free matrix factorization through alternating minimization, resolving phase and scalar ambiguities. Compared to existing pilot-free schemes, the proposed method achieves a 13 dB improvement and favorable trade-offs in complexity and capacity performance when compared to benchmarks.

cs.IT↗

arXiv2025

Sparse Code Transceiver Design for Unsourced Random Access with Analytical Power Division in Gaussian MAC

In this work, we discuss the problem of unsourced random access (URA) over a Gaussian multiple access channel (GMAC). To address the challenges posed by emerging massive machine-type connectivity, URA reframes multiple access as a coding-theoretic problem. The sparse code-oriented schemes are highly valued because they are widely used in existing protocols, making their implementation require only minimal changes to current networks. However, drawbacks such as the heavy reliance on extrinsic feedback from powerful channel codes and the lack of transmission robustness pose obstacles to the development of sparse codes. To address these drawbacks, a novel sparse code structure based on a universally applicable power division strategy is proposed. Comprehensive numerical results validate the effectiveness of the proposed scheme. Specifically, by employing the proposed power division method, which is derived analytically and does not require extensive simulations, a performance improvement of approximately 2.8 dB is achieved compared to schemes with identical channel code setups.

cs.IT↗