• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.32-43
• /
• 1994

This paper presents new QRD-based recursive least squares algorithms for bilinear lattice filter. Bilinear recursive least square lattice algorithms are derived by using the QR decomposition for minimization covariance matrix of predication error by applying Givens rotation to the bilinear recursive least squares lattics algorithms. The proposed algorithms are applied to the bilinear system identification to evaluate the performance of algoithms. Computer simulations show that the convergence properties of the proposed algorithms are superior to that of the algorithms proposed by Baik when signal includes the measurement noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.692-699
• /
• 2004

In this paper we studied an implementation of QR decomposition-based RLS algorithm using modified Givens rotation method. Givens rotation can be obtained with a sequence of the CORDIC operations. In order to reduce the computing time of QR decomposition we restricted the number of iterations of the CORDIC operation per a Givens rotation and used double-rotation method to remove the square-root in the scaling factor.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.40-48
• /
• 2015

This paper presents a processor that performs QR decomposition (QRD) as well as Lattice Reduction (LR) for multiple-input multiple-output (MIMO) systems. By sharing the operations commonly required in QRD and LR, the hardware complexity of the proposed processor is reduced significantly. In addition, the proposed processor is designed based on a multi-cycle architecture so as to reduce the hardware complexity. The proposed processor is implemented with 139k logic gates in a $0.18-{\mu}m$ CMOS process, and its latency is $5{\mu}s$ for $8{\times}8$ MIMO preprocessing both QRD and LR where the operating frequency is 117MHz.

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.4
• /
• pp.369-378
• /
• 2000

Conventional fractal image compression methods have many problems in searching time for matching domain block. Proposed method is an improved method of Fisher's Quadtree Decomposition in terms of time, compression ratio, and PSNR. This method determines range block in advance using QR algorithm. First, input image is partitioned to $4{\times}4$ range block and then recomposition is performed from bottom level to specified level. As a result, this proposed method achieves high encoding and decoding speed, high compression ratio, and high PSNR than Fisher's Quadtree Decomposition method.

• Journal of the Korean Society of Industry Convergence
• /
• v.4 no.1
• /
• pp.87-94
• /
• 2001

In multibody dynamics, differential and algebraic equations which can satisfy both equation of motion and kinematic constraint equation should be solved. To solve this equation, coordinate partitioning method and constraint stabilization method are commonly used. The coordinate partitioning method divides the coordinate into independent and dependent coordinates. The most typical coordinate partitioning method arc LU decomposition, QR decomposition, projection method and SVD(sigular value decomposition).The objective of this research is to find a efficient coordinate partitioning method in flexible multibody systems and a hybrid decomposition algorithm which employs both LU and projection methods is proposed. The accuracy of the solution algorithm is checked with a slider-crank mechanism.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1762-1765
• /
• 1997

Some ill-conditioned processes are very sensitive to small element-wise uncertainties arising in classical element-by-element model identifications. For such processes, accurate identification of simgular values and right singular vectors are more important than theose of the elements themselves. Singular values and right singular vectors can be found by iteraive identification methods which implement the input and output transformations iteratively. Methods based on SVD decomposition, QR decomposition and LU decomposition are proposed and compared with the Kuong and Mac Gregor's method. Convergence proofs are given. These SVD and QR mehtods use normal matrices for the transformations which cannot be calculated analytically in general and so they are hoard to apply to dynamic processes, whereas the LU method used simple analyitc transformations and can be directly applied to dynamic processes.

• The Pure and Applied Mathematics
• /
• v.2 no.2
• /
• pp.133-140
• /
• 1995

The D-optimal design criterion for precise parameter estimation in nonlinear regression analysis is called the determinant criterion because the determinant of a matrix is to be maximized. In this thesis, we derive the gradient and the Hessian of the determinant criterion, and apply a QR decomposition for their efficient computations. We also propose an approximate form of the Hessian matrix which can be calculated from the first derivative of a model function with respect to the design variables. These equations can be used in a Gauss-Newton type iteration procedure.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.4
• /
• pp.419-424
• /
• 2019

In this paper, we proposed an algorithm to estimate the desired target in wideband jamming signal environment. In order to suppress the jamming signal, we use the spatial time adaptive algorithm and QR decomposition to obtain the optimal weight. The spatial time adaptive algorithm of adaptive array antenna system multiplies the tap delay signal by a complex weight to obtain a weight. In order to minimize the power consumption because of the inverse matrix, optimal weight is obtained by using QR decomposition. Through simulation, we compare and analyze the performance of the proposed algorithm and the existing algorithm. In the target estimation of [-40o,0o,+40o], the proposed algorithm estimated all three targets, but the existing algorithm estimated only [0o] due to of the jamming signal. We prove that the proposed algorithm improves performance by removing the jamming signal and estimating the target accurately.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.6 s.237
• /
• pp.795-803
• /
• 2005

This paper studies the observability of calibration system with a measurement operator. The calibration system needs a simple digital indicator to measure the mobile table movements with respect to the MC coordinate. However, it yields the concern about the poor parameter observability due to measuring only a part of the movements. We uses the QR-decomposition to find the optimal calibration configurations maximizing the linear independence of rows of an observation matrix. The number of identifiable parameter is examined by the rank of the observation matrix, which represents the parameter observability. The method is applied to a 6-axis MC with parallel tilting table and the calibration results are presented. These results verify that all necessary kinematic parameters are observable and the calibration system has robustness to the noise using optimal calibration configurations.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.4
• /
• pp.647-655
• /
• 2003

This paper studies the observability of calibration system with a constraint movement by a constraint operator. The calibration system with the constraint movement need only simple sensing device to check whether the constraint movements are completed within an established range. However, it yields the concern about the poor parameter observability due to the constraint movements. This paper uses the QR-decomposition to find the optimal calibration configurations maximizing the linear independence of rows of a observation matrix. The number of identifiable parameters are examined by the rank of the observation matrix, which represents the parameter observability. The method is applied to a parallel typed machining center and the calibration results are presented. These results verify that the calibration system with low-cost indicators and simple planar table is accurate as well as reliable.