By Topic

An FPGA based accelerator for discrete Hartley and fast Hadamard transforms

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

2 Author(s)
Amira, A. ; Sch. of Comput. Sci., Queen''s Univ., Belfast ; Bouridane, A.

In this paper we present two design methodologies ideally suited for the implementation of discrete Hartley and fast Hadamard transforms which are useful in many types of applications including image and signal processing. The proposed architectures are based on conventional arithmetic and distributed arithmetic principles respectively. In order to efficiently implement the two architectures, Handel-C - a recently developed C-like programming language for compilation of high-level programs directly into FPGA hardware - has been used to interface the VHDL cores developed for the two transforms. The algorithms have been implemented and verified on the Celocixa RC1000 PCI based FPGA board with Xilinx Virtex-2000E FPGA. An evaluation has also been reported based on maximum system frequency and chip area

Published in:

Circuits and Systems, 2003 IEEE 46th Midwest Symposium on  (Volume:2 )

Date of Conference:

30-30 Dec. 2003