Low complexity treillis-based iterative decoding of arithmetic codes with transmission application - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Communications and Information Sciences Année : 2011

Low complexity treillis-based iterative decoding of arithmetic codes with transmission application

Amin Zribi
Sonia Zaibi
  • Fonction : Auteur

Résumé

In this paper, a novel joint source channel (JSC) decoding technique is presented. The proposed approach enables iterative decoding for serially concatenated arithmetic codes and convolutional codes. Iterations are performed between Soft Input Soft Output (SISO) component decoders. For arithmetic decoding, we proposed to employ a low complex trellis search technique to estimate the best transmitted codeword and generate soft outputs. Performances of the presented system are evaluated in terms of PER, in the case of transmission across the AWGN channel. Simulation results show that the proposed JSC iterative scheme leads to significant gain in comparison with a traditional separated decoding. Finally, the practical relevance of the proposed technique is validated under an image transmission system using the SPIHT codec.
Fichier non déposé

Dates et versions

hal-00806002 , version 1 (29-03-2013)

Identifiants

  • HAL Id : hal-00806002 , version 1

Citer

Amin Zribi, Sonia Zaibi, Ramesh Pyndiah, Ammar Bouallègue. Low complexity treillis-based iterative decoding of arithmetic codes with transmission application. Journal of Communications and Information Sciences, 2011, 2 (3), pp.27-35. ⟨hal-00806002⟩
161 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More