Pipelined Recursive Modified Euclidean Algorithm for RS Decoder

Author

Shirwadkar, Mansi C. ; Ghodeswar, U.S.

Author_Institution

Y.C. Coll. of Eng., Nagpur, India

fYear

2010

fDate

19-21 Nov. 2010

Firstpage

787

Lastpage

790

Abstract

This paper implements pipelined recursive modified Euclidean (PrME) algorithm which can be used for very high-speed optical communications. The RS decoder features a low-complexity key equation solver using a PrME algorithm block. Pipelining and parallelizing allow the inputs to be received at very high fiber optic rates, and outputs to be delivered at correspondingly high rates with minimum delay.

Keywords

Reed-Solomon codes; forward error correction; geometry; optical communication; RS decoder; Reed-Solomon coding; forward error correction; low-complexity key equation solver; optical communications; pipelined recursive modified Euclidean algorithm; Forward error correction (FEC); Reed–Solomon (RS) ) coding; high speed; low complexity; modified Euclidean algorithm; optical communications; pipelined; recursive;

fLanguage

English

Publisher

ieee

Conference_Titel

Emerging Trends in Engineering and Technology (ICETET), 2010 3rd International Conference on

Conference_Location

Goa

ISSN

2157-0477

Print_ISBN

978-1-4244-8481-2

Electronic_ISBN

2157-0477

Type

conf

DOI

10.1109/ICETET.2010.39

Filename

5698434

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2296629