• Annual Conference of KIPS
• /
• 2000.04a
• /
• pp.293-298
• /
• 2000

최근 3차원 그래픽스 분야는 기존의 단순 이미지의 처리가 아닌 보다 나은 화질과 보다 많은 기법의 도입이 요구되어 지고 있다. 이에 본 논문에서는 가장 기본적인 실감영상의 표현 기법인 텍스쳐 매핑 기법에 대하여 논하였고, 3차원의 객체 공간에서 2차원의 스크린 공간으로의 변환으로 인해 생길 수 있는 문제점과 렌더링 알고리즘에 대해 분석하였으며, 이에 부합하는 렌더링 시스템을 설계, 분석하였다. 또한 본 시스템은 고성능 3차원 그래픽 처리를 위하여 채택되어지고 있는 프로세서-메모리 집적 방식을 이용, 래스터라이징 유닛과 프레임버퍼를 단일 칩으로 구성하여 렌더링과 텍스쳐 매핑 과정에서 발생할 수 있는 지연현상을 제거하였다.

• Annual Conference of KIPS
• /
• 2015.04a
• /
• pp.615-617
• /
• 2015

웹 시스템의 구축 방법에는 하나의 서버에 웹 서버와 DB 서버를 모두 설치하여 운영하는 방법과 여러 개의 서버에 나누어 설치하는 경우가 있는데 두 가지 방법 모두 초기 구축 후 사용자가 많아지면 서버에 과부하가 생겨 해당 웹 사이트의 응답 속도가 느려지는 등 정상적으로 동작 하지 않는 문제가 생긴다. 이러한 문제의 해결책으로 서버를 증설하여 부하를 줄이는 방법을 고려할 수 있지만 해당 방법은 비용적인 측면에서 효율적이지 못하다. 그러므로 본 논문에서는 서버에서 동작하는 프레젠테이션 로직을 기존의 전형적인 톰캣 기반의 웹 서버를 노드제이에스 서버로 교체하여 클라이언트 PC의 브라우저에서 동작하도록 하여 서버의 부하를 줄이고, 또 연계되어 설계될 타 서버와의 확장성과 데이터 처리량의 감소를 위해 데이터 전송 방법으로 프로토콜 버퍼를 사용하여 통신하는 자바스크립트 프레임워크를 제시한다.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.579-583
• /
• 2008

본 논문은 이더넷이 비동기식으로 전송됨으로 인해, 동일한 전송속도를 가진 장비라 할지라도 링크가 제공하는 명목상의 최대속도로 전송될 경우, 상호 접속한 장비간의 전송클럭 차이로 인해 프레임의 손실이 발생한다. 본 논문에서는 PHY에서 복원된 수신 클럭과 송신 클럭의 차이를 비교하고 동시에 프레임버퍼에 쌓인 큐를 참조하여 프레임 손실이 방생할 수 있는 임계치를 넘어설 경우, 전송프레임의 프리엠블 길이를 조정함으로써 이더넷 장비에서 전송클럭의 차이로 인한 프레임손실을 줄일 수 있음을 확인하였다.

• Journal of Digital Convergence
• /
• v.12 no.10
• /
• pp.317-327
• /
• 2014

To improve the efficiency of wireless channel, IEEE 802.11ac uses the DL MU-MIMO MAC scheme through which an AP transmits multiple frames to different mobile nodes simultaneously. IEEE 802.11ac DL MU-MIMO MAC needs a new step, called as TXOP sharing, between legacy IEEE 802.11n DL SU-MIMO's two operations, the obtaining an EDCA TXOP and the transmitting multiple frames for EDCA TXOP. In the TXOP sharing operation, both wireless channel destinations and frames transmitted for its TXOP period should are determined. So this paper deals with the TXOP sharing for improving IEEE 802.11ac MAC performance. However, the EDCA priority based method mentioned by IEEE 802.11ac standard document not fair among the buffers and the frames of buffers, and occurs in high_loss rate and high_delay about specific buffers. In this paper, we propose a new scheme of the TXOP sharing with sequencing p-AC, s-AC in similar properties, and all S-AC. This method provides a differentiated service without damage of EDCA characteristics.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.55-64
• /
• 2016

Existing Android applications for streaming video in real time are dependent on the codec, which composes the encoding function, and the version of Android operating system. Also, for streaming video in real time, most applications should be connected with a separate desktop PC. To overcome these disadvantages, we propose a new application, which records and streams video in real time. Specifically, the proposed application uses the flash video file format, which is the common media file format supported by various versions of Android operating system. Through experiments, we show that it is possible for the proposed application to record the video screens more than 20 frames per second and to stream it in real time while using the existing video encoding methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.46-53
• /
• 2013

Recently, intensive research has been performed for reducing video decoder energy consumption, especially based on DVFS (Dynamic Voltage and Frequency Scaling) technique. Our previous work [1] has proposed the optimal DVFS algorithm for energy reduction in video decoders. In spite of the mathematical optimality of the algorithm, the precondition of known frame decoding cycle/complexity limits its application to some realistic scenarios. This paper overcomes this limitation by frame data size-based estimation of frame decoding complexity. The proposed decoding complexity estimation method shows over 90% accuracy. And with this estimation method and buffer underflow margin of around 20% of frame size, almost same power consumption reduction performance as the optimal algorithm can be achieved.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.332-335
• /
• 2007

A real-time frame-layer rate control algorithm with a transmission buffer is proposed for minimizing video quality variation. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize variation in distortion between frames. In order to reflect the buffer status, we use well-known PID control method. Computational complexity of PID control is very low, so the proposed algorithm is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better PSNR performance than the existing rate control method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2009-2014
• /
• 2007

A novel method of minimizing video quality variation is proposed for a real-time frame-layer rate control algorithm with a transmission buffer. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize variation in distortion between frames. In order to reflect the buffer status, we use well-known PID control method. Computational complexity of PID control is very low, so the proposed algorithm is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better PSNR performance than the existing rate control method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.603-612
• /
• 2010

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous VoD system researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose greedy precedent frame transmission technique, GPFT, for guarantee of constant QoS. In GPFT, Streaming VoD server prefetches precedent frames and transmits the frame greedily by increasing the frame transmission rate while the available network bandwidth is high. The GPFT uses the prefetched precedent frames to guarantee the QoS while the available network bandwidth is low. The experiment result shows that the proposed GPFT could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.