| 書目名稱 | Joint Source Channel Coding Using Arithmetic Codes |
| 編輯 | Dongsheng Bi,Michael W. Hoffman,Khalid Sayood |
| 視頻video | http://file.papertrans.cn/502/501162/501162.mp4 |
| 叢書名稱 | Synthesis Lectures on Communications |
| 圖書封面 |  |
| 描述 | 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. The finite state machine interpretation can be easily migrated to Markov source case. We can encode Markov sources without considering the conditional probabilities, while using the list Viterbi decoding algorithm which utilizes the conditional probabilities. We can also use context-based arithmetic coding to exploit the conditional probabilities of the Markov source and apply a finite state machine interpretation to this problem.The finite state machine interpretation also allo |
| 出版日期 | Book 2010 |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-031-01675-2 |
| isbn_softcover | 978-3-031-00547-3 |
| isbn_ebook | 978-3-031-01675-2Series ISSN 1932-1244 Series E-ISSN 1932-1708 |
| issn_series | 1932-1244 |
| copyright | Springer Nature Switzerland AG 2010 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網安備110108008328)
GMT+8, 2025-10-6 12:42
發(fā)表于 2025-3-21 16:50:50
