By Topic

Efficient parallel processing algorithm for fast calculation of 3D filtering using the VR FHT

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

1 Author(s)
Mohamed Aziz ; School of Electronic and Electrical engineering The University of Bath, UK

in this paper we present an efficient and adaptable three dimensional (3D) parallel filtering algorithm based on the fast 3-D vector-radix fast Hartley transform (3-D VR FHT). This algorithm is suitable for high resolution / high speed multidimensional signal and video processing. The 3-D parallel algorithm is highly efficient as it solves the problems of computations overhead and performance limitations associated with the block filtering method by eliminating the overlapping segments and boundary conditions in the parallel filter structure. It also lifts the restrictions on the input size for high performance, as both the 3-D input data and impulse response of the system are segmented into smaller subsections. These subsections are independent and can be simultaneously processed. The algorithmpsilas structure and mathematical derivation are given and the performance of the algorithm is tested on a real multiprocessor parallel system.

Published in:

Electronics, Circuits and Systems, 2008. ICECS 2008. 15th IEEE International Conference on

Date of Conference:

Aug. 31 2008-Sept. 3 2008