This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Operation-Saving VLSI Architectures for 3D Geometrical Transformations
June 2001 (vol. 50 no. 6)
pp. 609-622

Abstract—Two VLSI architectures for the computationally efficient implementation of the elementary 3D geometrical transformations are introduced. The first one is based on a single floating-point multiply/add unit, while the other one comprises a four processing-element vector unit. By exploiting the structure of the elementary transformation matrices, some of the elements of which are ones and zeros, the proposed architectures avoid full-matrix multiplication for the matrix multiplications involved in the calculation of the transformation matrix by treating them as updates of specific elements, the new values of which are obtained by scalar operations in the case of the single-processor architecture or by simple vector operations in the case of the processor array. Thus, the floating-point operation count and the number of memory accesses required by a transformation are reduced and, therefore, the performance of the circuit which computes the transformation matrix, in terms of execution time, is improved at minimal hardware cost. Furthermore, a circuit is proposed which, for each sequence of transformations, selects the most appropriate direction for computing the product of the matrices in the corresponding stack of transformation matrices in order to further reduce the number of floating-point operations compared to the case where the direction of the computation of the successive matrix products is predetermined. The proposed single-processor architecture is suitable for low-cost applications, while the parallel execution scheme implemented by the introduced parallel processor may be implemented by any four-PE processor with small overhead.

[1] J.D. Foley, A. Van Dam, S.K. Feiner, J.F. Hughes, and R.L. Phillips, Introduction to Computer Graphics. Addison-Wesley, 1994.
[2] Digital Signal Processing Applications Using the ADSP-2100 Family. Prentice Hall, 1992.
[3] “Indigo 2 IMPACT Breakthrough Graphics,” http://www.honcad.com/honcad_home-/htmli2graphics.html , Nov. 1996.
[4] 82786 Graphics Coprocessor User's Manual, Intel, 1988.
[5] A. Makoto, O. Tatsushi, Y. Hideki, and S. Shigeru, “3D Graphics Processor Chip Set,” IEEE Micro, vol. 15, no. 6, pp. 37-45, Dec. 1995.
[6] J.H. Clark, “The Geometry Engine: A VLSI Geometry System for Graphics,” Computer Graphics, vol. 16, pp. 127-133, July 1982.
[7] H. Kubosawa, N. Higaki, S. Ando, H. Takahashi, Y. Asada, H. Anbutsu, T. Sato, M. Sakate, A. Suga, M. Kimura, H. Miyake, H. Okano, A. Asato, Y. Kimura, H. Nakayama, M. Kimoto, K. Hirochi, H. Saito, N. Kaido, Y. Nakagawa, and T. Shimada, “A 2.5-GFLOPS, 6.5 Million Polygons per Second, Four-Way VLIW Geometry Processor with SIMD Instructions and a Software Bypass Mechanism,” IEEE J. Solid-State Circuits, vol. 34, pp. 1619-1626, Nov. 1999.
[8] N. Ide, M. Hirano, Y. Endo, S. Yoshioka, H. Murakami, A. Kunimatsu, T. Sato, T. Kamei, T. Okada, and M. Suzuoki, “2.44-GFLOPS 300-MHz Floating-Point Vector-Processing Unit for High-Performance 3D Graphics Computing,” IEEE J. Solid-State Circuits, vol. 35, pp. 1025-1033, July 2000.
[9] Low Power Design Methodologies, J.M. Rabaey and M. Pedram, eds. Kluwer Academic, 1996.
[10] K. Fukushima and N. Wake, “Handwritten Alphanumeric Character Recognition by the Neocognitron,” IEEE Trans Neural Networks, vol. 2, pp. 355-365, 1991.
[11] C.B. Harrell and F. Fouladi, “Graphics Rendering Architecture for a High Performance Desktop Workstation,” Proc. SIGGRAPH, pp. 93-99, 1993.
[12] K.P. Acken, M.J. Irwin, R.M. Owens, and A.K. Garga, “Architectural Optimizations for a Floating Point Multiply-Accumulate Unit in a Graphics Pipeline,” Proc. Int'l Conf. Application Specific Systems, Architectures, and Processors, pp. 65-71, 1996.
[13] B. Parhami, Computer Arithmetic—Algorithms and Hardware Designs. New York: Oxford Univ. Press, 2000.
[14] V. Paliouras, K. Karagianni, and T. Stouraitis, “Error Bounds for Floating-Point Polynomial Interpolators,” IEE Electronics Letters vol. 35, pp. 195-197, Feb. 1999.
[15] J. Cao and B. Wei, “High-Performance Hardware for Function Generation,” Proc. 13th Symp. Computer Arithmetic, pp. 184-188, 1997.
[16] V. Paliouras, K. Karagianni, and T. Stouraitis, “A Floating-Point Processor for Fast and Accurate Sine/Cosine Evaluation,” IEEE Trans. Circuits and Systems-II: Analog and Digital Signal Processing, vol. 47, pp. 441-451, May 2000.
[17] I. Koren, Computer Arithmetic Algorithms.Englewood Cliffs, N.J.: Prentice Hall, 1993.
[18] M.J. Schulte and J.E. Stine, “Symmetric Bipartite Tables for Accurate Function Approximation” Proc. 13th Symp. Computer Arithmetic (ARITH13), pp. 175-183, 1997.
[19] J.D. Foley et al., Computer Graphics: Principles and Practice, Second Edition in C, Addison-Wesley, Reading, Mass., 1995.
[20] S.Y. Kung, VLSI Array Processors. Prentice Hall, 1988.

Index Terms:
Elementary geometrical transformations, VLSI architecture, graphics processor, vector unit.
Citation:
Konstantina Karagianni, Vassilis Paliouras, George Diamantakos, Thanos Stouraitis, "Operation-Saving VLSI Architectures for 3D Geometrical Transformations," IEEE Transactions on Computers, vol. 50, no. 6, pp. 609-622, June 2001, doi:10.1109/12.931896
Usage of this product signifies your acceptance of the Terms of Use.