Çankaya GCRIS Standart veritabanının içerik oluşturulması ve kurulumu Research Ecosystems (https://www.researchecosystems.com) tarafından devam etmektedir. Bu süreçte gördüğünüz verilerde eksikler olabilir.

Browsing by Author "Abdulkhaleq, Nadhir Ibrahim"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    Conference Object
    Citation Count: Abdulkhaleq, Nadhir Ibrahim; Gazi, Orhan (2017). "A Sequential Coding Approach for Short Length LT Codes over A WGN Channel",
    A Sequential Coding Approach for Short Length LT Codes over A WGN Channel
    (2017) Abdulkhaleq, Nadhir Ibrahim; Gazi, Orhan
    Luby Transform (LT) codes which can be considered as one of the first type of rate less codes are introduced to be an efficient erasure code. In such codes a fountain of encoded symbols is continuously transmitted until the successfully delivery of all the data packets. Whenever the receiver collects N noisy encoded symbols the decoding operation starts. Usually belief propagation (BP) algorithm is used to decipher the code and extract the k data symbols. In this paper, short length LT codes are generated using efficient sequential encoding approach (SEA) and performance measurements have been done over additive white Gaussian (A WGN) channel. This coding technique generates its degree in a repeated sequential manner which yields a mutual relation between adjacent codes that will be used in the decoding part. The decoding complexity of the proposed structure is similar to that of the Raptor codes. The simulation results show that the proposed approach has better performance in terms of error floor and successful decoding ratio when compared to LT codes using robust soliton distribution (RSD) and memorybased-RSD (MBRSD) even when supported by belief propagation-pattern recognition (BP-PR) technique.
  • Thumbnail Image
    Book Part
    Citation Count: Abdulkhaleq, Nadhir Ibrahim; Gazi, Orhan, "A sequential coding approach for short length lt codes over awgn channel", 2017 4th International Conference On Electrical And Electronic Engineering (ICEEE 2017), pp. 267-271, (2017).
    A sequential coding approach for short length lt codes over awgn channel
    (IEEE, 2017) Abdulkhaleq, Nadhir Ibrahim; Gazi, Orhan; 102896
    Luby Transform (LT) codes which can be considered as one of the first type of rate less codes are introduced to be an efficient erasure code. In such codes a fountain of encoded symbols is continuously transmitted until the successfully delivery of all the data packets. Whenever the receiver collects N noisy encoded symbols the decoding operation starts. Usually belief propagation (BP) algorithm is used to decipher the code and extract the k data symbols. In this paper, short length LT codes are generated using efficient sequential encoding approach (SEA) and performance measurements have been done over additive white Gaussian (AWGN) channel. This coding technique generates its degree in a repeated sequential manner which yields a mutual relation between adjacent codes that will be used in the decoding part. The decoding complexity of the proposed structure is similar to that of the Raptor codes. The simulation results show that the proposed approach has better performance in terms of error floor and successful decoding ratio when compared to LT codes using robust soliton distribution (RSD) and memory-based-RSD (MBRSD) even when supported by belief propagation-pattern recognition (BP-PR) technique.
  • Thumbnail Image
    Article
    Citation Count: Abdulkhaleq, N.I., Gazi, O. (2016). Decoding of LT-like codes in the absence of degree-one code symbols. Etri Journal, 38(5), 896-902. http://dx.doi.org/10.4218/etrij.16.0116.0107
    Decoding of LT-like codes in the absence of degree-one code symbols
    (Electronics Communications Research Inst., 2016) Abdulkhaleq, Nadhir Ibrahim; Gazi, Orhan; 102896
    Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree-one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree-one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree-one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory-based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths