A new fast recursive algorithm for computing discrete Hartley transform and its implementation

被引：5
|
作者：
Yu, PN [1 ]
Hua, HP [1 ]
机构：
[1] PLA Univ Sci & Technol, Nanjing 210007, Peoples R China
来源：
SIGNAL PROCESSING | 2001年 / 81卷 / 10期
关键词：
discrete Hartley transform (DHT); discrete Fourier transform (DFT); recursive algorithm; arithmetic complexity;
D O I：
10.1016/S0165-1684(01)00112-8
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
The Hartley transform is more efficient and economical than the Fourier transform for real series data processing in several applications. This paper presents a block decomposition representation of discrete Hartley transform (DHT) coefficient matrix in view of algebra, from which a new fast recursive algorithm is derived. As to the DHT calculation of N = 2(t) real sequence, the arithmetic complexity is M = 1/2 N log(2) N - 3/2 N + 2 real multiplications and A = 3/2 N log(2) N - 4/3 N + 3/2 + (-1)(t-1) 1/6 real additions. Obviously, this recursive algorithm belongs to that class with the lowest arithmetic complexity. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：2235 / 2241
页数：7
相关论文
共 50 条
  • [1] NEW FAST DISCRETE HARTLEY TRANSFORM ALGORITHM
    CHAN, YH
    SIU, WC
    [J]. ELECTRONICS LETTERS, 1991, 27 (04) : 347 - 349
  • [2] A FAST RECURSIVE ALGORITHM FOR COMPUTING THE DISCRETE COSINE TRANSFORM
    HOU, HS
    [J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1987, 35 (10): : 1455 - 1461
  • [3] A New Fast Radix-2 Decimation-In-Frequency Algorithm for Computing the Discrete Hartley Transform
    Shah, Gautam A.
    Rathore, Tejmal S.
    [J]. 2009 1ST INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE, COMMUNICATION SYSTEMS AND NETWORKS(CICSYN 2009), 2009, : 363 - +
  • [4] A binary friendly algorithm for computing Discrete Hartley Transform
    Bhatnagar, N
    [J]. DSP 97: 1997 13TH INTERNATIONAL CONFERENCE ON DIGITAL SIGNAL PROCESSING PROCEEDINGS, VOLS 1 AND 2: SPECIAL SESSIONS, 1997, : 353 - 356
  • [5] Radix-2 Fast Algorithm for Computing Discrete Hartley Transform of Type III
    Chiper, Doru Florin
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2012, 59 (05) : 297 - 301
  • [6] A FAST ALGORITHM FOR DISCRETE HARTLEY TRANSFORM OF ARBITRARY LENGTH
    曾泳泓
    [J]. Journal of Electronics(China), 1993, (03) : 209 - 216
  • [7] NEW RADIX-BASED FHT ALGORITHM FOR COMPUTING THE DISCRETE HARTLEY TRANSFORM
    Hamood, M. T.
    Boussakta, S.
    [J]. 2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 1581 - 1584
  • [8] ON COMPUTING THE DISCRETE HARTLEY TRANSFORM
    SORENSEN, HV
    JONES, DL
    BURRUS, CS
    HEIDEMAN, MT
    [J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1985, 33 (05): : 1231 - 1238
  • [9] A FAST RECURSIVE ALGORITHM FOR THE DISCRETE SINE TRANSFORM
    GUPTA, A
    RAO, KR
    [J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1990, 38 (03): : 553 - 557
  • [10] A FAST RECURSIVE ALGORITHM FOR THE DISCRETE W TRANSFORM
    LO, KT
    CHAM, WK
    [J]. CA-DSP 89, VOLS 1 AND 2: 1989 INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND DIGITAL SIGNAL PROCESSING, 1989, : 367 - 370
12345