k-dimensional error-free deconvolution using the Fermat number transform
From MaRDI portal
K-dimensional error-free deconvolution using the Fermat number transform
An error-free algorithm of the k-dimensional discrete deconvolution is developed. This algorithm can solve precisely the inverse problem of the k-dimensional deconvolution. The calculation speed is improved by using the Fermat number transform.
Recommendations
- Precise deconvolution using the Fermat number transform
- Error-free deconvolution based on cyclic determinant calculation approach
- Exact solutions of some discrete deconvolution problems
- Precise multidimensional deconvolution using the polynomial algebra concept
- Exact deconvolution using number-theoretic transforms
Cites work
Cited in
(8)- Exact deconvolution using number-theoretic transforms
- An error-free algorithm to solve a linear system of polynomial equations
- One-modulus residue arithmetic algorithm to solve linear equations exactly
- Precise deconvolution using the Fermat number transform
- Precise multidimensional deconvolution using the polynomial algebra concept
- Error-free deconvolution based on cyclic determinant calculation approach
- 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: k-dimensional error-free 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 Q1825622)
