• Title/Summary/Keyword: 유클리드 기하

Search Result 95, Processing Time 0.034 seconds

A Design of Modified Euclidean Algorithm for RS(255,239) Decoder (수정된 유클리드 알고리즘을 이용한 RS(255,239) 복호기의 설계)

  • Son, Young-Soo;Kang, Sung-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.981-984
    • /
    • 2009
  • In this paper, We design RS(255,239) decoder with modified Euclidean algorithm, which show polynomic coefficient state machine instead of calculating coefficients of modified Euclidean algorithm. This design can reduce complexity and implement High-speed Read Solomon decoder. Additionally, we have synthesized with Xilinx XC4VLX60. From synthesis, it can operate at clock frequency of 77.4MHz, and gate count is 20,710.

  • PDF

Hardware design of Reed-solomon decoder for DMB mobile terminals (DMB 휴대용 단말기를 위한 Reed-Solomon 복호기의 설계)

  • Ryu Tae-Gyu;Jeong Yong-Jin
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.4 s.346
    • /
    • pp.38-48
    • /
    • 2006
  • In this paper, we developed a hardware architecture of Reed-Solomon RS(255,239) decoder for the DMB mobile terminals. The DMB provides multimedia broadcasting service to mobile terminals, hence it should have small dimension for low power and short decoding delay for real-time processing. We modified Euclid algorithm to apply it to the key equation solving which is the most complicated part of the RS decoding. We also designed a small finite field divider to avoid the use of large Inverse-ROM table, and it consumed 17 clocks. After synthesis with Synopsis on Samsung STD130 $0.18{\mu}m$ Standard Cell library, the Euclid block had 30,228 gates and consumed 288 clocks, which gave the 25% reduced area compared to other existing designs. The size of the entire RS decoder was about 45,000 gates.

유클리드 기하학

  • 김홍종
    • Communications of the Korean Mathematical Society
    • /
    • v.15 no.1
    • /
    • pp.111-121
    • /
    • 2000
  • 유클리드 공간의 정의와 평행이동 및 벡터의 성질을 현대적인 관점에서 살펴본다. 또 이를 이용하여 아핀 공간을 정의한다.

  • PDF

Mathematical Connections Between Classical Euclidean Geometry and Vector Geometry from the Viewpoint of Teacher's Subject-Matter Knowledge (교과지식으로서의 유클리드 기하와 벡터기하의 연결성)

  • Lee, Ji-Hyun;Hong, Gap-Ju
    • School Mathematics
    • /
    • v.10 no.4
    • /
    • pp.573-581
    • /
    • 2008
  • School geometry takes various approaches such as deductive, analytic, and vector methods. Especially, the mathematical connections between these methods are closely related to the mathematical connections between geometry and algebra. This article analysed the geometric consequences of vector algebra from the viewpoint of teacher's subject-matter knowledge and investigated the connections between the geometric proof and the algebraic proof with vector and inner product.

  • PDF

Proof of the Pythagorean Theorem from the Viewpoint of the Mathematical History (수학사적 관점에서 본 피타고라스 정리의 증명)

  • Choi, Young-Gi;Lee, Ji-Hyun
    • School Mathematics
    • /
    • v.9 no.4
    • /
    • pp.523-533
    • /
    • 2007
  • This article focused the meaning of Pythagoras' and Euclid's proof about the Pythagorean theorem in a historical and mathematical perspective. Pythagoras' proof using similarity is based on the arithmetic assumption about commensurability. However, Euclid proved the Pythagorean theorem again only using the concept of dissection-rearrangement that is purely geometric so that it does not need commensurability. Pythagoras' and Euclid's different approaches to geometry have to do with Birkhoff's axiom system and Hilbert's axiom system in the school geometry Birkhoff proposed the new axioms for plane geometry accepting real number that is strictly defined. Thus Birkhoff's metrical approach can be defined as a Pythagorean approach that developed geometry based on number. On the other hand, Hilbert succeeded Euclid who had pursued pure geometry that did not depend on number. The difference between the proof using similarity and dissection-rearrangement is related to the unsolved problem in the geometry curriculum that is conflict of Euclid's conventional synthetical approach and modern mathematical approach to geometry.

  • PDF

