By Topic

Designing LDPC codes using cyclic shifts

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

1 Author(s)
Okamura, T. ; Internet Syst. Res. Lab., NEC Corp., Kanagawa, Japan

This paper presents a method to construct LDPC codes by arranging cyclic shift matrices. These codes perform well at various rates for moderate code length. By substituting those cyclic shifts for their Kronecker products with small random permutations, the performance of long codes can be improved, while the structure facilitates hardware implementation.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003