• Title/Summary/Keyword: correcting error

Search Result 460, Processing Time 0.03 seconds

Design of Degree-Computationless Modified Euclidean Algorithm using Polynomial Expression (다항식 표현을 이용한 DCME 알고리즘 설계)

  • Kang, Sung-Jin;Kim, Nam-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.10A
    • /
    • pp.809-815
    • /
    • 2011
  • In this paper, we have proposed and implemented a novel architecture which can be used to effectively design the modified Euclidean (ME) algorithm for key equation solver (KES) block in high-speed Reed-Solomon (RS) decoder. With polynomial expressions of newly-defined state variables for controlling each processing element (PE), the proposed architecture has simple input/output signals and requires less hardware complexity because no degree computation circuits are needed. In addition, since each PE circuit is independent of the error correcting capability t of RS codes, it has the advantage of linearly increase of the hardware complexity of KES block as t increases. For comparisons, KES block for RS(255,239,8) decoder is implemented using Verilog HDL and synthesized with 0.13um CMOS cell library. From the results, we can see that the proposed architecture can be used for a high-speed RS decoder with less gate count.

Classification and Generator Polynomial Estimation Method for BCH Codes (BCH 부호 식별 및 생성 파라미터 추정 기법)

  • Lee, Hyun;Park, Cheol-Sun;Lee, Jae-Hwan;Song, Young-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.2
    • /
    • pp.156-163
    • /
    • 2013
  • The use of an error-correcting code is essential in communication systems where the channel is noisy. When channel coding parameters are unknown at a receiver side, decoding becomes difficult. To perform decoding without the channel coding information, we should estimate the parameters. In this paper, we introduce a method to reconstruct the generator polynomial of BCH(Bose-Chaudhuri-Hocquenghem) codes based on the idea that the generator polynomial is compose of minimal polynomials and BCH code is cyclic code. We present a probability compensation method to improve the reconstruction performance. This is based on the concept that a random data pattern can also be divisible by a minimal polynomial of the generator polynomial. And we confirm the performance improvement through an intensive computer simulation.

Performance Analysis of Turbo Codes for LEO Satellite Communication Channel (저궤도 위성통신 채널에서 터보부호의 성능분석)

  • 강군석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9A
    • /
    • pp.1313-1321
    • /
    • 2000
  • In recent years LEO(Low Earth Orbit) satellite communication systems have gained a lot of interest as high speed multimedia services by satellite are about to be provided. It is mandatory to use very efficient ECC(Error Correcting Code) to support high speed multimedia services over LEO satellite channel. Turbo codes developed by Berrou et al. in 1993 have been actively researched since it can achieve a performance close to the Shannon limit. In this paper, a LEO satellite channel model is adopted and the fading characteristics of LEO satellite channel are analyzed for the change of elevation angle in various propagation environments. The performance of turbo code is analyzed and compared to that of conventional convolutional code using the satellite channel model. In the simulation results using the Globalstar orbit constellations, performance of turbo codes shows 1.0~2.0dB coding gain compared to that of convolutional codes over all elevation angle and propagation environment ranges we have investigated. The performance difference resulting from the change of elevation angle in various propagation environments and the performance of different ECC are analyzed in detail, so that the results can be applied to choose an appropriate ECC scheme for various system environment.

  • PDF

T1-Based MR Temperature Monitoring with RF Field Change Correction at 7.0T

  • Kim, Jong-Min;Lee, Chulhyun;Hong, Seong-Dae;Kim, Jeong-Hee;Sun, Kyung;Oh, Chang-Hyun
    • Investigative Magnetic Resonance Imaging
    • /
    • v.22 no.4
    • /
    • pp.218-228
    • /
    • 2018
  • Purpose: The objective of this study is to determine the effect of physical changes on MR temperature imaging at 7.0T and to examine proton-resonance-frequency related changes of MR phase images and T1 related changes of MR magnitude images, which are obtained for MR thermometry at various magnetic field strengths. Materials and Methods: An MR-compatible capacitive-coupled radio-frequency hyperthermia system was implemented for heating a phantom and swine muscle tissue, which can be used for both 7.0T and 3.0T MRI. To determine the effect of flip angle correction on T1-based MR thermometry, proton resonance frequency, apparent T1, actual flip angle, and T1 images were obtained. For this purpose, three types of imaging sequences are used, namely, T1-weighted fast field echo with variable flip angle method, dual repetition time method, and variable flip angle method with radio-frequency field nonuniformity correction. Results: Signal-to-noise ratio of the proton resonance frequency shift-based temperature images obtained at 7.0T was five-fold higher than that at 3.0T. The T1 value increases with increasing temperature at both 3.0T and 7.0T. However, temperature measurement using apparent T1-based MR thermometry results in bias and error because B1 varies with temperature. After correcting for the effect of B1 changes, our experimental results confirmed that the calculated T1 increases with increasing temperature both at 3.0T and 7.0T. Conclusion: This study suggests that the temperature-induced flip angle variations need to be considered for accurate temperature measurements in T1-based MR thermometry.

