Comments on 'An FPT algorithm with a modularized structure for computing 2-D cyclic convolutions' by T.K. Truong, et al

摘要

The modularized FPT algorithm proposed by Truong et al. in the above-named work (see ibid. vol.36. p.1540-1542, Sept. 1988) is extended to the finite fields for computing 2-D cyclic convolutions. In this method, only FPTs and number theoretic transforms (NTTs) of the same length are required.