Complexity constrained design of sparse graph codes /
Files
(Published version)
Date
2013
Authors
Wang, Guangsong,
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
thesis
Citation
Statement of Responsibility
Conference Name
Abstract
Numerous methods have been introduced for the design of capacity-approaching sparsegraph codes, under the assumption of an arbitrary number of decoder iterations. Howeverin many practical situations, latency requirements or hardware constraints maylimit the available number of iterations. This thesis develops methodologies for the design of sparse graph codes with limited decoding complexity. The powerful and versatile tool of extrinsic information transfer (EXIT) charts is employed for code analysis and design throughout the thesis.
School/Discipline
University of South Australia. Institute for Telecommunications Research.
Institute for Telecommunications Research.
Institute for Telecommunications Research.
Dissertation Note
Thesis (PhDTelecommunications)--University of South Australia, 2013.
Provenance
Copyright 2013 Guangsong Wang. This work is made available under the Creative Commons Attribution-NonCommercial-NoDerivs Australia 3.0 licence (http://creativecommons.org/licenses/by-nc-nd/3.0/au/)
Description
1 ethesis (xix, 137 pages) :
illustrations (some colour)
Includes bibliographical references (pages 129-137)
illustrations (some colour)
Includes bibliographical references (pages 129-137)
Access Status
506 0#$fstar $2Unrestricted online access