By Topic

Performance bounds for convolutional codes over finite state channels

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

1 Author(s)
C. Pimental ; Fed. Univ. of Pernambuco, Brazil

We present an analytical method for evaluating performance bounds for a communication system that employs a convolutional code, a block interleaving with finite interleaving depth, a binary channel with memory modeled as a finite state channel (FSC), and a decoder that implements the Viterbi algorithm with Hamming metric.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: