• Title/Summary/Keyword: euclid algorithm

Search Result 50, Processing Time 0.036 seconds

Deconvolution Based on the Reconstruction of Residue Polynomials (나머지 다정식의 재구성에 의한 디컨볼루션)

  • 유수현;김재구
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.6
    • /
    • pp.19-27
    • /
    • 1985
  • In most engineering problems the output of linear system could be expressed by a con-volution of finite input and impulse response. In this paper, the deconvolution algorithm based on the reconstruction of residue polynomials to get a convolution factor, impvlse response or system input, were considered. Two techniques, using a matrix and Euclid's algorithm were discussed. In the illustrated examples, the result showed high accuracy about 10-10 RMS error.

  • PDF

VLSI Design of Reed-Solomon Decoder over GF($2^8$) with Extreme Use of Resource Sharing (하드웨어 공유 극대화에 의한 GF($2^8$) Reed-Solomon Decoder의 VLSI설계)

  • 이주태;이승우;조중휘
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.3
    • /
    • pp.8-16
    • /
    • 1999
  • This paper describes a VLSI design of Reed-Solomon(RS) decoder using the modified Euclid algorithm, with the main theme focused on the $\textit{GF}(2^8)$. To get area-efficient design, a number of new architectures have been devised with maximal register and Euclidean ALU unit sharing. One ALU is shared to replace 18 ALUs which computes an error locator polynomial and an error evaluation polynomial. Also, 18 registers are shared to replace 24 registers which stores coefficients of those polynomials. The validity and efficiency of the proposed architecture have been verified by simulation and by FLEX$^TM$ FPGA implementation in hardware description language VHDL. The proposed Reed-Solomon decoder, which has the capability of decoding RS(208,192,17) and RS(182,172,11) for Digital Versatile Disc(DVD), has been designed by using O.6$\mu\textrm{m}$ CMOS TLM Compass$^TM$ technology library, which contains totally 17k gates with a core area of 2.299$\times$2.284 (5.25$\textrm{mm}^2$). The chip can run at 20MHz while the DVD requirement is 3.74MHz.

  • PDF

Design of a High Speed and Parallel Reed-Solomon Decoder Using a Systolic Array (시스톨릭 어레이를 이용한 고속 병렬처리 Reed-Solomon 복호기 설계)

  • 강진용;선우명훈
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.245-248
    • /
    • 2001
  • 본 논문에서는 연집 오류(burst error)에 우수한 정정 능력을 보이는 고속 RS(Reed-Solomon) 복호기를 제안한다. 제안된 RS 복호기는 RS(n, k, t); (37 < n ≤ 255, 21 < k ≤ 239, t = 8)의 사양을 지원하며 수정 유클리드 알고리즘(modified Euclid´s algorithm)을 이용한 시스톨릭 어레이(systolic array) 방식의 병렬처리 구조로 설계되었다. 고속 RS 복호기의 효율적인 VSLI 설계를 위하여 새로운 방식의 수정 유클리드 알고리즘 연간 회로를 제안한다. 제안된 수정 유클리드 알고리즘 회로는 2t + 1의 연산 지연 시간을 갖으며 기존 구조의 연산 지연 시간인 3t + 37에 비하여 t = 8 인 경우 약 72%의 연산 지연이 감소하였다. 제안된 구조를 VHDL을 이용하여 설계하였으며 SAMSUNG 0.5㎛(KG80) 라이브러리를 이용하여 논리 합성과 타이밍 검증을 수행하였다. 합성된 RS 복호기의 총 게이트 수는 약 77,000 개이며 최대 80MHz의 동작 속도를 나타내었다.

  • PDF

