EFFICIENT SYSTOLIC SOLUTION FOR A NEW PRIME FACTOR DISCRETE HARTLEY TRANSFORM ALGORITHM

被引：8
|
作者：
MEHER, PK [1 ]
SATAPATHY, JK [1 ]
PANDA, G [1 ]
机构：
[1] REG ENGN COLL,DEPT ELECT ENGN,ROURKELA 769008,INDIA
来源：
IEE PROCEEDINGS-G CIRCUITS DEVICES AND SYSTEMS | 1993年 / 140卷 / 02期
关键词：
ALGORITHMS; SIGNAL PROCESSING; VLSI;
D O I：
10.1049/ip-g-2.1993.0021
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N = 4M, M being prime to 4. In this paper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearly the same hardware requirement as that of the corresponding DFT structure for real-valued data; but it yields significantly higher throughput.
引用
收藏
页码：135 / 139
页数：5
相关论文
共 50 条
  • [41] NEW RADIX-BASED FHT ALGORITHM FOR COMPUTING THE DISCRETE HARTLEY TRANSFORM
    Hamood, M. T.
    Boussakta, S.
    2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 1581 - 1584
  • [42] A new structure for the running discrete Hartley transform
    Xi, JT
    Chicharo, JF
    SIGNAL PROCESSING, 1996, 54 (02) : 179 - 183
  • [43] New algorithms for multidimensional discrete Hartley transform
    Zeng, YH
    Bi, G
    Leyman, AR
    SIGNAL PROCESSING, 2002, 82 (08) : 1086 - 1095
  • [44] A Systolic Array Algorithm Based on Band-Convolution Structure for an Efficient VLSI Implementation of the Odd-Time Generalized Discrete Hartley Transform
    Chiper, Doru Florin
    2019 INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS (ISSCS 2019), 2019,
  • [45] DISCRETE FOURIER-TRANSFORM PROCESSOR BASED ON THE PRIME-FACTOR ALGORITHM
    ARAMBEPOLA, B
    IEE PROCEEDINGS-G CIRCUITS DEVICES AND SYSTEMS, 1983, 130 (04): : 138 - 144
  • [46] Scalable and modular memory-based systolic architectures for discrete Hartley transform
    Meher, Pramod Kumar
    Srikanthan, Thambipillai
    Patra, Jagdish C.
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2006, 53 (05) : 1065 - 1077
  • [47] Fast algorithm for the 3-D Discrete Hartley Transform
    Boussakta, S
    Alshibami, O
    2000 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS, VOLS I-VI, 2000, : 2302 - 2305
  • [48] A HARDWARE EFFICIENT SYSTOLIC SOLUTION TO THE 2-DIMENSIONAL DISCRETE FOURIER-TRANSFORM
    SARKAR, S
    MAJUMDAR, AK
    SEN, RK
    MICROPROCESSING AND MICROPROGRAMMING, 1991, 33 (02): : 111 - 117
  • [49] Fast computation of circular convolution of real valued data using prime factor fast hartley transform algorithm
    Meher, PK
    Panda, G
    JOURNAL OF THE INSTITUTION OF ELECTRONICS AND TELECOMMUNICATION ENGINEERS, 1995, 41 (04): : 261 - 264
  • [50] A VLSI CHIP FOR THE WINOGRAD PRIME FACTOR ALGORITHM TO COMPUTE THE DISCRETE FOURIER-TRANSFORM
    OWENS, RM
    JAJA, J
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1986, 34 (04): : 979 - 989
12345