By Topic

Algorithmic-level exploration of discrete signal transforms for partitioning to distributed hardware architectures

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 $33
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)
R. A. Arce Nazario ; Univ. of Puerto Rico, Mayaguez ; M. Jimenez ; D. Rodriguez

High-level partitioning is an essential process for obtaining effective algorithm implementations to distributed hardware architectures (DHAs). Discrete signal transforms (DST) in general have well-known algorithmic properties that can be exploited to improve their partitioning in hardware implementations. A high-level partitioning methodology which uses formulation-level discrete signal transform properties to guide DST partitioning onto DHAs is introduced. It has been discussed how such characteristics were taken into account to focus design exploration during partitioning. A set of experiments carried to determine the effect of formulation-level properties on solution quality are also presented. Perceived patterns in experimental results were used to generate 'partition-friendly' fast Fourier transform (FFT) formulations for DHAs. Results for various FFT sizes achieved over 21% reduction in estimated latency over a general-purpose high-level partitioning method.

Published in:

IET Computers & Digital Techniques  (Volume:1 ,  Issue: 5 )