{"id":"https://openalex.org/W4384787273","doi":"https://doi.org/10.1109/jsait.2023.3296419","title":"Fast and Low-Complexity Soft-Decision Generalized Integrated Interleaved Decoder","display_name":"Fast and Low-Complexity Soft-Decision Generalized Integrated Interleaved Decoder","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4384787273","doi":"https://doi.org/10.1109/jsait.2023.3296419"},"language":"en","primary_location":{"id":"doi:10.1109/jsait.2023.3296419","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2023.3296419","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Information Theory","raw_type":"journal-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/A5059672491","display_name":"Yok Jye Tang","orcid":"https://orcid.org/0000-0003-3125-3572"},"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":"Yok Jye Tang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","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":false,"raw_author_name":"Xinmiao Zhang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059672491"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":1.0474,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80946516,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4","issue":null,"first_page":"174","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.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/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.8951505422592163},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8604018092155457},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.6873388290405273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6753472089767456},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5955607891082764},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5628465414047241},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5001101493835449},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4913136065006256},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4434375464916229},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.41874706745147705},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33518296480178833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26450878381729126},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.17405477166175842},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.12422201037406921}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.8951505422592163},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8604018092155457},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.6873388290405273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6753472089767456},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5955607891082764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5628465414047241},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5001101493835449},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4913136065006256},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4434375464916229},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.41874706745147705},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33518296480178833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26450878381729126},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.17405477166175842},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.12422201037406921},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jsait.2023.3296419","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2023.3296419","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7300000190734863,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3481074022","display_name":null,"funder_award_id":"2011785","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":29,"referenced_works":["https://openalex.org/W1450066936","https://openalex.org/W2016746456","https://openalex.org/W2023355697","https://openalex.org/W2032431003","https://openalex.org/W2040075573","https://openalex.org/W2066795426","https://openalex.org/W2078185472","https://openalex.org/W2089272132","https://openalex.org/W2102627024","https://openalex.org/W2111530591","https://openalex.org/W2123307753","https://openalex.org/W2131289621","https://openalex.org/W2138779125","https://openalex.org/W2138898651","https://openalex.org/W2155020285","https://openalex.org/W2430292645","https://openalex.org/W2557281395","https://openalex.org/W2910918398","https://openalex.org/W2919319018","https://openalex.org/W2928136090","https://openalex.org/W2952622859","https://openalex.org/W2959106969","https://openalex.org/W3035111722","https://openalex.org/W3153682296","https://openalex.org/W3162488502","https://openalex.org/W3205667341","https://openalex.org/W3206484402","https://openalex.org/W4236851168","https://openalex.org/W4290993971"],"related_works":["https://openalex.org/W1995527419","https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W1978637058","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W4244153028","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2521769401"],"abstract_inverted_index":{"Generalized":[0],"integrated":[1],"interleaved":[2],"(GII)":[3],"codes":[4,57,62],"are":[5,166],"essential":[6],"to":[7,50,130,139,170,187,243,259],"next-generation":[8],"digital":[9],"communication":[10],"and":[11,99,136,168],"storage":[12],"systems":[13],"since":[14],"they":[15],"can":[16,90,105,210,284,301],"achieve":[17,91,285],"very":[18],"high":[19],"decoding":[20,28,42,54,73,84,153,176,310],"throughput":[21],"with":[22,271,292],"low":[23],"complexity.":[24,100],"Only":[25],"hard-decision":[26,290],"GII":[27,56,152,164,174],"has":[29],"been":[30,241],"considered":[31],"in":[32,115,202,232],"previous":[33],"work.":[34],"To":[35],"further":[36,225],"improve":[37],"the":[38,45,78,96,107,112,118,143,159,163,172,191,203,207,245,249,261,279,303],"error-correcting":[39,246],"capability,":[40],"soft-decision":[41,72,151],"algorithms":[43,74,104],"utilizing":[44],"channel":[46],"probability":[47],"information":[48],"need":[49],"be":[51,211],"developed.":[52],"The":[53,222],"of":[55,64,67,75,157,218,248,274,306],"constructed":[58],"based":[59],"on":[60,86,95,126,194],"BCH":[61,68,76],"consists":[63,217],"multiple":[65,87],"rounds":[66,311],"decoding.":[69],"Among":[70],"existing":[71],"codes,":[77],"Chase":[79,103,160,175,264,282,308],"algorithm":[80],"that":[81],"carries":[82],"out":[83,124,190],"trials":[85],"test":[88,113],"vectors":[89,114],"a":[92,179,200,219],"better":[93],"trade-off":[94],"coding":[97,287],"gain":[98,288],"Although":[101],"one-pass":[102],"derive":[106],"error-locator":[108,128,181,196,208],"polynomials":[109,231],"for":[110],"all":[111],"one":[116,133],"run,":[117],"exhaustive":[119],"Chien":[120,192],"search":[121,193],"is":[122,134,185,224],"carried":[123],"previously":[125],"each":[127,195],"polynomial":[129,182,197,209],"decide":[131],"which":[132],"correct":[135],"it":[137,216],"leads":[138],"long":[140],"latency.":[141],"For":[142,266],"first":[144],"time,":[145],"this":[146],"paper":[147,253],"proposes":[148],"an":[149,267],"efficient":[150],"algorithm.":[154,177],"Different":[155],"methods":[156],"incorporating":[158],"process":[161],"into":[162],"scheme":[165,184],"analyzed":[167],"compared":[169],"identify":[171],"best":[173],"Besides,":[178,297],"new":[180],"selection":[183],"developed":[186,242],"avoid":[188],"carrying":[189],"by":[198,213,227,312],"pre-flipping":[199],"bit":[201],"received":[204],"word.":[205],"Accordingly,":[206],"selected":[212],"testing":[214],"whether":[215],"pre-determined":[220],"factor.":[221],"latency":[223,305],"reduced":[226],"pre-computing":[228],"short":[229],"remainder":[230],"our":[233,298],"second":[234],"proposed":[235,250,262,280,299],"scheme.":[236],"In":[237],"addition,":[238],"formulas":[239],"have":[240],"estimate":[244],"performance":[247],"designs.":[251],"This":[252],"also":[254],"develops":[255],"low-complexity":[256],"hardware":[257],"architectures":[258],"implement":[260],"GII-BCH":[263,269,281,307],"decoders.":[265],"example":[268],"code":[270],"8":[272],"sub-codewords":[273],"4095":[275],"bits":[276],"over":[277,289],"GF(212),":[278],"decoder":[283,291],"significant":[286],"negligible":[293],"silicon":[294],"area":[295],"overhead.":[296],"designs":[300],"reduce":[302],"worst-case":[304],"nested":[309],"54%-80%.":[313]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}