By Topic

Creeper: an algorithm for decoding convolutional codes

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
$31 $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

1 Author(s)
Imtawil, V. ; Dept. of Electr. Eng., Khon Kaen Univ., Thailand

There are two main strategies for decoding convolutional codes: the well-known Viterbi algorithm and sequential decoding. This paper presents a comparison of Creeper, an algorithm for sequential decoding, and the Viterbi algorithm. Creeper is an algorithm which combines the best properties of both the stack and the Fano algorithms. It requires less memory than the stack algorithm and has no backward moves as in the Fano algorithm. Some results of simulation show that Creeper is an interesting alternative to the Viterbi algorithm.

Published in:

Communication Systems, 2002. ICCS 2002. The 8th International Conference on  (Volume:1 )

Date of Conference:

25-28 Nov. 2002