• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.109-113
• /
• 2007

The COMS provides the LRIT/HRIT services to users. The COMS LRIT/HRIT broadcast service should satisfy the 15 minutes timeliness requirement. The requirement is important and critical enough to impact overall performance of the LHGS. HRIT image data is acquired from INRSM output receiving but LRIT image data is generated by sub-sampling HRIT image data in the LHGS. Specially, since LRIT is acquired from sub-sampled HRIT image data, LRIT processing spent more time. Besides, some of data loss for LRIT occurs since LRIT is compressed by lossy JPEG. Therefore, algorithm with the fastest processing speed and simplicity to be implemented should be selected to satisfy the requirement. Investigated sub-sampling algorithm for the LHGS were nearest neighbour algorithm, bilinear algorithm and bicubic algorithm. Nearest neighbour algorithm is selected for COMS LHGS considering the speed, simplicity and anti-aliasing corresponding to the guideline of user (KMA: Korea Meteorological Administration) to maintain the most cloud itself information in a view of meteorology. But the nearest neighbour algorithm is known as the worst performance. Therefore, it is studied in this paper that the selection of nearest neighbour algorithm for the LHGS is reasonable. First of all, characteristic of 3 sub-sampling algorithms is studied and compared. Then, several sub-sampling algorithm were applied to MTSAT-1R image data corresponding to COMS HRIT. Also, resized image was acquired from sub-sampled image with the identical sub-sampling algorithms applied to sub-sampling from HRIT to LRIT. And the difference between original image and resized image is compared. Besides, PSNR and MSE are calculated for each algorithm. This paper shows that it is appropriate to select nearest neighbour algorithm for COMS LHGS since sub-sampled image by nearest neighbour algorithm is little difference with that of other algorithms in quality performance from PSNR.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.541-547
• /
• 1992

The phased array antenna has the ability to perform adaptive sampling by directing the radar beam without inertia in any direction. The adaptive sampling capability of the phased array antenna allows each sampling time interval to be varied for each target, depending on the acceleration of each target at any time. In this paper we design a three-dimensional adaptive tracking algorithm for the phased array radar system with a given set of measurement parameters. The tracking algorithm avoids taking unnecessarily frequent samples, while keeping the angular prediction error within a fraction of antenna beamwidth so that the probability of detection will not be degraded during a track update illuminations. In our algorithm, the target model and the sampling rate are selected depending on the target range and the target maneuver status which is determined by a maneuver detector. A detailed simulation is conducted to test the validity of our tracking algorithm for encounter geometries under various conditions of maneuver.

• Journal of Power Electronics
• /
• v.16 no.6
• /
• pp.2212-2220
• /
• 2016

Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.5
• /
• pp.62-72
• /
• 1993

The phased array antenna has the ability to perform adaptive sampling by directing the radar beam without inertia in any direction. The adaptive sampling capability of the phased array antenna allows each sampling time interval to be varied for each target, depending on the acceleration of each target at any time. In this paper we design a three dimensional adaptive target tracking algorithm for the phased array radar system with a given set of measurement parameters. The tracking algorithm avoids taking unnecessarily frequent samples, while keeping the angular prediction error within a fraction of antenna beamwidth so that the probability of detection will not be degraded during a track updata illuminations. In our algorithm, the target model and the sampling rate are selected depending on the target range and the target maneuver status which is determined by a maneuver level detector. A detailed simulation is conducted to test the validity of our tracking algorithm for target trajectories under various conditions of maneuver.

• Journal of the Korean Statistical Society
• /
• v.35 no.2
• /
• pp.157-166
• /
• 2006

