{"id":"https://openalex.org/W2371893395","doi":null,"title":"A Study on Low Complexity Decoding Algorithm of LDPC Codes","display_name":"A Study on Low Complexity Decoding Algorithm of LDPC Codes","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2371893395","mag":"2371893395"},"language":"en","primary_location":{"id":"mag:2371893395","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTotal-JSJA200607004.htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computer Science","raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5100741983","display_name":"Yong Deng","orcid":"https://orcid.org/0000-0001-9286-2123","observed_orcids":["https://orcid.org/0000-0001-9286-2123","https://orcid.org/0000-0002-5481-5673","https://orcid.org/0000-0001-6319-3039"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yong Deng","raw_affiliation_strings":["-Qiang ZHU Guang-Xi LIU Wen-Ming"],"raw_orcid":"https://orcid.org/0000-0001-9286-2123","affiliations":[{"raw_affiliation_string":"-Qiang ZHU Guang-Xi LIU Wen-Ming","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5100741983"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40739171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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/T11130","display_name":"Coding theory and cryptography","score":0.0,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-codes","display_name":"LDPC codes","score":0.9900000095367432},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"belief propagation","score":0.6930000185966492},{"id":"https://openalex.org/keywords/low-complexity-decoding","display_name":"low-complexity decoding","score":0.7639999985694885},{"id":"https://openalex.org/keywords/message-dissemination","display_name":"message dissemination","score":0.7760000228881836},{"id":"https://openalex.org/keywords/decoding-performance","display_name":"decoding performance","score":0.6809999942779541}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8574678897857666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7721813917160034},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7709531784057617},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.7593406438827515},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7427115440368652},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7344038486480713},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.6862236261367798},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5841745734214783},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5762332081794739},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5069570541381836},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46457988023757935},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.41593247652053833},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.1831786036491394},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.17557421326637268},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1574949026107788},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.12547221779823303},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1057160496711731},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2371893395","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTotal-JSJA200607004.htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computer Science","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2106520586","https://openalex.org/W2591644370","https://openalex.org/W1539495894","https://openalex.org/W2944806087","https://openalex.org/W270733581","https://openalex.org/W2386270141","https://openalex.org/W2010303399","https://openalex.org/W2041791209","https://openalex.org/W2394364986","https://openalex.org/W2978752534"],"abstract_inverted_index":{"In":[0,31],"this":[1,47],"paper,the":[2],"decoding":[3,12,51,84],"algorithm":[4,13,55,109,118,127,132],"of":[5,23,37,62,90,101,107,115],"low-density":[6],"parity-check(LDPC)codes":[7],"is":[8,29,72,110],"analyzed,and":[9],"a":[10],"new":[11,54,108,126],"based":[14],"on":[15],"the":[16,21,26,32,50,67,75,83,88,105,120,125],"belief":[17],"propagation(BP)algorithm":[18],"to":[19,44],"eliminate":[20],"influence":[22],"cycles":[24,36],"in":[25,119,133],"factor":[27,38],"graph":[28,39],"proposed.":[30],"traditional":[33,116,130],"BP":[34,117,131],"algorithm,the":[35],"will":[40,48,77],"send":[41],"message":[42,71,76,89],"back":[43],"its":[45],"source,and":[46],"decrease":[49],"performance.":[52],"The":[53],"records":[56],"each":[57,63],"cycle\u2019s":[58],"path":[59,68],"and":[60,124],"length":[61],"node,and":[64],"cuts":[65],"off":[66],"by":[69,86],"which":[70],"propagated":[73,94],"when":[74],"come":[78],"back.":[79],"It":[80],"can":[81],"advance":[82],"performance":[85,106],"protect":[87],"good":[91,134],"quality":[92],"be":[93],"as":[95,97],"widely":[96],"possible.":[98],"Our":[99],"results":[100],"simulation":[102],"show":[103],"that":[104,114],"not":[111],"worse":[112],"than":[113],"low":[121],"SNR":[122],"channel":[123,135],"significantly":[128],"outperform":[129],"condition.":[136]},"counts_by_year":[],"updated_date":"2026-10-17T09:40:24.721904","created_date":"2016-06-24T00:00:00"}