Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Optimized parallel implementation of polynomial approximation math functions on a DSP processor

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

4 Author(s)
Yang, Mei ; Dept. of Comput. Sci., Texas Univ., Richardson, TX, USA ; Wang, Jinchu ; Wang, Yuke ; Zheng, S.Q.

This paper presents a general method to implement polynomial approximation math functions on TMS320C67X architecture with multiple parallel execution units. Our method consists of grain packing, mapping and scheduling to reduce data dependency overhead and fully utilize delay slots. Experimental results of our method on TMS320C67x have achieved up to 70.2% performance improvement over 'C67x library functions

Published in:

Circuits and Systems, 2001. MWSCAS 2001. Proceedings of the 44th IEEE 2001 Midwest Symposium on  (Volume:1 )

Date of Conference:

2001