SearcharxivSearch

arXiv subjects

Tianfu Qi

Publications and source records attributed to Tianfu Qi.

11 recordsLinked to original sources

Generator-Guided Inverse Sampling for Lévy-Driven Generative Models

This paper studies inverse sampling for Lévy-driven generative models from the perspective of Markov generators. Unlike conventional diffusion models, Lévy-driven dynamics involve infinite jump activities, which makes their reverse process nonlocal and difficult to characterize using score information alone. We address this challenge by analyzing the forward and reversed generators. It is derived that the reversed jump component generally becomes a state-dependent Markov jump process governed by a nonlocal density ratio. This observation motivates a structured reverse sampler that decomposes the dynamics into diffusion, small jump, and large jump components. Based on this characterization, we develop a computationally tractable sampler for a class of isotropic linear Lévy SDEs with symmetric $α$-stable jump components. For the jump component, the neural network is used only to amortize the rate of large jump activities, while jump amplitudes are generated from analytically derived conditional distributions, which improves interpretability and controllability. Efficient implementation techniques are further introduced under this setting to avoid expensive high-dimensional integration and sampling. The sampler is further adapted to approximate observation-guided sampling and applied to OFDM-SISO channel estimation under mixed Gaussian and impulsive noise. Simulations show robust estimation performance with a favorable tradeoff between complexity and performance.

cs.LG

Unsupervised Online Channel Estimation for High-Mobility OFDM via Implicit Neural Representation

Accurate channel estimation remains challenging in high-mobility wireless systems because Doppler shifts induce severe inter-carrier interference (ICI) in Orthogonal Frequency Division Multiplexing (OFDM). We propose an unsupervised online channel estimation framework based on Implicit Neural Representation (INR). Unlike discrete-grid estimators, the proposed method decouples channel representation from the OFDM sampling resolution by modeling the time-varying frequency-selective channel as a continuous function of time-frequency coordinates. A Sinusoidal Representation Network (SIREN) with Gaussian Fourier feature mapping captures fine-grained channel variations and high-frequency details without offline pre-training or labeled data. For each received slot, the network parameters are updated by per-slot online fitting that minimizes a physics-aware ICI loss, while a confidence-aware decision-directed loop balances reliable pilots and dynamically harvested pseudo-pilots. Simulations in realistic Vehicle-to-Everything (V2X) environments show that the proposed method achieves near-optimal link-level reliability, significantly outperforming Least Squares (LS) and robust Linear Minimum Mean Square Error (LMMSE) estimators. Compared with supervised deep learning baselines, it also exhibits strong out-of-distribution (OOD) robustness under environmental distribution shifts, establishing an adaptable data-efficient physical-layer paradigm.

eess.SP

Capacity Bounds and Low-Complexity Constellation Shaping under Mixed Gaussian-Impulsive Noise

This paper investigates the bounds on channel capacity and constellation shaping under memoryless mixed noise, which is composed of impulsive noise (IN) and white Gaussian noise (WGN). The capacity bounds are derived using the entropy power inequality and the dual expression of capacity. It is then shown that the proposed lower and upper bounds asymptotically converge to the true channel capacity, and the analytic asymptotic capacity expression is obtained. Leveraging this property, we design a low-complexity constellation shaping method that operates without iterative procedures. Simulation results demonstrate that the derived bounds are remarkably tight, and the shaped constellation achieves the highest mutual information among all considered baseline schemes.

cs.IT

Channel Polarization under Channel Noise with Memory

The channel polarization behavior of polar codes under noise with memory is investigated. By introducing a genie-aided channel model, we first show that the polarized subchannels still converge to extremal channels under the standard polar coding framework. More importantly, we explicitly quantify the gap between the mutual information achieved by ignoring memory effects and the actual capacity attained after sufficient polarization. It is proven that the channel capacity remains achievable even without prior knowledge of the channel noise. Furthermore, we demonstrate that the polarization rate is slower than that in the binary-input memoryless channel (BMC) case, provided that the channel transition function satisfies certain conditions. In particular, the Bhattacharyya parameter is asymptotically upper-bounded and lower-bounded by a polynomial function and an exponential function with respect to the block length, respectively.