An Implementation of Addition.Multiplication and Inversion on GF($2^m$) by Computer (Computer에 의한 GF($2^m$) 상에서 가산, 승산 및 제산의 실행)

  • Yoo, In-Kweon;Kang, Sung-Su;Kim, Heung-Soo
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1195-1198
    • /
    • 1987
  • This paper develops algorithms of element generation, addition, multiplication and inversion based on GF($2^m$). Since these algorithms are implemented by general purpose computer, these are more efficient than the conventional algorithms(Table Lookup, Euclid's Algorithm) in each operation. It is also implied that they can be applied to not only the normally defined elements but the arbitrarily defined ones for constructing multi-valued logic function.

  • PDF

VLSI Design and Implementation of Inversion and Division over GF($2^m$) for Elliptic Curve Cryptographic System (타원 곡선 암호 프로세서용 GF($2^m$) Inversion, Division 회로 설계 및 구현)

  • 현주대;최병윤
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.1027-1030
    • /
    • 2003
  • In this paper, we designed GF(2$^{m}$ ) inversion and division processor for Elliptic Curve Cryptographic system. The processor that has 191 by m value designed using Modified Euclid Algorithm. The processor is designed using 0.35 ${\mu}{\textrm}{m}$ CMOS technology and consists of about 14,000 gates and consumes 370 mW. From timing simulation results, it is verified that the processor can operate under 367 Mhz clock frequency due to 2.72 ns critical path delay. Therefore, the designed processor can be applied to Elliptic Curve Cryptographic system.

  • PDF

A Continuous Versatile Reed-Solomon Decoder with Variable Code Rate and Block Length (가변 부호율과 블록 길이를 갖는 연속 가변형 리드솔로몬 복호기)

  • 공민한;송문규
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.549-552
    • /
    • 2003
  • In this paper, an efficient architecture of a versatile Reed-Solomon (RS) decoder is designed, where the message length k as well as the block length n can be variable. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm(MEA). A new architecture for the MEA is designed for variable values of error correcting capability t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive and the overclocking technique. The decoder can decode a codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications due to its versatility. A versatile RS decoder over GF(2$^{8}$ ) having the error-correcting capability of up to 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

  • PDF

Short Term Load Forecasting Algorithm for Lunar New Year's Day

  • Song, Kyung-Bin;Park, Jeong-Do;Park, Rae-Jun
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.591-598
    • /
    • 2018
  • Short term load forecasts complexly affected by socioeconomic factors and weather variables have non-linear characteristics. Thus far, researchers have improved load forecast technologies through diverse techniques such as artificial neural networks, fuzzy theories, and statistical methods in order to enhance the accuracy of load forecasts. Short term load forecast errors for special days are relatively much higher than that of weekdays. The errors are mainly caused by the irregularity of social activities and insufficient similar past data required for constructing load forecast models. In this study, the load characteristics of Lunar New Year's Day holidays well known for the highest error occurrence holiday period are analyzed to propose a load forecast technique for Lunar New Year's Day holidays. To solve the insufficient input data problem, the similarity of the load patterns of past Lunar New Year's Day holidays having similar patterns was judged by Euclid distance. Lunar New Year's Day holidays periods for 2011-2012 were forecasted by the proposed method which shows that the proposed algorithm yields better results than the comprehensive analysis method or the knowledge-based method.

Prerequisite Research for the Development of an End-to-End System for Automatic Tooth Segmentation: A Deep Learning-Based Reference Point Setting Algorithm (자동 치아 분할용 종단 간 시스템 개발을 위한 선결 연구: 딥러닝 기반 기준점 설정 알고리즘)

  • Kyungdeok Seo;Sena Lee;Yongkyu Jin;Sejung Yang
    • Journal of Biomedical Engineering Research
    • /
    • v.44 no.5
    • /
    • pp.346-353
    • /
    • 2023
  • In this paper, we propose an innovative approach that leverages deep learning to find optimal reference points for achieving precise tooth segmentation in three-dimensional tooth point cloud data. A dataset consisting of 350 aligned maxillary and mandibular cloud data was used as input, and both end coordinates of individual teeth were used as correct answers. A two-dimensional image was created by projecting the rendered point cloud data along the Z-axis, where an image of individual teeth was created using an object detection algorithm. The proposed algorithm is designed by adding various modules to the Unet model that allow effective learning of a narrow range, and detects both end points of the tooth using the generated tooth image. In the evaluation using DSC, Euclid distance, and MAE as indicators, we achieved superior performance compared to other Unet-based models. In future research, we will develop an algorithm to find the reference point of the point cloud by back-projecting the reference point detected in the image in three dimensions, and based on this, we will develop an algorithm to divide the teeth individually in the point cloud through image processing techniques.

The Design and Implementation of Outer Encoder/Decoder for Terrestrial DMB (지상파 DMB용 Outer 인코더/리코더의 설계 및 구현)

  • Won, Ji-Yeon; Lee, Jae-Heung;Kim, Gun
    • The KIPS Transactions:PartA
    • /
    • v.11A no.1
    • /
    • pp.81-88
    • /
    • 2004
  • In this paper, we designed the outer encoder/decoder for the terrestrial DMB that is an advanced digital broadcasting standard, implemented, and verified by using ALTERA FPGA. In the encoder part, it was created the parity bytes (16 bytes) from the input packet (188by1e) of MPEG-2 TS and the encoded data was distributed output by the convolutional interleaver for Preventing burst errors. In the decoder part, It was proposed the algorithm that detects synchronous character suitable to DMB in transmitted data from the encoder. The circuit complexity in RS decoder was reduced by applying a modified Euclid's algorithm. This system has a capability to correct error of the maximum 8 bytes in a packet. After the outer encoder/decoder algorithm was verified by using C language, described in VHDL and implemented in the ALTERA FPGA chips.

A High-Speed Hardware Design of IDEA Cipher Algorithm by Applying of Fermat′s Theorem (Fermat의 소정리를 응용한 IDEA 암호 알고리즘의 고속 하드웨어 설계)

  • Choi, Young-Min;Kwon, Yong-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.6
    • /
    • pp.696-702
    • /
    • 2001
  • In this paper, we design IDEA cipher algorithm which is cryptographically superior to DES. To improve the encryption throughput, we propose an efficient design methodology for high-speed implementation of multiplicative inverse modulo $2^{15}$+1 which requires the most computing powers in IDEA. The efficient hardware architecture for the multiplicative inverse in derived from applying of Fermat's Theorem. The computing powers for multiplicative inverse in our proposal is a decrease 50% compared with the existing method based on Extended Euclid Algorithm. We implement IDEA by applying a single iterative round method and our proposal for multiplicative inverse. With a system clock frequency 20MGz, the designed hardware permits a data conversion rate of more than 116 Mbit/s. This result show that the designed device operates about 2 times than the result of the paper by H. Bonnenberg et al. From a speed point of view, out proposal for multiplicative inverse is proved to be efficient.

  • PDF