Abstract — We study irregular binary turbo codes over non-ergodic block-fading channels. We first propose an extension of channel multiplexers initially designed for regular turbo codes. We then show that, using these multiplexers, irregular turbo codes that exhibit a small decoding threshold over the ergodic Gaussian-noise channel perform very close to the outage probability on block-fading channels, from both density evolution and finite-length perspectives. I
The focus of this paper is the design of good irregular low density parity check (LDPC) codes for Ra...
A new metric for Turbo decoding on Rayleigh fading channels with noisy channel estimates is derived....
A new metric for Turbo decoding on Rayleigh fading channels with noisy channel estimates is derived....
Our main goal in this paper is to construct codes that can perform close to information-theoretic li...
We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fadin...
We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fadin...
We derive here improved upper bounds on the error probability of block codes which are transmitted o...
We derive upper bounds on the decoding error probability of binary block codes over noncoherent bloc...
Richardson, Shokrollahi, Urbanke have proposed irregular low-density parity-check codes (LDPCCs) tha...
We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative deco...
In this paper, the best achievable performance of a turbo coded system on a block fading channel is ...
In this paper, the best achievable performance of a turbo coded system on a block fading channel is ...
Block transmission over noisy communication channels is characterized by two performance criteria: t...
Fading in wireless environments is a major obstacle to reliable communications. In order to mitigate...
In this paper we prove that for general memoryless binary input channels, most ensembles of parallel...
The focus of this paper is the design of good irregular low density parity check (LDPC) codes for Ra...
A new metric for Turbo decoding on Rayleigh fading channels with noisy channel estimates is derived....
A new metric for Turbo decoding on Rayleigh fading channels with noisy channel estimates is derived....
Our main goal in this paper is to construct codes that can perform close to information-theoretic li...
We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fadin...
We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fadin...
We derive here improved upper bounds on the error probability of block codes which are transmitted o...
We derive upper bounds on the decoding error probability of binary block codes over noncoherent bloc...
Richardson, Shokrollahi, Urbanke have proposed irregular low-density parity-check codes (LDPCCs) tha...
We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative deco...
In this paper, the best achievable performance of a turbo coded system on a block fading channel is ...
In this paper, the best achievable performance of a turbo coded system on a block fading channel is ...
Block transmission over noisy communication channels is characterized by two performance criteria: t...
Fading in wireless environments is a major obstacle to reliable communications. In order to mitigate...
In this paper we prove that for general memoryless binary input channels, most ensembles of parallel...
The focus of this paper is the design of good irregular low density parity check (LDPC) codes for Ra...
A new metric for Turbo decoding on Rayleigh fading channels with noisy channel estimates is derived....
A new metric for Turbo decoding on Rayleigh fading channels with noisy channel estimates is derived....