• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.837-840
• /
• 2005

This paper presents 3D graphics lighting processor based on vector processing using pipeline chaining. The lighting process of 3D graphics rendering contains many arithmetic operations and its complexity is very high. For high throughput, proposed processor uses pipelined functional units. To implement fully pipelined architecture, we have to use many functional units. Hence, the number of functional units is restricted. However, with the restricted number of pipelined functional units, the utilization of the units is reduced and a resource reservation problem is caused. To resolve these problems, the proposed architecture uses vector processing using pipeline chaining. Due to its pipeline chaining based architecture, it can perform 4.09M vertices per 1 second with 100MHz frequency. The proposed 3D graphics lighting processor is compatible with OpenGL ES API and the design is implemented and verified on FPGA.

• 대한수학회보
• /
• 제47권1호
• /
• pp.39-51
• /
• 2010

In this paper we consider the uniform central limit theorem for a martingale-difference array of a function-indexed stochastic process under the uniformly integrable entropy condition. We prove a maximal inequality for martingale-difference arrays of process indexed by a class of measurable functions by a method as Ziegler [19] did for triangular arrays of row wise independent process. The main tools are the Freedman inequality for the martingale-difference and a sub-Gaussian inequality based on the restricted chaining. The results of present paper generalizes those of Ziegler [19] and other results of independent problems. The results also generalizes those of Bae and Choi [3] to martingale-difference array of a function-indexed stochastic process. Finally, an application to classes of functions changing with n is given.

• 대한수학회논문집
• /
• 제25권2호
• /
• pp.291-301
• /
• 2010

This paper consists of two main parts. Firstly, we introduce an evolving binomial process from a binomial stock model and consider various types of limiting behavior of the logarithm of the evolving binomial process. Among others we find that the logarithm of the binomial process converges weakly to a Gaussian process. Secondly, we provide new approaches for proving the limit theorems for an integral process motivated by the evolving binomial process. We provide a new proof for the uniform strong LLN for the integral process. We also provide a simple proof of the functional CLT by using a restriction of Bernstein inequality and a restricted chaining argument. We apply the functional CLT to derive the LIL for the IID random variables from that for Gaussian.

• 정보과학회 논문지
• /
• 제43권12호
• /
• pp.1428-1436
• /
• 2016

다중경로 전송은 분할된 경로를 이용하여 데이터를 전달함으로써, 신뢰성 향상 및 부하 분산 등의 장점을 제공한다. 이를 위해, 기존의 다중경로 전송 방안들은 경로를 적절히 분할하거나, 효율적으로 경로를 생성하는 데 목적을 두고 있다. 하지만, 어플리케이션의 요구 또는 핫스팟 문제 회피 등을 위해 싱크가 이동하는 경우, 기존의 연구들은 경로를 재구축 하거나 족적추적 기법을 사용한다. 이 방안들은 과도한 에너지를 소비하여 네트워크 수명을 단축시키거나 경로의 병합으로 다중경로 전송의 장점을 상실하는 문제가 발생한다. 따라서 본 논문에서는 싱크 이동을 지원하기 위한 다중경로 생성 및 유지 방안을 제안한다. 제안 방안은 싱크 주변에 격자구조를 형성하고 이를 활용하여 다중경로를 형성한다. 또, 싱크의 이동에 따라 격자구조는 확장되고 다중경로 역시 경로가 병합되지 않게 부분적으로 재구축된다. 시뮬레이션을 통해 제안방안이 기존의 방안들에 보다 나은 에너지효율 및 전송 성공률을 나타냄을 보인다.