{"id":"https://openalex.org/W2602222563","doi":"https://doi.org/10.1109/icce.2017.7889352","title":"Frequency-domain based Reed Solomon decoders for GPU","display_name":"Frequency-domain based Reed Solomon decoders for GPU","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2602222563","doi":"https://doi.org/10.1109/icce.2017.7889352","mag":"2602222563"},"language":"en","primary_location":{"id":"doi:10.1109/icce.2017.7889352","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icce.2017.7889352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Consumer Electronics (ICCE)","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/A5066089541","display_name":"Arul K. Subbiah","orcid":"https://orcid.org/0000-0003-1276-5193"},"institutions":[{"id":"https://openalex.org/I16269868","display_name":"Santa Clara University","ror":"https://ror.org/03ypqe447","country_code":"US","type":"education","lineage":["https://openalex.org/I16269868"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arul K. Subbiah","raw_affiliation_strings":["Santa Clara University, Santa Clara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Santa Clara University, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I16269868"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025538938","display_name":"Tokunbo Ogunfunmi","orcid":"https://orcid.org/0000-0003-3517-9779"},"institutions":[{"id":"https://openalex.org/I16269868","display_name":"Santa Clara University","ror":"https://ror.org/03ypqe447","country_code":"US","type":"education","lineage":["https://openalex.org/I16269868"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tokunbo Ogunfunmi","raw_affiliation_strings":["Santa Clara University, Santa Clara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Santa Clara University, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I16269868"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066089541"],"corresponding_institution_ids":["https://openalex.org/I16269868"],"apc_list":null,"apc_paid":null,"fwci":0.7801,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78394004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"45","issue":null,"first_page":"352","last_page":"354"},"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9943000078201294,"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/computer-science","display_name":"Computer science","score":0.7712312340736389},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.6539990305900574},{"id":"https://openalex.org/keywords/frequency-domain","display_name":"Frequency domain","score":0.6183493137359619},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5366947054862976},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.5350692272186279},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5256337523460388},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.46230971813201904},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.4588509202003479},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.43427199125289917},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.4196256697177887},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4136022925376892},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.1810627579689026},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.16031739115715027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.152797669172287},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.11924141645431519},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1079760193824768},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.10731258988380432}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7712312340736389},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.6539990305900574},{"id":"https://openalex.org/C19118579","wikidata":"https://www.wikidata.org/wiki/Q786423","display_name":"Frequency domain","level":2,"score":0.6183493137359619},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5366947054862976},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.5350692272186279},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5256337523460388},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.46230971813201904},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.4588509202003479},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.43427199125289917},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.4196256697177887},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4136022925376892},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.1810627579689026},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.16031739115715027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.152797669172287},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.11924141645431519},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1079760193824768},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.10731258988380432},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icce.2017.7889352","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icce.2017.7889352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Consumer Electronics (ICCE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1496108277","https://openalex.org/W1964578465","https://openalex.org/W2007158444","https://openalex.org/W2075558144","https://openalex.org/W2124271027","https://openalex.org/W2942537621","https://openalex.org/W4254473762","https://openalex.org/W6629563526","https://openalex.org/W6641253284"],"related_works":["https://openalex.org/W2154006536","https://openalex.org/W2348800014","https://openalex.org/W2365391860","https://openalex.org/W1820187807","https://openalex.org/W2155491755","https://openalex.org/W4362564158","https://openalex.org/W2085939569","https://openalex.org/W2610274271","https://openalex.org/W1481058185","https://openalex.org/W2377972059"],"abstract_inverted_index":{"Recent":[0],"development":[1],"and":[2,70,116,126],"popularity":[3],"of":[4,33,82],"the":[5,34,44,52,57,64,71,77,80,83,88,95,101],"Graphical":[6],"Processing":[7],"Unit":[8],"(GPU)":[9],"has":[10,106,135],"attracted":[11],"researchers":[12],"to":[13,50],"utilize":[14],"it":[15],"for":[16,119,131],"error":[17,58,72],"correction":[18],"codes":[19],"like":[20],"Reed":[21],"Solomon":[22],"(RS).":[23],"In":[24],"this":[25],"paper,":[26],"we":[27],"have":[28,113],"proposed":[29],"an":[30],"efficient":[31],"implementation":[32],"RS":[35,111],"decoder":[36,42],"based":[37,110],"on":[38,122],"Frequency-Domain":[39],"analysis.":[40],"This":[41,104],"employs":[43],"Finite-field":[45,90],"Fast":[46,91],"Fourier":[47,92],"Transform":[48,93],"(FFFT)":[49],"convert":[51],"received":[53],"code":[54],"in":[55,76,100],"Frequency-Domain;":[56],"locator":[59],"polynomial":[60],"is":[61,74,98],"derived":[62],"using":[63,79,87],"inversion":[65],"less":[66],"Berleykamp-Massey":[67],"algorithm":[68],"(iBMA),":[69],"vector":[73],"generated":[75],"frequency-domain":[78,109],"coefficients":[81],"key":[84],"equation.":[85],"Finally,":[86],"Inverse":[89],"(IFFFT),":[94],"original":[96],"message":[97],"retrieved":[99],"time":[102],"domain.":[103],"paper":[105],"shown":[107],"that":[108],"coders":[112],"high":[114,117],"efficiency":[115],"throughput":[118],"correcting":[120],"errors":[121],"flash":[123],"memory":[124],"devices,":[125],"they":[127],"are":[128],"more":[129],"suitable":[130],"multimedia":[132],"systems":[133],"which":[134],"GPU.":[136]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}