In this paper, a parallel-pipeline, radix-2 architecture is proposed to implement the fast polynomial transform (FPT). It is shown that such a structure can be used to efficiently compute a two-dimensional convolution of d
Published in:
Computers, IEEE Transactions on
(Volume:C-32
,
Issue:
3
)
Date of Publication: March 1983