2010 International Conference on Computational Intelligence and Software Engineering 2010
DOI: 10.1109/wicom.2010.5600886
|View full text |Cite
|
Sign up to set email alerts
|

FPGA Implementation of a Reed-Solomon CODEC for OTN G.709 Standard with Reduced Decoder Area

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2011
2011
2017
2017

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…(13) as 1116.9kHz. The error coding mechanism advantage is the introduction of the redundancy to the transmitted data for correcting the errors in the receiver path for further processing [9]. Reed Solomon (R-S) code are one of the error correcting codes belong to the family of non-binary cyclic error correcting codes and are employed for burst error correction.…”
Section: Concept Of Bit Error Rate (Ber)mentioning
confidence: 99%
“…(13) as 1116.9kHz. The error coding mechanism advantage is the introduction of the redundancy to the transmitted data for correcting the errors in the receiver path for further processing [9]. Reed Solomon (R-S) code are one of the error correcting codes belong to the family of non-binary cyclic error correcting codes and are employed for burst error correction.…”
Section: Concept Of Bit Error Rate (Ber)mentioning
confidence: 99%
“…These days, communication system is often implemented on FPGA for lower development costs and its re-configurability [13]. RS decoders for several communication systems have been implemented on FPGA [14], [15]. However because FPGA is vulnerable to soft error, soft error tolerant system design is important for communication systems on FPGA [16].…”
Section: Related Workmentioning
confidence: 99%
“…The GF is implemented according to a primitive polynomial. The polynomial must be primitive, so that all of its roots are primitive elements [9].…”
Section: Rs Code and Pgz Reviewmentioning
confidence: 99%
“…(2) [9], so the roots of the generator polynomial must also be the roots of the codeword. The polynomial p(x) is the remainder of the division between x n−k m(x) and g(x).…”
Section: A Encodingmentioning
confidence: 99%