Related papers: Efficient DFT of Zadoff-Chu Sequences using lmFH P…
Massive MIMO system yields significant improvements in spectral and energy efficiency for future wireless communication systems. The regularized zero-forcing (RZF) beamforming is able to provide good performance with the capability of…
The dynamical mean-field theory (DMFT) combined with the fluctuation exchange (FLEX) method, namely FLEX+DMFT, is an approach for correlated electron systems to incorporate both local and non-local long-range correlations in a…
A reexamination of period finding algorithms is prompted by new large area astronomical sky surveys that can identify billions of individual sources having a thousand or more observations per source. This large increase in data necessitates…
Density functional theory (DFT) provides a theoretical framework for efficient and fairly accurate calculations of the electronic structure of molecules and crystals. The main features of density functional theory are described and DFT…
In this paper, new results on convolution of spectral components in binary fields have been presented for combiatorial sequences. A novel method of convolution of DFT points through Chinese Remainder Theorem (CRT) is presented which has…
This paper jointly designs linear precoding (LP) and codebook-based beamforming implemented in a satellite with massive multiple-input multiple-output (mMIMO) antenna technology. The codebook of beamforming weights is built using the…
A joint frame and carrier frequency synchronization algorithm for coherent optical systems, based on the digital computation of the fractional Fourier transform (FRFT), is proposed. The algorithm utilizes the characteristics of energy…
We propose a multi-dimensional (M-D) sparse Fourier transform inspired by the idea of the Fourier projection-slice theorem, called FPS-SFT. FPS-SFT extracts samples along lines (1-dimensional slices from an M-D data cube), which are…
Density functional theory (DFT) can run into serious difficulties with localized states in elements such as transition metals with occupied-d states and oxygen. In contrast, Hartree-Fock (HF) method can be a better approach for such…
Accurate calibration of internal parameters is a crucial yet challenging prerequisite for 3D reconstruction using light field cameras. In this paper, we propose a linear fractional transformation(LFT) parameter $\alpha$ to decoupled the…
The fundamentals of Fourier Transform are presented, with analytical solutions derived for Continuous Fourier Transform (CFT) of truncated signals, to benchmark against Fast Fourier Transform (FFT). Certain artifacts from FFT were…
In this paper, a discrete LCT (DLCT) irrelevant to the sampling periods and without oversampling operation is developed. This DLCT is based on the well-known CM-CC-CM decomposition, that is, implemented by two discrete chirp multiplications…
Due to its storage and retrieval efficiency, cross-modal hashing~(CMH) has been widely used for cross-modal similarity search in multimedia applications. According to the training strategy, existing CMH methods can be mainly divided into…
We investigate the Beyond Standard Model discovery potential in the framework of the Effective Field Theory (EFT) for the same-sign $WW$ scattering process in purely leptonic $W$ decay modes at the High-Luminosity and High-Energy phases of…
Cloud detection is an important preprocessing step for the precise application of optical satellite imagery. In this paper, we propose a deep learning based cloud detection method named multi-scale convolutional feature fusion (MSCFF) for…
We discuss the recently proposed LDA'+DMFT approach providing consistent parameter free treatment of the so called double counting problem arising within the LDA+DMFT hybrid computational method for realistic strongly correlated materials.…
This paper is devoted to show the results obtained by using the magnitude-squared coherence for determining order-chaos transition in a system described by the logistic equation dynamics. For determining the power spectral density of a…
A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…
The Fast Fourier Transform(FFT) is a classic signal processing algorithm that is utilized in a wide range of applications. For image processing, FFT computes on every pixel's value of an image, regardless of their properties in frequency…
In~\cite{sic-magazine-2025}, the authors show that the square index coefficients (SICs) of the $N$-point discrete Fourier transform (DFT) -- that is, the coefficients $X_{k\sqrt{N}}$ for $k = 0, 1, \ldots, \sqrt{N} - 1$ -- can be losslessly…