By Topic

A Systematic Optimized Comparison Algorithm for LDPC Decoder

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

3 Author(s)
Jui-Hui Hung ; Dept. of Electron. Eng., Nat. Chiao Tung Univ., Hsinchu ; Jui-Hung Hung ; Sau-Gee Chen

This paper proposes a novel systematic optimized comparison algorithm for LDPC codes with arbitrary code lengths. Based on the presented algorithm, we also design a corresponding decoder architecture which has a short comparison delay time of lceillog2(n - 1)rceil and a very low comparator complexity of ntimeslceillog2(n - 1)rceil, where n is the input number to CNU. Besides, the proposed design is general, systematic and flexible, which can be applied to arbitrary input number of a CNU. The designed CNU is favorable to the existing CNU designs which are non-systematically designed with either longer critical path delays or higher comparator counts than the proposed designs. The proposed design is particularly good for long code length cases, when it is impractical to do customized optimized designs by hand, due to high design complexity.

Published in:

Advanced Communication Technology, 2008. ICACT 2008. 10th International Conference on  (Volume:3 )

Date of Conference:

17-20 Feb. 2008