• The KIPS Transactions:PartC
• /
• v.18C no.5
• /
• pp.361-368
• /
• 2011

In this study, we present a method for efficiently aggregating networks state information required to determine feasible paths in transport networks that uses the source routing algorithm for hierarchical QoS routing. It is proposed to transform the full mesh topology whose Service Boundary Line serves as its logical link into the star topology. This is an aggregation method that can be used when there are two or more QoS parameters for the link to be aggregated in an asymmetric network, and it improves the information accuracy of the star topology. For this purpose, the Service Boundary Line's 3 attributes, splitting, joining and integrating, are defined in this study, and they are used to present a topology transformation method. The proposed method is similar to space complexity and time complexity of other known techniques. But simulation results showed that aggregated information accuracy and query response accuracy is more highly than that of other known method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.603-610
• /
• 2005

Beam-forming method based on the estimated channel information at the base station degrade the performance mismatching directional vector in case of systems which Frequency Division Duplex (FDD) center frequency of uplink and downlink are different. Also blind estimation technique which is to obtain directional vector of reverse link through received signal has disadvantage of hardware complexity increase. To solve these problems, in present paper, a smart antenna algorithm which is to improve the beam-forming complexity increase due to user number by appling the spatial fourier transform to be able to beam- forming toward a wanted direction through adjusting a obtained uplink weight function by estimating Angle-of-Arrival (AoA) to the competable form at the downlink is proposed. The proposed algorithm is integrated to the CDMA downlink transmitter and simulations are performed to confirm the performance as frame error rate at the receiver. As a result, the beam forming effect is confirmed and the performance gain with the proposed algorithm is comparable to ordinary smart antenna system.

• Journal of Broadcast Engineering
• /
• v.20 no.5
• /
• pp.718-727
• /
• 2015

In this paper, we present a novel segmentation method that can extract new foreground objects from a current frame in real-time. It is performed by detecting differences between the current frame and reference frame taken from a fixed camera. We minimize computing complexity for real-time video processing. First DCT (Discrete Cosine Transform) is utilized to generate rough binary segmentation maps where foreground and background regions are separated. DCT shows better result of texture analysis than previous methods where texture analysis is performed in spatial domain. It is because texture analysis in frequency domain is easier than that in special domain and intensity and texture in DCT are taken into account at the same time. We maximize run-time efficiency of DCT by considering color information to analyze object region prior to DCT process. Last we use Guided filter for natural matting of the generated binary segmentation map. In general, Guided filter can enhance quality of intermediate result by incorporating guidance information. However, it shows some limitations in homogeneous area. Therefore, we present an additional method which can overcome them.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.253-260
• /
• 2001

It is important to detect races for debugging shared-memoy parallel programs, because the races cause unintended nondeterministic program execution. Previous on-the-fly techniques to detect races can not guarantee the first race detection in nested parallel programs. Detecting the first race is important for debugging parallel programs, since the removal of the first race may make the next occurred races disappear. In this paper, we presents an on-the-fly detection technique to detect all of the first races through the reexecution of the debugged programs. We assume that the debugged parallel program may have one-way nested parallel programs. The number of reexecution is at the least the nesting depth of the program in the worst case. The space complexity is O(VT) and the time complexity to detect race in each access of access history is O(T), where V is number of shared variables and T is the maximum parallelism of the program. This efficiency of our technique in each execution is the same with the previous on-the-fly detection techniques. Therefore, this technique makes debugging parallel programs more effective and practical.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.385-395
• /
• 2005

Long sentence analysis has been a critical problem in machine translation because of high complexity. The methods of intra-sentence segmentation have been proposed to reduce parsing complexity. This paper presents the intra-sentence segmentation method based on maximum entropy probability model to increase the coverage and accuracy of the segmentation. We construct the rules for choosing candidate segmentation positions by a teaming method using the lexical context of the words tagged as segmentation position. We also generate the model that gives probability value to each candidate segmentation positions. The lexical contexts are extracted from the corpus tagged with segmentation positions and are incorporated into the probability model. We construct training data using the sentences from Wall Street Journal and experiment the intra-sentence segmentation on the sentences from four different domains. The experiments show about $88\%$ accuracy and about $98\%$ coverage of the segmentation. Also, the proposed method results in parsing efficiency improvement by 4.8 times in speed and 3.6 times in space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.188-194
• /
• 2014

