Tyck till om SwePub Sök
här!
Sökning: L773:0018 9448 OR L773:0018 9448
> (2005-2009) >
Convergence analysi...
Convergence analysis and optimal scheduling for multiple concatenated codes
-
- Brännström, Fredrik, 1974 (författare)
- Chalmers University of Technology,Chalmers tekniska högskola
-
- Rasmussen, Lars Kildehöj (författare)
- University of South Australia,Institute for Telecommunications Research,Chalmers tekniska högskola,Chalmers University of Technology
-
- Grant, Alex J. (författare)
- University of South Australia,Institute for Telecommunication Research
-
(creator_code:org_t)
- 2005
- 2005
- Engelska.
-
Ingår i: IEEE Transactions on Information Theory. - 0018-9448 .- 1557-9654. ; 51:9, s. 3354-3364
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
https://research.cha...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
Nyckelord
- Exit chart
- Iterative decoding
- Multiple concatenated codes
- Optimal scheduling
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas