• 전자공학회논문지A
• /
• 제30A권3호
• /
• pp.16-33
• /
• 1993

New decoding algorithm of double-error-correction Reed-Solmon codes over GF(2$^{8}$) for optical compact disks is proposed and decoding algorithm of RS codes with triple-error-correcting capability is presented in this paper. First of all. efficient algorithms for estimating the number of errors in the received code words are presented. The most complex circuits in the RS decoder are parts for soving the error-location numbers from error-location polynomial, so the complexity of those circuits has a great influence on overall decoder complexity. One of the most known algorithm for searching the error-location number is Chien's method, in which all the elements of GF(2$^{m}$) are substituted into the error-location polynomial and the error-location number can be found as the elements satisfying the error-location polynomial. But Chien's scheme needs another 1 frame delay in the decoder, which reduces decoding speed as well as require more stroage circuits for the received ocode symbols. The ther is Polkinghorn method, in which the roots can be resolved directly by solving the error-location polynomial. Bur this method needs additional ROM (readonly memory) for storing tthe roots of the all possible coefficients of error-location polynomial or much more complex cicuit. Simple, efficient, and high speed method for solving the error-location number and decoding algorithm of double-error correction RS codes which reudce considerably the complexity of decoder are proposed by using Hilbert theorems in this paper. And the performance of the proposed decoding algorithm is compared with that of conventional decoding algorithms. As a result of comparison, the proposed decoding algorithm is superior to the conventional decoding algorithm with respect to decoding delay and decoder complexity. And decoding algorithm of RS codes with triple-error-correcting capability is presented, which is suitable for error-correction in digital audio tape, also.

• 대한인간공학회지
• /
• 제9권1호
• /
• pp.35-42
• /
• 1990

This study is concerned with the accuracy, of error with which subjects can interpolate the location of a target between two graduation markers with 4 orientations and 6 sizes CRT display. Stimuli were graphic images on CRT with a linear, end-markec, ungraduated scales having a target. The location of a target is estimated in units over te range 1-99. Smallest error of estimates was at the near ends and middle of the base-line. The median error was less than 2 units, modal error was 1, and the most error (; 99.7%) was within 10. A proper size to make an minimum error in interpolation exists such that size 400 pixels. Interpolation estimation is shown to be affected by the size, location and interaction (orientation x location, size x location). The accuracy, interpolation performance are discussed in relation to absolute error associated with visual performance.

• ETRI Journal
• /
• 제33권4호
• /
• pp.528-536
• /
• 2011

In this paper, we analyze the location accuracy of real-time locating systems (RTLSs) in multipath environments in which the RTLSs comply with the ISO/IEC 24730-2 international standard. To analyze the location error of RTLS in multipath environments, we consider a direct path and indirect path, in which time and phase are delayed, and also white Gaussian noise is added. The location error depends strongly on both the noise level and phase difference under a low signal-to-noise ratio (SNR) regime, but only on the noise level under a high SNR regime. The phase difference effect can be minimized by matching it to the time delay difference at a ratio of 180 degrees per 1 chip time delay (Tc). At a relatively high SNR of 10 dB, a location error of less than 3 m is expected at any phase and time delay value of an indirect signal. At a low SNR regime, the location error range increases to 8.1 m at a 0.5 Tc, and to 7.3 m at a 1.5 Tc. However, if the correlation energy is accumulated for an 8-bit period, the location error can be reduced to 3.9 m and 2.5 m, respectively.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
• /
• pp.51-53
• /
• 2009

In wireless sensor networks(WSNs), geographic routing algorithms can enhance the network capacity. However, in the real WSNs, it is difficult for each node to know its accurate physical location. Geographic routing with location error may have serious problems such as disconnected links and delayed data transmission. In this letter, we present an efficient location error detection scheme for geographic routing. The proposed algorithm can efficiently update its incorrect location without additional procedure and finally enhance the performance on the geographic routing with the location errors.

• 전자공학회논문지
• /
• 제52권5호
• /
• pp.190-196
• /
• 2015

본 논문은 항법장치 위치보정을 위해 칼만필터를 적용한 GPS/INS융합의 다중보정방법을 제안한다. 연구에서는 관성항법장치를 구현하기 위해 9축 항법장치로 보정알고리즘을 적용하여 위치오차를 감소시킨 방법을 적용했다. 일반적으로 GPS/INS는 위치정보를 얻어낼 수 있지만 위치정보를 구하는 과정에서 오차 또한 더불어 커지게 되기에 이를 보정하기 위한 강인한 오차 보정 알고리즘이 필요하다. 본 논문에서는 9축 관성센서(mpu-9150)의 외란에 대한 강인성 향상을 위해 가속도계 보정 알고리즘을 사용하여 tilt보정을 수행했으며, 제어 대상체의 정확한 방위를 파악할 수 있도록 Yaw각 재정의 알고리즘을 적용하였다. 최종적으로 GPS/INS와 칼만 필터를 함께 결합한 통합시스템을 구현하였다.

