{"id":"https://openalex.org/W2011019760","doi":"https://doi.org/10.1109/hmwc.2014.7000229","title":"Dynamic decoding algorithms of LDPC codes based on simulated annealing","display_name":"Dynamic decoding algorithms of LDPC codes based on simulated annealing","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2011019760","doi":"https://doi.org/10.1109/hmwc.2014.7000229","mag":"2011019760"},"language":"en","primary_location":{"id":"doi:10.1109/hmwc.2014.7000229","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hmwc.2014.7000229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Workshop on High Mobility Wireless Communications","raw_type":"proceedings-article"},"type":"conference-paper","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/A5083031463","display_name":"Ru Cui","orcid":null},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ru Cui","raw_affiliation_strings":["Department of Electronic and Communications Engineering, Sun Yat-sen University Guangzhou, China","[Department of Electronic and Communications Engineering, Sun Yat-sen University, Guangzhou, China]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Communications Engineering, Sun Yat-sen University Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"[Department of Electronic and Communications Engineering, Sun Yat-sen University, Guangzhou, China]","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044610505","display_name":"Xingcheng Liu","orcid":"https://orcid.org/0000-0003-1836-2205"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xingcheng Liu","raw_affiliation_strings":["Department of Electronic and Communications Engineering, Sun Yat-sen University Guangzhou, China","[Department of Electronic and Communications Engineering, Sun Yat-sen University, Guangzhou, China]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Communications Engineering, Sun Yat-sen University Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]},{"raw_affiliation_string":"[Department of Electronic and Communications Engineering, Sun Yat-sen University, Guangzhou, China]","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157773358"],"apc_list":null,"apc_paid":null,"fwci":0.276,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.42671105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"220","issue":null,"first_page":"135","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9918000102043152,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9585000276565552,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7867239713668823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7219902276992798},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6517789959907532},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6204102635383606},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5912487506866455},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5760995149612427},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.544265866279602},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4496026635169983},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2912164330482483},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.15845987200737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1492190957069397},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09184971451759338}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7867239713668823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7219902276992798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6517789959907532},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6204102635383606},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5912487506866455},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5760995149612427},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.544265866279602},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4496026635169983},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2912164330482483},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.15845987200737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1492190957069397},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09184971451759338}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hmwc.2014.7000229","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hmwc.2014.7000229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 International Workshop on High Mobility Wireless Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1525888637","https://openalex.org/W1964402820","https://openalex.org/W1972492191","https://openalex.org/W1982757705","https://openalex.org/W2024060531","https://openalex.org/W2126419525","https://openalex.org/W2128765501","https://openalex.org/W2132538409","https://openalex.org/W2134502194","https://openalex.org/W2137813581","https://openalex.org/W2138308684","https://openalex.org/W2167447976","https://openalex.org/W2949747623","https://openalex.org/W6631424144"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2903058006"],"abstract_inverted_index":{"The":[0],"dynamic":[1,25,39,81,88,97],"scheduling":[2,60,98],"(DS)":[3],"strategy":[4,90],"based":[5,93],"decoding":[6,40,59],"algorithm":[7,41,110,131,137],"for":[8],"low-density":[9],"parity-check":[10],"(LDPC)":[11],"codes":[12],"is":[13,36,42,52,74,91,106],"explored":[14],"from":[15],"a":[16,43,85,120],"novel":[17],"point":[18],"of":[19,24,138],"view.":[20],"In":[21],"the":[22,38,47,50,67,69,95,102,108,113,129],"view":[23],"selection":[26,89],"strategies,":[27],"intelligent":[28],"search":[29],"algorithms":[30],"are":[31],"taken":[32],"into":[33],"consideration.":[34],"As":[35],"known,":[37],"greedy":[44],"one,":[45],"where":[46],"message":[48],"with":[49,66],"maximal-residual":[51],"always":[53],"propagated,":[54],"which":[55],"causes":[56],"unfairness":[57],"in":[58,80],"when":[61],"updating":[62],"messages.":[63],"To":[64],"cope":[65],"problem,":[68],"simulated":[70],"annealing":[71],"(SA)":[72],"method":[73],"first":[75],"introduced":[76],"to":[77,122],"provide":[78],"assistance":[79],"scheduling-based":[82],"decoding.":[83],"Then,":[84],"more":[86],"accurate":[87],"presented":[92],"on":[94],"SA-assisted":[96],"strategy,":[99],"SA-DS.":[100],"When":[101],"Metroplis":[103],"acceptance":[104],"criterion":[105],"satisfied,":[107],"SA-DS":[109],"can":[111],"select":[112],"most":[114],"unreliable":[115],"node":[116],"accurately":[117],"and":[118],"give":[119],"priority":[121],"update":[123],"it.":[124],"Simulation":[125],"results":[126],"demonstrate":[127],"that":[128],"proposed":[130],"behaves":[132],"better":[133],"than":[134],"any":[135],"other":[136],"interests.":[139]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}