• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.426-432
• /
• 2007

The MAP algorithm is designed and implemented through the sliding window method for turbo decoding. First, the implementation issues, which are the length of the sliding window and the normalization method of state metrics are reviewed, and their optimal values are obtained by the simulation. All component schemes of the decoder including the branch metric evaluator are also presented. The proposed MAP architecture can be easily redesigned according to the size of sliding window, that is, sub-frame length because of its simplicity on buffer control.

• Journal of Sensor Science and Technology
• /
• v.28 no.3
• /
• pp.146-151
• /
• 2019

This paper reports a sliding window filtering approach for ground moving targets with cross-correlated sensor noise and uncertainty. In addition, the effect of uncertain parameters during a tracking error on the model performance is considered. A distributed fusion sliding window filter is also proposed. The distributed fusion filtering algorithm represents the optimal linear combination of local filters under the minimum mean-square error criterion. The derivation of the error cross-covariances between the local sliding window filters is the key to the proposed method. Simulation results of the motion of the ground moving target a demonstrate high accuracy and computational efficiency of the distributed fusion sliding window filter.

• Journal of Multimedia Information System
• /
• v.6 no.1
• /
• pp.1-6
• /
• 2019

In the field of industrial applications, the real-time performance of the target detection problem is very important. The most serious time consumption in the pedestrian detection process is the extraction phase of the candidate window. To accelerate the speed, in this paper, a fast extraction of pedestrian candidate window based on the BING (Binarized Normed Gradients) algorithm replaces the traditional sliding window scanning. The BING features are extracted with the positive and negative samples and input into the two-stage SVM (Support Vector Machine) classifier for training. The obtained BING template may include a pedestrian candidate window. The trained template is loaded during detection, and the extracted candidate windows are input into the classifier. The experimental results show that the proposed method can extract fewer candidate window and has a higher recall rate with more rapid speed than the traditional sliding window detection method, so the method improves the detection speed while maintaining the detection accuracy. In addition, the real-time requirement is satisfied.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.109-111
• /
• 1989

In this paper, we propose a new method of parameter est mat ion which modifies the exponentially weighted RLS (WRLS) method using asliding window. It can be used in adaptive control for a class of linear tine varying system. Computer simulations show that our new method tracts rapidly time varying parameters more effectively than WRLS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1218-1226
• /
• 1999

In decoding the turbo codes, the sliding window BCJR algorthm, derived from the BCJR algorithm, permits a continuous decoding of the coded sequence without requiring trellis fermination of the constituent codes and uses reduced memory span. However, the number of computation required is greater than that of BCJR algorithm and no study on the effect of the window length has been reported. In this paper, we propose an eddicient sliding window type scheme which maintains the advantages of the conventional sliding window algorithm, reduces its computational burdens, and improves is BER performance. A guideline is first presented to determine the proper window length and then a computationally efficient sliding window BCJR algorithm is obtained by allowing the window to be forwarded in multi-step. Simulation results show that the proposed scheme outperforms the conventional sliding window BCJR algorithm with reduced complexity. It gains 0.1dB SNR improvements over the conventional method for the constraint length 3 and BER $10^{-4}$

• Journal of KIISE:Software and Applications
• /
• v.32 no.9
• /
• pp.912-919
• /
• 2005

When we apply binary classification to multi-class classification for text categorization, we use the One-Against-All method generally, However, this One-Against-All method has a problem. That is, documents of a negative set are not labeled by human. Thus, they can include many noisy documents in the training data. In this paper, we propose that the Sliding Window technique and the EM algorithm are applied to binary text classification for solving this problem. We here improve binary text classification through extracting noise documents from the training data by the Sliding Window technique and re-assigning categories of these documents using the EM algorithm.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.565-568
• /
• 2003

This paper presents a method that can be used to reduce the decoding computational complexity in turbo codes. To reduce the decoding complexity we proposed an adaptive sliding window method which control the learning period of Viterbi sliding window method depending on channel signal to interference ratio (SIR). When received signal to interference ratio (SIR) is relatively high, we can reduce the decoding complexity without a noticeable degradation of BER performance at CDMA cellular system with power control error.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2002.06a
• /
• pp.139-152
• /
• 2002

Gene-shaving(Hastie et al, 2000) is a very useful method to identify a meaningful group of genes when the variation of expression is large. By shaving off the low-correlated genes with the leading principal component, the primary genes with the coherent expression pattern can be identified. Gene-shaving method works well If expression levels are varied enough, but it may not catch the meaningful cluster in low expression level or different expression time even with coherent patterns. The sliding window gene-shaving method which is to apply gene-shaving in each sliding window after hierarchical clustering is to compensate losing a meaningful set of genes whose variation is not large but distinct. The performance to identify expression patterns is compared for the simulated profile data by the different variance and expression level.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.11
• /
• pp.2017-2020
• /
• 2011

Flicker, which is also known as voltage fluctuation, is an electromagnetic phenomenon generated by large scale nonlinear loads, such as arc furnaces and welding machines. Since a severe and continuous flicker can cause to some damages to electrically sensitive loads as well as human's visual irritations, it needs to be appropriately managed by being accurately measured, quantified and assessed. In Korea, an equivalent 10-Hz flicker index, shortly ${\Delta}V10$, is used to determine the permission limit of flicker. This paper presents an efficient calculation of the flicker index by using a half-cycle sliding window and a recursive method, showing a concrete calculating procedure of ${\Delta}V10$ from the viewpoint of signal processing.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.27 no.9
• /
• pp.449-454
• /
• 2015

In this study, the effects of lock operations on the infiltration rates for the two window types sliding and lift sliding (LS) are investigated through experiment and simulation. The airtightness levels of the two window types-with locks both on and off-were measured according to the KS F 2292 Test method of airtightness that is used for windows and doors. The air-flow rates of both window types with the locks on for a pressure differential of 10 Pa are $1.98m^3/(m^2h)$ and $1.68m^3/(m^2h)$, respectively; with the locks off, the air-flow rates of the sliding and LS windows are $2.64m^3/(m^2h)$ and $5.83m^3/(m^2h)$, respectively, whereby the air-flow rates are 33% higher for sliding and 247% higher for LS. The air change per hour (ACH) was calculated using the ventilation-simulation software CONTAM. For the sliding window, the ACH changed from 0.45 to 0.57 when the lock was operated from on to off, representing an increase of 27%. For the LS window, the ACH changed from 0.29 to 0.81, showing an increase of 179%.