By Topic

A Novel Split-Radix Fast Algorithm for 2-D Discrete Hartley Transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Longyu Jiang ; Lab. of Image Sci. & Technol., Southeast Univ., Nanjing, China ; Huazhong Shu ; Jiasong Wu ; Lu Wang
more authors

This paper presents a fast split-radix- (2×2)/(8×8) algorithm for computing the 2-D discrete Hartley transform (DHT) of length N ??N with N = q ?? 2 m, where q is an odd integer. The proposed algorithm decomposes an N ?? N DHT into one N /2 ?? N /2 DHT and 48 N /8 ?? N /8 DHTs. It achieves an efficient reduction on the number of arithmetic operations, data transfers and twiddle factors compared to the split-radix-(2??2)/(4??4) algorithm. Moreover, the characteristic of expression in simple matrices leads to an easy implementation of the algorithm. If implementing the above two algorithms with fully parallel structure in hardware, it seems that the proposed algorithm can decrease the area complexity compared to the split-radix-(2??2)/(4??4) algorithm, but requires a little more time complexity. An application of the proposed algorithm to 2-D medical image compression is also provided.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:57 ,  Issue: 4 )