• DocumentCode
    1111659
  • Title

    Radix-3 ,\\times, 3 Algorithm for The 2-D Discrete Hartley Transform

  • Author

    Wu, J.S. ; Shu, H.Z. ; Senhadji, L. ; Luo, L.M.

  • Author_Institution
    Centre de Rech. en Inf. Biomed. Sino-Francais (CRIBs), INSERM, Rennes
  • Volume
    55
  • Issue
    6
  • fYear
    2008
  • fDate
    6/1/2008 12:00:00 AM
  • Firstpage
    566
  • Lastpage
    570
  • Abstract
    In this correspondence, we propose a vector-radix algorithm for the fast computation of a 2-D discrete Hartley transform (DHT). For data sequences whose length is a power of three, a radix-3 times 3 decimation in frequency algorithm is developed. It decomposes a length-N times N DHT into nine length-(N/3) times N (N/3) DHTs. Comparison of the computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operations.
  • Keywords
    discrete Hartley transforms; matrix algebra; 2D discrete Hartley transform; computational complexity; data sequences; vector-radix algorithm; 2-D discrete Hartley transform (DHT); 2-D radix-3$,times ,$3; vector-radix algorithm;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems II: Express Briefs, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1549-7747
  • Type

    jour

  • DOI
    10.1109/TCSII.2007.916796
  • Filename
    4476202
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1111659