{"id":"https://openalex.org/W4285036662","doi":"https://doi.org/10.1109/isit50566.2022.9834834","title":"Log-CCDM: Distribution Matching via Multiplication-free Arithmetic Coding","display_name":"Log-CCDM: Distribution Matching via Multiplication-free Arithmetic Coding","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4285036662","doi":"https://doi.org/10.1109/isit50566.2022.9834834"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834834","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834834","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/6f34b25e-8936-4dc4-bc49-d564178ca6a8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036426608","display_name":"Yunus Can G\u00fcltekin","orcid":"https://orcid.org/0000-0002-8551-2851"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Yunus Can G\u00fcltekin","raw_affiliation_strings":["Eindhoven University of Technology,Information and Communication Theory Lab,The Netherlands","Information and Communication Theory Lab, Eindhoven University of Technology, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Information and Communication Theory Lab,The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Information and Communication Theory Lab, Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039843593","display_name":"F.M.J. Willems","orcid":"https://orcid.org/0000-0002-7316-3471"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frans M. J. Willems","raw_affiliation_strings":["Eindhoven University of Technology,Information and Communication Theory Lab,The Netherlands","Information and Communication Theory Lab, Eindhoven University of Technology, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Information and Communication Theory Lab,The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Information and Communication Theory Lab, Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060148074","display_name":"Alex Alvarado","orcid":"https://orcid.org/0000-0002-2172-3051"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alex Alvarado","raw_affiliation_strings":["Eindhoven University of Technology,Information and Communication Theory Lab,The Netherlands","Information and Communication Theory Lab, Eindhoven University of Technology, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology,Information and Communication Theory Lab,The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Information and Communication Theory Lab, Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036426608"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05141252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"55","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.6957467794418335},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.5360413193702698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5160214900970459},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5065466165542603},{"id":"https://openalex.org/keywords/arithmetic-coding","display_name":"Arithmetic coding","score":0.47324544191360474},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4193251430988312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41623321175575256},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3231082558631897},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.3027289807796478},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1799740195274353},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1203673779964447}],"concepts":[{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.6957467794418335},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.5360413193702698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5160214900970459},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5065466165542603},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.47324544191360474},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4193251430988312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41623321175575256},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3231082558631897},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.3027289807796478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1799740195274353},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1203673779964447}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/isit50566.2022.9834834","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834834","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/6f34b25e-8936-4dc4-bc49-d564178ca6a8","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/6f34b25e-8936-4dc4-bc49-d564178ca6a8","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"G\u00fcltekin, Y C, Willems, F M J & Alvarado, A 2022, Log-CCDM: Distribution Matching via Multiplication-free Arithmetic Coding. in 2022 IEEE International Symposium on Information Theory (ISIT). Institute of Electrical and Electronics Engineers, pp. 55-60, 2022 IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, 26/06/22. https://doi.org/10.1109/ISIT50566.2022.9834834","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2207.04040","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2207.04040","pdf_url":"https://arxiv.org/pdf/2207.04040","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:publications/6f34b25e-8936-4dc4-bc49-d564178ca6a8","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85136318368&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"G\u00fcltekin, Y C, Willems, F M J & Alvarado, A 2022, Log-CCDM: Distribution Matching via Multiplication-free Arithmetic Coding. in 2022 IEEE International Symposium on Information Theory (ISIT). Institute of Electrical and Electronics Engineers, pp. 55-60, 2022 IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, 26/06/22. https://doi.org/10.1109/ISIT50566.2022.9834834","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/6f34b25e-8936-4dc4-bc49-d564178ca6a8","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/6f34b25e-8936-4dc4-bc49-d564178ca6a8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT), 55 - 60","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/6f34b25e-8936-4dc4-bc49-d564178ca6a8","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/6f34b25e-8936-4dc4-bc49-d564178ca6a8","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"G\u00fcltekin, Y C, Willems, F M J & Alvarado, A 2022, Log-CCDM: Distribution Matching via Multiplication-free Arithmetic Coding. in 2022 IEEE International Symposium on Information Theory (ISIT). Institute of Electrical and Electronics Engineers, pp. 55-60, 2022 IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, 26/06/22. https://doi.org/10.1109/ISIT50566.2022.9834834","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W616767364","https://openalex.org/W627952176","https://openalex.org/W1557416470","https://openalex.org/W1749807555","https://openalex.org/W1969630647","https://openalex.org/W2035891789","https://openalex.org/W2062726191","https://openalex.org/W2134242233","https://openalex.org/W2165363188","https://openalex.org/W2296257523","https://openalex.org/W2428252953","https://openalex.org/W2505777393","https://openalex.org/W2587138827","https://openalex.org/W2616472444","https://openalex.org/W2885207443","https://openalex.org/W2905065247","https://openalex.org/W2911940095","https://openalex.org/W2936485326","https://openalex.org/W2936658278","https://openalex.org/W2962720164","https://openalex.org/W2982451666","https://openalex.org/W2984693532","https://openalex.org/W3000817679","https://openalex.org/W3008596723","https://openalex.org/W3028046196","https://openalex.org/W3098083521","https://openalex.org/W3099212462","https://openalex.org/W3101426610","https://openalex.org/W3104721349","https://openalex.org/W6633484025"],"related_works":["https://openalex.org/W2131702615","https://openalex.org/W1499106570","https://openalex.org/W2383844503","https://openalex.org/W2098991874","https://openalex.org/W2375774096","https://openalex.org/W3105615783","https://openalex.org/W2391847184","https://openalex.org/W2348596154","https://openalex.org/W2147134344","https://openalex.org/W2057797376"],"abstract_inverted_index":{"Recent":[0],"years":[1],"have":[2],"seen":[3],"renewed":[4],"attention":[5],"to":[6,13,22,38,81,100],"arithmetic":[7,43],"coding":[8],"(AC).":[9],"This":[10],"is":[11,98],"thanks":[12],"the":[14,24,48,83,104,114,125,136],"use":[15],"of":[16,95,116,122,145],"AC":[17],"for":[18],"distribution":[19,27],"matching":[20],"(DM)":[21],"control":[23],"channel":[25],"input":[26,49,105,120],"in":[28],"probabilistic":[29],"amplitude":[30],"shaping.":[31],"There":[32],"are":[33,57,79],"two":[34],"main":[35],"problems":[36,75],"inherent":[37],"AC:":[39],"(1)":[40],"its":[41],"required":[42,93],"precision":[44,94],"grows":[45],"linearly":[46],"with":[47,103],"length,":[50],"and":[51,55,86,90],"(2)":[52],"high-precision":[53,84],"multiplications":[54,85],"divisions":[56,87],"required.":[58],"Here,":[59],"we":[60],"introduce":[61],"a":[62],"multiplication-free":[63],"AC-based":[64],"DM":[65],"technique":[66,112,127],"via":[67],"three":[68],"lookup":[69],"tables":[70],"(LUTs)":[71],"which":[72],"solves":[73],"both":[74],"above.":[76],"These":[77],"LUTs":[78],"used":[80],"approximate":[82,111],"by":[88],"additions":[89],"subtractions.":[91],"The":[92],"our":[96],"approach":[97],"shown":[99],"grow":[101],"logarithmically":[102],"length.":[106],"We":[107],"prove":[108],"that":[109],"this":[110],"maintains":[113],"invertibility":[115],"DM.":[117],"At":[118],"an":[119],"length":[121],"1024":[123],"symbols,":[124],"proposed":[126],"achieves":[128],"negligible":[129],"rate":[130],"loss":[131],"(<":[132],"0.01":[133],"bit/sym)":[134],"against":[135],"full-precision":[137],"DM,":[138],"while":[139],"requiring":[140],"less":[141],"than":[142],"4":[143],"kilobytes":[144],"storage.":[146]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2022-07-12T00:00:00"}