• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.10
• /
• pp.18-25
• /
• 2000

In this paper, we analyze TCP congestion control algorithm over ATM-UBR network. TCP congestion control algorithm consists of slow start, congestion avoidance, fast recovery, fast retransmit. We analyze the ATM-UBR network service using the BSD 4.3 TCP Reno, Vanilla. However we found the fact that the characteristic of fast retransmit, recovery algorithm makes a serious degradation of Performance in multiple losses of packets. We propose new fast retransmit, recovery algorithm to improve the problem. The results of performance analysis improve the multiple losses of packets using a proposed fast retransmit, recovery algorithm.

• Journal of Power System Engineering
• /
• v.6 no.3
• /
• pp.64-70
• /
• 2002

A fast decoupled algorithm for time domain simulation of power electronics circuits is presented. The circuits can be arbitrarily configured and can incorporate feedback amplifier circuits. This simulation algorithm is performed for the input series output parallel connected 2 switch forward converter. Steady state and large signal transient responses due to a step load change are simulated. The simulation results are verified through experiments.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.70-77
• /
• 1984

This paper represents a fast computational algorithm for the discrete sine transform defined by Kekre and Solanki. Techniques are developed to factor the discrete sine trans form matrix into M=log2 2N matrices, where the number(N) of sampled data points is a power of two. Each factorial matrix contains not more than two non-zero real elem tints in any row or column. As a result of this method, the exact a배orithm for the fast discrete sine transform is accomplished. The algorithm is illustiated by a signal flow graph, which may be readily translated to hardware or software implementation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.5
• /
• pp.661-670
• /
• 1995

This paper presents a fast massively parallel automatic test pattern generator for digital combinational logic circuits using neural networks. Automatic test pattern generation neural network(ATPGNN) evolves its state to a stable local minima by exchanging messages among neural network modules. In preprocessing phase, we calculate the essential assignments for the stuck-at faults in fault list by adopting dominator concept. It makes more neurons be fixed and the system speed up. Consequently. fast test pattern generation is achieved. Test patterns for stuck-open faults are generated through getting initialization patterns for the obtained stuck-at faults in the corresponding ATPGNN.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.6
• /
• pp.957-960
• /
• 1986

Two fast methods for a Sobel operator with four directional masks are proposed. They reduce the computation time more than 50% at the expense of a small extra storage locations. Comparisons of the original method and the proposed fast methods are included.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.173-175
• /
• 2013

In this paper, we propose a fast and low-complexity Motion Estimation (ME) algorithm for High Efficiency Video Coding (HEVC). Motion estimation occupies 77~81% of the amount of computation in HEVC. After all, the main key of codec implementation is to find a fast and low-complexity motion estimation algorithm and architecture. The proposed algorithm uses only 1% of the amount of operations compared to full search algorithm while maintaining compression performance with slight loss of 0.6% (BDBR).

• ETRI Journal
• /
• v.32 no.1
• /
• pp.163-165
• /
• 2010

A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order, which is now part of the MPEG-4 scalable complexity 3D mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3D mesh coding extension.

• Journal of the Optical Society of Korea
• /
• v.19 no.3
• /
• pp.260-264
• /
• 2015

We propose a negative liquid crystal (n-LC) cell with parallel patterned electrodes for high transmittance and fast response. The proposed cell has higher transmittance and shorter response time than a conventional fringe-field switching cell using n-LCs, because the proposed cell does not have transmittance dips and does have a thinner LC layer.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.142-142
• /
• 2004

• Journal of the Optical Society of Korea
• /
• v.17 no.2
• /
• pp.200-204
• /
• 2013

We propose a cell structure for the fast switching of liquid crystals by the fringe field. By forming protrusion between patterned electrodes, we can obtain enhancement of response time. The protrusion reduces the effective cell gap, with which a fast response time can be realized. There is little decrease in the transmittance because the protrusion is located between patterned electrodes. We confirmed that the total response time can be decreased by 33% with little loss of the transmittance by optimizing the shape of the protrusion structure.