000 04477nam a2200577 i 4500
001 6813535
003 IEEE
005 20200413152856.0
006 m eo d
007 cr cn |||m|||a
008 091209s2010 caua foab 000 0 eng d
020 _a9781608451494 (electronic bk.)
020 _z9781608451487 (pbk.)
024 7 _a10.2200/S00222ED1V01Y200911COM004
_2doi
035 _a(CaBNVSL)gtp00537382
035 _a(OCoLC)472455435
040 _aCaBNVSL
_cCaBNVSL
_dCaBNVSL
050 4 _aTK5102.92
_b.B55 2010
082 0 4 _a003.54
_222
100 1 _aBi, Dongsheng.
245 1 0 _aJoint source channel coding using arithmetic codes
_h[electronic resource] /
_cDongsheng Bi, Michael W. Hoffman, and Khalid Sayood.
260 _aSan Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) :
_bMorgan & Claypool Publishers,
_cc2010.
300 _a1 electronic text (viii, 69 p. : ill.) :
_bdigital file.
490 1 _aSynthesis lectures on communications,
_x1932-1708 ;
_v# 4
538 _aMode of access: World Wide Web.
538 _aSystem requirements: Adobe Acrobat reader.
500 _aPart of: Synthesis digital library of engineering and computer science.
500 _aSeries from website.
504 _aIncludes bibliographical references (p. 61-69).
505 0 _a1. 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.
506 1 _aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 _aCompendex
510 0 _aINSPEC
510 0 _aGoogle scholar
510 0 _aGoogle book search
520 3 _aBased 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.
530 _aAlso available in print.
588 _aTitle from PDF t.p. (viewed on December 9, 2009).
650 0 _aCoding theory.
650 0 _aError-correcting codes (Information theory)
653 _aSource coding
653 _aJoing source channel coding
653 _aArithmetic coding
653 _aChannel coding
653 _aDigital communications
700 1 _aHoffman, Michael W.
_q(Michael Ward)
700 1 _aSayood, Khalid.
730 0 _aSynthesis digital library of engineering and computer science.
830 0 _aSynthesis lectures on communications,
_x1932-1708 ;
_v# 4.
856 4 2 _3Abstract with links to resource
_uhttp://ieeexplore.ieee.org/servlet/opac?bknumber=6813535
999 _c561722
_d561722