• Journal of Electrical Engineering and Technology
• /
• v.1 no.4
• /
• pp.409-413
• /
• 2006

This paper deals with the design and testing of a simulator system for microgrids with distributed generations. This system is composed of a Real Time Digital Simulator (RTDS) and a power amplifier. The RTDS parts are operated for real time simulation for the microgrid model and the distributed generation source model. The power amplifiers are operated fur amplification of the RTDS's simulated output signal, which is a node voltage of the microgrid and distributed generation source. In this paper, we represent an RTDS system design, specification and test results of a power amplifier and simulation results of a PV (Photovoltaic) system and wind turbine system. The proposed system is applicable for development and performance testing of a PCS (Power Conversion System) for renewable energy sources.

• Journal of Korea Multimedia Society
• /
• v.17 no.10
• /
• pp.1189-1197
• /
• 2014

Recently, general purpose graphic processing units(GPUs) are being widely used in mobile embedded systems such as smart phone and tablet PCs. Because of architectural limitations of mobile GPGPUs, only a single program is allowed to occupy a GPU at a time in a non-preemptive way. As a result, it is difficult to meet performance requirements of applications such as frame rate or response time if applications running on a GPU are not scheduled properly. To tackle this difficulty, we propose to specify applications using synchronous data flow model of computation such that applications are formed with edges and nodes. Then nodes of applications are scheduled onto a GPU unlike conventional scheduling an application as a whole. This approach allows applications to share a GPU at a finer granularity, node (or task)-level, providing several benefits such as eliminating need for manually partitioning applications and better GPU utilization. Furthermore, any scheduling policy can be applied in response to the characteristics of applications.

• Journal of Semiconductor Engineering
• /
• v.2 no.3
• /
• pp.136-141
• /
• 2021

This paper analyzes the tree expansion for multiple-input multiple-output (MIMO) detection in the viewpoint of hardware implementation. The tree expansion is to calculate path metrics of child nodes performed in every visit to a node while traversing the detection tree. Accordingly, the tree-expansion unit (TEU), which is responsible for such a task, has been an essential component in a MIMO detector. Despite the paramount importance, the analyses on the TEUs in the literature are not thorough enough. Accordingly, we further investigate the hardware complexity of the TEUs to suggest a guideline for selection. In this paper, we focus on a pair of major ways to implement the TEU: 1) a full parallel realization; 2) a transformation of the formulae followed by common subexpression elimination (CSE). For a logical comparison, the numbers of multipliers and adders are first enumerated. To evaluate them in a more practical manner, the TEUs are implemented in a 65-nm CMOS process, and their propagation delays, gate counts, and power consumptions were measured explicitly. Considering the target specification of a MIMO system and the implementation results comprehensively, one can choose which architecture to adopt in realizing a detector.

• Journal of Internet Computing and Services
• /
• v.22 no.5
• /
• pp.17-26
• /
• 2021

This paper is about a physical layer frame security technique using OFB-style encryption/decryption with AES algorithms on Gigabit Ethernet network. We propose a data security technique at the physical layer that performs OFB-style encryption/decryption with AES algorithm with strong security strength when sending and receiving data over Gigabit Ethernet network. Generally, when operating Gigabit Ethernet network, there is no security features, but data security is required, additional devices that apply this technique can be installed to perform security functions. In the case of data transmission over Gigabit Ethernet network, the Ethernet frames conform to IEEE 802.3 specification, which includes several fields to ensure proper reception of data at the receiving node in addition to the data field. When encrypting, only the data field should be encrypted and transmitted in real time. In this paper, we show that only the data field of the IEEE802.3 frame is encrypted and transmitted on the sending node, and only the data field is decrypted to show the plain text on the receiving node, which shows that the encryption/decryption is carried out correctly. Therefore, additional installation of devices that apply this technique can increase the reliability of the system when security for data is required in Ethernet network operating without security features.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.56-63
• /
• 2009

