Using CSP to model the synchronisation process of variable length codes

Variable length codes (VLC) have found widespread use for efficient encoding of symbols with unequal probabilities in many practical situations. However, bit errors can cause a loss of decoder synchronism that often leads to error propagation. Recent advances in the development of VLC that limit the effect of error propagation, such as reversible VLC and self-synchronising VLC, contribute further to their popularity. However, it is still important to model the performance of various VLC code sets so that comparisons can be made between different coding schemes and for different applications. Communicating sequential processes (CSP) is a well-established formal description technique that allows one to analyse the behaviour of concurrently evolving processes. It has been successfully applied to industrial-scale problems. The paper describes how CSP can be applied to the modelling of the resync process of VLC. This approach offers three main advantages. First, a complete model comprises processes and events as basic building blocks, making this approach highly scalable. Second, different semantic models provide different level of abstraction. Third, tools are available for automatic generation of sync sequences, which also provide a measure of sync performance. This facilitates comparisons of different VLC schemes in addition to code sets obtained using a given coding scheme.

[1]  M. Wada,et al.  Reversible variable length codes , 1995, IEEE Trans. Commun..

[2]  A.C.M. Fong,et al.  Analysis of the decoding process of T-codes , 2002 .

[3]  Ya-Qin Zhang,et al.  Transporting real-time video over the Internet: challenges and approaches , 2000, Proceedings of the IEEE.

[4]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[5]  A.C.M. Fong,et al.  Error localization for robust video transmission , 2002, IEEE Trans. Consumer Electron..

[6]  John P. Robinson,et al.  Error recovery for variable length codes , 1985, IEEE Trans. Inf. Theory.

[7]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[8]  Yao Wang,et al.  Error control and concealment for video communication: a review , 1998, Proc. IEEE.

[9]  A.C.M. Fong,et al.  Using a tree algorithm to determine the average synchronisation delay of self-synchronising T-codes , 2002 .

[10]  Mark R. Titchener The synchronization of variable-length codes , 1997, IEEE Trans. Inf. Theory.

[11]  M. R. Titchener,et al.  Calculating the expected synchronisation delay for T-code sets , 1997 .

[12]  Yasuhiro Takishima,et al.  Error states and synchronization recovery for variable length codes , 1994, IEEE Trans. Commun..

[13]  Thomas J. Ferguson,et al.  Self-synchronizing Huffman codes , 1984, IEEE Trans. Inf. Theory.

[14]  Bernd Girod Bidirectionally decodable streams of prefix code-words , 1999, IEEE Communications Letters.

[15]  M. R. Titchener,et al.  Generalised T-codes : extended construction algorithm for self-synchronising codes , 1996 .