• 제목/요약/키워드: random errors

검색결과 444건 처리시간 0.026초

Reed-Solomon Code와 Side Information을 이용한 SFH 시스템의 BER 성능 분석 (BER Performance Analysis of SFH System Using Reed-Solomon Code and Side Information)

  • 한상진;김용철;강경원
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 추계종합학술대회 논문집(1)
    • /
    • pp.137-140
    • /
    • 2000
  • In this paper. we analyzed the performance of a SFH (slow frequency hopping) system under partial-band jamming, multiple access interference and wide-band random noise. For the correction of burst errors due to channel hit, Reed-Solomon coding followed by block interleaving is employed. Errors-and-erasures decoding with side information is exploited to enhance the correctional capability. We derived a closed-form solution for the BER estimation. Errors resulting from random noise and erasures resulting from burst interference are separately analyzed and finally BER is computed due to these composite noise sources. Estimated BER performance is verified by computer simulation.

  • PDF

An Adaptively Segmented Forward Problem Based Non-Blind Deconvolution Technique for Analyzing SRAM Margin Variation Effects

  • Somha, Worawit;Yamauchi, Hiroyuki
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제14권4호
    • /
    • pp.365-375
    • /
    • 2014
  • This paper proposes an abnormal V-shaped-error-free non-blind deconvolution technique featuring an adaptively segmented forward-problem based iterative deconvolution (ASDCN) process. Unlike the algebraic based inverse operations, this eliminates any operations of differential and division by zero to successfully circumvent the issue on the abnormal V-shaped error. This effectiveness has been demonstrated for the first time with applying to a real analysis for the effects of the Random Telegraph Noise (RTN) and/or Random Dopant Fluctuation (RDF) on the overall SRAM margin variations. It has been shown that the proposed ASDCN technique can reduce its relative errors of RTN deconvolution by $10^{13}$ to $10^{15}$ fold, which are good enough for avoiding the abnormal ringing errors in the RTN deconvolution process. This enables to suppress the cdf error of the convolution of the RTN with the RDF (i.e., fail-bit-count error) to $1/10^{10}$ error for the conventional algorithm.

A Technique to Circumvent V-shaped Deconvolution Error for Time-dependent SRAM Margin Analyses

  • Somha, Worawit;Yamauchi, Hiroyuki;Yuyu, Ma
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제2권4호
    • /
    • pp.216-225
    • /
    • 2013
  • This paper discusses the issues regarding an abnormal V-shaped error confronting algebraic-based deconvolution process. Deconvolution was applied to an analysis of the effects of the Random Telegraph Noise (RTN) and Random Dopant Fluctuation (RDF) on the overall SRAM margin variations. This paper proposes a technique to suppress the problematic phenomena in the algebraic-based RDF/RTN deconvolution process. The proposed technique can reduce its relative errors by $10^{10}$ to $10^{16}$ fold, which is a sufficient reduction for avoiding the abnormal ringing errors in the RTN deconvolution process. The proposed algebraic-based analyses allowed the following: (1) detection of the truncating point of the TD-MV distributions by the screening test, and (2) predicting the MV-shift-amount by the assisted circuit schemes needed to avoid the out of specs after shipment.

  • PDF

GENERAL NONLINEAR RANDOM SET-VALUED VARIATIONAL INCLUSION PROBLEMS WITH RANDOM FUZZY MAPPINGS IN BANACH SPACES

  • Balooee, Javad
    • 대한수학회논문집
    • /
    • 제28권2호
    • /
    • pp.243-267
    • /
    • 2013
  • This paper is dedicated to study a new class of general nonlinear random A-maximal $m$-relaxed ${\eta}$-accretive (so called (A, ${\eta}$)-accretive [49]) equations with random relaxed cocoercive mappings and random fuzzy mappings in $q$-uniformly smooth Banach spaces. By utilizing the resolvent operator technique for A-maximal $m$-relaxed ${\eta}$-accretive mappings due to Lan et al. and Chang's lemma [13], some new iterative algorithms with mixed errors for finding the approximate solutions of the aforesaid class of nonlinear random equations are constructed. The convergence analysis of the proposed iterative algorithms under some suitable conditions are also studied.

Estimation Technique of Fixed Sensor Errors for SDINS Calibration

  • Lee, Tae-Gyoo;Sung, Chang-Ky
    • International Journal of Control, Automation, and Systems
    • /
    • 제2권4호
    • /
    • pp.536-541
    • /
    • 2004
  • It is important to estimate and calibrate sensor errors in maintaining the performance level of SDINS. In this study, an estimation technique of fixed sensor errors for SDINS calibration is discussed. First, the fixed errors of gyros and accelerometers, excluding gyro biases are estimated by the navigation information of SDINS in multi-position. The SDINS with RLG includes flexure errors. In this study, the gyros flexures are out of consideration, but the proposed procedure selects certain positions and rotations in order to minimize the influence of flexures. Secondly, the influences of random walks, flexures and orientation errors are verified via numerical simulations. Thirdly, applying the previous estimated errors to SDINS, the estimation of gyro biases is conducted via the additional control signals of close-loop self-alignment. Lastly, the experiments illustrate that the extracted calibration parameters are available for the improvement of SDINS.

