Fast biased polynomial transforms
Journal
IEEE Transactions on Acoustics, Speech, and Signal Processing
Journal Volume
34
Journal Issue
2
Pages
383-385
Date Issued
1986
Author(s)
Abstract
The fast biased polynomial transforms (FBPT's) are defined directly on the Z N - 1 ring, then two-dimensional convolutions can be carried out without using the Chinese remainder theorem (CRT), complex mapping, and column-row reordering processes. Furthermore, for N prime, these FBPT's are used for the evaluation of 2-D prime length DFT's very efficiently.
Type
journal article