Toggle Main Menu Toggle Search

Open Access padlockePrints

New vector-radix algorithm for computing two-dimensional discrete Hartley transform

Lookup NU author(s): Monir Hamood


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


© 2014 IEEE.This paper presents an efficient vector-radix fast Hartley transform (VR-22×22-FHT) algorithm for computing the two dimensional discrete Hartley transform (2-D DHT). The proposed algorithm achieves, at the same time, both the speed advantage of the vector-radix-4×4 FHT algorithm and the simplest structural complexity offered by vector-radix-2×2 algorithm. The algorithm is implemented its arithmetic complexity is analysed and compared to the existing 2-D FHT algorithms such as row-column (RC) approach and vector-radix (VR). The result of this comparison has shown that the proposed algorithm significantly reduces the number of operations compared to RC approach and noticeably better performance than VR algorithm.

Publication metadata

Author(s): Hamood MT, Gaeid KS, Ali SH

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 2014 22nd Mediterranean Conference of Control and Automation (MED)

Year of Conference: 2014

Pages: 1026-1030

Online publication date: 20/11/2014

Acceptance date: 01/01/1900

Publisher: IEEE


DOI: 10.1109/MED.2014.6961509

Library holdings: Search Newcastle University Library for this item

ISBN: 9781479959013