An efficient modified Phong shading algorithm & its low-complexity realization

Ming Hsiu Lai; Ming Feng Yu; Sau-Gee Chen

doi:10.1109/ISCAS.2002.1010424

An efficient modified Phong shading algorithm & its low-complexity realization

Ming Hsiu Lai^*, Ming Feng Yu, Sau-Gee Chen

^*Corresponding author for this work

Department of Electronics Engineering

Research output: Contribution to journal › Conference article › peer-review

4 Scopus citations

Abstract

A modified mixing shading algorithm is proposed, which costs much less operations than that of Phong shading algorithm. Based on the algorithm, a low-complexity shading engine is designed. The shading engine is performed in log space, using low-complexity logarithm and anti-log algorithms. The algorithms are combinations of interpolation algorithm using Taylor's expansion and table-lookup operations. This results in small table size, low complexity and high operation speed. Based on EDA tool simulations, the log-space engine can achieve a high clock rate of 450MHz and a fill rate up to 117.5M pixels/second, with total gate count of 12061.

Original language	English
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	4
DOIs	https://doi.org/10.1109/ISCAS.2002.1010424
State	Published - 1 Jan 2002
Event	2002 IEEE International Symposium on Circuits and Systems - Phoenix, AZ, United States Duration: 26 May 2002 → 29 May 2002

Access to Document

10.1109/ISCAS.2002.1010424

Link to publication in Scopus

Fingerprint Dive into the research topics of 'An efficient modified Phong shading algorithm & its low-complexity realization'. Together they form a unique fingerprint.

Cite this

@article{ac295e67016c422b95a0e625c500ebd2,

title = "An efficient modified Phong shading algorithm & its low-complexity realization",

abstract = "A modified mixing shading algorithm is proposed, which costs much less operations than that of Phong shading algorithm. Based on the algorithm, a low-complexity shading engine is designed. The shading engine is performed in log space, using low-complexity logarithm and anti-log algorithms. The algorithms are combinations of interpolation algorithm using Taylor's expansion and table-lookup operations. This results in small table size, low complexity and high operation speed. Based on EDA tool simulations, the log-space engine can achieve a high clock rate of 450MHz and a fill rate up to 117.5M pixels/second, with total gate count of 12061.",

author = "Lai, {Ming Hsiu} and Yu, {Ming Feng} and Sau-Gee Chen",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/ISCAS.2002.1010424",

language = "English",

volume = "4",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "null ; Conference date: 26-05-2002 Through 29-05-2002",

}

TY - JOUR

T1 - An efficient modified Phong shading algorithm & its low-complexity realization

AU - Lai, Ming Hsiu

AU - Yu, Ming Feng

AU - Chen, Sau-Gee

PY - 2002/1/1

Y1 - 2002/1/1

N2 - A modified mixing shading algorithm is proposed, which costs much less operations than that of Phong shading algorithm. Based on the algorithm, a low-complexity shading engine is designed. The shading engine is performed in log space, using low-complexity logarithm and anti-log algorithms. The algorithms are combinations of interpolation algorithm using Taylor's expansion and table-lookup operations. This results in small table size, low complexity and high operation speed. Based on EDA tool simulations, the log-space engine can achieve a high clock rate of 450MHz and a fill rate up to 117.5M pixels/second, with total gate count of 12061.

AB - A modified mixing shading algorithm is proposed, which costs much less operations than that of Phong shading algorithm. Based on the algorithm, a low-complexity shading engine is designed. The shading engine is performed in log space, using low-complexity logarithm and anti-log algorithms. The algorithms are combinations of interpolation algorithm using Taylor's expansion and table-lookup operations. This results in small table size, low complexity and high operation speed. Based on EDA tool simulations, the log-space engine can achieve a high clock rate of 450MHz and a fill rate up to 117.5M pixels/second, with total gate count of 12061.

UR - http://www.scopus.com/inward/record.url?scp=0036287838&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.2002.1010424

DO - 10.1109/ISCAS.2002.1010424

M3 - Conference article

AN - SCOPUS:0036287838

VL - 4

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

Y2 - 26 May 2002 through 29 May 2002

ER -