• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.52-54
• /
• 1997

This paper deals with investigating some characteristics of the inverter-driven tractive induction motor according to the various rotor slot number. 2-D time-stepped finite element method considering the inverter voltage waveform is utilized for electromagnetic field analysis. As a result, harmonics spectra of torque and bar loss are compared in each case.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.50 no.11
• /
• pp.539-545
• /
• 2001

A simple analysis method for inverter-fed induction motor using F.E.M and harmonic equivalent circuit is proposed. And an optimum shape of rotor slot for 2Hp inverter-fed induction motor is determined by combining the proposed analysis method and an optimization algorithm. Conjugate gradient method is used for the optimization algorithm. The optimization is performed for higher efficiency and reduction of harmonic loss in the inverter-fed induction motor. The optimization results are verified by comparing with those of the time-step F.E.A.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.183-186
• /
• 2000

We analyzed the cross-shaped microstripline-fed slot antenna with the reflector using FDTD(Finite-Difference Time-Domain) method in this paper. The proposed antenna uses RR Duroid-5880 substrate(relative permittivity 2.2 and height(1.578 mm) of dielectrics), and compares the optimized results of other kind substrates. The maximum bandwidth of the proposed antenna is from 1.91 GHz to 5.21 GHz, which is approximately 1.437 octave for the VSWR $\leq$ 2. It was found that the bandwidth of the antenna depend highly on the length of the horizontal and vertical feedline as well as the offset position of the feedline. The experimented data for the VSWR and the radiation pattern of the antenna are also represented.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.753-756
• /
• 2001

Automatic Identification System(ALS) employed SOTDMA for the multiple access method. In SOTDMA systems, slot reuse may result in discrimination or garbling. Especially Gaussian Minimum Shift Keying(GMSK) Co-Channel Interference(CCI) resulted from the slot reuse in the Aloha zone degrades the system performance such as capacity In this paper we introduce some useful techniques to cancel the CCI and discuss the methodology which is applicable to AIS-SOTDMA

• Proceedings of the KIEE Conference
• /
• 2000.11b
• /
• pp.250-252
• /
• 2000

A simple analysis method for inverter-fed induction motor using F.E.M and equivalent circuit is proposed. And an optimum shape of rotor slot for 2Hp inverter-fed induction motor is determined by combining the proposed analysis method and an optimization algorithm. Conjugate gradient method is used for the optimization algorithm. The optimization is performed for higher efficiency and reduction of harmonic loss in the inverter-fed induction motor. The optimization results are verified by comparing with those of the time-step F.E.A and the experiment.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.73-75
• /
• 1998

Electromagnetic forces as a source of vibration and noise are analyzed and compared for an induction motor with different rotor slot number each other which drive high speed trains. Time stepped finite element method is used to analyze electromagnetic field considering the voltage harmonics supplied from a inverter. As a result, a rotor slot number is determined to reduce the harmonics of electromagnetic forces.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.16-23
• /
• 2009

In this paper, we propose a new distributed Alamouti space-time block coding scheme using cooperative relay system composed of one source node, three relay nodes and one destination node. The source node is assumed to be equipped with two antennas which respectively use a 2-beam array to communicate with two nodes selected from the three relay nodes. During the first time slot, the two signals which respectively were transmitted by one antenna at the source, are selected by one relay node, added, amplified, and forwarded to the destination. During the second time slot, the other two relay nodes implement the conjugate and minusconjugate operations to the two received signals, respectively, each in turn is amplified and forwarded to the destination node. This transmission scheme represents a new distributed Alamouti space-time block code that can be constructed at the relay-destination channel. Through an equivalent matrix expression of symbols, we analyze the performance of this proposed space-time block code in terms of the chernoff upper bound pairwise error probability (PEP). In addition, we evaluate the effect of the coefficient $\alpha$ ($0{\leq}{\alpha}{\leq}1$) determined by power allocation between the two antennas at the source on the received signal performance. Through computer simulation, we show that the received signals at the three relays have same variance only when the value of $\alpha$ is equal to $\frac{2}{3}$, as a consequence, a better performance is obtained at the destination. These analysis results show that the proposed scheme outperforms conventional proposed schemes in terms of diversity gain, PEP and the complexity of relay nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.942-949
• /
• 2004

This paper proposes and analyzes the anti-collision algorithm in Ubiquitous ID system. We mathematically compares the performance of the proposed algorithm with that of binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center. We also validated analytic results using OPNET simulation. Based on the analytic results, comparing the proposed algorithm with bit-by-bit algorithm which is the best of existing algorithms, the performance of proposed algorithm is about 5% higher when the number of tags is 20, and 100% higher when the number of tags is 200.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.47-54
• /
• 2005

This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center). We also validated analytic results using OPNET simulation. Based on analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1092-1097
• /
• 2011

An anti-collision protocol which tries to minimize the collision probability and identification time is the most important factor in all identification technologies. This paper focuses on methods to improve the efficiency of tag's process in identification systems. Our scheme, Binary Slotted Query Tree (BSQT) algorithm, is a memoryless protocol that identifies an object's ID more efficiently by removing the unnecessary prefixes of the traditional Query Tree (QT) algorithm. With enhanced QT algorithm, the reader will broadcast 1 bit and wait the response from the tags but the difference in this scheme is the reader will listen in 2 slots (slot 1 is for 0 bit Tags and slot 2 is for 1 bit Tags). Base on the responses the reader will decide next broadcasted bit. This will help for the reader to remove some unnecessary broadcasted bits which no tags will response. Numerical and simulation results show that the proposed scheme decreases the tag identification time by reducing the overall number of request.