{"id":"https://openalex.org/W4376852454","doi":"https://doi.org/10.1145/3573942.3573996","title":"Improved Layered Minimum Sum Decoding Algorithm Based on Overestimation","display_name":"Improved Layered Minimum Sum Decoding Algorithm Based on Overestimation","publication_year":2022,"publication_date":"2022-09-23","ids":{"openalex":"https://openalex.org/W4376852454","doi":"https://doi.org/10.1145/3573942.3573996"},"language":"en","primary_location":{"id":"doi:10.1145/3573942.3573996","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3573942.3573996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 5th International Conference on Artificial Intelligence and Pattern Recognition","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/A5101719680","display_name":"Liu Yu","orcid":"https://orcid.org/0000-0001-5461-2342"},"institutions":[{"id":"https://openalex.org/I4210136859","display_name":"Xi\u2019an University of Posts and Telecommunications","ror":"https://ror.org/04jn0td46","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210136859"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Liu Yu","raw_affiliation_strings":["School of Communication and Information Engineering, Xi'an University of Posts and Telecommunications, China"],"affiliations":[{"raw_affiliation_string":"School of Communication and Information Engineering, Xi'an University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I4210136859"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101797094","display_name":"Lin Bai","orcid":"https://orcid.org/0000-0003-3599-1265"},"institutions":[{"id":"https://openalex.org/I4210136859","display_name":"Xi\u2019an University of Posts and Telecommunications","ror":"https://ror.org/04jn0td46","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210136859"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin Bai","raw_affiliation_strings":["School of Communication and Information Engineering, Xi'an University of Posts and Telecommunications, China"],"affiliations":[{"raw_affiliation_string":"School of Communication and Information Engineering, Xi'an University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I4210136859"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059649853","display_name":"Yaohui Hao","orcid":"https://orcid.org/0000-0002-8852-4911"},"institutions":[{"id":"https://openalex.org/I4210136859","display_name":"Xi\u2019an University of Posts and Telecommunications","ror":"https://ror.org/04jn0td46","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210136859"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yaohui Hao","raw_affiliation_strings":["School of Communication and Information Engineering, Xi'an University of Posts and Telecommunications, China"],"affiliations":[{"raw_affiliation_string":"School of Communication and Information Engineering, Xi'an University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I4210136859"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101719680"],"corresponding_institution_ids":["https://openalex.org/I4210136859"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21933823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1088","last_page":"1092"},"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.9968000054359436,"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.9937000274658203,"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.8862162828445435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.782651424407959},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.7154510021209717},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7109143137931824},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.6400612592697144},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6373156309127808},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6013790965080261},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.595161497592926},{"id":"https://openalex.org/keywords/noisy-channel-coding-theorem","display_name":"Noisy-channel coding theorem","score":0.5609095096588135},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5249626040458679},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.44216668605804443},{"id":"https://openalex.org/keywords/coding-gain","display_name":"Coding gain","score":0.42233455181121826},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4207562506198883},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3547414541244507},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.32485800981521606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3221045732498169},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.16610461473464966},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09092047810554504}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8862162828445435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.782651424407959},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7154510021209717},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7109143137931824},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.6400612592697144},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6373156309127808},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6013790965080261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.595161497592926},{"id":"https://openalex.org/C103073706","wikidata":"https://www.wikidata.org/wiki/Q2345282","display_name":"Noisy-channel coding theorem","level":5,"score":0.5609095096588135},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5249626040458679},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.44216668605804443},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.42233455181121826},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4207562506198883},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3547414541244507},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.32485800981521606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3221045732498169},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.16610461473464966},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09092047810554504},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3573942.3573996","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3573942.3573996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 5th International Conference on Artificial Intelligence and Pattern Recognition","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":7,"referenced_works":["https://openalex.org/W1973712217","https://openalex.org/W2010303399","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2889518184","https://openalex.org/W2979055952","https://openalex.org/W3127432537"],"related_works":["https://openalex.org/W2028976748","https://openalex.org/W2085052822","https://openalex.org/W2160839632","https://openalex.org/W2118148379","https://openalex.org/W2744658369","https://openalex.org/W4210406383","https://openalex.org/W2010303399","https://openalex.org/W4303471944","https://openalex.org/W2159021452","https://openalex.org/W2110262961"],"abstract_inverted_index":{"Quasi-cyclic":[0],"low-density":[1],"parity-check":[2],"(QC-LDPC)":[3],"codes":[4,8],"are":[5],"linear":[6],"block":[7],"with":[9],"performance":[10,55,98],"close":[11],"to":[12,38,57],"the":[13,25,30,35,39,42,46,53,65,85,90,94,96,102,108,114,119],"Shannon":[14],"limit.":[15],"The":[16],"layered":[17,75],"minimum":[18,76],"sum":[19,77],"(LMS)":[20],"decoding":[21,26,54,78,97,120],"algorithm":[22,44,63,79,116],"speeds":[23],"up":[24],"convergence":[27,121],"by":[28,93,123],"layering":[29],"check":[31,68,91],"matrix":[32],"and":[33,51,88,107,126],"updating":[34,64,89],"nodes":[36,92],"according":[37],"layers.":[40],"However,":[41],"MS":[43,62],"has":[45],"problem":[47],"of":[48,61,67,131],"over":[49],"estimation":[50],"affects":[52],"due":[56],"its":[58],"simplified":[59],"strategy":[60],"message":[66],"nodes.":[69],"Therefore,":[70],"this":[71],"paper":[72],"proposes":[73],"a":[74,128],"based":[80],"on":[81],"overestimation.":[82],"By":[83],"setting":[84],"correction":[86],"threshold":[87],"conditions,":[95],"is":[99,105,112],"improved.":[100],"When":[101],"code":[103],"length":[104],"2048":[106],"bit":[109],"error":[110],"rate":[111],",":[113],"proposed":[115],"can":[117],"improve":[118],"speed":[122],"about":[124,132],"25%":[125],"obtain":[127],"coding":[129],"gain":[130],"0.1":[133],"dB.":[134]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}