arXiv subjects

Zeping Sui

Publications and source records attributed to Zeping Sui.

36 records · Page 2Linked to original sources

arXiv2026

OTFS-based Integrated Positioning and Communication Systems with Low-Resolution ADCs

This paper proposes a two-phase orthogonal time frequency space (OTFS)-based integrated positioning and communication (IPAC) framework under realistic low-resolution analog-to-digital converters (ADCs). In the uplink phase, the positioning signal is used to estimate channel parameters, which are subsequently used to determine the user's position. The spatial smoothing-multiple signal classification algorithm is introduced to estimate the angle-of-arrival, whereas an iterative interference cancellation scheme is conceived for the remaining parameters' estimation. The corresponding Cramer-Rao lower bounds of channel parameters and user position are also derived. During the downlink communication phase, the estimated parameters are exploited to improve beamforming at the base station. Simulation results evaluate the impact of ADC quantizer resolutions. Specifically, it is shown that enhanced downlink bit error rate performance can be achieved with improved uplink positioning, while the use of low-resolution ADCs induces noticeable performance degradation in the OTFS-IPAC system.

eess.SP↗

arXiv2026

Incentive Mechanism Design for Resource Management in Satellite Networks: A Comprehensive Survey

Resource management is one of the challenges in satellite networks due to their high mobility, wide coverage, long propagation distances, and stringent constraints on energy, communication, and computation resources. Traditional resource allocation approaches rely only on hard and rigid system performance metrics. Meanwhile, incentive mechanisms, which are based on game theory and auction theory, investigate systems from the "economic" perspective in addition to the "system" perspective. Particularly, incentive mechanisms are able to take into account rationality and other behavior of human users into account, which guarantees benefits/utility of all system entities, thereby improving the scalability, adaptability, and fairness in resource allocation. This paper presents a comprehensive survey of incentive mechanism design for resource management in satellite networks. The paper covers key issues in the satellite networks, such as communication resource allocation, computation offloading, privacy and security, and coordination. We conclude with future research directions including learning-based mechanism design for satellite networks.

cs.NI↗

arXiv2025

Two-Stage Distributionally Robust Optimization Framework for Secure Communications in Aerial-RIS Systems

This letter proposes a two-stage distributionally robust optimization (DRO) framework for secure deployment and beamforming in an aerial reconfigurable intelligent surface (A-RIS) assisted millimeter-wave system. To account for multi-timescale uncertainties arising from user mobility, imperfect channel state information (CSI), and hardware impairments, our approach decouples the long-term unmanned aerial vehicle (UAV) placement from the per-slot beamforming design. By employing the conditional value-at-risk (CVaR) as a distribution-free risk metric, a low-complexity algorithm is developed, which combines a surrogate model for efficient deployment with an alternating optimization (AO) scheme for robust real-time beamforming. Simulation results validate that the proposed DRO-CVaR framework significantly enhances the tail-end secrecy spectral efficiency and maintains a lower outage probability compared to benchmark schemes, especially under severe uncertainty conditions.

cs.IR↗

arXiv2025

On the Robustness of AFDM and OTFS Against Passive Eavesdroppers

We investigate the robustness of affine frequency division multiplexing (AFDM) and orthogonal time frequency space (OTFS) waveforms against passive eavesdroppers performing brute-force demodulation to intercepted signals, under the assumption that eavesdroppers have no knowledge of chirp parameters (in AFDM) or the delay-Doppler grid configuration (in OTFS), such that they must search exhaustively over possible demodulation matrices. Analytical results show that the brute-force complexity scales as $\mathcal{O}(\sqrt{N})$ for OTFS and $\mathcal{O}(N^2)$ for AFDM, where $N$ is the number of subcarriers, indicating that AFDM has superior resilience over OTFS. Bit error rate (BER) simulations confirm the analysis by showing that, with AFDM, the signal remains nearly undecodable at the eavesdropper, while OTFS allows partial signal recovery under equivalent conditions.

eess.SP↗

arXiv2025

Optimal Real-time Communication in 6G Ultra-Massive V2X Mobile Networks

This paper introduces a novel cooperative vehicular communication algorithm tailored for future 6G ultra-massive vehicle-to-everything (V2X) networks leveraging integrated space-air-ground communication systems. Specifically, we address the challenge of real-time information exchange among rapidly moving vehicles. We demonstrate the existence of an upper bound on channel capacity given a fixed number of relays, and propose a low-complexity relay selection heuristic algorithm. Simulation results verify that our proposed algorithm achieves superior channel capacities compared to existing cooperative vehicular communication approaches.

eess.SP↗

arXiv2025

Distributed Detection and Bandwidth Allocation with Hybrid Quantized and Full-Precision Observations over Multiplicative Fading Channels

A hybrid detector that fuses both quantized and full-precision observations is proposed for weak signal detection under additive and multiplicative Gaussian noise. We first derive a locally most powerful test (LMPT)--based hybrid detector from the composite probability distribution of the compound observations received by the fusion center, and then analyze its asymptotic detection performance. Subsequently, we optimize the sensor-wise quantization thresholds to achieve near-optimal asymptotic performance at the local sensor level. Moreover, we propose a mixed-integer linear programming approach to solve the optimization problem of transmission bandwidth allocation accounting for bandwidth constraints and error-prone channels. Finally, simulation results demonstrate the superiority of the proposed hybrid detector and the bandwidth allocation strategy, especially in challenging error-prone channel conditions.

eess.SP↗

arXiv2025

Generalized Spatial Modulation Aided Affine Frequency Division Multiplexing

Generalized spatial modulation-aided affine frequency division multiplexing (GSM-AFDM) is conceived for reliable multiple-input multiple-output (MIMO) communications over doubly selective channels. \textcolor{black}{We commence by proposing several low-complexity detectors for large-scale GSM-AFDM systems to meet the diverse requirements of heterogeneous receiver designs in terms of detection complexity and reliability.} Specifically, we introduce the linear minimum mean square error (LMMSE) equalizer-based maximum likelihood detector (LMMSE-MLD). By exploiting the GSM properties, we then derive the LMMSE-based transmit-antenna activation pattern (TAP) check-based log-likelihood ratio detector (LMMSE-TC-LLRD). In addition, we propose a pair of new detectors, namely the greedy residual check detector (GRCD) and the reduced space check detector (RSCD). We also derive a bit error rate (BER) upper-bound by considering the MLD. \textcolor{black}{Our analytical results are also available for multiple-input multiple-output (MIMO)-AFDM, since MIMO-AFDM can be regarded as a special case of the proposed GSM-AFDM.} Our simulation results demonstrate that 1) the BER upper bound derived is tight for moderate to high signal-to-noise ratios (SNRs), \textcolor{black}{2) the proposed GSM-AFDM achieves lower BER than its conventional orthogonal frequency division multiplexing (OFDM), orthogonal time frequency space (OTFS) and AFDM counterparts. Specifically, at a BER of $10^{-4}$ and a velocity of $540$ km/h, the proposed GSM-AFDM is capable of attaining about $6$ dB SNR gain compared to GSM-OFDM,} and 3) the conceived detectors strike a compelling trade-off between the BER and complexity.

eess.SP↗

arXiv2025

Energy Detection over Composite $κ-μ$ Shadowed Fading Channels with Inverse Gaussian Distribution in Ultra mMTC Networks

This paper investigates the characteristics of energy detection (ED) over composite $κ$-$μ$ shadowed fading channels in ultra machine-type communication (mMTC) networks. We have derived the closed-form expressions of the probability density function (PDF) of signal-to-noise ratio (SNR) based on the Inverse Gaussian (\emph{IG}) distribution. By adopting novel integration and mathematical transformation techniques, we derive a truncation-based closed-form expression for the average detection probability for the first time. It can be observed from our simulations that the number of propagation paths has a more pronounced effect on average detection probability compared to average SNR, which is in contrast to earlier studies that focus on device-to-device networks. It suggests that for 6G mMTC network design, we should consider enhancing transmitter-receiver placement and antenna alignment strategies, rather than relying solely on increasing the device-to-device average SNR.

eess.SP↗

arXiv2025

Generalized Tensor-Aided Channel Estimation for Hardware Impaired Device Identification

