A low-complexity Reed-Solomon decoder for PON

Author

Xie, Jun ; Tu, Xiaodong

Author_Institution

Sch. of Commun. & Inf. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu

fYear

2008

fDate

25-27 May 2008

Firstpage

599

Lastpage

601

Abstract

In this paper, a low-complexity Reed-Solomon (RS) (255,239) decoder architecture using a novel half folding Modified Euclidean (ME) algorithm is proposed for PON system. A new key equation solver using ME algorithm is proposed. The operation cycles is reduced to less than 127 by using the zero leading coefficients detector for polynomial. The time multiplexing and resource sharing schemes can be used in the recursive ME algorithm to reduce the logic gate count. The new key equation solver can be shared by two decoder macro. The resource utilization is reduced about 35% comparing to the conventional method.

Keywords

Reed-Solomon codes; computational complexity; decoding; optical fibre networks; PON system; logic gate count; low-complexity Reed-Solomon decoder; modified euclidean algorithm; passive optical networks; resource sharing schemes; resource utilization; time multiplexing; zero leading coefficient detector; Computer architecture; Detectors; Equations; Forward error correction; Hardware; Iterative decoding; Passive optical networks; Polynomials; Reed-Solomon codes; Shift registers;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Circuits and Systems, 2008. ICCCAS 2008. International Conference on

Conference_Location

Fujian

Print_ISBN

978-1-4244-2063-6

Electronic_ISBN

978-1-4244-2064-3

Type

conf

DOI

10.1109/ICCCAS.2008.4657844

Filename

4657844