Hidden Bibliographic Details
| Other authors / contributors: | Hoffman, Michael W. (Michael Ward)
Sayood, Khalid.
|
|---|
| ISBN: | 9781608451494 (electronic bk.)
9781608451487 (pbk.)
|
|---|
| Notes: | Title from PDF t.p. (viewed on December 9, 2009).
Series from website.
Includes bibliographical references (p. 61-69).
Abstract freely available; full-text restricted to subscribers or individual document purchasers.
Also available in print.
Mode of access: World Wide Web.
System requirements: Adobe Acrobat reader.
|
|---|
| Summary: | Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden symbols. If a limit is imposed on the maximum value of a key parameter in the encoder, this modified arithmetic encoder can also be modeled as a finite state machine and the code generated can be treated as a variable-length trellis code.The number of states used can be reduced and techniques used for decoding convolutional codes, such as the list Viterbi decoding algorithm, can be applied directly on the trellis.
|
|---|
| Standard no.: | 10.2200/S00222ED1V01Y200911COM004
|
|---|