In this paper, we investigate the joint generalized channel estimation and device identification problem in Internet of Things (IoT) networks {under multipath propagation}. To fully utilize the received signal, we decompose the generalized channel into three components: transmitter hardware characteristics, path gains, and angles of arrival. By modelling the received signals as parallel factor (PARAFAC) tensors, we develop alternating least squares (ALS)-based algorithms to simultaneously estimate the generalized channels and identify the transmitters. Simulation results show that the proposed scheme outperforms {both Khatri-Rao Factorization (KRF) and the conventional least squares (LS) method} in terms of channel estimation accuracy and achieves performance close to the derived Cramer-Rao lower bound.

eess.SP↗

arXiv2025

Ambiguity-Free Broadband DOA Estimation Relying on Parameterized Time-Frequency Transform

An ambiguity-free direction-of-arrival (DOA) estimation scheme is proposed for sparse uniform linear arrays under low signal-to-noise ratios (SNRs) and non-stationary broadband signals. First, for achieving better DOA estimation performance at low SNRs while using non-stationary signals compared to the conventional frequency-difference (FD) paradigms, we propose parameterized time-frequency transform-based FD processing. Then, the unambiguous compressive FD beamforming is conceived to compensate the resolution loss induced by difference operation. Finally, we further derive a coarse-to-fine histogram statistics scheme to alleviate the perturbation in compressive FD beamforming with good DOA estimation accuracy. Simulation results demonstrate the superior performance of our proposed algorithm regarding robustness, resolution, and DOA estimation accuracy.

eess.SP↗

arXiv2025

Performance Analysis and Optimization of STAR-RIS-Aided Cell-Free Massive MIMO Systems Relying on Imperfect Hardware

Simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS)-aided cell-free massive multiple-input multiple-output (CF-mMIMO) systems are investigated under spatially correlated fading channels using realistic imperfect hardware. Specifically, the transceiver distortions, \textcolor{black}{time-varying phase noise, and RIS phase shift errors} are considered. Upon considering imperfect hardware and pilot contamination, we derive a linear minimum mean-square error (MMSE) criterion-based cascaded channel estimator. Moreover, a closed-form expression of the downlink ergodic spectral efficiency (SE) is derived based on maximum ratio (MR) based transmit precoding and channel statistics, where both a finite number of access points (APs) and STAR-RIS elements as well as imperfect hardware are considered. Furthermore, by exploiting the ergodic signal-to-interference-plus-noise ratios (SINRs) among user equipment (UE), a max-min fairness problem is formulated for the joint optimization of the passive transmitting and reflecting beamforming (BF) at the STAR-RIS as well as of the power control coefficients. An alternating optimization (AO) algorithm is proposed for solving the resultant problems, where iterative adaptive particle swarm optimization (APSO) and bisection methods are proposed for circumventing the non-convexity of the RIS passive BF and the quasi-concave power control sub-problems, respectively. Our simulation results illustrate that the STAR-RIS-aided CF-mMIMO system attains higher SE than its RIS-aided counterpart. The performance of different hardware parameters is also evaluated. Additionally, it is demonstrated that the SE of the worst UE can be significantly improved by exploiting the proposed AO-based algorithm compared to conventional solutions associated with random passive BF and equal-power scenarios.

cs.IT↗

arXiv2024

Multi-bit Distributed Detection of Sparse Stochastic Signals over Error-Prone Reporting Channels

We consider a distributed detection problem within a wireless sensor network (WSN), where a substantial number of sensors cooperate to detect the existence of sparse stochastic signals. To achieve a trade-off between detection performance and system constraints, multi-bit quantizers are employed at local sensors. Then, two quantization strategies, namely raw quantization (RQ) and likelihood ratio quantization (LQ), are examined. The multi-bit quantized signals undergo encoding into binary codewords and are subsequently transmitted to the fusion center via error-prone reporting channels. Upon exploiting the locally most powerful test (LMPT) strategy, we devise two multi-bit LMPT detectors in which quantized raw observations and local likelihood ratios are fused respectively. Moreover, the asymptotic detection performance of the proposed quantized detectors is analyzed, and closed-form expressions for the detection and false alarm probabilities are derived. Furthermore, the multi-bit quantizer design criterion, considering both RQ and LQ, is then proposed to achieve near-optimal asymptotic performance for our proposed detectors. The normalized Fisher information and asymptotic relative efficiency are derived, serving as tools to analyze and compensate for the loss of information introduced by the quantization. Simulation results validate the effectiveness of the proposed detectors, especially in scenarios with low signal-to-noise ratios and poor channel conditions.

