• 대한전기학회논문지:전력기술부문A
• /
• 제52권1호
• /
• pp.44-49
• /
• 2003

This paper describes a percentage current differential relaying algorithm for bus protection blocked by a CT saturation detection algorithm. The detection algorithm blocks the output of a current differential relay only if a differential current is caused by CT saturation in the case of an external fault. Moreover, if a current differential relay operates faster than the detection algorithm, the blocking signal is not ignited. On the other hand. if the detection algorithm operates faster than a current differential relay, the output of the relay is blocked. The results of the simulation show that the proposed algorithm can discriminate internal faults from external faults ever when a CT is saturated in both cases. This paper concludes by implementing the algorithm into the TMS320C6701 digital signal processor. The results of hardware implementation are also satisfactory The algorithm can not only increase the sensitivity of the current differential relay but Improve the stability of the relay for an external faults.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권9호
• /
• pp.500-506
• /
• 2004

This paper proposes a modified current differential relay for transformer protection unaffected by the remanent flux. The relay uses the same restraining current as a conventional relay, but the differential current is modified to compensate for the effects of the exciting current. To cope with the remanent flux, before saturation, the relay calculates the core-loss current and uses it to modify the measured differential current. When the core then enters saturation, the initial value of the flux is obtained by inserting the modified differential current at the start of saturation into the magnetization cure. Thereafter, the actual core flux is then derived and used in conjunction with the magnetization curve to calculate the magnetizing current. A modified differential current is then derived that compensates for the core-loss and magnetizing currents. The performance of the proposed differential relay was compared against a conventional differential relay. Results indicate that the modified relay remained stable during severe magnetic inrush and over-excitation because the exciting current was successfully compensated. This paper concludes by implementing the relay on a hardware platform based on a digital signal processor. The relay discriminates magnetic inrush and over-excitation from an internal fault and is not affected by the level of remanent flux.

• 마이크로전자및패키징학회지
• /
• 제11권2호
• /
• pp.37-41
• /
• 2004

LCD TV의 백라이트로서는 cold cathode flourescent lamp (CCFL)를 병렬로 구성한 직하방식의 백라이트 많이 사용되고 있다. 현재 각 각의 CCFL에 transformer 한개 씩을 사용하여 일정한 전류를 공급함으로서 백라이트의 균일도를 얻고 있으나 본 논문에서는 differential driving inverter를 이용하여 transfomer에 8개의 램프를 연결하여 구동함으로써 transformer의 개수를 현저히 줄일 수 있었다. Differential driving 방법을 이용하여 transformer 2개를 사용한 인버터를 제작하였으며 이를 이용하여 길이 450mm, 관경 4mm의 CCFL 16개를 사용한 26"용 LCD TV 백라이트를 구동할 수 있었다. 개발된 differential driving 인버터를 이용하여 백라이트를 구동한 결과 $88\%$ 이상의 휘도 균일도를 갖는 백라이트를 구현할 수 있었다.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권3호
• /
• pp.95-101
• /
• 2006

This paper proposes a modified current differential relay for $Y-{\Delta}$ transformer protection. The relay uses the same restraining current as a conventional relay, but the differential current is modified to compensate for the effects of the exciting current. A method to estimate the circulating component of the delta winding current is proposed. To cope with the remanent flux, before saturation, the core-loss current is calculated and used to modify the measured differential current. When the core then enters saturation, the initial value of the flux is obtained by inserting the modified differential current at the start of saturation into the magnetization cure. Thereafter, the core flux is then derived and used in conjunction with the magnetization curve to calculate the magnetizing current. A modified differential current is then derived that compensates for the core-loss and magnetizing currents. The performance of the proposed differential relay was compared against a conventional differential relay. Test results indicate that the modified relay remained stable during severe magnetic inrush and over-excitation, because the exciting current was successfully compensated. This paper concludes by implementing the relay on a hardware platform based on a digital signal processor. The relay does not require additional restraining signal and thus cause time delay of the relay.

• 열처리공학회지
• /
• 제33권6호
• /
• pp.303-309
• /
• 2020

A vehicle's differential gear is a device designed to allow the vehicle's outer wheels to turn faster than the inner wheels when turning on a curve. The differential gear case is the main component of the differential gear system, which is composed of ring gear, pinion gear and side gear, and is fastened by pinion shaft pins. The differential gear case rotates when the vehicle is running, so balancing calibration is very important. In this study, a balancing machine that can diagnose and correct the differential gear case and mass imbalance of various rotating bodies was designed. The differential gear case was rotated at high speed to accurately diagnose the location and value of the unbalanced mass, and it was designed to be balanced and corrected by removing the unbalanced mass by drilling. After calibration, it was confirmed that the unbalanced value of all the measured samples was reduced to less than 180g.mm, and the unbalance reduction ratio was improved to 60~70%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.435-451
• /
• 2019

