• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.509-521
• /
• 1988

In the designs of integrated circuits, the buffer circuits used for driving a large capacitive load from minimum-structured logic circuit outputs have important effects upon system throughputs. Therefore it is important to optimize the buffer circuits. In this paper, the principle of designing CMOS buffer circuits which have the minimum delay and drive the given capacitive load is discussed. That is, the effects of load capacitance upon rise time, fall time, and delay of the CMOS inverter and the effects of parasitic capacitances are finely analysed to calculate the requested minimum-delay CMOS buffer condition. This is different from the method by C.A. Mead et. al.[2.3.4.]which deals with passive-load-nMOS buffers. Large channel width MOS transistor stages are necessary to drive a large capacitive load. The effects of polysilicon gate resistances of such large stages upon delay are also analysed.And, the area of buffer circuits designed by the proposed method is smaller than that of buffer circuits designed by C.A. Mead's method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.3
• /
• pp.394-399
• /
• 1987

It is necessary for the speech samples to be stored in memory buffer before speech analyzers without a real time processor process them. In this paper, we propose an algorithm that uses the buffer efficiently, when the analog speech signal is converted to the digital samples by the analog to digital converter. In order to implement this method in real time, the buffer is divided into the starting buffer and the remaining buffer. Until a voiced speech is found, the converted samples are sequentially stored in the starting buffer, and then the buffer is shifted. When a voiced speech is found, the next samples are sequentally recorded in the remaining buffer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1147-1165
• /
• 2011

We present a simple and cost effective rate control scheme for streaming video over a wireless channel by using the information of mobile devices' buffer level. To prevent buffer fullness and emptiness at receivers, the server should be able to adjust sending rate according to receivers' buffer status. We propose methods to adjust sending rate based on the buffer level and discrete derivative of the buffer occupancy. To be compatible with existing network protocols, we provide methods to adjust sending rate by changing the inter-packet delay (IPD) at the server side. At every round-trip time, adjustments of sending rate are made in order to achieve responsiveness to sudden changes of buffer availabilities. A series of simulations and the prototype system showed that the proposed methods did not cause buffer overflows and it can maintain smoother rate control and react to bandwidth changes promptly.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.629-631
• /
• 2004

The proposed output buffer is presented for driving large-size LCD panels. This output buffer is designed by adding some simple circuitry to the conventional two-stage operational amplifier. The proposed circuit is simulated in a high-voltage 0.35um CMOS process with HSPICE. The simulated result is more improved settling time than that of conventional one.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.275-278
• /
• 2001

TOC(Theory of Constraints) - the emphasis of this philosophy was on identifying and eliminating constraints(bottle-necks) in the system. TOC solves this and optimizes whole system by improving manufacturing constraints that limit system result. In this paper, it is shown that the concept of the "delayed differentiation" can be applied for enhancing the efficiency of the time buffer and thus reducing the of the time buffer.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.4
• /
• pp.684-693
• /
• 2011

Measurement time delay in the transfer alignment is very important. It has been well known that the time delay degrades the alignment performance and makes some navigation errors on the transfer alignment of slave INS(SINS). Therefore there are many schemes to eliminate that time delay but the compensation technique through the estimation by Kalman filter through modeling the time delay as a random constant is generally used. In the case of change over measurement time delay or the large measurement time delay, estimation performance in the existing compensation technique is degraded because model of time delay is not correct any more. In this paper, we propose the method to keep the time delay almost constant even though in the abnormal communication state and very small through feedback compensation using double buffer. Double buffer consists of two moving window to temporarily store measurements from master INS and slave INS in real time.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.109-112
• /
• 2002

This paper presents relationship between the dynamic behavior of an asynchronous linear pipeline (ALP) and the performance of the ALP as buffers are allocated. Then the relationship is used in order to characterize a local optimum situation on the buffer design space of the ALP. Using the characterization we propose an efficient algorithm optimizing buffer allocation on an ALP in order to achieve its average case performance. Without the loss of optimality, our algorithm works in linear time complexity so it achieves fast buffer-configuration optimization. This paper makes two contributions. First, it describes relationship between the performance characteristics of an ALP and a local optimum on the buffer design space of the ALP. Second, it devises a buffer allocation algorithm finding an optimum solution in linear time complexity.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.260-264
• /
• 2003

Among many factors to affect the network performance, this paper analyses how the buffer size of NIC(Network Interface Card) can affect web server and LAN(Local Area Network). We use the ns-2 which is defacto network simulation tool to observe the changes in drop rate, throughput, RTT(Round Trip Time), effective throughput depending on varying buffer sizes. And we analyse the effect of NIC buffer size on the web traffic in Ethernet.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.34-40
• /
• 2018

In this study, the optimal buffer size is calculated for seamless video playback on a mobile device. Buffer means the memory space for multimedia packet which arrives in mobile device for video play such as VOD service. If the buffer size is too large, latency time before video playback can be longer. However, if it is too short, playback service can be paused because of shortage of packets arrived. Hence, the optimal buffer size insures QoS of video playback on mobile devices. We model the process of buffering into a discret-time queueing model. Mean busy period length and mean waiting time of Geo/G/1 queue with N-policy is analyzed. After then, we uses the main performance measures to present numerical examples to decide the optimal buffer size on mobile devices. Our results enhance the user satisfaction by insuring the seamless playback and minimizing the initial delay time in VOD streaming process.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.128-133
• /
• 2005

Respond time and processing rate representing how many tasks can be done during an unit time in a client/server environment are generally use for measuring the performance of computers. In this paper, we suggest a window buffer managing scheme based on a window with many of short-term sliced slots where a media stream is allocated and deallocated into them so that it can maximize the utilization ration of the limited buffer on a multimedia server. And we also propose a buffer substitution scheme for reducing I/O times of a multimedia server by counting re-reference time point about a used block and then it can be reused by the next consecutive media stream.