Precise deconvolution using the Fermat number transform

DOI10.1016/0898-1221(86)90191-4zbMath0609.65030OpenAlexW2104370150MaRDI QIDQ3750038

Miroslav Morháč

Publication date: 1986

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(86)90191-4

zbMATH Keywords

inverse problemserror-free algorithmdeterminantdeconvolutionFermat number transformmodular arithmeticconvolution matrixconvolution systems of linear equationselimination of rounding-off errorsfast precise linear convolution filtersnuclear physics experiments

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (7)

An error-free algorithm to solve a linear system of polynomial equations ⋮ One-modulus residue arithmetic algorithm to solve linear equations exactly ⋮ Precise multidimensional deconvolution using the polynomial algebra concept ⋮ Exact deconvolution using number-theoretic transforms ⋮ Error-free algorithms to solve special and general discrete systems of linear equations ⋮ An iterative error-free algorithm to solve Vandermonde systems ⋮ k-dimensional error-free deconvolution using the Fermat number transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast Fourier transform and convolution algorithms
• Transform-domain digital filtering with number theoretic transforms and limited word lengths
• The use of finite fields to compute convolutions
• Digital Filtering Using Complex Mersenne Transforms
• Digital filtering using pseudo fermat number transforms
• The Fast Fourier Transform in a Finite Field
• Discrete Convolutions via Mersenne Transforms

This page was built for publication: Precise deconvolution using the Fermat number transform