{"id":"https://openalex.org/W2351578747","doi":null,"title":"A New Efficient Check Node Update Method in LDPC Decoding","display_name":"A New Efficient Check Node Update Method in LDPC Decoding","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2351578747","mag":"2351578747"},"language":"en","primary_location":{"id":"mag:2351578747","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-TXJS201004004.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764611448","display_name":"Communications technology","issn_l":"0884-2272","issn":["0884-2272"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4323237512","host_organization_name":"Access Intelligence","host_organization_lineage":["https://openalex.org/P4323237512"],"host_organization_lineage_names":["Access Intelligence"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Communications technology","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/A5101056587","display_name":"Lu Xin","orcid":"https://orcid.org/0009-0002-7622-3334","observed_orcids":["https://orcid.org/0009-0002-7622-3334"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lu Xin","raw_affiliation_strings":["\u2460,LIANG Yong-sheng\u2460,XU Jun\u2461"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u2460,LIANG Yong-sheng\u2460,XU Jun\u2461","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5101056587"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30032297,"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/ldpc-decoding","display_name":"LDPC decoding","score":0.9959999918937683},{"id":"https://openalex.org/keywords/check-node-update","display_name":"check node update","score":0.9929999709129333},{"id":"https://openalex.org/keywords/min-sum-algorithm","display_name":"min-sum algorithm","score":0.7260000109672546},{"id":"https://openalex.org/keywords/multiplication-reduction","display_name":"multiplication reduction","score":0.5860000252723694},{"id":"https://openalex.org/keywords/log-map-decoding","display_name":"log-MAP decoding","score":0.5820000171661377}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8608630895614624},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.831815242767334},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7832142114639282},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7039461135864258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5350263118743896},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.5180197358131409},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5078738331794739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11034214496612549},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2351578747","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-TXJS201004004.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764611448","display_name":"Communications technology","issn_l":"0884-2272","issn":["0884-2272"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4323237512","host_organization_name":"Access Intelligence","host_organization_lineage":["https://openalex.org/P4323237512"],"host_organization_lineage_names":["Access Intelligence"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Communications technology","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2032527921","https://openalex.org/W4235887681","https://openalex.org/W2070543727","https://openalex.org/W1544557294","https://openalex.org/W7160093999","https://openalex.org/W2804649187","https://openalex.org/W2076217292","https://openalex.org/W2384680951","https://openalex.org/W4410358451","https://openalex.org/W2005982614"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"various":[3],"Min-Sum-related":[4],"LDPC":[5,82,111],"decoding":[6],"algorithms":[7],"and":[8,69,90,105],"their":[9],"typical":[10],"hardware":[11],"architectures":[12],"of":[13,20,27,62,72,79,88,98],"check":[14,24,52],"node":[15,25,53],"update":[16,26,54],"in":[17],"the":[18,31,60,66,70,76,86,94,100],"scenario":[19],"parallel":[21],"implementation.For":[22],"one":[23],"Normalized":[28],"Min-Sum":[29],"algorithm(Nor-MS),if":[30],"current":[32],"row":[33],"weight":[34],"is":[35,55,92],"d":[36,41],"c,d":[37],"cmultiplications":[38],"are":[39,107],"needed.If":[40],"cis":[42],"large,this":[43],"would":[44],"lead":[45],"to":[46],"high":[47,80],"complexity.An":[48],"innovative":[49],"method":[50],"for":[51,65,75,110],"proposed,which":[56],"could":[57],"obviously":[58],"reduce":[59],"number":[61,71],"multiplication":[63],"operations":[64,74],"Nor-MS":[67,89,104],"algorithm":[68,78],"comparison/selection":[73],"Rwm-MS":[77,91,106],"rate":[81],"codes.Simulations":[83],"indicate":[84],"that":[85,97,103],"performance":[87],"almost":[93],"same":[95],"as":[96],"Log-BP,namely":[99],"optimal":[101],"algorithm,and":[102],"good":[108],"choices":[109],"decoding.":[112]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}