Related papers: Reduced Complexity Calculation of LMMSE Filter Coe…
The Fast Multipole Method (FMM) reduces the computation of pairwise two-body interactions among $N$-particles to order $N$, whose computation cost should be of order $N^2$ by brute force. However, its implementation is somewhat complicated…
Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the…
Approaching Shannon's capacity via geometric shaping has usually been regarded as challenging due to modulation and demodulation complexity, requiring look-up tables to store the constellation points and constellation bit labeling. To…
In this work, decision feedback (DF) detection algorithms based on multiple processing branches for multi-input multi-output (MIMO) spatial multiplexing systems are proposed. The proposed detector employs multiple cancellation branches with…
This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of QAM and PAM signals over complex-valued fading channels. The algorithms are optimal in terms of the generalized likelihood ratio test…
This paper explores the flexibility of generalized frequency division multiplexing (GFDM) for achieving the same performance as filter bank multicarrier (FBMC). We present a GFDM configuration where the good spectral containment of FBMC is…
We propose a novel quantum approach to signal processing, including a quantum algorithm for low-pass and high-pass filtering, based on the sequency-ordered Walsh-Hadamard transform. We present quantum circuits for performing the…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
We investigate a modified split-step Fourier method (SSFM) by including low-pass filters in the linear steps. This method can simultaneously achieve a higher simulation accuracy and a slightly reduced complexity.
The present article is devoting a numerical approach for solving a fractional partial differential equation (FPDE) arising from electromagnetic waves in dielectric media (EMWDM). The truncated Bernoulli and Hermite wavelets series with…
Affine frequency division multiplexing (AFDM) has emerged as a promising waveform for high-mobility communications. However, its equalization remains a practical challenge under general physical channels with off-grid delay and Doppler…
In many signal processing applications it is required to estimate the unobservable state of a dynamic system from its noisy measurements. For linear dynamic systems with Gaussian Mixture (GM) noise distributions, Gaussian Sum Filters (GSF)…
In this article, we propose a new method for calculating the mixed correlation coefficient (Pearson, polyserial and polychoric) matrix and its covariance matrix based on the GMM framework. We build moment equations for each coefficient and…
Wireless communications over fast fading channels are challenging, requiring either frequent channel tracking or complicated signaling schemes such as orthogonal time frequency space (OTFS) modulation. In this paper, we propose…
A systematic method for determining order parameters for quantum many-body systems on lattices is developed by utilizing reduced density matrices. This method allows one to extract the order parameter directly from the wave functions of the…
In this paper, we propose an adaptive framework for the variable power of the fractional least mean square (FLMS) algorithm. The proposed algorithm named as robust variable power FLMS (RVP-FLMS) dynamically adapts the fractional power of…
Quantum computing presents a promising alternative for the direct simulation of quantum systems with the potential to explore chemical problems beyond the capabilities of classical methods. However, current quantum algorithms are…
In this paper, we present an efficient algorithm to sample random sparse matrices to be used as check matrices for quantum Low-Density Parity-Check (LDPC) codes. To ease the treatment, we mainly describe our algorithm as a technique to…
In this paper, a new formalism for the filtered density function (FDF) approach is developed for the treatment of turbulent polydispersed two-phase flows in LES simulations. Contrary to the FDF used for turbulent reactive single-phase…
Particle filtering methods can be applied to estimation problems in discrete spaces on bounded domains, to sample from and marginalise over unknown hidden states. As in continuous settings, problems such as particle degradation can arise:…