V2I(Vehicular to Infrastructure) is a one kind of communication systems which is used between the base stations and mobile objects. In V2I communication system, it is difficult to obtain the desired communication performance. Beamforming technology is to find the optimal path. and it can be improved the communication performance. MUSIC algorithm can be estimated the direction of arrival. The directional vector of received signals and the eigenvector has orthogonal property. MUSIC algorithm uses this property. In V2I communication environment, real time optimal path is changed. By the high computational complexity of the MUSIC algorithm, the optimal path estimation error is generated. In this paper, we propose a method of computation reduction algorithm for MUSIC algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.115-121
• /
• 2006

The efficiency of the multiplier largely depends on the representation of finite filed elements such as normal basis, polynomial basis, dual basis, and redundant representation, and so on. In particular, the redundant representation is attractive since it can simply implement squaring and modular reduction. In this paper, we propose an efficient bit-parallel multiplier for GF(2m) defined by an irreducible all-one polynomial using a redundant representation. We modify the well-known multiplication method which was proposed by Karatsuba to improve the efficiency of the proposed bit-parallel multiplier. As a result, the proposed multiplier has a lower space complexity compared to the previously known multipliers using all-one polynomials. On the other hand, its time complexity is similar to the previously proposed ones.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2071-2078
• /
• 2009

The first frame is encoded in intra mode which generates a larger number of bits. In addition, the first frame is used for the inter mode encoding of the following frames. Thus the intial QP (Quantization Parameter) for the first frame affects the first frame as well as the following frames. Traditionally, the initial QP is determined among four constant values only depending on the bpp. In the case of low bit rate video coding, the initial QP value is fixed to 35 regardless of the output bandwidth. Although this initialization scheme is simple, yet it is not accurate enough. An accurate intial QP prediction scheme should not only depends on bpp but also on the complexity of the video sequence and the output bandwidth. In the proposed scheme, we use a linear model because there is a linear inverse proportional relationship between the output bandwidth and the optimal intial QP. Model parameters of the model are determined depending on the spatial complexity of the first frame. It is shown by experimental results that the new algorithm can predict the optimal initial QP more accurately and generate the PSNR performance better than that of the existing JM algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.1
• /
• pp.43-48
• /
• 2021

One of the effective ways to increase data transmission rate is to use massive antenna technique where tens or hundreds of antennas are deployed in base station and spatial diversity gain is improved by multiuser method. If multiuser method is applied, there will be inter-user interference and maximal ratio combiner (MRC) is conventionally used to reduce the complexity of the receiver and to eliminate interference. However, as the number of mobile devices increases, the performance of the conventional receiver becomes deteriorated. To solve this problem, we propose a new detector that completely eliminates the interference from the registered devices and reduces that from the unregistered devices. Then, to reduce the complexity of the proposed scheme, we propose adaptive algorithm of the proposed scheme. Through simulation, we show that the proposed scheme has better bit error rate performance than the conventional scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.775-777
• /
• 2004

영상 내에 존재하는 사물에 대해서 변화를 감지하는 것은 일반적으로 카메라 영상에서 입력되는 두 개의 순차적인 영상에 대한 연산으로 구현된다. 그런데 카메라 영상을 이용하여 사물을 감지하는 경우 보통 이미지 전체가 아니라 일부에 대해서 관심을 갖게 된다. 따라서 전체 이미지에 대해서 움직임 감지 방법을 적용하는 것은 메모리 낭비와 처리 시간의 증가라는 비효율성을 야기 시킨다. 또, 영상 내에서 여러 개의 움직인 물체를 발견하는 것은 임의적인 물체의 수와 모양 때문에 처리 방법이 복잡하다. 따라서 본 논문에서는 전체 이미지에서 일부분에 대하여 움직임을 감지할 수 있도록 사용자가 처리 구역을 작은 셀 들로 나누어 가상 공간을 설정하고, 나누어진 셀 당 한 물체의 움직임을 감지하는 기법으로 기존 움직임 감지 시스템에 효율성을 제고하고자 한다.