Efficient computation and optimization of the free distance of variable-length finite-state joint source-channel codes

Abstract : This paper considers the optimization of a class of joint source-channel codes described by finitestate encoders (FSEs) generating variable-length codes. It focuses on FSEs associated to joint-source channel integer arithmetic codes, which are uniquely decodable codes by design. An efficient method for computing the free distance of such codes using Dijkstra's algorithm is proposed. To facilitate the search for codes with good distance properties, FSEs are organized within a tree structure which allows the use of efficient branch-and-prune techniques avoiding a search of the whole tree.
Type de document :
Article dans une revue
IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 2011, 59 (4), pp.1043-1052. 〈10.1109/TCOMM.2011.020411.090780〉
Liste complète des métadonnées

Littérature citée [34 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00549258
Contributeur : Michel Kieffer <>
Soumis le : mardi 21 décembre 2010 - 15:51:37
Dernière modification le : mercredi 20 février 2019 - 14:38:52
Document(s) archivé(s) le : mardi 22 mars 2011 - 03:07:27

Fichier

TCOM-TPS-09-0780.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Amadou Diallo, Claudio Weidmann, Michel Kieffer. Efficient computation and optimization of the free distance of variable-length finite-state joint source-channel codes. IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 2011, 59 (4), pp.1043-1052. 〈10.1109/TCOMM.2011.020411.090780〉. 〈hal-00549258〉

Partager

Métriques

Consultations de la notice

787

Téléchargements de fichiers

148