Impossible differential cryptanalysis is an essential cryptanalytic technique and its key point is whether there is an impossible differential path. The main factor of influencing impossible differential cryptanalysis is the length of the rounds of the impossible differential trail because the attack will be more close to the real encryption algorithm with the number becoming longer. We provide the upper bound of the longest impossible differential trails of several important block ciphers. We first analyse the national standard of the Russian Federation in 2015, Kuznyechik, which utilizes the 16-byte LFSR to achieve the linear transformation. We conclude that there is no any 3-round impossible differential trail of the Kuznyechik without the consideration of the specific S-boxes. Then we ascertain the longest impossible differential paths of several other important block ciphers by using the matrix method which can be extended to many other block ciphers. As a result, we show that, unless considering the details of the S-boxes, there is no any more than or equal to 5-round, 7-round and 9-round impossible differential paths for KLEIN, Midori64 and MIBS respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권10호
• /
• pp.3815-3833
• /
• 2021

MILP-based automatic search is the most common method in analyzing the security of cryptographic algorithms. However, this method brings many issues such as low efficiency due to the large size of the model, and the difficulty in finding the contradiction of the impossible differential distinguisher. To analyze the security of ESF algorithm, this paper introduces a simplified MILP-based search model of the differential distinguisher by reducing constrains of XOR and S-box operations, and variables by combining cyclic shift with its adjacent operations. Also, a new method to find contradictions of the impossible differential distinguisher is proposed by introducing temporary variables, which can avoid wrong and miss selection of contradictions. Based on a 9-round impossible differential distinguisher, 15-round attack of ESF can be achieved by extending forward and backward 3-round in single-key setting. Compared with existing results, the exact lower bound of differential active S-boxes in single-key setting for 10-round ESF are improved. Also, 2108 9-round impossible differential distinguishers in single-key setting and 14 12-round impossible differential distinguishers in related-key setting are obtained. Especially, the round of the discovered impossible differential distinguisher in related-key setting is the highest, and compared with the previous results, this attack achieves the highest round number in single-key setting.

• 한국정보통신학회논문지
• /
• 제23권6호
• /
• pp.726-732
• /
• 2019

본 연구에서는 차동 구조의 고주파 증폭기를 위한 비대칭 차동 인덕터를 제안하였다. 제안 된 비대칭 차동 인덕터는 증폭기 내 차동 신호 간 위상 오차를 완화하기 위한 것으로서, 차동 인덕터에 형성되는 Center-tap의 위치를 조정하여, 전력 증폭기를 구성하는 구동 증폭기의 차동 신호에서 바라보이는 임피던스가 동일하게 형성 되도록 하였다. 이를 통하여 기존 차동 인덕터를 사용하는 경우 대비 AM-to-AM 및 AM-to-PM 왜곡이 완화됨을 확인 하였다. 제안하는 비대칭 차동 인덕터의 효용성을 확인하기 위하여 180-nm RFCMOS 공정을 이용하여 2.4-GHz CMOS 전력 증폭기를 설계하였으며, EVM 5% 기준 20 dB의 전력 이득과 17 dBm의 최대 선형 출력 전력을 얻었다.

• 전기학회논문지
• /
• 제57권10호
• /
• pp.1888-1892
• /
• 2008

In this paper, a new parallel CMOS self-bias differential amplifier is designed to use in high-speed analog signal processing circuits. The designed parallel CMOS self-bias differential amplifier is developed by using internal biasing circuits and the complement gain stages which are parallel connected. And also, the parallel architecture of the designed parallel CMOS self-bias differential amplifier can improve the gain and gain-bandwidth product of the typical CMOS self-bias differential amplifier. With 1.8V $0.8{\mu}m$ CMOS process parameter, the results of HSPICE show that the designed parallel CMOS self-bias differential amplifier has a dc gain and a gain-bandwidth product of 64 dB and 49 MHz respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5773-5784
• /
• 2019

ARIA is an involutory SPN block cipher. Its block size is 128-bit and the master key sizes are 128/192/256-bit, respectively. Accordingly, they are called ARIA-128/192/256. As we all know, ARIA is a Korean Standard block cipher nowadays. This paper focuses on the security of ARIA against impossible differential attack. We firstly construct a new 4-round impossible differential of ARIA. Furthermore, based on this impossible differential, a new 7-round impossible differential attack on ARIA-256 is proposed in our paper. This attack needs 2¹¹⁸ chosen plaintexts and 2²¹⁰ 7-round encryptions. Comparing with the previous best result, we improve both the data complexity and time complexity. To our knowledge, it is the best impossible differential attack on ARIA-256 so far.