By Topic

Performance evaluation of parallel fast Walsh transform algorithms on a shared-memory multiprocessor computer

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
$33 $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

3 Author(s)
E. T. Ososanya ; Dept. of Electr. Eng., Tennessee Technol. Univ., Cookeville, TN, USA ; Jung-Chi Chen ; Reyes Poo

The Walsh transforms have been used in various digital signal processing applications, such as high definition television (HDTV), processing ultrasonic or X-ray images of the heart in medicine, target tracking and object identification in military applications, and many more image processing applications. As the area of computer applications has broadened, the quantity of data to be transformed has greatly increased. One way of achieving fast transform is to parallelize the transform algorithms used in these applications. The author present the parallelization of three fast Walsh transform algorithms on the Alliant FX/2800 Supercomputer. They examine different parallelization techniques to optimize the computational time, and show how the Alliant architecture may be efficiently used for parallel computation

Published in:

System Theory, 1994., Proceedings of the 26th Southeastern Symposium on

Date of Conference:

20-22 Mar 1994