Discrete Sampling: A Graph Theoretic Approach to Orthogonal Interpolation

DOI10.1109/TIT.2019.2934688MaRDI QIDQ5211563zbMATH OpenOpenAlexFDO

Authors Aditya Siripuram, W. Wu, Brad G. Osgood

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.7086

zbMATH Keywords

interpolation of discrete bandlimited signalorthogonal basisunitary submatrices of \(N \times N\) discrete Fourier transform matrix

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trigonometric interpolation (42A15) Sampling theory in information and communication theory (94A20)

Abstract: We study the problem of finding unitary submatrices of the $NimesN$ discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an orthogonal basis. This problem is related to a diverse set of questions on idempotents on $mathbb{Z}_N$ and tiling $mathbb{Z}_N$. In this work, we establish a graph-theoretic approach and connections to the problem of finding maximum cliques. We identify the key properties of these graphs that make the interpolation problem tractable when $N$ is a prime power, and we identify the challenges in generalizing to arbitrary $N$. Finally, we investigate some connections between graph properties and the spectral-tile direction of the Fuglede conjecture.

This page was built for publication: Discrete Sampling: A Graph Theoretic Approach to Orthogonal Interpolation

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