Horizon Portail d'Information

Ressources numériques

Recherche rapide

Recherche avancée

Recherche alphabétique

Modifier la recherche

Joint source channel coding using arithmetic codes , Dongsheng Bi, Michael W. Hoffman, and Khalid Sayood

[San Rafael, Calif.] , Morgan & Claypool Publishers -- cop. 2010

1 vol. (viii-69 p.) : ill. ; 24 cm.

Synthesis lectures on communications , 1932-1244 ; #4

978-1-60845-148-7 , br

Bibliogr. (p. 61-69)

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

1. Introduction ; Introduction ; Joint source and channel coding schemes ; Joint source and channel coding with arithmetic codes ; 2. Arithmetic codes ; Encoding and decoding processes ; Integer implementation of encoding and decoding with renormalization ; Encoding with integer arithmetic ; Decoding with integer arithmetic ; Overflow and underflow problems ; Optimality of arithmetic coding ; Arithmetic codes are prefix codes ; Efficiency ; Efficiency of the integer implementation ; 3. Arithmetic codes with forbidden symbols ; Error detection and correction using arithmetic codes ; Reserved probability space and code rate ; Error detection capability ; Error correction with arithmetic codes ; Viewing arithmetic codes as fixed trellis codes ; Encoding ; Decoding ; Simulations with an iid source ; Simulations with Markov sources ; Comparing scenario (a) and (b) ; Comparing scenario (b) and (c) ; 4. Distance property and code construction ; Distance property of arithmetic codes ; Bound on error events ; Using the bound to get estimate of error probability ; Determining the multiplicity Am, l ; Verification ; Complexity factors and freedom in the code design ; Complexity factors ; Freedom in the code design ; Arithmetic codes with input memory ; Memory one arithmetic codes with forbidden symbols ; Memory two arithmetic codes with forbidden symbols ; Memory three arithmetic codes with forbidden symbols ; 5. Conclusion ; Bibliography

Codes correcteurs d'erreurs (théorie de l'information)

Error-correcting codes (Information theory)

Pour toute question, contactez la bibliothèque

Horizon Information Portal 3.25_france_v1m© 2001-2019 SirsiDynix Tous droits réservés.

Horizon Portail d'Information