Irregular repeat accumulate codes

By H. Jin. 2000

632 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/33d3efd4c87a2cd1c988a40e388dbc9c18de8d30

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Protograph LDPC Codes Design Based on EXIT Analysis (2007, background): “Quasi-cyclic (QC) LDPC codes, regular LDPC codes, repeat-accumulate (RA) and RA-like codes [9], [10] present simple protograph structures.”
Capacity-approaching protograph codes (2009, background): “Repeat-Accumulate (RA) [14], Irregular RepeatAccumulate (IRA) [15], and Accumulate-Repeat-Accumulate (ARA) [16] codes, with suitable definitions of their interleavers, all have simple protograph representations.”
Raptor codes (2011, background): “One possible choice would be a Tornado code [2], though other choices are also possible (for example an LT-code with the appropriate number of output symbols, or an irregular Repeat–Accumulate code [12], or an irregular Repeat–Accumulate code with bounded complexity [13]).”
Multi-Edge Type LDPC Codes (2004, methodology): “The multiedge type LDPC codes formalism includes various constructions that have been proposed in the literature including, among others, concatenated tree (CT) codes [1], (generalized irregular) repeat accumulate (RA) codes [2], [3], and codes in [4], [5].”
Design of efficiently encodable moderate-length high-rate irregular LDPC codes (2004, background): “In this paper, we focus on the design of moderate length ( ), high rate ( ) irregular LDPC codes.”
Bit-Interleaved Coded Modulation (2008, background): “Our next example is a binary irregular RA codes [58, 100] with grouping factor a, for which a single-parity-check code of rate a is introduced before the accumulator.”
A close-to-capacity dirty paper coding scheme (2004, methodology): “It incorporates a check–biregular, repeat–irregular nonsystematic repeat– accumulate (RA) code [29], [30] concatenated with a trellis shaping code.”
Iterative multiuser joint decoding: unified framework and asymptotic analysis (2001, unknown): “In particular, if code is a trellis code, turbo code [38], low-density parity check (LDPC) code (see [28] and references therein), repeat–accumulate (RA) code [39], etc., the subgraph formed by the variable nodes , and by the function node can be expanded in well-known forms [22].”
Regular and irregular progressive edge-growth tanner graphs (2005, methodology): “Similar in spirit is the approach to incorporate a pattern, referred to as the zig-zag pattern, in the parity-check matrix [44, 45].”
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation (2001, background): “In BECs, density evolution becomes one-dimensional, and it is possible to do more analysis and even to construct capacity-achieving codes [11], [30].”
Extrinsic information transfer functions: model and erasure channel properties (2004, methodology): “This is done in [23] by using a Taylor series expansion of an approximation to the check-node curve.”