• Journal of KIISE
• /
• v.44 no.5
• /
• pp.537-544
• /
• 2017

As a special form of the signed-digit representation, the NAF(non-adjacent form) minimizes the hamming weight by reducing the average density of the non-zero bits from the binary representation of the positive integer k. Due to this advantage, the NAF is used in various fields; in particular, it is actively used in cryptology. The existing NAF-conversion algorithm, however, is problematic because the conversion speed decreases when the LSB(least significant bit) frequently becomes "1" during the binary positive integer conversion process. This paper suggests a method for the improvement of the NAF-conversion speed for which the problems that occur in the existing NAF-conversion process are solved. To verify the performance improvement of the algorithm, the CPU cycle for the various inputs were measured on the ATmega128, a low-performance 8-bit microprocessor. The results of this study show that, compared with the existing algorithm, the suggested algorithm not only improved the processing speed of the major patterns by 20% or more on average, but it also reduced the NAF-conversion time by 13% or more.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.3-8
• /
• 2013

Bit patterned media (BPM) storage is one of the promising technologies to overcome the limitations of the conventional magnetic recording. However, there are some problems in a high areal density BPM storage, inter-track interference, inter-symbol interference and noise which are severely degrading performance of the system with reducing the bit error rate. In this paper, we present a simple iterative two-dimensional equalizer based on the contraction mapping theorem to mitigate these adverse effects. Furthermore, we examine that the channel characteristics of the proposed two-dimensional equalizer satisfies the convergence conditions. In the simulation we demonstrate the bit separation characteristics of the one-dimensional equalizer and the two-dimensional equalizer and evaluate the BER performance of the proposed equalizer comparing with the conventional equalizers. According to the results of experiments, the proposed equalizer is an promising equalizer with maintaining proper complexity for a high areal density BPM storage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.883-889
• /
• 2005

Error backpropagation algorithm of multilayer perceptron may result in local-minima because of the insufficient nodes in the hidden layer, inadequate momentum set-up, and initial weights. In this paper, we proposed the ART-1 based fuzzy supervised learning algorithm which is composed of ART-1 and fuzzy single layer supervised learning algorithm. The Proposed fuzzy supervised learning algorithm using self-generation method applied not only ART-1 to creation of nodes from the input layer to the hidden layer, but also the winer-take-all method, modifying stored patterns according to specific patterns. to adjustment of weights. We have applied the proposed learning method to the problem of recognizing a resident registration number in resident cards. Our experimental result showed that the possibility of local-minima was decreased and the teaming speed and the paralysis were improved more than the conventional error backpropagation algorithm.

• Proceedings of the KIPE Conference
• /
• 2009.11a
• /
• pp.262-264
• /
• 2009

일반적으로, 단위 배터리간의 직/병렬 연결을 통해 구성되는 팩은 이를 구성하는 각 배터리간의 상이한 전기화학적 특성으로 인해 전압 불균형이 존재한다. 이러한 전압 불균형은 팩의 노화 및 성능을 저하시키는 원인이 된다. 이러한 전압불균형을 없애기 위해 전압과 State of Charge(SOC)를 이용한 밸런싱 회로가 폭넓게 연구되고 있다. 하지만, 이러한 연구는 대체적으로, 다른 특성을 가지는 단위 배터리로 구성되는 팩의 밸런싱 방법이다. 따라서, 동일하고 균일한 특성을 갖는 배터리들을 미리 선별하여 팩을 구성한다면, 밸런싱의 전반적인 효율증대가 기대된다. 본 논문에서는 최적의 전압 밸런싱을 위한 스크리닝(Screening)의 새로운 방법을 연구하였다. 용량과 모델 파라미터(Lumped resistance;$R_{Diff}$)를 스크리닝의 척도로 고려하였고, 전압 불균형을 최대한 줄이기 위해 용량, 모델 파라미터의 순으로 스크리닝을 진행하였다. 또한, 전압패턴인식을 이용한 판별법을 통해 제안된 스크리닝 방법을 검증하였다.

• Journal of the Microelectronics and Packaging Society
• /
• v.8 no.1
• /
• pp.61-64
• /
• 2001

VCO(Voltage Contolled Oscillator) is one of the main components governing the size, performance and power consumption of telecommunication devices. As the devices become much smaller, YCO need to hove much smaller size with better characteristics. Buried type passive components of L, C, R were developed previously and the structure of these components are good for minimizing the size of VCO. Our own library of passive components is used in simulation and measurement circuit designed by ourselve. In structure of multi-layered VCO, some components governing the characteristics of VCO are selected and placed on the top of oscilltor for the good tuning process. In resonator part, the stripline structure and low loss glass/ceramic material are used to get higher Q value. In our research, a VCO oscillates in the 2.3~2.36 GHz band is developed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.202-204
• /
• 2005

