Presentation 2012-07-20
Modified Euclidian RS Decoding Algorithms without Conditional Branch and Inversion
Keisuke SAITO, Masakatu MORII,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Sarwate et al. proposed modified Euclidean algorithms for decoding of Reed-Solomon (RS) codes. These decoding methods have no conditional branch for stopping the iteration in the algorithm. The 2t iterations, fixed and maximum repetition, can delete the terminal condition. However, the modified Euclidean algorithms have new another conditional branches in iteration, therefore the number of those does not decrease. In this paper, we propose new modified Euclidean algorithm which reduces the number of conditional branches.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) RS Code / Modified Euclidian Decoding Algorithms / Conditional Branch
Paper # IT2012-18
Date of Issue

Conference Information
Committee IT
Conference Date 2012/7/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Modified Euclidian RS Decoding Algorithms without Conditional Branch and Inversion
Sub Title (in English)
Keyword(1) RS Code
Keyword(2) Modified Euclidian Decoding Algorithms
Keyword(3) Conditional Branch
1st Author's Name Keisuke SAITO
1st Author's Affiliation Graduate School of Engineering, Kobe University()
2nd Author's Name Masakatu MORII
2nd Author's Affiliation Graduate School of Engineering, Kobe University
Date 2012-07-20
Paper # IT2012-18
Volume (vol) vol.112
Number (no) 124
Page pp.pp.-
#Pages 4
Date of Issue