Joint Source Channel Coding Using Arithmetic Codes(1st Edition)
Authors:
Dongsheng Bi ,Michael W. Hoffman ,Khalid Sayood
In Stock
Shipment time
Expected shipping within 2 DaysPopular items with books
Total Price:
$0
Solution Manual Includes
Price:
$9.99
Book details
ISBN: 1608451488, 978-1608451487
Book publisher: Morgan & Claypool
Book 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. 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 allows us to more systematically understand arithmetic codes with forbidden symbols. It allows us to find the partial distance spectrum of arithmetic codes with forbidden symbols. We also propose arithmetic codes with memories which use high memory but low implementation precision arithmetic codes. The low implementation precision results in a state machine with less complexity. The introduced input memories allow us to switch the probability functions used for arithmetic coding. Combining these two methods give us a huge parameter space of the arithmetic codes with forbidden symbols. Hence we can choose codes with better distance properties while maintaining the encoding efficiency and decoding complexity. A construction and search method is proposed and simulation results show that we can achieve a similar performance as turbo codes when we apply this approach to rate 2/3 arithmetic codes. Table of Contents: Introduction / Arithmetic Codes / Arithmetic Codes with Forbidden Symbols / Distance Property and Code Construction / Conclusion
Customers also bought these books
The Birds The Bees And The Berenstain Bears - 1st Edition
Stan Berenstain
ISBN: 0679889590, 978-0679889595
$0 $4.99Frequently Bought Together
Corporate Communication A Guide To Theory And Practice - 7th Edition
Joep P. Cornelissen
ISBN: 1529600022, 978-1529600025
$0 $144.99
Chemistry The Central Science Global Edition - 13th Edition
H. Eugene H. Lemay
ISBN: 1292057718, 9781292057712
$0 $44.00
Operations Management Creating Value Along the Supply Chain - 1st Canadian Edition
Roberta S. Russell
ISBN: 978-1-118-3011, 1118942051, 1118942055, 978-1118301173
$0 $32.03
Off Grid Solar Power Simplified For Rvs Vans Cabins Boats And Tiny Homes - 1st Edition
Nick Seghers
ISBN: B0BT7DZTN1, 979-8375486901
$0 $99.99
Saving The Family Cottage A Guide To Succession Planning For Your Cottage Cabin Camp Or Vacation Home - 4th Edition
Stuart Hollander
ISBN: 141331841X, 978-1413318418
$0 $16.00
The Ministry Of Utmost Happiness - 1st Edition
Arundhati Roy
ISBN: 052543481X, 978-0525434818
$0 $13.99Top Reviews for Books
