Partial mipmap generation for texture memory bandwidth saving = 텍스쳐 메모리 대역폭 감소를 위한 부분적인 Mipmap 생성

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 239
  • Download : 0
Texture mapping is commonly used to make scenes realistic in the most current graphics systems. Texture mapping, however, requires high memory bandwidth and low memory latency to obtain good performance. A few studies have been carried out to use cache memory system in texture mapping in order to overcome these problems and those studies show that cache is useful for texture mapping. And a few studies about texture compression shows that texture compression is useful in bandwidth saving. There are a few texture filtering methods. Among them trilinear filtering of mipmapped texture can make the rendered scene most realistic but it requires highest memory bandwidth. In this paper the methods reducing the memory bandwidth required by trilinear filtering is proposed. Trilinear filtering requires eight texels in two adjacent mipmap images per one pixel on texture mapping. Any mipmap image except mipmap image of lowest level is constructed from the mipmap image of lower adjacent level. Partial mipmap generation using these characteristics can make bandwidth required for texture mapping lower. And the effect of partial mipmap generation can increase the throughput of the texture cache.
Advisors
Kim, Lee-Supresearcher김이섭researcher
Description
한국과학기술원 : 전기및전자공학전공,
Publisher
한국과학기술원
Issue Date
2003
Identifier
180535/325007 / 020013279
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전기및전자공학전공, 2003.2, [ iii, 45 p. ]

Keywords

cache; texture; mipmap; 밉맵; 케쉬; 텍스쳐

URI
http://hdl.handle.net/10203/37699
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=180535&flag=dissertation
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0