A Novel and Fast Way to Decode VLEC
Richa Gupta1, BhuDev Sharma2, Vishal Jain3

1Richa Gupta, Electronics and Communication Engineering, JIIT, Noida, (U.P), India.
2BhuDev Sharma, Mathematic Department, Formerly at JIIT, Noida (India); Clark Atlanta University, Atlanta, FL (USA).
3Vishal Jain, Computer Applications and Management, Bharati Vidyapeeth’s Institute of Computer Applications and Management, New Delhi. India.

Manuscript received on 13 March 2019 | Revised Manuscript received on 20 March 2019 | Manuscript published on 30 March 2019 | PP: 107-113 | Volume-7 Issue-6, March 2019 | Retrieval Number: F2130037619 /19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Joint Source Channel Coding (JSCC) is an emerging area of Information Theory. It jointly optimises source code and channel code both. Variable Length Error Correcting Codes (VLECs) are the tools of JSCC and they are very important as there are a lot of applications of VLECs in the transmission of multimedia files. There are several decoding algorithms of VLECs, one of them is Maximum Likelihood (ML) decoding. This uses trellis/tree structure to decode the received bitstream. The problem with the trellis approach is its complexity which increases exponentially with the length of the received vector. This paper proposes a rather novel and fast tabular decoding method for ML decoding of VLECs. In place of the trellis or tree structure, if tabular method is used, the complexity of the decoding algorithm reduces a lot.
Keywords: Variable length codes, trellis structure, maximum likelihood decoding, Viterbi algorithm and Hamming distance.
Scope of the Article: Parallel and Distributed Algorithms