FFT-like multiplication of linear differential operators

被引：9
|
作者：
Van der Hoeven, J [1 ]
机构：
[1] Univ Paris 11, CNRS, Dept Math, F-91364 Orsay, France
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 2002年 / 33卷 / 01期
关键词：
D O I：
10.1006/jsco.2000.0496
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
It is well known that integers or polynomials can be multiplied in an asymptotically fast way using the discrete Fourier transform. In this paper, we give an analogue of fast Fourier multiplication in the ring of skew polynomials C[x, delta], where delta = xpartial derivative/partial derivative. More precisely, we show that the multiplication problem of linear differential operators of degree n in x and degree n in delta can be reduced to the n x n matrix multiplication problem. (C) 2002 Academic Press.
引用
收藏
页码：123 / 127
页数：5
相关论文
共 50 条
  • [1] A FFT-Like MIMO Detection Algorithm
    Du, Peng
    Zhang, Yuan
    Ba, Teer
    [J]. IEEE ACCESS, 2020, 8 : 188233 - 188242
  • [2] Algorithms and pipeline architectures for 2-D FFT and FFT-like transforms
    Nibouche, O.
    Boussakta, S.
    Darnell, M.
    Benaissa, M.
    [J]. DIGITAL SIGNAL PROCESSING, 2010, 20 (04) : 1072 - 1086
  • [3] Construction of Ternary Bent Functions by FFT-Like Permutation Algorithms
    Stankovic, Radomir S.
    Stankovic, Milena
    Moraga, Claudio
    Astola, Jaakko T.
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2021, E104D (08) : 1092 - 1102
  • [4] Construction of Ternary Bent Functions by FFT-like Permutation Algorithms
    Stankovic, Radomir S.
    Stankovic, Milena
    Moraga, Claudio
    Astola, Jaakko T.
    [J]. 2020 IEEE 50TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2020), 2020, : 88 - 93
  • [5] Quasi-optimal multiplication of linear differential operators
    Benoit, Alexandre
    Bostan, Alin
    van der Hoeven, Joris
    [J]. 2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 524 - 530
  • [6] Error analysis and complexity optimization for the multiplier-less FFT-like transformation (ML-FFT)
    Tsui, KA
    Chan, SC
    Tse, KW
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 3, PROCEEDINGS, 2004, : 401 - 404
  • [7] Vector Memory-Access Shuffle Fused Instructions for FFT-Like Algorithms
    LIU Sheng
    YUAN Bo
    GUO Yang
    SUN Haiyan
    JIANG Zekun
    [J]. Chinese Journal of Electronics, 2023, 32 (05) : 1077 - 1088
  • [8] Vector Memory-Access Shuffle Fused Instructions for FFT-Like Algorithms
    Liu Sheng
    Yuan Bo
    Guo Yang
    Sun Haiyan
    Jiang Zekun
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2023, 32 (05) : 1077 - 1088
  • [9] Error Analysis and Efficient Realization of the Multiplier-Less FFT-Like Transformation (ML-FFT) and Related Sinusoidal Transformations
    K. M. Tsui
    S. C. Chan
    [J]. Journal of VLSI signal processing systems for signal, image and video technology, 2006, 44 : 97 - 115
  • [10] Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations
    Tsui, K. M.
    Chan, S. C.
    [J]. JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2006, 44 (1-2): : 97 - 115
12345