New type of Viterbi decoding with path reduction

Hiroyuki Yashima, Iwao Sasase, Shinsaku Mori

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A new type of Viterbi decoding algorithm is proposed to realize fast decoding by reducing add-compare-select (ACS) operations, which occupy the dominant part of Viterbi decoding. In the decoding trellis, the branches with low probability to be the correct path are eliminated before decoding based on the detected signal level, which leads to the reduction of merge events in which ACS operation should be done. The reduction rate of the number of ACS operations and the bit-error probability with hard decision are derived for the codes with rate 1/2. It is shown that the number of ACS operations is considerably reduced and that, because of the decrement of the incorrect path, the error performance of the proposed decoding is superior to that of conventional hard-decision Viterbi decoding when the error due to correct path elimination is negligible. Reduced Viterbi decoding reduces the number of ACS operations up to 10% with additional coding gain of 0.6 dB for the code k = 3 and up to about 20% without performance degradation for k = 5.

Original languageEnglish
Title of host publicationIEEE Global Telecommunications Conference and Exhibition
Editors Anon
PublisherPubl by IEEE
Pages1714-1718
Number of pages5
Volume3
Publication statusPublished - 1989
EventIEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3) - Dallas, TX, USA
Duration: 1989 Nov 271989 Nov 30

Other

OtherIEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3)
CityDallas, TX, USA
Period89/11/2789/11/30

Fingerprint

Decoding
Degradation

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yashima, H., Sasase, I., & Mori, S. (1989). New type of Viterbi decoding with path reduction. In Anon (Ed.), IEEE Global Telecommunications Conference and Exhibition (Vol. 3, pp. 1714-1718). Publ by IEEE.

New type of Viterbi decoding with path reduction. / Yashima, Hiroyuki; Sasase, Iwao; Mori, Shinsaku.

IEEE Global Telecommunications Conference and Exhibition. ed. / Anon. Vol. 3 Publ by IEEE, 1989. p. 1714-1718.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yashima, H, Sasase, I & Mori, S 1989, New type of Viterbi decoding with path reduction. in Anon (ed.), IEEE Global Telecommunications Conference and Exhibition. vol. 3, Publ by IEEE, pp. 1714-1718, IEEE Global Telecommunications Conference & Exhibition (GLOBECOM '89). Part 1 (of 3), Dallas, TX, USA, 89/11/27.
Yashima H, Sasase I, Mori S. New type of Viterbi decoding with path reduction. In Anon, editor, IEEE Global Telecommunications Conference and Exhibition. Vol. 3. Publ by IEEE. 1989. p. 1714-1718
Yashima, Hiroyuki ; Sasase, Iwao ; Mori, Shinsaku. / New type of Viterbi decoding with path reduction. IEEE Global Telecommunications Conference and Exhibition. editor / Anon. Vol. 3 Publ by IEEE, 1989. pp. 1714-1718
@inproceedings{a77935138b4f4c43ac8ac281bdcfbda5,
title = "New type of Viterbi decoding with path reduction",
abstract = "A new type of Viterbi decoding algorithm is proposed to realize fast decoding by reducing add-compare-select (ACS) operations, which occupy the dominant part of Viterbi decoding. In the decoding trellis, the branches with low probability to be the correct path are eliminated before decoding based on the detected signal level, which leads to the reduction of merge events in which ACS operation should be done. The reduction rate of the number of ACS operations and the bit-error probability with hard decision are derived for the codes with rate 1/2. It is shown that the number of ACS operations is considerably reduced and that, because of the decrement of the incorrect path, the error performance of the proposed decoding is superior to that of conventional hard-decision Viterbi decoding when the error due to correct path elimination is negligible. Reduced Viterbi decoding reduces the number of ACS operations up to 10{\%} with additional coding gain of 0.6 dB for the code k = 3 and up to about 20{\%} without performance degradation for k = 5.",
author = "Hiroyuki Yashima and Iwao Sasase and Shinsaku Mori",
year = "1989",
language = "English",
volume = "3",
pages = "1714--1718",
editor = "Anon",
booktitle = "IEEE Global Telecommunications Conference and Exhibition",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - New type of Viterbi decoding with path reduction

AU - Yashima, Hiroyuki

AU - Sasase, Iwao

AU - Mori, Shinsaku

PY - 1989

Y1 - 1989

N2 - A new type of Viterbi decoding algorithm is proposed to realize fast decoding by reducing add-compare-select (ACS) operations, which occupy the dominant part of Viterbi decoding. In the decoding trellis, the branches with low probability to be the correct path are eliminated before decoding based on the detected signal level, which leads to the reduction of merge events in which ACS operation should be done. The reduction rate of the number of ACS operations and the bit-error probability with hard decision are derived for the codes with rate 1/2. It is shown that the number of ACS operations is considerably reduced and that, because of the decrement of the incorrect path, the error performance of the proposed decoding is superior to that of conventional hard-decision Viterbi decoding when the error due to correct path elimination is negligible. Reduced Viterbi decoding reduces the number of ACS operations up to 10% with additional coding gain of 0.6 dB for the code k = 3 and up to about 20% without performance degradation for k = 5.

AB - A new type of Viterbi decoding algorithm is proposed to realize fast decoding by reducing add-compare-select (ACS) operations, which occupy the dominant part of Viterbi decoding. In the decoding trellis, the branches with low probability to be the correct path are eliminated before decoding based on the detected signal level, which leads to the reduction of merge events in which ACS operation should be done. The reduction rate of the number of ACS operations and the bit-error probability with hard decision are derived for the codes with rate 1/2. It is shown that the number of ACS operations is considerably reduced and that, because of the decrement of the incorrect path, the error performance of the proposed decoding is superior to that of conventional hard-decision Viterbi decoding when the error due to correct path elimination is negligible. Reduced Viterbi decoding reduces the number of ACS operations up to 10% with additional coding gain of 0.6 dB for the code k = 3 and up to about 20% without performance degradation for k = 5.

UR - http://www.scopus.com/inward/record.url?scp=0024891381&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024891381&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024891381

VL - 3

SP - 1714

EP - 1718

BT - IEEE Global Telecommunications Conference and Exhibition

A2 - Anon, null

PB - Publ by IEEE

ER -