Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Convergence analysis and optimal scheduling for multiple concatenated codes
Chalmers University of Technology.
University of South Australia. (Institute for Telecommunications Research)ORCID-id: 0000-0001-7182-9543
University of South Australia. (Institute for Telecommunication Research)
2005 (engelsk)Inngår i: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 51, nr 9, s. 3354-3364Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

An interesting practical consideration for decoding of serial or parallel concatenated codes with more than two components is the determination of the lowest complexity component decoder schedule which results in convergence. This correspondence presents an algorithm that finds such an optimal decoder schedule. A technique is also given for combining and projecting a series of three-dimensional extrinsic information transfer (EXIT) functions onto a single two-dimensional EXIT chart. This is a useful technique for visualizing the convergence threshold for multiple concatenated codes and provides a design tool for concatenated codes with more than two components.

sted, utgiver, år, opplag, sider
2005. Vol. 51, nr 9, s. 3354-3364
Emneord [en]
Exit chart, Iterative decoding, Multiple concatenated codes, Optimal scheduling
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-62633DOI: 10.1109/TIT.2005.853312ISI: 000231392900030OAI: oai:DiVA.org:kth-62633DiVA, id: diva2:480778
Merknad
QC 20120124Tilgjengelig fra: 2012-01-19 Laget: 2012-01-19 Sist oppdatert: 2017-12-08bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Rasmussen, Lars Kildehöj

Søk i DiVA

Av forfatter/redaktør
Rasmussen, Lars Kildehöj
I samme tidsskrift
IEEE Transactions on Information Theory

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 27 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf