• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.10
• /
• pp.1172-1180
• /
• 2007

OFDM system has very good high spectral efficiency and the robustness to the frequency-selective fading. Because of the high PAPR, OFDM signals can be distorted in nonlinear HPA(High Power Amplifier). So, to overcome the nonlinear distortion, it is very important to reduce the IMD value. With respect to the BER performance, IMD reduction method is better than the PAPR reduction method. However, IMD reduction method has much more system complexity because of the additional FFT processor in transmitter. In this paper, we study the OFDM communication system based on the IMD reduction method using SPW method. A new IMD reduction method is proposed to reduce the computational complexity. SPW method is to divide the input OFDM data into several sub-blocks and to multiply phase weighting values with each sub-blocks for the reduction of PAPR or IMD. Unlike the conventional method, the system size and computational complexity can be reduced.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.2
• /
• pp.98-106
• /
• 2013

This paper proposes fault tolerant control laws using sliding mode control and adaptation laws for a satellite with reaction wheel faults. Considering system parameter errors and faults uncertainties in the dynamics of satellite, the control laws were designed. It was assumed that only reaction wheel failures occurred as faults. The reaction wheel faults were reflected in the multiply form. Because the proposed control laws satisfy the Lyapunov stability theorem, the stability is guaranteed. Through computer simulation, it was assured that the proposed adaptive sliding mode controller has a better performance than the existing sliding mode controller under unstable angular rates.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.87-93
• /
• 2014

For n/m=qm+r, there is no simple divisibility rule for simple m=7 such that is the n multiply by m? This problem can be more complex for two or more digits of m. The Dunkels method has been known for generalized divisibility test method, but this method can not compute very large digits number that can not processed by computer. This paper suggests simple and exact divisibility method for m completely irrelevant n and m of digits. The proposed method sets $r_1=n_1n_2{\cdots}n_l(mod m)$ for $n=n_1n_2n_3{\cdots}n_k$, $m=m_1m_2{\cdots}m_l$. Then this method computes $r_i=r_{i-1}{\times}10+n_i(mod m)$, $i=2,3,{\cdots}k-l+1$ and reduces the digits of n one-by-one. The proposed method can be get the quotient and remainder with easy, fast and correct for various n,m experimental data.

• Journal of fish pathology
• /
• v.21 no.3
• /
• pp.189-199
• /
• 2008

This paper aims to compare difference with the in an ability of their resistance and survival against in a non-specific defence mechanism of the olive flounder, between the virulent and the avirulent E. tarda strains. The tested E. tarda strains, we divided into the virulent and the avirulent strain groups on the basis of a value of 50% lethal dose (LD50) for the olive flounder weighed 10.3 g in average. The strains of LD50 101.6~104.2 cfu/fish were grouped as virulent strains, such as KE-1, KE-3, KE-5 and FSW910410. The group of avirulent strains as LD50 exceeded 108.7 cfu/fish were included the strains, SU100 and AL92448. A test was conducted to understand the survival ability of each strain in the mucus of the skin and the intestine of olive flounders. The results showed KE-1, KE-3, KE-5 and FSW910410 were highly to survive between 6 hours and 24 hours in intestine. The survival ability in the bile of olive flounder the number of avirulent strains declined during incubation but the virulent strain showed the number of alive bacteria having sustained or increased. In the test for the survival of bacteria in fresh sera of olive flounder, the virulent strains also had tendency to multiply. Concerning the tested bacteria internalization into the head kidney macrophages and the intracellurar replication in the macrophages of olive flounder. The virulent strains exhibited strong internalization, followed high rate replication. According to the results, virulent strains of E. tarda revealed more ability to resist and survive in the face of humoral and cellular defence factors than avirulent strains.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1574-1585
• /
• 2011

This paper proposes a real-time algorithm for speed limit sign recognition for advanced safety vehicle system. The proposed algorithm uses Block-DCT in extracting features from a given ROI(Region Of Interest) instead of using entire pixel values as in previous works. The proposed algorithm chooses parts of the DCT coefficients according to the proposed discriminant factor, uses correlation coefficients and variances among ROIs from training samples to reduce amount of arithmetic operations without performance degradation in classification process. The algorithm recognizes the speed limit signs using the information obtained during training process by calculating LDA and Mahalanobis Distance. To increase the hit rate of recognition, it uses accumulated classification results computed for a sequence of frames. Experimental results show that the hit rate of recognition for sequential frames reaches up to 100 %. When compared with previous works, numbers of multiply and add operations are reduced by 69.3 % and 67.9 %, respectively. Start after striking space key 2 times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12B
• /
• pp.1766-1774
• /
• 2010

This paper proposes a real-time algorithm of recognizing speed limit signs for intelligent vehicles. Contrary to previous works which use all the pixel values in the ROI (Region Of Interest) after preprocessing image at ROI and need a lot of operations, the proposed algorithm uses fewer DCT coefficients in the ROI as features of each image to reduce the number of operations. Choosing a portion of DCT coefficients which satisfy discriminant criteria for recognition, the proposed algorithm recognizes the speed limit signs using the information obtained in the selected features through LDA and MD. It selects one having the highest probability among the recognition results calculated by accumulating the classification results of consecutive individual frames. Experimental results show that the recognition rate for consecutive frames reaches to 100% with test images. When compared with the previous algorithm, the numbers of multiply and add operations are reduced by 58.6% and 38.3%, respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.41-47
• /
• 2016

The times of multiplication for encryption and decryption of cryptosystem is primarily determined by implementation efficiency of the modular exponentiation of $a^b$(mod m). The most frequently used among standard modular exponentiation methods is a standard binary method, of which n-ary($2{\leq}n{\leq}6$) is most popular. The n-ary($1{\leq}n{\leq}6$) is a square-and-multiply method which partitions $b=b_kb_{k-1}{\cdots}b_1b_{0(2)}$ into n fixed bits from right to left and squares n times and multiplies bit values. This paper proposes a variable-length partition algorithm that partitions $b_{k-1}{\cdots}b_1b_{0(2)}$ from left to right. The proposed algorithm has proved to reduce the multiplication frequency of the fixed-length partition n-ary method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1015-1017
• /
• 2013

Object tracking, in general, is a challenging problem. Difficulties in tracking objects can arise due to abrupt object motion, changing appearance patterns of both the object and the scene, non-rigid object structures, object-to-object and object-to-scene occlusions, and camera motion. Tracking is usually performed in the context of higher-level applications that require the location or the shape of the object in every frame. This paper describes an object tracking system based on active vision with two cameras, into algorithm of single camera tracking system an object active visual tracking and object locked system based on Extend Kalman Filter (EKF) is introduced, by analyzing data from which the next running state of the object can be figured out and after the tracking is performed at each of the cameras, the individual tracks are to be fused (combined) to obtain the final system object track.

• 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.

• The Journal of the Korea Contents Association
• /
• v.6 no.6
• /
• pp.136-143
• /
• 2006

Contemporary society demands the ability to cope with the change competitively to the designer which is being accelerated of change and various media are emerging. The web design field which is one of the core design industry field of the contemporary society is needing the conversion from manufacturing technology specialization into creative design development composition. Generally, creative design development ability can be learned by studying. So, creativity development education is needed to develop creative design. Creative thought training is perceived as the core condition for competitive design and the education method for this is being proceeded multiply. But the study for design concept is lacking concretely. By this, this paper is to study the model which helps setting the design concept deduction creatively by instigating new ways of thought. The concept development process suggested in the study procedure systemizes the course for creative web design concept deduction and expects it to be utilized in design development to reinforce competitiveness.