eess.SP↗

arXiv2024

STAR-RIS-Aided Cell-Free Massive MIMO with Imperfect Hardware

This paper considers a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS)-aided cell-free massive multiple-input multiple-output (CF-mMIMO) system, accounting for imperfect hardware in spatially correlated fading channels. Specifically, we consider the hardware impairments and phase noise at transceivers, as well as the phase shift errors generated within the STAR-RIS. We commence by introducing the STAR-RIS signal model, channel model, and imperfect hardware components. Then, the linear minimum mean-square error (MMSE) channel estimate is derived with pilot contamination, which provides sufficient information for sequential data processing. Moreover, a channel capacity lower bound is derived in the case of a finite number of RIS elements and access points (APs), while a closed-form expression for the downlink ergodic spectral efficiency (SE) for maximum ratio (MR) precoding is also deduced, where only the channel statistics are used. Our numerical results demonstrate that the STAR-RIS-aided CF-mMIMO system achieves higher SE compared to the conventional CF-mMIMO system, even with imperfect hardware.

cs.IT↗

arXiv2024

RIS-Assisted Cell-Free Massive MIMO Relying on Reflection Pattern Modulation

We propose reflection pattern modulation-aided reconfigurable intelligent surface (RPM-RIS)-assisted cell-free massive multiple-input-multiple-output (CF-mMIMO) schemes for green uplink transmission. In our RPM-RIS-assisted CF-mMIMO system, extra information is conveyed by the indices of the active RIS blocks, exploiting the joint benefits of both RIS-assisted CF-mMIMO transmission and RPM. Since only part of the RIS blocks are active, our proposed architecture strikes a flexible energy \emph{vs.} spectral efficiency (SE) trade-off. We commence with introducing the system model by considering spatially correlated channels. Moreover, we conceive a channel estimation scheme subject to the linear minimum mean-square error (MMSE) constraint, yielding sufficient information for the subsequent signal processing steps. Then, upon exploiting a so-called large-scale fading decoding (LSFD) scheme, the uplink signal-to-interference-and-noise ratio (SINR) is derived based on the RIS ON/OFF statistics, where both maximum ratio (MR) and local minimum mean-square error (L-MMSE) combiners are considered. By invoking the MR combiner, the closed-form expression of the uplink SE is formulated based only on the channel statistics. Furthermore, we derive the total energy efficiency (EE) of our proposed RPM-RIS-assisted CF-mMIMO system. Additionally, we propose a chaotic sequence-based adaptive particle swarm optimization (CSA-PSO) algorithm to maximize the total EE by designing the RIS phase shifts. Finally, our simulation results demonstrate that the proposed RPM-RIS-assisted CF-mMIMO architecture strikes an attractive SE \emph{vs.} EE trade-off, while the CSA-PSO algorithm is capable of attaining a significant EE performance gain compared to conventional solutions.

eess.SP↗

arXiv2024

On the BER vs. Bandwidth-Efficiency Trade-offs in Windowed OTSM Dispensing with Zero-Padding

An orthogonal time sequency multiplexing (OTSM) scheme using practical signaling functions is proposed under strong phase noise (PHN) scenarios. By utilizing the transform relationships between the delay-sequency (DS), time-frequency (TF) and time-domains, we first conceive the DS-domain input-output relationship of our OTSM system, where the conventional zero-padding is discarded to increase the spectral efficiency. Then, the unconditional pairwise error probability is derived, followed by deriving the bit error ratio (BER) upper bound in closed-form. Moreover, we compare the BER performance of our OTSM system based on several practical signaling functions. Our simulation results demonstrate that the upper bound derived accurately predicts the BER performance in the case of moderate to high signal-to-noise ratios (SNRs), while harnessing practical window functions is capable of attaining an attractive out-of-band emission (OOBE) vs. BER trade-off.

cs.IT↗

arXiv2023

Space-Time Shift Keying Aided OTFS Modulation for Orthogonal Multiple Access

