By Topic

Radix-2 Fast Algorithm for Computing Discrete Hartley Transform of Type III

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

1 Author(s)
Chiper, D.F. ; Dept. of Appl. Electron., Gheorghe Asachi Tech. Univ. of Iasi, Iasi, Romania

In this brief, a new efficient radix-2 fast algorithm for the computation of type-III discrete Hartley transform of length that has a small arithmetic cost and is well suited for a very large-scale integration (VLSI) implementation is presented. This recursive method requires a small number of arithmetic operations compared with existing methods, has a regular and simple computational structure, and can be easily implemented. A small number of arithmetic operations are achieved with the proposed algorithm as compared with existing algorithms. Moreover, the regular and simple computational structure and the existing parallelism of the proposed algorithm offer the possibility of an efficient fast parallel VLSI implementation.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:59 ,  Issue: 5 )