495 research outputs found
Raptor Codes in the Low SNR Regime
In this paper, we revisit the design of Raptor codes for binary input
additive white Gaussian noise (BIAWGN) channels, where we are interested in
very low signal to noise ratios (SNRs). A linear programming degree
distribution optimization problem is defined for Raptor codes in the low SNR
regime through several approximations. We also provide an exact expression for
the polynomial representation of the degree distribution with infinite maximum
degree in the low SNR regime, which enables us to calculate the exact value of
the fractions of output nodes of small degrees. A more practical degree
distribution design is also proposed for Raptor codes in the low SNR regime,
where we include the rate efficiency and the decoding complexity in the
optimization problem, and an upper bound on the maximum rate efficiency is
derived for given design parameters. Simulation results show that the Raptor
code with the designed degree distributions can approach rate efficiencies
larger than 0.95 in the low SNR regime.Comment: Submitted to the IEEE Transactions on Communications. arXiv admin
note: text overlap with arXiv:1510.0772
On The Design Of Physical Layer Rateless Codes
Codes that are capable of generating any number of encoded symbols from a given number of source symbols are called rateless codes. Luby transform (LT) codes are the first practical realization of rateless codes while Raptor codes are constructed by serially concatenating LT codes with high-rate outer low-density parity-check (LDPC) codes. Although these codes were originally developed for binary erasure channel (BEC), due to their rateless feature, they are being investigated and designed for their use in noisy channels. It is known that LT codes are the irregular non-systematic rateless counterpart of low-density generator-matrix (LDGM) codes. Therefore, the first part of our work is focused on LDGM codes and their serially concatenated scheme called serially concatenated LDGM (SCLDGM) codes. Though single LDGM codes are asymptotically bad codes, the SCLDGM codes are known to perform close to the Shannon limit. We first study the asymptotic behaviour of LDGM codes using a discretized density evolution method. We then show that the DDE method can be used in two-steps to provide the detailed asymptotic performance analysis of SCLDGM codes. We also provide the detailed error-floor analysis of both the LDGM and SCLDGM codes. We also prove a necessary condition for the successful decoding of such concatenated codes under sum-product (SP) decoding in binary input additive white Gaussian noise (BIAWGN) channels. Based on this necessary condition, we then develop a DDE-based optimization approach which can be used to optimize such concatenated codes in general. We present both the asymptotic performance and simulation results of our optimized SCLDGM codes that perform within 0.26 dB to the Shannon limit in BIAWGN channels. Secondly, we focus on the asymptotic analysis and optimization design of LT and Raptor codes over BIAWGN channels. We provide the exact asymptotic performance of LT codes using the DDE method. We apply the concept of the two-step DDE method to the Raptor codes and obtain their exact asymptotic performance in BIAWGN channels. We show that the existing Raptor codes using solely the same output degree distribution can perform within 0.4 dB to the Shannon limit for various realized code-rates. We then develop a DDE-based optimization technique to optimally design such physical layer Raptor codes. Our optimized Raptor codes are shown to perform within 0.2 dB to the Shannon limit for most of the realized code-rates. We also provide the asymptotic curves, decoding thresholds, and simulation results showing that our optimized Raptor codes outperform the existing Raptor codes in BIAWGN channels. Finally, we present the asymptotic analysis and optimization design of systematic version of these codes namely systematic LT and systematic Raptor codes as well
Fountain coding with decoder side information
In this contribution, we consider the application of Digital Fountain (DF) codes to the problem of data transmission when side information is available at the decoder. The side information is modelled as a "virtual" channel output when original information sequence is the input. For two cases of the system model, which model both the virtual and the actual transmission channel either as a binary erasure channel or as a binary input additive white Gaussian noise (BIAWGN) channel, we propose methods of enhancing the design of standard non-systematic DF codes by optimizing their output degree distribution based oil the side information assumption. In addition, a systematic Raptor design has been employed as a possible solution to the problem
Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design
In this paper we analyze LT and Raptor codes under inactivation decoding. A
first order analysis is introduced, which provides the expected number of
inactivations for an LT code, as a function of the output distribution, the
number of input symbols and the decoding overhead. The analysis is then
extended to the calculation of the distribution of the number of inactivations.
In both cases, random inactivation is assumed. The developed analytical tools
are then exploited to design LT and Raptor codes, enabling a tight control on
the decoding complexity vs. failure probability trade-off. The accuracy of the
approach is confirmed by numerical simulations.Comment: Accepted for publication in IEEE Transactions on Communication
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for the relay
channel using low-density parity-check (LDPC) codes. We devise bilayer LDPC
codes to approach the theoretically promised rate of the decode-and-forward
relaying strategy by incorporating relay-generated information bits in
specially designed bilayer graphical code structures. While conventional LDPC
codes are sensitively tuned to operate efficiently at a certain channel
parameter, the proposed bilayer LDPC codes are capable of working at two
different channel parameters and two different rates: that at the relay and at
the destination. To analyze the performance of bilayer LDPC codes, bilayer
density evolution is devised as an extension of the standard density evolution
algorithm. Based on bilayer density evolution, a design methodology is
developed for the bilayer codes in which the degree distribution is iteratively
improved using linear programming. Further, in order to approach the
theoretical decode-and-forward rate for a wide range of channel parameters,
this paper proposes two different forms bilayer codes, the bilayer-expurgated
and bilayer-lengthened codes. It is demonstrated that a properly designed
bilayer LDPC code can achieve an asymptotic infinite-length threshold within
0.24 dB gap to the Shannon limits of two different channels simultaneously for
a wide range of channel parameters. By practical code construction,
finite-length bilayer codes are shown to be able to approach within a 0.6 dB
gap to the theoretical decode-and-forward rate of the relay channel at a block
length of and a bit-error probability (BER) of . Finally, it is
demonstrated that a generalized version of the proposed bilayer code
construction is applicable to relay networks with multiple relays.Comment: Submitted to IEEE Trans. Info. Theor
- âŚ