Efficient systolic solution for a new prime factor discrete Hartley transform algorithm

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/54

Full metadata record

DC Field	Value	Language
dc.contributor.author	Meher, P K	-
dc.contributor.author	Satapathy, J K	-
dc.contributor.author	Panda, G	-
dc.date.accessioned	2005-06-08T05:05:11Z	-
dc.date.available	2005-06-08T05:05:11Z	-
dc.date.issued	1993-04	-
dc.identifier.citation	IEE Proceedings G:Circuits, Devices and Systems, Vol 140, Iss 2, P 135-139	en
dc.identifier.uri	http://hdl.handle.net/2080/54	-
dc.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	en
dc.description.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	en
dc.format.extent	317447 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	IEE	en
dc.subject	signal processing	en
dc.subject	systolic arrays	en
dc.title	Efficient systolic solution for a new prime factor discrete Hartley transform algorithm	en
dc.type	Article	en
Appears in Collections:	Journal Articles

Files in This Item:

File	Description	Size	Format
meher3.pdf		310.01 kB	Adobe PDF	View/Open

Show simple item record