Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMeher, P K-
dc.contributor.authorSatapathy, J K-
dc.contributor.authorPanda, G-
dc.identifier.citationElectronics Letters, Vol 28, Iss 12, P 1077-1078en
dc.descriptionPersonal 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 IEEen
dc.description.abstractEfficient 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 sizesen
dc.format.extent163920 bytes-
dc.subjectpicture processingen
dc.subjectspectral analysisen
dc.titleFast computation of multidimensional discrete Hartley transformen
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
meher5.pdf160.08 kBAdobe PDFView/Open

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