{"id":"https://openalex.org/W2139309946","doi":"https://doi.org/10.1109/jstsp.2015.2403800","title":"A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm","display_name":"A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm","publication_year":2015,"publication_date":"2015-02-13","ids":{"openalex":"https://openalex.org/W2139309946","doi":"https://doi.org/10.1109/jstsp.2015.2403800","mag":"2139309946"},"language":"en","primary_location":{"id":"doi:10.1109/jstsp.2015.2403800","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jstsp.2015.2403800","pdf_url":null,"source":{"id":"https://openalex.org/S42167783","display_name":"IEEE Journal of Selected Topics in Signal Processing","issn_l":"1932-4553","issn":["1932-4553","1941-0484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal of Selected Topics in Signal Processing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1407.1514","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053565922","display_name":"Nikhil Krishnan","orcid":"https://orcid.org/0000-0002-3755-6120"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikhil Krishnan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","[Dept of Electrical & Computer Engg., North Carolina State University, Raleigh, NC, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"[Dept of Electrical & Computer Engg., North Carolina State University, Raleigh, NC, USA]","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037316256","display_name":"Dror Baron","orcid":"https://orcid.org/0000-0002-6371-8496"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dror Baron","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","[Dept of Electrical & Computer Engg., North Carolina State University, Raleigh, NC, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC, USA","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"[Dept of Electrical & Computer Engg., North Carolina State University, Raleigh, NC, USA]","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I137902535"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":2.0931,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.90923022,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"9","issue":"4","first_page":"741","last_page":"748"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.6927512288093567},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6636778712272644},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.6054559946060181},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5035521388053894},{"id":"https://openalex.org/keywords/minimum-description-length","display_name":"Minimum description length","score":0.458418071269989},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4329449236392975},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4219534993171692},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3215143084526062},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2669941782951355},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0792500376701355}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6927512288093567},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6636778712272644},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.6054559946060181},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5035521388053894},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.458418071269989},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4329449236392975},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4219534993171692},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3215143084526062},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2669941782951355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0792500376701355},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/jstsp.2015.2403800","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jstsp.2015.2403800","pdf_url":null,"source":{"id":"https://openalex.org/S42167783","display_name":"IEEE Journal of Selected Topics in Signal Processing","issn_l":"1932-4553","issn":["1932-4553","1941-0484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal of Selected Topics in Signal Processing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1407.1514","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1407.1514","pdf_url":"https://arxiv.org/pdf/1407.1514","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1407.1514","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1407.1514","pdf_url":"https://arxiv.org/pdf/1407.1514","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1488912386","display_name":null,"funder_award_id":"W911NF-04-D-0003","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G8991606357","display_name":"CIF: Small: Universal Signal Estimation from Noisy Measurements","funder_award_id":"1217749","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G940525834","display_name":null,"funder_award_id":"W911NF-14-1-0314","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W86319254","https://openalex.org/W1634005169","https://openalex.org/W1971849009","https://openalex.org/W1996187850","https://openalex.org/W2000287463","https://openalex.org/W2054658115","https://openalex.org/W2068782468","https://openalex.org/W2074922844","https://openalex.org/W2077577877","https://openalex.org/W2099111195","https://openalex.org/W2106084391","https://openalex.org/W2114257671","https://openalex.org/W2114874848","https://openalex.org/W2121999425","https://openalex.org/W2122675611","https://openalex.org/W2129902114","https://openalex.org/W2132573196","https://openalex.org/W2137923603","https://openalex.org/W2148844225","https://openalex.org/W2154605789","https://openalex.org/W2161488606","https://openalex.org/W2163294786","https://openalex.org/W2167507722","https://openalex.org/W2478708596","https://openalex.org/W2752885492","https://openalex.org/W2808343414","https://openalex.org/W2809009512","https://openalex.org/W2809627566","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W6675937107","https://openalex.org/W6677953186","https://openalex.org/W6752446581","https://openalex.org/W6752603504","https://openalex.org/W6752814902"],"related_works":["https://openalex.org/W4298831272","https://openalex.org/W2962916388","https://openalex.org/W2086694237","https://openalex.org/W2095614499","https://openalex.org/W2489956408","https://openalex.org/W349256592","https://openalex.org/W4213307346","https://openalex.org/W2612632602","https://openalex.org/W2321805087","https://openalex.org/W2139309946"],"abstract_inverted_index":{"Computing":[0],"problems":[1],"that":[2,29,188],"handle":[3],"large":[4],"amounts":[5],"of":[6,11,52,63,93,167,175],"data":[7,13,26,202],"necessitate":[8],"the":[9,36,53,58,67,77,86,94,101,108,159,168,173],"use":[10],"lossless":[12,24],"compression":[14,27,68,109,141,160,196,203],"for":[15,165],"efficient":[16],"storage":[17],"and":[18,89,197],"transmission.":[19],"We":[20,157],"present":[21],"a":[22,61,184,192],"novel":[23],"universal":[25,140,201],"algorithm":[28,120,190],"uses":[30],"parallel":[31,98,115],"computational":[32,125],"units":[33,116],"to":[34,74,145,178],"increase":[35],"throughput.":[37],"The":[38],"length-":[39],"N":[40],"input":[41],"sequence":[42],"is":[43,73,117,121,127,131,153],"partitioned":[44],"into":[45],"B":[46,95],"blocks.":[47],"Processing":[48],"each":[49,92],"block":[50],"independently":[51],"other":[54],"blocks":[55,96],"can":[56],"accelerate":[57],"computation":[59],"by":[60,112,161],"factor":[62],"B,":[64],"but":[65],"degrades":[66],"quality.":[69],"Instead,":[70],"our":[71,189],"approach":[72],"first":[75],"estimate":[76],"minimum":[78],"description":[79],"length":[80],"(MDL)":[81],"context":[82,147,169],"tree":[83,148,170],"source":[84,149],"underlying":[85],"entire":[87],"input,":[88],"then":[90],"encode":[91],"in":[97],"based":[99,171],"on":[100,139,172],"MDL":[102],"source.":[103],"With":[104],"this":[105],"two-pass":[106],"approach,":[107],"loss":[110],"incurred":[111],"using":[113,162],"more":[114],"insignificant.":[118],"Our":[119],"work-efficient,":[122],"i.e.,":[123],"its":[124],"complexity":[126],"O(N/B).":[128],"Its":[129],"redundancy":[130],"approximately":[132],"Blog(N/B)":[133],"bits":[134],"above":[135],"Rissanen's":[136],"lower":[137],"bound":[138],"performance,":[142],"with":[143],"respect":[144],"any":[146],"whose":[150],"maximal":[151],"depth":[152],"at":[154],"most":[155],"log(N/B).":[156],"improve":[158],"different":[163],"quantizers":[164],"states":[166],"number":[174],"symbols":[176],"corresponding":[177],"those":[179],"states.":[180],"Numerical":[181],"results":[182],"from":[183],"prototype":[185],"implementation":[186],"suggest":[187],"offers":[191],"better":[193],"trade-off":[194],"between":[195],"throughput":[198],"than":[199],"competing":[200],"algorithms.":[204]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}