By Topic

Short-cycle-free interleaver design for increasing minimum squared Euclidean distance

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

4 Author(s)
S. L. Howard ; Dept. of Electr. Eng., Alberta Univ., Edmonton, Alta., Canada ; S. S. Zeinoddin ; C. Schlegel ; V. C. Gaudet

This paper introduces interleaver constraints to eliminate low squared Euclidean distance (SED) error events for a specific serially concatenated code (SCC). These interleaver constraints eliminate specific multiple error events as well as single error events. Factor graph representations of the interleaver allows to view multiple error events as short cycles in a graph. Interleaver construction rules which eliminate short cycles for an interleaver graph representation also eliminate the minimum SED error events for this SCC.

Published in:

Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on

Date of Conference:

27 June-2 July 2004