JOURNAL ARTICLE
Decoding Constraint Length for Viterbi Decoding of Ternary Convolutional Codes
Year: 1982 Journal: IETE Journal of Research Vol: 28 (11)Pages: 607-608 Publisher: Taylor & Francis
Abstract
Viterbi algorithm is simulated for ternary convolutional codes. Simulation results show that a decoding constraint length of 2 to 3 times the encoding constraint length is sufficient for levelling off the error probability at low cross-over probabilities of a ternary channel.
Keywords:
Convolutional code Viterbi decoder Sequential decoding Iterative Viterbi decoding Decoding methods Viterbi algorithm Algorithm Ternary operation Computer science Constraint (computer-aided design) List decoding Soft output Viterbi algorithm Mathematics Block code Concatenated error correction code
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
2
Refs
0.10
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Error Correcting Code Techniques
Physical Sciences → Computer Science → Computer Networks and Communications
Advanced Wireless Communication Techniques
Physical Sciences → Engineering → Electrical and Electronic Engineering
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
Related Documents
JOURNAL ARTICLE
Truncation Error Probability in Viterbi Decoding of Ternary Convolutional Codes
Vishwanath SinhaSivasurender Chandran
Journal: IETE Journal of Research Year: 1983 Vol: 29 (4)Pages: 141-144
JOURNAL ARTICLE
Microprocessor-Based Viterbi Decoding of Convolutional Codes
S.L. MaskaraSantanu GhoraiPrasenjit Mitra
Journal: IETE Journal of Research Year: 1982 Vol: 28 (1)Pages: 17-22
JOURNAL ARTICLE
New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding
Journal: IEEE Transactions on Information Theory Year: 1988 Vol: 34 (5)Pages: 1079-1081