An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms

被引：3
|
作者：
Lizhi C. [1 ]
Zengrong J. [1 ]
机构：
[1] Department of Mathematics, National Univ. of Defense Technology, Changsha
来源：
Circuits, Systems and Signal Processing | 2001年 / Birkhauser Boston卷 / 20期
关键词：
Fourier; Fourier Transform; Convolution; Fast Fourier Transform; Discrete Fourier Transform;
D O I：
10.1007/BF01204923
中图分类号：
学科分类号：
摘要：
This paper first presents a fast W -transform (FWT) algorithm for computing one-dimensional cyclic and skew-cyclic convolutions. By using this FWT in conjunction with the fast polynomial transform (FPT), an efficient algorithm is then proposed for calculating the two-dimensional cyclic convolution (2D CC). Compared to the conventional row-column 2D discrete Fourier transform algorithm or the FPT Fast Fourier transform algorithm for 2D CC, the proposed algorithm achieves 65% or 40% savings in the number of multiplications, respectively. The number of additions required is also reduced considerably.
引用
收藏
页码：77 / 88
页数：11
相关论文
共 50 条
  • [1] An efficient algorithm for cyclic convolution based on fast-polynomial and fast-W transforms
    Cheng, LH
    Jiang, ZR
    [J]. CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2001, 20 (01) : 77 - 88
  • [2] FAST POLYNOMIAL-TRANSFORMS FOR TWO-DIMENSIONAL CONVOLUTION
    MARTENS, JB
    [J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1982, 30 (06): : 1007 - 1010
  • [3] FAST CONVOLUTION WITH FINITE FIELD FAST TRANSFORMS
    BRULE, JD
    [J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1975, AS23 (02): : 240 - 240
  • [4] An Efficient Stochastic Convolution Architecture Based on Fast FIR Algorithm
    Wang, Huizheng
    Xu, Weihong
    Zhang, Zaichen
    You, Xiaohu
    Zhang, Chuan
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2022, 69 (03) : 984 - 988
  • [5] Kramers-Kronig transforms calculation with a fast convolution algorithm
    Bruzzoni, P
    Carranza, RM
    Lacoste, JRC
    Crespo, EA
    [J]. ELECTROCHIMICA ACTA, 2002, 48 (04) : 341 - 347
  • [6] Hardware efficient fast DCT based on novel cyclic convolution structures
    Cheng, Chao
    Parhi, Keshab K.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) : 4419 - 4434
  • [7] FAST CONVOLUTION BY NUMBER THEORETIC TRANSFORMS
    LEIBOWITZ, M
    [J]. REPORT OF NRL PROGRESS, 1975, (SEP): : 13 - 13
  • [8] FAST POLYNOMIAL TRANSFORMS BASED ON TOEPLITZ AND HANKEL MATRICES
    Townsend, Alex
    Webb, Marcus
    Olver, Sheehan
    [J]. MATHEMATICS OF COMPUTATION, 2018, 87 (312) : 1913 - 1934
  • [9] IMPROVED FAST POLYNOMIAL TRANSFORM ALGORITHM FOR CYCLIC CONVOLUTIONS
    LOH, AM
    SIU, WC
    [J]. CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 1995, 14 (05) : 603 - 614
  • [10] Fast algorithms for discrete polynomial transforms
    Potts, D
    Steidl, G
    Tasche, M
    [J]. MATHEMATICS OF COMPUTATION, 1998, 67 (224) : 1577 - 1590
12345