{"id":"https://openalex.org/W2119858605","doi":"https://doi.org/10.1109/isit.2009.5205781","title":"New group shuffled BP decoding algorithms for LDPC codes","display_name":"New group shuffled BP decoding algorithms for LDPC codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2119858605","doi":"https://doi.org/10.1109/isit.2009.5205781","mag":"2119858605"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5056955980","display_name":"Chi-Yuan Chang","orcid":"https://orcid.org/0000-0003-0843-755X"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chi-Yuan Chang","raw_affiliation_strings":["Department of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan","Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, TAIWAN"],"affiliations":[{"raw_affiliation_string":"Department of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, TAIWAN","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101723559","display_name":"Yu\u2010Liang Chen","orcid":"https://orcid.org/0000-0003-0516-0057"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yu-Liang Chen","raw_affiliation_strings":["Department of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan","Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, TAIWAN"],"affiliations":[{"raw_affiliation_string":"Department of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, TAIWAN","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082656742","display_name":"Chang-Ming Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chang-Ming Lee","raw_affiliation_strings":["Department of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan","Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, TAIWAN"],"affiliations":[{"raw_affiliation_string":"Department of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, TAIWAN","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074556801","display_name":"Yu T. Su","orcid":"https://orcid.org/0000-0002-2026-2994"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yu T. Su","raw_affiliation_strings":["Department of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan","Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, TAIWAN"],"affiliations":[{"raw_affiliation_string":"Department of Communications Engineering, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Department of Communications Engineering, National Chiao Tung University, Hsinchu, 30056, TAIWAN","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5056955980"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.17098091,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1664","last_page":"1668"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9987999796867371,"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.9797999858856201,"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.7450282573699951},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6799717545509338},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6169085502624512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5792384147644043},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5595991611480713},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.5361760854721069},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4652118980884552},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.45020216703414917},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3221474885940552},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.19787582755088806},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.09759122133255005}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7450282573699951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6799717545509338},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6169085502624512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5792384147644043},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5595991611480713},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.5361760854721069},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4652118980884552},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.45020216703414917},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3221474885940552},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.19787582755088806},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.09759122133255005},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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":19,"referenced_works":["https://openalex.org/W1956090263","https://openalex.org/W1982723213","https://openalex.org/W2101147641","https://openalex.org/W2123530431","https://openalex.org/W2126419525","https://openalex.org/W2127342417","https://openalex.org/W2127370988","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2135764410","https://openalex.org/W2139164285","https://openalex.org/W2156938362","https://openalex.org/W2159080219","https://openalex.org/W2170923061","https://openalex.org/W2541153014","https://openalex.org/W2798149936","https://openalex.org/W4256648168","https://openalex.org/W4300188436","https://openalex.org/W6675326518"],"related_works":["https://openalex.org/W4205451769","https://openalex.org/W3017203753","https://openalex.org/W2385322349","https://openalex.org/W2348545647","https://openalex.org/W2052976169","https://openalex.org/W2369600518","https://openalex.org/W2029144766","https://openalex.org/W2089275957","https://openalex.org/W2118148379","https://openalex.org/W2594313860"],"abstract_inverted_index":{"Implementing":[0],"a":[1,46,55,107,142,177],"belief":[2],"propagation":[3],"(BP)":[4],"based":[5],"LDPC":[6],"decoder":[7],"requires":[8],"high":[9],"degrees":[10],"of":[11,60,85,106,153,169,191,205],"parallelism":[12],"using":[13],"many":[14],"component":[15],"soft-in":[16],"soft-output":[17],"(SISO)":[18],"decoding":[19,42,47,109,116,129,174],"units":[20],"to":[21,28,39,91,101,189,203],"perform":[22,92],"message":[23],"passing":[24],"from":[25],"variable":[26,83],"nodes":[27,30,84],"check":[29,81],"or":[31,160],"vice":[32],"versa.":[33],"An":[34],"obvious":[35],"complexity-reduction":[36],"solution":[37],"is":[38,200],"serialize":[40],"the":[41,61,80,86,112,115,119,167,170,192,206],"process,":[43],"i.e.,":[44],"dividing":[45],"iteration":[48],"into":[49,89],"several":[50],"serial":[51],"sub-iterations":[52],"in":[53],"which":[54],"sub-iteration":[56],"performs":[57],"only":[58],"part":[59,159],"complete":[62],"parallel":[63],"message-passing":[64,94],"operation.":[65],"The":[66,123,135],"group":[67],"horizontal":[68],"shuffled":[69,74],"BP":[70,75],"(GHSBP)":[71],"and":[72,82,118,128,173,181,195,199],"vertical":[73],"(GVSBP)":[76],"algorithms":[77,156],"respectively":[78],"partition":[79],"code":[87],"graph":[88],"groups":[90],"group-by-group":[93],"decoding.":[95],"This":[96],"paper":[97],"proposes":[98],"new":[99,136,154,163],"techniques":[100,164],"improve":[102],"three":[103,162],"key":[104],"elements":[105],"GHSBP":[108,155],"algorithm,":[110],"namely,":[111],"grouping":[113,126,172],"method,":[114],"schedule":[117,130,175],"log-likelihood":[120],"updating":[121,139],"formulae.":[122],"(check":[124],"nodes)":[125],"method":[127],"optimize":[131],"certain":[132],"design":[133],"criterion.":[134],"normalized":[137,196],"min-sum":[138,184,194,197],"formula":[140],"with":[141],"self-adjustable":[143],"correction":[144],"(scaling)":[145],"factor":[146],"offers":[147],"better":[148],"nonlinear":[149],"approximation.":[150],"Numerical":[151],"performance":[152,187],"that":[157,166,190,204],"include":[158],"all":[161],"indicate":[165],"combination":[168],"proposed":[171],"yields":[176],"faster":[178],"convergence":[179],"rate":[180],"our":[182],"modified":[183],"algorithm":[185,198],"gives":[186],"superior":[188],"conventional":[193],"very":[201],"close":[202],"sum-product":[207],"algorithm.":[208]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}