• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.272-277
• /
• 2008

Symmerge is a stable minimum storage merging algorithm that needs $O(m{\log}{\frac{n}{m}})$ element comparisons, where in and n are the sizes of the input sequences with $m{\leq}n$. Hence, according to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The Symmerge algorithm is based on the standard recursive technique of "divide and conquer". The objective of this paper is to consider the relationship between m and n for the degenerated case where the recursion depth reaches m-1.

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

In this paper, we diagnose the fault in the CA analyzer by setting up the initial value such that the final test signature is a constant regardless of the circuit being tested. This method makes the CA test procedure short and clear. In addition, we detect the fault of the faulty input sequence by using the inverse matrix of the CA state transition matrix.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.225-230
• /
• 1996

We propose a statistical test for the nonlinear combiner logics which are usually combined with two maximal Linear Feedback Shift Registers and generate pseudorandom bit sequences. This test uses the mutual information between the output and set of inputs which will be a random variable and its distribution is obeyed to an approximate $\{chi}^2$ -distribution. We adopt this statistic to a $\{chi}^2$ -test of independence by using contingency table. We also apply a proposed test to some non-linear crptosystems and show that this useful to evaluate the strength of the cryptosystems.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.515-521
• /
• 2015

The SymMerge algorithm is an efficient merging algorithm for input sequences u and v of sizes $\left|u \right|=m$ and $\left|v \right|=n$, $m{\leq}n$. We consider complexity analysis for SymMerge algorithm regarding to the required number of comparisons. The focus of the previous complexity analysis was on finding the values of upper bounds, i.e. showing the asymptotical optimality. In this paper, in a different way from the previous complexity analysis, we show that the overall required number of comparisons for two representative special cases "symmetric case" and "maximum spanning case" can be calculated exactly i.e. the least upper bounds regarding to the required number of comparisons are calculated. Symmerge requires exactly $m\;log\frac{n}{m}+4m-logm-3$ comparisons for symmetric case of sizes $m=2^k,\;n=2^l,l{\geq}k$ of input sequences and exactly $\frac{1}{2}m^2+(m+1)logm-\frac{3}{2}m+2$ comparisons for maximum spanning case of sizes $m=2^k,n=2^m-m$ of input sequences. Additionally we show that the complexity of the Symmerge algorithm regarding to the overall required number of comparisons for these special cases can be defined by recurrence relations.

• Proceedings of the KIPE Conference
• /
• 1997.07a
• /
• pp.290-294
• /
• 1997

서인천복합화력발전소의 해수펌프를 속도제어 하여 소내 소비 전력을 절감하고 전동기의 직입기동에 의한 스트레스를 줄이기 위하여 생산기술 개발 과제의 연구개발품 2MVA GTO 인버터를 실증 적용하였다. 적용 시스템은 단위 인버터 병렬운전으로 인버터의 입력측은 병렬다중 방식, 출력측은 직렬다중 방식으로 설계하였다. 인버터에 의한 운전 자료를 기준으로 소비전력을 산정하여 비교하였으며 그 적용 방법과 결과를 보인다[1][2].

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1702-1708
• /
• 2007