This research proposes an efficient Monte Carlo algorithm for computing error probability in high performance digital communication st stems. It characterizes special features of the problem and suggests an importance sampling algorithm specially designed to handle the problem. It uses a shifted exponential density as the importance sampling density, and shows an adaptive way of choosing the rate and the origin of the shifted exponential density. Instead of equal allocation, an intelligent allocation of the samples is proposed so that more samples are allocated to more important part of the error probability. The algorithm uses the nested feature of the error space and avoids redundancy in estimating the probability. The algorithm is applied to an example data set and shows a great improvement in accuracy of the error probability estimation.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.9 s.252
• /
• pp.1116-1123
• /
• 2006

In this study, the effective method for reliability estimation is proposed using tow-staged kriging metamodel and genetic algorithm. Kriging metamodel can be determined by appropriate sampling range and the number of sampling points. The first kriging metamodel is made based on the proposed sampling points. The advanced f'=rst order reliability method is applied to the first kriging metamodel to determine the reliability and most probable failure point(MPFP) approximately. Then, the second kriging metamodel is constructed using additional sampling points near the MPFP. These points are selected using genetic algorithm that have the maximum mean squared error. The Monte-Carlo simulation is applied to the second kriging metamodel to estimate the reliability. The proposed method is applied to numerical examples and the results are almost equal to the reference reliability.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.57-61
• /
• 2015

This paper describes the basic principles of 3D broadcast system and proposes new 3D broadcast technology that reduces the amount of data by applying CS(Compressed Sensing). Differences between Sampling theory and the CS technology concept was described. CS algorithm SS-CoSaMP(Single-Space Compressive Sampling Matched Pursuit) and AMP(Approximate Message Passing) was described. Image data compressed and restored by these algorithm was compared. Calculation time of the algorithm having a low complexity is determined.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1004-1011
• /
• 2005

In OFDM (Orthogonal Frequency Division Multiplexing) system, sampling frequency offset causes performance degradation due to increase of ICI. Sampling frequency offset can be generally estimated by correlation of the pilot signal or the known pattern within two contiguous OFDM symbol however, this method has the throughput degradation and the difficulty in applying to various OFDM systems. In this paper, we propose a new algorithm for sampling frequency offset estimation which can solve aforementioned issues. The proposed algorithm uses a single OFDM symbol to prevent throughput degradation and to apply to various OFDM-based communication systems flexibly Also, the proposed algorithm can enhance reliability by observing more number of correlations compared to the established algorithm in frequency domain. Extensive computer simulation shows that the proposed algorithm can improve the system performance in various channel conditions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.15-21
• /
• 2008

This paper presents a new association mining algorithm that uses two phase sampling for shortening the execution time at the cost of precision of the mining result. Previous FAST(Finding Association by Sampling Technique) algorithm has the weakness in that it only considered the frequent 1-itemsets in trimming/growing, thus, it did not have ways of considering mulit-itemsets including 2-itemsets. The new algorithm reflects the multi-itemsets in sampling transactions. It improves the mining results by adjusting the counts of both missing itemsets and false itemsets. Experimentally, on a representative synthetic database, the algorithm produces a sampled subset of results with an increased accuracy in terms of the 2-itemsets while it maintains the same 1uality of the data set.

• Journal of Communications and Networks
• /
• v.17 no.5
• /
• pp.517-524
• /
• 2015

The fast and accurate spectrum sensing over an ultra-wide bandwidth is a big challenge for the radio environment cognition. Considering sparse signal feature, two novel compressed sensing schemes are proposed, which can reduce compressed sampling rate in contrast to the traditional scheme. One algorithm is dynamically adjusting compression ratio based on modulation recognition and identification of symbol rate, which can reduce compression ratio. Furthermore, without priori information of the modulation and symbol rate, another improved algorithm is proposed with the application potential in practice, which does not need to reconstruct the signals. The improved algorithm is divided into two stages, which are the approaching stage and the monitoring stage. The overall sampling rate can be dramatically reduced without the performance deterioration of the spectrum detection compared to the conventional static compressed sampling rate algorithm. Numerous results show that the proposed compressed sensing technique can reduce sampling rate by 35%, with an acceptable detection probability over 0.9.