• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.8
• /
• pp.639-647
• /
• 1990

Dynamic time warp(DTW) needs for interative calculations and the design of PE cell suitable for the operations is very important. Accordingly, this paper aims at the real time recognition design which enables large dictionary hardware realization using DTW algorithm. The DTW PE cell is seperated into three large blocks. "MIN" is the one block for counting accumulated minimum distance, "ADD" block calculates these minimum distances, and "ABS" seeks for the absolute values to the total sum of local distances. We have accomplisehd circuit design and verification for the MIN blocks, and performed MIN layout and DRC(design rule check) using 3um CMOS N-Well rule base.ing 3um CMOS N-Well rule base.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.77-82
• /
• 2015

Recently, multi-user massive MIMO (MU-Massive MIMO) network has attracted a lot of attention as a technology to accommodate explosively increasing mobile data traffic. However, the MU-Massive MIMO network causes a tremendous hardware complexity in a base station and computational complexity to select optimal set of users. In this paper, we thus propose a simple algorithm for selecting antennas and users while reducing the hardware and computational complexities simultaneously. The proposed scheme has a computational complexity of $O((N-S_a+1){\times}min(S_a,K))$, which is significantly reduced compared to the complexity of optimal scheme based on Brute-Force searching, $$O\left({_N}C_S_a\sum_{i=1}^{min(S_a,K)}_KC_i\right)$$, where N, $S_a$, and K denote the number of total transmit antennas, the number of selected antennas, and the number of all users, respectively.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.99-108
• /
• 2001

In the ring loading problem with demand splitting, traffic demands are given for each pall of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum load on the ring. The fastest a1gorithm to date is Myung, Kim and Tcha＇s a1gorithm that runs in Ο(n｜K｜) time where n is the number of nodes and K is the index set of the origin-destination pairs of nodes having flow traffic demands. Here we develop an a1gorithm for the ring loading problem with demand splitting that improves the rerouting step of Myung, Kim and Tcha＇s a1gorithm arid runs in Ο(min{n｜K｜, n$^2$}) time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.332-335
• /
• 2006

This paper considers a facility location problem, which is concerned with locating facilities on a supply chain network and installing the associated equipments at the facilities to meet a given set of demands. The objective function is to minimize the sum of setup cost (facility opening cost and equipment installation cost), operation cost, and distribution cost. For the equipments, various choices of equipment modes need to be determined. Moreover, in the problem, overwork is allowed each facility but at expensive operation cost. The proposed problem is characterized as being NP-hard problem, so that a heuristic algorithm is derived. In order to evaluate the performance of the proposed algorithm, computational experiments with various numerical instances are conducted.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.4
• /
• pp.129-136
• /
• 2002

This paper presents a $H_{\infty}$ robust controller with parameter estimation in polynomial approach. For good performance of a uncertain system, the parameters are estimated by RLS algorithm. The controller minimizes the sum of $H_{\infty}$ norm between sensitivity function and complementary sensitivity function by employing the Youla parameterization and polynomial approach at the same time. A numerical example and its simulation results are given to show the validity of the proposed controller.

• Phonetics and Speech Sciences
• /
• v.7 no.4
• /
• pp.35-40
• /
• 2015

We propose a speech waveform forgery detection algorithm based on the flatness of frequency distribution. We devise a new measure of flatness which emphasizes the local change of the frequency distribution. Our measure calculates the sum of the differences between the energies of neighboring frequency bands. We compare the proposed measure with conventional flatness measures using a set of a large amount of test sounds. We also compare- the proposed method with conventional detection algorithms based on spectral distances. The results show that the proposed method gives lower equal error rate for the test set compared to the conventional methods.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.237-238
• /
• 2008

This paper presents a cognitive radio network where a base station exploits multi-antennas. For the system, a joint power control and user selection greedy algorithm which achieve a significant fraction of sum-capacity at lower complexity cost is proposed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.4
• /
• pp.218-225
• /
• 2009

This paper considers a parallel-machine scheduling problem with job release times and sequence-dependent setup times. The objective of this problem is to determine the allocation policy of jobs and the scheduling policy of machines so as to minimize the weighted sum of setup times, delay times, and tardy times. A mathematical model for optimal solution is derived and a meta heuristic algorithm based on the improved ant colony system is proposed in this paper. The performance of the meta heuristic algorithm is evaluated through compare with optimal solutions using randomly generated several examples.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.1-9
• /
• 2008

As the security requirements of mobile phones have been increasing, there have been extensive researches using one biometric feature (e.g., an iris, a fingerprint, or a face image) for authentication. Due to the limitation of uni-modal biometrics, we propose a method that combines face and iris images in order to improve accuracy in mobile environments. This paper presents four advantages and contributions over previous research. First, in order to capture both face and iris image at fast speed and simultaneously, we use a built-in conventional mega pixel camera in mobile phone, which is revised to capture the NIR (Near-InfraRed) face and iris image. Second, in order to increase the authentication accuracy of face and iris, we propose a score level fusion method based on SVM (Support Vector Machine). Third, to reduce the classification complexities of SVM and intra-variation of face and iris data, we normalize the input face and iris data, respectively. For face, a NIR illuminator and NIR passing filter on camera are used to reduce the illumination variance caused by environmental visible lighting and the consequent saturated region in face by the NIR illuminator is normalized by low processing logarithmic algorithm considering mobile phone. For iris, image transform into polar coordinate and iris code shifting are used for obtaining robust identification accuracy irrespective of image capturing condition. Fourth, to increase the processing speed on mobile phone, we use integer based face and iris authentication algorithms. Experimental results were tested with face and iris images by mega-pixel camera of mobile phone. It showed that the authentication accuracy using SVM was better than those of uni-modal (face or iris), SUM, MAX, NIN and weighted SUM rules.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.36-41
• /
• 2016

LDPC code has beend applied in recent communication standards, such as Wi-Fi, WiGig, 10GBased-T Ethernet as a forward error correction code. However, LDPC code is required a large amount of computational complexity due to large iterations and block lengths for high performances. To solve this problem, various research has been continously performed for reducing computational complexity. In this paper, we propose AFC algorithm to deactive the variable and check node for reduce the computational complexity.