{"id":"https://openalex.org/W2088875054","doi":"https://doi.org/10.1145/1980022.1980114","title":"Efficient methods for FFT calculations using prime factor algorithm","display_name":"Efficient methods for FFT calculations using prime factor algorithm","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2088875054","doi":"https://doi.org/10.1145/1980022.1980114","mag":"2088875054"},"language":"en","primary_location":{"id":"doi:10.1145/1980022.1980114","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1980022.1980114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference & Workshop on Emerging Trends in Technology - ICWET '11","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/A5028756340","display_name":"N. Kalaiarasi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131147","display_name":"SRM University","ror":"https://ror.org/037skf023","country_code":"IN","type":"education","lineage":["https://openalex.org/I145286018","https://openalex.org/I4210131147"]},{"id":"https://openalex.org/I145286018","display_name":"SRM Institute of Science and Technology","ror":"https://ror.org/050113w36","country_code":"IN","type":"education","lineage":["https://openalex.org/I145286018"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"N. Kalaiarasi","raw_affiliation_strings":["SRM University, Kattankulathur","SRM University Kattankulathur"],"affiliations":[{"raw_affiliation_string":"SRM University, Kattankulathur","institution_ids":["https://openalex.org/I145286018","https://openalex.org/I4210131147"]},{"raw_affiliation_string":"SRM University Kattankulathur","institution_ids":["https://openalex.org/I145286018","https://openalex.org/I4210131147"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102007541","display_name":"A. Rathinam","orcid":"https://orcid.org/0000-0002-5217-7970"},"institutions":[{"id":"https://openalex.org/I4210131147","display_name":"SRM University","ror":"https://ror.org/037skf023","country_code":"IN","type":"education","lineage":["https://openalex.org/I145286018","https://openalex.org/I4210131147"]},{"id":"https://openalex.org/I145286018","display_name":"SRM Institute of Science and Technology","ror":"https://ror.org/050113w36","country_code":"IN","type":"education","lineage":["https://openalex.org/I145286018"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. Rathinam","raw_affiliation_strings":["SRM University, Kattankulathur","SRM University Kattankulathur"],"affiliations":[{"raw_affiliation_string":"SRM University, Kattankulathur","institution_ids":["https://openalex.org/I145286018","https://openalex.org/I4210131147"]},{"raw_affiliation_string":"SRM University Kattankulathur","institution_ids":["https://openalex.org/I145286018","https://openalex.org/I4210131147"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028756340"],"corresponding_institution_ids":["https://openalex.org/I145286018","https://openalex.org/I4210131147"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13746756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"436","last_page":"436"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9250209927558899},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7593071460723877},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.647005558013916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6190674304962158},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5751827955245972},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5002684593200684},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.4918098747730255},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.48146000504493713},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.45055580139160156},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.422532320022583},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4176889657974243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2761821746826172}],"concepts":[{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.9250209927558899},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7593071460723877},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.647005558013916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6190674304962158},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5751827955245972},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5002684593200684},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.4918098747730255},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.48146000504493713},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.45055580139160156},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.422532320022583},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4176889657974243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2761821746826172},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"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/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1980022.1980114","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1980022.1980114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference & Workshop on Emerging Trends in Technology - ICWET '11","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.47999998927116394,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1985765205","https://openalex.org/W1997654368","https://openalex.org/W2144412928","https://openalex.org/W2161119901","https://openalex.org/W2164834346"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W1984254719","https://openalex.org/W4229456379","https://openalex.org/W2149121524","https://openalex.org/W2958343630","https://openalex.org/W2151986570","https://openalex.org/W2547585993","https://openalex.org/W2351401773","https://openalex.org/W2371538653","https://openalex.org/W2977460836"],"abstract_inverted_index":{"FFT":[0],"algorithms":[1],"are":[2,12,62],"mainly":[3],"used":[4],"for":[5,29,46,52,64,98],"the":[6,26,30,36,44,59,68,77,83,92,99,103,109,112,118,130,139,146,149,155,162],"calculation":[7,31,156],"of":[8,32,72,79,94,102,132,148],"DFT":[9,45,65],"because":[10],"they":[11],"preferred":[13],"due":[14,24,86],"to":[15,25,87],"their":[16],"increased":[17],"speed":[18],"and":[19,43,58,82,115,134,136,152,157],"higher":[20],"efficiency,":[21],"which":[22],"arises":[23],"fact":[27],"that":[28],"an":[33],"N-pt":[34],"DFT,":[35],"sequence":[37],"is":[38,49,123],"broken":[39],"into":[40],"several":[41],"segments":[42],"each":[47],"segment":[48],"calculated.":[50],"However,":[51],"this":[53],"many":[54],"redundant":[55],"memory":[56,80,140],"spaces":[57],"Butterfly":[60],"structures":[61],"required":[63],"calculations.":[66],"Grouping":[67],"identical":[69],"twiddle":[70,88],"factors":[71],"different":[73],"stages":[74],"together":[75],"reduces":[76,145,161],"number":[78,93,147],"references":[81],"storage":[84],"space":[85],"factors,":[89],"therein":[90],"reducing":[91,138],"clock":[95],"cycles":[96],"needed":[97],"complete":[100],"implementation":[101],"algorithm.":[104],"For":[105],"further":[106],"reduction":[107],"combine":[108],"DIT":[110,133],"at":[111,117],"initial":[113],"stage":[114],"DIF":[116,135],"final":[119],"stage.":[120],"This":[121],"technique":[122],"referred":[124],"as":[125],"DITF.":[126],"It":[127],"combines":[128],"both":[129],"benefits":[131],"thus":[137],"reference.":[141],"The":[142],"DITF":[143],"algorithm":[144],"complex":[150],"additions":[151],"multiplications":[153],"in":[154,159],"hence":[158],"turn":[160],"computational":[163],"time.":[164]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}