• Proceedings of the KIPE Conference
• /
• 2014.07a
• /
• pp.502-503
• /
• 2014

HEV를 구동시키는 인버터 시스템은 고정 주파수로 스위칭하는 PWM(Pulse Width Modulation)방식으로 구동이 된다. 고정주파수를 이용한 PWM은 전류제어의 주기가 일정하기 때문에 디지털 화가 쉬운 장점을 가지고 있다. 하지만 그로인한 특정 주파수 부분에 고조파가 생성이 되게 되는데 이 고조파로 인해 소음이 유발된다. 하지만 이 소음을 억제하기 위해서 랜덤PWM을 사용하게 되면 전류 제어가 고정주파수로 스위칭하는 PWM에 비해서 완벽하게 되기가 어렵다. 따라서 본 논문에서는 HEV의 소음을 저감시키면서 동시에 전류제어도 가능한 랜덤PWM기반의 전류제어 방법을 연구하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.06a
• /
• pp.225-226
• /
• 2019

본 논문에서는 JPEG Pleno에서 표준 데이터세트로 제공되고 있는 랜덤 위상 홀로그램의 압축 방법을 제시한다. 일반적으로 영상의 노이즈 성분은 압축의 효율을 크게 떨어트린다. 스페클 노이즈가 심한 홀로그램의 경우 일반 영상에 비해 압축률 대비 화질이 좋지 않다. 홀로그램의 시각화를 위한 랜덤 위상의 추가는 스페클 노이즈와 더블어 홀로그램의 압축 효율을 더욱이 떨어트린다. 랜덤 위상 홀로그램에 웨이블릿 기반의 다중 필터링 방법을 적용한다. 다중 필터링 방법은 홀로그램의 특성을 고려하여 에너지 집중도를 최대한 높이는 방법이다. 에너지 집중도가 높을수록 압축 효율이 좋은 Zero-Tree 방식의 압축을 통해 홀로그램을 압축하고 압축률 대비 정량적 화질평가로 그 효율을 분석한다.

• Journal of Internet Computing and Services
• /
• v.21 no.2
• /
• pp.49-55
• /
• 2020

Information theoretic learning (ITL) methods based on random symbols (RS) use a set of random symbols generated according to a target distribution and are designed nonparametrically to minimize the cost function of the Euclidian distance between the target distribution and the input distribution. One drawback of the learning method is that it can not utilize the input power statistics by employing a constant stepsize for updating the algorithm. In this paper, it is revealed that firstly, information potential input (IPI) plays a role of input in the cost function-derivative related with information potential output (IPO) and secondly, input itself does in the derivative related with information potential error (IPE). Based on these observations, it is proposed to normalize the step-size with the statistically varying power of the two different inputs, IPI and input itself. The proposed algorithm in an communication environment of impulsive noise and multipath fading shows that the performance of mean squared error (MSE) is lower by 4dB, and convergence speed is 2 times faster than the conventional methods without step-size normalization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.11-17
• /
• 2003

In this paper, we presented the dynamic random access channel allocation method under the priority based scheduling policy in order to improve the system performance of HIPERLAN/2 standardized by ETSI According to the scheduling policy, AP scheduler primarily allocates the resource to the collision MT This scheduling policy bring about decreasing the transmission delay of collision MT Dynamic RCH(random access channel) allocation method decreases the collision probability by increasing the number of RCH slots in case of low traffic. While it increases the maximum throughput by increasing the number of the data transmission slots in case of high traffic Therefore dynamic allocation method of RCH slots decreases the scheduling delay and increases the throughput When we evaluate the performance of presented method based on standards, we saw that the presented method improve the performance of the MAC protocol in terms of throughput and transmission delay.

• Journal of the Korea Convergence Society
• /
• v.13 no.1
• /
• pp.43-50
• /
• 2022

