{"id":"https://openalex.org/W2119282458","doi":"https://doi.org/10.1109/97.511807","title":"Efficient input reordering for the DCT based on a real-valued decimation-in-time FFT","display_name":"Efficient input reordering for the DCT based on a real-valued decimation-in-time FFT","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2119282458","doi":"https://doi.org/10.1109/97.511807","mag":"2119282458"},"language":"en","primary_location":{"id":"doi:10.1109/97.511807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/97.511807","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"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 Signal Processing Letters","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/A5043882095","display_name":"Rainer Storn","orcid":null},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Storn","raw_affiliation_strings":["International Computer Science Institute, Berkeley, CA, USA","Int. Comput. Sci. Inst., Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International Computer Science Institute, Berkeley, CA, USA","institution_ids":["https://openalex.org/I1297971548"]},{"raw_affiliation_string":"Int. Comput. Sci. Inst., Berkeley, CA, USA","institution_ids":["https://openalex.org/I1297971548"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043882095"],"corresponding_institution_ids":["https://openalex.org/I1297971548"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.27427862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"8","first_page":"242","last_page":"244"},"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.9998999834060669,"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.9998999834060669,"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.998199999332428,"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/T11417","display_name":"Advancements in PLL and VCO Technologies","score":0.9959999918937683,"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/discrete-cosine-transform","display_name":"Discrete cosine transform","score":0.885486900806427},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.8589742183685303},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.7698190212249756},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.7621639966964722},{"id":"https://openalex.org/keywords/decimation","display_name":"Decimation","score":0.7480851411819458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6372473239898682},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.6295244097709656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6260605454444885},{"id":"https://openalex.org/keywords/raders-fft-algorithm","display_name":"Rader's FFT algorithm","score":0.5822683572769165},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5332177877426147},{"id":"https://openalex.org/keywords/twiddle-factor","display_name":"Twiddle factor","score":0.4699530601501465},{"id":"https://openalex.org/keywords/discrete-sine-transform","display_name":"Discrete sine transform","score":0.4447858929634094},{"id":"https://openalex.org/keywords/discrete-hartley-transform","display_name":"Discrete Hartley transform","score":0.4242193400859833},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41190072894096375},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.32664281129837036},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.28949666023254395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2877175807952881},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.2576063871383667},{"id":"https://openalex.org/keywords/short-time-fourier-transform","display_name":"Short-time Fourier transform","score":0.14426878094673157},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.11249840259552002},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.0952308177947998},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.07562476396560669}],"concepts":[{"id":"https://openalex.org/C2221639","wikidata":"https://www.wikidata.org/wiki/Q2877","display_name":"Discrete cosine transform","level":3,"score":0.885486900806427},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.8589742183685303},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.7698190212249756},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.7621639966964722},{"id":"https://openalex.org/C173642442","wikidata":"https://www.wikidata.org/wiki/Q1253346","display_name":"Decimation","level":3,"score":0.7480851411819458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6372473239898682},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.6295244097709656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6260605454444885},{"id":"https://openalex.org/C69598009","wikidata":"https://www.wikidata.org/wiki/Q7280126","display_name":"Rader's FFT algorithm","level":5,"score":0.5822683572769165},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5332177877426147},{"id":"https://openalex.org/C4697666","wikidata":"https://www.wikidata.org/wiki/Q7857913","display_name":"Twiddle factor","level":5,"score":0.4699530601501465},{"id":"https://openalex.org/C167058841","wikidata":"https://www.wikidata.org/wiki/Q971039","display_name":"Discrete sine transform","level":5,"score":0.4447858929634094},{"id":"https://openalex.org/C192853989","wikidata":"https://www.wikidata.org/wiki/Q1006531","display_name":"Discrete Hartley transform","level":5,"score":0.4242193400859833},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41190072894096375},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.32664281129837036},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.28949666023254395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2877175807952881},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.2576063871383667},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.14426878094673157},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.11249840259552002},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.0952308177947998},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.07562476396560669},{"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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/97.511807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/97.511807","pdf_url":null,"source":{"id":"https://openalex.org/S120629676","display_name":"IEEE Signal Processing Letters","issn_l":"1070-9908","issn":["1070-9908","1558-2361"],"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 Signal Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.2102","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.2102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.icsi.berkeley.edu/pub/techreports/1995/tr-95-061.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.644.8088","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.644.8088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://http.icsi.berkeley.edu/ftp/global/pub/techreports/1995/tr-95-061.pdf","raw_type":"text"}],"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/W2026122614","https://openalex.org/W2037221767","https://openalex.org/W2054042449","https://openalex.org/W2117808533","https://openalex.org/W2134128809","https://openalex.org/W2138562746","https://openalex.org/W2321734724"],"related_works":["https://openalex.org/W2097307037","https://openalex.org/W2028911956","https://openalex.org/W2397577925","https://openalex.org/W1952542430","https://openalex.org/W1541916968","https://openalex.org/W2075991343","https://openalex.org/W1829728853","https://openalex.org/W2119282458","https://openalex.org/W2034310980","https://openalex.org/W4253528499"],"abstract_inverted_index":{"The":[0],"possibility":[1],"of":[2,9,66,102],"computing":[3],"the":[4,26,45,50,58,63,67],"discrete":[5,18],"cosine":[6],"transform":[7,20,71],"(DCT)":[8],"length":[10],"N=2/sup":[11],"v/,":[12],"v":[13],"integer,":[14],"via":[15,53],"an":[16],"N-point":[17],"Fourier":[19,70],"(DFT)":[21],"is":[22,29,55,81,94],"widely":[23],"known":[24],"from":[25],"literature.":[27],"It":[28],"demonstrated":[30],"that":[31,93],"this":[32,100],"computation":[33,52],"can":[34],"be":[35],"done":[36],"in":[37,96],"place":[38],"by":[39,62],"just":[40],"employing":[41],"butterfly":[42],"swaps":[43],"if":[44],"input":[46],"reordering":[47],"(necessary":[48],"for":[49,76],"DCT":[51,86],"DFT)":[54],"combined":[56],"with":[57],"bit-reverse":[59],"scrambling":[60],"required":[61],"real-valued":[64,78],"version":[65],"decimation-in-time":[68],"fast":[69],"algorithm.":[72],"As":[73],"computer":[74],"code":[75],"many":[77],"FFT":[79],"algorithms":[80],"publicly":[82],"available,":[83],"and":[84],"FFT-based":[85],"computations":[87],"exhibit":[88],"a":[89],"very":[90],"regular":[91],"structure":[92],"helpful":[95],"signal":[97],"processor":[98],"implementations,":[99],"method":[101],"DCT-computation":[103],"becomes":[104],"even":[105],"more":[106],"attractive.":[107]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}