{"id":"https://openalex.org/W4285217179","doi":"https://doi.org/10.1109/tvlsi.2022.3179944","title":"Low-Latency Nested Decoding for Short Generalized Integrated Interleaved BCH Codes","display_name":"Low-Latency Nested Decoding for Short Generalized Integrated Interleaved BCH Codes","publication_year":2022,"publication_date":"2022-06-13","ids":{"openalex":"https://openalex.org/W4285217179","doi":"https://doi.org/10.1109/tvlsi.2022.3179944"},"language":"en","primary_location":{"id":"doi:10.1109/tvlsi.2022.3179944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2022.3179944","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"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 Transactions on Very Large Scale Integration (VLSI) Systems","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/A5033531436","display_name":"Zhenshan Xie","orcid":"https://orcid.org/0000-0003-1594-4891"},"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":"Zhenshan Xie","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"],"raw_orcid":"https://orcid.org/0000-0003-1594-4891","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":"middle","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":false,"raw_author_name":"Yok Jye Tang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"],"raw_orcid":"https://orcid.org/0000-0003-3125-3572","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"],"raw_orcid":"https://orcid.org/0000-0002-8289-2377","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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":0.1336,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44446931,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"10","first_page":"1563","last_page":"1567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9988999962806702,"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.9986000061035156,"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/bch-code","display_name":"BCH code","score":0.9486310482025146},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7243263721466064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7033782005310059},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.6036418676376343},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5672047138214111},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.484235018491745},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4775020480155945},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4519183933734894},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.44635072350502014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42838916182518005},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4152938723564148},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.37630322575569153},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.32171761989593506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2445090115070343},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1908472776412964},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10365158319473267}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.9486310482025146},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7243263721466064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7033782005310059},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.6036418676376343},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5672047138214111},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.484235018491745},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4775020480155945},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4519183933734894},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.44635072350502014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42838916182518005},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4152938723564148},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.37630322575569153},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.32171761989593506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2445090115070343},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1908472776412964},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10365158319473267},{"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/tvlsi.2022.3179944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2022.3179944","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"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 Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3481074022","display_name":"CCSS: Error-Correcting Codes Enabling Hyper-Speed Communications and Storage: from Theory to Hardware Architectures","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":12,"referenced_works":["https://openalex.org/W1514022891","https://openalex.org/W2023359429","https://openalex.org/W2075850503","https://openalex.org/W2123307753","https://openalex.org/W2557281395","https://openalex.org/W2941076309","https://openalex.org/W2952622859","https://openalex.org/W3153682296","https://openalex.org/W3177155030","https://openalex.org/W3206484402","https://openalex.org/W4312449659","https://openalex.org/W6630261084"],"related_works":["https://openalex.org/W4244153028","https://openalex.org/W1995527419","https://openalex.org/W1978637058","https://openalex.org/W2521769401","https://openalex.org/W4242597560","https://openalex.org/W2154603729","https://openalex.org/W2101828326","https://openalex.org/W2010879611","https://openalex.org/W2127999627","https://openalex.org/W2115785601"],"abstract_inverted_index":{"Generalized":[0],"integrated":[1],"interleaved":[2],"(GII)":[3],"codes":[4,29],"nest":[5],"short":[6,27,49,82],"BCH":[7,13],"sub-codewords":[8],"to":[9,89,96,119,138,173],"form":[10],"more":[11],"powerful":[12],"codewords.":[14],"They":[15],"can":[16],"potentially":[17],"achieve":[18],"hyper-speed":[19],"decoding":[20,79,95,160],"with":[21,164],"excellent":[22],"error-correction":[23],"capability.":[24],"In":[25],"particular,":[26],"GII-BCH":[28,50,83,148],"are":[30,116],"among":[31],"the":[32,36,46,60,103,111,121,124,140,153,157],"best":[33],"candidates":[34],"for":[35,81,92,110],"new":[37],"fast":[38],"storage":[39],"class":[40],"memories":[41],"(SCMs).":[42],"Miscorrections":[43],"severely":[44],"degrade":[45],"performance":[47,170],"of":[48,102,108],"codes.":[51,84],"Although":[52],"they":[53],"were":[54],"effectively":[55],"mitigated":[56],"in":[57],"previous":[58],"designs,":[59],"involved":[61],"repeated":[62],"Chien":[63,113],"search":[64],"and":[65,76,168],"higher-order":[66,141],"syndrome":[67,143],"computation":[68],"cause":[69],"long":[70],"latency.":[71],"This":[72],"brief":[73],"proposes":[74],"efficient":[75],"low-latency":[77],"nested":[78,94,142,159],"schemes":[80],"A":[85],"strategy":[86],"is":[87,136],"developed":[88,137],"select":[90],"sub-words":[91],"further":[93],"mitigate":[97],"miscorrections":[98],"by":[99,162],"keeping":[100],"track":[101],"error":[104],"locator":[105],"polynomials,":[106],"instead":[107],"waiting":[109],"lengthy":[112],"search.":[114],"Formulas":[115],"also":[117],"derived":[118],"estimate":[120],"effects":[122],"on":[123],"error-correcting":[125],"performance.":[126],"Besides,":[127],"a":[128],"low-complexity":[129],"linear":[130],"feedback":[131],"shift":[132],"register":[133],"(LFSR)":[134],"architecture":[135],"accelerate":[139],"computation.":[144],"For":[145],"an":[146],"example":[147],"code":[149],"targeting":[150],"at":[151],"SCMs,":[152],"proposed":[154],"design":[155],"reduces":[156],"worst-case":[158],"latency":[161],"26%":[163],"8.5%":[165],"area":[166],"overhead":[167],"negligible":[169],"loss":[171],"compared":[172],"prior":[174],"methods.":[175]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}