By Topic

Efficient min-sum decoding of LDPC codes based on layer schedules

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
$31 $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

2 Author(s)
Chaobo Liu ; Dept. of Inf. Sci. & Technol., Hunan Univ., Changsha, China ; Xiaoyou Yu

Flooding schedule (FS) and shuffled schedule (SS) are the mainstream Strategy applied in LDPC iterative decoding; however, FS need lots of Hardware devices for storage and SS has low computing speed. In Deep Space communication (DSC), these shortcomings will influence performance and practicability seriously. This paper presented an improved decoding algorithm which grouping base on the variable nodes. The simulation results show that the improved decoding performance enhance 0.3-0.5dB comparing with FS in bit-error-rate (BER) of 10-7 and the decoding speed is k multiple of SS in ka wave band, k is the number of group.

Published in:

Information Science and Technology (ICIST), 2012 International Conference on

Date of Conference:

23-25 March 2012