The Construction and Viterbi Decoding of New (2k, k, l) Convolutional Codes
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
The free distance of (n, k, l) convolutional codes has some connection withthe memory length, which depends on not only l but also on k. To efficiently obtain alarge memory length, we have constructed a new class of (2k, k, l) convolutional codesby (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generationfunction are also given in this paper. With the help of some matrix modules, wedesigned a single structure Viterbi decoder with a parallel capability, obtained a unifiedand efficient decoding model for (2k, k, l) convolutional codes, and then give adescription of the decoding process in detail. By observing the survivor path memory ina matrix viewer, and testing the role of the max module, we implemented a simulationwith (2k, k, l) convolutional codes. The results show that many of them are better thanconventional (2, 1, l) convolutional codes.
Abstract
The free distance of (n, k, l) convolutional codes has some connection withthe memory length, which depends on not only l but also on k. To efficiently obtain alarge memory length, we have constructed a new class of (2k, k, l) convolutional codesby (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generationfunction are also given in this paper. With the help of some matrix modules, wedesigned a single structure Viterbi decoder with a parallel capability, obtained a unifiedand efficient decoding model for (2k, k, l) convolutional codes, and then give adescription of the decoding process in detail. By observing the survivor path memory ina matrix viewer, and testing the role of the max module, we implemented a simulationwith (2k, k, l) convolutional codes. The results show that many of them are better thanconventional (2, 1, l) convolutional codes.
참고문헌 (12)
- Robinson J, "A class of binary recurrent codes with limited error propagation", IEEE Transactions on Informational Theory, 13, pp.106~113 (1967)
- Massey J, "Nonsystematic Convolutional Codes for Sequential Decoding in Space Applications", IEEE Transactions on Communication Technology, 19, pp.806~813 (1971)
- Bahl L, "An efficient algorithm for computing free distance", IEEE Transactions on Informational Theory, 18, pp.437~439 (1972)
- Shu Lin, "Error Control Coding: Fundamentals and Applications", pp.582~598 (2004), Pearson Education
- Berrou C, "Near optimum error correcting coding and decoding: turbo-codes", IEEE Transactions on Communication Theory, 44, pp.1261~1271 (1996)
- Pusane A E, "Deriving Good LDPC Convolutional Codes from LDPC Block Codes", IEEE Transactions on Informational Theory, 57, pp.835~857 (2011)
- Iyengar A R, "Windowed Decoding of Protograph-based LDPC Convolutional Codes over Erasure Channels", IEEE Transactions on Informational Theory, 58, pp.2303~2320 (2012)
- Houshmand M, "Minimal-Memory, Noncatastrophic, Polynomial-Depth Quantum Convolutional Encoders", IEEE Transactions on Informational Theory, 59, pp.1198~1210 (2013)
- Jie Luo, "On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes", IEEE Transactions on Informational Theory, 54, pp.5756~5760 (2008)
- Wang Xinmei, "Error Correcting Codes-Princip1e and Method", pp.159~161 (2001), Xidian University Press
- Huebner A, "Double Serially Concatenated Convolutional Codes With Jointly Designed S-Type Permutors", IEEE Transactions on Informational Theory, 55, pp.5811~5821 (2009)
- Jie Jin, "Low-Power Limited-Search Parallel State Viterbi Decoder Implementation Based on Scarce State Transition", IEEE Transactions on VLSI Systems, 15, pp.1172~1176 (2007)