A power-area efficient geometry engine with low-complexity subdivision algorithm for 3-d graphics system

Lan-Da Van*, Ten Yao Sheu

*此作品的通信作者

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

In this paper, a power-area efficient geometry engine (GE) using a low-complexity three-level subdivision algorithm is presented. The proposed subdivision algorithm and architecture is capable of providing low complexity, high power-area efficiency, scalable and near-Phong shading quality. The forward difference, edge function recovery, dual space subdivision, triangle filtering, and triangle setup coefficient sharing schemes are employed to alleviate the redundant computation for the proposed algorithm. According to the low-complexity subdivision algorithm, one reconfigurable datapath is proposed to save the area since the same set of processing elements (PE) is reused for different operations of GE. Compared with the conventional subdivision algorithm, the proposed subdivision algorithm reduces the number of memory/register accesses for subdivision by 40% and 60.32% for level-1 and level-2 subdivision, respectively. In terms of the number of multiplications for transforms, the reduction can be attained by 27.5% and 60.27% for level-1 and level-2 subdivision, respectively. From the implementation results, the proposed GE can achieve the power-area efficiency of 518.8\Kvertices s•etmW•et-2 for level-1 subdivision.

原文English
文章編號5741869
頁(從 - 到)2211-2224
頁數14
期刊IEEE Transactions on Circuits and Systems I: Regular Papers
58
發行號9
DOIs
出版狀態Published - 7 四月 2011

指紋

深入研究「A power-area efficient geometry engine with low-complexity subdivision algorithm for 3-d graphics system」主題。共同形成了獨特的指紋。

引用此