pwc-archive/papers-with-abstracts huggingface dataset:
Low-Complex Waveform, Modulation and Coding Designs for 3GPP Ambient IoT
Authors: Mingxi Yin, Chao Wei, Kazuki Takeda, Yinhua Jia, Changlong Xu, Chengjin Zhang, Hao Xu
Date: 2025-01-15 00:00:00
Tasks: Management, TAG

This paper presents a comprehensive study on low-complexity waveform, modulation and coding (WMC) designs for the 3rd Generation Partnership Project (3GPP) Ambient Internet of Things (A-IoT). A-IoT is a low-cost, low-power IoT system inspired by Ultra High Frequency (UHF) Radio Frequency Identification (RFID) and aims to leverage existing cellular network infrastructure for efficient RF tag management. The paper compares the physical layer (PHY) design challenges and requirements of RFID and A-IoT, particularly focusing on backscatter communications. An overview of the standardization for PHY designs in Release 19 A-IoT is provided, along with detailed schemes of the proposed low-complex WMC designs. The performance of device-to-reader link designs is validated through simulations, demonstrating 6 dB improvements of the proposed baseband waveform with coherent receivers compared to RFID line coding-based solutions with non-coherent receivers when channel coding is adopted.
Efficient and Accurate Full-Waveform Inversion with Total Variation Constraint
Authors: Yudai Inada, Shingo Takemoto, Shunsuke Ono
Date: 2025-01-14 00:00:00
Tasks: Computational Efficiency

This paper proposes a computationally efficient algorithm to address the Full-Waveform Inversion (FWI) problem with a Total Variation (TV) constraint, designed to accurately reconstruct subsurface properties from seismic data. FWI, as an ill-posed inverse problem, requires effective regularizations or constraints to ensure accurate and stable solutions. Among these, the TV constraint is widely known as a powerful prior for modeling the piecewise smooth structure of subsurface properties. However, solving the optimization problem is challenging because of the nonlinear observation process combined with the non-smoothness of the TV constraint. Conventional methods rely on inner loops and/or approximations, which lead to high computational cost and/or inappropriate solutions. To address these limitations, we develop a novel algorithm based on a primal-dual splitting method, achieving computational efficiency by eliminating inner loops and ensuring high accuracy by avoiding approximations. We also demonstrate the effectiveness of the proposed method through experiments using the SEG/EAGE Salt and Overthrust Models. The source code will be available at https://www.mdi.c.titech.ac.jp/publications/fwiwtv.
Decision Transformers for RIS-Assisted Systems with Diffusion Model-Based Channel Acquisition
Authors: Jie Zhang, Yiyang Ni, Jun Li, Guangji Chen, Zhe Wang, Long Shi, Shi Jin, Wen Chen, H. Vincent Poor
Date: 2025-01-14 00:00:00
Tasks: Denoising, Imputation, Reinforcement Learning (RL)

Reconfigurable intelligent surfaces (RISs) have been recognized as a revolutionary technology for future wireless networks. However, RIS-assisted communications have to continuously tune phase-shifts relying on accurate channel state information (CSI) that is generally difficult to obtain due to the large number of RIS channels. The joint design of CSI acquisition and subsection RIS phase-shifts remains a significant challenge in dynamic environments. In this paper, we propose a diffusion-enhanced decision Transformer (DEDT) framework consisting of a diffusion model (DM) designed for efficient CSI acquisition and a decision Transformer (DT) utilized for phase-shift optimizations. Specifically, we first propose a novel DM mechanism, i.e., conditional imputation based on denoising diffusion probabilistic model, for rapidly acquiring real-time full CSI by exploiting the spatial correlations inherent in wireless channels. Then, we optimize beamforming schemes based on the DT architecture, which pre-trains on historical environments to establish a robust policy model. Next, we incorporate a fine-tuning mechanism to ensure rapid beamforming adaptation to new environments, eliminating the retraining process that is imperative in conventional reinforcement learning (RL) methods. Simulation results demonstrate that DEDT can enhance efficiency and adaptability of RIS-aided communications with fluctuating channel conditions compared to state-of-the-art RL methods.
Movable Antenna Enhanced DF and AF Relaying Systems: Performance Analysis and Optimization
Authors: Nianzu Li, Weidong Mei, Peiran Wu, Boyu Ning, Lipeng Zhu
Date: 2025-01-14 00:00:00
Tasks: Position

Movable antenna (MA) has been deemed as a promising technology to flexibly reconfigure wireless channels by adjusting the antenna positions in a given local region. In this paper, we investigate the application of the MA technology in both decode-and-forward (DF) and amplify-and-forward (AF) relaying systems, where a relay is equipped with multiple MAs to assist in the data transmission between two single-antenna nodes. For the DF relaying system, our objective is to maximize the achievable rate at the destination by jointly optimizing the positions of the MAs in two stages for receiving signals from the source and transmitting signals to the destination, respectively. To drive essential insights, we first derive a closed-form upper bound on the maximum achievable rate of the DF relaying system. Then, a low-complexity algorithm based on projected gradient ascent (PGA) and alternating optimization (AO) is proposed to solve the antenna position optimization problem. For the AF relaying system, our objective is to maximize the achievable rate by jointly optimizing the two-stage MA positions as well as the AF beamforming matrix at the relay, which results in a more challenging optimization problem due to the intricate coupling variables. To tackle this challenge, we first reveal the hidden separability among the antenna position optimization in the two stages and the beamforming optimization. Based on such separability, we derive a closed-form upper bound on the maximum achievable rate of the AF relaying system and propose a low-complexity algorithm to obtain a high-quality suboptimal solution to the considered problem. Simulation results validate the efficacy of our theoretical analysis and demonstrate the superiority of the MA-enhanced relaying systems to the conventional relaying systems with fixed-position antennas (FPAs) and other benchmark schemes.
Enhanced Sparse Bayesian Learning Methods with Application to Massive MIMO Channel Estimation
Authors: Arttu Arjas, Italo Atzeni
Date: 2025-01-14 00:00:00
Tasks: parameter estimation

We consider the problem of sparse channel estimation in massive multiple-input multiple-output systems. In this context, we propose an enhanced version of the sparse Bayesian learning (SBL) framework, referred to as enhanced SBL (E-SBL), which is based on a reparameterization of the original SBL model. Specifically, we introduce a scale vector that brings extra flexibility to the model, which is estimated along with the other unknowns. Moreover, we introduce a variant of E-SBL, referred to as modified E-SBL (M-E-SBL), which is based on a computationally more efficient parameter estimation. We compare the proposed E-SBL and M-E-SBL with the baseline SBL and with a method based on variational message passing (VMP) in terms of computational complexity and performance. Numerical results show that the proposed E-SBL and M-E-SBL outperform the baseline SBL and VMP in terms of mean squared error of the channel estimation in all the considered scenarios. Furthermore, we show that M-E-SBL produces results comparable with E-SBL with considerably cheaper computations.
Decentralized Learning with Approximate Finite-Time Consensus
Authors: Aaron Fainman, Stefan Vlaski
Date: 2025-01-14 00:00:00

The performance of algorithms for decentralized optimization is affected by both the optimization error and the consensus error, the latter of which arises from the variation between agents' local models. Classically, algorithms employ averaging and gradient-tracking mechanisms with constant combination matrices to drive the collection of agents to consensus. Recent works have demonstrated that using sequences of combination matrices that achieve finite-time consensus (FTC) can result in improved communication efficiency or iteration complexity for decentralized optimization. Notably, these studies apply to highly structured networks, where exact finite-time consensus sequences are known exactly and in closed form. In this work we investigate the impact of utilizing approximate FTC matrices in decentralized learning algorithms, and quantify the impact of the approximation error on convergence rate and steady-state performance. Approximate FTC matrices can be inferred for general graphs and do not rely on a particular graph structure or prior knowledge, making the proposed scheme applicable to a broad range of decentralized learning settings.
Tensor Train Discrete Grid-Based Filters: Breaking the Curse of Dimensionality
Authors: J. Matoušek, M. Brandner, J. Duník, I. Punčochář
Date: 2025-01-14 00:00:00
Tasks: State Estimation

This paper deals with the state estimation of stochastic systems and examines the possible employment of tensor decompositions in grid-based filtering routines, in particular, the tensor-train decomposition. The aim is to show that these techniques can lead to a massive reduction in both the computational and storage complexity of grid-based filtering algorithms without considerable tradeoffs in accuracy. This claim is supported by an algorithm descriptions and numerical illustrations.
Revisiting Split Covariance Intersection: Correlated Components and Optimality
Authors: Colin Cros, Pierre-Olivier Amblard, Christophe Prieur, Jean-François da Rocha
Date: 2025-01-14 00:00:00

Linear fusion is a cornerstone of estimation theory. Implementing optimal linear fusion requires knowledge of the covariance of the vector of errors associated with all the estimators. In distributed or cooperative systems, the cross-covariance terms cannot be computed, and to avoid underestimating the estimation error, conservative fusions must be performed. A conservative fusion provides a fused estimator with a covariance bound that is guaranteed to be larger than the true, but computationally intractable, covariance of the error. Previous research by Reinhardt \textit{et al.} proved that, if no additional assumption is made about the errors of the estimators, the minimal bound for fusing two estimators is given by a fusion called Covariance Intersection (CI). In distributed systems, the estimation errors contain independent and correlated terms induced by the measurement noises and the process noise. In this case, CI is no longer the optimal method. Split Covariance Intersection (SCI) has been developed to take advantage of the uncorrelated components. This paper extends SCI to also take advantage of the correlated components. Then, it is proved that the new fusion provides the optimal conservative fusion bounds for two estimators, generalizing the optimality of CI to a wider class of fusion schemes. The benefits of this extension are demonstrated in simulations.
Target Detection in OFDM-ISAC Systems: A Multipath Exploitation Approach
Authors: Xiaohan Lv, Rang Liu, Ming Li, Qian Liu
Date: 2025-01-14 00:00:00
Tasks: Diversity, Integrated sensing and communication, ISAC

This paper investigates the potential of multipath exploitation for enhancing target detection in orthogonal frequency division multiplexing (OFDM)-based integrated sensing and communication (ISAC) systems. The study aims to improve target detection performance by harnessing the diversity gain in the delay-Doppler domain. We propose a weighted generalized likelihood ratio test (GLRT) detector that effectively leverages the multipath propagation between the base station (BS) and the target. To further enhance detection accuracy, a joint optimization framework is developed for subcarrier power allocation at the transmitter and weight coefficients of the GLRT detector. The objective is to maximize the probability of target detection while satisfying constraints on total transmit power and the communication receiver's signal-to-noise ratio (SNR). An iterative algorithm based on the majorization-minimization (MM) method is employed to address the resulting non-convex optimization problem. Simulation results demonstrate the efficacy of the proposed algorithm and confirm the benefits of multipath exploitation for target detection in OFDM-ISAC systems under multipath-rich environments.
Deep Learning Waveform Channel Modeling for Wideband Optical Fiber Transmission: Model Comparisons, Challenges and Potential Solutions
Authors: Minghui Shi, Hang Yang, Zekun Niu, Chuyan Zeng, Junzhe Xiao, Yunfan Zhang, Mingzhe Chen, Weisheng Hu, Lilin Yi
Date: 2025-01-14 00:00:00

Fast and accurate waveform simulation is critical for understanding fiber channel characteristics, developing digital signal processing (DSP) technologies, optimizing optical network configurations, and advancing the optical fiber transmission system towards wideband. Deep learning (DL) has emerged as a powerful tool for waveform modeling, offering high accuracy and low complexity compared to traditional split-step Fourier method (SSFM), due to its strong nonlinear fitting capabilities and efficient parallel computation. However, most DL methods are designed for few-channel and low-rate WDM systems, leaving their scalability to wideband systems uncertain. Moreover, the lack of a standardized accuracy evaluation method and the inconsistent results between waveform errors and transmission performance errors, hinders fair comparisons of various DL schemes. In this paper, we introduce a DSP-assisted accuracy evaluation method integrated with nonlinear DSP, providing a fair benchmark for evaluating the accuracy of DL models. Using this method, we conduct a comprehensive comparison of DL schemes, ranging from simple configurations to more complex wideband setups. The feature decoupled distributed method combining with bidirectional long short-term memory achieves the better performance compared to other DL schemes. Furthermore, in scenarios with more-channel and higher-rate, the performance advantages of FDD-BiLSTM will be further improved. However, as the number of channels and symbol rates increase, the performance of FDD-BiLSTM still gradually deteriorate. We analyze these challenges from three perspectives: the more intricate linear and nonlinear effects, the higher sampling rate required for SSFM. To address these challenges, we discuss potential solutions from two aspects: incorporating more prior physical knowledge and optimizing the structure of DL models.
Atomic Norm Soft Thresholding for Sparse Time-frequency Representation
Authors: Zongyue Yang, Baoqing Ding, Shibin Wang, Chuang Sun, Xuefeng Chen
Date: 2025-01-14 00:00:00

Time-frequency (TF) representation of non-stationary signals typically requires the effective concentration of energy distribution along the instantaneous frequency (IF) ridge, which exhibits intrinsic sparsity. Inspired by the sparse optimization over continuum via atomic norm, a novel atomic norm soft thresholding for sparse TF representation (AST-STF) method is proposed, which ensures accurate TF localization under the strong duality. Numerical experiments demonstrate that the performance of the proposed method surpasses that of conventional methods.
Doubly-Dispersive MIMO Channels with Stacked Intelligent Metasurfaces: Modeling, Parametrization, and Receiver Design
Authors: Kuranage Roche Rayan Ranasinghe, Iván Alexander Morales Sandoval, Hyeon Seok Rou, Giuseppe Thadeu Freitas de Abreu, George C. Alexandropoulos
Date: 2025-01-13 00:00:00
Tasks: ISAC

Introduced with the advent of statistical wireless channel models for high mobility communications and having a profound role in communication-centric (CC) integrated sensing and communications (ISAC), the doubly-dispersive (DD) channel structure has long been heralded as a useful tool enabling the capture of the most important fading effects undergone by an arbitrary time-domain transmit signal propagating through some medium. However, the incorporation of this model into multiple-input multiple-output (MIMO) system setups, relying on the recent paradigm-shifting transceiver architecture based on stacked intelligent metasurfaces (SIM), in an environment with reconfigurable intelligent surfaces (RISs) remains an open problem due to the many intricate details that have to be accounted for. In this paper, we fill this gap by introducing a novel DD MIMO channel model that incorporates an arbitrary number of RISs in the ambient, as well as SIMs equipping both the transmitter and receiver. We then discuss how the proposed metasurfaces-parametrized DD (MPDD) channel model can be seamlessly applied to waveforms that are known to perform well in DD environments, namely, orthogonal frequency division multiplexing (OFDM), orthogonal time frequency space (OTFS), and affine frequency division multiplexing (AFDM), with each having their own inherent advantages and disadvantages. An illustrative application of the programmable functionality of the proposed model is finally presented to showcase its potential for boosting the performance of the aforementioned waveforms. Our numerical results indicate that the design of waveforms suitable to mitigating the effects of DD channels is significantly impacted by the emerging SIM technology.
Signal Processing Challenges in Automotive Radar
Authors: Sandeep Rao, Rajan Narasimha, Shunqiao Sun
Date: 2025-01-13 00:00:00

As automotive radars continue to proliferate, there is a continuous need for improved performance and several critical problems that need to be solved. All of this is driving research across industry and academia. This paper is an overview of research areas that are centered around signal processing. We discuss opportunities in the area of modulation schemes, interference avoidance, spatial resolution enhancement and application of deep learning. A rich list of references is provided. This paper should serve as a useful starting point for signal processing practitioners looking to work in the area of automotive radars.
Dual-Function Beamforming Design For Multi-Target Localization and Reliable Communications
Authors: Bo Tang, Da Li, Wenjun Wu, Astha Saini, Prabhu Babu, Petre Stoica
Date: 2025-01-13 00:00:00

