相关论文: Reduced Complexity Calculation of LMMSE Filter Coe…

Transitions of many-particle quantum systems between distinct phases at absolute-zero temperature, known as quantum phase transitions, require an exacting treatment of particle correlations. In this work, we present a general…

We propose a low complexity complex valued Sphere Decoding (CV-SD) algorithm, referred to as Circular Sphere Decoding (CSD) which is applicable to multiple-input multiple-output (MIMO) systems with arbitrary two dimensional (2D)…

It is shown that for solvable fermionic and bosonic lattice systems, the reduced density matrices can be determined from the properties of the correlation functions. This provides the simplest way to these quantities which are used in the…

We introduce the multivariate decomposition finite element method (MDFEM) for solving elliptic PDEs with uniform random diffusion coefficients. We show that the MDFEM can be used to reduce the computational complexity of estimating the…

Modern 4-wave mixing spectroscopies are expensive to obtain experimentally and computationally. In certain cases, the unfavorable scaling of quantum dynamics problems can be improved using a generalized quantum master equation (GQME)…

This paper proposes a design of low complexity, reconfigurable and narrow transition band (NTB) filter bank (FB). In our proposed Modified Frequency Response Masking (ModFRM) architecture, the modal filter and complementary filter in…

We provide effective algorithms for solving block tridiagonal block Toeplitz systems with $m\times m$ quasiseparable blocks, as well as quadratic matrix equations with $m\times m$ quasiseparable coefficients, based on cyclic reduction and…

We consider adaptive system identification problems with convex constraints and propose a family of regularized Least-Mean-Square (LMS) algorithms. We show that with a properly selected regularization parameter the regularized LMS provably…

In Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can achieve performance equivalent to full search Maximum Likelihood (ML) decoding, with reduced complexity. Several researchers reported techniques that reduce the…

In this work we propose an efficient and accurate multi-scale optical simulation algorithm by applying a numerical version of slowly varying envelope approximation in FEM. Specifically, we employ the fast iterative method to quickly compute…

In this paper we consider the filtering of a class of partially observed piecewise deterministic Markov processes (PDMPs). In particular, we assume that an ordinary differential equation (ODE) drives the deterministic element and can only…

We investigate iterative low-resolution message-passing algorithms for quasi-cyclic LDPC codes with horizontal and vertical layered schedules. Coarse quantization and layered scheduling are highly relevant for hardware implementations to…

This paper addresses a simplified frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over frequency selective fading channels. By exploiting the good correlation…

This paper presents a new class of adaptive filters, namely Geometric-Algebra Adaptive Filters (GAAFs). They are generated by formulating the underlying minimization problem (a deterministic cost function) from the perspective of Geometric…

A multiparameter filtration, or a multifiltration, may in many cases be seen as the collection of sublevel sets of a vector function, which we call a multifiltering function. The main objective of this paper is to obtain a better…

Generalized frequency division multiplexing (GFDM) is a promising candidate waveform for next-generation wireless communication systems. However, GFDM channel estimation is still challenging due to the inherent interference. In this paper,…

Particle filters are computational techniques for estimating the state of dynamical systems by integrating observational data with model predictions. This work introduces a class of Localized Particle Filters (LPFs) that exploit spatial…

In recent work it is shown that importance sampling can be avoided in the particle filter through an innovation structure inspired by traditional nonlinear filtering combined with Mean-Field Game formalisms. The resulting feedback particle…

The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…

Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are a promising class of codes for low-latency communication.…