By Topic

Reduced-Complexity Decoding Algorithm for LDPC Codes for Practical Circuit Implementation in Optical Communications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yoshikuni Miyata ; Information Technology R&D Center, Mitsubishi Electric Corporation, 5-1-1, Ofuna, Kamakura, Japan. Miyata.Yoshikuni@ak.MitsubishiElectric.co.jp ; Rui Sakai ; Wataru Matsumoto ; Hideo Yoshida
more authors

For superior, practical decoding of LDPC based FEC, a cyclic approximated delta-minimum algorithm is proposed. Simulation shows that 3-bit soft-decision decoding provides a required Q of 6.2 dB at 10-6 BER with only 16 iterations.

Published in:

Optical Fiber Communication and the National Fiber Optic Engineers Conference, 2007. OFC/NFOEC 2007. Conference on

Date of Conference:

25-29 March 2007