• Journal of IKEEE
• /
• v.6 no.2 s.11
• /
• pp.136-145
• /
• 2002

The simulator for the analysis of the lattice temperature under the steady-state condition is developed. The heat flow equation using the Slotboom variables is discretized and the integration method of the thermal conductivity without using the numerical analysis method is presented. The simulations are executed on the $N^+P$ junction diode and BJT to verify the proposed method. The average relative error of the lattice temperature of $N^+P$ diode compared with DAVINCI is 2% when 1.4[V] forward bias is applied and the average relative error of the lattice temperature of BJT compared with MEDICI is 3% when 5.0[V] is applied to the collector contact and 0.5[V] is applied to the base contact. BANDIS using the proposed method of integration of thermal conductivity needs 3.45 times of matrix solution to solve one bias step and DAVINCI needs 5.1 times of matrix solution MEDICI needs 4.3 times of matrix solution.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.3
• /
• pp.31-37
• /
• 2012

This paper presents an efficient hardware architecture to enable the high-speed Givens rotation-based QR decomposition. The proposed architecture achieves a highly parallel givens rotation process by maximizing the number of pivots selected for parallel zero-insertions. Sign-select lookahed (SSL)-CORDIC is also efficiently used for the high-speed givens rotation. The performance of QR decomposition hardware considerably increases compared to the conventional triangular systolic array (TSA) architecture. Moreover, the circuit area of QR decomposition hardware was reduced by decreasing the number of flip-flops for holding the pre-computed results during the decomposition process. The proposed QR decomposition hardware was implemented using TSMC $0.25{\mu}m$ technology. The experimental results show that the proposed architecture achieves up to 70 % speed-up over the TACR/TSA-based architecture for the $8{\times}8$ matrix decomposition.

• Journal of Korean Society of Transportation
• /
• v.27 no.2
• /
• pp.179-187
• /
• 2009

Currently, the signalized intersections in Korea are operated without providing an emergency vehicle preemption control strategy. Thus, it might threaten the safety of the pedestrians and drivers on highways when an emergency vehicle faces congested traffic conditions. The existing preemption control is activated when an emergency vehicle is detected along a path. This enables emergency vehicles to progress uninterrupted, but it also increases the delay of other vehicles. In this paper, a revised preemption control strategy considering queue length restrictions is proposed to make both a progressive movement of an emergency vehicle and reduce delay of other vehicles simultaneously. By applying the preemption control strategy through a simulation study, it was shown that delay of an emergency vehicle decreased to 44.3%-96.1% and speed increased to 8.8%-42.0% in all 9 cases as compared with a conventional signal control. The existing preemption control is superior for oversaturated conditions (v/c >1.0) or a link length less than 200m. However, the preemption control considering queue length constraints shows better performance than the existing preemption control when the v/c is less than 0.8 and a link length is longer than 500m.

• Computational Structural Engineering
• /
• v.9 no.1
• /
• pp.33-45
• /
• 1996

A general stiffener element which includes transverse shear deformation is formulated using the p-version finite element method. Hierarchic C/sup o/-shape functions, derived from Integrals of Legendre polynomials, are used to define the assembled stiffness matrix of the stiffener with respect to the local reference frame is transformed to the plate reference system by applying the appropriate transformation matrices in order to insure compatibility of displacements at the junction of the stiffener and plate. The transformation matrices which account for the orientation and the eccentricity effects of the stiffener with respect to the plate reference axes are used to find local behavior at the junction of the stiffener and the relative contributions of the plate and stiffener to the strength of the composite system. The results obtained by the p-version finite element method are comared with the results in literatures, especially those by the h-version finite element analysis program, MICROFEAP-II.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.550-552
• /
• 2014

In this paper, we propose an interleaver reconstruction method for punctured channel coded signals. We calculate the ratio of the number of '1' bits to the number of '0' bits in the matrix which is generated by a Gaussian elimination process. Then, we can reconstruct an interleaver by checking the minimum values of the ratio that have a smaller ratio than a certain threshold. We validate the proposed method through computer simulations.

• Communications for Statistical Applications and Methods
• /
• v.18 no.4
• /
• pp.433-443
• /
• 2011

We consider a compound Poisson risk model in which the premiums may depend on the state of the surplus process. By using the overflow probability of the workload process in the corresponding M/G/1 queueing model, we obtain the probability that the ruin occurs before the surplus reaches a given large value in the risk model. We also examplify the ruin probability in case of exponential claims.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.3
• /
• pp.313-318
• /
• 2018

A coaxial band rejection filter is designed and fabricated for a beam interacting cavity. The proposed filter has a quarter wavelength choke for the dominant mode of the cavity. The equivalent circuit of the coaxial band rejection filter is presented and the ABCD parameter os each part is derived to obtain the ABCD parameter of the entire filter. The scattering matrix was obtained from the ABCD matrix and the was simulated by MATLAB using the obtained scattering matrix. The coaxial band rejection filter structure was simulated using HFSS, and the results confirmed the simulation using the equivalent circuit was useful. The designed coaxial band rejection filter was fabricated with 6-1/8 flange. The fabricated filter was measured using a transition from 6-1/8 flange to N-type flange. The insertion loss of the fabricated filter is greater than 25 dB in the dominant mode of the cavity and less than 0.25 dB in the first higher order mode. The measurement results are in good agreement with the simulated results and meet the design specification.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.5
• /
• pp.503-514
• /
• 2021

Reverberation in speech signals tends to significantly degrade the performance of the Blind Source Separation (BSS) system. Especially in online systems, the performance degradation becomes severe. Methods based on joint diagonalizability constraints have been recently developed to tackle the problem. To improve the quality of separated speech, in this paper, we add the proposed de-reverberation method to the online BSS algorithm based on the constraints in reverberant environments. Through experiments on the WSJCAM0 corpus, the proposed method was compared with the existing online BSS algorithm. The performance evaluation by the Signal-to-Distortion Ratio and the Perceptual Evaluation of Speech Quality demonstrated that SDR improved from 1.23 dB to 3.76 dB and PESQ improved from 1.15 to 2.12 on average.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.1
• /
• pp.15-23
• /
• 2003

This paper proposes a fast direction of arrival (DOA) estimation algorithm that can rapidly estimate incidence angles of incoming signals using a pseudo covariance matrix. The conventional subspace DOA estimation methods such as MUSIC (multiple signal classification) algorithms need many sample signals to acquire covariance matrix of input signals. Thus, it is difficult to estimate the DOAs of signals because they cannot perform DOA estimation during receiving sample signals. Also if the D0As of signals are changing rapidly, conventional algorithms cannot estimate incidence angles of signals exactly. The proposed algorithm obtains bearing response and directional spectrum after acquiring pseudo covariance matrix of each snapshot. The incidence angles can be exactly estimated by using the bearing response and directional spectrum. The proposed DOA estimation algorithm uses only concurrent snapshot so as to obtain covariance matrix. Compared to conventional DOA estimation methods. The proposed algorithm has an advantage that can estimate DOA of signal rapidly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1462-1470
• /
• 2003

According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.