Paper
21 September 2006 A low-complexity Reed-Solomon decoder using new key equation solver
Author Affiliations +
Proceedings Volume 6353, Optical Transmission, Switching, and Subsystems IV; 635335 (2006) https://doi.org/10.1117/12.687009
Event: Asia-Pacific Optical Communications, 2006, Gwangju, South Korea
Abstract
This paper presents a low-complexity parallel Reed-Solomon (RS) (255,239) decoder architecture using a novel pipelined variable stages recursive Modified Euclidean (ME) algorithm for optical communication. The pipelined four-parallel syndrome generator is proposed. The time multiplexing and resource sharing schemes are used in the novel recursive ME algorithm to reduce the logic gate count. The new key equation solver can be shared by two decoder macro. A new Chien search cell which doesn't need initialization is proposed in the paper. The proposed decoder can be used for 2.5Gb/s data rates device. The decoder is implemented in Altera' Stratixll device. The resource utilization is reduced about 40% comparing to the conventional method.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jun Xie, Songxin Yuan, Xiaodong Tu, and Chongfu Zhang "A low-complexity Reed-Solomon decoder using new key equation solver", Proc. SPIE 6353, Optical Transmission, Switching, and Subsystems IV, 635335 (21 September 2006); https://doi.org/10.1117/12.687009
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Remote sensing

Clocks

Forward error correction

Logic devices

Optical communications

Field programmable gate arrays

Networks

Back to Top