Space-time shift keying-aided orthogonal time frequency space modulation-based multiple access (STSK-OTFS-MA) is proposed for reliable uplink transmission in high-Doppler scenarios. As a beneficial feature of our STSK-OTFS-MA system, extra information bits are mapped onto the indices of the active dispersion matrices, which allows the system to enjoy the joint benefits of both STSK and OTFS signalling. Due to the fact that both the time-, space- and DD-domain degrees of freedom are jointly exploited, our STSK-OTFS-MA achieves increased diversity and coding gains. To mitigate the potentially excessive detection complexity, the sparse structure of the equivalent transmitted symbol vector is exploited, resulting in a pair of low-complexity near-maximum likelihood (ML) multiuser detection algorithms. Explicitly, we conceive a progressive residual check-based greedy detector (PRCGD) and an iterative reduced-space check-based detector (IRCD). Then, we derive both the unconditional single-user pairwise error probability (SU-UPEP) and a tight bit error ratio (BER) union-bound for our single-user STSK-OTFS-MA system employing the ML detector. Furthermore, the discrete-input continuous-output memoryless channel (DCMC) capacity of the proposed system is derived. The optimal dispersion matrices (DMs) are designed based on the maximum attainable diversity and coding gain metrics. Finally, it is demonstrated that our STSK-OTFS-MA system achieves both a lower BER and a higher DCMC capacity than its conventional spatial modulation (SM) {and its orthogonal frequency-division multiplexing (OFDM) counterparts. As a benefit, the proposed system strikes a compelling BER vs. system complexity as well as BER vs. detection complexity trade-offs.

cs.IT↗

arXiv2023

Performance Analysis and Approximate Message Passing Detection of Orthogonal Time Sequency Multiplexing Modulation

In orthogonal time sequency multiplexing (OTSM) modulation, the information symbols are conveyed in the delay-sequency domain upon exploiting the inverse Walsh Hadamard transform (IWHT). It has been shown that OTSM is capable of attaining a bit error ratio (BER) similar to that of orthogonal time-frequency space (OTFS) modulation at a lower complexity, since the saving of multiplication operations in the IWHT. Hence we provide its BER performance analysis and characterize its detection complexity. We commence by deriving its generalized input-output relationship and its unconditional pairwise error probability (UPEP). Then, its BER upper bound is derived in closed form under both ideal and imperfect channel estimation conditions, which is shown to be tight at moderate to high signal-to-noise ratios (SNRs). Moreover, a novel approximate message passing (AMP) aided OTSM detection framework is proposed. Specifically, to circumvent the high residual BER of the conventional AMP detector, we proposed a vector AMP-based expectation-maximization (VAMP-EM) detector for performing joint data detection and noise variance estimation. The variance auto-tuning algorithm based on the EM algorithm is designed for the VAMP-EM detector to further improve the convergence performance. The simulation results illustrate that the VAMP-EM detector is capable of striking an attractive BER vs. complexity trade-off than the state-of-the-art schemes as well as providing a better convergence. Finally, we propose AMP and VAMP-EM turbo receivers for low-density parity-check (LDPC)-coded OTSM systems. It is demonstrated that our proposed VAMP-EM turbo receiver is capable of providing both BER and convergence performance improvements over the conventional AMP solution.

cs.IT↗

arXiv2023

Low Complexity Detection of Spatial Modulation Aided OTFS in Doubly-Selective Channels

A spatial modulation-aided orthogonal time frequency space (SM-OTFS) scheme is proposed for high-Doppler scenarios, which relies on a low-complexity distance-based detection algorithm. We first derive the delay-Doppler (DD) domain input-output relationship of our SM-OTFS system by exploiting an SM mapper, followed by characterizing the doubly-selective channels considered. Then we propose a distance-based ordering subspace check detector (DOSCD) exploiting the \emph{a priori} information of the transmit symbol vector. Moreover, we derive the discrete-input continuous-output memoryless channel (DCMC) capacity of the system. Finally, our simulation results demonstrate that the proposed SM-OTFS system outperforms the conventional single-input-multiple-output (SIMO)-OTFS system, and that the DOSCD conceived is capable of striking an attractive bit error ratio (BER) vs. complexity trade-off.

cs.IT↗