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

Sheryl L Howard, Siavash S. Zeinoddin, Christian Schlegel, Vincent C. Gaudet

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The use of interleaver constraint to eliminate low squared Euclidean distance (SED) error events for a specificcc serially concatenated code (SCC) was discussed. It was found that the interleaver constraint eliminate the specific multiple error events as well as single error events. It was observed that the 4-cycle free interleaver had spreading 10, and the 6-cycle-free-interleaver had spreading 15. Analysis shows that the BER slope for each cycle-free interleaver was steeper than the corresponding minimum distance asymptote.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages53
Number of pages1
StatePublished - 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: Jun 27 2004Jul 2 2004

Other

OtherProceedings - 2004 IEEE International Symposium on Information Theory
CountryUnited States
CityChicago, IL
Period6/27/047/2/04

Fingerprint

Concatenated codes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Howard, S. L., Zeinoddin, S. S., Schlegel, C., & Gaudet, V. C. (2004). Short-cycle-free interleaver design for increasing minimum squared euclidean distance. In IEEE International Symposium on Information Theory - Proceedings (pp. 53)

Short-cycle-free interleaver design for increasing minimum squared euclidean distance. / Howard, Sheryl L; Zeinoddin, Siavash S.; Schlegel, Christian; Gaudet, Vincent C.

IEEE International Symposium on Information Theory - Proceedings. 2004. p. 53.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Howard, SL, Zeinoddin, SS, Schlegel, C & Gaudet, VC 2004, Short-cycle-free interleaver design for increasing minimum squared euclidean distance. in IEEE International Symposium on Information Theory - Proceedings. pp. 53, Proceedings - 2004 IEEE International Symposium on Information Theory, Chicago, IL, United States, 6/27/04.
Howard SL, Zeinoddin SS, Schlegel C, Gaudet VC. Short-cycle-free interleaver design for increasing minimum squared euclidean distance. In IEEE International Symposium on Information Theory - Proceedings. 2004. p. 53
Howard, Sheryl L ; Zeinoddin, Siavash S. ; Schlegel, Christian ; Gaudet, Vincent C. / Short-cycle-free interleaver design for increasing minimum squared euclidean distance. IEEE International Symposium on Information Theory - Proceedings. 2004. pp. 53
@inproceedings{82578a1d31da4a99b472adbc85797cd2,
title = "Short-cycle-free interleaver design for increasing minimum squared euclidean distance",
abstract = "The use of interleaver constraint to eliminate low squared Euclidean distance (SED) error events for a specificcc serially concatenated code (SCC) was discussed. It was found that the interleaver constraint eliminate the specific multiple error events as well as single error events. It was observed that the 4-cycle free interleaver had spreading 10, and the 6-cycle-free-interleaver had spreading 15. Analysis shows that the BER slope for each cycle-free interleaver was steeper than the corresponding minimum distance asymptote.",
author = "Howard, {Sheryl L} and Zeinoddin, {Siavash S.} and Christian Schlegel and Gaudet, {Vincent C.}",
year = "2004",
language = "English (US)",
pages = "53",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Short-cycle-free interleaver design for increasing minimum squared euclidean distance

AU - Howard, Sheryl L

AU - Zeinoddin, Siavash S.

AU - Schlegel, Christian

AU - Gaudet, Vincent C.

PY - 2004

Y1 - 2004

N2 - The use of interleaver constraint to eliminate low squared Euclidean distance (SED) error events for a specificcc serially concatenated code (SCC) was discussed. It was found that the interleaver constraint eliminate the specific multiple error events as well as single error events. It was observed that the 4-cycle free interleaver had spreading 10, and the 6-cycle-free-interleaver had spreading 15. Analysis shows that the BER slope for each cycle-free interleaver was steeper than the corresponding minimum distance asymptote.

AB - The use of interleaver constraint to eliminate low squared Euclidean distance (SED) error events for a specificcc serially concatenated code (SCC) was discussed. It was found that the interleaver constraint eliminate the specific multiple error events as well as single error events. It was observed that the 4-cycle free interleaver had spreading 10, and the 6-cycle-free-interleaver had spreading 15. Analysis shows that the BER slope for each cycle-free interleaver was steeper than the corresponding minimum distance asymptote.

UR - http://www.scopus.com/inward/record.url?scp=5044244094&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5044244094&partnerID=8YFLogxK

M3 - Conference contribution

SP - 53

BT - IEEE International Symposium on Information Theory - Proceedings

ER -