{"id":"https://openalex.org/W2042123141","doi":"https://doi.org/10.1109/lascas.2013.6519053","title":"Reducing the Hamming distance of encoded FFT twiddle factors using improved heuristic algorithms","display_name":"Reducing the Hamming distance of encoded FFT twiddle factors using improved heuristic algorithms","publication_year":2013,"publication_date":"2013-02-01","ids":{"openalex":"https://openalex.org/W2042123141","doi":"https://doi.org/10.1109/lascas.2013.6519053","mag":"2042123141"},"language":"en","primary_location":{"id":"doi:10.1109/lascas.2013.6519053","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lascas.2013.6519053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 4th Latin American Symposium on Circuits and Systems (LASCAS)","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/A5064311550","display_name":"Angelo Goncalves da Luz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210165725","display_name":"Servi\u00e7o Nacional de Aprendizagem Comercial","ror":"https://ror.org/05te7m660","country_code":"BR","type":"education","lineage":["https://openalex.org/I4210165725"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"A. G. da Luz","raw_affiliation_strings":["SENAC, Pelotas, Rio Grande do Sul, Brazil","SENAC, Pelotas, Brazil"],"affiliations":[{"raw_affiliation_string":"SENAC, Pelotas, Rio Grande do Sul, Brazil","institution_ids":["https://openalex.org/I4210165725"]},{"raw_affiliation_string":"SENAC, Pelotas, Brazil","institution_ids":["https://openalex.org/I4210165725"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074598853","display_name":"Eduardo Costa","orcid":"https://orcid.org/0009-0009-2731-8864"},"institutions":[{"id":"https://openalex.org/I110676245","display_name":"Universidade Cat\u00f3lica de Pelotas","ror":"https://ror.org/0376myh60","country_code":"BR","type":"education","lineage":["https://openalex.org/I110676245"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"E. A. C. da Costa","raw_affiliation_strings":["UCPel, Pelotas, Rio Grande do Sul, Brazil","UCPel, Pelotas, Brazil"],"affiliations":[{"raw_affiliation_string":"UCPel, Pelotas, Rio Grande do Sul, Brazil","institution_ids":["https://openalex.org/I110676245"]},{"raw_affiliation_string":"UCPel, Pelotas, Brazil","institution_ids":["https://openalex.org/I110676245"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076165378","display_name":"Sidinei Ghissoni","orcid":null},"institutions":[{"id":"https://openalex.org/I72872986","display_name":"Universidade Federal do Pampa","ror":"https://ror.org/003qt4p19","country_code":"BR","type":"education","lineage":["https://openalex.org/I72872986"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"S. Ghissoni","raw_affiliation_strings":["UNIPAMPA, Alegrete, Rio Grande do Sul, Brazil","UNIPAMPA, Alegrete, Brazil"],"affiliations":[{"raw_affiliation_string":"UNIPAMPA, Alegrete, Rio Grande do Sul, Brazil","institution_ids":["https://openalex.org/I72872986"]},{"raw_affiliation_string":"UNIPAMPA, Alegrete, Brazil","institution_ids":["https://openalex.org/I72872986"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5064311550"],"corresponding_institution_ids":["https://openalex.org/I4210165725"],"apc_list":null,"apc_paid":null,"fwci":0.7094,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74564488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design 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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/twiddle-factor","display_name":"Twiddle factor","score":0.9177148938179016},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.893622875213623},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7518296837806702},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.721567690372467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6945924758911133},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6809366345405579},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6568788290023804},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6522543430328369},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.6518441438674927},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6206254363059998},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.6203826665878296},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4723813533782959},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27222344279289246},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.251160204410553},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09968957304954529},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.08941173553466797},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.08585205674171448}],"concepts":[{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.9177148938179016},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.893622875213623},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7518296837806702},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.721567690372467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6945924758911133},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6809366345405579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6568788290023804},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6522543430328369},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.6518441438674927},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6206254363059998},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.6203826665878296},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4723813533782959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27222344279289246},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.251160204410553},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09968957304954529},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.08941173553466797},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.08585205674171448},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"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/lascas.2013.6519053","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lascas.2013.6519053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 4th Latin American Symposium on Circuits and Systems (LASCAS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8700000047683716,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1559215823","https://openalex.org/W2061171222","https://openalex.org/W2124770748","https://openalex.org/W2162211138","https://openalex.org/W3034467065","https://openalex.org/W7028822189"],"related_works":["https://openalex.org/W1984254719","https://openalex.org/W2031343199","https://openalex.org/W2017578039","https://openalex.org/W4229456379","https://openalex.org/W2061302196","https://openalex.org/W2151986570","https://openalex.org/W1965785658","https://openalex.org/W2149121524","https://openalex.org/W2351401773","https://openalex.org/W2371538653"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,33,43,49,84,88,118,124,131,135,142,148],"exploration":[4],"of":[5,13,16,26,36,51,92,127,144,147],"different":[6],"heuristic":[7,57],"algorithms":[8],"for":[9,41,87,101,105,141],"a":[10,64],"better":[11],"manipulation":[12],"twiddle":[14,150],"factors":[15],"Fast":[17],"Fourier":[18],"Transform":[19],"(FFT).":[20],"The":[21,56],"FFT":[22],"algorithm":[23,58],"involve":[24],"multiplications":[25],"input":[27],"data":[28],"with":[29],"appropriate":[30,125],"coefficients,":[31,128],"hence":[32,110],"best":[34],"ordering":[35,89,126],"those":[37],"operations":[38],"can":[39,139],"contribute":[40,140],"reducing":[42],"switching":[44,103],"activity,":[45],"what":[46],"leads":[47],"to":[48,77,83],"minimization":[50],"power":[52],"consumption":[53],"in":[54,69,94,117],"FFTs.":[55,95],"named":[59,67],"Bellmore":[60],"and":[61,63,72,90],"Nemhauser,":[62],"proposed":[65],"one":[66],"Anedma":[68,137],"both":[70],"original":[71],"improved":[73,136],"versions,":[74],"are":[75,99],"used":[76,100,113],"get":[78],"as":[79,81],"near":[80],"possible":[82],"optimal":[85],"solution":[86],"partitioning":[91],"coefficients":[93],"Data":[96],"encoding":[97,115],"methods":[98],"decreasing":[102],"activity":[104],"transmitting":[106],"information":[107],"over":[108],"buses,":[109],"we":[111],"have":[112],"some":[114],"techniques":[116],"coefficients.":[119],"As":[120],"will":[121],"be":[122],"shown,":[123],"based":[129],"on":[130],"guidance":[132],"given":[133],"by":[134],"algorithm,":[138],"reduction":[143],"Hamming":[145],"distance":[146],"encoded":[149],"factors.":[151]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}