Related papers: Efficient DFT of Zadoff-Chu Sequences using lmFH P…
4G/5G wireless standards use orthogonal frequency division multiplexing (OFDM) which is robust to frequency selectivity. Equalization is possible with a single tap filter, and low-complexity equalization makes OFDM an attractive physical…
Ab initio modeling of dynamic structure factors (DSF) and related density response properties in the warm dense matter (WDM) regime is a challenging computational task. The DSF, convolved with a probing X-ray beam and instrument function,…
Based on the sampling theorem, interpolation should be conducted by employing the sinc functions as the kernels. Inspired by the fact that the discrete Fourier transform (DFT) is sampled from the discrete time Fourier transform, a fast…
We have studied the electronic and optical properties of three low-symmetry graphene quantum dots (GQDs), with the point-group symmetries $C_{2v}$, and $C_{2h}$. For the calculations of linear optical absorption spectra, we employed both…
In this work, we consider scattering amplitudes relevant for high-precision Large Hadron Collider (LHC) phenomenology. We analyse the general structure of amplitudes, and we review state-of-the-art methods for computing them. We discuss…
Visual feature clustering is one of the cost-effective approaches to segment objects in videos. However, the assumptions made for developing the existing algorithms prevent them from being used in situations like segmenting an unknown…
LightFDG is an integrated approach to flow detection (FD) and flow grooming (FG) in optical wireless data center networks (DCNs), which is interconnected via wavelength division multiplexing (WDM) based free-space optical (FSO) links. Since…
First-principles Hubbard-corrected approximate density-functional theory (DFT+U) is a low-cost, potentially high throughput method of simulating materials, but it has been hampered by empiricism and inconsistent band-gap correction in…
Given an $n$-length input signal $\mbf{x}$, it is well known that its Discrete Fourier Transform (DFT), $\mbf{X}$, can be computed in $O(n \log n)$ complexity using a Fast Fourier Transform (FFT). If the spectrum $\mbf{X}$ is exactly…
For millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, hybrid processing architecture is essential to significantly reduce the complexity and cost but is quite challenging to be jointly optimized over the…
This article gives a comprehensive description of the fractal geometry of conformally-invariant (CI) scaling curves, in the plane or half-plane. It focuses on deriving critical exponents associated with interacting random paths, by…
Ultra-high-resolution target sensing has emerged as a key enabler for various cutting-edge applications, which can be realized by utilizing the millimeter wave/terahertz frequencies. However, the extremely high operating frequency…
Affine Frequency Division Multiplexing (AFDM), a new chirp-based multicarrier waveform for high mobility communications, is introduced here. AFDM is based on discrete affine Fourier transform (DAFT), a generalization of discrete Fourier…
We investigate Machine-Learned Force Fields (MLFFs) trained on approximate Density Functional Theory (DFT) and Coupled Cluster (CC) level potential energy surfaces for the carbon diamond and lithium hydride solids. We assess the accuracy…
Compact finite-difference (FD) schemes specify derivative approximations implicitly, thus to achieve parallelism with domain-decomposition suitable partitioning of linear systems is required. Consistent order of accuracy, dispersion, and…
Three-dimensional point clouds can be viewed as discrete samples of smooth manifolds, allowing spectral analysis using the Laplace-Beltrami operator (LBO). However, the traditional point cloud manifold harmonic transform (PMHT) is limited…
The one-dimensional (1D) fractional Fourier transform (FRFT) generalizes the Fourier transform, offering significant advantages in the time-frequency analysis of non-stationary signals. While various 2D extensions exist, such as the 2D…
Dynamic graph signal processing provides a principled framework for analyzing time-varying data defined on irregular graph domains. However, existing joint time-vertex transforms such as the joint time-vertex fractional Fourier transform…
Recently, sophisticated deep learning-based approaches have been developed for generating efficient initial guesses to accelerate the convergence of density functional theory (DFT) calculations. While the actual initial guesses are often…
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…