{"id":"https://openalex.org/W1973296570","doi":"https://doi.org/10.1109/proc.1985.13381","title":"A comparison of the time involved in computing fast Hartley and fast Fourier transforms","display_name":"A comparison of the time involved in computing fast Hartley and fast Fourier transforms","publication_year":1985,"publication_date":"1985-01-01","ids":{"openalex":"https://openalex.org/W1973296570","doi":"https://doi.org/10.1109/proc.1985.13381","mag":"1973296570"},"language":"en","primary_location":{"id":"doi:10.1109/proc.1985.13381","is_oa":false,"landing_page_url":"https://doi.org/10.1109/proc.1985.13381","pdf_url":null,"source":{"id":"https://openalex.org/S68686220","display_name":"Proceedings of the IEEE","issn_l":"0018-9219","issn":["0018-9219","1558-2256"],"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":"Proceedings of the IEEE","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/A5088414109","display_name":"Gary E. J. Bold","orcid":null},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"G.E.J. Bold","raw_affiliation_strings":["Physics Department, University of Auckland, Auckland, New Zealand","UNIVERSITY OF AUCKLAND, Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Physics Department, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"UNIVERSITY OF AUCKLAND, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088414109"],"corresponding_institution_ids":["https://openalex.org/I154130895"],"apc_list":null,"apc_paid":null,"fwci":4.0795,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.92783505,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"73","issue":"12","first_page":"1863","last_page":"1864"},"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.9994000196456909,"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.9994000196456909,"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/T12300","display_name":"Advanced Electrical Measurement Techniques","score":0.9929999709129333,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9908999800682068,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.872156023979187},{"id":"https://openalex.org/keywords/hartley-transform","display_name":"Hartley transform","score":0.7967439889907837},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.7596780061721802},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.7024403810501099},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6884909272193909},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.676240861415863},{"id":"https://openalex.org/keywords/discrete-hartley-transform","display_name":"Discrete Hartley transform","score":0.5600550174713135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5112712383270264},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.504564642906189},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49542129039764404},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4807453155517578},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4558597207069397},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.4468666613101959},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.4288317561149597},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42847931385040283},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.42534157633781433},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.40854012966156006},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33724087476730347},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.32222455739974976},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.20352798700332642},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1723984181880951}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.872156023979187},{"id":"https://openalex.org/C67757890","wikidata":"https://www.wikidata.org/wiki/Q1567607","display_name":"Hartley transform","level":5,"score":0.7967439889907837},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.7596780061721802},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.7024403810501099},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6884909272193909},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.676240861415863},{"id":"https://openalex.org/C192853989","wikidata":"https://www.wikidata.org/wiki/Q1006531","display_name":"Discrete Hartley transform","level":5,"score":0.5600550174713135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5112712383270264},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.504564642906189},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49542129039764404},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4807453155517578},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4558597207069397},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.4468666613101959},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.4288317561149597},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42847931385040283},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.42534157633781433},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.40854012966156006},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33724087476730347},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.32222455739974976},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.20352798700332642},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1723984181880951},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/proc.1985.13381","is_oa":false,"landing_page_url":"https://doi.org/10.1109/proc.1985.13381","pdf_url":null,"source":{"id":"https://openalex.org/S68686220","display_name":"Proceedings of the IEEE","issn_l":"0018-9219","issn":["0018-9219","1558-2256"],"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":"Proceedings of the IEEE","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1549460758","https://openalex.org/W1975754844","https://openalex.org/W2006724675","https://openalex.org/W2008470112","https://openalex.org/W2073086065","https://openalex.org/W2079222655","https://openalex.org/W2109521093"],"related_works":["https://openalex.org/W2028911956","https://openalex.org/W2144862959","https://openalex.org/W2161738160","https://openalex.org/W1952542430","https://openalex.org/W2134128809","https://openalex.org/W2031515099","https://openalex.org/W1974963296","https://openalex.org/W2034310980","https://openalex.org/W2107529204","https://openalex.org/W2058765580"],"abstract_inverted_index":{"It":[0],"is":[1,49],"shown":[2],"that":[3],"the":[4,12,41,53,56],"DFT":[5],"of":[6,55],"a":[7,28],"real":[8],"sequence,":[9],"formed":[10],"via":[11],"Fast":[13,30],"Hartley":[14],"Transform,":[15],"can":[16],"be":[17],"computed":[18],"at":[19],"most":[20],"only":[21],"2":[22],"times":[23],"faster":[24],"than":[25],"by":[26],"using":[27],"complex":[29],"Fourier":[31],"Transform.":[32],"However,":[33],"more":[34],"sophisticated":[35],"FFT":[36,59],"algorithms":[37],"exist":[38],"which":[39],"give":[40],"same":[42],"speedup":[43],"factor.":[44],"A":[45],"simple":[46],"FHT":[47,57],"subroutine":[48],"presented":[50],"to":[51],"illustrate":[52],"similarity":[54],"and":[58],"butterflies":[60],"in":[61],"their":[62],"simplest":[63],"forms.":[64]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}