In this paper, it is shown how the performance of the monopulse algorithm in additive noise is evaluated. In the previous study, the performance analysis of the amplitude-comparison monopulse algorithm was conducted via the first-order and second-order Taylor expansion of four variables. By defining two new random variables from the four variables, it is shown that computational complexity associated with two random variables is much smaller than that associated with four random variables. Performance in terms of mean square error is analyzed from Monte-Carlo simulation. The scheme proposed in this paper is more efficient than that suggested in the previous study in terms of computational complexity. The expressions derived in this study can be utilized in getting analytic expressions of the mean square errors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1313-1320
• /
• 2015

In this paper, we propose a user detection technique based on parallel orthogonal matching pursuit (POMP) for uplink multi-user random access networks (RANs) with a number of users and receiver antennas. In general RANs, it is difficult to estimate the number of users simultaneously transmitting packets at the receiver because users with data send the data without grant of BS. In this paper, therefore, we modify the original POMP for the RAN and evaluate its performances through extensive computer simulations. Simulation results show that the proposed POMP can effectively detect activated users more than about 2%~8% compared with the conventional OMP in RANs.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.938-949
• /
• 2015

In this paper, we propose a robust speed-limit sign recognition system which is durable to any sign changes caused by exterior damage or color contrast due to light direction. For recognition of speed-limit sign, we apply CNN which is showing an outstanding performance in pattern recognition field. However, original CNN uses multiple hidden layers to extract features and uses fully-connected method with MLP(Multi-layer perceptron) on the result. Therefore, the major demerit of conventional CNN is to require a long time for training and testing. In this paper, we apply randomly-connected classifier instead of fully-connected classifier by combining random forest with output of 2 layers of CNN. We prove that the recognition results of CNN with random forest show best performance than recognition results of CNN with SVM (Support Vector Machine) or MLP classifier when we use eight speed-limit signs of GTSRB (German Traffic Sign Recognition Benchmark).

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.355-357
• /
• 2004

센서 네트워크는 계산 용량과 에너지가 제한적이라는 특성을 가지며 그 결과 시스템의 보안관련 요구를 만족시키기 위해 기존 네트워크의 방식을 적용할 수 없다. 본 논문에서는 센서 네트워크의 보안을 위하여 기존 다층화 된 보안구조에서 사용되는 키 분배 방식을 개선함으로써 에너지 소모를 크게 증가시키지 않으며 전체 네트워크의 신뢰도를 개선할 수 있는 방법을 제안한다. 랜덤 그래프의 성질을 이용한 키 분배 방식으로 이를 이용하여 비교적 낮은 에너지 소모와 개선된 신뢰성을 적절히 제공할 수 있다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.2 no.1
• /
• pp.3-14
• /
• 1992

본 논문에서는 ZKIP의 랜덤 정보를 이용한 영지식 키 분배 프로토콜을 제안하였다.제안된 방식은 이미 안전하다고 입증된 ZKIP 을 이용한 개인 식별을 행하고 더 이상의 정보 교환 없이 키 생성을 할 수 있다. 또한 키 분배 프로토콜을 행할 때, 센터에 대한 의존도를 줄이기 위해 확장 Fist-Shamir방식과 Schnorr 방식을 결합하여 인증을 행하도록 하였다. 결합된 프로토콜은 제3자의 일반적인 위장을 방지할 수 있으며, 센터와 가입자의 결탁도 방지할 수 있다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2493-2500
• /
• 1997

We propose a new key management scheme for multiuser group which is classified as hierarchical structure (sometimes it is called a multilevel security hierarchy) in the symmetric key cryptosystem. The proposed scheme is based on the trapdoor one-way permutations which are generated by the pseudo-random permutation algorithm, and it is avaliable for multilevel hierarchical structure composed of a totally ordered set and a partially ordered set, since it has advantage for time and storage from an implemental point of view. Moreover, we obtain a performance analysis by comparing with the other scheme, and show that the proposed scheme is very efficient for computing time of key generation and memory size of key storage.