By Topic

Memory access reduction method for efficient implementation of vector-radix 2D fast cosine transform pruning on DSP

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)
Xiangyang Liu ; Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA ; Wang, Yuke

In this paper, we propose a novel memory access reduction method to minimize the memory accesses due to weighting factors (cosine coefficients in the computation diagram of vector-radix 2D FCT pruning) and input points for implementing vector-radix 2D FCT pruning on DSP processors. The proposed method reduces the number of memory accesses in two steps: 1) Reduce the number of weighting factors and 2) Combine butterflies at two stages in vector-radix 2D FCT pruning diagram to form an efficient butterfly structure in one stage and calculate them. The proposed method is applied to implement vector-radix 2D FCT pruning on TI TMSC320C64x DSP. Experimental results show that the proposed method can achieve average of 47.2% memory access reduction, average of 58.2% clock cycle reduction and average of 20% memory space saving for weighting factors to compute vector-radix 2D fast cosine transform pruning on DSP comparing with the conventional implementation.

Published in:

IEEE SoutheastCon 2010 (SoutheastCon), Proceedings of the

Date of Conference:

18-21 March 2010