Low-complexity joint source/channel turbo decoding of arithmetic codes - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Low-complexity joint source/channel turbo decoding of arithmetic codes

Résumé

In recent years, the turbo principle has been widely applied to various decoding schemes. Here, we extend the general idea of iterative decoding to a communication scheme where arithmetic coding is used for source coding and a recursive systematic convolutional code is used for channel coding. The scope of this paper is to develop a low complexity SISO decoder for arithmetic codes using the SOVA algorithm principle and a trellis representation of arithmetic codes. The proposed approach enables iterative decoding and information exchange between the convolutional SISO decoder and the proposed arithmetic SISO decoder. Performance of the presented scheme are evaluated for an artificial source transmitting over an AWGN channel. Simulation results show that the proposed joint source channel iterative decoder leads to a significant performance gain in comparison with classical tandem decoding.
Fichier non déposé

Dates et versions

hal-02475637 , version 1 (12-02-2020)

Identifiants

Citer

Amin Zribi, Sonia Zaibi, Ramesh Pyndiah, Ammar Bouallegue, Mahmoud Ammar. Low-complexity joint source/channel turbo decoding of arithmetic codes. 5th International Symposium on Turbo Codes and Related Topics, Sep 2008, Lausanne, Switzerland. pp.385 - 389, ⟨10.1109/TURBOCODING.2008.4658730⟩. ⟨hal-02475637⟩
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More