{"id":"https://openalex.org/W4312999300","doi":"https://doi.org/10.1109/iscas48785.2022.9937813","title":"Efficient Check Node Processing for Min-Max NB-LDPC Decoding over Lower-Order Finite Fields","display_name":"Efficient Check Node Processing for Min-Max NB-LDPC Decoding over Lower-Order Finite Fields","publication_year":2022,"publication_date":"2022-05-28","ids":{"openalex":"https://openalex.org/W4312999300","doi":"https://doi.org/10.1109/iscas48785.2022.9937813"},"language":"en","primary_location":{"id":"doi:10.1109/iscas48785.2022.9937813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas48785.2022.9937813","pdf_url":null,"source":{"id":"https://openalex.org/S4363604393","display_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","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/A5063673084","display_name":"Xinmiao Zhang","orcid":"https://orcid.org/0000-0002-8289-2377"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xinmiao Zhang","raw_affiliation_strings":["The Ohio State University"],"affiliations":[{"raw_affiliation_string":"The Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063673084"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18562291,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":null,"first_page":"2062","last_page":"2066"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980999827384949,"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.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8408244848251343},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.7657648324966431},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6525591015815735},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6212393641471863},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49228134751319885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4791938066482544},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4540756940841675},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43127259612083435},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4309753179550171},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.43042299151420593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41899311542510986},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41271066665649414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3668121099472046},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.278326153755188},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.24890822172164917},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21939119696617126},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0957925021648407}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8408244848251343},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.7657648324966431},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6525591015815735},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6212393641471863},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49228134751319885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4791938066482544},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4540756940841675},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43127259612083435},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4309753179550171},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.43042299151420593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41899311542510986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41271066665649414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3668121099472046},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.278326153755188},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.24890822172164917},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21939119696617126},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0957925021648407},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas48785.2022.9937813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas48785.2022.9937813","pdf_url":null,"source":{"id":"https://openalex.org/S4363604393","display_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1450066936","https://openalex.org/W1966882038","https://openalex.org/W2036158324","https://openalex.org/W2046073577","https://openalex.org/W2056223797","https://openalex.org/W2079434468","https://openalex.org/W2130194865","https://openalex.org/W2337000483","https://openalex.org/W2343531432","https://openalex.org/W2605173350","https://openalex.org/W2772948422","https://openalex.org/W2917712013","https://openalex.org/W4236851168","https://openalex.org/W6735719691"],"related_works":["https://openalex.org/W2479327835","https://openalex.org/W2110972223","https://openalex.org/W2163036861","https://openalex.org/W4225319325","https://openalex.org/W2124455219","https://openalex.org/W2134037924","https://openalex.org/W2133759070","https://openalex.org/W1964442113","https://openalex.org/W2777137313","https://openalex.org/W180409127"],"abstract_inverted_index":{"Low-density":[0],"parity-check":[1],"(LDPC)":[2],"codes":[3,23,61,110],"defined":[4],"over":[5,62,77,111,144,193],"non-binary":[6],"(NB)":[7],"finite":[8,64,152],"field":[9,82,153],"GF(2":[10],"<sup":[11,43],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[12,44],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">q</sup>":[13,45],")(q":[14],">1)":[15],"achieve":[16],"better":[17],"error-correcting":[18,49],"performance":[19,50],"than":[20],"binary":[21],"LDPC":[22],"when":[24],"the":[25,37,40,48,55,79,127,133,141,149,155,162,172,176],"codeword":[26],"length":[27],"is":[28,124,132,167],"moderate.":[29],"The":[30],"decoder":[31],"complexity":[32,56],"increases":[33],"very":[34],"fast":[35],"with":[36],"order":[38],"of":[39,67,151,164],"field,":[41],"2":[42],",":[46],"although":[47],"also":[51],"improves.":[52],"To":[53],"reduce":[54],"for":[57,109,126,140,189],"practical":[58],"applications,":[59],"NB-LDPC":[60,138],"lower-order":[63,116,145],"fields":[65],"are":[66,98,159],"great":[68],"interest.":[69],"Previous":[70],"designs":[71,108],"have":[72],"been":[73],"focusing":[74],"on":[75],"decoders":[76],"either":[78,99],"smallest":[80],"NB":[81],"GF":[83,91,112,194],"(4)":[84],"or":[85,93,102,114],"much":[86],"larger":[87],"fields,":[88],"such":[89],"as":[90],"(32)":[92],"higher.":[94],"Prior":[95],"optimization":[96],"techniques":[97],"not":[100,104],"applicable":[101],"do":[103],"lead":[105],"to":[106,171],"efficient":[107,122],"(8)":[113],"other":[115],"fields.":[117,146],"In":[118],"this":[119],"paper,":[120],"an":[121,190],"architecture":[123],"developed":[125],"check":[128,178],"node":[129,179],"processing,":[130],"which":[131],"most":[134],"complicated":[135],"step":[136],"in":[137],"decoding,":[139],"Min-max":[142],"algorithm":[143],"By":[147],"utilizing":[148],"properties":[150],"elements,":[154],"max/min":[156],"comparison":[157],"results":[158],"shared":[160],"and":[161,185],"number":[163],"comparators":[165],"needed":[166],"reduced":[168],"significantly.":[169],"Compared":[170],"best":[173],"prior":[174],"design,":[175],"proposed":[177],"processing":[180],"has":[181],"18.5%":[182],"smaller":[183],"area":[184],"shorter":[186],"critical":[187],"path":[188],"example":[191],"code":[192],"(8).":[195]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}