Related papers: Computing the Matched Filter in Linear Time

Federated learning (FL) algorithms usually sample a fraction of clients in each round (partial participation) when the number of participants is large and the server's communication bandwidth is limited. Recent works on the convergence…

Wireless communications in the terahertz band have been recently proposed as complement to conventional wired interconnects within computing packages. Such environments are typically highly reverberant, hence showing long channel impulse…

We present a novel algorithm, named the 2D-FFAST, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity. The proposed algorithm is based on mixed concepts from…

Time-frequency distributions have been used to provide high resolution representation in a large number of signal processing applications. However, high resolution and accurate instantaneous frequency (IF) estimation usually depend on the…

We propose to combine cepstrum and nonlinear time-frequency (TF) analysis to study mutiple component oscillatory signals with time-varying frequency and amplitude and with time-varying non-sinusoidal oscillatory pattern. The concept of…

Recently proposed orthogonal time frequency space (OTFS) modulation has been considered as a promising candidate for accommodating various emerging communication and sensing applications in high-mobility environments. In this paper, we…

Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth "jumps" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in…

Orthogonal time frequency space (OTFS) modulation can effectively convert a doubly dispersive channel into an almost non-fading channel in the delay-Doppler domain. However, one critical issue for OTFS is the very high complexity of…

In this paper, a fully compressed pattern matching problem is studied. The compression is represented by straight-line programs (SLPs), i.e. a context-free grammars generating exactly one string; the term fully means that both the pattern…

In this paper, the problem of training federated learning (FL) algorithms over a realistic wireless network is studied. In particular, in the considered model, wireless users execute an FL algorithm while training their local FL models…

Deployment of optimization algorithms over communication networks face challenges associated with time delays and corruptions. Fixed time delays can destabilize popular gradient-based algorithms, and this degradation is exacerbated by…

The fundamental concepts and challenges of orthogonal time frequency space (OTFS) modulation have been reviewed in Part I of this three-part tutorial. In this second part, we provide an overview of the state-of-the-art transceiver designs…

6G operators may use millimeter wave (mmWave) and sub-terahertz (sub-THz) bands to meet the ever-increasing demand for wireless access. Sub-THz communication comes with many existing challenges of mmWave communication and adds new…

Orthogonal Time Frequency Space (OTFS) modulation is a recently proposed scheme for time-varying narrowband channels in terrestrial radio-frequency communications. Underwater acoustic (UWA) and ultra-wideband (UWB) communication systems, on…

Signal decomposition is an effective tool to assist the identification of modal information in time-domain signals. Two signal decomposition methods, including the empirical wavelet transform (EWT) and Fourier decomposition method (FDM),…

A Fourier transform method is introduced for a class of hybrid time-frequency methods that solve the acoustic scattering problem in regimes where the solution exhibits both highly oscillatory behavior and slow decay in time. This extends…

Nonstationary time series forecasting suffers from the distribution shift issue due to the different distributions that produce the training and test data. Existing methods attempt to alleviate the dependence by, e.g., removing low-order…

This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic…

The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to design fast matching algorithm that takes advantage of the bit parallelism of…

Signals of opportunity (SOPs) are a promising technique that can be used for relative positioning in areas where global navigation satellite system (GNSS) information is unreliable or unavailable. This technique processes features of the…