### Abstract

A 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 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 minus 1) systematic and nonsystematic convolutional codes, with rates 1/2, 3/4, 5/6 and 7/8, 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 reduction in the number of binary comparisons required by the Yamada system can be achieved.

Original language | English |
---|---|

Pages (from-to) | 673-680 |

Number of pages | 8 |

Journal | IEE Proceedings, Part F: Communications, Radar and Signal Processing |

Volume | 134 |

Issue number | 7 |

Publication status | Published - Dec 1987 |

## Fingerprint Dive into the research topics of 'ERROR PERFORMANCE OF MAXIMUM-LIKELIHOOD TRELLIS DECODING OF (n, n minus 1) CONVOLUTIONAL CODES: A SIMULATION STUDY.'. Together they form a unique fingerprint.

## Cite this

*IEE Proceedings, Part F: Communications, Radar and Signal Processing*,

*134*(7), 673-680.