cs.IT

Cutoff Rate Bounds and Constellation Shaping under Mixed Gaussian-Impulsive Noise

Mixed noise, composed of white Gaussian noise (WGN) and impulsive noise (IN), appears in numerous communication scenarios and can severely degrade system performance. In this paper, we optimize the transmitted constellation under mixed noise based on a theoretical analysis of the cutoff rate (CR). First, starting from the passband model of the mixed noise, we derive its corresponding baseband representation. Then, the baseband model is employed to obtain closed-form lower and upper bounds of the CR. A piecewise linear approximation is applied to derive efficient bounds by exploiting the algebraic properties of the integral terms. These bounds are then used as criteria to optimize the transmitted constellation points in both geometric positions and probabilistic distributions. The projected gradient method is employed to solve the optimization problem, and the convergence and properties of the solutions are analyzed. Numerical results demonstrate that the proposed CR bounds are tight and exhibit the expected asymptotic behavior. Furthermore, the optimized constellation scheme achieves a significant rate improvement compared to baselines.

eess.SP

Polarization Decomposition and Its Applications

The polarization decomposition of arbitrary binary-input memoryless channels (BMCs) is studied in this work. By introducing the polarization factor (PF), defined in terms of the conditional entropy of the channel output under various input configurations, we demonstrate that the symmetric capacities of the polarized subchannels can be uniformly expressed as functions of the PF. The explicit formulation of the PF as a function of the block length and subchannel index is derived. Furthermore, an efficient algorithm is proposed for the computation of the PF. Notably, we establish a one-to-one correspondence between each PF and an $n$-ary tree. Leveraging this tree structure, we develop a pruning method to determine the conditional entropy associated with different input relationships. The proposed polarization framework offers both theoretical insights and practical advantages, including intuitive visualization of polarization behavior and efficient polar code construction. To the best of our knowledge, this is the first approach that enables the efficient computation of symmetric capacities for all subchannels in arbitrary BMCs.

cs.IT

Communications under Bursty Mixed Gaussian-impulsive Noise: Demodulation and Performance Analysis

This is the second part of the two-part paper considering the communications under the bursty mixed noise composed of white Gaussian noise and colored non-Gaussian impulsive noise. In the first part, based on Gaussian distribution and student distribution, we proposed a multivariate bursty mixed noise model and designed model parameter estimation algorithms. However, the performance of a communication system will significantly deteriorate under the bursty mixed noise if a conventional signal detection algorithm with respect to Gaussian noise is applied. To address this issue, in the second part, we leverage the probability density function (PDF) to derive the maximum likelihood (ML) demodulation methods for both linear and nonlinear modulations, including M-array PSK (M-PSK) and MSK modulation schemes. We analyze the theoretical bit error rate (BER) performance of M-PSK and present close-form BER expressions. For the MSK demodulation based on the Viterbi algorithm, we derive a lower and upper bound of BER. Simulation results showcase that the proposed demodulation methods outperform baselines by more than 2.5dB when the BER performance reaches the order of magnitude of $10^{-3}$, and the theoretical analysis matches the simulated results well.

eess.SP

A Statistical Model of Bursty Mixed Gaussian-impulsive Noise: Model and Parameter Estimation

Non-Gaussian impulsive noise (IN) with memory exists in many practical applications. When it is mixed with white Gaussian noise (WGN), the resultant mixed noise will be bursty. The performance of communication systems will degrade significantly under bursty mixed noise if the bursty characteristic is ignored. A proper model for the bursty mixed noise and corresponding algorithms needs to be designed to obtain desirable performance but there is no such model reported to the best of our knowledge. The important problem is addressed in the two-part paper. In the first part, we propose a closed-form heavy-tailed multivariate probability density function (PDF) that to model the bursty mixed noise. This model is the weighted addition of gaussian distribution and student distribution. Then, we present the parameter estimation method based on the empirical characteristic function of the proposed model and analyze the performance of the parameter estimation. Numerical results show that our proposed bursty mixed noise model matches the measured bursty noise well. Meanwhile, the parameters of the proposed noise model can be accurately estimated in terms of mean square error (MSE).

eess.SP

Communication under Mixed Gaussian-Impulsive Channel: An End-to-End Framework

In many communication scenarios, the communication signals simultaneously suffer from white Gaussian noise (WGN) and non-Gaussian impulsive noise (IN), i.e., mixed Gaussian-impulsive noise (MGIN). Under MGIN channel, classical communication signal schemes and corresponding detection methods usually can not achieve desirable performance as they are optimized with respect to WGN. Moreover, as the widely adopted IN model has no analytical and general closed-form expression of probability density function (PDF), it is extremely hard to obtain optimal communication signal and corresponding detection schemes based on classical stochastic signal processing theory. To circumvent these difficulties, we propose a data-driven end-to-end framework to address the communication signal design and detection under MGIN channel in this paper. In this proposed framework, a channel noise simulator (CNS) is elaborately designed based on an improved generative adversarial net (GAN) to simulate the MGIN without requirement of any analytical PDF. Meanwhile, a multi-level wavelet convolutional neural network (MWCNN) based preprocessing network is used to mitigate the negative effect of outliers due to the IN. Compared with conventional approaches and existing end-to-end systems, extensive simulation results verify that our proposed novel end-to-end communication system can achieve better performance in terms of bit-error rate (BER) under MGIN environments.

eess.SP

Parameter Estimation of Mixed Gaussian-Impulsive Noise: An U-net++ Based Method

In many scenarios, the communication system suffers from both Gaussian white noise and non-Gaussian impulsive noise. In order to design optimal signal detection method, it is necessary to estimate the parameters of mixed Gaussian-impulsive noise. Even though this issue can be well tackled with respect to pure mixed noise, it is quite challenging based on the received single-channel signal including both transmitting signal and mixed noise. To mitigate the negative impact of transmitting signal, we propose a parameter estimation method by utilizing a neural network, namely U-net++, to separate the mixed noise from the received single-channel signal. Compared with existing blind source separation based methods, simulation results show that our proposed method can obtain rather better performance in terms of estimation accuracy and robustness under various scenarios.

eess.SP

Knowledge Graph Based Waveform Recommendation: A New Communication Waveform Design Paradigm

Traditionally, a communication waveform is designed by experts based on communication theory and their experiences on a case-by-case basis, which is usually laborious and time-consuming. In this paper, we investigate the waveform design from a novel perspective and propose a new waveform design paradigm with the knowledge graph (KG)-based intelligent recommendation system. The proposed paradigm aims to improve the design efficiency by structural characterization and representations of existing waveforms and intelligently utilizing the knowledge learned from them. To achieve this goal, we first build a communication waveform knowledge graph (CWKG) with a first-order neighbor node, for which both structured semantic knowledge and numerical parameters of a waveform are integrated by representation learning. Based on the developed CWKG, we further propose an intelligent communication waveform recommendation system (CWRS) to generate waveform candidates. In the CWRS, an improved involution1D operator, which is channel-agnostic and space-specific, is introduced according to the characteristics of KG-based waveform representation for feature extraction, and the multi-head self-attention is adopted to weigh the influence of various components for feature fusion. Meanwhile, multilayer perceptron-based collaborative filtering is used to evaluate the matching degree between the requirement and the waveform candidate. Simulation results show that the proposed CWKG-based CWRS can automatically recommend waveform candidates with high reliability.

eess.SP