Finite-precision arithmetic coding via index-splitting and probability-fitting

This paper proposes a fitting-by-splitting algorithm (abbreviated as the FS algorithm), which is composed of an index-splitting (IS) algorithm and a probability-fitting (PF) algorithm, to effectively achieve the finite-precision arithmetic coding code named as the FS-AC code. The FS algorithm genera...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied mathematics and computation Ročník 167; číslo 2; s. 976 - 995
Hlavní autoři:	Chan, Din-Yuen, Ku, Cheng-Yuan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY Elsevier Inc 15.08.2005 Elsevier
Témata:	Algebra Algorithmics. Computability. Computer arithmetics Applied sciences Arithmetic coding Binary arithmetic coding Coding, codes Computer science; control theory; systems Exact sciences and technology Index-splitting Information, signal and communications theory Mathematics Number theory Sciences and techniques of general use Signal and communications theory Telecommunications and information theory Theoretical computing Arithmetic coding Binary arithmetic coding Index-splitting Block code Error estimation Applied mathematics Index splitting High precision Probability distribution Binary coding
ISSN:	0096-3003, 1873-5649
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	This paper proposes a fitting-by-splitting algorithm (abbreviated as the FS algorithm), which is composed of an index-splitting (IS) algorithm and a probability-fitting (PF) algorithm, to effectively achieve the finite-precision arithmetic coding code named as the FS-AC code. The FS algorithm generates the FS-AC codes of arbitrarily specified length without the need of post-appended sentinel symbol or pre-affixed side-information bits. Its IS process can split the input symbols into paired indices to make the residual information space be reused as effectively as possible at the end of arithmetically encoding a fixed-precision code. And, the PF process performs after each IS operation for enhancing the reuse efficiency via a fast adaptation process of probability table. Through the integration of IS and PF processes, not only the coding efficiency of proposed finite-precision AC codec can be close to that of unlimited precision AC codec especially for our proposed binary AC codecs. And also, consecutive FS-AC codes can be mutually independent such that the error propagation can be almost blocked to an AC code in problem. Hence, our new AC codecs can be appropriate for generating finite-precision AC codes in the high-speed networks.
AbstractList	This paper proposes a fitting-by-splitting algorithm (abbreviated as the FS algorithm), which is composed of an index-splitting (IS) algorithm and a probability-fitting (PF) algorithm, to effectively achieve the finite-precision arithmetic coding code named as the FS-AC code. The FS algorithm generates the FS-AC codes of arbitrarily specified length without the need of post-appended sentinel symbol or pre-affixed side-information bits. Its IS process can split the input symbols into paired indices to make the residual information space be reused as effectively as possible at the end of arithmetically encoding a fixed-precision code. And, the PF process performs after each IS operation for enhancing the reuse efficiency via a fast adaptation process of probability table. Through the integration of IS and PF processes, not only the coding efficiency of proposed finite-precision AC codec can be close to that of unlimited precision AC codec especially for our proposed binary AC codecs. And also, consecutive FS-AC codes can be mutually independent such that the error propagation can be almost blocked to an AC code in problem. Hence, our new AC codecs can be appropriate for generating finite-precision AC codes in the high-speed networks.
Author	Chan, Din-Yuen Ku, Cheng-Yuan
Author_xml	– sequence: 1 givenname: Din-Yuen surname: Chan fullname: Chan, Din-Yuen email: dychan@mail.ncyu.edu.tw – sequence: 2 givenname: Cheng-Yuan surname: Ku fullname: Ku, Cheng-Yuan email: cooperku@mis.ccu.edu.tw
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17438860$$DView record in Pascal Francis
BookMark	eNp9kE1LAzEQhoMo2Ko_wNtePO462aTJLp6kWBVEL95DNh86pc0uSRD7702pIHjoaeDlfYaZZ05OwxgcIdcUGgpU3K4bvTVNC8AbEA1t2QmZ0U6yeiF4f0pmAL2oGQA7J_OU1gAgBeUz8rrCgNnVU3QGE46h0hHz59ZlNJUZLYaP6gt1hcG67zpNG8x5n-lgqymOgx6wRLvaH_JLcub1Jrmr33lB3lcP78un-uXt8Xl5_1Ib1spcM95xcAs5MG294K7TVrad005CayTTwi8GzmCQraMeRO-pXLS8H3xvmW05uyA3h7WTTkZvfNShXK-miFsdd4pKzrpOQOnRQ8_EMaXo_F8F1N6bWqviTe29KRCqeCuM_McYzDoXNTlq3Bwl7w6kK59_oYsqGXTBOIvFblZ2xCP0D6ZHio8
CODEN	AMHCBQ
CitedBy_id	crossref_primary_10_1088_1674_1056_20_7_070501
Cites_doi	10.1109/18.681345 10.1109/78.403346 10.1109/TIT.1982.1056559 10.1145/214762.214771 10.1109/49.848240 10.1109/TIT.1987.1057285 10.1109/18.259639 10.1147/rd.326.0775 10.1109/5.286189 10.1147/rd.232.0149 10.1147/rd.326.0727 10.1109/76.920188 10.1109/TCOM.1981.1095052 10.1109/18.272486
ContentType	Journal Article
Copyright	2004 Elsevier Inc. 2006 INIST-CNRS
Copyright_xml	– notice: 2004 Elsevier Inc. – notice: 2006 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1016/j.amc.2004.06.123
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Applied Sciences
EISSN	1873-5649
EndPage	995
ExternalDocumentID	17438860 10_1016_j_amc_2004_06_123 S0096300304005430
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO ABAOU ABEFU ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI ADIYS ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AI. AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SES SEW SME SPC SPCBC SSW SSZ T5K TAE TN5 VH1 VOH WH7 WUQ X6Y XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH
ID	FETCH-LOGICAL-c327t-34840e57b3adf64e8ad728eae702c73a6f5b430b72e1f069f175249bf9d3d243
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000232501200015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0096-3003
IngestDate	Mon Jul 21 09:11:24 EDT 2025 Sat Nov 29 02:46:06 EST 2025 Tue Nov 18 21:37:19 EST 2025 Fri Feb 23 02:29:04 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Arithmetic coding Binary arithmetic coding Index-splitting Block code Error estimation Applied mathematics Index splitting High precision Probability distribution Binary coding
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c327t-34840e57b3adf64e8ad728eae702c73a6f5b430b72e1f069f175249bf9d3d243
PageCount	20
ParticipantIDs	pascalfrancis_primary_17438860 crossref_primary_10_1016_j_amc_2004_06_123 crossref_citationtrail_10_1016_j_amc_2004_06_123 elsevier_sciencedirect_doi_10_1016_j_amc_2004_06_123
PublicationCentury	2000
PublicationDate	2005-08-15
PublicationDateYYYYMMDD	2005-08-15
PublicationDate_xml	– month: 08 year: 2005 text: 2005-08-15 day: 15
PublicationDecade	2000
PublicationPlace	New York, NY
PublicationPlace_xml	– name: New York, NY
PublicationTitle	Applied mathematics and computation
PublicationYear	2005
Publisher	Elsevier Inc Elsevier
Publisher_xml	– name: Elsevier Inc – name: Elsevier
References	Howard, Vitter (bib11) 1994; 82 Tjalkens, Willems (bib10) 1987; 33 Boncelet (bib12) 1993; 39 Shannon (bib3) 1948; 27 Elias (bib4) 1963 Teuhola, Raita (bib13) 1994; 40 Chou, Ramchandran (bib9) 2000; 18 Stearns (bib14) 1995; 43 Mitchell, Pennebaker (bib5) 1988; 32 Langdon, Rissanen (bib1) 1979; 23 Witten, Neal, Cleary (bib2) 1987; 30 Langdon, Rissanen (bib6) 1982; IT-28 Moffat, Turpin (bib16) 1998; 44 Chan, Yang, Chen (bib15) 2001; 11 Langdon, Rissanen (bib7) 1981; COM-29 Arps, Truong, Lu, Pasco, Friedman (bib8) 1988; 32 Langdon (10.1016/j.amc.2004.06.123_bib1) 1979; 23 Mitchell (10.1016/j.amc.2004.06.123_bib5) 1988; 32 Howard (10.1016/j.amc.2004.06.123_bib11) 1994; 82 Boncelet (10.1016/j.amc.2004.06.123_bib12) 1993; 39 Shannon (10.1016/j.amc.2004.06.123_bib3) 1948; 27 Chou (10.1016/j.amc.2004.06.123_bib9) 2000; 18 Elias (10.1016/j.amc.2004.06.123_bib4) 1963 Witten (10.1016/j.amc.2004.06.123_bib2) 1987; 30 Langdon (10.1016/j.amc.2004.06.123_bib7) 1981; COM-29 Langdon (10.1016/j.amc.2004.06.123_bib6) 1982; IT-28 Stearns (10.1016/j.amc.2004.06.123_bib14) 1995; 43 Chan (10.1016/j.amc.2004.06.123_bib15) 2001; 11 Arps (10.1016/j.amc.2004.06.123_bib8) 1988; 32 Moffat (10.1016/j.amc.2004.06.123_bib16) 1998; 44 Tjalkens (10.1016/j.amc.2004.06.123_bib10) 1987; 33 Teuhola (10.1016/j.amc.2004.06.123_bib13) 1994; 40
References_xml	– volume: IT-28 start-page: 800 year: 1982 end-page: 803 ident: bib6 article-title: A simple general binary source code publication-title: IEEE Trans. Inf. Theory – volume: 32 start-page: 775 year: 1988 end-page: 795 ident: bib8 article-title: A multi-purpose VLSI chip for adaptive data compression of bilevel images publication-title: IBM J. Res. Dev. – volume: 39 start-page: 1546 year: 1993 end-page: 1554 ident: bib12 article-title: Block arithmetic coding for source compression publication-title: IEEE Trans. Inf. Theory – year: 1963 ident: bib4 publication-title: Information Theory and Coding – volume: COM-29 start-page: 858 year: 1981 end-page: 867 ident: bib7 article-title: Compression of black–white image with arithmetic coding publication-title: IEEE Trans. Commun. – volume: 82 start-page: 857 year: 1994 end-page: 865 ident: bib11 article-title: Arithmetic coding for data compression publication-title: Proc. IEEE – volume: 40 start-page: 219 year: 1994 end-page: 223 ident: bib13 article-title: Arithmetic coding into fixed-length codewords publication-title: IEEE Trans. Inf. Theory – volume: 11 start-page: 581 year: 2001 end-page: 593 ident: bib15 article-title: Effective connected-index finite-length arithmetic codes publication-title: IEEE Trans. Circ. Syst. Video Technol. – volume: 44 start-page: 1650 year: 1998 end-page: 1657 ident: bib16 article-title: Efficient construction of minimum-redundancy codes for large alphabet publication-title: IEEE Trans. Inf. Theory – volume: 30 start-page: 520 year: 1987 end-page: 540 ident: bib2 article-title: Arithmetic coding for data compression, computing practices publication-title: Commun. ACM – volume: 23 start-page: 149 year: 1979 end-page: 162 ident: bib1 article-title: Arithmetic coding publication-title: IBM J. Res. Dev. – volume: 27 start-page: 398 year: 1948 end-page: 403 ident: bib3 article-title: A mathematical theory of communication publication-title: Bell Syst. Tech. J. – volume: 32 start-page: 727 year: 1988 end-page: 736 ident: bib5 article-title: Optimal hardware and software arithmetic coding procedures for the Q-codec publication-title: IBM J. Res. Dev. – volume: 18 start-page: 861 year: 2000 end-page: 867 ident: bib9 article-title: Arithmetic coding-based continuous error detection for efficient ARQ-based image transmission publication-title: IEEE J. Sel. Areas Commun. – volume: 33 start-page: 246 year: 1987 end-page: 257 ident: bib10 article-title: Variable to fixed-length codes for Markov sources publication-title: IEEE Trans. Inf. Theory – volume: 43 start-page: 1847 year: 1995 end-page: 1879 ident: bib14 article-title: Arithmetic coding in lossless waveform compression publication-title: IEEE Trans. Signal Process. – volume: 44 start-page: 1650 issue: 4 year: 1998 ident: 10.1016/j.amc.2004.06.123_bib16 article-title: Efficient construction of minimum-redundancy codes for large alphabet publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.681345 – volume: 43 start-page: 1847 issue: 8 year: 1995 ident: 10.1016/j.amc.2004.06.123_bib14 article-title: Arithmetic coding in lossless waveform compression publication-title: IEEE Trans. Signal Process. doi: 10.1109/78.403346 – year: 1963 ident: 10.1016/j.amc.2004.06.123_bib4 – volume: IT-28 start-page: 800 issue: 5 year: 1982 ident: 10.1016/j.amc.2004.06.123_bib6 article-title: A simple general binary source code publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1982.1056559 – volume: 30 start-page: 520 issue: 6 year: 1987 ident: 10.1016/j.amc.2004.06.123_bib2 article-title: Arithmetic coding for data compression, computing practices publication-title: Commun. ACM doi: 10.1145/214762.214771 – volume: 18 start-page: 861 issue: 6 year: 2000 ident: 10.1016/j.amc.2004.06.123_bib9 article-title: Arithmetic coding-based continuous error detection for efficient ARQ-based image transmission publication-title: IEEE J. Sel. Areas Commun. doi: 10.1109/49.848240 – volume: 33 start-page: 246 issue: 2 year: 1987 ident: 10.1016/j.amc.2004.06.123_bib10 article-title: Variable to fixed-length codes for Markov sources publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1987.1057285 – volume: 39 start-page: 1546 issue: 5 year: 1993 ident: 10.1016/j.amc.2004.06.123_bib12 article-title: Block arithmetic coding for source compression publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.259639 – volume: 27 start-page: 398 issue: July year: 1948 ident: 10.1016/j.amc.2004.06.123_bib3 article-title: A mathematical theory of communication publication-title: Bell Syst. Tech. J. – volume: 32 start-page: 775 issue: 6 year: 1988 ident: 10.1016/j.amc.2004.06.123_bib8 article-title: A multi-purpose VLSI chip for adaptive data compression of bilevel images publication-title: IBM J. Res. Dev. doi: 10.1147/rd.326.0775 – volume: 82 start-page: 857 issue: 6 year: 1994 ident: 10.1016/j.amc.2004.06.123_bib11 article-title: Arithmetic coding for data compression publication-title: Proc. IEEE doi: 10.1109/5.286189 – volume: 23 start-page: 149 issue: 2 year: 1979 ident: 10.1016/j.amc.2004.06.123_bib1 article-title: Arithmetic coding publication-title: IBM J. Res. Dev. doi: 10.1147/rd.232.0149 – volume: 32 start-page: 727 issue: 6 year: 1988 ident: 10.1016/j.amc.2004.06.123_bib5 article-title: Optimal hardware and software arithmetic coding procedures for the Q-codec publication-title: IBM J. Res. Dev. doi: 10.1147/rd.326.0727 – volume: 11 start-page: 581 issue: 5 year: 2001 ident: 10.1016/j.amc.2004.06.123_bib15 article-title: Effective connected-index finite-length arithmetic codes publication-title: IEEE Trans. Circ. Syst. Video Technol. doi: 10.1109/76.920188 – volume: COM-29 start-page: 858 issue: 6 year: 1981 ident: 10.1016/j.amc.2004.06.123_bib7 article-title: Compression of black–white image with arithmetic coding publication-title: IEEE Trans. Commun. doi: 10.1109/TCOM.1981.1095052 – volume: 40 start-page: 219 issue: 1 year: 1994 ident: 10.1016/j.amc.2004.06.123_bib13 article-title: Arithmetic coding into fixed-length codewords publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.272486
SSID	ssj0007614
Score	1.7496012
Snippet	This paper proposes a fitting-by-splitting algorithm (abbreviated as the FS algorithm), which is composed of an index-splitting (IS) algorithm and a...
SourceID	pascalfrancis crossref elsevier
SourceType	Index Database Enrichment Source Publisher
StartPage	976
SubjectTerms	Algebra Algorithmics. Computability. Computer arithmetics Applied sciences Arithmetic coding Binary arithmetic coding Coding, codes Computer science; control theory; systems Exact sciences and technology Index-splitting Information, signal and communications theory Mathematics Number theory Sciences and techniques of general use Signal and communications theory Telecommunications and information theory Theoretical computing
Title	Finite-precision arithmetic coding via index-splitting and probability-fitting
URI	https://dx.doi.org/10.1016/j.amc.2004.06.123
Volume	167
WOSCitedRecordID	wos000232501200015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLfKxgGE-BggxseUAycqo9R24uRYjU0DRMWhSOVCZCc2dFqzqGmr8d_zHNtJWmDAgUsUWc6H_Pv5-T37fSD0MiEsD4G4mEhNMRNK4EQXAsuEqUTSNJIkb4pN8Mkkmc3Sj4PBFx8Ls7ngZZlcXaXVf4Ua2gBsEzr7D3C3L4UGuAfQ4Qqww_WvgD-dGzUSV0tXPWcI1vDq28IEKw7zyyaGZTMXwyZNIq5BB7WezzZhAMzuxlv2O9a2va-8eo110aZ6rX1YXLXePtI_Phs3_gNv5iX-vO7Czd5_smf8qvwK7Y6ZftMhMruoNuzS7oS5ZbsvWVPjQxfSLclqK204CpGenEx53FtyU1tn8ydpbjcWzl-LRZNskplMqyMbnrydOXtnRWv9DI25lSRxeAPtEx6lILj3x29PZu_atZrHNvu7_3t_7t14AO589neay51K1DCftC2E0tNOpvfRXWdWBGNLhwdooMoDdM8BFjgBXh-g2x867B6iyS5Xgo4rgeVKAFwJdrgSAOjBL7jyCE1PT6bHZ9gV2MA5JXyFKQPzXkVcUlHoGCanKDhJlFA8JDmnItaRZDSUnKiRDuNUg64J5rrUaUELwuhjtFdeluoJCpTMwfIYKbAWCjYKqVCMm9RCggkJSmh-iEI_dlnuks-bGigXmfcyPM9guE1RVJaFcQbDfYhetY9UNvPKdZ2ZByRzqqNVCTPg0nWPHW2B133IEefpnzo8Q7e6-fEc7a2Wa_UC3cw3q3m9PHJ0-wFGyZjq
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Finite-precision+arithmetic+coding+via+index-splitting+and+probability-fitting&rft.jtitle=Applied+mathematics+and+computation&rft.au=CHAN%2C+Din-Yuen&rft.au=KU%2C+Cheng-Yuan&rft.date=2005-08-15&rft.pub=Elsevier&rft.issn=0096-3003&rft.volume=167&rft.issue=2&rft.spage=976&rft.epage=995&rft_id=info:doi/10.1016%2Fj.amc.2004.06.123&rft.externalDBID=n%2Fa&rft.externalDocID=17438860
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon