Joint source channel coding using arithmetic codes /
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | eBook |
| Language: | English |
| Published: |
[San Rafael, Calif.] :
Morgan & Claypool Publishers,
[2010]
|
| Series: | Synthesis lectures on communications ;
#4. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
| Abstract: | 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. |
|---|---|
| Item Description: | Title from PDF title page (Morgan & Claypool, viewed on Dec. 3, 2009). Electronic resource. |
| Physical Description: | 1 online resource (viii, 69 pages) : illustrations |
| Bibliography: | Includes bibliographical references (pages 61-69). |
| ISBN: | 9781608451494 (ebook) 1608451496 (ebook) 9781608451487 (pbk.) 1608451488 (pbk.) |
| ISSN: | 1932-1708 ; |