Discrete Integer Fourier Transform in Real Space: Elliptic Fourier Transform

被引:1
|
作者
Grigoryan, Artyom M. [1 ]
Grigoryan, Merughan M. [1 ]
机构
[1] Univ Texas San Antonio, Dept Elect & Comp Engn, San Antonio, TX 78249 USA
关键词
Fourier transform; integer approximation of the DFT; Givens rotation; paired transform; ALGORITHM;
D O I
10.1117/12.804543
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The concept of the N-point DFT is generalized, by considering it in the real space (not complex). The multiplication by twiddle coefficients is considered in matrix form; as the Givens transformation. Such block-wise representation of the matrix of the DFT is effective. The transformation which is called the T-generated N-block discrete transform, or N-block T-GDT is introduced. For each N-block T-GDT, the inner product is defined, with respect to which the rows (and columns) of the matrices X are orthogonal. By using different parameterized matrices T, we define metrics in the real space of vectors. The selection of the parameters can be done among only the integer numbers, which leads to integer-valued metric. We also propose a new representation of the discrete Fourier transform in the real space R(2N). This representation is not integer, and is based on the matrix C (2x2) which is not a rotation, but a root of the unit matrix. The point (1, 0) is not moving around the unite circle by the group of motion generated by C, but along the perimeter of an ellipse. The N-block C-GDT is therefore called the N-block elliptic FT (EFT). These orthogonal transformations are parameterized; their properties are described and examples are given.
引用
收藏
页数:12
相关论文
共 50 条
  • [41] Computation of a real eigenbasis for the Simpson discrete Fourier transform matrix
    Singh, Virath
    Singh, Pravin
    SCIENCEASIA, 2014, 40 : 51 - 57
  • [42] Discrete Fourier Transform and Discrete Wavelet Packet Transform in Speech Denoising
    Wang, Zhanfeng
    Li, Suping
    2012 5TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING (CISP), 2012, : 1588 - 1591
  • [43] FAST ALGORITHMS FOR THE DISCRETE W TRANSFORM AND FOR THE DISCRETE FOURIER-TRANSFORM
    WANG, ZD
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1984, 32 (04): : 803 - 816
  • [44] FAST ALGORITHMS FOR THE DISCRETE W TRANSFORM AND FOR THE DISCRETE FOURIER TRANSFORM.
    Wang, Zhongde
    IEEE Transactions on Acoustics, Speech, and Signal Processing, 1984, ASSP-32 (04): : 803 - 816
  • [45] PSEUDORANDOMNESS VIA THE DISCRETE FOURIER TRANSFORM
    Gopalan, Parikshit
    Kane, Daniel M.
    Meka, Raghu
    SIAM JOURNAL ON COMPUTING, 2018, 47 (06) : 2451 - 2487
  • [46] A novel discrete fractional Fourier transform
    Tao, R
    Ping, XJ
    Shen, Y
    Zhao, XH
    2001 CIE INTERNATIONAL CONFERENCE ON RADAR PROCEEDINGS, 2001, : 1027 - 1030
  • [47] Random Discrete Fractional Fourier Transform
    Pei, Soo-Chang
    Hsue, Wen-Liang
    IEEE SIGNAL PROCESSING LETTERS, 2009, 16 (12) : 1015 - 1018
  • [48] THE DISCRETE FREQUENCY FOURIER-TRANSFORM
    JENKINS, WK
    DESAI, MD
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1986, 33 (07): : 732 - 734
  • [49] On the communication complexity of the discrete Fourier transform
    Toledo, S
    IEEE SIGNAL PROCESSING LETTERS, 1996, 3 (06) : 171 - 172
  • [50] FUNDAMENTALS OF DISCRETE FOURIER-TRANSFORM
    RICHARDSON, MH
    SOUND AND VIBRATION, 1978, 12 (03): : 40 - 46