브로드캐스트 기법은 서버에서 사용자로의 하향 대역폭을 최대한 활용하고 사용자의 수와 무관하게 데이터를 배포할 수 있기 때문에 이동 컴퓨팅 환경에서의 주요한 방식으로 쓰이고 있다. 브로드캐스트 기법에서도 기존 컴퓨팅 환경처럼 여러 트랜잭션이 같은 데이터 항목을 동시에 사용하는 경우가 발생할 수 있다. 하지만 브로드캐스트 환경에서는 모바일 클라이언트의 제한된 자원과 제한된 상향 대역폭 등의 이유로 기존의 동시성 제어 기법을 그대로 사용할 수 없다. 이러한 이유로 무선 브로드캐스트 환경을 위한 동시성 제어 기법들이 많이 연구되어 왔다. 이 논문에서는 트랜잭션들의 접근 패턴이 편향될 경우 발생하게 되는 반복적인 재실행을 문제점으로 인식하고, 동시성 제어 기법에 기반을 둔 기법을 제안한다. 동일한 데이터 항목에 대한 갱신을 수행하는 트랜잭션이 많을수록 트랜잭션이 재실행될 확률은 높아지고 성능은 저하되는데, 이는 검증을 요청하는 트랜잭션들 중 가장 먼저 서버에 도착한 트랜잭션만이 경쟁에서 살아남고 나머지는 재실행되며 경쟁을 다시하기 때문이다. 제안하는 기법에서는 브로드캐스트 사이클이 끝날 때까지 완료 여부의 결정을 유보하면서 검증을 요청한 트랜잭션들의 조합을 구성해 후보 해 리스트를 유지한다. 마지막으로 갱신되는 데이터 항목의 수와 데이터 항목의 갱신 선호도를 기준으로 최적의 해를 선택해 트랜잭션들을 완료하고 데이터베이스에 값을 반영함으로써 트랜잭션의 철회율을 최소화하고 트랜잭션의 완료율을 높일 수 있다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.9
• /
• pp.1299-1305
• /
• 2013

In this paper, we investigate a method of reducing the computational cost in speech recognition by dimensionality reduction of MFCC feature vectors. Eigendecomposition of the feature vectors renders linear transformation of the vectors in such a way that puts the vector components in order of variances. The first component has the largest variance and hence serves as the most important one in relevant pattern classification. Therefore, we might consider a method of reducing the computational cost and achieving no degradation of the recognition performance at the same time by dimensionality reduction through exclusion of the least-variance components. Experimental results show that the MFCC components might be reduced by about half without significant adverse effect on the recognition error rate.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.241-252
• /
• 2006

In cluster file systems, the availability of files has been supported by replicating entire files or generating parities on parity servers. However, those methods require very large temporal and spatial cost, and cannot handle massive failures situation on the file system. So we propose HA-PVFS, a cluster file system supporting high data availability adaptive to temporal locality. HA-PVFS restricts replication or parity generation to some important files, for that it employs an efficient algorithm to estimate file access patterns from limited information. Moreover, in order to minimize the performance degradation of the file system, it uses delayed update method and relay replication.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.195-203
• /
• 2019

Inadequate military soldiers cause military fatigue and rejection such as reduced confidence in the military and combat power. The military developed and applied a self-adopting test as a psychological test system to identify soldiers who are not fit to serve in the military in advance and prevent accidents. In this paper, we propose the ontology design process to be used for identifying accident concerns and implement the behavioral patterns and symptoms of maladjustment soldiers as ontology. The ontology design process is validated consistency and suitability as a result of the performance evaluation of ontology implemented. Through ontology design for identifying maladjustment soldiers, it is expected to play an effective role in preventing accidents by providing objective criteria and sharing of information on accident concerns.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.11
• /
• pp.295-302
• /
• 2018

Face recognition (FR) has been widely used in various applications, such as smart surveillance systems, immigration control in airports, user authentication in smart devices, and so on. FR in well-controlled conditions has been extensively studied and is relatively mature. However, in unconstrained conditions, FR performance could degrade due to undesired characteristics of the input face image (such as irregular facial pose variations). To overcome this problem, this paper proposes a new method for determining if an input image is suitable for FR. In the proposed method, for an input face image, reconstruction error is computed by using a predefined set of reference face images. Then, suitability can be determined by comparing the reconstruction error with a threshold value. In order to reduce the effect of illumination changes on the determination of suitability, a preprocessing algorithm is applied to the input and reference face images before the reconstruction. Experimental results show that the proposed method is able to accurately discriminate non-frontal and/or incorrectly aligned face images from correctly aligned frontal face images. In addition, only 3 ms is required to process a face image of $64{\times}64$ pixels, which further demonstrates the efficiency of the proposed method.