• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.2
• /
• pp.608-616
• /
• 2018

If a general nonlinear system is linearized by the successive multiplication of the 1st and 2nd order systems, then there are four types of poles in this linearized system: the pole of the 1st order system and the equal poles, two distinct real poles, and complex conjugate pair of poles of the 2nd order system. Linear Quadratic (LQ) control is a method of designing a control law that minimizes the quadratic performance index. It has the advantage of ensuring the stability of the system and the pole placement of the root of the system by weighted matrix adjustment. LQ control by the weighted matrix can move the position of the pole of the system arbitrarily, but it is difficult to set the weighting matrix by the trial and error method. This problem can be solved using the characteristic equations of the Hamiltonian system, and if the control weighting matrix is a symmetric matrix of constants, it is possible to move several poles of the system to the desired closed loop poles by applying the control law repeatedly. The paper presents a method of calculating the state weighting matrix and the control law for moving the equal poles with Jordan blocks to two real poles using the characteristic equation of the Hamiltonian system. We express this characteristic equation with a state weighting matrix by means of a trigonometric function, and we derive the relation function (${\rho},\;{\theta}$) between the equal poles and the state weighting matrix under the condition that the two real poles are the roots of the characteristic equation. Then, we obtain the moving-range of the two real poles under the condition that the state weighting matrix becomes a positive semi-finite matrix. We calculate the state weighting matrix and the control law by substituting the two real roots selected in the moving-range into the relational function. As an example, we apply the proposed method to a simple example 3rd order system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.119-125
• /
• 2015

In this paper, we introduce a Hadamard matrix interstream transmission based blind channel estimation for multi-cells multiple-input and multiple-output (MIMO) networks. The proposed scheme is based on a network with mobile stations (MS) which are deployed with multi cells. We assume that the MS have the signals from both cells. The signal from near cell are considered as desired signal and the signals from the other cells are interference signal. Since the channel is blind, so that we transmit Hadamard matrix pattern pilot stream to estimate the channel; that gives easier and fast channel estimation for large scale MIMO channel. The computation of Hadamard based system takes only complex additions, and thus the complexity of which is much lower than the scheme with Fourier transform since complex multiplications are not needed. The numerical analysis will give perfection of proposed channel estimation.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.4
• /
• pp.369-382
• /
• 2024

To suppress the reverberation in the active sonar system, the non-negative matrix factorization-based reverberation suppression methods have been researched recently. An estimation loss function, which makes the multiplication of basis matrices same as the input signals, has to be considered to design the non-negative matrix factorization methods, but the conventional method simply chooses the Kullback-Leibler divergence asthe lossfunction without any considerations. In this paper, we examined that the Kullback-Leibler divergence is the best lossfunction or there isthe other loss function enhancing the performance. First, we derived a modified reverberation suppression algorithm using the generalized beta-divergence function, which includes the Kullback-Leibler divergence. Then, we performed Monte-Carlo simulations using synthesized reverberation for the modified reverberation suppression method. The results showed that the Kullback-Leibler divergence function (β = 1) has good performances in the high signal-to-reverberation environments, but the intermediate function (β = 1.25) between Kullback-Leibler divergence and Euclidean distance has better performance in the low signal-to-reverberation environments.

• Korean Journal of Applied Biomechanics
• /
• v.12 no.1
• /
• pp.125-133
• /
• 2002

The purpose of this study was to develop a method for estimating 3-D coordinates of lower trunk muscles using orientation angles during a motion. Traditional 3-D motion analysis system with DLT technique was used to track down the locations of eight reference markers which were attached on the back of the subject. In order to estimate the orientations of individual lumbar vertebrae and musculoskeletal parameters of the lower trunk muscle, the rotation matrix of the middle trunk reference frame relative to the lower trunk reference frame was determined and the angular locations of individual lumbar vertebrae were estimated by partitioning the orientation angles (Cardan angles) that represent the relative angles between the rotations of the middle and lower trunks. When the orientation angles of individual intervertebral joints were known at a given instant, the instantaneous coordinates of the origin and insertion for all selected muscles relative to the L5 local reference frame were obtained by applying the transformation matrix to the original coordinates which were relative to a local reference frame (S1, L4, L3, L2, or L1) in a rotation sequence about the Z-, X- and Y-axes. The multiplication of transformation matrices was performed to estimate the geometry and kinematics of all selected muscles. The time histories of the 3-D coordinates of the origin and insertion of all selected muscles relative to the center of the L4-L5 motion segment were determined for each trial.

• Nuclear Engineering and Technology
• /
• v.46 no.3
• /
• pp.291-298
• /
• 2014

This paper concerns estimating uncertainties of the core neutronics design parameters of power reactors by direct sampling method (DSM) calculations based on the two-step McCARD/MASTER design system in which McCARD is used to generate the fuel assembly (FA) homogenized few group constants (FGCs) while MASTER is used to conduct the core neutronics design computation. It presents an extended application of the uncertainty propagation analysis method originally designed for uncertainty quantification of the FA FGCs as a way to produce the covariances between the FGCs of any pair of FAs comprising the core, or the covariance matrix of the FA FGCs required for random sampling of the FA FGCs input sets into direct sampling core calculations by MASTER. For illustrative purposes, the uncertainties of core design parameters such as the effective multiplication factor ($k_{eff}$), normalized FA power densities, power peaking factors, etc. for the beginning of life (BOL) core of Yonggwang nuclear unit 4 (YGN4) at the hot zero power and all rods out are estimated by the McCARD/MASTER-based DSM computations. The results are compared with those from the uncertainty propagation analysis method based on the McCARD-predicted sensitivity coefficients of nuclear design parameters and the cross section covariance data.

• Structural Engineering and Mechanics
• /
• v.74 no.1
• /
• pp.33-54
• /
• 2020

The aim of this study is to calculate natural frequencies and harmonic responses of cracked frames with general boundary conditions by using transfer matrix method (TMM). The TMM is a straightforward technique to obtain harmonic responses and natural frequencies of frame structures as the method is based on constructing a relationship between state vectors of two ends of structure by a chain multiplication procedure. A single variable shear deformation theory (SVSDT) is applied, as well as, Timoshenko beam theory (TBT) and Euler-Bernoulli beam theory (EBT) for comparison purposes. Firstly, free vibration analysis of intact and cracked frames are performed for different crack ratios using TMM. The crack is modelled by means of a linear rotational spring that divides frame members into segments. The results are verified by experimental data and finite element method (FEM) solutions. The harmonic response curves that represent resonant and anti-resonant frequencies directly are plotted for various crack lengths. It is seen that the TMM can be used effectively for harmonic response analysis of cracked frames as well as natural frequencies calculation. The results imply that the SVSDT is an efficient alternative for investigation of cracked frame vibrations especially with thick frame members. Moreover, EBT results can easily be obtained by ignoring shear deformation related terms from governing equation of motion of SVSDT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.4
• /
• pp.251-258
• /
• 1986

There is much redundancy in image data such as TV signals and many techniques to redice it have been studied. In this paper, Hadamard transform is studied through computer simulation and experimental model. Each element of hadamard matrix is either +1 or -1, and the row vectors are orthogonal to another. Its hardware implementation is the simplest of the usual orthogonal transforms because addition and sulbraction are necessary to calculate transformed signals, while not only addition but multiplication are necessary in digital Fourier transform, etc. Linclon data (64$ imes$64) are simulated using 8th-order and 16th-order Hadamard transform, and 8th-order is implemented to hardware. Theoretical calculation and experimental result of 8th-order show that 2.0 bits/sample are required for good quality.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.303-308
• /
• 2004

The Gabor cosine and sine transform can be applied to image and video compression algorithm by representing image frequency components locally The computational complexity of forward and inverse matrix transforms used in the compression and decompression requires O($N^3$)operations. In this paper, the length of basis functions is truncated to produce a sparse basis matrix, and the computational burden of transforms reduces to deal with image compression and reconstruction in a real-time processing. As the length of basis functions is decreased, the truncation effects to the energy of basis functions are examined and the change in various Qualify measures is evaluated. Experiment results show that 11 times fewer multiplication/addition operations are achieved with less than 1% performance change.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1928-1934
• /
• 1993

This paper presents a fast algorithm of integer discrete cosine transform(IDCT) allowing VLSI implementation by integer arithmetic. The proposed fast algorithm has been developed using Chen`s matrix decomposition in DCT, and requires less number of arithmetic operations compared to the IDCT. In the presented algorithm, the number of addition number is the same as the one of Chen`s algorithm if DCT, and the number of multiplication if the same as that in DCT at N=8 but drastically decreasing when N is above 8. In addition, the drawbacks of DCT such as performance degradation at the finite length arithmetic could be overcome by the IDCT.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.97-105
• /
• 1998

Subband/DCT coding has been introduced in order to transmit images of various resultions using one given image-codec, for nowadays there are various grades of quality in visual communication services. However, subband/DCT results in the increawse of multiplication number and memory size. In order to resolve this problem, we propose block-based subband/DCT coding in this paper. In block-based subband/DCT, the number of multiplications is not only reduced because we combine subband decomposistion with DCT, but the size of memory is also reduced because images can be parallel-processed block by block. We show that the number of multiplications is reduced, by analyzing the property ofblock-based subband/DCT matrix mathematically, and examine the performance of proposed coder, which adopts JPEG as backhand-coder after block-based subband/DCT.