A Computable Fourier Condition Generating Alias-Free Sampling Lattices

DOI10.1109/TSP.2009.2013904MaRDI QIDQ4571678zbMATH OpenFDO

Authors Yue M. Lu, Minh N. do, R. S. Laugesen

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSP.2009.2013904

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11)

Recommendations

• Estimation of Fourier Transform Using Alias-Free Hybrid-Stratified Sampling
• Computing reconstructions from nonuniform Fourier samples: universality of stability barriers and stable sampling rates
• scientific article; zbMATH DE number 1982953
• Sampling theory in a Fourier algebra setting
• Stable sampling and Fourier multipliers
• Algorithmic Number Theory
• Optimal algebraic integer implementation with application to complex frequency sampling filters
• Generalized sampling and the stable and accurate reconstruction of piecewise analytic functions from their Fourier coefficients
• Nonperiodic sampling of bandlimited functions on unions of rectangular lattices.
• The polynomial degree of recursive Fourier sampling

Cited in

(4)

• scientific article; zbMATH DE number 1834641 (Why is no real title available?)
• Multi-dimensional linear canonical transform with applications to sampling and multiplicative filtering
• Lattices sampling and sampling rate conversion of multidimensional bandlimited signals in the linear canonical transform domain
• Multi-dimensional unlimited sampling and robust reconstruction

This page was built for publication: A Computable Fourier Condition Generating Alias-Free Sampling Lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571678)