Related papers: Reduced Complexity Calculation of LMMSE Filter Coe…
In this paper, we first propose a novel common subexpression elimination (CSE) algorithm for matrix-vector multiplications over characteristic-2 fields. As opposed to previously proposed CSE algorithms, which usually focus on complexity…
Qudits offer significant advantages over qubit-based architectures, including more efficient gate compilation, reduced resource requirements, improved error-correction primitives, and enhanced capabilities for quantum communication and…
In millimeter-wave (mmWave) MIMO systems, while a hybrid digital/analog precoding structure offers the potential to increase the achievable rate, it also faces the challenge of the need of a low-complexity design. In specific, the hybrid…
Wavefront errors are a common artifact in laser light generation and imaging. They can be described as an aberration from the spherical wavefront of an ideal Gaussian beam by combinations of higher-order Hermite- or Laguerre-Gaussian terms.…
Recent progress in quantum computing is paving the way for the realization of early fault-tolerant quantum computers. To maximize the utility of these devices, it is important to develop quantum algorithms that match their capabilities and…
Circularly pulse-shaped orthogonal frequency division multiplexing (CPS-OFDM) is one of the most promising 5G waveforms that addresses two physical layer signal requirements of low out-of-subband emission (OSBE) and low peak-to-average…
Affine frequency division multiplexing (AFDM), an emerging multi-carrier modulation scheme, has garnered significant attention due to its resilience to Doppler shifts and capability to achieve full diversity in doubly dispersive channels.…
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…
We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time complexity of O(q^2) and is suitable for VLSI implementation. The encoder architecture…
An input- and output-sensitive GCD algorithm for multi-variate polynomials over finite fields is proposed by combining the modular method with the Ben-Or/Tiwari sparse interpolation. The bit complexity of the algorithm is given and is…
We propose an Iterative Detection and Decoding (IDD) scheme with Low Density Parity Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems for block-fading $F = 2$ and fast fading Rayleigh channels. An IDD receiver with soft…
Filtering is concerned with the sequential estimation of the state, and uncertainties, of a Markovian system, given noisy observations. It is particularly difficult to achieve accurate filtering in complex dynamical systems, such as those…
In this article, we present a constructive method for computing the frame coefficients of finite wavelet frames over prime fields using tools from computational harmonic analysis and group theory.
Finding a low-weight multiple (LWPM) of a given polynomial is very useful in the cryptanalysis of stream ciphers and arithmetic in finite fields. There is no known deterministic polynomial time complexity algorithm for solving this problem,…
We study a quantum-algorithmic framework for parameterizing partial differential equations (PDEs). For a broad class of problems in which the discretized parameter field admits a diagonal representation, block-encodings of diagonal…
Flavor observables are usually computed with the help of the electroweak Hamiltonian which separates the short-distance from the long-distance regime. The Wilson coefficients are calculated perturbatively, while matrix elements of the…
The present paper focuses on the construction of a set of submatrices of a circulant matrix such that it is a smaller set to verify that the circulant matrix is an MDS (maximum distance separable) one, comparing to the complete set of…
The fifth generation of wireless networks (5G) necessitates the use of waveforms with loose constraints on synchronization in multiuser scenarios. Also, carrier aggregation, as a way to better utilize the spectrum in 5G, needs a waveform…
This work presents a novel approach to the mean-square analysis of the normalized least mean squares (NLMS) algorithm for circular complex colored Gaussian inputs. The analysis is based on the derivation of a closed-form expression for the…
A new circularly pulse-shaped (CPS) precoding orthogonal frequency division multiplexing (OFDM) waveform, or CPS-OFDM for short, is proposed in this paper. CPS-OFDM, characterized by user-specific precoder flexibility, possesses the…