C.A. Christopoulos, and A.N. Skodras, " On the computation of the fast cosine transform", Proceedings of the European Conference on Circuit Theory and Design (ECCTD' 93), Davos, Switzerland, pp. 1037-1042, Aug.30 - Sept.3, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Computation of the Two-Dimensional Fast.. - Christopoulos.. (1994) Self-citation (Christopoulos Skodras) (Correct)
....DIF=decimation in frequency, DIS=decimation in space) TABLE I Execution times in milliseconds using different 1D and 2D FCT algorithms. Row Column with 1D FCT Direct 2D Computer NxN [10] 2] 4] [5] [5] Proposed SR DIF SR DIS HP 9000 730 8x8 0.4 0.225 0.175 0.2 0.225 0.1 64 MB RAM 16x16 2 1.23 0.67 0.73 0.87 0.3 76 MIPS 32x32 8.5 5.35 3.5 3.15 2.95 2.5 23 MFLOPS 64x64 75 28.8 23.5 20.6 13.7 12 66 MHz 128x128 450 354 265.2 160 66 60 256x256 3272 1777.5 1377 1165 725 500 It can be ....
....DIF=decimation in frequency, DIS=decimation in space) TABLE I Execution times in milliseconds using different 1D and 2D FCT algorithms. Row Column with 1D FCT Direct 2D Computer NxN [10] 2] 4] 5] [5] Proposed SR DIF SR DIS HP 9000 730 8x8 0.4 0.225 0.175 0.2 0.225 0.1 64 MB RAM 16x16 2 1.23 0.67 0.73 0.87 0.3 76 MIPS 32x32 8.5 5.35 3.5 3.15 2.95 2.5 23 MFLOPS 64x64 75 28.8 23.5 20.6 13.7 12 66 MHz 128x128 450 354 265.2 160 66 60 256x256 3272 1777.5 1377 1165 725 500 It can be observed ....
C.A. Christopoulos, and A.N. Skodras, " On the computation of the fast cosine transform", Proceedings of the European Conference on Circuit Theory and Design (ECCTD' 93), Davos, Switzerland, pp. 1037-1042, Aug.30 - Sept.3, 1993.
Comparative Performance Evaluation Of Algorithms For .. - Christopoulos.. (1994) (2 citations) Self-citation (Christopoulos Skodras) (Correct)
....and moving image compression. We examine the implementation of the 2D FCT through 1D FCT s and the direct 2D FCT algorithm. The 1D FCT algorithms are given in [1,2,7] the split radix decimation in frequency (SR DIF) and the split radix decimation in space (SR DIS) approaches are described in [5]. The direct 2D FCT used is an in place version of the 2D FCT given in [2] it is described in [3] Furthermore, in [3] a vector radix pruning method is described which allows immediate computation of the lowest N 0 xN 0 out of NxN DCT components (where both N and N 0 are powers of two) This ....
....the average values obtained by repeated execution of the algorithms. TABLE I Execution times in milliseconds using different 1D and 2D FCT algorithms. Row Column with 1D FCT Direct 2D Computer NxN [7] 1] 2] [5] [5] 3] SR DIF SR DIS SUN SPARC 8x8 1.0 0.675 0.45 0.425 0.375 0.3 10 41 (OS 4.1.3) 16x16 3.0 2.83 1.7 1.7 1.33 1.27 64 MB RAM 32x32 17 12.5 8.25 7.7 7.5 6.3 96.2 MIPS 64x64 108 74.3 42.4 40.9 32.5 31 17.2 MFLOPS 128x128 582 428.6 286 228 166.4 126 40 MHz 256x256 3718 2389.5 1753.5 1382.5 ....
[Article contains additional citation context not shown here]
C. A. Christopoulos, and A. N. Skodras, " On the computation of the fast cosine transform ", Proceedings of the European Conference on Circuit Theory and Design (ECCTD' 93), Davos, Switzerland, Aug.30 - Sept.3, 1993, pp. 1037-1042.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC