• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.233-241
• /
• 2004

In this paper, we propose a packet-lossless fast rerouting scheme at a link/node fault in MPLS (Multiprotocol Label Switching) network with minimized accumulated buffer delay problem at ingress node. The proposed scheme uses a predefined, alternative LSP (Label Switched Path) In order to restore user traffic. We propose two restoration approaches. In the first approach, an alternative LSP is initially allocated with more bandwidth than the protected working LSP during the failure recovery phase. After the failure recovery, the excessively allocated bandwidth of the alternative LSP is readjusted to the bandwidth of the working LSP. In the second approach, we reduce the length of protected working LSP by using segment-based restoration. The proposed approaches have merits of (ⅰ) no buffer delay problem after failure recovery at ingress node, and (ⅱ) the smaller required buffer size at the ingress node than the previous approach.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.3
• /
• pp.33-43
• /
• 2000

The guarantee of the fast dynamics stability is essential for successful application of singular Perturbation technique to control systems design. Even though the fast dynamics of the control systems is rendered stable by an analog controller, the fast dynamics stability of the control systems resulted from an digital implementation of the analog controller can be impaired severely. In this paper, we first investigate the time sampling effects on singular perturbation based control systems by centering on a design example of recently developed singular perturbation based STT missile autopilot with high performance. The investigation shows that the stability margin the fast dynamics of the STT misile autopilot system decreases rapidly as the sampling interval of discretizing the analog autopilot increases. Under this analysis, we propose a composite digital controller with compensation for the decreasing stability margin of the fast dynamics due to time sampling to achieve better performance with respect to sampling time. The improved performance of the proposed composite digital controller is verified by simulation. This result shows that one needs to investigate time sampling effects in the digital implementation of singular perturbation based controllder, and then can have benefit from the investigation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.100-106
• /
• 2015

In this paper, we propose a fast algorithm for low-power image enhancement method for mobile LCD. In the proposed fast algorithm, the spatial resolution of the input image is significantly reduced, and the image characteristics are analyzed on the reduced resolution image to find a dimming rate adaptive to the image content, thereby saving power. The proposed fast adaptive dimming and image enhancement algorithm is implemented as an application that runs on an Android device. Image quality evaluation and running time analysis experiments on the device indicate that the proposed fast algorithm jointly minimizes the quality degradation and power consumption, reducing the required computation load by over 95%.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.128-136
• /
• 2008

In this paper, we propose a variable step search fast motion estimation algorithm using local statistics of neighboring motion vectors. Using the degree of correlation between neighboring motion vectors, motion search range is adaptively adjusted to reduce unnecessary search points. Based on the adjusted search range, motion vector is obtained by variable search step. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast full spiral search motion estimation and other fast motion estimation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.231-238
• /
• 2009

DNA sequences are the fundamental information for each species and a comparison between DNA sequences of different species is an important task. Since DNA sequences are very long and there exist many species, not only fast matching but also efficient storage is an important factor for DNA sequences. Thus, a fast string matching method suitable for encoded DNA sequences is needed. In this paper, we present a fast string matching method for encoded DNA sequences which does not decode DNA sequences while matching. We use four-characters-to-one-byte encoding and combine a suffix approach and a multi-pattern matching approach. Experimental results show that our method is about 5 times faster than AGREP and the fastest among known algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.3
• /
• pp.45-55
• /
• 2003

Wireless LAM has the advantage of extension, flexibility and easiness of installation and maintenance. However, due to the characteristics of wireless media, it is vulnerable to security attacks. PKI(Public Key Infrastructure) is estimated to be a good solution offering security function to wireless LAM including global roaming. It offers high security functions as authentication confidentiality and digital signature while it generates big overheads such as CRL search and certificate verification. The overheads can not be avoided during the initial authentication. However, when we consider the case of handoff, it can be minimized through the fast handoff. In this paper, we design a fast handoff authentication mechanism based on PKI in the wireless LAM and analyze the performance of the scheme.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.550-558
• /
• 2020

Successive cancellation (SC) decoding that is one of the decoding algorithms for polar codes has long decoding latency and low throughput because of the nature of successive decoding. To reduce the latency and increase the throughput, various decoding structures for polar codes are presented. In this paper, we compare the previous decoding structures and analyze them by dividing into two types, pruning and multi-path decoders. Decoders for applying pruning are representative of SSC (simplified SC), Fast-SSC and redundant-LLR structures, and decoders with multi-path are representative of 2-bit SC and redundant-LLR structures. All the previous structures are compared in terms decoding latency and hardware area, and according to the comparison, the syndrome check based decoder has the lowest latency and redundant-LLR decoder has the highest hardware efficiency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.1
• /
• pp.84-91
• /
• 2011

To develop the new network, the future network architecture is studied. Since the mobile devices are also advanced, they need for the mobility protocols. The one of the protocols, Fast handovers for proxy MIPv6(PFMIPv6) has studied by the Internet Engineering Task Force(IETF). Since PFMIPv6 adopts the entities and the concepts of fast handovers for MIPv6(FMIPv6) in proxy MIPv6(PMIPv6), it reduces the packet loss. Although the conventional scheme has proposed that it cooperated with an Authentication, Authorization and Accounting (AAA) infrastructure for authentication of a mobile node in PFMIPv6, it has the drawbacks such as high signaling cost and long handover latency. To reduce the signaling cost and the handover latency, we propose an enhanced authentication scheme in Fast handover for Proxy MIPv6. The proposed scheme reduces the handover latency and the signaling cost because the registration procedure and the authentication procedure are simultaneously performed. We also compare the proposed scheme with the conventional scheme in terms of the signaling cost and the handover latency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.405-417
• /
• 2001

In this paper, since we currently using surveillance system of analog type bring about waste of resource and efficiency deterioration problems, we describe new solution that design and implementation to the digital surveillance system of new type applying compression techniques and encoding techniques of image data using MPEG-2 international standard. Also, we proposed fast motion estimation algorithm requires much less than the convectional digital surveillance camera system. In this paper a fast motion estimation algorithm is proposed the MPEG-2 video encoding. This algorithm is based on a hybrid use of the block matching technique and gradient technique. Also, we describe a method of moving object extraction directly using MPEG-2 video data. Since proposed method is very simple and requires much less computational power than the conventional object detection methods. In this paper we don't use specific H/W and this system is possible only software encoding, decoding and transmission real-time for image data.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.105-106
• /
• 2007

We present a fast reconstruction technique for elliptic objects, which can be applied to real-time computer tomography (CT) for simple geometric objects. It will be also shown that only 3 projections are needed to reconstruct an ellipse. A piecewise quadratic model is also proposed for more efficient Kalman filter based support estimation, which is used for the fast reconstruction technique. The performance of the piecewise quadratic model is compared with that of the existing piecewise linear model. Simulation results for the fast reconstruction are also presented.