Performance bounds and codes design criteria for channel decoding with a-priori information

Authors:
Andrea Abrardo
Affiliations:
Department of Information Engineering, Siena, Italy
Venue:
IEEE Transactions on Wireless Communications
Year:
2009

Citing 8
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Asymmetric joint source-channel coding for correlated sources with blind HMM estimation at the receiver

EURASIP Journal on Wireless Communications and Networking
Joint source-channel turbo coding for binary Markov sources

IEEE Transactions on Wireless Communications
Unveiling turbo codes: some results on parallel concatenated coding schemes

IEEE Transactions on Information Theory
Iterative joint channel decoding of correlated sources employing serially concatenated convolutional codes

IEEE Transactions on Information Theory
Low-density parity-check matrices for coding of correlated sources

IEEE Transactions on Information Theory
Interleaver design for turbo codes

IEEE Journal on Selected Areas in Communications
LDPC-Based Iterative Joint Source-Channel Decoding for JPEG2000

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this article we focus on the channel decoding problem in presence of a-priori information. In particular, assuming that the a-priori information reliability is not perfectly estimated at the receiver, we derive a novel analytical framework for evaluating the decoder's performance. It is derived the important result that a "good code", i.e., a code which allows to fully exploit the potential benefit of a-priori information, must associate information sequences with high Hamming distances to codewords with low Hamming distances. Basing on the proposed analysis, we analyze the performance of random codes and turbo codes.