This paper investigates the transmit beamforming design for multiple-input multiple-output systems to support both multi-target localization and multi-user communications. To enhance the target localization performance, we derive the asymptotic Cram\'{e}r-Rao bound (CRB) for target angle estimation by assuming that the receive array is linear and uniform. Then we formulate a beamforming design problem based on minimizing an upper bound on the asymptotic CRB (which is shown to be equivalent to {maximizing} the harmonic mean of the weighted beampattern responses at the target directions). Moreover, we impose a constraint on the SINR of each received communication signal to guarantee reliable communication performance. Two iterative algorithms are derived to tackle the non-convex design problem: one is based on the alternating direction method of multipliers, and the other uses the majorization-minimization technique to solve an equivalent minimax problem. Numerical results show that, through elaborate dual-function beamforming matrix design, the proposed algorithms can simultaneously achieve superior angle estimation performance as well as high-quality multi-user communications.
Reducing Latency by Eliminating CSIT Feedback: FDD Downlink MIMO Precoding Without CSIT Feedback for Internet-of-Things Communications
Authors: Juntaek Han, Namhyun Kim, Jeonghun Park
Date: 2025-01-13 00:00:00
Tasks: Fairness

This paper presents a novel framework for low-latency frequency division duplex (FDD) multi-input multi-output (MIMO) transmission with Internet of Things (IoT) communications. Our key idea is eliminating feedback associated with downlink channel state information at the transmitter (CSIT) acquisition. Instead, we propose to reconstruct downlink CSIT from uplink reference signals by exploiting the frequency invariance property on channel parameters. Nonetheless, the frequency disparity between the uplink and downlink makes it impossible to get perfect downlink CSIT, resulting in substantial interference. To address this, we formulate a max-min fairness problem and propose a rate-splitting multiple access (RSMA)-aided efficient precoding method. In particular, to fully harness the potential benefits of RSMA, we propose a method that approximates the error covariance matrix and incorporates it into the precoder optimization process. This approach effectively accounts for the impact of imperfect CSIT, enabling the design of a robust precoder that efficiently handles CSIT inaccuracies. Simulation results demonstrate that our framework outperforms other baseline methods in terms of the minimum spectral efficiency when no direct CSI feedback is used. Moreover, we show that our framework significantly reduces communication latency compared to conventional CSI feedback-based methods, underscoring its effectiveness in enhancing latency performance for IoT communications.
Effective DoF-Oriented Optimal Antenna Spacing in Near-Field XL-MIMO Systems
Authors: Xianzhe Chen, Hong Ren, Cunhua Pan, Zhangjie Peng, Jiangzhou Wang
Date: 2025-01-13 00:00:00

This letter investigates the optimal antenna spacing for a near-field XL-MIMO communication system from the perspective of the array gain. Specifically, using the Green's function-based channel model, the letter analyzes the channel capacity, which is related to the effective degrees-of-freedom (EDoF). Then, the letter further investigates the applicability of two EDoF estimation methods. To increase EDoF, this letter focuses on analyzing the impact of antenna spacing. Furthermore, from the perspective of the array gain, the letter derives an approximate closed-form expression of the optimal antenna spacing, at which EDoF is maximized and the array gain at the antenna nearest to the focused antenna of the transmit array becomes zero. Finally, numerical results verify the main results of this letter.
Gaussian Integral based Bayesian Smoother
Authors: Rohit Kumar Singh, Kundan Kumar, Shovan Bhaumik
Date: 2025-01-12 00:00:00
Tasks: State Space Models

This work introduces the Gaussian integration to address a smoothing problem of a nonlinear stochastic state space model. The probability densities of states at each time instant are assumed to be Gaussian, and their means and covariances are evaluated by utilizing the odd-even properties of Gaussian integral, which are further utilized to realize Rauch-Tung-Striebel (RTS) smoothing expressions. Given that the Gaussian integration provides an exact solution for the integral of a polynomial function over a Gaussian probability density function, it is anticipated to provide more accurate results than other existing Gaussian approximation-based smoothers such as extended Kalman, cubature Kalman, and unscented Kalman smoothers, especially when polynomial types of nonlinearity are present in the state space models. The developed smoothing algorithm is applied to the Van der Pol oscillator, where the nonlinearity associated with their dynamics is represented using polynomial functions. Simulation results are provided to demonstrate the superiority of the proposed algorithm.