Fast Computing of Non-uniform Sampling Positions for Real Signals

There is a wide range of applications of non-equidistant discretization of real signals. For instance, in computer graphics, Fourier analysis, identification and control theories, etc. They have the common ability to describe dynamical systems as well. In this paper we provide a fast algorithm based on an existing mathematical model to compute a non-uniform grid for representing different types of signals. In order to do that we need new concepts for constructing an effective numerical solution. Additionally, two experiments are performed to investigate the accuracy of the method. Finally, we also present a parallel implementation in CUDA which can further improve the execution time.