Improved Binary DAC Codec with Spectrum for Equiprobable Sources
Slepian-Wolf coding (SWC) can be effectively implemented by distributed arithmetic coding (DAC) codes. A theoretical tool named spectrum has been developed to analyze the complexity of the full-search binary DAC (BDAC) decoder for equiprobable sources. Following this work, this paper aims at improvi...
Uloženo v:
| Vydáno v: | IEEE transactions on communications Ročník 62; číslo 1; s. 256 - 268 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.01.2014
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 0090-6778, 1558-0857 |
| 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 | Slepian-Wolf coding (SWC) can be effectively implemented by distributed arithmetic coding (DAC) codes. A theoretical tool named spectrum has been developed to analyze the complexity of the full-search binary DAC (BDAC) decoder for equiprobable sources. Following this work, this paper aims at improving the coding efficiency of BDAC codes. To achieve this goal, this paper analyzes how BDAC codes partition source space into codebooks and links codebook cardinalities with the initial spectrum. Further, by exploiting the final spectrum, this paper proves that the decoding error probability of BDAC codes will not tend to zero as code length goes to infinity, even at rates greater than the Slepian-Wolf limit. On the basis of theoretical analyses, two techniques are proposed to reduce the decoding error probability of BDAC codes, i.e., the permutation technique, which removes "near" (in the sense of Hamming distance) codewords in each codebook, and the weighted branching technique, which reduces the mis-pruning risk of proper paths during the decoding. The effectiveness of both techniques is well verified by experimental results. |
|---|---|
| AbstractList | Slepian-Wolf coding (SWC) can be effectively implemented by distributed arithmetic coding (DAC) codes. A theoretical tool named spectrum has been developed to analyze the complexity of the full-search binary DAC (BDAC) decoder for equiprobable sources. Following this work, this paper aims at improving the coding efficiency of BDAC codes. To achieve this goal, this paper analyzes how BDAC codes partition source space into codebooks and links codebook cardinalities with the initial spectrum. Further, by exploiting the final spectrum, this paper proves that the decoding error probability of BDAC codes will not tend to zero as code length goes to infinity, even at rates greater than the Slepian-Wolf limit. On the basis of theoretical analyses, two techniques are proposed to reduce the decoding error probability of BDAC codes, i.e., the permutation technique, which removes "near" (in the sense of Hamming distance) codewords in each codebook, and the weighted branching technique, which reduces the mis-pruning risk of proper paths during the decoding. The effectiveness of both techniques is well verified by experimental results. |
| Author | Yong Fang Liang Chen |
| Author_xml | – sequence: 1 givenname: Yong surname: Fang fullname: Fang, Yong – sequence: 2 givenname: Liang surname: Chen fullname: Chen, Liang |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28203675$$DView record in Pascal Francis |
| BookMark | eNqNkUFP3DAUhK2KSl2W_gIullAlLqHPdhzHlwpIaYsE4sBythznRfUqmyx2QtV_Xy_ZctgTpydL34xHM8fkqB96JIQyuGAM9NdV9XB_f8GBifTmxe5wULr4QBZMyjKDUqojsgDQkBVKlZ_IcYxrAMhBiAW5vN1sw_CCDb32vQ1_6ferilZDg47-8eNv-rhFN4ZpQ9sh0JvnySe6tnWH9HGYgsN4Qj62tov4eX-X5OnHzar6ld09_Lytru4yJxSMmcRSCVYK5XKrWS2bXNYoWwmNFdxZq5tc16JRLaBVirlaC1A2F6hFwYArsSTns28K8DxhHM3GR4ddZ3scpmiY5KCF5q_o2QG6Tln7lC5RkKdWilwn6suestHZrg22dz6abfCb1IPhJQdRKJm4bzPnwhBjwNY4P9rRD_0YrO8MA7MbwrwOYXZDmHkIMw-RDMoDg_9_vEN6Oks9Ir7JikKlVrT4B_CdlX4 |
| CODEN | IECMBT |
| CitedBy_id | crossref_primary_10_1109_TIT_2020_3014965 crossref_primary_10_1109_LCOMM_2022_3219122 crossref_primary_10_1109_TIT_2022_3221289 crossref_primary_10_1109_TIT_2021_3116082 crossref_primary_10_3390_e25030437 crossref_primary_10_1109_TIT_2024_3421253 crossref_primary_10_1109_LSP_2017_2705250 crossref_primary_10_1109_TCOMM_2016_2518680 crossref_primary_10_1016_j_image_2019_03_016 crossref_primary_10_1109_TCOMM_2016_2599535 crossref_primary_10_1109_LCOMM_2021_3114591 |
| Cites_doi | 10.1109/MMSP.2007.4412830 10.1109/ICIP.2010.5652684 10.1109/LCOMM.2002.804244 10.1109/TCOMM.2013.012913.120486 10.1109/TIT.1973.1055037 10.1016/j.sigpro.2006.03.012 10.1145/214762.214771 10.1109/LCOMM.2007.071172 10.1109/4234.957380 10.1109/TIT.1976.1055508 10.1109/TSP.2009.2014280 10.1109/TSP.2009.2023359 10.1109/ICIP.2007.4379079 10.1109/ICIP.2008.4711958 10.1109/LCOMM.2008.080645 10.1109/LSP.2009.2030099 |
| ContentType | Journal Article |
| Copyright | 2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2014 |
| Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2014 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SP 8FD L7M F28 FR3 |
| DOI | 10.1109/TCOMM.2013.112613.120796 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Engineering Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Applied Sciences |
| EISSN | 1558-0857 |
| EndPage | 268 |
| ExternalDocumentID | 3237916751 28203675 10_1109_TCOMM_2013_112613_120796 6679369 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 ZCA ZCG AAYXX CITATION AAYOK IQODW RIG 7SP 8FD L7M F28 FR3 |
| ID | FETCH-LOGICAL-c370t-5e8731837c4a91b5d45be5f50da32caa9d49b3d7f0ea771cb9307a43e93610273 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 16 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000330622000022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0090-6778 |
| IngestDate | Sun Nov 09 11:21:56 EST 2025 Mon Jun 30 10:09:33 EDT 2025 Wed Apr 02 07:20:27 EDT 2025 Sat Nov 29 01:41:33 EST 2025 Tue Nov 18 22:23:58 EST 2025 Wed Aug 27 02:49:10 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Performance evaluation distributed arithmetic coding Hamming distance Error probability Pruning algorithm weighted branching Slepian-Wolf coding Decoding Implementation Codec Codebook Coding spectrum Arithmetic code permutation |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c370t-5e8731837c4a91b5d45be5f50da32caa9d49b3d7f0ea771cb9307a43e93610273 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 1504558649 |
| PQPubID | 85472 |
| PageCount | 13 |
| ParticipantIDs | proquest_journals_1504558649 proquest_miscellaneous_1520939227 crossref_citationtrail_10_1109_TCOMM_2013_112613_120796 crossref_primary_10_1109_TCOMM_2013_112613_120796 pascalfrancis_primary_28203675 ieee_primary_6679369 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-January 2014-01-00 2014 20140101 |
| PublicationDateYYYYMMDD | 2014-01-01 |
| PublicationDate_xml | – month: 01 year: 2014 text: 2014-January |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on communications |
| PublicationTitleAbbrev | TCOMM |
| PublicationYear | 2014 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 (ref18) 0 ref12 ref14 ref11 ref10 ref2 ref1 gamal (ref15) 2012 ref17 ref16 (ref19) 0 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – year: 2012 ident: ref15 publication-title: Network Information Theory – ident: ref9 doi: 10.1109/MMSP.2007.4412830 – ident: ref12 doi: 10.1109/ICIP.2010.5652684 – ident: ref4 doi: 10.1109/LCOMM.2002.804244 – ident: ref14 doi: 10.1109/TCOMM.2013.012913.120486 – ident: ref1 doi: 10.1109/TIT.1973.1055037 – ident: ref17 doi: 10.1016/j.sigpro.2006.03.012 – year: 0 ident: ref19 – ident: ref16 doi: 10.1145/214762.214771 – ident: ref5 doi: 10.1109/LCOMM.2007.071172 – ident: ref3 doi: 10.1109/4234.957380 – ident: ref2 doi: 10.1109/TIT.1976.1055508 – ident: ref6 doi: 10.1109/TSP.2009.2014280 – ident: ref8 doi: 10.1109/TSP.2009.2023359 – ident: ref7 doi: 10.1109/ICIP.2007.4379079 – ident: ref11 doi: 10.1109/ICIP.2008.4711958 – year: 0 ident: ref18 – ident: ref10 doi: 10.1109/LCOMM.2008.080645 – ident: ref13 doi: 10.1109/LSP.2009.2030099 |
| SSID | ssj0004033 |
| Score | 2.189062 |
| Snippet | Slepian-Wolf coding (SWC) can be effectively implemented by distributed arithmetic coding (DAC) codes. A theoretical tool named spectrum has been developed to... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 256 |
| SubjectTerms | Applied sciences Arithmetic coding Codes Coding Coding, codes Complexity theory Decoding distributed arithmetic coding Encoding Error analysis Error detection Error probability Exact sciences and technology Hamming distance Indexes Infinity Information, signal and communications theory permutation Permutations Probability Random variables Signal and communications theory Slepian-Wolf coding spectrum Telecommunications and information theory weighted branching |
| Title | Improved Binary DAC Codec with Spectrum for Equiprobable Sources |
| URI | https://ieeexplore.ieee.org/document/6679369 https://www.proquest.com/docview/1504558649 https://www.proquest.com/docview/1520939227 |
| Volume | 62 |
| WOSCitedRecordID | wos000330622000022&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0857 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004033 issn: 0090-6778 databaseCode: RIE dateStart: 19720101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB4tKw5w6IOH2HaLjMSRgJPYa_tW2O6qlwUkQOIWOfZEQoLddh_9_fU42RQEB3pKJNuKNeOJx-OZ7wM4dhVmJpy7CPlRE6i2THRqdVKhL4XCUpuBi2QT6vJS39-b6w6ctLUwiBiTz_CUXuNdvp-5FYXKiLmP-Oc2YEOpQV2r9a8GkucN4iSlsyu9ztrh5ux2eDWZUBZXHgtm6JFxRTD9z7aiyK1CmZF2EYRT1awWr37QcdcZf_y_-X6CD413yc7r5fAZOjjdge1nmIO78L0OI6BnF7EUl_04H7LhzKNjFJNlREi_nK-eWPBm2ej36oEoZ6i-it3EOP9iD-7Go9vhz6ShUUhcrvgykagVWa5ywpq0lF7IEmUlubd55qw1Xpgy96riaJVKXWmC3VuRY5h7SnA3-9CdzqZ4AGyApSgz7jObB016b3KN5DRIrExwJG0P1FqihWswxonq4rGIZw1uiqiLgnRR1Looal30IG1H_qpxNt4xZpdk3vZvxN2DwxdKbNvD6TLs10r2oL_WatFY7KIIjrGQUg9EGH_UNgdbowsUO8XZivpk3ASHMlNf3v70V9gK0xR1iKYP3aAu_Aab7s_yYTE_jAv2L9Zm5E8 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1RTxQxEJ4gmigPioLhFKEmPLrQ3W2v7Zt4QjBypwlnwlvTbWcTErhT7o7fT6e7t0D0AZ92k7bZZqaznU5nvg9gz9dYmHjuIuRHTaDaMtO501mNoRIKK236PpFNqNFIn5-bnyvwqauFQcSUfIb79Jru8sPULyhURsx9xD_3BJ5KEc89TbXWXRUkL1vMSUpoV3qZt8PNwXjwYzikPK4ylczQo-CKgPrvbUaJXYVyI90siqdueC3--kWnfef41f_NeB1etv4lO2wWxGtYwckbWLuHOrgBn5tAAgb2JRXjsq-HAzaYBvSMorKMKOnn14srFv1ZdvRncUGkM1Rhxc5SpH-2Cb-Oj8aDk6wlUsh8qfg8k6gV2a7ywpm8kkHICmUteXBl4Z0zQZiqDKrm6JTKfWWi5TtRYpx7ToA3b2F1Mp3gFrA-VqIqeChcGXUZgik1ktsgsTbRlXQ9UEuJWt-ijBPZxaVNpw1ubNKFJV3YRhe20UUP8m7k7wZp4xFjNkjmXf9W3D3YeaDErj2eL-OOrWQPtpdata3Nzmx0jYWUui_i-I9dc7Q2ukJxE5wuqE_BTXQpC_Xu35_ehecn4-GpPf02-v4eXsQpiyZgsw2rUXX4AZ75m_nF7HonLd5b34Xnlg |
| 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=Improved+Binary+DAC+Codec+with+Spectrum+for+Equiprobable+Sources&rft.jtitle=IEEE+transactions+on+communications&rft.au=YONG+FANG&rft.au=LIANG+CHEN&rft.date=2014&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=0090-6778&rft.volume=62&rft.issue=1&rft.spage=256&rft.epage=268&rft_id=info:doi/10.1109%2FTCOMM.2013.112613.120796&rft.externalDBID=n%2Fa&rft.externalDocID=28203675 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon |