Please use this identifier to cite or link to this item:
Title: Efficient systolic solution for a new prime factor discrete Hartley transform algorithm
Authors: Meher, P K
Satapathy, J K
Panda, G
Keywords: signal processing
systolic arrays
Issue Date: Apr-1993
Publisher: IEE
Citation: IEE Proceedings G:Circuits, Devices and Systems, Vol 140, Iss 2, P 135-139
Abstract: Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N=4M, M being prime to 4. This paper proposes 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
Description: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEE
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
meher3.pdf310.01 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.