Raptor codes are a class of rateless codes originally designed for binary erasure channels. This paper presents a compact set of mathematical expressions for iterative soft decoding of raptor codes. In addition, an early termination scheme is employed, and it is embedded in a single algorithm with the formula. In the proposed algorithm, the performance is enhanced by adopting iterative decoding, both in each inner and outer code and in the concatenated code itself between the inner and outer codes. At the same time, the complexity is reduced by applying an efficient early termination scheme. Simulation results show that our proposed method can achieve better performance with reduced decoding complexity compared to the conventional schemes
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
© 2016 IEEE. In this paper, we analyze the maximum likelihood decoding performance of Raptor codes w...
Abstract—In this paper, we present an analytical analysis of the convergence of raptor codes under j...
In this paper we describe some practical aspects of the design process of good Raptor codes for fini...
As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP s...
Based on recent results on the performance of LT codes under inactivation decoding, we show how to d...
Abstract—LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-...
In this paper we analyze LT and Raptor codes under inactivation decoding. A first order analysis is ...
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant ...
Abstract—In this paper, we discuss the rate splitting issue for the design of finite length Raptor c...
Fountain codes are a universal class of rateless codes originally designed for erasure channels. Nat...
In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability...
In this thesis, we investigate the optimization of Raptor codes for various channels of interest in ...
Abstract—Raptor codes are a class of rateless codes that have been shown to provide promising perfor...
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
© 2016 IEEE. In this paper, we analyze the maximum likelihood decoding performance of Raptor codes w...
Abstract—In this paper, we present an analytical analysis of the convergence of raptor codes under j...
In this paper we describe some practical aspects of the design process of good Raptor codes for fini...
As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP s...
Based on recent results on the performance of LT codes under inactivation decoding, we show how to d...
Abstract—LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-...
In this paper we analyze LT and Raptor codes under inactivation decoding. A first order analysis is ...
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant ...
Abstract—In this paper, we discuss the rate splitting issue for the design of finite length Raptor c...
Fountain codes are a universal class of rateless codes originally designed for erasure channels. Nat...
In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability...
In this thesis, we investigate the optimization of Raptor codes for various channels of interest in ...
Abstract—Raptor codes are a class of rateless codes that have been shown to provide promising perfor...
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood...
This thesis is concerned with the area of decoding techniques of concatenated, error correcting code...
© 2016 IEEE. In this paper, we analyze the maximum likelihood decoding performance of Raptor codes w...