Comments on “An FPT Algorithm with a Modularized Structure for Computing 2-D Cyclic Convolutions”
Journal
IEEE Transactions on Signal Processing
Journal Volume
39
Journal Issue
5
Date Issued
1991
Author(s)
Abstract
In this correspondence, the modularized FPT algorithm proposed by Truong et al. is extended to the finite fields, for computing 2-D cyclic convolutions. In this new method, only FPT's and number theoretic transforms (NTT's) of the same length are required. © 1991 IEEE
Type
journal article