Title :
Fast biased polynominal transforms
Author :
WU, JA-LING ; Pei, Soo-Chang
Author_Institution :
Tatung Institute of Technology, Taipei, Taiwan, Republic of China
fDate :
4/1/1986 12:00:00 AM
Abstract :
The fast biased polynomial transforms (FBPT´s) are defined directly on the ZN- 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.
Keywords :
Arithmetic; Cathode ray tubes; Convolution; Dynamic range; FETs; Fourier transforms; Polynomials; Signal processing algorithms; Speech processing; Zinc;
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
DOI :
10.1109/TASSP.1986.1164808
