• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.218-221
• /
• 2003

본 논문에서는 사전등화를 이용하는 상향링크 MC-CDMA(multicarrier-code division multiple access)/TDD(time division duplexing) 시스템에서 사전등화를 위한 상향링크 채널을 추정하는 방법들을 제안하고 시스템의 성능분석을 수행한다. 제안된 방법들에서는 하향링크 슬롯구간에서의 채널변화를 적절한 차수의 다항식으로 모델링하고, 이 다항식을 상향링크 슬롯구간으로 확장함으로써 상향링크 슬롯구간의 채널을 추정한다. 하향링크 슬롯구간에서의 채널변화는 MMSE(minimum mean squared error)curve fitting 방법이나 Lagrange 보간법 등이 사용되며 1차, 2차, 3차 다항식으로 근사화 된다. 성능지표로 정확도보다 시스템 성능이 중요 하므로 BER (bit error rate)을 사용한다. 다양한 시스템 및 채널환경에서의 모의실험 결과로부터 Lagrange 보간법은 하향링크 채널정보가 정확한 경우에는 MMSE 방법보다 성능이 다소 우수하지만 하향링크 채널추정 오류에 매우 민감하며, 2 차 다항식을 사용한 MMSE curve fitting 방법은 다양한 환경에서 우수한 성능을 가질 뿐만 아니라 채널추정 오류에도 매우 강인함을 알 수 있다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.32 no.4
• /
• pp.618-623
• /
• 2008

This paper presents a design method of the Interpolation-based adaptive LQ controller that is accomplished by getting the final controller interpolated with each gain of sub-LQ controllers. The Lagrange interpolation method is used in the scheme. The proposed controller is useful to control nonlinear systems which are especially changed the system parameters. The design method is illustrated by an application to the stabilization and tracking problems of an inverted pole system on a cart. Several cases of simulations are carried out in order to validate the control effectiveness and robustness. The simulation results are compared with those of LQ controller and prove the better control performance than LQ controller.

• Proceedings of the SAREK Conference
• /
• 2006.11a
• /
• pp.8-8
• /
• 2006

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.7
• /
• pp.286-293
• /
• 2002

This paper presents a new method for finding the Block Pulse series coefficients and deriving the Block Pulse integration operational matrices which are necessary for the control fields using the Block Pulse functions. In order to apply the Block Pulse function technique to the problems of continuous-time dynamic systems more efficiently, it is necessary to find the more exact value of the Block Pulse series coefficients and drives the related integration operational matrices by using the Lagrange second order interpolation polynomial.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.6
• /
• pp.351-358
• /
• 2003

This paper presents a new method for finding the Block Pulse series coefficients, deriving the Block Pulse integration operational matrices and generalizing the integration operational matrices which are necessary for the control fields using the Block Pulse functions. In order to apply the Block Pulse function technique to the problems of state estimation or parameter identification more efficiently, it is necessary to find the more exact value of the Block Pulse series coefficients and integral operational matrices. This paper presents the method for improving the accuracy of the Block Pulse series coefficients and derives the related integration operational matrices and generalized integration operational matrix by using the Lagrange second order interpolation polynomial.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.675-681
• /
• 2022

Recently, with the development of IoT technology and AI, unmanned and automated in various fields, interest in video processing, which is the basis for automation such as object recognition and object classification, is increasing. Various studies have been conducted on noise removal in the video processing process, which has a significant impact on image quality and system accuracy and reliability, but there is a problem that it is difficult to restore images for areas with high impulse noise density. In this paper proposes a filter algorithm based on partial mask and Lagrange interpolation to restore the damaged area of impulse noise in the image. In the proposed algorithm, the filtering process was switched by comparing the filtering mask with the noise estimate and the purge weight was calculated based on the low frequency component and the high frequency component of the image to restore the image.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.22 no.4
• /
• pp.383-390
• /
• 2004

IGS provides so accute a final precise ephmerides which is offered in the 13rd, and it also offers a rapid precise ephmerides for more prompt application and an ultra-rapid precise ephmerides for real-time application. The purpose of this study is to analyze the accuracy of a rapid precise ephemerides and an ultra-rapid precise ephemerides based on a final precise ephmerides and determine the degree of the Lagrange Interpolation which needs to decide the location of a satellite. As the result of this study, the root mean square error of x,y,z coordinates of a rapid precise ephemerides was $\pm$0.0l6m or so, and the root mean square error of an observed ultra-rapid precise ephemerides was approximately $\pm$0.024m. The root mean square error of an ultra-rapid precise ephemerides predicted for 24 hours was $\pm$0.07m or so and the one of an ultra-rapid precise ephemerides predicted for 6 hours was $\pm$0.04m or so. Therefore, I could figure out that it had higher accuracy than a broadcast ephemerides. Also, in case that the location of a satellite was calculated with the method of the Lagrange Interpolation, it was confirmed that using the 9th order polynomial was efficient.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.04a
• /
• pp.345-348
• /
• 2001

반도체에 이용되는 실리콘웨이퍼 생산에 있어 평탄도는 가장 중요한 요소 중 하나이다. 실리콘웨이퍼의 평탄도는 POLISHING이라는 공정과정을 통하여 측정하고 제어하고 있는데 현재 측정장비에서 보여주는 웨이퍼의 모양을 사람에 의해 제어하고 있어 경험이 필요하고 일일이 사람이 체크해야하는 번거로움이 있다. 따라서 평탄도가 시스템에 의해 자동적으로 측정되고 제어할 필요가 있다. 본 연구는 웨이퍼의 3차원 형상을 측정하여 보여주는 장비에서 이미지와 함께 나타나는 몇 개의 정량적인 항목을 이용하여 웨이퍼의 단면도를 추정하는 알고리즘을 제안함으로 평탄도가 자동으로 측정될 수 있도록 하였다. 이 알고리즘은 Spline보간법을 이용하였고 웨이퍼의 특정단면 뿐만 아니라 임의의 단면도도 추정할 수 있으며 수치실험을 통해 Lagrange보간법과 비교하여 그 효율성을 입증하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.34-40
• /
• 2024

Secret sharing is a cryptographic technique that involves dividing a secret or a piece of sensitive information into multiple shares or parts, which can significantly increase the confidentiality of a secret. There has been a lot of research on secret sharing for different contexts or situations. Tassa's conjunctive secret sharing method employs polynomial derivatives to facilitate hierarchical secret sharing. However, the use of derivatives introduces several limitations in hierarchical secret sharing. Firstly, only a single group of participants can be created at each level due to the shares being generated from a sole derivative. Secondly, the method can only reconstruct a secret through conjunction, thereby restricting the specification of arbitrary secret reconstruction conditions. Thirdly, Birkhoff interpolation is required, adding complexity compared to the more accessible Lagrange interpolation used in polynomial-based secret sharing. This paper introduces the multi-compartment secret sharing method as a generalization of the conjunctive hierarchical secret sharing. Our proposed method first encrypts a secret using external groups' shares and then generates internal shares for each group by embedding the encrypted secret value in a polynomial. While the polynomial can be reconstructed with the internal shares, the polynomial just provides the encrypted secret, requiring external shares for decryption. This approach enables the creation of multiple participant groups at a single level. It supports the implementation of arbitrary secret reconstruction conditions, as well as conjunction. Furthermore, the use of polynomials allows the application of Lagrange interpolation.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.4
• /
• pp.411-420
• /
• 2009

To plan a GPS survey, they have to decide if a survey can be conducted at a specific point and time based on the predicted GPS ephemeris. In this study, to predict ephemeris, we used the repeat time of a GPS satellite. The GPS satellite repeat time was determined by analysing correlation among three-dimensional satellite coordinates provided by the 48-hour GPS ephemeris in the ultra-rapid orbits. By using the calculated repeat time and Lagrange interpolation polynomials, we predicted GPS orbits f3r seven days. As a result, the RMS of the maximum errors in the X, Y, and Z coordinates were 39.8 km 39.7 km and 19.6 km, respectively. And the maximum and average three-dimensional positional errors were 119.5 km and 48.9 km, respectively. When the maximum 3-D positioning error of 119.5 km was translated into the view angle error, the azimuth and elevation angle errors were 9.7'and 14.9', respectively.