• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.419-428
• /
• 2003

Several methods have been studied to prune the parasitic branches that cause unfortunately from thinning a shape to get its skeleton. We found that the symmetric path finding method was most efficient because it followed the boundary pixels of the shape just once. In this paper, its extended method is proposed to apply to removing the noise branches that protrude out of the boundary of a segmented or extracted shape in a given image. The proposed method can remove a noise branch with one-pixel width and also remove the noise branch that includes a round shape called a noise blob. The method uses a 4-8-directional boundary-following technique to determine symmetric paths and finds noise branches with noise blobs by detecting quasi-symmetric paths. Its time complexity is a linear function of the number of boundary pixels. Interactively selectable parameters are used to define various types of noise branches flexibly, which are the branch - size parameter and the blob-size parameter. Experimental results for a practical shape and various artificial shapes showed that the proposed method was very useful for simplifying the shapes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.287-299
• /
• 2000

In this paper, we classify multicast methods into three categories, i.e., tree-based, path-based, and hybrid-based multicasts, for a multicomputer employing the bidirectional torus network and wormhole routing. We propose the dynamic partition multicast routing (DPMR) as a path-based algorithm. As a hybrid-based algorithm, we suggest the hybrid multicast routing (HMR), which employs the tree-based approach in the first phase of routing and the path-based approach in the second phase. Performance is measured in terms of the average latency for various message length to compare three multicast routing algorithms. We also compare the performance of wormhole routing having variable buffer size with virtual cut-through switching. The message latency for each switching method is compared using the DPMR algorithm to evaluate the buffer size trade-off on the performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1046-1054
• /
• 2002

In this paper, we propose a subnetwork-based segment restoration scheme to reduce the restoration time and restoration resources. And we compare and analyze the restoration performance according to the size of divided subnetworks. Segment restoration is based on network partitioning where a large network is divided into several small subnetworks and the end-to-end data path is divided into multiple segments according to the subnetworks. In segment restoration, the link/node failure is restored by segment instead of end-to-end path. Because most faults are restored within the subnetwork, the restoration performance can be improved. From the simulation analysis, we verified that the proposed segment restoration has advantage of restoration time and backup resource utilization.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.3
• /
• pp.121-127
• /
• 1998

In this paper, using diversity and convolution code in the DS/CDMA system, have been the performance analized. In this modulation shceme is using QPSK. Channel to CDMA system has been approximated by Rayleight fading channel considering effect for multi-path. In this assumed that receiver is WTDL(Wide-band Tappped Delay Line) receiver, and in this condition, average error probability of DS/CDMA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10A
• /
• pp.1794-1801
• /
• 2001

다중 반송파 변조의 일종인 OFDM(Orthogonal Frequency Division Multiplexing) 방식은 기존의 주파수 분할 다중화 기법에 각 부 채널들 사이의 직교성까지 보장함으로써 사용 주파수 효율을 극대화시킬 수 있는 방식이다. 그러나 주파수 비 선택적 다중경로 채널에서 높은 데이터 율을 갖는 OFDM 신호의 전송은 주파수 영역에서 인접 심벌간 간섭과 동일한 형태를 갖는 승산성 왜곡에 의해 영향을 받는다. 본 논문에서는 결정 궤환 시퀀스 등화기를 OFDM 시스템에 적용하여 신호를 등화하고, 등화를 통하여 주파수 영역에서의 인접 심벌간 간섭을 보상하는 방법을 제안한다. 결정 궤환 시퀀스 등화를 이용하여 최우 시퀀스 등화가 갖는 복잡도를 크게 줄이면서 주파수 오프셋이 추정될 수 있음을 설명하고 모의 실험을 통해 OFDM 시스템의 성능 개선을 보인다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.34-40
• /
• 2018

This paper presents a new method to estimate the pose of a moving object accurately using a monocular camera and a low-end GPS+IMU sensor system. For this goal, we adopted a deep neural network for the semantic segmentation of input images and compared the results with a semantic map of a neighborhood. In this map matching, we use weight tables to deal with label inconsistency effectively. Signals from a low-end GPS+IMU sensor system are used to limit search spaces and minimize the proposed function. For the evaluation, we added noise to the signals from a high-end GPS-IMU system. The results show that the pose can be recovered from the noisy signals. We also show that the proposed method is effective in handling non-open-sky situations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.871-879
• /
• 2009

The performance variations of a spatio temporal smart antenna which is equipped at the basestation of CDMA cellular communication network due to the parametric change of multipath fading environment are studied in this paper. The smart antenna of interest employs space diversity based adaptive array structure in conjunction with rake receiver that has fingers the number of which is the same as that of multipath links. The beamforming is achieved via LMS(Least Mean Square) algorithm in which a reference signal is generated using decision directed formula. It has been shown by computer simulation that the performance of our smart antenna of interest depends significantly upon not only the degree of desired signal's DOA(Direction of Arrival)spread but the number of fingers of the rake receiver. The relative insensitivity of the smart antenna's performance on desired signal's delay spread has also been observed. Computer simulation has shown that the increase of the number of fingers brings in a nonlinear enhancement of the performance of our smart antenna. The renewal of weight vector in the beamforming procedure is taken place at post PN despread stage.

• Journal of Digital Contents Society
• /
• v.13 no.1
• /
• pp.37-41
• /
• 2012

In this paper, we proposed FPGA algorithm for consider the power consumption. Proposed algorithm generated a feasible cluster by circuit partition considering the CLB condition within FPGA. Separated the feasible cluster reduced power consumption using glitch removal method. Glitch removal appled delay buffer insertion method by signal process within the feasible cluster. Also, removal glitch between the feasible clusters by signal process for circuit. The experiments results show reduction in the power consumption by 7.14% comparing with that of [9].

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.52-54
• /
• 2004

Ad-hoc 네트워크는 기존의 유선 네트워크와 달리 여러 가지 제약을 갖고 있다. 그 중에서 가장 큰 제약은 배터리에 저장된 한정된 에너지에 의존해서 동작한다는 것이다. 어떤 모바일 노드가 배터리에 저장된 에너지를 모두 소비하게 되면, 그 노드는 더 이상 네트워크에 참여할 수 없게 된다. 이러한 현상이 증가하게 되면 네트워크가 두 개 이상의 서브 네트워크로 분할되는 문제가 발생할 수 있다. 이러한 문제를 해결하기 위해서 라우팅을 통하여 에너지 소비를 좀 더 효율적으로 네트워크로 분산시키기 위한 RDRP(Request Delay Routing Protocol)와 MMRP(Max Min Routing Protocol) 프로토콜들이 제안되었다. 본 논문에서는 에너지 상태에 따라 플러딩(Flooding)을 지연시키는 RDRP 방법에 현재 형성된 라우팅 경로까지 함께 고려한 EP-AODV(AODV considering Energy and Path)를 제안한다. 또한, NS-2(Network Simulator 2) 시뮬레이터를 이용한 성능 평가를 통하여 본 논문에서 제안된 프로토콜이 좀 더 에너지 소비를 네트워크 전체로 효율적으로 분산시킨다는 것을 보일 것이다.