Fast computation of multidimensional discrete Hartley transform

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

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:07:17Z	-
dc.date.available	2005-06-08T05:07:17Z	-
dc.date.issued	1992-06-04	-
dc.identifier.citation	Electronics Letters, Vol 28, Iss 12, P 1077-1078	en
dc.identifier.uri	http://hdl.handle.net/2080/56	-
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	Efficient algorithms for the fast computation of 2D and 3D discrete Hartley transforms have been proposed. It is shown that the proposed algorithms offer a significant saving in computation over the existing methods for various array sizes	en
dc.format.extent	163920 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	IEE	en
dc.subject	picture processing	en
dc.subject	spectral analysis	en
dc.title	Fast computation of multidimensional discrete Hartley transform	en
dc.type	Article	en
Appears in Collections:	Journal Articles

Files in This Item:

File	Description	Size	Format
meher5.pdf		160.08 kB	Adobe PDF	View/Open