• International Journal of Contents
• /
• 제3권2호
• /
• pp.40-43
• /
• 2007

This paper proposed a new modular inverse algorithm based on the right-shifting binary Euclidean algorithm. For an n-bit numbers, the number of operations for the proposed algorithm is reduced about 61.3% less than the classical binary extended Euclidean algorithm. The proposed algorithm implementation shows substantial reduction in computation time over Galois field GF(p).

• International Journal of Control, Automation, and Systems
• /
• 제2권2호
• /
• pp.165-170
• /
• 2004

RAIM techniques based on TLS have rarely been addressed because TLS requires a great number of computations. In this paper, the particular form of the observation matrix H, is exploited so as to develop a new TLS-based sequential algorithm to identify an errant satellite. The algorithm allows us to enjoy the advantages of TLS with less computational burden. The proposed algorithm is verified through a numerical simulation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.446-449
• /
• 2002

This paper represents a improved data compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet from. Original LZW algorithm efficiently compress a alphabet text file but inefficiently compress a 2 byte completion Hangout text file. To solve this problem, data compression algorithm using 2 byte prefix field and 2 byte suffix field for compression table have developed. But it have a another problem that is compression ratio of alphabet text file decreased. In this paper, we proposes improved LZW algorithm, that is, compression table in the Extended LZW(ELZW) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangout, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1 byte LZW algorithm as 7.0125 percent and superior to 2 byte LZW algorithm as 11.725 percent. This paper represents a improved data Compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet form. This document is an example of what your camera-ready manuscript to ITC-CSCC 2002 should look like. Authors are asked to conform to the directions reported in this document.

• Structural Engineering and Mechanics
• /
• 제2권2호
• /
• pp.125-139
• /
• 1994

A vector algorithm for calculating the stiffness matrices of reinforced concrete shell elements is presented. The algorithm is based on establishing vector lengths equal to the number of elements. The computational efficiency of the proposed algorithm is assessed on a Cray Y-MP supercomputer. It is shown that the vector algorithm achieves scalar-to-vector speedup of 1.7 to 7.6 on three moderate sized inelastic problems.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1331-1342
• /
• 2009

In this paper, we analyze the behavior of the state transition of nongroup CA with a single attractor over GF($2^p$)(p > 1), and propose the algorithm for the construction of the state transition diagram of a Single Attractor CA(SACA) over GF($2^p$) which is very different from the construction algorithm for the state transition diagram of GF(2) SACA.

• 한국인터넷방송통신학회논문지
• /
• 제24권2호
• /
• pp.99-104
• /
• 2024

이진트리의 최소 선형 배열(MinLA) 문제의 해는 선형 복잡도 O(n)의 근사 알고리즘으로 구하고 있으며, k = 10에 대해 다양한 근사 알고리즘 수행 결과가 제시되어 있고, 단지 2개 알고리즘만이 최적 해 3,696을 얻었다. 본 논문은 이진트리의 정확한 해를 O(n) 복잡도로 구하는 알고리즘을 제안하였다. 제안된 알고리즘은 먼저, n = 2^k - 1개 노드들에 중위 탐색(in-order search) 방법으로 번호를 부여하고, 2 ≤ 𝑙 ≤ k-2, (k = 5)와 2 ≤ 𝑙 ≤ k-3, (k = 6) 레벨에 존재하는 노드들에 대해 단 노드 자식들까지의 범위를 대상으로 번호를 재배열하는 방법을 적용하였다. 제안된 알고리즘을 k=5,6,7에 적용한 결과 Chung[14]의 S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min 이론을 증명하였으며, S⁽⁵⁾_min에 대해서는 Chung[14]의 60보다 좋은 58을 얻었다. 또한, 기존의 근사 알고리즘들은 배열 결과를 제시하지 않고 있는데 비해 제안된 알고리즘은 정확한 배열 방법도 제시하는 장점을 갖고 있다. 따라서 제안된 알고리즘은 k > 10인 이진트리에 대해서도 항상 빠르게 최적의 해를 얻을 수 있기 때문에 기존의 근사 알고리즘을 적용하지 않아도 된다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1457-1460
• /
• 1987

2-D shape matching algorithm is proposed which uses pivot vector and componentwise adaptive convergence factor. It is proved that proposed algorithm has better result than any other algorithm. It is to be expected that this algorithm will work effectively in 3-D shape matching.

• 한국멀티미디어학회논문지
• /
• 제19권2호
• /
• pp.479-486
• /
• 2016

In this paper, the algorithm which can convert a 2D image into a 3D Model will be discussed. The 2D picture drawn by a user is scanned for image processing. The Canny algorithm is employed to find the contour. The waterfront algorithm is proposed to find foreground image area. The foreground area is segmented to decompose the complex shapes into simple shapes. Then, simple segmented foreground image is converted into 3D model to become a complex 3D model. The 3D conversion formular used in this paper is also discussed. The generated 3D model data will be useful for 3D animation and other 3D contents creation.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.851-856
• /
• 1987

A direct computation algorithm of two dimensional fast Fourier transform (2D-FFT) is considered here for implementation in mesh connected multiprocessor array of both a 2D-toroidal and a rectangular type. Results are derived for a hardware algorithm including data allocation and interprocessor communications. A performance comparison is carried out between the proposed direct 2D-FFT computation and the conventional one to show that a new algorithm gives higher speedup under a reasonable assumption on the speeds of operations.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.405-406
• /
• 2007

In this paper, we propose feature extraction and tracking algorithm using multi resolution in 2-dimensional wavelet domain. Feature extraction selects feature points using 2-level wavelet transform in interested region. Feature tracking estimates displacement between current frame and next frame based on feature point which is selected feature extraction algorithm. Experimental results show that the proposed algorithm confirmed a better performance than the existing other algorithms.