By Topic

Decoding of convolutional codes using a syndrome trellis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
V. Sidorenko ; Inst. of Problems of Inf., Acad. of Sci., Moscow, Russia ; V. Zyablov

Soft-decision maximum-likelihood decoding of convolutional codes using the Viterbi algorithm with a syndrome trellis is proposed. The parity check matrix of a convolutional code is used to construct the trellis. This trellis is minimal. The number of operations for the decoding of one block of a q-ary rate k/n convolutional code is ~nqmin(k,n-k)qν, where ν is the memory size of the code. When the code rate satisfies k/n>½, the proposed algorithm is simpler than the classical Viterbi algorithm that has complexity ~nqkqν

Published in:

IEEE Transactions on Information Theory  (Volume:40 ,  Issue: 5 )