{"id":"https://openalex.org/W2089489839","doi":"https://doi.org/10.1109/reconfig.2013.6732335","title":"Tree-less Huffman coding algorithm for embedded systems","display_name":"Tree-less Huffman coding algorithm for embedded systems","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2089489839","doi":"https://doi.org/10.1109/reconfig.2013.6732335","mag":"2089489839"},"language":"en","primary_location":{"id":"doi:10.1109/reconfig.2013.6732335","is_oa":false,"landing_page_url":"https://doi.org/10.1109/reconfig.2013.6732335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Reconfigurable Computing and FPGAs (ReConFig)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067019818","display_name":"Marco Antonio Soto Hernandez","orcid":null},"institutions":[{"id":"https://openalex.org/I200362191","display_name":"Universidad Aut\u00f3noma Metropolitana","ror":"https://ror.org/02kta5139","country_code":"MX","type":"education","lineage":["https://openalex.org/I200362191"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"Marco Antonio Soto Hernandez","raw_affiliation_strings":["Unidad Azcapotzalco, Universidad Aut\u00f3noma Metropolitana, M\u00e9xico, D.F., M\u00e9xico","Unidad Azcapotzalco Mexico, Univ. Autonoma Metropolitana, Mexico City, Mexico"],"affiliations":[{"raw_affiliation_string":"Unidad Azcapotzalco, Universidad Aut\u00f3noma Metropolitana, M\u00e9xico, D.F., M\u00e9xico","institution_ids":["https://openalex.org/I200362191"]},{"raw_affiliation_string":"Unidad Azcapotzalco Mexico, Univ. Autonoma Metropolitana, Mexico City, Mexico","institution_ids":["https://openalex.org/I200362191"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065009837","display_name":"Oscar Alvarado-Nava","orcid":null},"institutions":[{"id":"https://openalex.org/I200362191","display_name":"Universidad Aut\u00f3noma Metropolitana","ror":"https://ror.org/02kta5139","country_code":"MX","type":"education","lineage":["https://openalex.org/I200362191"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Oscar Alvarado-Nava","raw_affiliation_strings":["Unidad Azcapotzalco, Universidad Aut\u00f3noma Metropolitana, M\u00e9xico, D.F., M\u00e9xico","Unidad Azcapotzalco Mexico, Univ. Autonoma Metropolitana, Mexico City, Mexico"],"affiliations":[{"raw_affiliation_string":"Unidad Azcapotzalco, Universidad Aut\u00f3noma Metropolitana, M\u00e9xico, D.F., M\u00e9xico","institution_ids":["https://openalex.org/I200362191"]},{"raw_affiliation_string":"Unidad Azcapotzalco Mexico, Univ. Autonoma Metropolitana, Mexico City, Mexico","institution_ids":["https://openalex.org/I200362191"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001777373","display_name":"Eduardo Rodr\u00edguez-Mart\u00ednez","orcid":"https://orcid.org/0000-0002-1878-4304"},"institutions":[{"id":"https://openalex.org/I200362191","display_name":"Universidad Aut\u00f3noma Metropolitana","ror":"https://ror.org/02kta5139","country_code":"MX","type":"education","lineage":["https://openalex.org/I200362191"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Eduardo Rodriguez-Martinez","raw_affiliation_strings":["Universidad Autonoma Metropolitana, Tlalpan, MX","Unidad Azcapotzalco Mexico, Univ. Autonoma Metropolitana, Mexico City, Mexico"],"affiliations":[{"raw_affiliation_string":"Universidad Autonoma Metropolitana, Tlalpan, MX","institution_ids":["https://openalex.org/I200362191"]},{"raw_affiliation_string":"Unidad Azcapotzalco Mexico, Univ. Autonoma Metropolitana, Mexico City, Mexico","institution_ids":["https://openalex.org/I200362191"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064414025","display_name":"Francisco Javier Zaragoza Mart\u00ednez","orcid":"https://orcid.org/0000-0001-7570-1483"},"institutions":[{"id":"https://openalex.org/I200362191","display_name":"Universidad Aut\u00f3noma Metropolitana","ror":"https://ror.org/02kta5139","country_code":"MX","type":"education","lineage":["https://openalex.org/I200362191"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Francisco J. Zaragoza Martinez","raw_affiliation_strings":["Unidad Azcapotzalco, Universidad Aut\u00f3noma Metropolitana, M\u00e9xico, D.F., M\u00e9xico","Unidad Azcapotzalco Mexico, Univ. Autonoma Metropolitana, Mexico City, Mexico"],"affiliations":[{"raw_affiliation_string":"Unidad Azcapotzalco, Universidad Aut\u00f3noma Metropolitana, M\u00e9xico, D.F., M\u00e9xico","institution_ids":["https://openalex.org/I200362191"]},{"raw_affiliation_string":"Unidad Azcapotzalco Mexico, Univ. Autonoma Metropolitana, Mexico City, Mexico","institution_ids":["https://openalex.org/I200362191"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5067019818"],"corresponding_institution_ids":["https://openalex.org/I200362191"],"apc_list":null,"apc_paid":null,"fwci":0.4809,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76636637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9944999814033508,"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"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9793999791145325,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.9880410432815552},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.7500917911529541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.742467999458313},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.7104172110557556},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.6573061943054199},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.6436314582824707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6157785058021545},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5782377123832703},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.5389964580535889},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45951974391937256},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.42584818601608276},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39381957054138184},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3393442630767822},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.22751006484031677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15369749069213867},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.14212825894355774}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9880410432815552},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.7500917911529541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.742467999458313},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.7104172110557556},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.6573061943054199},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.6436314582824707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6157785058021545},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5782377123832703},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5389964580535889},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45951974391937256},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.42584818601608276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39381957054138184},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3393442630767822},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.22751006484031677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15369749069213867},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.14212825894355774},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/reconfig.2013.6732335","is_oa":false,"landing_page_url":"https://doi.org/10.1109/reconfig.2013.6732335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Reconfigurable Computing and FPGAs (ReConFig)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1677584164","https://openalex.org/W1879007731","https://openalex.org/W2011474382","https://openalex.org/W2038490901","https://openalex.org/W2048493282","https://openalex.org/W2075167165","https://openalex.org/W2105028194","https://openalex.org/W2159851953","https://openalex.org/W2163318289","https://openalex.org/W6631368382"],"related_works":["https://openalex.org/W2586352442","https://openalex.org/W2344988652","https://openalex.org/W2355839800","https://openalex.org/W2123072960","https://openalex.org/W1607635215","https://openalex.org/W2351464472","https://openalex.org/W4312628177","https://openalex.org/W2367665007","https://openalex.org/W2914103308","https://openalex.org/W2965391324"],"abstract_inverted_index":{"The":[0],"development":[1],"of":[2,8,19,34,42],"new":[3,20],"technologies":[4],"and":[5,58],"the":[6,32,39,64,70],"increase":[7],"information":[9],"handled":[10],"by":[11,75],"small":[12],"devices":[13],"has":[14],"lead":[15],"to":[16,63],"a":[17,43,60],"variety":[18],"storage":[21],"methods":[22],"which":[23],"heavily":[24],"depend":[25],"on":[26],"compression":[27,46],"algorithms.":[28],"Previously,":[29],"we":[30,52],"demonstrated":[31],"advantages":[33],"using":[35,76],"reconfigurable":[36],"computing":[37],"for":[38],"efficient":[40],"implementation":[41],"Huffman":[44,66],"coding-based":[45],"unit":[47,72],"[1].":[48],"In":[49],"this":[50],"paper":[51],"built":[53],"upon":[54],"our":[55],"last":[56],"design":[57],"propose":[59],"tree-less":[61],"alternative":[62],"traditional":[65],"coding":[67],"algorithm.":[68],"Particularly,":[69],"generation":[71],"is":[73],"enhanced":[74],"precise":[77],"code":[78],"length":[79],"calculations.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}