Higher-Order Masking Scheme against DPA Attack in Practice: McEliece Cryptosystem Based on QD-MDPC Code

  • Han, Mu;Wang, Yunwen;Ma, Shidian;Wan, Ailan;Liu, Shuai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.1100-1123
    • /
    • 2019
  • A code-based cryptosystem can resist quantum-computing attacks. However, an original system based on the Goppa code has a large key size, which makes it unpractical in embedded devices with limited sources. Many special error-correcting codes have recently been developed to reduce the key size, and yet these systems are easily broken through side channel attacks, particularly differential power analysis (DPA) attacks, when they are applied to hardware devices. To address this problem, a higher-order masking scheme for a McEliece cryptosystem based on the quasi-dyadic moderate density parity check (QD-MDPC) code has been proposed. The proposed scheme has a small key size and is able to resist DPA attacks. In this paper, a novel McEliece cryptosystem based on the QD-MDPC code is demonstrated. The key size of this novel cryptosystem is reduced by 78 times, which meets the requirements of embedded devices. Further, based on the novel cryptosystem, a higher-order masking scheme was developed by constructing an extension Ishai-Sahai-Wagne (ISW) masking scheme. The authenticity and integrity analysis verify that the proposed scheme has higher security than conventional approaches. Finally, a side channel attack experiment was also conducted to verify that the novel masking system is able to defend against high-order DPA attacks on hardware devices. Based on the experimental validation, it can be concluded that the proposed higher-order masking scheme can be applied as an advanced protection solution for devices with limited resources.

On algorithm for finding primitive polynomials over GF(q) (GF(q)상의 원시다항식 생성에 관한 연구)

  • 최희봉;원동호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.1
    • /
    • pp.35-42
    • /
    • 2001
  • The primitive polynomial on GF(q) is used in the area of the scrambler, the error correcting code and decode, the random generator and the cipher, etc. The algorithm that generates efficiently the primitive polynomial on GF(q) was proposed by A.D. Porto. The algorithm is a method that generates the sequence of the primitive polynomial by repeating to find another primitive polynomial with a known primitive polynomial. In this paper, we propose the algorithm that is improved in the A.D. Porto algorithm. The running rime of the A.D. Porto a1gorithm is O($\textrm{km}^2$), the running time of the improved algorithm is 0(m(m+k)). Here, k is gcd(k, $q^m$-1). When we find the primitive polynomial with m odor, it is efficient that we use the improved algorithm in the condition k, m>>1.

The Optimal Normal Elements for Massey-Omura Multiplier (Massey-Omura 승산기를 위한 최적 정규원소)

  • 김창규
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.3
    • /
    • pp.41-48
    • /
    • 2004
  • Finite field multiplication and division are important arithmetic operation in error-correcting codes and cryptosystems. The elements of the finite field GF($2^m$) are represented by bases with a primitive polynomial of degree m over GF(2). We can be easily realized for multiplication or computing multiplicative inverse in GF($2^m$) based on a normal basis representation. The number of product terms of logic function determines a complexity of the Messay-Omura multiplier. A normal basis exists for every finite field. It is not easy to find the optimal normal element for a given primitive polynomial. In this paper, the generating method of normal basis is investigated. The normal bases whose product terms are less than other bases for multiplication in GF($2^m$) are found. For each primitive polynomial, a list of normal elements and number of product terms are presented.

