{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T02:48:36Z","timestamp":1775184516586,"version":"3.50.1"},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371364"],"award-info":[{"award-number":["62371364"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.sigpro.2026.110567","type":"journal-article","created":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:53:27Z","timestamp":1771952007000},"page":"110567","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A robust non-uniform sparse Fourier transform algorithm and its applications"],"prefix":"10.1016","volume":"245","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0181-9264","authenticated-orcid":false,"given":"Deyun","family":"Wei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1199-410X","authenticated-orcid":false,"given":"Yingdong","family":"Rao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/j.sigpro.2026.110567_bib0001","doi-asserted-by":"crossref","first-page":"1661","DOI":"10.1016\/S0165-1684(03)00079-3","article-title":"Frequency estimation using warped discrete Fourier transform","volume":"83","author":"Franz","year":"2003","journal-title":"Signal Process."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0002","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1006\/acha.1997.0223","article-title":"Using the discrete Fourier transform to analyze the convergence of subdivision schemes","volume":"5","author":"Kobbelt","year":"1998","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.sigpro.2026.110567_bib0003","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1049\/iet-spr.2009.0288","article-title":"Fractionalisation of an odd time odd frequency DFT matrix based on the eigenvectors of a novel nearly tridiagonal commuting matrix","volume":"5","author":"Wei","year":"2011","journal-title":"IET Signal Process."},{"issue":"23","key":"10.1016\/j.sigpro.2026.110567_bib0004","doi-asserted-by":"crossref","first-page":"6171","DOI":"10.1109\/TSP.2017.2750105","article-title":"Discrete fractional Fourier transforms based on closed-form hermite\u2013Gaussian-Like DFT eigenvectors","volume":"65","author":"de Oliveira Neto","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110567_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2022.108682","article-title":"Two-dimensional sparse fractional Fourier transform and its applications","volume":"201","author":"Wei","year":"2022","journal-title":"Signal Process."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110567_bib0006","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.sigpro.2010.05.007","article-title":"The discrete fractional Fourier transform based on the DFT matrix","volume":"91","author":"Serbes","year":"2011","journal-title":"Signal Process."},{"issue":"17","key":"10.1016\/j.sigpro.2026.110567_bib0007","doi-asserted-by":"crossref","first-page":"4553","DOI":"10.1109\/TSP.2018.2855658","article-title":"Sliding discrete linear canonical transform","volume":"66","author":"Sun","year":"2018","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110567_bib0008","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.sigpro.2006.09.008","article-title":"New sampling formulae related to linear canonical transform","volume":"87","author":"Li","year":"2007","journal-title":"Signal Process."},{"issue":"7","key":"10.1016\/j.sigpro.2026.110567_bib0009","doi-asserted-by":"crossref","first-page":"1658","DOI":"10.1016\/j.sigpro.2011.12.024","article-title":"Approximating bandlimited signals associated with the LCT domain from nonuniform samples at unknown locations","volume":"92","author":"Li","year":"2012","journal-title":"Signal Process."},{"issue":"21","key":"10.1016\/j.sigpro.2026.110567_bib0010","doi-asserted-by":"crossref","first-page":"5527","DOI":"10.1109\/TSP.2019.2941071","article-title":"Linear canonical wigner distribution based noisy LFM signals detection through the output SNR improvement analysis","volume":"67","author":"Zhang","year":"2019","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110567_bib0011","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.sigpro.2015.06.010","article-title":"New wigner distribution and ambiguity function based on the generalized translation in the linear canonical transform domain","volume":"118","author":"Zhang","year":"2016","journal-title":"Signal Process."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110567_bib0012","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0165-1684(90)90158-U","article-title":"Fast fourier transforms: a tutorial review and a state of the art","volume":"19","author":"Duhamel","year":"1990","journal-title":"Signal Process."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110567_bib0013","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/JPROC.2004.840301","article-title":"The design and implementation of FFTW3","volume":"93","author":"Frigo","year":"2005","journal-title":"Proc. IEEE."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110567_bib0014","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/LSP.2014.2306996","article-title":"Novel tridiagonal commuting matrices for types I, IV, V, VIII DCT and DST matrices","volume":"21","author":"Wei","year":"2014","journal-title":"IEEE Signal Process. Lett."},{"key":"10.1016\/j.sigpro.2026.110567_bib0015","doi-asserted-by":"crossref","first-page":"5259","DOI":"10.1109\/TSP.2021.3107974","article-title":"Fast numerical computation of two-dimensional non-separable linear canonical transform based on matrix decomposition","volume":"69","author":"Wei","year":"2021","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110567_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2021.108046","article-title":"Sparse discrete linear canonical transform and its applications","volume":"183","author":"Wei","year":"2021","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110567_bib0017","doi-asserted-by":"crossref","first-page":"4468","DOI":"10.1109\/TSP.2022.3205758","article-title":"Non-uniform sparse Fourier transform and its applications","volume":"70","author":"Wei","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110567_bib0018","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.sigpro.2017.07.035","article-title":"Spectrum optimization via FFT-based conjugate gradient method for unimodular sequence design","volume":"142","author":"Zhao","year":"2018","journal-title":"Signal Process."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0019","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.sigpro.2011.06.002","article-title":"FFT implementation of Doppler dependent pre-Doppler STAP","volume":"92","author":"Wu","year":"2012","journal-title":"Signal Process."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110567_bib0020","doi-asserted-by":"crossref","first-page":"2182","DOI":"10.1109\/TSP.2011.2112650","article-title":"Sensitivity to basis mismatch in compressed sensing","volume":"59","author":"Chi","year":"2011","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110567_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2021.108232","article-title":"Estimation of parameters of multiple chirp signal in presence of additive alpha-stable errors","volume":"189","author":"Nandi","year":"2021","journal-title":"Signal Process."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110567_bib0022","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/78.275600","article-title":"A novel method for designing FIR digital filters with nonuniform frequency samples","volume":"42","author":"Angelidis","year":"1994","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110567_bib0023","first-page":"422","article-title":"The nonuniform discrete Fourier transform and its applications in filter design. I. 1-D","volume":"43","author":"Bagchi","year":"1996","journal-title":"IEEE Trans. Circuits Syst. II: Analog Digit. Signal Process."},{"issue":"11","key":"10.1016\/j.sigpro.2026.110567_bib0024","doi-asserted-by":"crossref","first-page":"2996","DOI":"10.1016\/j.sigpro.2010.04.018","article-title":"Efficient matched filters for DFT based codes","volume":"90","author":"Fam","year":"2010","journal-title":"Signal Process."},{"key":"10.1016\/j.sigpro.2026.110567_bib0025","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10915-010-9364-3","article-title":"On reconstruction from non-uniform spectral data","volume":"45","author":"Viswanathan","year":"2010","journal-title":"J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0026","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcp.2004.12.004","article-title":"The type 3 nonuniform FFT and its applications","volume":"206","author":"Lee","year":"2005","journal-title":"J. Comput. Phys."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110567_bib0027","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0165-1684(96)00131-4","article-title":"MRI scan time reduction through non-uniform sampling and SVD-based estimation","volume":"55","author":"Dologlou","year":"1996","journal-title":"Signal Process."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110567_bib0028","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/S003614459731533X","article-title":"Fast approximate Fourier transforms for irregularly spaced data","volume":"40","author":"Ware","year":"1998","journal-title":"SIAM Rev."},{"issue":"6","key":"10.1016\/j.sigpro.2026.110567_bib0029","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1137\/0914081","article-title":"Fast Fourier transforms for nonequispaced data","volume":"14","author":"Dutt","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0030","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/acha.1995.1007","article-title":"Fast Fourier transforms for nonequispaced data, II","volume":"2","author":"Dutt","year":"1995","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0031","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/75.650975","article-title":"An accurate algorithm for nonuniform fast Fourier transforms (NUFFT\u2019s)","volume":"8","author":"Liu","year":"1998","journal-title":"IEEE Microw. Guided Wave Lett."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0032","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1137\/S1064827597325712","article-title":"The regular Fourier matrices and nonuniform fast Fourier transforms","volume":"21","author":"Nguyen","year":"1999","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110567_bib0033","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/TSP.2002.807005","article-title":"Nonuniform fast Fourier transforms using min-max interpolation","volume":"51","author":"Fessler","year":"2003","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110567_bib0034","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S003614450343200X","article-title":"Accelerating the nonuniform fast Fourier transform","volume":"46","author":"Greengard","year":"2004","journal-title":"SIAM Rev."},{"issue":"5","key":"10.1016\/j.sigpro.2026.110567_bib0035","doi-asserted-by":"crossref","first-page":"C479","DOI":"10.1137\/18M120885X","article-title":"A parallel nonuniform fast Fourier transform library based on an \u201cexponential of semicircle\u201d kernel","volume":"41","author":"Barnett","year":"2019","journal-title":"SIAM J. Sci. Comput."},{"issue":"17","key":"10.1016\/j.sigpro.2026.110567_bib0036","first-page":"1","article-title":"Uniform error estimates for nonequispaced fast Fourier transforms","volume":"19","author":"Potts","year":"2021","journal-title":"Sampling Theory Signal Process. Data Anal."},{"issue":"4","key":"10.1016\/j.sigpro.2026.110567_bib0037","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1007\/s11075-022-01389-6","article-title":"Nonuniform fast Fourier transforms with nonequispaced spatial and frequency data and fast sinc transforms","volume":"92","author":"Kircheis","year":"2022","journal-title":"Numer. Algorithms"},{"issue":"4","key":"10.1016\/j.sigpro.2026.110567_bib0038","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1137\/0917059","article-title":"Rapid computation of the discrete Fourier transform","volume":"17","author":"Anderson","year":"1996","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0039","doi-asserted-by":"crossref","first-page":"A529","DOI":"10.1137\/17M1134822","article-title":"A nonuniform fast Fourier transform based on low rank approximation","volume":"40","author":"Ruiz-Antol\u00edn","year":"2018","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.sigpro.2026.110567_bib0040","series-title":"Proc. 44th Annu. ACM Symp. Theory Comput.","first-page":"563","article-title":"Nearly optimal sparse Fourier transform","author":"Hassanieh","year":"2012"},{"key":"10.1016\/j.sigpro.2026.110567_bib0041","series-title":"Proc. 51st Annu. Allerton Conf. Commun., Control, Comput.","first-page":"1258","article-title":"Sample-optimal average-case sparse Fourier transform in two dimensions","author":"Ghazi","year":"2013"},{"key":"10.1016\/j.sigpro.2026.110567_bib0042","series-title":"Proc. Annu. ACM-SIAM Symp. Discrete Algorithms.","first-page":"1183","article-title":"Simple and practical algorithm for sparse Fourier transform","author":"Hassanieh","year":"2012"},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0043","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/TIT.2017.2746568","article-title":"FFAST: an algorithm for computing an exactly k-Sparse DFT in O(klog\u2009k) time","volume":"64","author":"Pawar","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.sigpro.2026.110567_bib0044","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.acha.2015.05.002","article-title":"Sparse high-dimensional FFT based on rank-1 lattice sampling","volume":"41","author":"Potts","year":"2016","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.sigpro.2026.110567_bib0045","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.acha.2020.11.002","article-title":"High-dimensional sparse FFT based on sampling along multiple rank-1 lattices","volume":"51","author":"K\u00e4mmerer","year":"2021","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0046","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10858-015-9952-5","article-title":"Fast multi-dimensional NMR acquisition and processing using the sparse FFT","volume":"63","author":"Hassanieh","year":"2015","journal-title":"J. Biomol. NMR"},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0047","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2682631","article-title":"Light field reconstruction using sparsity in the continuous Fourier domain","volume":"34","author":"Shi","year":"2014","journal-title":"ACM Trans. Graph."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110567_bib0048","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.acha.2013.12.005","article-title":"Analysis of sparse MIMO radar","volume":"37","author":"Strohmer","year":"2014","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"10.1016\/j.sigpro.2026.110567_bib0049","doi-asserted-by":"crossref","first-page":"1346","DOI":"10.11591\/ijece.v10i2.pp1346-1351","article-title":"A review on sparse fast Fourier transform applications in image processing","volume":"10","author":"Ghani","year":"2020","journal-title":"Int. J. Elect. Comput. Eng."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0050","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/100811593","article-title":"A butterfly algorithm for synthetic aperture radar imaging","volume":"5","author":"Demanet","year":"2012","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"10.1016\/j.sigpro.2026.110567_bib0051","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1137\/08071291X","article-title":"Sparse Fourier transform via butterfly algorithm","volume":"31","author":"Ying","year":"2009","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.sigpro.2026.110567_bib0052","series-title":"Proc. 2015 IEEE 56th Annu. Symp. Found. Comput. Sci.","first-page":"583","article-title":"A robust sparse Fourier transform in the continuous setting","author":"Price","year":"2015"},{"issue":"6","key":"10.1016\/j.sigpro.2026.110567_bib0053","doi-asserted-by":"crossref","first-page":"2735","DOI":"10.1109\/TAES.2017.2714918","article-title":"The robust sparse Fourier transform (RSFT) and its application in radar signal processing","volume":"53","author":"Wang","year":"2017","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"issue":"1","key":"10.1016\/j.sigpro.2026.110567_bib0054","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1109\/TSP.2016.2599483","article-title":"Optimized spectrum permutation for the multidimensional sparse FFT","volume":"65","author":"Rauh","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"issue":"21","key":"10.1016\/j.sigpro.2026.110567_bib0055","doi-asserted-by":"crossref","first-page":"5716","DOI":"10.1109\/TSP.2017.2740198","article-title":"On performance of sparse fast Fourier transform and enhancement algorithm","volume":"65","author":"Chen","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.sigpro.2026.110567_bib0056","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2020.107823","article-title":"Performance evaluation and parameter optimization of sparse Fourier transform","volume":"179","author":"Zhang","year":"2021","journal-title":"Signal Process."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426000812?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168426000812?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:50:11Z","timestamp":1775181011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168426000812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":56,"alternative-id":["S0165168426000812"],"URL":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110567","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A robust non-uniform sparse Fourier transform algorithm and its applications","name":"articletitle","label":"Article Title"},{"value":"Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.sigpro.2026.110567","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"110567"}}