{"id":"https://openalex.org/W2584022139","doi":"https://doi.org/10.1109/icassp.1985.1168473","title":"Optimum binary windows for discrete Fourier transform","display_name":"Optimum binary windows for discrete Fourier transform","publication_year":2005,"publication_date":"2005-03-23","ids":{"openalex":"https://openalex.org/W2584022139","doi":"https://doi.org/10.1109/icassp.1985.1168473","mag":"2584022139"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1985.1168473","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1985.1168473","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing","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/A5109186271","display_name":"K.M.M. Prabhu","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"K. Prabhu","raw_affiliation_strings":["Centre for Systems and Devices, Indian Institute of Technology, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Centre for Systems and Devices, Indian Institute of Technology, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109186271"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.39167762,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"756","last_page":"759"},"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/T12300","display_name":"Advanced Electrical Measurement Techniques","score":0.9997000098228455,"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.998199999332428,"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/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.6860106587409973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6303800940513611},{"id":"https://openalex.org/keywords/desktop-window-manager","display_name":"Desktop Window Manager","score":0.6139275431632996},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6041774749755859},{"id":"https://openalex.org/keywords/microsoft-windows","display_name":"Microsoft Windows","score":0.5975035429000854},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5747614502906799},{"id":"https://openalex.org/keywords/windows-ce","display_name":"Windows CE","score":0.5559892654418945},{"id":"https://openalex.org/keywords/windows-vista","display_name":"Windows Vista","score":0.531710684299469},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4929351806640625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4835209846496582},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.48306113481521606},{"id":"https://openalex.org/keywords/frequency-domain","display_name":"Frequency domain","score":0.4377998113632202},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43566256761550903},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.37596866488456726},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36925777792930603},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.3337196707725525},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.2854270040988922},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2569658160209656},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2204447090625763},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.1816379427909851},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.14578849077224731},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.12656056880950928},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.09648120403289795},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09107798337936401},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.07862406969070435},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.06362384557723999}],"concepts":[{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.6860106587409973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6303800940513611},{"id":"https://openalex.org/C765897","wikidata":"https://www.wikidata.org/wiki/Q1200785","display_name":"Desktop Window Manager","level":5,"score":0.6139275431632996},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6041774749755859},{"id":"https://openalex.org/C508378895","wikidata":"https://www.wikidata.org/wiki/Q1406","display_name":"Microsoft Windows","level":3,"score":0.5975035429000854},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5747614502906799},{"id":"https://openalex.org/C512140200","wikidata":"https://www.wikidata.org/wiki/Q488244","display_name":"Windows CE","level":4,"score":0.5559892654418945},{"id":"https://openalex.org/C527868296","wikidata":"https://www.wikidata.org/wiki/Q11230","display_name":"Windows Vista","level":4,"score":0.531710684299469},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4929351806640625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4835209846496582},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.48306113481521606},{"id":"https://openalex.org/C19118579","wikidata":"https://www.wikidata.org/wiki/Q786423","display_name":"Frequency domain","level":2,"score":0.4377998113632202},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43566256761550903},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.37596866488456726},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36925777792930603},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.3337196707725525},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2854270040988922},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2569658160209656},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2204447090625763},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.1816379427909851},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.14578849077224731},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.12656056880950928},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.09648120403289795},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09107798337936401},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.07862406969070435},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.06362384557723999},{"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/icassp.1985.1168473","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1985.1168473","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2060605975","https://openalex.org/W2111460811","https://openalex.org/W2160502247"],"related_works":["https://openalex.org/W2339609355","https://openalex.org/W26165096","https://openalex.org/W563467322","https://openalex.org/W2583333928","https://openalex.org/W2600092258","https://openalex.org/W4256444941","https://openalex.org/W2462491885","https://openalex.org/W2500685539","https://openalex.org/W583547462","https://openalex.org/W2912223786"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3],"set":[4],"of":[5,14,31,88],"windows,":[6,9,90],"called":[7],"binary":[8,68],"for":[10],"frequency":[11],"domain":[12],"windowing":[13],"discrete":[15],"Fourier":[16],"transforms.":[17],"The":[18,63],"new":[19],"windows":[20,32,43,59,69],"suggested":[21,34,44,60],"do":[22],"not":[23],"require":[24],"multiplications":[25],"or":[26],"stored":[27],"constants.":[28],"A":[29],"number":[30],"are":[33,82],"whose":[35],"main-lobe":[36],"widths":[37],"fall":[38],"between":[39],"Hamming[1]":[40],"and":[41,47],"the":[42,57,71,86,89,93],"by":[45,61,85],"Harris[2]":[46],"Nuttall":[48],"[3],":[49],"while":[50],"having":[51],"better":[52],"sidelobe":[53],"behaviour":[54],"compared":[55],"to":[56,91,100],"near-optimum":[58],"Kaiser[4].":[62],"distinct":[64],"advantage":[65],"in":[66,95],"using":[67],"is":[70],"ease":[72],"with":[73],"which":[74],"they":[75],"can":[76],"be":[77],"implemented.":[78],"Finally,":[79],"efficient":[80],"structures":[81],"suggested,":[83],"followed":[84],"plots":[87],"enable":[92],"user":[94],"selecting":[96],"an":[97],"appropriate":[98],"window":[99],"suit":[101],"his":[102],"requirements.":[103]},"counts_by_year":[{"year":2018,"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"}