Related papers: On the Polyphase Decomposition for Design of Gener…
Graph Convolution Networks (GCNs), with their efficient ability to capture high-order connectivity in graphs, have been widely applied in recommender systems. Stacking multiple neighbor aggregation is the major operation in GCNs. It…
We propose a new generator for the generalized inverse Gaussian (GIG) distribution by decomposing the density of GIG into two components. The first component is a truncated inverse Gamma density, in order to sample from which we improve the…
The goal of this paper is to present a theoretical and practical introduction to generalized eigendecomposition (GED), which is a robust and flexible framework used for dimension reduction and source separation in multichannel signal…
Due to the speed limitation of the conventional bit-chosen strategy in the existing weighted bit flipping algorithms, a high-speed LDPC decoder cannot be realized. To solve this problem, we propose a fast weighted bit flipping (FWBF)…
In this article we discuss our implementation of a polyphase filter for real-time data processing in radio astronomy. We describe in detail our implementation of the polyphase filter algorithm and its behaviour on three generations of…
Massive multiple-input multiple-output (MIMO) is envisioned to offer considerable capacity improvement, but at the cost of high complexity of the hardware. In this paper, we propose a low-complexity hybrid precoding scheme to approach the…
In this work, we investigate grid-forming (GFM) control for dc/ac power converters in emerging power systems that contain ac and dc networks, renewable generation, and conventional generation. We propose a novel power-balancing GFM control…
Supporting multiple partial computations efficiently at each of the workers is a keystone in distributed coded computing in order to speed up computations and to fully exploit the resources of heterogeneous workers in terms of…
Generalized product codes (GPCs) are extensions of product codes (PCs) where code symbols are protected by two component codes but not necessarily arranged in a rectangular array. We consider a deterministic construction of GPCs (as opposed…
Farrow filters allow to develop universal oversamplers for fractional delay correction and sampling rate conversion. The use of cubic Lagrangian interpolation in Farrow filter does not allow to provide processing bandwidth more than 0.4 of…
Gradient echo memory (GEM) stores and retrieves photon wave packet in forward direction with high efficiency and fidelity using photon-echo mechanism. It is an important technique for quantum memory applications. By breaking the continuity…
Dense wavelength division multiplexing (DWDM) is one of the most successful methods for enhancing data transmission rates in both classical and quantum communication networks. Although signal multiplexing and demultiplexing are equally…
The efficiency of top-K item recommendation based on implicit feedback are vital to recommender systems in real world, but it is very challenging due to the lack of negative samples and the large number of candidate items. To address the…
Many filters have been proposed in recent decades for the nonlinear state estimation problem. The linearization-based extended Kalman filter (EKF) is widely applied to nonlinear industrial systems. As EKF is limited in accuracy and…
A method for constructing non-uniform filter banks is presented. Starting from a uniform system of translates, generated by a prototype filter, a non-uniform covering of the frequency axis is obtained by composition with a warping function.…
This paper studies the distributed state estimation problem for a class of discrete time-varying systems over sensor networks. Firstly, it is shown that a networked Kalman filter with optimal gain parameter is actually a centralized filter,…
We study the feasibility of applying the Generator Coordinate Method (GCM) of self-consistent mean-field theory to calculate decay widths of composite particles to composite-particle final states. The main question is how well the GCM can…
We consider the distributed Kalman filtering problem for sensor networks where each node takes the measurement, communicates with its local neighbors, and updates its local estimate and estimation error covariance at the same frequency. In…
Generating high-dimensional visual modalities is a computationally intensive task. A common solution is progressive generation, where the outputs are synthesized in a coarse-to-fine spectral autoregressive manner. While diffusion models…
Lossy image compression is essential for efficient transmission and storage. Traditional compression methods mainly rely on discrete cosine transform (DCT) or singular value decomposition (SVD), both of which represent image data in…