Fast biased polynomial transforms for two-dimensional convolutions
- 23 July 1981
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 17 (15) , 547-548
- https://doi.org/10.1049/el:19810382
Abstract
The fast biased polynomial transforms are defined directly on the ZN−1 ring instead of a conventional cyclotomic polynomial ring. Such biased polynomial transforms may be combined with very efficient fast FFT algorithms. Two-dimensional convolutions may be carried out without using the complicated Chinese remainder theorem, complex mapping and column-row reordering processes.Keywords
This publication has 0 references indexed in Scilit: