• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.253-255
• /
• 2022

Thanks to the 4th industrial revolution and the development of various communication media, technologies such as artificial intelligence and automation are being grafted into industrial sites in various fields, and accordingly, the importance of data processing is increasing. Image noise removal is a pre-processing process for image processing, and is mainly used in fields requiring high-level image processing technology. Various studies have been conducted to remove noise, but various problems arise in the process of noise removal, such as image detail preservation, texture restoration, and noise removal in a special area. In this paper, we propose a switching mask filter based on the noise intensity to preserve the detailed image information during the impulse noise removal process. The proposed filter algorithm obtains the final output by switching to the extended mask when it is determined that the density is higher than the reference value when noise is determined in the area designated as the filtering mask. Simulation was conducted to evaluate the performance of the proposed algorithm, and the performance was analyzed compared to the existing method.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.131-135
• /
• 2007

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• ETRI Journal
• /
• v.21 no.2
• /
• pp.22-30
• /
• 1999

In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(\log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+${\varepsilon}$) memory cells for some positive constant ${\varepsilon}\>0$, our algorithm consumes less memory cells without increasing the total number of operations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.29-35
• /
• 2009

An efficient stochastic channel selection algorithm for cognitive radio networks is proposed and analyzed in this paper. With the new algorithm utilizing quality of channels, the stationary level of the channels in idle state and history performance, we can find the best channel for secondary users to transmit data. Moreover, this method not only restricts channel switching of secondary users but also adapts to random resource environment of cognitive radio network. The advantages of the proposed algorithm are demonstrated clearly through computer simulation.

• Journal of Mechanical Science and Technology
• /
• v.15 no.3
• /
• pp.339-350
• /
• 2001

To overcome problems in tracking error related to the unmodeled dynamics in the high speed operation of industrial robots, many researchers have used sliding mode control, which is robust against parameter variations and payload changes. However, these algorithms cannot reduce the inherent chattering which is caused by excessive switching inputs around the sliding surface. This study proposes a fuzzy-sliding mode control algorithm to reduce the chattering of the sliding mode control by fuzzy rules within a pre-determined dead zone. Trajectory tracking simulations and experiments show that chattering can be reduced prominently by the fuzzy-sliding mode control algorithm compared to a sliding mode control with two dead zones, and the proposed control algorithm is robust to changes in payload. The proposed control algorithm is implemented to the SCARA (selected compliance articulated robot assembly) robot using a DSP (digital signal processor) for high speed calculations.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.2 no.4
• /
• pp.88-94
• /
• 2003

The DC motor has the strong characteristics in the speed response, the system parameter variations and the external influence and is used as the speed controller with its good starting torque in the distributing industry. However development of the Microprocessor which is for high speed switching program can make better control system. This paper introduce to design of the high-effective DC motor controller that is using Software Bang-Bang Program of Fuzzy algorithm and to verity a PI controller and a Fuzzy controller.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.2
• /
• pp.111-117
• /
• 2008

This paper presents a new continuation-based quasi-steady-state(CQSS) time-domain simulation algorithm incorporating a multiplicative aggregated load model for power systems. The authors' previous paper introduced a CQSS algorithm, which has the robust convergent characteristic near the singularity point due to the application of a continuation method. The previous CQSS algorithm implemented the load restoration in power systems using the exponent-based load recovery model that is derived from the additive dynamic load model. However, the reformulated exponent-based model causes the inappropriate variation of short-term load characteristics when switching actions occur, during time-domain simulation. This paper depicts how to incorporate a multiplicative load restoration model, which does not have the problem of deforming short-term load characteristics, into the time simulation algorithm, and shows an illustrative example with a 39-bus test system.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.1 no.1
• /
• pp.77-83
• /
• 2012

In this paper, an optimal solution to the harmonic reduction problem in a cascaded multilevel inverter with non-equal DC sources using a genetic algorithm (GA) is presented. Switching angles are generated for different values of modulation index by the proposed algorithm, considering minimum voltage total harmonic distortion (THD) whereas selected harmonics are controlled within the allowable limits at all desired modulation indices including the point of discontinuity. Results are stored as a look-up table to be used to control the inverter for a certain operating point. The computed angles are used in a simulated circuit in Matlab\Simulink to validate the results.

• Journal of the Semiconductor & Display Technology
• /
• v.13 no.4
• /
• pp.43-48
• /
• 2014

Two-level inverter has some disadvantages like high harmonics contained in the output current, efficiency limit and stress to switching device as IGBT and FET. Many researches have reported multi-level inverter to complement two-level inverter of problems. In this paper, we suggest MPPT algorithm of multi-string three-level solar inverter that considered nowadays. We added midpoint controller in order to implement the MPPT algorithm because the three-level inverter has to need midpoint controller and procured the stability of direct current link. We verify the superiority of multi-string T-Type inverter and the algorithm we suggested with solar irradiance variation experiment and MPPT efficiency measurement. The MPPT efficiency was confirmed with a high efficiency more than 99.97%.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.