A Study on the Wrist Pulse Six Positions Correlation in the Maiyaojingweilun Chapter of the Huangdineijing (『소문(素問)·맥요정미론(脈要精微論)』의 촌구(寸口) 육부정위(六部定位)에 대한 고찰)

  • Jang, Woochang;Nan, Jie
    • Journal of Korean Medical classics
    • /
    • v.34 no.3
    • /
    • pp.101-123
    • /
    • 2021
  • Objectives : To examine the six positions correlation[六部定位] principle that is the basis of the wrist pulse diagnosis in the Neijing. Methods : The basis for argument was established by correcting an interpretation error of the theory of chi (尺) skin diagnosis. In order to accomplish this, the annotations of Yang Shangshan and Wangbing were investigated first, after which the specific meaning and methodology of the chi diagnostic method as written in many chapters of the Neijing were examined. The evidence and reasoning for the six positions correlation[六部定位] was looked into, in relation to Wangbing's annotation of the chapter, Maiyaojingweilun. The theoretical basis of the six positions correlation was searched throughout the entire Neijing, based on the correlation between Liuhe and the six positions, the five elements inter-supporting theory embedded in the six positions correlation as a diagnosis model that integrates zhangfu and meridians/channels, and the meaning of the spacial concepts used when describing the tactile technique within the chapter. Lastly, contents related to the five zhang channels within the Neijing were reviewed, to determine whether the six positions correlation was applied in wrist pulse taking Results & Conclusions : Some interpretations of the verse on matching the positions in the Maiyaojingweilun chapter of the Neijing are erroneous, while the argument that the three positions[cun-guan-chi] cannot be found in the Neijing is false as well. The wrist pulse taking in the Neijing is precisely based on the three positions correlation that divides the cun-guan-chi positions into three, and the correlation verse in the Maiyaojingweilun chapter clearly suggests the principle of matching the zhangfu and meridian/channels to the six positions of the cun-guan-chi of both left and right.

Design and Implementation of Smart Self-Learning Aid: Micro Dot Pattern Recognition based Information Embedding Solution (스마트 학습지: 미세 격자 패턴 인식 기반의 지능형 학습 도우미 시스템의 설계와 구현)

  • Shim, Jae-Youen;Kim, Seong-Whan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.346-349
    • /
    • 2011
  • In this paper, we design a perceptually invisible dot pattern layout and its recognition scheme, and we apply the recognition scheme into a smart self learning aid for interactive learning aid. To increase maximum information capacity and also increase robustness to the noises, we design a ECC (error correcting code) based dot pattern with directional vector indicator. To make a smart self-learning aid, we embed the micro dot pattern (20 information bit + 15 ECC bits + 9 layout information bit) using K ink (CMYK) and extract the dot pattern using IR (infrared) LED and IR filter based camera, which is embedded in the smart pen. The reason we use K ink is that K ink is a carbon based ink in nature, and carbon is easily recognized with IR even without light. After acquiring IR camera images for the dot patterns, we perform layout adjustment using the 9 layout information bit, and extract 20 information bits from 35 data bits which is composed of 20 information bits and 15 ECC bits. To embed and extract information bits, we use topology based dot pattern recognition scheme which is robust to geometric distortion which is very usual in camera based recognition scheme. Topology based pattern recognition traces next information bit symbols using topological distance measurement from the pivot information bit. We implemented and experimented with sample patterns, and it shows that we can achieve almost 99% recognition for our embedding patterns.

Development of Rice Yield Prediction System of Head-Feed Type Combine Harvester (자탈형 콤바인의 실시간 벼 수확량 예측 시스템 개발)

  • Sang Hee Lee;So Young Shin;Deok Gyu Choi;Won-Kyung Kim;Seok Pyo Moon;Chang Uk Cheon;Seok Ho Park;Youn Koo Kang;Sung Hyuk Jang
    • Journal of Drive and Control
    • /
    • v.21 no.2
    • /
    • pp.36-43
    • /
    • 2024
  • The yield is basic and necessary information in precision agriculture that reduces input resources and enhances productivity. Yield information is important because it can be used to set up farming plans and evaluate farming results. Yield monitoring systems are commercialized in the United States and Japan but not in Korea. Therefore, such a system must be developed. This study was conducted to develop a yield monitoring system that improved performance by correcting a previously developed flow sensor using a grain tank-weighing system. An impact-plated type flow sensor was installed in a grain tank where grains are placed, and grain tank-weighing sensors were installed under the grain tank to estimate the weight of the grain inside the tank. The grain flow rate and grain weight prediction models showed high correlations, with coefficient of determinations (R2) of 0.9979 and 0.9991, respectively. A main controller of the yield monitoring system that calculated the real-time yield using a sensor output value was also developed and installed in a combine harvester. Field tests of the combine harvester yield monitoring system were conducted in a rice paddy field. The developed yield monitoring system showed high accuracy with an error of 0.13%. Therefore, the newly developed yield monitoring system can be used to predict grain weight with high accuracy.