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

Amadou Diallo (1) , Claudio Weidmann (2) , Michel Kieffer (1, 3)

1 L2S - Laboratoire des signaux et systèmes
2 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
3 LTCI - Laboratoire Traitement et Communication de l'Information

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.

Domaines: Réseaux et télécommunications [cs.NI]; Théorie de l'information et codage [math.IT]; Théorie de l'information [cs.IT]

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, 2011, 59 (4), pp.1043-1052. ⟨10.1109/TCOMM.2011.020411.090780⟩. ⟨hal-00549258⟩