• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.49 no.11
• /
• pp.757-762
• /
• 2000

This paper presents a digital controller for three-phase Boost Converter. Generally, the conventional Space-Vector Pulse Width Modulation (SVPWM) have complex computation. Thereby, it should be implemented with high performance processor. In order to reduce calculation burden of the conventional SVPWM, digital controller which has a simplified SVPWM algorithm is designed in this study. A proposed digital controller consists of fuzzy pwm controller and prediction controller. In simulations and experiments, the proposed digital controller is validated.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.4
• /
• pp.151-156
• /
• 2021

Low-end IoT devices do not have enough computation and memory resources for DNN learning and inference. Integer quantization of real-type neural network models can reduce model size, hardware computational burden, and power consumption. This paper describes the design and implementation of a web-based quantization platform for CNN deep learning accelerator chips. In the web service platform, we implemented visualization of the model through a convenient UI, analysis of each step of inference, and detailed editing of the model. Additionally, a data augmentation function and a management function of files that store models and inference intermediate results are provided. The implemented functions were verified using three YOLO models.

• Journal of Power Electronics
• /
• v.19 no.1
• /
• pp.168-178
• /
• 2019

Discrete space vector modulation (DSVM) is an effective method to improve the steady-state performance of the finite control set predictive control for permanent magnet synchronous motor drive systems. However, it requires complex computations due to the presence of numerous virtual voltage vectors. This paper proposes an improved finite control set model-free predictive control using DSVM to reduce the computational burden. First, model-free deadbeat current control is used to generate the reference voltage vector. Then, based on the principle that the voltage vector closest to the reference voltage vector minimizes the cost function, the optimal voltage vector is obtained in an effective way which avoids evaluation of the cost function. Additionally, in order to implement double-objective control, a two-level decisional cost function is designed to sequentially reduce the stator currents tracking error and the inverter switching frequency. The effectiveness of the proposed control is validated based on experimental tests.

• Journal of Power Electronics
• /
• v.19 no.3
• /
• pp.751-760
• /
• 2019

Since parameter mismatch seriously impacts the efficiency and stability of induction motor drives, it is important to accurately estimate the rotor and stator resistance. This paper introduces a method to directly calculate the rotor flux that is independent of stator and rotor resistance and electrical angle. It is based on obtaining the rotor and stator resistance using the model reference adaptive system (MRAS) method. The method has a lower computation burden and less adaptation time when compared with other rotor resistance estimation methods. This paper builds three coordinate frames to analyze the rotor flux error and rotor resistance error. A number of implementation issues are also considered.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.45-47
• /
• 2022

Mobile edge computing (MEC), which enables mobile terminals to offload computational tasks to a server located at the user's edge, is considered an effective way to reduce the heavy computational burden and achieve efficient computational offloading. In this paper, we study a multi-user MEC system in which multiple user devices (UEs) can offload computation to the MEC server via a wireless channel. To solve the resource allocation and task offloading problem, we take the total cost of latency and energy consumption of all UEs as our optimization objective. To minimize the total cost of the considered MEC system, we propose an DRL-based method to solve the resource allocation problem in wireless MEC. Specifically, we propose a Asynchronous Advantage Actor-Critic (A3C)-based scheme. Asynchronous Advantage Actor-Critic (A3C) is applied to this framework and compared with DQN, and Double Q-Learning simulation results show that this scheme significantly reduces the total cost compared to other resource allocation schemes

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1288-1296
• /
• 2006

This paper proposes a fast authentication scheme based on hierarchical key structure (HiFA) for roaming mobile nodes in both intra-domain and inter-domain. The full authentication procedure standardized in IEEE 802.11 and 802.16 is difficult to be applied to a handover since it needs a heavy operation and long delay time during a handover. Though a number of schemes were proposed to solve the problem, the existing schemes might degrade the security of authentication or impose heavy administrative burden on the Pome authentication server. The main contribution of this paper is to reduce the communication and computation overhead of the home authentication sewer without degrading the security strength of the fast roaming authentication using hierarchical authentication key structure. The proposed scheme iii this paper decentralizes the administrative burden of the home authentication server to other network entities such as a local authentication server or access point and supports the security separation of the authentication key among local authentication servers using hash key chain.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.12
• /
• pp.1868-1873
• /
• 2021

This paper proposes the Hough transform(HT) using an extended lookup table(LUT) to reduce the computational burden of the HT that is a typical straight line detection algorithm, and analyzes its performance. The conventional HT also uses a LUT to the calculation of the parameter 𝜌 of all straight lines passing through an edge pixel of interest(ePel) in order to reduce the computational burden. However, the proposed HT adopts an extended LUT that can be applied to straight lines across the ePel as well as its peripheral edge pixels to induce more computational reduction. This paper proves the validity of the proposed algorithm mathematically and also verifies it through simulation. The simulation results show that the proposed HT reduces the multiplication computation from 49.6% up to 16.1%, depending on the image and the applied extended LUT, compared to the conventional HT.

• Journal of Advanced Navigation Technology
• /
• v.5 no.1
• /
• pp.1-10
• /
• 2001

Speech has a good characteristics of which car drivers busy to concern with miscellaneous operation can make use in convenient handling and manipulating of devices. By utilizing this, this works proposes a speaker verification method for protecting cars from being stolen and identifying a person trying to access critical on-line services. In this, continuant phonemes recognition which uses language information of speech and MLP(mult-layer perceptron) which has some advantages against previous stochastic methods are adopted. The recognition method, though, involves huge computation amount for learning, so it is somewhat difficult to adopt this in speaker verification application in which speakers should enroll themselves at real time. To relieve this problem, this works presents a solution that introduces speaker cohort models from speaker verification score normalization technique established before, dividing background speakers into small cohorts in advance. As a result, this enables computation burden to be reduced through classifying the enrolling speaker into one of those cohorts and going through enrollment for only that cohort.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.5039-5061
• /
• 2017

Cloud storage becomes a new trend that more and more users move their data to cloud storage servers (CSSs). To ensure the security of cloud storage, many cloud auditing schemes are proposed to check the integrity of users' cloud data. However, most of them are based on public key infrastructure, which leads to complex certificates management and verification. Besides, most existing auditing schemes are inefficient when user uploads a large amount of data or a third party auditor (TPA) performs auditing for multiple users' data on different CSSs. To overcome these problems, in this paper, we propose an efficient and secure auditing scheme based on identity-based cryptography. To relieve user's computation burden, we introduce a proxy, which is delegated to generate and upload homomorphic verifiable tags for user. We extend our auditing scheme to support auditing for dynamic data operations. We further extend it to support batch auditing in multiple users and multiple CSSs setting, which is practical and efficient in large scale cloud storage system. Extensive security analysis shows that our scheme is provably secure in random oracle model. Performance analysis demonstrates that our scheme is highly efficient, especially reducing the computation cost of proxy and TPA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1589-1596
• /
• 2010

In this paper, we propose the method that reduce computational complexity for intermode decision using CBP(coded block pattern) and coded information of colocated-MB(macro block). Proposed method classifies MB into best-CBP and normal-CBP according to the characteristics of CBP. On best-CBP, it eliminates the computation for $8{\times}8$ mode on intermode decision process because the probability for SKIP mode and M-Type mode is 96.3% statistically. On normal-CBP, it selectively eliminates the amount of computation for bit-rate distortion cost, because it uses coded information of colocated-MB and motion vector cost in deciding SKIP mode and M-Type mode. The simulation results show that the proposed method reduces total coding time to 58.44% in average, and is effective in reducing computational burden in videos with little motion.