DSpace@nitr >
National Institue of Technology- Rourkela >
Journal Articles >

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

Full metadata record

DC FieldValueLanguage
contributor.authorMeher, P K-
contributor.authorSatapathy, J K-
contributor.authorPanda, G-
identifier.citationElectronics Letters, Vol 28, Iss 12, P 1077-1078en
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
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
format.extent163920 bytes-
subjectpicture processingen
subjectspectral analysisen
titleFast computation of multidimensional discrete Hartley transformen
Appears in Collections:Journal Articles

Files in This Item:

File Description SizeFormat
meher5.pdf160KbAdobe PDFView/Open

Show simple item record

All items in DSpace are protected by copyright, with all rights reserved.


Powered by DSpace Feedback