Related papers: General Method for Prime-point Cyclic Convolution …
This paper presents a general method for obtaining radius of the corresponding circumference to a cyclical polygon $n$ sides given the lengths of said sides, using the notion of complex number. As of radius $r$, obtained, can then be…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
First passage distributions of semi-Markov processes are of interest in fields such as reliability, survival analysis, and many others. The problem of finding or computing first passage distributions is, in general, quite challenging. We…
This paper is devoted to a discussion of the Discrete Fourier Transform (DFT) representation of a chaotic finite-duration sequence. This representation has the advantage that is itself a finite-duration sequence corresponding to samples…
We present new algorithms for computing the low $n$ bits or the high $n$ bits of the product of two $n$-bit integers. We show that these problems may be solved in asymptotically 75% of the time required to compute the full $2n$-bit product,…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…
Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…
Deep convolutional neural networks take GPU days of compute time to train on large data sets. Pedestrian detection for self driving cars requires very low latency. Image recognition for mobile phones is constrained by limited processing…
This paper introduces a generalised 3rd-order Spectral Representation Method for the simulation of multi-dimensional stochastic fields with asymmetric non-linearities. The simulated random fields satisfy a prescribed Power Spectrum and…
In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful…
This paper proposes to use Fast Fourier Transformation-based U-Net (a refined fully convolutional networks) and perform image convolution in neural networks. Leveraging the Fast Fourier Transformation, it reduces the image convolution costs…
For a sample set of 1024 values, the FFT is 102.4 times faster than the discrete Fourier transform (DFT). The basis for this remarkable speed advantage is the `bit-reversal' scheme of the Cooley-Tukey algorithm. Eliminating the burden of…
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
This paper examines finite field trigonometry as a tool to construct trigonometric digital transforms. In particular, by using properties of the k-cosine function over GF(p), the Finite Field Discrete Cosine Transform (FFDCT) is introduced.…
Machine learning applied to computer vision and signal processing is achieving results comparable to the human brain on specific tasks due to the great improvements brought by the deep neural networks (DNN). The majority of state-of-the-art…
Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a…
Convolution system is linear and time invariant, and can describe the optical imaging process. Based on convolution system, many deconvolution techniques have been developed for optical image analysis, such as boosting the space resolution…
Electronic structure calculation of atoms and molecules, in the past few decades has largely been dominated by density functional methods. This is primarily due to the fact that this can account for electron correlation effects in a…
The achievable data rates of current fiber-optic wavelength-division-multiplexing (WDM) systems are limited by nonlinear interactions between different subchannels. Recently, it was thus proposed to replace the conventional Fourier…