Saddlepoint approximations for the ratio of two independent sequences of random variables

  • Cho, Dae-Hyeon
    • Journal of the Korean Data and Information Science Society
    • /
    • 제9권2호
    • /
    • pp.255-262
    • /
    • 1998
  • In this paper, we study the saddlepoint approximations for the ratio of independent random variables. In Section 2, we derive the saddlepoint approximation to the probability density function. In Section 3, we represent a numerical example which shows that the errors are small even for small sample size.

  • PDF

STATIONARY $\beta-MIXING$ FOR SUBDIAGONAL BILINEAR TIME SERIES

  • Lee Oe-Sook
    • Journal of the Korean Statistical Society
    • /
    • 제35권1호
    • /
    • pp.79-90
    • /
    • 2006
  • We consider the subdiagonal bilinear model and ARMA model with subdiagonal bilinear errors. Sufficient conditions for geometric ergodicity of associated Markov chains are derived by using results on generalized random coefficient autoregressive models and then strict stationarity and ,a-mixing property with exponential decay rates for given processes are obtained.

삼각 과오 분포를 가진 불완전한 검사원의 과대 추정 확률과 분석 (Analysis and Probability of Overestimation by an Imperfect Inspector with Errors of Triangular Distributions)

  • 양문희;조재형
    • 산업경영시스템학회지
    • /
    • 제41권2호
    • /
    • pp.117-132
    • /
    • 2018
  • There always exist nonzero inspection errors whether inspectors are humans or automatic inspection machines. Inspection errors can be categorized by two types, type I error and type II error, and they can be regarded as either a constant or a random variable. Under the assumption that two types of random inspection errors are distributed with the "uniform" distribution on a half-open interval starting from zero, it was proved that inspectors overestimate any given fraction defective with the probability more than 50%, if and only if the given fraction defective is smaller than a critical value, which depends upon only the ratio of a type II error over a type I error. In addition, it was also proved that the probability of overestimation approaches one hundred percent as a given fraction defective approaches zero. If these critical phenomena hold true for any error distribution, then it might have great economic impact on commercial inspection plans due to the unfair overestimation and the recent trend of decreasing fraction defectives in industry. In this paper, we deal with the same overestimation problem, but assume a "symmetrical triangular" distribution expecting better results since our triangular distribution is closer to a normal distribution than the uniform distribution. It turns out that the overestimation phenomenon still holds true even for the triangular error distribution.

기계학습에 기반한 한국어 미등록 형태소 인식 및 품사 태깅 (Part-Of-Speech Tagging and the Recognition of the Korean Unknown-words Based on Machine Learning)

  • 최맹식;김학수
    • 정보처리학회논문지B
    • /
    • 제18B권1호
    • /
    • pp.45-50
    • /
    • 2011
  • 한국어 형태소 분석에서 미등록 형태소 오류들은 2가지 유형으로 나뉜다. 첫 번째 오류 유형은 형태소 분석기가 어떤 형태소열도 찾아내지 못하는 것이고, 두 번째 오류 유형은 등록 형태소들의 잘못된 조합을 찾아내는 것이다. 지금까지 대부분의 기존 미등록 형태소 추정 기술들은 단지 첫 번째 오류 유형에만 초점을 맞추어 왔다. 본 논문에서는 2가지 유형의 오류들의 모두 다룰 수 있는 미등록 형태소 추정 방법을 제안한다. 제안 방법은 SVM(Support Vector Machine)을 이용하여 미등록 형태소 오류들을 포함할 가능성이 있는 어절들을 검출한다. 그리고 CRFs(Conditional Random Fields)를 이용하여 검출된 어절들의 형태소 분리와 품사 태깅을 수행한다. 실험에서 제안 방법은 기능어 최장 일치 기반의 전형적인 방법보다 뛰어난 성능을 보였다. 실험 결과에 기초하여 미등록 형태소 오류의 두 번째 유형이 한국어 형태소 분석의 성능을 올리기 위해서 꼭 다루어져야 한다는 것을 알 수 있었다.

Industrial application of gross error estimation and data reconciliation to byproduction gases in iron and steel making plants

  • Yi, Heui-Seok;Hakchul Shin;Kim, Jeong-Hwan;Chonghun Han
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.69.2-69
    • /
    • 2002
  • Process measurements contain random and gross errors and the size estimation of gross errors is required for production accounting. Mixed integer programming technique had been applied to identify and estimate the gross errors simultaneously. However, the compensate model based on mixed integer programming used all measured variables or spanning tree as gross error candidates. This makes gross error estimation problem combinatorial or computationally expensive. Mixed integer programming with test statistics is proposed for computationally inexpensive gross error identification /estimation. The gross error candidates are identified by measurement test and the set of gross error candidates are...

  • PDF