• 한국컴퓨터산업학회논문지
• /
• 제5권3호
• /
• pp.405-414
• /
• 2004

본 논문에서는 18-라운드 변형된 Feistel 구조를 갖는 128-bit 블록 암호알고리즘 Circle-g를 설계하고, 차분공격(differential cryptanalysis)과 선형공격(linear cryptanalysis)을 통해 안정성을 분석하였다. Circle-g의 f-함수는 2-라운드만에 완전 확산(diffusion)이 일어나도록 설계되었다. 이러한 우수한 확산효과로 인해 9-라운드 차분특성이 구성될 확률은 2^{-144}로, 12-라운드 선형특성이 구성될 확률은 2^{-144}로 분석되었다. 결과적으로 Circle-g는 128-bit 비밀키를 적용하였을 경우 12-라운드 이상이면 차분공격이나 선형공격은 전수(exhaustive)조사 방법보다 효율성이 떨어지는 것으로 분석되었다.

• 대한전자공학회논문지SP
• /
• 제47권2호
• /
• pp.69-76
• /
• 2010

본 논문에서는 새로운 고속 다중 참조 프레임 움직임 추정 알고리즘을 제안한다. 제안된 알고리즘은 참조 프레임간의 거리와 움직임 벡터 간의 선형 관계를 이용하여 검색영역을 줄인다. 새로운 알고리즘은 0번 참조 프레임과 1번 참조 프레임에서는 전영역 움직임 추정을 사용한 후, 2번 참조 프레임, 3번 참조 프레임, 4번 참조 프레임에서는 0번 참조 프레임과 1번 참조프레임에서의 움직임 추정의 결과를 사용하여 검색 영역을 최소화 한다. 제안된 알고리즘은 문턱값을 사용하지 않기 때문에 하드웨어 구현과 프로세싱 스케줄을 지정하는 것이 용이하고 많은 연산량을 줄일 수 었다. 이러한 몇 가지 특징으로 인하여 제안된 알고리즘은 다중 참조 프레임 움직임 추정기의 하드웨어 구현에 용이하다. 시뮬레이션 결과는 제안된 알고리즘의 PSNR 감소와 bitrate의 증가가 기존의 고속 다중 창조 프레임 움직임 추정 알고리즘에 비해서 좋은 성능을 나타내고 있고, 연산량은 기존의 5장의 참조 프레임을 사용하는 전영역 검색 방법에 비해서 52.5%의 감소를 나타낸다.

• 대한전자공학회논문지SP
• /
• 제41권6호
• /
• pp.253-260
• /
• 2004

본 논문에서는 정수 웨이블릿 변환(Integer Wavelet Transform)과 선형 예측(Linear Prediction)을 이용한 Hybrid 무손실 오디오 부호화 알고리즘을 제안하였다. 제안된 부호화기는 입력된 신호를 적당한 프레임으로 분할 후, 정수 웨이블릿 변환과 정수 예측기를 사용하여 입력된 오디오 신호내의 상관관계(Correlation)를 제거하였다. 그리고 신호내의 상관이 제거된 신호를 엔트로피 부호화(Entropy Coding) 하였다. 엔트로피 부호화기로는 정수 입력원의 특성에 따라 최적의 압축 효율을 갖는 옵션을 선택적으로 처리하는 Adaptive Golomb-Rice 부호화기법을 이용하였다. 제안된 부호화 방식은 모든 연산을 정수 연산으로 가능케 하므로 기존의 실수를 사용하는 연산과 비교하여 연산 속도의 개선과 시스템의 복잡성을 낮추어 고속처리 및 저전력화가 가능하다. 또한 각 프레임은 독립적으로 부호화되고, 부호화된 데이터는 프레임헤더와 바이트 단위로 정렬이 되도록 데이터 포맷을 설계하여, 압축 부호화된 데이터의 이동, 찾기, 편집이 편리하도록 하였다.

• Journal of Power Electronics
• /
• 제15권3호
• /
• pp.670-684
• /
• 2015