The IEEE 802.11 standard has been used for wireless data networks such as wireless LAN, ad-hoc network, and vehicular ad-hoc network. Thus, the performance analysis of the IEEE 802.11 specification has been one of the hottest issues for network optimization and resource management. Most of the analysis studies were performed in a data plane of the IEEE 802.11 unicast. However, IEEE 802.11 broadcast is widely used for topology management, path management, and data dissemination. Thus, it is important to understand the performance of the broadcast scheme for the design of efficient wireless data network. In this contort, we analyze the IEEE 802.11 broadcast scheme in terms of the broadcast frame reception probability according to the distance from a sending node. Unlike the other works, our analysis framework includes not only the system parameters of the IEEE 802.11 specification such as transmission range, data rate, minimum contention window but also the networking environments such as the number of nodes, network load, and the radio propagation environments. Therefore, our analysis framework is expected to be used for the development of protocols and algorithms in a dynamic wireless data network.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.3A
• /
• pp.163-172
• /
• 2011

The CFTA girder developed is a concrete filled steel tubular system with arched shape and external post-tensioning (PT) tendons which control the initial camber and the bending stress of the girder. In the present study the effects of the PT tendons on the dynamic behavior of the girder subjected to a moving vehicle load are numerically investigated. Various levels for the tendon quantity and the tendon forces are considered, using the existing FE model of the girder. The vehicle considered is a DB-24 truck and is modeled with two tracks-three axles. Equivalent-load pulse time histories are applied to each node to simulate the moving vehicle, depending on the time of arrival and the discretization. The vehicle speeds are varied from 40 km/hr to 100 km/hr with increment of 20 km/hr. The analysis results show that the tendon forces do not produce any influences on the dynamic responses of the girder. However the dymamic deflection of the girder increases when a smaller amount of tendons is used. The Dynamic Amplification Factors (DAF) are evaluated based on the static and dynamic responses. Much lower values of the DAF are obtained, even no tendons applied, than those provided by the design criteria of the AASHTO LRFD and the Korea Highway Standard Specification.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.950-959
• /
• 2010

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems and it was proved by temporal logic. This solution is based on the Group Membership Detection algorithm.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.637-644
• /
• 2009

A study about performance analysis of synchronization clock using measured clock noises is required. Therefore this paper executed the study for performance analysis of synchronization clock and acquirement of maximum number of network node with various clock states using measured clock noises in NG-SDH networks. Also this paper generated a suitable clock model using measured clock noises, and carried out simulations with various clock states. Through the simulation results, maximum numbers were 80 or more network nodes in normal state, and were below 37 nodes in short-term phase transient(SPT) state, and were 50 or more in long-term phase transient(LPT) state. Accordingly this study showed that maximum numbers to meet ITU-T specification were below 37 network nodes in three clock states. Also this study showed that when SPT or LPT states occur from NE network before DOTS system, synchronization source must change with other stable synchronization source of normal state.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.132-138
• /
• 2012

VANET(Vehicular Ad-hoc Network), standardization of IEEE 802.11p specification is in process. 802.11 MAC protocol grants all nodes equal opportunity to acquire channel without regard to their bit-rates, making it possible for lower bit-rate nodes to occupy communication channel for a fair amount of time thus keeping the higher bit-rate nodes from acquiring connection channel which downward-equalize the overall network performance. Also with the 802.11p MAC protocol, the probability of collision occurring increases as the number of nodes grow. The proposed algorithm is a new MAC protocol that guarantees nodes with acquired channel a firm priority over other nodes for a fixed amount of time with TXOP concept added to 'packet burst' according to the current transmitting speed. This newly designed algorithm allows the construction of wireless network with enhanced network throughput, decreased probability of collisions as well as providing the means to grant each node a fair chance of acquiring connection according to their channel conditions. The algorithm sets the CW's (Contention Window) width wider than the standard's and modulates the continuous transmitting threshold value depending on channel acquired time, thus improving the overall performance of the network.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1088-1099
• /
• 2003

The syntax-directed translation using semantic actions is frequently used in construction of compiler for text programming languages. it is very useful for the language designers to develop compiler back-end using a syntax structure of a source programming language. Due to the lack of the integrated representation method for a parse tree node and modeling method of syntax structures, it is very hard to construct compiler using syntax-directed translation in visual languages. In this Paper, we propose a visual language compiler generation method for constructing a visual languages compiler automatically, using syntax-directed translation. Our method uses the Picture Layout Grammar as a underlying grammar formalism. This grammar allows our approach to generate parser efficiently u sing And-Or-Waiting Graph and encapsulating syntax definition as one unit. Unlike other systems, we suggest separating the specification and the generation of semantic actions. Because of this, it provides a very efficient method for modification.