The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes

Wanquan Peng and Chengchang Zhang
Volume: 10, No: 1, Page: 69 ~ 80, Year: 2014
10.3745/JIPS.2014.10.1.069
Keywords: Convolutional Codes, Block Codes, Double Loop Cyclic Codes, Matrix Decoding, Viterbi Algorithm
Full Text:

Abstract
The free distance of (n, k, l) convolutional codes has some connection with the memory length, which depends on not only l but also on k. To efficiently obtain a large memory length, we have constructed a new class of (2k, k, l) convolutional codes by (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generation function are also given in this paper. With the help of some matrix modules, we designed a single structure Viterbi decoder with a parallel capability, obtained a unified and efficient decoding model for (2k, k, l) convolutional codes, and then give a description of the decoding process in detail. By observing the survivor path memory in a matrix viewer, and testing the role of the max module, we implemented a simulation with (2k, k, l) convolutional codes. The results show that many of them are better than conventional (2, 1, l) convolutional codes.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
Wanquan Peng and Chengchang Zhang, "The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes," Journal of Information Processing Systems, vol. 10, no. 1, pp. 69~80, 2014. DOI: 10.3745/JIPS.2014.10.1.069.

ACM Style
Wanquan Peng and Chengchang Zhang, "The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes," Journal of Information Processing Systems, 10, 1, (2014), 69~80. DOI: 10.3745/JIPS.2014.10.1.069.