• 대한임베디드공학회논문지
• /
• 제9권6호
• /
• pp.323-334
• /
• 2014

In this paper, we proposed indoor positioning system with improved accuracy. The proposed indoor location measurement system is based pedestrian location measurement method that use the embedded sensor of smartphone. So, we do not need wireless external resources, such as GPS or WiFi signals. The conventional methods measure indoor location by generating a movement route of pedestrian by step and direction recognition. In this paper, to correct the direction sensor error, we use the common feature of the normal indoor floor map that the indoor path is lattice-structured. And we quantize moving directions depending on the direction of indoor path. In addition, we propose moving direction measuring method using geomagnetic sensor and gyro sensor to improve the accuracy. Also, the proposed step detection method uses angle and accelerometer sensors. The proposed step detection method is not affected by the posture of the smartphone. Direction errors caused by direction sensor error is corrected due to proposed moving direction measuring method. The proposed location error correction method corrects location error caused by step detection error without the need for external wireless signal resources.

• 대한안전경영과학회지
• /
• 제14권1호
• /
• pp.217-224
• /
• 2012

Location-Based Services(LBS) is a service that provide location information by using communication network or satellite signal. In order to provide LBS precisely and efficiently, we studied how we can reduce the error on location determination of objects such people and things. We focus on using the least square method and triangulation positioning method to improves the accuracy of the existing location determination method. Above two methods is useful if the distance between the AP and the tags can be find. Though there are a variety of ways to find the distance between the AP and tags, least squares and triangulation positioning method are wildely used. In this thesis, positioning method is composed of preprocessing and calculation of location coordinate and detail of methodology in each stage is explained. The distance between tag and AP is adjusted in the preprocessing stage then we utilize least square method and triangulation positioning method to calculate tag coordinate. In order to confirm the performance of suggested method, we developed the test program for location determination with Labview2010. According to test result, triangulation positioning method showed up loss error than least square method by 38% and also error reduction was obtained through adjustment process and filtering process. It is necessary to study how to reduce error by using additional filtering method and sensor addition in the future and also how to improve the accuracy of location determination at the boundary location between indoor and outdoor and mobile tag.

• 제어로봇시스템학회논문지
• /
• 제14권8호
• /
• pp.760-766
• /
• 2008

This paper proposes an efficient location technique to find an indoor location under the IEEE 802.11 wireless local area networks. The proposed method is based on the range measurements obtained from a simple radio frequency propagation model. Thus, unlike the radio frequency fingerprint correlation method, it does not suffer from the computational burden during the real-time location service period and can quickly reply the location requests of many users at the same time. To increase the location accuracy in spite of the frequent non-line-of-sight error occurrences, the proposed method calibrates the distortion of the non-line-of-sight error by a simple measurement surveying procedure that does not require the surveyor's manual interaction. Experimental results show the capability of the proposed method.

• 제어로봇시스템학회논문지
• /
• 제16권2호
• /
• pp.158-163
• /
• 2010

In this paper, we propose the location measurement algorithm of unknown tag based on RFID (Radio-Frequency IDentification) by using RSSI (Received Signal Strength Indication) and TDOA (Time Difference of Arrival) and extended Kalman filter in smart space. To do this, first, we recognize the location of unknown tag by using the RSSI and TDOA recognition methods. Second, we set the coordinate of the tag location measured by using trilateration and SX algorithm. But the tag location data measured by this method are included complex environmental error. So, we use the extended Kalman filter in order to revise error data of the tag location. Finally, we validate the applicability of the proposed method though the simulation in a complex environment.

• 전자공학회논문지A
• /
• 제30A권11호
• /
• pp.21-28
• /
• 1993

Decoding algorithm of noncyclic Reed-Solomon codes consists of four steps which are to compute syndromes, to find error-location polynomial, to decide error-location, and to solve error-values. There is a decoding method by which the computation of both error-location polynomial and error-evaluator polynimial can be avoided in conventional decoding methods using Euclid algorithm. The disadvantage of this method is that the same amount of computation is needed that is equivalent to solve the avoided polynomial. This paper considers the division method on polynomial on GF(2$^{m}$) systematically. And proposes a novel method to find error correcting polynomial by simple mathematical expression without the same amount of computation to find the two avoided polynomial. Especially. proposes the method which the amount of computation to find F (x) from the division M(x) by x, (x-1),....(x--${\alpha}^{n-2}$) respectively can be avoided. By applying the simple expression to decoding procedure on RS codes, propses a new decoding algorithm, and to show the validity of presented method, computer simulation is performed.