Browsing by Author "Abdulkhaleg, Nadhir Ibrahim"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    Doctoral Thesis
    Design of high performance low latency rateless codes
    (Çankaya Üniversitesi, 2017) Abdulkhaleg, Nadhir Ibrahim
    Luby Transform (LT) codes are one of the best rateless codes mainly designed for binary erasure channel. The characteristics of such codes perfectly performing when used with bulk data files, however a performance degradation has been observed when using them with short length messages. In this thesis, we present a new design for rateless codes, particularly an efficient LT codes using robust soliton distribution (RSD) as a degree generation method and tested in both binary erasure channel (BEC) and noisy channels like the additive white Gaussian noise (AWGN) channel. First, a new proposed decoding technique is defined as belief propagation-pattern recognition (BP-PR) is implemented to enhance the decoding ability of the conventional (BP) algorithm to overcome the problem of losing degree-one coded symbols which caused early decoding termination. The simulation results approve the improvement of the BP-PR when used with LT-RSD and outperforms the bit error rate (BER) records for the state of art techniques like memory-based robust Soliton distribution using conventional BP (LT-MBRSD-BP) or the Gaussian elimination assisted belief propagation (LT-RSD-BP-GE) and improve the records for the BER when used with MBRSD, ISD and optimal degree distribution (ODD), to form the new code called (LT-MBRSD-BP-PR),(LT-ISD-BP-PR) and (LT-ODD-BP-PR) respectively. Second, a new efficient deterministic encoding technique using deterministic degree generator with random data selection (LT-DE) is applied for extremely short data lengths. The degree generation method is based on creating the degrees in a repeated frame with a limited upper value called repetition period (𝑅𝑝) and the data symbols are chosen sequentially from a truncated data file. The data file is truncated to segments of length (𝑅𝑝) and each segment is chosen based on a random sequence. Testing this (LT-DE) against (LT-RSD-BP-PR), (LT-MBRSD-BP-PR) and (LT-ODD-BP-PR) in a BEC environment had approved the superiority of such code over all the other mentioned techniques. It has the lower error floor and higher successful decoding rate with minimum overhead and computational cost. The formation of this (LT-DE) associates a mutual relation between the successive coded symbols which motivate us to present a new sequential decoding technique mainly used over (AWGN) channel. With such new encoding-decoding technique LT codes can approach the decoding complexity cost of Raptor codes with smaller overhead and less encoding complexity as well.