• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.6
• /
• pp.465-470
• /
• 2001

This paper considers a new weighed model reduction method using block diagonal solutions of Lyapunov inequalities. With the input and/or output weighting function, the stability of the reduced order system is guaranteed and an a priori error bound is proposed. to achieve this after finding the solutions of two Lyapunov inequalities and balancing the full order system, we find the reduced order systems using the direct truncation and the singular perturbation approximation. The proposed method is compared with other existing methods using numerical examples.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.7 s.337
• /
• pp.71-78
• /
• 2005

A K-Best algerian is known as optimal for implementing the maximum-likelihood detector (MLD), since it has a fixed maximum complexity compared with the sphere decoding or the maximum-likelihood decoding algorithm. However the computational complexity of the K-Best algrithm is still prohibitively high for practical applications when K is large enough. If small value of K is used, the maximum complexity decreases but error flooring at high SNR is caused by error propagation. In this paper, a K-reduction scheme, which reduces K according to each search level, is proposed to solve error propagation problems. Simulations showed that the proposed scheme provides the improved performance in the bit error rate and also reduces the average complexity compared with the conventional scheme.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.05a
• /
• pp.429-430
• /
• 2012

• 정보저장시스템학회:학술대회논문집
• /
• 2005.10a
• /
• pp.44-46
• /
• 2005

Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time. Today any data storage system cannot satisfy these conditions, however holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System can be constructed without mechanical actuating part therefore fast data transfer rate and high storage capacity about $1Tb/cm^3$ can be realized. In this paper, to reduce errors of binary data stored in holographic data storage system, a new method for bit error reduction is suggested. We proposal Algorithm use The Extended Kalman filter. The Kalman filter reduce measurement noise. Therefore, By using this error reduction method following results are obtained; the effect of measurement nois of Pixel is decreased and the intensity profile of data page becomes uniform therefore the better data storage system can be constructed.

• 정보저장시스템학회:학술대회논문집
• /
• 2005.10a
• /
• pp.129-133
• /
• 2005

Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time. Today any data storage system cannot satisfy these conditions, however holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System can be constructed without mechanical actuating part therefore fast data transfer rate and high storage capacity about $1Tb/cm^3$ can be realized. In this paper, to reduce errors of binary data stored in holographic data storage system, a new method for bit error reduction is suggested. First, find cluster centers using subtractive clustering algorithm then reduce intensities of pixels around cluster centers and fuzzy rules. Therefore, By using this error reduction method following results are obtained ; the effect of Inter Pixel Interference noise is decreased and the intensity profile of data page becomes uniform therefore the better data storage system can be constructed.

• Journal of Positioning, Navigation, and Timing
• /
• v.11 no.4
• /
• pp.297-304
• /
• 2022

The models used for ionosphere error correction in positioning using Global Navigation Satellite System (GNSS) are representatively Klobuchar model and NeQuick model. Although these models can correct the ionosphere error in real time, the disadvantage is that the accuracy is only 50-60%. In this study, a method for polynomial modeling of Global Ionosphere Map (GIM) which provides Vertical Total Electron Content (VTEC) in grid type was studied. In consideration of Ionosphere Pierce Points (IPP) of satellites with a receivable elevation angle of 15 degrees or higher on the Korean Peninsula, the target area for model generation and provision was selected, and the VTEC at 88 GIM grid points was modeled as a polynomial. The developed VTEC polynomial model shows a data reduction rate of 72.7% compared to GIM regardless of the number of visible satellites, and a data reduction rate of more than 90% compared to the Slant Total Electron Content (STEC) polynomial model when there are more than 10 visible satellites. This VTEC polynomial model has a maximum absolute error of 2.4 Total Electron Content Unit (TECU) and a maximum relative error of 9.9% with the actual GIM. Therefore, it is expected that the amount of data can be drastically reduced by providing the predicted GIM or real-time grid type VTEC model as the parameters of the polynomial model.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.131-137
• /
• 2023

The phase reconstruction process in digital holographic microscopy involves a trade-off between the phase error and the high-spatial-frequency components. In this reconstruction process, if the narrow region of the sideband is windowed in the Fourier domain, the phase error from the DC component will be reduced, but the high-spatial-frequency components will be lost. However, if the wide region is windowed, the 3D profile will include the high-spatial-frequency components, but the phase error will increase. To solve this trade-off, we propose the high-variance pixel averaging method, which uses the variance map of the reconstructed depth profiles of the windowed sidebands of different sizes in the Fourier domain to classify the phase error and the high-spatial-frequency components. Our proposed method calculates the average of the high-variance pixels because they include the noise from the DC component. In addition, for the nonaveraged pixels, the reconstructed phase data created by the spatial frequency components of the widest window are used to include the high-spatialfrequency components. We explain the mathematical algorithm of our proposed method and compare it with conventional methods to verify its advantages.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.86-93
• /
• 2009

We investigate lattice-reduction-aided precoding techniques for multi-user multiple-input multiple-output (MIMO) channels. When assuming full knowledge of the channel state information only at the transmitter, a vector perturbation (VP) is a promising precoding scheme that approaches sum capacity and has simple receiver. However, its encoding is nondeterministic polynomial time (NP)-hard problem. Vector perturbation using lattice reduction algorithms can remarkably reduce its encoding complexity. In this paper, we propose a vector perturbation scheme using Seysen's lattice reduction (VP-SLR) with simultaneously reducing primal basis and dual one. Simulation results show that the proposed VP-SLR has better bit error rate (BER) and larger capacity than vector perturbation with Lenstra-Lenstra-Lovasz lattice reduction (VP-LLL) in addition to less encoding complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.551-557
• /
• 2011

We investigate lattice-reduction-aided precoding techniques using Look-Up table (LUT) for multi-user multiple-input multiple-output(MIMO) systems. Lattice-reduction-aided vector perturbation (VP) gives large sum capacity with low encoding complexity. Nevertheless lattice-reduction process based on the LLL-Algorithm still requires high computational complexity since it involves several iterations of size reduction and column vector exchange. In this paper, we apply the LUT-aided lattice reduction on VP and propose a scheme to generate the LUT efficiently. Simulation results show that a proposed scheme has similar orthogonality defect and Bit-Error-Rate(BER) even with lower memory size.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.260-267
• /
• 2005

자기조직화지도(Self Organizing Map, SOM)는 비지도 신경망으로서 고차원의 입력공간을 위상적관계를 유지시키면서 저차원으로 사영 시킬 수 있는 특징을 갖고 있다. SOM은 패턴인 식과 자료압축/재생 등 여러 분야에서 유용하게 활용될 수 있으며 특히 고차원 자료의 시각화 방법으로 많은 관심을 받고 있다. 본 연구에서는 SOM의 quantization error를 줄이기 위한 목적으로 인공데이터를 생성시켜 학습에 이용하는 방법을 제시한다. 이는 특히 데이터가 부족한 상황에서 SOM을 학습시켜야 할 때 유용하게 적용될 수 있을 것으로 기대된다.