Fast algorithms for computing one and two dimensional convolution in integer polynomial rings

H.K Garg,C Chung Ko C Chung Ko

doi:10.1109/icassp.1996.545852

Fast algorithms for computing one and two dimensional convolution in integer polynomial rings

H.K Garg, C Chung Ko C Chung Ko

https://doi.org/10.1109/icassp.1996.545852

Copy DOI

Publication Date: May 7, 1996

Citations: 1

Affiliation: National University of Singapore

#Finite Integer Rings #Number Theoretic Transforms + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

The factorization properties of polynomials defined over finite integer rings and the associated direct sums are analyzed. The objective is to describe new computationally efficient algorithms for computing one and two dimensional convolution of data sequences defined over finite integer rings. The number theoretic transforms (NTTs) are a special case of the general theory presented.

Full Text

Paper version not known

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.