• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.2
• /
• pp.86-93
• /
• 2004

The DCT algorithm needs an efficient hardware architecture to compute inner product. The conventional design method, like ROM-based DA(Distributed Arithmetic), has large hardware complexity. Because of this reason, a CSHM(Computation Sharing Multiplication) was proposed for implementing inner product by Park. However, the Park's CSHM has inefficient hardware architecture in the precomputer and select units. Therefore it degrades the performance of the multiplier. In this paper, we presents the optimization design method for inner product using CSHM algorithm and applied it to implementation of 1-D DCT processor. The experimental results show that the proposed multiplier is more efficient than Park's when hardware architectures and logic synthesis results were compared. The designed 1-D DCT processor by using proposed design method is more high performance than typical methods.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.55 no.2
• /
• pp.83-88
• /
• 2006

This paper proposes a method that minimizes the consumed energy by searching the optimal locations of the mass centers of the biped robot's links using Genetic Algorithm. This paper presents a learning controller for repetitive gait control of the biped robot. The learning control scheme consists of a feedforward learning nile and linear feedback control input for stabilization of learning system. The feasibility of learning control to the biped robotic motion is shown via computer simulation and experimental results with 24 DOF biped walking robot.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1707-1714
• /
• 1997

This paper proposes a novel algorithm for fractal coding of image sequence, based on the CPM (Circular Prediction Mapping) and the NCIM (Non Contractive Interframe Mapping). In the CPM and the NCIM, each range block is approximated by a domain block in the adjacent frame, which is of the same size as the range block. Also, in this paepr, we propose a coding scheme of color components and an algorithm for controlling the bit rate, resepectively, for practical implementation of the fractal coder. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, below 256 Kbps.

• Smart Media Journal
• /
• v.7 no.2
• /
• pp.9-14
• /
• 2018

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.27 no.3
• /
• pp.43-49
• /
• 2013

Recently harmonics flowing into power system is increasing as the usage of semiconductor equipments and switching mode power equipments are increasing. Harmonics cause problems such as heat increasing and reduction in capacity of transformers, especially the harmonics flowing into a distribution transformer can lead to the lifetime reduction of transformer. In this paper, we are about to develop a device that can monitor harmonics in real-time as it is affixed to a distribution transformer. Unlike the existing expensive harmonic analysis device, a new harmonic analysis algorithm is proposed in order to implement low-cost equipment. The real-time harmonic analysis algorithm proposed in this paper allows implementation on low performance microcontrollers, thus it can monitor the harmonic in real-time as it is individually affixed to the transformer. Therefore, it would improve the reliability of the transformer and stable power system operation would be possible as it can prevent the transformer accidents in advance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.176-179
• /
• 2010

In this paper, we propose a fast implementation of Bilateral filter for tone mapping algorithm. Bilateral filter is able to preserve detail while at the same time prevent halo-ing artifacts because of improper scale selection by ensuring image smoothed that not only depend on pixel closeness, but also similarity. We accelerate Bilateral filter by using a piecewise linear approximation and recursive Gaussian filter as its domain filter. Recursive Gaussian filter is scale independent filter that combines low cost 1D filter which makes this filter much faster than conventional convolution filter and filtering in frequency domain. The experiment results show that proposed method is simpler and faster than previous method without mortgaging the quality.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.2
• /
• pp.209-222
• /
• 1999

개발 과정의 생산성과 프로그램의 신뢰성을 향상시키기 위하여 소프트웨어 재사용이 매우 중요하며 , 효과적인 재사용을 위해서 세밀한 분류 방법과 정확한 검색 방법에 기반한 객체 지향 재사용 라이브러리가 필수적이다. 본 연구에서는 재사용 라이브러리의 다중 클러스터링(multi-way clustering) 분류 방법과 클러스터 기반 선형 검색(cluster-based linear retrieval) 방법에 유전자 알고리즘(genetic algorithm)을 적용한다. 다중 클러스터링은 부품들이 할당된 클러스터 개수, 클러스터 내부 유사도 그리고 클러스터들 사이의 유사도를 최적화하는 클러스터링을 찾아 부품을 세밀히 분류하는 것이고, 클러스터 기반 선형 검색은 주어진 질의와 유사한 부품을 많이 포함하는 클러스터를 검색하는 것이다. 본 논문에서는 유전자 알고리즘이 시뮬레이티드 어닐링 알고리즘(simulated annealing algorithm) 보다 우수한 해를 찾는 것을 실험을 통하여 보이고, 또한 본 알고리즘을 이용한 CORBA 기반의 재사용 클래스 라이브러리(RCL)를 기술한다.

• Annual Conference of KIPS
• /
• 2018.10a
• /
• pp.285-287
• /
• 2018

최근 정부 및 기업단체에서 배포하는 데이터의 규모가 점점 방대해지고 있다. 민간에서는 이러한 공개데이터를 자유롭게 사용할 수 있으나, 공개 데이터에는 개인의 프라이버시를 침해할 수 있는 개인정보도 포함되어 있다. 그에 따라 대두된 문제가 공개데이터 중 개개인의 정보를 식별해낼 수 없도록 하는 데이터의 비식별화이며 그로 인해서 비식별화에 관한 많은 익명화 기법과 프라이버시 모델이 발표되었다. 그중 본 논문에서 사용하는 Mondrian algorithm은 k-익명화 모델을 사용하여 효과적으로 데이터를 비식별화 할 수 있다. 또한 방대한 웹 데이터 자원 간의 관계를 표현해놓은 RDF 모델은 DB로 변환시켜 k-익명화 방법인 kRDF에 Mondrian algorithm의 Multi-dimensional 방식을 따라 익명화하여 범용적이고 효과적인 개인정보 데이터의 프라이버시 보호를 구현하고자 한다.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.455-460
• /
• 2001

For some applications, the computational structure changes dynamically during the program execution. When this happens, static partitioning and allocation of tasks are not enough to achieve high performance in parallel computers. In this paper, we propose a dynamic load balancing algorithm efficiently distributes the computation with dynamically growing tree structure to processors. We present an implementation technique for the algorithm on mesh architectures, and analyze its complexity. We also demonstrate through experiments how our algorithm provides good quality solutions.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.1014-1017
• /
• 2003

In this paper, after the crypto acceleration board of the server-termination type is designed, we implement the Elliptic Curve Digital Signature Algorithm on the board that serves data integrity and user authentication. For implementing ECDSA, we use crypto co-processor, MPC180, to reduce the computation burden of main Processor (MPC860) on the board. By using crypto co-processor, the computation efficiency in case prime field is improved more between 90 and 100 times than the software library and between 20 and 90 times in case binary field. Our result is expect to apply for SSL acceleration board.