• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2229-2237
• /
• 2000

This paper intends to improve the problems of the slack stealing algorithm scheduling for periodic tasks with fixed priority and aperiodic tasks which occur dynamically. The Slack stealing algorithm reduces unnecessary waiting time by making the service possible immediately when the slack stealing server gives suitable priority to aperiodic tasks according to the status of aperiodic tasks arrivals at runtime. But no performs the slack stealing, we must calculate execution time of periodic tasks till the point of random. And, execution time of periodic tasks is being repeatedly every hours while the slack algorithm is applied. We show time complexity hen is used as to O(n) if the nubmer of tasks which is applied to the calculation is n. In this appear, due to stored in tables slack times and the execution times of the scheduled periodic tasks, the complexity of aperiodic tasks which is occurring dynamically reduced to O(log n) and improves the responses times. We prove the algorithm proposed in this paper through the simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.229-232
• /
• 2012

This paper describes performance evaluation using fixed-point Matlab modeling and simulation, and hardware design of LDPC decoder which is based on Improved Normalized Min-Sum(INMS) decoding algorithm. The designed LDPC decoder supports 19 block lengths(576~2304) and 6 code rates(1/2, 2/3A, 2/3B, 3/4A, 3/4B, 5/6) of IEEE 802.16e mobile WiMAX standard. Considering hardware complexity, it is designed using a block-serial(partially parallel) architecture which is based on layered decoding scheme. A DFU based on sign-magnitude arithmetic is adopted to minimize hardware area. Hardware design is optimized by using INMS decoding algorithm whose performance is better than min-sum algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.33-42
• /
• 2007

Mobile ad-hoc network(MANET) can increase independence and flexibility of network because it consists of mobile node without the aid of fixed infrastructure. But, Because of unrestriction for the participation and breakaway of node, it has the difficulty in management and stability which is a basic function of network operation. Therefore, to solve those problems, we suggest a distributed weighted clustering algorithm from a manageable and stable point of view. The suggested algorithm uses distributed weighted clustering algorithm when it initially forms the cluster and uses a concept which is distributed gateway and sub-cluster head to reduce the re-clustering to the minimum which occurs mobile nodes after forming the cluster. For performance evaluation, We compare DCA and WCA with the suggested algorithm on the basis of initial overhead, resubscriber rate and a number of cluster.

• Journal of the Korea Computer Graphics Society
• /
• v.14 no.1
• /
• pp.27-33
• /
• 2008

Mobile systems have relatively limited resources such as low memory, slow CPU, or low power comparing to desktop systems. In this paper, we present a new 3D mesh connectivity coding algorithm especially optimized for mobile systems(i.e., mobile phones). By using adaptive octree data structure for vertex positions, a new distance-based connectivity coding is proposed. Our algorithm uses fixed point arithmetic and minimizes dynamic memory allocation, appropriate for mobile systems. We also demonstrate test data to show the utility of our mobile 3D mesh codec.

• Management Science and Financial Engineering
• /
• v.19 no.2
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.52-57
• /
• 2006

One of the important functions of an Intelligent Transportation System (ITS) is to classify vehicle types using a vision system. We propose a method using machine-learning algorithms for this classification problem with 3-D object model fitting. It is also necessary to detect road lanes from a fixed traffic surveillance camera in preparation for model fitting. We apply a background mask and line analysis algorithm based on statistical measures to Hough Transform (HT) in order to remove noise and false positive road lanes. The results show that this method is quite efficient in terms of quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2116-2132
• /
• 1994

In this paper, channel equalization techniques for full-digital HDTV systems are investigated Conventional equalization methods are surveyed and several channel are modeled for computer simulation. A VS-LMS (Variable Step size Least Mean Square) algorithm using the time constant concept is proposed and its performance is compared. Several equalization techniques for HDTV systems are simulated based on various channel models, and their characteristics are analyzed. Also the equalizer using fixed-point operations is simulated and its filter structure suitable for high bit rate transmission is also studied.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.775-778
• /
• 2000

2채널의 MPEG-2 Layer-Ⅲ 오디오 복호화 알고리듬이 16비트의 고정소수점 연산기로도 고음질의 오디오출력을 얻을 수 있도록 최적화를 수행하였다. 고음질을 얻기 위하여 고정소수점 연산기에서 발생하는 양자화 오차를 최소화 하였으며 각 복호화 과정 별로 최소의 오차를 발생시키는 알고리듬을 제안하고 사용하였다. 고정소수점 모의실험은 C-언어를 사용하여 수행되었으며, ISO-IEC 13818-4 Compliance Test를 수행하여 최적화된 복호화기가 ISO／IEC 13818-4 audio decoder의 기준을 만족함을 보였다.

• MALSORI
• /
• no.65
• /
• pp.143-152
• /
• 2008

This paper focuses on the real time implementation of an adaptive multi-rate (AMR) speech codec, that is a standard speech codec of IMT-2000, using the TMS320VC5510. The series of TMS320VC55x is a 16-bit fixed-point digital signal processor (DSP) having low power consumption for the use of mobile communications by Texas Instruments (TI) corporation. After we analyze the AMR algorithm and source code as well as the structure and I/O of 7MS320VC55x, we carry out optimizing the programs for real time implementation. The implemented AMR speech codec uses 55.2 kbyte for the program memory and 98.3 kbyte for the data memory, and it requires 709,878 clocks, i.e. about 3.5 ms, for processing a frame of 20 ms speech signal.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.133-136
• /
• 2002

본 연구에서는 뉴우턴법과 모멘트를 이용한 수정된 고정점 알고리즘의 독립성분분석기법을 이용한 영상의 특징추출을 제안하였다. 여기서 뉴우턴법은 엔트로피 최적화로부터 유도된 기법으로 그 계산을 간략화하여 역혼합행렬의 빠른 경신을 위함이고, 모멘트는 접선을 구하는 과정에서 함수의 기울기변화 계산에서 발생하는 발진을 줄여 좀 더 빠른 학습을 위함이다. 제안된 기법을 13개 자연영상들로부터 선택된 12×12 픽셀(pixel)의 10,000개 패치를 대상으로 시뮬레이션 한 결과, 추출된 16×16픽셀의 160개 독립성분 기저벡터 각각은 자연영상들에 포함된 공간적인 주파수 특성과 방향성을 가지는 경계 특성이 잘 드러나는 국부적인 특징들임을 확인할 수 있었다. 또한 모멘트의 이용으로 개선된 특징추출을 얻을 수 있었다.