The hybrid cascaded multilevel inverter (HCMLI) is a popular converter topology that is being increasingly used in high power medium voltage drives. The intricacy of the control technique for a HCMLI increases with the number of levels and due to fluctuating dc voltages. This paper presents a novel offline quadrant search based space vector modulation technique to synthesize a sinusoidal output from a dispersed pattern of voltage vectors due to different voltages in the auxiliary unit. Such an investigation has never been reported in the literature and it is being attempted for the first time. The method suggested distributes the voltage vectors for a reduced total harmonic distortion at minimal computation. In addition, the proposed algorithm determines the maximum modulation index in the linear modulation range in order to synthesize a sinusoidal output for both normal and abnormal vector patterns. It is better suited for a wide range of practical applications. It is particularly well suited for renewable source fed inverters which utilize large capacitor banks to maintain the dc link, which are prone to such slow fluctuations. The proposed quadrant search space vector modulation technique is simulated using MATLAB/SIMULINK and implemented using a Nexys-2 Spartan-3E FPGA for a developed prototype.

• 대한음성학회지:말소리
• /
• 제52호
• /
• pp.101-110
• /
• 2004

This paper proposes a new confidence measure for utterance verification with posterior probability approximation. The proposed method approximates probabilistic likelihoods by using Viterbi search characteristics and a clustered phoneme confusion matrix. Our measure consists of the weighted linear combination of acoustic and phonetic confidence scores. The proposed algorithm shows better performance even with the reduced computational complexity than those utilizing conventional confidence measures.

• 대한산업공학회지
• /
• 제10권1호
• /
• pp.3-10
• /
• 1984

A materials acquisition planning (MAP) problem that involves the determination of how much to order of a number of different items from a number of different suppliers is considered. This particular problem is modelled as a nonlinear mixed integer programming problem. A solution procedure based upon the partition of variables is developed to handle the MAP problem. This solution procedure utilizes a modified Hooke-Jeeves Pattern Search procedure along with a linear programming simplex algorithm. An example problem is presented and the results of applying the suggested solution procedure to this problem are reported.

• 대한안전경영과학회지
• /
• 제3권3호
• /
• pp.221-230
• /
• 2001

The assembly tolerance design methods have applied linear or nonlinear programming methods and used simulation method and search algorithms to optimize the tolerance allocation of each part in an assembly. However, those methods are only considered to the relationship between tolerance and manufacturing cost, which do not consider a quality loss cost for each part tolerance. In this paper, the integrated simulation model used genetic algorithm and the Monte-Carlo simulation method was developed for the allocation of the optimal tolerance considering the manufacturing cost and quality loss cost.

• 한국국방경영분석학회지
• /
• 제7권2호
• /
• pp.63-99
• /
• 1981

The generalized goal decomposition model proposed by Ruefli as a single period decision model is presented for the purpose of a review and extended to make a multiple period planning model. The multiple period planning model in the three level organization is formulated with, linear goal deviations by introducing the goal programming method. Dynamic formulation using the generalized goal decomposition model for each single period problem is also presented. An iterative search algorithm is presented as an appropriate solution method of the dynamic formulation of the multiple period planning model.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.609-617
• /
• 2010

This paper is concerned with the use of a selforganizing map (SOM) to estimate the desired channel states of an unknown digital communication channel for blind equalization. The modification of SOM is accomplished by using the Bayesian likelihood fitness function and the relation between the desired channel states and channel output states. At the end of each clustering epoch, a set of estimated clusters for an unknown channel is chosen as a set of pre-defined desired channel states, and used to extract the channel output states. Next, all of the possible desired channel states are constructed by considering the combinations of extracted channel output states, and a set of the desired states characterized by the maximal value of the Bayesian fitness is subsequently selected for the next SOM clustering epoch. This modification of SOM makes it possible to search the optimal desired channel states of an unknown channel. In simulations, binary signals are generated at random with Gaussian noise, and both linear and nonlinear channels are evaluated. The performance of the proposed method is compared with those of the "conventional" SOM and an existing hybrid genetic algorithm. Relatively high accuracy and fast search speed have been achieved by using the proposed method.

• 산업경영시스템학회지
• /
• 제38권3호
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.