Comments on "An FFT algorithm based fast algorithm for arbitrary polynomial transformation
Shuenn‐Shyang Wang, Wen-Guo Lin · IEEE Transactions on Signal Processing · 1991
Comments are made on the work by H. Krishna (see ibid., vol.37, no.10, p.1612-14, 1989). Krishna presented an elegant fast algorithm for the arbitrary polynomial transformation based on the fast Fourier transform algorithm. It is pointed out that if he applies the discrete Fourier transform (DFT) and inverse (DFT) pair defined in one of his references (H.J. Nussbaumer, 1981), then the final results are not precisely correct.>