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.
Liste complète des métadonnées

Cited literature [34 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00549258
Contributor : Michel Kieffer <>
Submitted on : Tuesday, December 21, 2010 - 3:51:37 PM
Last modification on : Wednesday, February 20, 2019 - 2:38:52 PM
Document(s) archivé(s) le : Tuesday, March 22, 2011 - 3:07:27 AM

File

TCOM-TPS-09-0780.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

808

Files downloads

154