Repeat-accumulate codes for block-fading channels

Kadel, Rajan; Lechner, Gottfried

doi:10.1109/ausctw.2013.6510041

Cited by 7 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a comparison reference for our codes, root-LDPC block codes are considered [4]. This is the most known construction of block-codes for non-ergodic channels, which motivated a number of further results in this area [5], [6]. However, all the existing constructions are designed for a single specified value of d (in most of cases d = 2), and will not work well if the number of fading coefficients per codeword changes.…”

Section: Motivation: Codes Of Flexible Diversity Ordermentioning

confidence: 99%

“…In order to simplify the analysis, this paper assumes that Pe is computed over the whole codeword, and not over the information part of it, as it was previously assumed in[4]-[6]. So, the values of d, obtained in the present paper, are in fact lower bounds (one might still increase the diversity for information bits by placing them carefully within the codeword).…”

mentioning

confidence: 98%

“…Note that the maximum diversity of d IT inTable IIfor(3,6) code is obtained by starting with Option 2 as described in Section IV-A. Since the Option 2 consumes less edges to fulfill the constraint on mcc, a higher diversity order is possible in this case compared to the Option 1 inTable I.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Protograph design for spatially-coupled codes to attain an arbitrary diversity order

Hassan¹,

Andriyanova²,

Lentmaier³

et al. 2015

2015 IEEE Information Theory Workshop - Fall (ITW)

View full text Add to dashboard Cite

This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J, K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.

show abstract

Section: Motivation: Codes Of Flexible Diversity Ordermentioning

confidence: 99%

mentioning

confidence: 98%

See 1 more Smart Citation

Protograph design for spatially-coupled codes to attain an arbitrary diversity order

Hassan¹,

Andriyanova²,

Lentmaier³

et al. 2015

2015 IEEE Information Theory Workshop - Fall (ITW)

View full text Add to dashboard Cite

show abstract

“…Now we compute the segment metric in (5). For the ease of representation, we use h, v, s and r to denote h(0), u [a(0),b(0)] , x [a(0),b(0)] and r [a(0),b(0)] , respectively.…”

Section: Sova-ncsi Decodermentioning

confidence: 99%

Low-Complexity Decoding of Repeat-Accumulate Codes over Quasi-Static Fading Channels

Yuan

Kam

2014

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

We consider iterative decoding of repeat-accumulate (RA) codes over frequency-flat, quasi-static fading channels. A soft-input, soft-output decoder is proposed for the inner convolutional decoding, which fuses the decoding approach of the soft-output Viterbi algorithm and the estimation approach of the maximum-likelihood sequence detector. The decoder deploys trellis search algorithm based on the generalized likelihood ratio test, whereby the channel state information is acquired implicitly using both the pilot and data signals during the decoding process. Through simulations, we show that the RA decoding with the proposed decoder has much better error performance than standard RA decoding with pilot-symbol-assisted channel estimation, while having approximately the same computational complexity. Compared with the conventional scheme of iterative channel estimation and decoding, the proposed decoder has much simpler structure and requires significantly less computational power, although it incurs some loss in error performance.

show abstract

“…In [4], a family of LDPC block codes, called root-LDPC codes, are proposed that provide full diversity 1 d = 2 over a block-fading channel with two fading gains per codeword. [4] motivated a number of further results on the design of full-diversity "root" codes, see [5], [6]. However, for a rate 1/2 code all these examples still have d = 2, and the boundedness of the root structure, on which they are built on, makes it a complicated task to extend these designs to d > 2.…”

Section: Introductionmentioning

confidence: 99%

SC-LDPC codes over the block-fading channel: Robustness to a synchronisation offset

Andriyanova¹,

Hassan²,

Lentmaier³

et al. 2015

2015 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

View full text Add to dashboard Cite

Spatially-Coupled LDPC (SC-LDPC) codes have been recently shown to be very efficient for transmissions over nonergodic channels, in particular over block-fading channels [1]. In fact, it is possible to design a SC-LDPC code with any given code diversity [2]. In this work, we investigate the performance of SC-LDPC codes over block-fading channels, assuming a mismatch (or offset) between the first bit of a transmission packet and a first bit of a codeword. Such a mismatch is called the synchronisation offset, and it has a negative impact on the code diversity. We propose a data-allocation scheme for SC-LDPC codes that allows to obtain a robustness to the synchronisation offset. Combined together with the code design from [2], it allows to design efficient SC-LDPC codes, whose performance degrades only slowly under imperfect transmission conditions.

show abstract

Repeat-accumulate codes for block-fading channels

Cited by 7 publications

References 11 publications

Protograph design for spatially-coupled codes to attain an arbitrary diversity order

Protograph design for spatially-coupled codes to attain an arbitrary diversity order

Low-Complexity Decoding of Repeat-Accumulate Codes over Quasi-Static Fading Channels

SC-LDPC codes over the block-fading channel: Robustness to a synchronisation offset

Contact Info

Product

Resources

About