• 제목/요약/키워드: Finding error

검색결과 467건 처리시간 0.028초

R=1/2 Self-Doubly 조직 직교 길쌈부호를 찾는 효율적인 최적 스팬 알고리듬 (An Efficient Algorithm for finding Optimal Spans to determine R=1/2 Rate Systematic Convolutional Self-Doubly Orthogonal Codes)

  • 아타뱁도녀;서희종
    • 한국전자통신학회논문지
    • /
    • 제10권11호
    • /
    • pp.1239-1244
    • /
    • 2015
  • 본 논문에서는 길쌈 Doubly 직교 부호의 최적 스팬을 찾기 위한 새로운 방법(Convolutional Self-Doubly Orthogonal, CDO)을 제안한다. 이 새로운 방법은 병렬 Implicitly-Exhaustive 탐색방법을 사용하는데, 이 방법으로 R =1/2 CDO 코드에 대한 최적의 스팬을 찾기 위해서 계산시간을 감소시키는 방법으로 동적 검색 공간 감소 방법을 적용했다. 제안된 알고리듬을 모의실험한 결과 기존의 방법에 비해서 계산시간이 감소되었고, 오류 정정 성능이 향상되었음을 확인하였다.

항재밍 3차원 GPS 배열 안테나를 위한 Mutual coupling 보상 및 재밍 방향탐지 알고리즘 (Mutual Coupling Compensation and Direction Finding for Anti-Jamming 3D GPS Antenna Array)

  • 강규식;신천식;김선우
    • 한국통신학회논문지
    • /
    • 제42권4호
    • /
    • pp.723-730
    • /
    • 2017
  • 본 논문에서는 안테나 간의 상호 결합을 고려한 온라인 보상 알고리즘을 고려하였으며, 이를 적용하기 위한 새로운 GPS(Global Positioning System)용 안테나 배열을 제안하였다. 제안한 안테나 배열 및 ULA(Uniform Linear Array), URA(Uniform Rectangular Array)에 대한 항재밍 성능 평가를 위해 복수의 재밍신호 환경에 대한 방향탐지를 환경 조건 별로 나누어서 진행하였다. 1. 상호 결합이 존재하지 않는 환경. 2. 상호 결합이 있으나 보상이 이루어지지 않는 환경. 3. 상호 결합 보상이 이루어진 환경. RMSE(Root Mean Square Error) 분석을 통해 온라인 보상 알고리즘이 작동함을 확인하고 복수의 재밍신호에서도 피크 검출이 가능함을 보였다.

3차원 공간 맵핑을 통한 로봇의 경로 구현 (Implementation of Path Finding Method using 3D Mapping for Autonomous Robotic)

  • 손은호;김영철;정길도
    • 제어로봇시스템학회논문지
    • /
    • 제14권2호
    • /
    • pp.168-177
    • /
    • 2008
  • Path finding is a key element in the navigation of a mobile robot. To find a path, robot should know their position exactly, since the position error exposes a robot to many dangerous conditions. It could make a robot move to a wrong direction so that it may have damage by collision by the surrounding obstacles. We propose a method obtaining an accurate robot position. The localization of a mobile robot in its working environment performs by using a vision system and Virtual Reality Modeling Language(VRML). The robot identifies landmarks located in the environment. An image processing and neural network pattern matching techniques have been applied to find location of the robot. After the self-positioning procedure, the 2-D scene of the vision is overlaid onto a VRML scene. This paper describes how to realize the self-positioning, and shows the overlay between the 2-D and VRML scenes. The suggested method defines a robot's path successfully. An experiment using the suggested algorithm apply to a mobile robot has been performed and the result shows a good path tracking.

A SES Alarmed Link Encryption Synchronization Method Having Optimized Threshold Value for High-Speed Video Data Encryption

  • Kim, Hyeong-Rag;Lee, Hoon-Jae;Kim, Ki-Hwan;Jung, Ju-Hyun
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권9호
    • /
    • pp.57-64
    • /
    • 2017
  • CCSDS Standard is widely used in the international space telecommunication area. But standard recommendation of CCSDS is not restrictive, so, we can select an appropriate encryption protocol among the layer. For synchronization, encryption sync is attached in the beginning of the encrypted data. In the exceptional environmental condition, although the receiver can not decrypt the normal data, the sender have no conception of that situation. In this paper, we propose a two-stage SES alarmed link encryption synchronization method having optimized threshold value necessary to decide whether the receiver has a correct decryption or not. first, through the experiment of mutual relations between error rate and encryption synchronization detection error, we can predict worst communication environment for the selected encryption synchronization pattern. second, through the experiment for finding what number of consecutive frame synchronization error is an appropriate reference value and analysis of that experiment, we suggest an optimized threshold value for resynchronization request. lastly, through the output images we can predict the probability error that should be guaranteed by channel coder.

방사성의약품 합성 프로세스 검증을 위한 네트워크 모델링 (Development of A Validation System For Automatic Radiopharmaceutical Synthesis Process Using Network Modeling)

  • 이철수;허은영;김종민;김동수
    • 산업공학
    • /
    • 제24권3호
    • /
    • pp.187-195
    • /
    • 2011
  • The automatic radiopharmaceutical module consists of several 2-way valves, couple of syringes, gas supply unit, heating(cooling) unit and sensors to control the chemical reagents as well as to help the chemical reaction. In order to control the actuators of radiopharmaceutical module, the process is tabulated using spread sheet as like excel. Unlike the common program, a trivial error is too critical to allowed in the process because the error can lead to leak the radioactive reagent and to cause the synthesis equipment failure during synthesizing. Hence, the synthesis process has been validated using graphic simulation while the operator checks the whole process visually and undergoes trial and error. The verification of the synthesis process takes a long time and has a difficulty in finding the error. This study presents a methodology to verify the process algebraically while the radiopharmaceutical module is converted to the network model. The proposed method is validated using actual synthesis process.

