Customized Raptor Code Designs for Finite Lengths and Practical Settings

  • Author / Creator
    Mahdaviani, Kaveh
  • In this dissertation we present new methods for designing efficient Raptor codes in finite and practical block lengths. First we propose an extension of Raptor codes which keeps all the desirable properties, including the linear complexity of encoding and decoding per information bit, and improves the performance in terms of the reception rate. Our simulations show a 10% reduction in the required overhead at the benchmark block length of 64,520 bits, and with the same complexity per information bit. Second, we consider the practical setting with short block lengths of 1000<k<10000. Based on a new vision of the inactivation decoding process, we set a new degree distribution design criterion for the Luby transform (LT) part of Raptor codes. A family of degree distributions that satisfy the new design criterion is analytically derived. The finite length performance of this family is investigated by using computer simulations and is shown to outperform the conventional design.

  • Subjects / Keywords
  • Graduation date
  • Type of Item
  • Degree
    Master of Science
  • DOI
  • License
    This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
  • Language
  • Institution
    University of Alberta
  • Degree level
  • Department
    • Department of Electrical and Computer Engineering
  • Specialization
    • Communications
  • Supervisor / co-supervisor and their department(s)
    • Ardakani, Masoud (Electrical and Computer Engineering)
    • Tellambura, Chintha (Electrical and Computer Engineering)
  • Examining committee members and their departments
    • Jiang, Hai (Electrical and Computer Engineering)
    • Salavatipour, Mohammad R. (Computing Science)