{"id":"https://openalex.org/W2430292645","doi":"https://doi.org/10.1109/tcsii.2016.2581587","title":"An Efficient Eligible Error Locator Polynomial Searching Algorithm and Hardware Architecture for One-Pass Chase Decoding of BCH Codes","display_name":"An Efficient Eligible Error Locator Polynomial Searching Algorithm and Hardware Architecture for One-Pass Chase Decoding of BCH Codes","publication_year":2016,"publication_date":"2016-06-15","ids":{"openalex":"https://openalex.org/W2430292645","doi":"https://doi.org/10.1109/tcsii.2016.2581587","mag":"2430292645"},"language":"en","primary_location":{"id":"doi:10.1109/tcsii.2016.2581587","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcsii.2016.2581587","pdf_url":null,"source":{"id":"https://openalex.org/S93916849","display_name":"IEEE Transactions on Circuits & Systems II Express Briefs","issn_l":"1549-7747","issn":["1549-7747","1558-3791"],"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 Circuits and Systems II: Express Briefs","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/A5056303339","display_name":"Nan Zheng","orcid":"https://orcid.org/0000-0003-3261-2135"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nan Zheng","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068645158","display_name":"Pinaki Mazumder","orcid":"https://orcid.org/0000-0002-9353-7004"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pinaki Mazumder","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056303339"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":1.3331,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87082752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"64","issue":"5","first_page":"580","last_page":"584"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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":0.9998999834060669,"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.9987000226974487,"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.9976000189781189,"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.893061637878418},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.7050217986106873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6764994859695435},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6626954078674316},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6205870509147644},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6002339124679565},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5158600211143494},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.4318118393421173},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.425807386636734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3150807321071625},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.25355061888694763},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.12874650955200195}],"concepts":[{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.893061637878418},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.7050217986106873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6764994859695435},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6626954078674316},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6205870509147644},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6002339124679565},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5158600211143494},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.4318118393421173},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.425807386636734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3150807321071625},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.25355061888694763},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.12874650955200195},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"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/tcsii.2016.2581587","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcsii.2016.2581587","pdf_url":null,"source":{"id":"https://openalex.org/S93916849","display_name":"IEEE Transactions on Circuits & Systems II Express Briefs","issn_l":"1549-7747","issn":["1549-7747","1558-3791"],"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 Circuits and Systems II: Express Briefs","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G5333110778","display_name":null,"funder_award_id":"CCF1421467","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":11,"referenced_works":["https://openalex.org/W1523108085","https://openalex.org/W1566542142","https://openalex.org/W2016746456","https://openalex.org/W2023355697","https://openalex.org/W2038884834","https://openalex.org/W2066795426","https://openalex.org/W2095116238","https://openalex.org/W2111530591","https://openalex.org/W2141463807","https://openalex.org/W2145362790","https://openalex.org/W2159836452"],"related_works":["https://openalex.org/W2126089770","https://openalex.org/W1992183350","https://openalex.org/W4244153028","https://openalex.org/W2128628822","https://openalex.org/W2361034356","https://openalex.org/W1995527419","https://openalex.org/W3021984762","https://openalex.org/W1976834495","https://openalex.org/W4242597560","https://openalex.org/W1768316021"],"abstract_inverted_index":{"In":[0,63,101,124,177],"numerous":[1],"memory":[2],"and":[3,109],"communication":[4],"systems,":[5],"Bose-Chaudhuri-Hocquenghem":[6],"(BCH)":[7],"codes":[8,23],"are":[9],"widely":[10],"employed":[11,97],"to":[12,27,103,149],"enhance":[13],"reliability.":[14],"A":[15],"one-pass":[16,47,171],"Chase":[17,48,172],"soft-decision":[18],"decoding":[19,35,49],"algorithm":[20,68,116,132,144,157,185],"for":[21,98,129],"BCH":[22],"was":[24],"previously":[25],"proposed":[26,131,141,184],"achieve":[28],"significant":[29],"performance":[30],"improvement":[31],"over":[32],"traditional":[33],"hard-decision":[34],"while":[36],"not":[37],"increasing":[38],"too":[39],"much":[40],"computational":[41],"complexity.":[42],"The":[43,82,135,163],"bottleneck":[44],"in":[45,168],"conventional":[46,154,194],"is":[50,61,80,84,121,133,174,186],"the":[51,105,130,140,146,183,193],"procedure":[52],"of":[53,74,152],"judging":[54],"whether":[55],"an":[56,112],"obtained":[57],"error":[58,77],"locator":[59,78],"polynomial":[60,79,89,114,119,155],"valid.":[62],"this":[64],"brief,":[65],"a":[66,88,126,153,169],"novel":[67],"that":[69,139,182],"can":[70,95],"efficiently":[71],"verify":[72],"eligibility":[73,142],"each":[75],"generated":[76],"proposed.":[81,123],"problem":[83],"first":[85],"reformulated":[86],"as":[87],"modulo":[90],"problem,":[91],"where":[92],"repeated":[93],"squaring":[94],"be":[96],"further":[99],"simplification.":[100],"order":[102],"decrease":[104],"critical":[106],"path":[107],"delay":[108],"hardware":[110],"complexity,":[111],"efficient":[113,191],"division":[115],"based":[117],"on":[118],"inversion":[120],"also":[122],"addition,":[125,178],"VLSI":[127],"architecture":[128],"presented.":[134],"implemented":[136],"results":[137],"show":[138],"checking":[143],"reduces":[145],"gate":[147],"counts":[148],"only":[150],"12%":[151],"selection":[156],"without":[158],"introducing":[159],"any":[160],"speed":[161],"penalty.":[162],"projected":[164],"area":[165],"reduction":[166],"achieved":[167],"complete":[170],"decoder":[173],"approximately":[175],"75%.":[176],"post-layout":[179],"simulation":[180],"shows":[181],"20":[187],"times":[188],"more":[189],"power":[190],"than":[192],"method.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}