1. How to submit my research paper? What’s the process of publication of my paper?
The journal receives submitted manuscripts via email only. Please submit your research paper in .doc or .pdf format to the submission email: jait@etpub.com.
2.Can I submit an abstract?
The journal publishes full research papers. So only full paper submission should be considered for possible publication. Papers with insufficient content may be rejected as well, make sure your paper is sufficient enough to be published...[Read More]

Generalization of VLC Decoding Trees-to- Processes Translation

Guan Y. Hong1 and A.C.M. Fong2
1. Unitec/Department of Computing, Auckland, New Zealand
2. Auckland University of Technology/School of Computing, Auckland, New Zealand
Abstract—In an earlier paper, we presented a novel application of Communicating Sequential Processes (CSP) to the modeling of variable length code (VLC) synchronization. Different from the traditional encoding/decoding tree analysis, the new approach provides a very precise description of the synchronization mechanisms. Underpinned by strong mathematical principles, CSP is a process algebra for describing the patterns of communication and interaction between agents that interact via explicit message passing. Such properties have been adapted in the present context of understanding VLC synchronization mechanisms. As an extension of the novel approach, this paper presents a systematic translation from VLC encoding/decoding trees to processes, and describes further generalization of the models presented in our earlier paper. We therefore present this paper to ensure the scalability and applicability of the CSP approach of modeling in this context.

Index Terms—modeling, variable length codes, synchronization, processes

Cite: Guan Y. Hong and A.C.M. Fong, "Generalization of VLC Decoding Trees-to- Processes Translation," Journal of Advances in Information Technology, Vol. 1, No. 2, pp. 97-101, May, 2010.doi:10.4304/jait.1.2.97-101
Copyright © 2013-2020. JAIT. All Rights Reserved
Creative Commons LicenseThis work is licensed under the Creative Commons Attribution License (CC BY-NC-ND 4.0)