By Topic

An FPGA based parameterisable system for discrete Hartley transforms implementation

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)
Amira, A. ; Sch. of Comput. Sci., Queen''s Univ., Belfast, UK

Discrete Hartley transforms (DHTs) are very important in many types of applications including image enhancement, acoustics, optics, telecommunications and speech signal processing. Two novel architectures for computing DHTs using both systolic architecture and distributed arithmetic design methodologies are presented in this paper. The first approach uses the modified Booth-encoder-Wallace trees multiplication (MBWM) algorithm for a systolic architecture implementation. The second approach is based on distributed arithmetic ROM and accumulator structure. Implementations of the algorithms on a Xilinx FPGA board are described. Distributed arithmetic approach exhibits better performances when compared with the systolic architecture approach.

Published in:

Image Processing, 2003. ICIP 2003. Proceedings. 2003 International Conference on  (Volume:2 )

Date of Conference:

14-17 Sept. 2003