By Topic

Error performance of maximum-likelihood trellis decoding of (n, n¿1) convolutional codes: a simulation study

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 $31
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)
Lee, L.H.C. ; University of Manchester, Electrical Engineering Laboratories, Manchester, UK ; Farrell, P.G.

computer simulation comparison of the tolerances to additive white Gaussian noise of two maximum-likelihood trellis decoding systems for use on discrete memoryless channels is presented. The first decoding system applies the Viterbi algorithm to the encoder trellis of a convolutional code; this is the well known standard Viterbi decoding system. The second decoding system, proposed by Yamada, uses the same algorithm but applies it to the syndrome-former trellis of the code. High-rate (n, n¿1) systematic and nonsystematic convolutional codes, with rates ¿, ¿, ¿ and ¿ are used throughout the tests. Simulation results are presented for hard- and soft-decision decoding with BPSK modulation and coherent detection. Results show that the Viterbi and Yamada decoding systems give identical error performance for the same code. The implementation complexity of the systems is also examined; a useful reduction in the number of binary comparisons required by the Yamada system can be achieved.

Published in:

Communications, Radar and Signal Processing, IEE Proceedings F  (Volume:134 ,  Issue: 7 )