Sampling theorem and discrete Fourier transform on the Riemann sphere

被引:9
作者
Calixto, M. [1 ]
Guerrero, J. [2 ]
Sanchez-Monreal, J. C. [1 ]
机构
[1] Univ Politecn Cartagena, Dept Matemat Aplicada & Estadist, Cartagena 30203, Spain
[2] Univ Murcia, Dept Matemat Aplicada, E-30100 Murcia, Spain
关键词
holomorphic functions; coherent states; discrete Fourier transform; sampling; frames;
D O I
10.1007/s00041-008-9027-z
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Using coherent-state techniques, we prove a sampling theorem for Majorana's (holomorphic) functions on the Riemann sphere and we provide an exact reconstruction formula as a convolution product of N samples and a given reconstruction kernel (a sinc-type function). We also discuss the effect of over- and under-sampling. Sample points are roots of unity, a fact which allows explicit inversion formulas for resolution and overlapping kernel operators through the theory of Circulant Matrices and Rectangular Fourier Matrices. The case of band-limited functions on the Riemann sphere, with spins up to J, is also considered. The connection with the standard Euler angle picture, in terms of spherical harmonics, is established through a discrete Bargmann transform.
引用
收藏
页码:538 / 567
页数:30
相关论文
共 50 条
  • [41] ON THE DESIGN OF VLSI ARRAYS FOR DISCRETE FOURIER-TRANSFORM
    LIU, CM
    JEN, CW
    IEE PROCEEDINGS-G CIRCUITS DEVICES AND SYSTEMS, 1992, 139 (04): : 541 - 552
  • [42] The Discrete Fourier Transform of (r, s)-Even Functions
    Namboothiri, K. Vishnu
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2019, 50 (01) : 253 - 268
  • [43] Employing the Discrete Fourier Transform in the Analysis of Multiscale Problems
    Ryvkin, Michael
    INTERNATIONAL JOURNAL FOR MULTISCALE COMPUTATIONAL ENGINEERING, 2008, 6 (05) : 435 - 449
  • [44] Accuracy and Repeatability of Noise Measurements with a Discrete Fourier Transform
    Kulak, Ross A.
    PROCEEDINGS OF THE 2008 IEEE DALLAS CIRCUITS AND SYSTEMS WORKSHOP: SYSTEM-ON-CHIP (SOC) - DESIGN, APPLICATIONS, INTEGRATION, AND SOFTWARE, 2008, : 65 - 68
  • [45] A discrete Fourier transform based on Simpson's rule
    Singh, P.
    Singh, V.
    MATHEMATICAL METHODS IN THE APPLIED SCIENCES, 2012, 35 (02) : 151 - 157
  • [46] Discrete Fourier Transform for Short Samples in the Presence of Noise
    E. I. Gol'dshtein
    D. V. Li
    Measurement Techniques, 2004, 47 : 334 - 338
  • [47] DISCRETE FOURIER TRANSFORM ASSOCIATED WITH GENERALIZED SCHUR POLYNOMIALS
    van Diejen, J. F.
    Emsiz, E.
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2018, 146 (08) : 3459 - 3472
  • [48] A robust eigenbasis generation system for the discrete Fourier transform
    Zarei, Fatemeh
    Bardi, Ali Bagheri
    Yazdanpanah, Taher
    Dakovic, Milos
    Brajovic, Milos
    Stankovic, Ljubisa
    DIGITAL SIGNAL PROCESSING, 2024, 155
  • [49] Hardware efficient fast computation of the discrete fourier transform
    Cheng, C
    Parhi, KK
    JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2006, 42 (02): : 159 - 171
  • [50] Large-Scale Discrete Fourier Transform on TPUs
    Lu, Tianjian
    Chen, Yi-Fan
    Hechtman, Blake
    Wang, Tao
    Anderson, John
    IEEE ACCESS, 2021, 9 : 93422 - 93432