New Enhanced Degree Computationless Modified Euclid’s Algorithm and its Architecture for Reed-Solomon decoders 


Vol. 32,  No. 8, pp. 820-826, Aug.  2007


PDF
  Abstract

This paper proposes an enhanced degree computationless modified Euclid's (E-DCME) algorithm and its architecture for Reed-Solomon decoders. The proposed E-DCME algorithm has shorter critical path delay that is Tmult + Tadd + Tmux compared with the existing modified Euclid's algorithm and the degree computationless modified Euclid’s (DCME) algorithm since it uses new initial conditions. The proposed E-DCME architecture employing a systolic array requires only 2t - 1 clock cycles to solve the key equation without initial latency. In addition, the E-DCME architecture consisting of 3t basic cells has regularity and scalability since it uses only one processing element. The E-DCME architecture using the 0.18㎛ Samsung standard cell library consists of 18,000 gates.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Baek and Myung-hoon-Sunwoo, "New Enhanced Degree Computationless Modified Euclid’s Algorithm and its Architecture for Reed-Solomon decoders," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 8, pp. 820-826, 2007. DOI: .

[ACM Style]

Jae-hyun Baek and Myung-hoon-Sunwoo. 2007. New Enhanced Degree Computationless Modified Euclid’s Algorithm and its Architecture for Reed-Solomon decoders. The Journal of Korean Institute of Communications and Information Sciences, 32, 8, (2007), 820-826. DOI: .

[KICS Style]

Jae-hyun Baek and Myung-hoon-Sunwoo, "New Enhanced Degree Computationless Modified Euclid’s Algorithm and its Architecture for Reed-Solomon decoders," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 8, pp. 820-826, 8. 2007.