Moving Pixel Displacement Detection using Correlation Functions on CIS Image

  • Ryu, Kwang-Ryol;Kim, Young-Bin
    • Journal of information and communication convergence engineering
    • /
    • 제8권4호
    • /
    • pp.349-354
    • /
    • 2010
  • Moving pixel displacement detection algorithm using correlation functions for making panorama image on the continuous images is presented in this paper. The input images get from a CMOS image sensor (CIS). The camera is maintained by constant brightness and uniform sensing area in test input pattern. For simple navigation and capture image has to 70% overlapped region. A correlation rate in two image data is evaluated by using reference image with first captures, and compare image with next captures. The displacement of the two images are expressed to second order function of x, y and solved with finding the coefficient in second order function. That results in the change in the peak correlation displacement from the reference to the compare image, is moving to pixel length. The navigating error is reduced by varying the path because the error is shown in the difference of the positioning vector between the true pixel position and the navigated pixel position. The algorithm performance is evaluated to be different from the error vector to vary the navigating path grid.

이동 목표물 추정 정확도를 향상시키기 위한 고 분해능 최적 빔 지향 패턴에 관한 연구 (A Study on Super Resolution Optimum Beam Steering Pattern for Improvement Moving Target Estimation Accuracy)

  • 조성국;전병국;양길모
    • 디지털산업정보학회논문지
    • /
    • 제10권4호
    • /
    • pp.71-78
    • /
    • 2014
  • Method a target estimation in spatial are mobile wireless communication using network cell and GPS. It have much error that mobile wireless communication depend on cell size. GPS method can't find a target in shadow and inner area. In this paper, we estimate a target as direction of arrival method using adaptive array antenna system. Adaptive array antenna system can obtain desired signal to remove other signal This paper studied digital beamforming method in order to estimation a target. Proposed method is modified optimum weight and antenna error correction to estimation an optimal receive signal. Digital beamforming method decided a signal phase and amplitude from received signal on array antenna element. But if it is not to do error correction of received signal, system performance have decreased. Firstly, we proposed modified optimum weight in order to finding desired target. Secondly, we are error correction of antenna incident signals by optimal weight before digital beamforming method. Thirdly, throughly simulation, we showed that system performance of proposed method compare proposal method with general method. It have improved resolution of estimation target to good performance more proposed method than general method.

A New Distance Measure for a Variable-Sized Acoustic Model Based on MDL Technique

  • Cho, Hoon-Young;Kim, Sang-Hun
    • ETRI Journal
    • /
    • 제32권5호
    • /
    • pp.795-800
    • /
    • 2010
  • Embedding a large vocabulary speech recognition system in mobile devices requires a reduced acoustic model obtained by eliminating redundant model parameters. In conventional optimization methods based on the minimum description length (MDL) criterion, a binary Gaussian tree is built at each state of a hidden Markov model by iteratively finding and merging similar mixture components. An optimal subset of the tree nodes is then selected to generate a downsized acoustic model. To obtain a better binary Gaussian tree by improving the process of finding the most similar Gaussian components, this paper proposes a new distance measure that exploits the difference in likelihood values for cases before and after two components are combined. The mixture weight of Gaussian components is also introduced in the component merging step. Experimental results show that the proposed method outperforms MDL-based optimization using either a Kullback-Leibler (KL) divergence or weighted KL divergence measure. The proposed method could also reduce the acoustic model size by 50% with less than a 1.5% increase in error rate compared to a baseline system.

Finding approximate occurrence of a pattern that contains gaps by the bit-vector approach

  • Lee, In-Bok;Park, Kun-Soo
    • 한국생물정보학회:학술대회논문집
    • /
    • 한국생물정보시스템생물학회 2003년도 제2차 연례학술대회 발표논문집
    • /
    • pp.193-199
    • /
    • 2003
  • The application of finding occurrences of a pattern that contains gaps includes information retrieval, data mining, and computational biology. As the biological sequences may contain errors, it is important to find not only the exact occurrences of a pattern but also approximate ones. In this paper we present an O(mnk$_{max}$/w) time algorithm for the approximate gapped pattern matching problem, where m is the length of the text, H is the length of the pattern, w is the word size of the target machine, and k$_{max}$ is the greatest error bound for subpatterns.

  • PDF

송전선로 거리표정치에 대한 실 고장거리의 확률적 예측방안 (A study on the prediction method of the real fault distance using probability to the relay data of transmission line fault location)

  • 이용희;백두현;장석한
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 제37회 하계학술대회 논문집 A
    • /
    • pp.10-11
    • /
    • 2006
  • The fault location is obtained from the distance relay that detects the fault of the transmission line. In this time, transmission line crews track down the fault location and the reasons. However, because of having error at the fault location of the distance relay, there is a discordance between real and obtained fault location. As this reason, the inspection time for finding fault location can be longer. In this paper, we proposed the statistical (regression) analysis method based on each type of relay's the historical fault location data and the real fault distance data to improve the problems. With finding the regression equation based on the regression analysis, and putting the relay fault location into that equation, the real fault distance is calculated. As a result of the Prediction fault location, the inspection time of transmission line can be reduced.

  • PDF