New Low-Power and Small-Area Reed-Solomon Decoder (새로운 저전력 및 저면적 리드-솔로몬 복호기)

  • Baek, Jae-Hyun;SunWoo, Myung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.6
    • /
    • pp.96-103
    • /
    • 2008
  • This paper proposes a new low-power and small-area Reed-Solomon decoder. The proposed Reed-Solomon decoder using a novel simplified form of the modified Euclid's algorithm can support low-hardware complexity and low-Power consumption for Reed-Solomon decoding. The simplified modified Euclid's algorithm uses new initial conditions and polynomial computations to reduce hardware complexity, and thus, the implemented architecture consisting of 3r basic cells has the lowest hardware complexity compared with existing modified Euclid's and Berlekamp-Massey architectures. The Reed-Solomon decoder has been synthesized using the $0.18{\mu}m$ Samsung standard cell library and operates at 370MHz and its data rate supports up to 2.9Gbps. For the (255, 239, 8) RS code, the gate counts of the simplified modified Euclid's architecture and the whole decoder excluding FIFO memory are only 20,166 and 40,136, respectively. Therefore, the proposed decoder can reduce the total gate count at least 5% compared with the conventional DCME decoder.

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

Research on Pre-service Teacher Education Through Understanding of Conic Sections in Non-Endidean Geometry (비유클리드 기하학에서 이차곡선의 이해를 통한 예비교사교육)

  • Jieun Kang;Daehwan Kim
    • Journal of Science Education
    • /
    • v.47 no.3
    • /
    • pp.263-272
    • /
    • 2023
  • We consider how a pre-service teacher can understand and utilize various concepts of Euclidean geometry by learning conic sections using mathematical definitions in non-Euclidean geometry. In a third-grade class of D University, we used mathematical definitions to demonstrate that learning conic sections in non-Euclidean space, such as taxicab geometry and Minkowski distance space, can aid pre-service teachers by enhancing their ability to acquire and accept new geometric concepts. As a result, learning conic sections using mathematical definitions in taxicab geometry and Minkowski distance space is expected to contribute to enhancing the education of pre-service teachers for Euclidean geometry expertise by fostering creative and flexible thinking.

On the plane geometry using taxicab distance function (택시거리함수를 이용한 평면기하에 관한 연구)

  • Kwak, Kyung-Min;Baik, Seung-Min;Choi, Woo-Seok;Choi, Jun-Bum;Ko, Il-Seog;Kim, Byung-Hak
    • Communications of Mathematical Education
    • /
    • v.24 no.3
    • /
    • pp.659-689
    • /
    • 2010
  • Taxicab distance function is a practical distance notion which gives us information of real world pathway distance that really taxi can go through. As one of the non-Euclidean geometry, this study of an ideal city with all roads running horizontal or vertical, was introduced by the Russian Mathematician H. Minkowski and synthetically reported by the E. F. Kraus in 1986. After that, there were many reports and papers on this topic and still being researched. At this point of view, our research about taxicab geometry provides its differences from Euclidean plane geometry, and considers about several theorems on plane geometry using the taxicab distance function.

Hardware Design of Finite Field Divider Using Modified Extended Euclidian Algorithm (개선된 확장 유클리드 알고리듬을 이용한 유한체 나눗셈 연산기의 하드웨어 설계)

  • Lee K.H.;Kang M.S.
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.64-66
    • /
    • 2005
  • 본 논문에서는 GF($2^m$) 상에서 나눗셈 연산을 위한 고속 알고리듬을 제안하고, 제안한 알고리듬을 기본으로 한 나눗셈 연산기의 하드웨어 설계 및 구현에 관하여 기술한다. 나눗셈을 위한 모듈러 연산은 개선된 이진 확장 유클리드 알고리듬 (Binary Extended Euclidian algorithm) 을 기본으로 하고 있다 성능비교 결과로부터 제안한 방법은 기존 방법에 비해 지연시간이 약 $26.7\%$ 정도 개선됨을 확인하였다.

  • PDF