Prime-factor DCT algorithms

Tatsaki, A.; Dre, C.; Stouraitis, T.; Goutis, C.E.

doi:10.1109/78.370632

Cited by 19 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Alternate indirect and direct approaches to compute the DCT are proposed in the literature [4]. Later advances in the research of DCT algorithms include radix-2 n DCT [5], mixed-radix DCT [6] and prime-factor DCT [7]. The most recently published algorithms such as matrix factorization [8], radix-q & mixed-radix DCT [9], reconfigurable DCT [10] and area optimal DCT [11] belong to the direct category.…”

Section: Introductionmentioning

confidence: 99%

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

Wang

2010

Proceedings of the IEEE SoutheastCon 2010 (SoutheastCon)

View full text Add to dashboard Cite

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 vectorradix 2D fast cosine transform pruning on DSP comparing with the conventional implementation.

show abstract

Section: Introductionmentioning

confidence: 99%

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

Wang

2010

Proceedings of the IEEE SoutheastCon 2010 (SoutheastCon)

View full text Add to dashboard Cite

show abstract

“…The indirect algorithms calculate the 2-D DCT through other transforms such as 2-D fast Fourier transform (FFT) [21,22], 4-D FFT [23], or polynomial transform [24][25][26].…”

Section: Introductionmentioning

confidence: 99%