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/55

Full metadata record

DC FieldValueLanguage
contributor.authorMeher, P K-
contributor.authorSatapathy, J K-
contributor.authorPanda, G-
date.accessioned2005-06-08T05:06:17Z-
date.available2005-06-08T05:06:17Z-
date.issued1993-02-
identifier.citationIEE Proceedings F:Radar and Signal Processing, Vol 140, Iss 1, P 63-70en
identifier.urihttp://hdl.handle.net/2080/55-
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.abstractFast algorithms for computing the DHT of short transform lengths ( N=2,3,4,5,7,8,9 and 16) are derived. A new prime-factor algorithm is also proposed to compute the long-length DHTs from the short-length DHT algorithms. The short-length algorithms (except for N=8 and N=16) are such that the even and the odd parts of the DHT components are obtained directly, without any additional computation. This feature of the short-length algorithms makes the proposed prime-factor DHT algorithm more attractive and efficient. It is found that the proposed algorithm is more efficient compared to the radix-2 FHT in terms of the computational requirements, as well as the execution time for transform lengths higher than 30. It is also observed that the number of operations required for the computation of DHT by the prime-factor FFT algorithm for real-valued data is the same as those of the proposed algorithm for certain transform lengths, e.g. N=30, 60, 252 etc., which do not contain 8 or 16 as a cofactor. However, for all other transform lengths the proposed algorithm has a lower computational complexity. It is further observed that the proposed algorithm is faster than the prime-factor FFT algorithm for real-valued seriesen
format.extent553406 bytes-
format.mimetypeapplication/pdf-
language.isoen-
publisherIEEen
subjectfast Fourier transformsen
titleNew high-speed prime-factor algorithm for discrete Hartley transformen
typeArticleen
Appears in Collections:Journal Articles

Files in This Item:

File Description SizeFormat
meher4.pdf540KbAdobe PDFView/Open

Show simple item record

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

 

Powered by DSpace Feedback