• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4B
• /
• pp.208-216
• /
• 2007

Wireless Sensor Networks (WSNs) are characterized by low capacity on each nodes and links. Wireless links have high bit error rate (BER) parameter that changes frequently due to the changes on network topology, interference, etc. To guarantee reliability in an error-prone environment, a retransmission mechanism can be used. In this mechanism, the number of retransmissions is used as a parameter that controls reliability requirement level. In this paper, we propose an Error Adaptive Transport Protocol (EATP) for WSNs that updates the number of retransmissions regularly to guarantee reliability during bit error rate changes as well as to utilize energy effectively. The said algorithm uses local information, thus, it does not create overhead problem.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.546-550
• /
• 2002

This paper proposes an error compensation method that improves accuracy with geometry information of injection molding parts. Geometric information can give an improved accuracy in reverse engineering. Measuring data can not lead to get accurate geometric model, including errors of physical parts and measuring machines. Measuring data include errors which can be classified into two types. One is molding error in product, the other is measuring error. Measuring error includes optical error of laser scanner, deformation by probe forces of CMM and machine error. It is important to compensate these in reverse engineering. Least square method(LSM) provides the cloud data with a geometry compensation, improving accuracy of geometry. Also, the functional shape of a part and design concept can be reconstructed by error compensation using geometry information.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.391-400
• /
• 2006

With the on-going wireless access technologies, the Internet has become accessible anytime anywhere. In wireless networks, link errors significantly degrade the performance of the transmission control protocol (TCP). To cope with this issue, this paper improves the recently-proposed terrestrial REFWA (T-REFWA) scheme by adding a new error recovery mechanism to its original design. In the T-REFWA scheme, senders are acknowledged with appropriate sending rates at which an efficient and fair utilization of network resources can be achieved. As the feedback values are computed independently of link errors, senders can keep transmitting data at high rates even in case of link error occurrences. Using this feature, the proposed error recovery mechanism can achieve high throughput in environments with high bit error rates. The throughput is further improved by disabling the exponential back-off algorithm of TCP so that long idle times are avoided in case of link errors. We show through simulations that the proposed method improves TCP performance in high bit error rates. Compared with several TCP variants, the proposed error recovery scheme exhibits higher link utilization and guarantees system fairness for different bit error rates.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.459-465
• /
• 2010

A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus error signals are also introduced: One for minimizing the Euclidean probability density function distance and the other for minimizing the constant modulus error entropy. The relations between the algorithms and their characteristics are investigated, and their performance is compared and analyzed through simulations in multi-path channel environments. The proposed algorithm has a lower computational complexity and a faster convergence speed than the other ITL algorithms that are based on a constant modulus error. The error samples of the proposed blind algorithm exhibit more concentrated density functions and superior error rate performance in severe multi-path channel environments when compared with the other algorithms.

• Journal of the Ergonomics Society of Korea
• /
• v.19 no.1
• /
• pp.1-9
• /
• 2000

This study was performed to investigate some characteristics on human error proneness in the computerized work environment. Our concerning theme was on human error likelihood according to personal temperament. Two experiments were performed. The first experiment was to study the effect of field- independence/dependence on error likelihood. The second experiment was on error proneness. These experiments were performed in information search task. which was most frequent task in computerized work environment such as the control room of nuclear power plant. Ten subjects were participated in this study. Analyzed results are as follows. Field-independence/dependence had a significant effect in both information search time and error frequency. Error proneness had a significant effect in both factors, too. And, a positive correlation was found between error frequency and information search time. These results will be utilized as a basis to study operator's error proneness in the computerized control room of nuclear power plant. later on.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.597-599
• /
• 2005

To make the autonomous mobile robot move in the unknown space, we have to know the information of current location of the robot. So far, the location information that was obtained using Encoder always includes Dead Reckoning Error, which is accumulated continuously and gets bigger as the distance of movement increases. In this paper, we analyse the effect of the size of the two wheels of the mobile robot and the wheel track of them among the factors of Dead Reckoning Error. And after this, we compensate this Dead Reckoning Error by Kalman filter using Gyro Sensors. To accomplish this, we develop the controller to analyse the error components of Gyro Sensor and to minimize the error values. We employ the numerical approach to analyse the error components by linearizing them because each error component is nonlinear. And we compare the improved result through simulation.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.152-155
• /
• 2002

In this paper, a new approach is proposed for the error detection dedicated to MPEG-4 video coding by using the digital watermarking. In the process of encoding, the proposed scheme abstracts the macroblock features of headers, motion vectors, and Discrete Cosine Transform (DCT) coefficients, which are embedded in the quantized DCT coefficients as the digital watermarks. The decoder performs the accurate error detection through the watermark extraction. Simulation results demonstrate that the error detection ability of the proposed approach can be significantly enhanced, and that digital watermark embedding incurs little degradation to the picture quality.

• Journal of information and communication convergence engineering
• /
• v.9 no.2
• /
• pp.183-186
• /
• 2011

In this work, we consider imperfectness of feedback channels in the adaptive transmission scheme which was previously studied with an assumption of error-free feedback channels. New method of mapping the modulation index into the feedback channel symbols and quantifying feedback error over fading channels are proposed. The presented method and results are expected to offer valuable tools for the system designer to efficiently implement adaptive diversity schemes to compensate for the performance degradation due to feedback error.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.5
• /
• pp.465-472
• /
• 2013

This paper presents a low-complexity triple-error-correcting parallel Bose-Chaudhuri-Hocquenghem (BCH) decoder architecture and its efficient design techniques. A novel modified step-by-step (m-SBS) decoding algorithm, which significantly reduces computational complexity, is proposed for the parallel BCH decoder. In addition, a determinant calculator and a error locator are proposed to reduce hardware complexity. Specifically, a sharing syndrome factor calculator and a self-error detection scheme are proposed. The multi-channel multi-parallel BCH decoder using the proposed m-SBS algorithm and design techniques have considerably less hardware complexity and latency than those using a conventional algorithms. For a 16-channel 4-parallel (1020, 990) BCH decoder over GF($2^{12}$), the proposed design can lead to a reduction in complexity of at least 23 % compared to conventional architecttures.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.3
• /
• pp.50-55
• /
• 2001

We review error resilience techniques for real-time video transport over unreliable networks. For error control on the source coding level, each decoder has to make provisions for error detection, resynchronization. and error concealment. and we review techniques suitable for that purpose. Further, techniques are discussed for intelligent processing of acknowledgment information by the coding control to adapt the source coder to the channel. We review and compare error tracking, error confinement. and reference picture selection techniques for channel-adaptive source coding. We review how feedback-based source codings are related with the precompressed video stored on a media server