Dragon Stream Cipher is proposed for software base implementation in the eSTREAM project. Now this stream cipher is selected as a phase 3 focus candidate. Dragon is a new stream cipher contructed using a single word based NIFSR(non-linear feed back shift register) and 128/256 key/IV(Initialization Vector). Dragon is the keystream generator that produce 64bits of keystream. In this paper, we present an implementation of Drag(m stream cipher algorithm in hardware. Finally, the implementation is on Altera FPGA device, EP3C35F672I and the timing simulation is done on Altera's Quartus II. A result of 111MHz maximum clock rate and 7.1Gbps is throughput is obtained from the implementation.

• Annual Conference on Human and Language Technology
• /
• 1996.10a
• /
• pp.284-297
• /
• 1996

사용자가 컴퓨터와 자연스럽고 인간적으로 대화할 수 있고, 사람의 요구에 지능적인 해답을 능동적으로 제시할 수 있는 사용자 인터페이스 에이전트가 활발히 연구되고 있다. 음성, 펜, 제스쳐인식 등을 비롯한 다양한 방법을 통하여 사람의 의사전달방식을 컴퓨터의 입력수단으로 구현하여 사용자 편의성을 도모하고 있다. 본 논문에서는 컴퓨터를 블랙박스로 하고, 표면적으로 지능형 3차원 그래픽 얼굴 에이전트와 사용자가 의사소통을 하는 사용자 인터페이스를 대상으로 하였다. 컴퓨터가 단순문제 해결을 위한 도구에서 많은 정보를 다양한 매체를 통해 제공하는 보조자의 역할을 수행하게 되었기 때문에 위의 방법은 보다 적극적인 방법이라 할 수 있다. 이를 위한 기반 기술로써 국어를 발음하는 얼굴 애니메이션을 연구하였다. 발음을 표현하기 위한 데이터로써 디지털 카메라를 사용하여 입술 운동의 특징점의 위치를 조사하였고, 모델링 시스템을 개발하여 데이터를 입력하였다. 적은 데이터로도 복잡한 자유곡면을 표현할 수 있는 B-Spline곡면을 기본데이터로 사용하였기 때문에 애니메이션을 위한 데이터의 양 또한 줄일 수 있었다. 그리고 국어음소의 발음시간 수열에 대한 입술모양의 변화를 조사하여 발음소리와 입술 움직임을 동기화 시킨 발음 애니메이션을 구현하였다.

• Proceedings of the KIPE Conference
• /
• 1999.07a
• /
• pp.54-57
• /
• 1999

일산복합화력발전소 소내 중요설비에 전력을 공급하는 무정전 전원장치의 출력측 전압파형의 종합 왜율을 IEEE 출력기준인 5%로 억제하여 설비의 안정적 동작을 확보하기 위하여 고조파 분석을 행하였다. 일산복합의 무정전 전원장치는 제어전원공급용으로서 부하가 콘덴서 입력형 정류기의 특성을 갖고 있으므로 3, 5, 7차의 주요 고조파를 포함하고 있다. 따라서 이들 각각에 대하여 부하측에서 본 무정전 전원장치의 임피던스를 작게 하여 전압종합왜율을 5%이하로 낮추어야 한다. 무정전전원장치의 출력전압, 전류 취득 자료를 분석하여 해당 차수의 고조파 제거와 역류개선을 위한 동조필터의 커패시터와 리액터의 용량을 결정하는 방법을 정리하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.35 no.5
• /
• pp.368-374
• /
• 2016

This paper presents constructing transmitter and receiver by using a direct sequence spread spectrum techniques to DPSK (Differential Phase-Shift Keying) scheme in underwater acoustic communication. Since DPSK signal can be demodulated if the receiver knows only the phase difference between the adjacent bits, DPSK receiver structure has the advantage of being simplified. In the conventional receiver, two adjacent symbols of transmitted signal before despread are passed to the transition correlator that detects data by comparing maximum correlation outputs. At this time, the error for maximum value of the correlator output may increase because of low SNR (Signal to Noise Ratio) or high Doppler shift frequency according to the underwater channel. In this paper, we propose a method for accurate detection result using the width as well as the magnitude among outputs produced by the correlator. The performances of the proposed method was evaluated by simulation and lake trial data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.455-462
• /
• 2010

We investigate the worst case complexity regarding the number of comparisons for a simple and stable merging algorithm. The complexity analysis shows that the algorithm performs O(mlog(n/m)) comparisons for two sequences of sizes m and n $m{\leq}n$. So, according to the lower bound for merging $\Omega$(mlog(n/m)), the algorithm is asymptotically optimal regarding the number of comparisons. For proving the worst case complexity we divide the domain of all inputs into two disjoint cases. For either of these cases we will extract a special subcase and prove the asymptotic optimality for these two subcases. Using this knowledge for special cases we will prove the optimality for all remaining cases. By using this approach we give a transparent solution for the hardly tractable problem of delivering a clean complexity analysis for the algorithm.