The performance of convolutional codes on the block erasure channel using various finite interleaving techniques

Lapidoth, Amos

doi:10.1109/18.333861

Cited by 45 publications

(21 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specifically, observe that, if the fading coefficients belong to the set , the BF channel becomes a block-erasure channel [9], [16]. This corresponds to the large SNR regime.…”

Section: A Limiting Case: Block-erasure Channelsmentioning

confidence: 99%

“…When , the order-4 distribution is balanced, and its probability density function is (16) When , the order-4 distribution is unbalanced, and its probability density function is (17) The expression of is obtained after integrating . The diversity order and the coding gain embedded in appear when .…”

Section: Appendix I Coding Gain Of a Fourth-order Unbalanced Distribumentioning

confidence: 99%

“…Multiplexers for convolutional, turbo and repeat-accumulate codes [3], [8], [14] appeared one decade after the analysis of random and periodic interleaving of convolutional codes on the block-erasure channel [16]. Random ensembles of low-density parity-check codes (LDPC) designed for ergodic AWGN channels [11], [23], in spite of the excellent decoding threshold of their irregular structures, do not have full-diversity, and hence exhibit a poor performance over a BF channel.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

Boutros

Fàbregas

Biglieri

et al. 2010

IEEE Trans. Inform. Theory

102

144

View full text Add to dashboard Cite

Abstract-We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding, we introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes favorably with multiplexed parallel turbo codes for nonergodic channels.

show abstract

“…Specifically, observe that, if the fading coefficients belong to the set , the BF channel becomes a block-erasure channel [9], [16]. This corresponds to the large SNR regime.…”

Section: A Limiting Case: Block-erasure Channelsmentioning

confidence: 99%

Section: Appendix I Coding Gain Of a Fourth-order Unbalanced Distribumentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

Boutros

Fàbregas

Biglieri

et al. 2010

IEEE Trans. Inform. Theory

102

144

View full text Add to dashboard Cite

show abstract

“…Proof: It is sufficient to prove the stated proposition over a Block Binary Erasure Channel (block-BEC) [12], because it is an extremal case of a BF channel. In a block-BEC, the fading gains α 1 and α 2 take two possible values {0, ∞}, so that the mutual information I 1 (.)…”

Section: Propositionmentioning

confidence: 99%

Design of diversity-achieving LDPC codes for H-ARQ with cross-packet channel coding

Duyck

Capirone

Hausl

et al. 2010

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

Abstract-In wireless scenarios an effective protocol to increase the reliability for time-varying channels is the hybrid automatic repeat request (H-ARQ). The H-ARQ scheme with cross-packet channel coding (CPC) is a recently published extension of H-ARQ with several advantages. No full-diversity low-density paritycheck (LDPC) code design for the whole range of coding rates yielding full-diversity has been published. In this paper the authors provide a new outage behavior analysis and a new structured LDPC code ensemble achieving full-diversity for H-ARQ with CPC by exploiting the rootcheck principle. Simulation results show that the new code design outperforms the previous approaches, providing full-diversity and good coding gain, also at high coding rates.

show abstract

“…In [39], a computationally efficient trellis-based algorithm for computing the block diversity of trellis codes with cyclic interleaving is given. In Section V, we give another computationally efficient method for calculating the block diversity.…”

Section: Remarkmentioning

confidence: 99%

On low-complexity space-time coding for quasi-static channels

Caire

Colavolpe

2003

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-We propose a new space-time coding scheme for the quasi-static multiple-antenna channel with perfect channel state information at the receiver and no channel state information at the transmitter. In our scheme, codewords produced by a trellis encoder are formatted into space-time codeword arrays such that decoding can be implemented efficiently by minimum mean-square error (MMSE) decision-feedback interference mitigation coupled with Viterbi decoding, through the use of per-survivor processing.We discuss the code design for the new scheme, and show that finding codes with optimal diversity is much easier than for conventional trellis space-time codes (STCs). We provide an upper bound on the word-error rate (WER) of our scheme which is both accurate and easy to evaluate. Then, we find upper and lower bounds on the information outage probability with discrete independent and identically distributed (i.i.d). inputs (as opposed to Gaussian inputs, as in most previous works) and we show that the MMSE front-end yields a large advantage over the whitened matched filter (i.e., zero-forcing) front-end. Finally, we provide a comprehensive performance/complexity comparison of our scheme with coded vertical Bell Labs layered space-time (V-BLAST) architecture and with the recently proposed threaded space-time codes. We also discuss the concatenation of our scheme with block space-time precoders, such as the linear dispersion codes.

show abstract

The performance of convolutional codes on the block erasure channel using various finite interleaving techniques

Cited by 45 publications

References 17 publications

Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

Design of diversity-achieving LDPC codes for H-ARQ with cross-packet channel coding

On low-complexity space-time coding for quasi-static channels

Contact Info

Product

Resources

About