Precise deconvolution using the Fermat number transform
The subject of the paper is the description of an error-free algorithm to solve convolution systems of linear equations. The results described in the paper show that the Fermat number transform and modular arithmetic can be successfully used, not only in solving the problems of fast precise linear convolution filters but also in solving the problems of deconvolution. The described algorithm differs from all deconvolution algorithms known so far. The main point of the usage modular arithmetic in this field consists in an elimination of the rounding-off errros. The commonly used Fourier transform unavoidably gives a solution with oscillations as these inverse problems are extremely sensitive to this type of error. A fast algorithm to calculate the determinant of the convolution matrix is also given as its exact integer value is needed for the deconvolution algorithm. The described deconvolution method is used to the resolution enhancement in processing of spectroscopic data measured in nuclear physics experiments.
- Exact deconvolution using number-theoretic transforms
- k-dimensional error-free deconvolution using the Fermat number transform
- Discrete-transform approach to deconvolution problems
- Deconvolution from Fourier-oscillating error densities under decay and smoothness restrictions
- On deconvolution problems: numerical aspects
- On the numerical solution for deconvolution problems with noise
- A deconvolution algorithm for imaging problems from Fourier data
- Precise multidimensional deconvolution using the polynomial algebra concept
- A comparison of Fourier extrapolation methods for numerical solution of deconvolution
- scientific article; zbMATH DE number 3858370
- Die mathematischen Hilfsmittel des Physikers. 7. Aufl
- Digital Filtering Using Complex Mersenne Transforms
- Digital filtering using pseudo fermat number transforms
- Discrete Convolutions via Mersenne Transforms
- Fast Fourier transform and convolution algorithms
- scientific article; zbMATH DE number 3525015 (Why is no real title available?)
- scientific article; zbMATH DE number 3063028 (Why is no real title available?)
- The Fast Fourier Transform in a Finite Field
- The use of finite fields to compute convolutions
- Transform-domain digital filtering with number theoretic transforms and limited word lengths
- Exact deconvolution using number-theoretic transforms
- A novel technique for deconvoluting spectra
- An error-free algorithm to solve a linear system of polynomial equations
- One-modulus residue arithmetic algorithm to solve linear equations exactly
- k-dimensional error-free deconvolution using the Fermat number transform
- scientific article; zbMATH DE number 3858370 (Why is no real title available?)
- Precise multidimensional deconvolution using the polynomial algebra concept
- Error-free deconvolution based on cyclic determinant calculation approach
- Deconvolution from Fourier-oscillating error densities under decay and smoothness restrictions
- An iterative error-free algorithm to solve Vandermonde systems
- Error-free algorithms to solve special and general discrete systems of linear equations
This page was built for publication: Precise deconvolution using the Fermat number transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750038)