{"id":"https://openalex.org/W2543424871","doi":"https://doi.org/10.1109/acssc.2012.6489227","title":"Sequential decoding of non-binary LDPC codes on graphics processing units","display_name":"Sequential decoding of non-binary LDPC codes on graphics processing units","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W2543424871","doi":"https://doi.org/10.1109/acssc.2012.6489227","mag":"2543424871"},"language":"en","primary_location":{"id":"doi:10.1109/acssc.2012.6489227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2012.6489227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)","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/A5074986226","display_name":"David Romero","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David L. Romero","raw_affiliation_strings":["MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420, USA","MIT Lincoln Laboratory, Lexington, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420, USA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108507484","display_name":"Nicholas B. Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210122954","display_name":"MIT Lincoln Laboratory","ror":"https://ror.org/022z6jk58","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210122954","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas B. Chang","raw_affiliation_strings":["MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420, USA","MIT Lincoln Laboratory, Lexington, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Lincoln Laboratory, 244 Wood Street, Lexington, MA 02420, USA","institution_ids":["https://openalex.org/I4210122954"]},{"raw_affiliation_string":"MIT Lincoln Laboratory, Lexington, MA, USA","institution_ids":["https://openalex.org/I4210122954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210122954"],"apc_list":null,"apc_paid":null,"fwci":1.4909,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.85071977,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1267","last_page":"1271"},"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.9993000030517578,"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.9987999796867371,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8493998050689697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.818117618560791},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7669677734375},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.6413607001304626},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5536928772926331},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5251585841178894},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.495889276266098},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46455997228622437},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.434109628200531},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.42040693759918213},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4134473204612732},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3989144563674927},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3877650499343872},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.19857513904571533},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10273361206054688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09637340903282166}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8493998050689697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.818117618560791},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7669677734375},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.6413607001304626},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5536928772926331},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5251585841178894},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.495889276266098},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46455997228622437},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.434109628200531},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.42040693759918213},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4134473204612732},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3989144563674927},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3877650499343872},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.19857513904571533},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10273361206054688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09637340903282166},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acssc.2012.6489227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2012.6489227","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)","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":3,"referenced_works":["https://openalex.org/W1988443235","https://openalex.org/W2127002303","https://openalex.org/W2541842197"],"related_works":["https://openalex.org/W2061476814","https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W2594313860","https://openalex.org/W2118148379","https://openalex.org/W99853930","https://openalex.org/W1504657239","https://openalex.org/W1978153242","https://openalex.org/W2154603729","https://openalex.org/W2127999627"],"abstract_inverted_index":{"Non-binary":[0],"low-density":[1],"parity-check":[2],"(LDPC)":[3],"codes":[4,26],"have":[5],"been":[6],"shown":[7,129],"to":[8,35,73,80,84,134],"attain":[9],"near":[10],"capacity":[11],"error":[12],"correcting":[13],"performance":[14,75],"in":[15,138],"noisy":[16],"wireless":[17],"communication":[18],"channels.":[19],"It":[20],"is":[21,128],"well":[22],"known":[23],"that":[24,130],"these":[25],"require":[27],"a":[28,43,78,108,122],"very":[29],"large":[30],"number":[31,145],"of":[32,57,89,99,111,146],"operations":[33],"per-bit":[34],"decode.":[36],"This":[37],"high":[38],"computational":[39,87],"complexity":[40],"along":[41],"with":[42,68,121],"parallel":[44],"decoder":[45,102],"structure":[46],"makes":[47],"graphics":[48],"processing":[49],"units":[50],"(GPUs)":[51],"an":[52,100],"attractive":[53],"platform":[54],"for":[55,150],"acceleration":[56],"the":[58,86,90,97,117,139,144],"decoding":[59,69,140,147],"algorithm.":[60],"The":[61],"seemingly":[62],"random":[63],"memory":[64],"access":[65],"patterns":[66],"associated":[67],"are":[70,132],"generally":[71],"beneficial":[72],"error-correcting":[74],"but":[76],"present":[77],"challenge":[79],"designers":[81],"who":[82],"want":[83],"leverage":[85],"capabilities":[88],"GPU.":[91],"In":[92],"this":[93],"paper":[94],"we":[95,131],"describe":[96],"design":[98],"efficient":[101],"implementation":[103],"based":[104],"on":[105],"GPUs":[106],"and":[107],"corresponding":[109],"set":[110],"powerful":[112],"non-binary":[113],"LDPC":[114],"codes.":[115],"Using":[116],"belief":[118],"propagation":[119],"algorithm":[120,141],"sequential":[123],"message":[124],"updating":[125],"scheme":[126],"it":[127],"able":[133],"exploit":[135],"parallelism":[136],"inherent":[137],"while":[142],"decreasing":[143],"iterations":[148],"required":[149],"convergence.":[151]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}