Long convolutions using number theoretic and polynominal transforms

DOI10.1109/TASSP.1984.1164417MaRDI QIDQ3696479zbMATH OpenFDO

Authors

Publication date 1984

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TASSP.1984.1164417

zbMATH Keywords

computational costFermat number transformlong convolutionpolynomial transforms

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• Number theoretic transforms for the calculation of convolutions
• Algorithm for linear convolution using number theoretic transforms
• Convolutions of long integer sequences by means of number theoretic transforms over residue class polynomial rings
• Two-dimensional convolutions by means of number theoretic transforms over residue class polynomial rings
• A novel modularized fast polynomial transform algorithm for two- dimensional convolutions

Cited in

(5)

• On algorithms for digital signal processing of sequences
• FIR filtering by the modified Fermat number transform
• Number theoretic transforms for the calculation of convolutions
• Convolutions of long integer sequences by means of number theoretic transforms over residue class polynomial rings
• Algorithm for linear convolution using number theoretic transforms

This page was built for publication: Long convolutions using number theoretic and polynominal transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696479)