Bingcong Li, Yilang Zhang, Georgios B. Giannakis
Low-rank adaptation (LoRA) has emerged as the de facto standard for parameter-efficient fine-tuning (PEFT) of foundation models, enabling the adaptation of billion-parameter networks with minimal computational and memory overhead. Despite its empirical success and rapid proliferation of variants, it remains elusive which architectural choices, optimization techniques, and deployment constraints should guide practical method selection. This overview revisits LoRA through the lens of signal processing (SP), bridging modern adapter designs with classical low-rank modeling tools and inverse problems, as well as highlighting how SP principles can inform principled advances of fine-tuning approaches. Rather than providing a comprehensive enumeration and empirical comparisons of LoRA variants, emphasis is placed on the technical mechanisms underpinning these approaches to justify their effectiveness. These advances are categorized into three complementary axes: architectural design, efficient optimization, and pertinent applications. The first axis builds on singular value decomposition (SVD)-based factorization, rank-augmentation constructions, and cross-layer tensorization, while the second axis deals with initialization, alternating solvers, gauge-invariant optimization, and parameterization-aware methods. Beyond fine-tuning, emerging applications of LoRA are accounted across the entire lifecycle of large models, ranging from pre- and post-training to serving/deployment. Finally, open research directions are outlined at the confluence of SP and deep learning to catalyze a bidirectional frontier: classical SP tools provide a principled vocabulary for designing principled PEFT methods, while the unique challenges facing modern deep learning, especially the overwhelming scale and prohibitive overhead, also offer new research lines benefiting the SP community in return.
Hidir Selcuk Nogay
Electric arc welding (EAW) exhibits strongly non stationary and temporally evolving behavior, making reliable assessment of arc stability difficult using conventional frame based approaches. In this study, arc dynamics are modeled as a sequence of latent operational regimes within a probabilistic state-space framework. The welding current signal is transformed into a time-frequency domain using Short-Time Fourier Transform (STFT), and a set of physically meaningful spectral descriptors, including energy, entropy, and centroid, is extracted to construct the observation sequence. A Hidden Markov Model (HMM) is employed to capture temporal dependencies and estimate the evolution of arc states. The analysis reveals three dominant regimes, transient, stable, and extinction, with a clear monotonic increase in spectral energy and a corresponding decrease in entropy, indicating reduced variability under stable conditions. Despite partial overlap in the feature space, the inferred state sequence exhibits strong temporal coherence, supported by high state persistence and low transition rates. These findings highlight the limitations of static classification and emphasize the importance of temporal modeling. The proposed framework provides an interpretable and physically consistent representation of arc behavior, enabling more realistic monitoring and analysis of stability dynamics in welding processes.
Eli Gildish, Michael Grebshtein, Igor Makienko
Denoising of periodic signals and accurate waveform estimation are core tasks across many signal processing domains, including speech, music, medical diagnostics, radio, and sonar. Although deep learning methods have recently shown performance improvements over classical approaches, they require substantial computational resources and are usually trained separately for each signal observation. This study proposes a computationally efficient method based on DCNN and Re-sampling, termed R-DCNN, designed for operation under strict power and resource constraints. The approach targets signals with varying fundamental frequencies and requires only a single observation for training. It generalizes to additional signals via a lightweight resampling step that aligns time scales in signals with different frequencies to re-use the same network weights. Despite its low computational complexity, R-DCNN achieves performance comparable to state-of-the-art classical methods, such as autoregressive (AR)-based techniques, as well as conventional DCNNs trained individually for each observation. This combination of efficiency and performance makes the proposed method particularly well suited for deployment in resource-constrained environments without sacrificing denoising or estimation accuracy.
Mohammad Almuhaihi, Dennis Bernstein
In many applications of state estimation, the process noise is colored; this case is addressed by applying the standard Kalman filter (KF) to dynamics that are augmented with the coloring dynamics. The present paper considers the case where the coloring dynamics are unknown, which renders the estimates obtained from the standard approach suboptimal. To address this problem, the present paper proposes an adaptive technique based on the principle that, if the measurement noise is white, then the innovations sequence is white if and only if the process noise is white. Leveraging this fact, an Innovations-Whitening Adaptive Kalman Filter (IWAKF) is developed, which learns the process-noise coloring online. By embedding an unknown coloring filter in a state-augmentation framework, IWAKF adapts its parameters by minimizing the empirical autocorrelation of the innovations, thereby driving them toward whiteness and restoring near-optimality without prior knowledge of the coloring dynamics.
Yuxuan Xia, Kuo-Chu Chang, Xueqi Qiu, Lin Gao, Chaoqun Yang, Ting Yuan
PRIMEX (prime-based graph encoding and extraction) is a recently proposed framework for scalable distributed fusion. In PRIMEX, the information pedigree of state estimates or probability density functions is encoded using the information codes, enabling lightweight arithmetic for redundancy removal and data integration. Building on PRIMEX and its memoryless fusion strategy based on a least-squares approximation, in this paper we present two efficient distributed tracking algorithms: a consensus-based PRIMEX method that fuses information from all neighbors, and a greedy gossip-based PRIMEX method that fuses with the most informative neighbor. To further increase communication efficiency, we incorporate an event-triggered mechanism, in which transmission decisions are driven by information novelty measured using differences between the information codes. The proposed methods are evaluated and compared with covariance intersection and centralized fusion in a distributed single target tracking scenario. Simulation results show that PRIMEX-based methods remain competitive in tracking accuracy while improving communication efficiency.
Jiahui Liang, Shuoyao Wang, Shijian Gao
Efficient beam alignment is fundamental to high-throughput and reliable connectivity in Vehicle-to-Everything (V2X) systems. However, conventional beam management in dynamic vehicular topologies incurs prohibitive alignment overhead and struggles to maintain robust links under rapid mobility. To overcome these challenges, this paper proposes a distributed multimodal graph beam alignment (GBA) framework. The core innovation lies in leveraging onboard multimodal sensing data to predict implicit feedback while employing graph neural networks to coordinate multi-user alignment, thereby jointly enhancing scalability and drastically reducing overhead. The architecture adopts a dual-network design with GBA-RSU and GBA-Vehicle units, optimized through a hybrid strategy of centralized learning and federated learning (FL) to balance global performance with local privacy. Furthermore, a dedicated data augmentation (DA) scheme is introduced to address multimodal data imbalance issues in vehicular networks. Negative augmentation applies dominant modality dropout to bolster robustness, while positive augmentation generates underrepresented samples to mitigate label imbalance. Numerical results demonstrate that GBA maintains a competitive sum rate on par with high-resolution codebook-based feedback yet reduces beam alignment overhead by over 90\% and scales efficiently in mobile scenarios. Notably, integrating DA enables GBA to consistently outperform state-of-the-art FL-based alignment benchmarks, with particularly pronounced gains under severe label and modality imbalance, establishing a practical solution for V2X beam management.
Animesh Patra, Ankur Raina
Apr 23, 2026·quant-ph·PDF High-fidelity control of superconducting qubits requires carefully shaped microwave pulses that account for multiple error channels. In this work, we present a pedagogical introduction to pulse-shaping techniques for transmon qubits, aiming to provide a unified, accessible framework that integrates physical intuition for pulse design, analytical understanding of gate-level descriptions, and practical considerations of hardware. This article further aims to serve as a guide for students and early researchers entering superconducting quantum computing. We begin by examining simple pulse envelopes and their spectral properties, highlighting how finite bandwidth leads to leakage outside the computational subspace. These observations motivate the introduction of the derivative removal by adiabatic gate (DRAG) technique, which uses a quadrature component proportional to the pulse's time derivative to suppress off-resonant excitations. We analyze the single-qubit case using the Magnus expansion, which provides a clear understanding of the order-by-order introduction of error channels. We discuss the practical hardware realities of control pulse generation, focusing on arbitrary waveform generators (AWG), local oscillators (LO), and IQ mixing. Common imperfections are discussed in terms of their impact on the effective pulse shape and qubit Hamiltonian. Finally, we extend the discussion to two-qubit operations, focusing on the cross-resonance gate and the emergence of effective interactions.
Ke Ma, Feng Wang, Lihui Lei, Shu Tan
Deep learning-based channel estimation has been recognized as a promising technique for sixth-generation wireless systems. However, most existing approaches rely solely on least-squares estimates obtained from demodulation reference signals, which fail to explicitly exploit channel time-frequency correlation parameters. Inspired by the independent channel parameter estimation enabled by semi-static reference signals in modern wireless systems, this letter presents a parameter-aware deep learning-based channel estimation framework termed HyperCEUNet. Specifically, the proposed hypernetwork generates an adaptive front-end convolutional layer based on estimated channel parameters, serving as a pre-filtering stage before the UNet-based estimator. In addition, the Wiener-filtered channel estimates are adopted to provide a correlation-aware initialization for data resources. Simulation results demonstrate that our proposed HyperCEUNet effectively improves channel estimation accuracy compared with its conventional counterparts.
Dogon Kim, Hyunmin Noh, Seok-Hwan Park
With the evolution of multiple-input multiple-output (MIMO) technology toward extremely large (XL) MIMO systems comprising hundreds of, or more, antennas, this work investigates scalable and fronthaul-efficient reception design for the uplink of cell-free (CF) XL-MIMO systems. In such systems, the uplink signals transmitted by mobile user equipments (UEs) are jointly decoded at a central processing unit (CPU) connected to distributed access points (APs) via finite-capacity fronthaul links. We address the joint optimization of linear transform matrices, used by the APs to reduce the signal dimension and fronthaul load, and fronthaul compression strategies to maximize the uplink sumrate. A fractional programming (FP)-based iterative algorithm is first developed, followed by a reduced-complexity variant, termed accelerated FP (A-FP), along with its decentralized implementation whose fronthaul overhead remains independent of the number of AP antennas. Numerical results show that the proposed A-FP scheme significantly reduces computational complexity compared to FP implemented with general-purpose solvers, while substantially outperforming scalable baseline schemes that rely solely on local channel state information.
Thodoris Spanos, Nikolaos Papageorgiou, Samuele Fantinato, Nikos Kanistras, Sergi Duenas Pedrosa, Gianluca Caparra, Vassilis Paliouras
Precise positioning is a key enabler for emerging 5G applications, from autonomous transport to industrial automation. Yet the open physical layer (PL) leaves standard positioning reference signals (PRSs) vulnerable to manipulation. This work addresses the security of downlink observed time difference of arrival positioning (DL-OTDOA) through three contributions. First, we introduce VeriLoc, an open-source system-level simulator designed for realistic channel modeling and PL threat injection. Second, we propose three novel security techniques to enhance resilience and threat detection: encrypted PRS to prevent adversarial waveform synthesis, angular-based source authentication (ABSA), and a cross-layer downlink-uplink handshaking protocol to detect attacks that cannot be mitigated by encryption. Third, utilizing VeriLoc, we evaluate the proposed techniques alongside position tracking and a PRS authentication scheme, which extends the original hash-based message authentication code (HMAC) scheme design to support digital signatures. Simulation results demonstrate that while encryption, authentication schemes, and tracking robustly counter selective PRS spoofing and jamming, the proposed spatial and cross-layer mechanisms are essential for detecting meaconing, collectively maintaining attack detection rates in excess of 90% while keeping false alarm rates minimal.
Vishnu Teja Kunde, Alessandro Mirri, Jean-Francois Chamberland, Enrico Paolini
Approximate Message Passing (AMP) is a general framework for iterative algorithms, originally developed for compressed sensing and later extended to a wide range of high-dimensional inference problems. Although recent work has advanced matrix AMP, complex AMP, and AMP for non-separable functions independently, a unified state evolution theory for complex AMP with non-separable denoisers has been lacking. This article fills that gap by establishing state evolution in the setting of complex, non-separable denoising functions. The proposed approach constructs an augmented real-valued system that lifts the problem to a higher-dimensional space, then recovers the complex domain through a many-to-one canonical transformation. Under this construction, the Onsager correction naturally involves Wirtinger derivatives, and the resulting state evolution reduces to scalar complex recursions despite the non-separable structure of the denoisers. The framework extends to the matrix-valued setting, accommodating multiple feature vectors simultaneously. This generalization enables AMP to exploit joint structural constraints, such as simultaneous group and element sparsity, in complex-valued recovery problems. The complex sparse group least absolute shrinkage and selection operator (LASSO) serves as a key instantiation, motivated by preamble detection in Orthogonal Time-Frequency Space (OTFS)-based unsourced random access. Numerical experiments confirm that state evolution accurately predicts performance and show that complex non-separable denoising can produce significant gains over separable and real-valued alternatives.
Tyler Ikehara, Ibrahim Pehlivan, Danijela Cabric, Thomas L. Marzetta
The FR3 band has emerged as the major focus of 6G wireless research. FR3 cellular operation presents the challenge of extreme bandwidth combined with physically large antenna arrays. In this regime, conventional phase-shift beamforming entails a loss of coherence (beam-squint), and has to be replaced by true time delay beamforming (TTD). It happens that TTD is mathematically equivalent to taking the Radon transform of the space/time measurements. We exploit fifty years of research in the application of the Radon transform to computer tomography and to seismic exploration to elucidate the workings of TTD. We use the Radon transform combined with semblance detection and Radon slowness filtering to remove far-field signals from the measured space/time signals from a linear array, leaving only near-field signals. In turn we partition the array into sub-arrays. For each sub-array we estimate, via the semblance Radon transform, the angles-of-arrival of the near-field signals. We then use triangulation to estimate the coordinates of the near-field sources. Finally we integrate the original space/time data along hyperbolic trajectories to extract the individual near-field signal envelopes.
Sina Gholami, Abdulmoneam Ali, Tania Haghighi, Ahmed Arafa, Minhaj Nur Alam
Federated learning (FL) enables collaborative model training without sharing raw data; however, the presence of noisy labels across distributed clients can severely degrade the learning performance. In this paper, we propose FedSIR, a multi-stage framework for robust FL under noisy labels. Different from existing approaches that mainly rely on designing noise-tolerant loss functions or exploiting loss dynamics during training, our method leverages the spectral structure of client feature representations to identify and mitigate label noise. Our framework consists of three key components. First, we identify clean and noisy clients by analyzing the spectral consistency of class-wise feature subspaces with minimal communication overhead. Second, clean clients provide spectral references that enable noisy clients to relabel potentially corrupted samples using both dominant class directions and residual subspaces. Third, we employ a noise-aware training strategy that integrates logit-adjusted loss, knowledge distillation, and distance-aware aggregation to further stabilize federated optimization. Extensive experiments on standard FL benchmarks demonstrate that FedSIR consistently outperforms state-of-the-art methods for FL with noisy labels. The code is available at https://github.com/sinagh72/FedSIR.
Alberto G. Perotti, Branislav M. Popovic, Renaud-Alexandre Pitaval
Direct satellite uplink is severely constrained by limited link budgets, which hinder the exploitation of wideband resources, and ultimately limit the throughout. This paper presents a pilot-less coded modulation scheme based on sparse superposition coding (SSC) to enable efficient wideband usage in coverage-limited scenarios. This scheme leverages the structured Zadoff-Chu quasi-orthogonal (ZC-QO) dictionary to support scalable transmission. To address decoding complexity, the SSC transmitted signal embeds root index information via indicator sequences, allowing the receiver to restrict the decoding search space. In addition, a multi-codeword transmission framework with repetition and stop-feedback is developed, enabling reliable communication and better resource utilization. Simulation results show that the proposed scheme achieves throughput gains compared to a more conventional narrow-band multi-dimensional constellation-based approach.
Z. Chen, S. Fu, Y. Zeng, X. Xu, Z. Wei
Channel knowledge map (CKM) is a promising technique to achieve environment-aware wireless communication and sensing. Constructing the complete CKM based on channel knowledge observations at sparse locations is a fundamental problem for CKM-enabled wireless networks. However, most existing works on CKM construction only consider the special type of CKM, i.e., the channel gain map (CGM), which only records the channel gain value for each location. In this paper, we consider the channel spatial correlation map (SCM) construction, which signifies the location-specific spatial correlation matrix for multi-antenna systems. Unlike CGM construction, constructing SCM poses significant challenges due to its extremely high-dimensional structure. To address this issue, we first decompose the high-dimensional SCM into lower-dimensional path gain map (PGM) and path angle map (PAM). Then we propose a deep learning model termed E-SRResNet for constructing high-quality SCM from sparse samples, which incorporates multi-head attention (MHA) mechanisms and multi-scale feature fusion (MSFF) to accurately model both local and global spatial relationships of channel parameters and complex nonlinear mappings. Furthermore, we preprocess the dataset to provide priors including line-of-sight (LoS) map, binary building map and base station (BS) map for the model to reconstruct SCM more accurately. Simulations conducted on the CKMImageNet dataset demonstrate that the proposed E-SRResNet achieves significant performance improvements over baseline methods. Moreover, the cosine similarity between the constructed SCM and the ground truth exceeds 0.8 in most regions, validating the effectiveness of the proposed construction method.
Jiangong Chen, Xia Lei, Yuchen Zhang, Kaitao Meng, Christos Masouros
Integrated Sensing and Communication (ISAC) systems require efficient beamforming architectures to jointly support communication and sensing functionalities. To reduce hardware overhead, Hybrid Beamforming (HBF) has been widely studied and shown to achieve performance close to fully digital beamforming under practical hardware constraints. As a promising evolution, Reconfigurable Antenna (RA) technologies have recently emerged to further enhance beamforming Degrees of Freedom (DoFs) by dynamically reconfiguring antenna Electromagnetic(EM) characteristics, yet their integration into ISAC systems remains largely unexplored. In this paper, we investigate an RA-assisted ISAC system and develop a decoupled Triple-Hybrid Beamforming (Tri-HBF) framework that alternatively optimizes digital, analog, and EM beamformers to maximize the communication rate and sensing Signal-to-Clutter-plus-NoiseRatio (SCNR). For both Single-user Single-target (SUST) and Multiple-user Multiple-target (MUMT) scenarios, we first transform the original fractional objectives into fraction-free ones via methods tailored to their respective structures. The resulting problems are then solved via alternating optimization over different variable blocks. Closed-form updates are derived for all variables except the EM beamforming subproblem in the MUMT scenario. To further reduce the complexity introduced by Semidefinite Relaxation (SDR) in EM beamforming, we propose a low-complexity iterative approach across antennas with closed-form updates. Simulation results demonstrate that the proposed scheme significantly outperforms benchmark designs with conventional omnidirectional and directional antennas, achievingalmost 100% improvement in spectrum efficiency and 62.5% reduction in antenna overhead, thereby unveiling the
Mei-San Maggie Lei, John Stewart Fabila Carrasco, Javier Escudero
We introduce a graph-signal generalisation of Sample Entropy, denoted SampEn$_{G}$, to quantify irregularity of graph signals on a continuous state space, complementing existing methods on symbolic dynamics. Our approach replaces the temporal delay embedding of classical SampEn with a multi-hop graph-based embedding: for each node, we aggregate patterns from local walk-weighted neighbourhood averages computed via powers of the graph shift operator. We show empirically that SampEn$_{G}$ reduces to classical 1D SampEn on directed path graphs, and validate its nonlinear sensitivity using the logistic map. Experiments on directed Erdős--Rényi graph signals further characterise its behaviour with connectivity and pattern length $m$, with practical runtimes on the order of thousands of nodes. We expect SampEn$_{G}$ to open up new ways to analyse graph signals, generalising SampEn and the concept of conditional entropy to extending nonlinear analysis to a wide variety of network data.
Bowen Li, Jiping Luo, Themistoklis Charalambous, Nikolaos Pappas
Timely information delivery in low-altitude networks is critical for many time-sensitive applications, such as unmanned aerial vehicle (UAV) navigation, inspection, and surveillance. The key challenge lies in balancing three competing factors: stringent data freshness requirements, UAV onboard energy consumption, and interference with terrestrial services. Addressing this challenge requires not only efficient power and channel allocation strategies but also effective communication timing over the entire operation horizon. In this work, we propose a model predictive communication (MPComm) framework, enabled by advanced channel sensing techniques, in which the channel conditions that the UAV will experience are largely predictable. Within this framework, we formulate a constrained bi-objective optimization problem to achieve a desired trade-off between energy consumption and terrestrial channel occupation, subject to a strict timeliness constraint. We solve this problem using Pareto analysis and show that the original non-convex, mixed-integer problem can be decomposed into a two-layer structure: the outer layer determines the optimal communication timing, while the inner layer determines the optimal power and channel allocation for each communication interval. An efficient algorithm for the inner problem is developed using non-convex analysis, with asymptotic optimality guarantees, while the outer problem is solved optimally via a simple graph search, with edges characterized by inner solutions. The proposed approach applies to a broad class of problem variants, including objective transformations and single-objective specializations. Numerical results demonstrate the efficiency of the proposed solution, achieving up to a six-fold reduction in terrestrial channel occupation and a 6dB energy saving compared to benchmark schemes.
Sotiris Droulias, Giorgos Stratidakis, Angeliki Alexiou
Wavefront engineering for applications in near-field wireless connectivity is gradually becoming common ground. In this landscape, beams that propagate on bent paths are ideal candidates for dynamic blockage avoidance and suppression of potential eavesdropping. In this work we study the physical layer security offered by bending beams, and we demonstrate their capabilities for line-of-sight and non-line-of-sight eavesdropping. We analyze the dependencies between the possible locations of an eavesdropper and the design parameters of such beams, and we introduce metrics to assess their physical layer security performance. Our results demonstrate their superiority with respect to beams generated with conventional beam-forming.
Wenqing Dai, Jan Herbst, Jan Petershans, Christoph Lipps, Hans D. Schotten
Reconfigurable Intelligent Surfaces (RIS) have emerged as a key enabler for programmable wireless environments in future Beyond-5G (B5G) and 6G networks. In the meantime, Integrated Sensing and Communication (ISAC) and Physical-Layer Security (PLS) are becoming essential functionalities for next-generation wireless systems, particularly in safety and mission-critical applications. However, jointly optimizing RIS-assisted systems to support communication, sensing, and security introduces complex and often conflicting design trade-offs. In this work, a multi-objective optimization framework for RIS-assisted networks is proposed, aiming to jointly analyze communication performance, sensing accuracy, and security-related channel properties in a unified system perspective. The proposed model jointly considers RIS deployment location, orientation, surface size, and an ISAC configuration weight that controls the allocation of RIS reflection gain between communication and sensing tasks. Simulation results reveal inherent trade-offs among communication reliability, sensing accuracy, and security performance. The proposed framework provides valuable insights into the interplay between communication, sensing, and security, and enables the design of efficient RIS deployment and configuration strategies for secure ISAC-enabled 6G wireless networks.