DocumentCode
1280679
Title
Comments on "An FPT algorithm with a modularized structure for computing 2-D cyclic convolutions" by T.K. Truong, et al
Author
WU, JA-LING ; Huang, Yuh-Ming
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Volume
39
Issue
5
fYear
1991
fDate
5/1/1991 12:00:00 AM
Firstpage
1238
Abstract
The modularized FPT algorithm proposed by Truong et al. in the above-named work (see ibid. vol.36. p.1540-1542, Sept. 1988) is extended to the finite fields for computing 2-D cyclic convolutions. In this method, only FPTs and number theoretic transforms (NTTs) of the same length are required.<>
Keywords
transforms; 2D cyclic convolutions; FPT algorithm; finite fields; modularized structure; number theoretic transforms; Acoustical engineering; Arithmetic; Cathode ray tubes; Computer science; Convolution; Galois fields; Polynomials; Signal processing algorithms; Speech;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.80981
Filename
80981
Link To Document