Tightened upper bounds on the ML decoding error probability of binary linear block codes
The performance of maximum-likelihood (ML) decoded binary linear block codes is
addressed via the derivation of tightened upper bounds on their decoding error probability …
addressed via the derivation of tightened upper bounds on their decoding error probability …
[图书][B] Bounds on the error probability of ML decoding for block and turbo-block codes
The performance of either structured or random turbo-block codes and binary, systematic
block codes operating over the additive white Gaussian noise (AWGN) channel, is assessed …
block codes operating over the additive white Gaussian noise (AWGN) channel, is assessed …
On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
We derive here improved upper bounds on the decoding error probability of block codes
which are transmitted over fully interleaved Rician fading channels, coherently detected and …
which are transmitted over fully interleaved Rician fading channels, coherently detected and …
Lower bounds on the error probability of block codes based on improvements on de Caen's inequality
New lower bounds on the error probability of block codes with maximum-likelihood
decoding are proposed. The bounds are obtained by applying a new lower bound on the …
decoding are proposed. The bounds are obtained by applying a new lower bound on the …
The capacity of orthogonal and bi-orthogonal codes on the Gaussian channel
SJ MacMullan, OM Collins - IEEE Transactions on Information …, 1998 - ieeexplore.ieee.org
This correspondence analyzes the performance of concatenated coding systems and
modulation schemes operating over the additive white Gaussian noise (AWGN) channel by …
modulation schemes operating over the additive white Gaussian noise (AWGN) channel by …
Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
The ensemble performance of parallel and serial concatenated turbo codes is considered,
where the ensemble is generated by a uniform choice of the interleaver and of the …
where the ensemble is generated by a uniform choice of the interleaver and of the …
Bounds on the decoding error probability of binary block codes over noncoherent block AWGN and fading channels
We derive upper bounds on the decoding error probability of binary block codes over
noncoherent block additive white Gaussian noise (AWGN) and fading channels, with …
noncoherent block additive white Gaussian noise (AWGN) and fading channels, with …
Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels
We derive tight exponential upper bounds on the decoding error probability of block codes
which are operating over fully interleaved Rician fading channels, coherently detected and …
which are operating over fully interleaved Rician fading channels, coherently detected and …
A comparison of known codes, random codes, and the best codes
SJ MacMullan, OM Collins - IEEE Transactions on Information …, 1998 - ieeexplore.ieee.org
This paper calculates new bounds on the size of the performance gap between random
codes and the best possible codes. The first result shows that, for large block sizes, the ratio …
codes and the best possible codes. The first result shows that, for large block sizes, the ratio …
Coded modulation in the block-fading channel: Coding theorems and code construction
AG i Fabregas, G Caire - IEEE Transactions on Information …, 2005 - ieeexplore.ieee.org
We consider coded modulation schemes for the block-fading channel. In the setting where a
codeword spans a finite number N of fading degrees of freedom, we show that coded …
codeword spans a finite number N of fading degrees of freedom, we show that coded …