
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A New Viterbi Algorithm with Adaptive Path Reduction Method
Takaya YAMAZATO Iwao SASASE Shinsaku MORI
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E76A
No.9
pp.14221429 Publication Date: 1993/09/25
Online ISSN:
DOI:
Print ISSN: 09168508 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Keyword: Viterbi algorithm, reduced computation method, adaptive decoding system,
Full Text: PDF(668.5KB)>>
Summary:
A new Viterbi algorithm with adaptive path reduction method is presented. The proposed system consists of the predecoder and reduced path Virerbi decoder. The predecoder separates the mixed channel noise from the received sequence. The number of errors in the predecoded error sequence is counted and the path reduction is implemented by the number of errors in predecoded error sequence. The path reduction is implemented as a function of channel condition because the errors in the predecoded error sequence can be considered as the channel error sequence. Due to the reduction of the path, the number of ACS (add compare select) operations can be reduced, which occupies the dominant part in Viterbi decoding. The ACS reduction ratio for the proposed system achieves up to 30% for the case of (2, 1, 2) Ungerboeck code without degradation of the error performance.

