Sampling and Frequency Warping
Stefan Lafon, Jacques L\'evy V\'ehel, Jacques Peyri\`ere

TL;DR
This paper introduces a frequency warping technique to transform non band-limited functions into band-limited ones, enabling Fourier decomposition and new basis functions, with theoretical and numerical analysis of reconstruction and convergence.
Contribution
It proposes a novel frequency warping method that creates new orthonormal bases for Sobolev spaces, enhancing sampling and reconstruction of non band-limited functions.
Findings
Effective frequency warping transforms functions into band-limited form
New orthonormal bases are expressed via Laguerre functions for integer alpha
Numerical experiments demonstrate improved reconstruction and convergence
Abstract
Optimal sampling of non band-limited functions is an issue of great importance that has attracted considerable attention. We propose to tackle this problem through the use of a frequency warping: First, by a nonlinear shrinking of frequencies, the function is transformed into a band-limited one. One may then perform a decomposition in Fourier series. This process gives rise to new orthonormal bases of the Sobolev spaces H^alpha. When alpha is an integer, these orthonormal bases can be expressed in terms of Laguerre functions. We study the reconstruction and speed of convergence properties of the warping-based sampling. Besides theoretical considerations, numerical experiments are performed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Mathematical functions and polynomials · Image and Signal Denoising Methods
Sampling and Frequency Warping
Stefan Lafon
Stefan Lafon, Google
,
Jacques Lévy Véhel
Jacques Lévy Véhel, Inria Rocquencourt
Projet Fractales
France
and
Jacques Peyrière
Jacques Peyrière, UMR 8628, CNRS, Université Paris-Sud, Universit Paris-Saclay. Université Paris-Sud, Mathématique bât. 425, 91405 Orsay Cedex, France.
Abstract.
Optimal sampling of non band-limited functions is an issue of great importance that has attracted considerable attention. We propose to tackle this problem through the use of a frequency warping: First, by a non-linear shrinking of frequencies, the function is transformed into a band-limited one. One may then perform a decomposition in Fourier series. This process gives rise to new orthonormal bases of the Sobolev spaces . When is an integer, these orthonormal bases can be expressed in terms of Laguerre functions. We study the reconstruction and speed of convergence properties of the warping-based sampling. Besides theoretical considerations, numerical experiments are performed.
Key words and phrases:
warping,sampling,signal processing, Sobolev spaces
1991 Mathematics Subject Classification:
94A12; 11K70, 46E35
1. Introduction
Sampling theory is a rich research topic that lies at the boundary between harmonic analysis and signal processing. The basic result is the Whittaker-Kotelnikov-Shannon theorem (WKS) [4, 8]: From a signal processing point of view, it tells that it is possible to reconstruct exactly a band-limited signal, i.e., a signal whose Fourier transform is compactly supported in , from regularly spaced samples provided the sampling frequency is not smaller than 1. From a theoretical point of view, it asserts the identity between the space of functions in whose Fourier transform vanishes outside and the space , where .
A huge literature has been devoted to generalizing the WKS theorem in various directions. Classical extensions include the case of non-regular sampling, multichannel sampling, or the sampling and reconstruction of functions in more general spaces. See [1, 3, 6, 7] for excellent reviews.
We propose the following treatment. We are given an increasing function from the interval onto . Then one can expand in Fourier series. The coefficients of this expansion bear the whole information contained in . Indeed, the original signal, when it lies in a Sobolev space, can be decomposed as the sum of a series , where the form an orthogonal basis of the Sobolev space under consideration.
First, in Section 2, we develop a general setting and define the warping operators. Afterwards, In Section 3, we particularise the situation and are able to derive formulas for the aforementioned which involve known special functions.
In Section 4, we examine the speed of approximation and compare the warping method to the usual sampling. In the last section, we give an account of computations an simulations. In particular we test and compare on several signals the efficiency of its representations either by sampling or by warping.
2. The general warping operators
2.1. Preliminaries and notation
For the Fourier transform of a function , we use the following convention:
[TABLE]
If and are two functions in , their scalar product is denoted by . We use the same notation if and .
The Heaviside function will be denoted by . The symbol stands either for the Dirac measure or the Kronecker sumbol, depending on the context.
If and , we define the generalized binomial coefficient to be
[TABLE]
if , and 1 if . With this convention, for all and , one has .
We also have the following formula
[TABLE]
We will use some special functions, namely the Whittaker function ([5], p. 88) and the generalized Laguerre polynomials ([9], p. 100)
[TABLE]
where and .
When the parameter is larger than , one has the following orthogonality relation
[TABLE]
2.2. The warping operators
We are given , an increasing function from onto an open interval of , and a positive function defined on .
The length of the interval , when it is bounded, will be denoted by and the mapping reciprocal to by . We set .
Let stand for the set of distributions on the Fourier transform of which is a function such that is finite. This definition makes sense when has a polynomial growth.
We always assume that both and have polynomial growth.
If , one has
[TABLE]
This legitimates the following definition.
Definition 1** (Warping operator).**
Given and , we define the warping operator as follows:
[TABLE]
In view of Formula 2.2, the operator is an isometry from onto . Therefore, if is an orthonormal basis of , one gets an orthonormal basis of in the following way:
[TABLE]
As a consequence, any , can be expanded in as the sum
[TABLE]
In this decomposition, the coefficients are expressed in terms of the inner product of . However, in practice, it is useful to have an expression of these coefficients as a distributional duality product (so that we merely need to know and not ).
As is isometrically isomorphic to the dual of , one has
[TABLE]
where , and the scalar product is the usual pairing of functions and distributions. One can notice that the arise from the preceding construction with the same function but with instead of .
3. The case
In this case we choose for the function , where is a real parameter. The corresponding warping operator will be denoted by . Then and . It results that the space is the ordinary Sobolev space .
3.1. A family of orthonormal bases
Choose a real parameter . Then the system of functions (for ) is an orthonormal basis of . The corresponding are defined by
[TABLE]
We draw the reader’s attention on the unusual labeling of these bases. But this notation will prove to be convenient.
In other terms
[TABLE]
where we use the principal determination of , i.e., the one which is defined on the simply connected open set and which assumes the value 0 at .
Remark 2*.*
The corresponding are defined by
[TABLE]
Indeed, they correspond to instead of .
The always satisfy a recursion relation.
Lemma 3**.**
For any and any , we have
[TABLE]
Proof.
We have
[TABLE]
and
[TABLE]
But
[TABLE]
and
[TABLE]
Therefore
[TABLE]
We conclude by taking the inverse Fourier transform. ∎
Formula (3.3) is reminiscent of the recursion relations satisfied by orthogonal polynomials. Indeed, as we shall see it in the next section, Laguerre polynomials come in when is an integer. Now, we express the in terms of the Whittaker function.
We have to compute the inverse Fourier transform of expressions of the form , where and are two real parameters.
When , is a function, otherwise we have to deal with a distribution.
It turns out that is expressible in terms of the Whittaker function when : according to [2], Formula 9 on page 345, we have
[TABLE]
valid for .
Proposition 4**.**
Provided that , one has
[TABLE]
Proof.
This is a reformulation of Formula (3.4)
Of course, in the distribution sense, . By using this remark and Proposition(4), one is able to deal with the case .
3.2. The case when is an integer and
The reason to take is that, with this setting, both and are integers when . It results that we have to consider Formula (3.4) when and are integers. In this case the expression of is much simpler.
Lemma 5**.**
Let be an integer and such that . Then
- (1)
For ,
[TABLE] 2. (2)
If moreover is a nonpositive integer, then for .
Proof.
Formula (3.5) is obtained by contour integration in the upper half plane, the second assertion by contour integral in the lower half plane.
In this setting we have the following facts.
Lemma 6**.**
For , one has .
Lemma 7**.**
Suppose and .Then
- (1)
if , , 2. (2)
if ,
[TABLE]
Proof.
This is a mere rewriting of (3.5) (notice that the corresponding and satisfy ).
Proposition 8** (The case ).**
Suppose and .
- •
If ,
[TABLE]
where stands for the -th Laguerre polynomial of order .
- •
If ,
[TABLE]
Proof.
By using Formula (3.6) with and one gets, for and ,
[TABLE]
The terms of this sum corresponding to being nul, one gets
[TABLE]
Moreover, since , one has for . The case results from .
The second assertion results from Formula (3.7)
∎
Proposition 9** (The case ).**
Suppose .
- •
If , then
[TABLE]
where powers are iterated convolutions.
- •
If , then
[TABLE]
Proof.
As previously, we have to compute knowing its Fourier transform
[TABLE]
- •
If , then
[TABLE]
which gives the first assertion.
- •
If , then and one writes
[TABLE]
We split the sum in equation (3.10) into two sums, the first one being the sum for to ,
[TABLE]
which can be rewritten as
[TABLE]
and gives the singular component.
The second sum
[TABLE]
is the Fourier transform of
[TABLE]
that is of
[TABLE]
or of
[TABLE]
- •
Le case is handled by Lemma 6.
∎
3.3. Decomposition of Sobolev spaces
In this section, is a positive integer.
Proposition 8 shows that we have to deal with three types of basis functions:
- •
the functions with , that are supported in ,
- •
the functions with , that are two-sided functions, localized around the origin, and
- •
the functions with , that are supported in .
Let , , and stand for the closed subspaces of generated respectively by , , and .
and are the sets of elements of which are supported in and respectively. The orthogonal complement of is of dimension .
Due to Proposition 9 The elements for , are linear combinations of , ,…, . This means that the projection of on can be expressed as
[TABLE]
where the functions are linear combinations of the for .
In these conditions, it is not difficult to show that
[TABLE]
The following figure shows the functions when .
If is the projection of on , one has (see Equation(2.4) and Remark 2)
[TABLE]
where
[TABLE]
due to Proposition 9.
If and , one has , from which one deduces
[TABLE]
Therefore, if , and if, for , one defines
[TABLE]
then one has
[TABLE]
The four following figures show some functions .
4. Speed of approximation
4.1. The strategy
We return for a moment to the general setting of Section 2. We saw that a signal in can be written a the sum of a series , which converges in norm within this Hilbert space.
In practice, and especially in a sampling framework, it is important both to secure convergence and to evaluate approximation rates in various norms such as and in addition to . As we shall see, it is possible to recover uniform or estimates from the -norm. Indeed, if the weight is bounded from below by a positive constant, then the convergence implies the one and if , it implies uniform convergence. Moreover, if , then one has uniform convergence of the derivatives up to order .
As a consequence, estimates of the uniform norm or the norm of may be deduced from estimates . But the coefficients are nothing but the Fourier coefficient of the warped function with respect to the orthonormal basis . Our strategy is thus simple: Choose for the trigonometric system, and then make use of classical properties of the Fourier coefficients. For instance, if a function on the torus is Hölder in the norm, one has . In this way one is able to get the speed of convergence of the series for functions such that the warped signal extends as a -periodic -function.
In order to achieve this program and to be able to give tractable conditions on the signal under processing, one has to particularize the warping function. The case studied in Section 3 gives rise to explicit formulae, but it will appear that there are not enough free parameters. This is why we introduce more general a family of warping operators.
4.2. Another family of warping operators
Inspired by the case treated above, we explore a more general setting where and are given by
[TABLE]
where and (as previously, stands for the function reciprocal to ).
Note that if could be of interest, but is not studied in this work.
We have
[TABLE]
As a consequence, is the usual Sobolev space of order
[TABLE]
It can be checked that, for any ,
[TABLE]
for large .
Moreover, when ,
[TABLE]
So, when ,
[TABLE]
Finally, using (4.3) and (4.5), it is easily proved that for all
[TABLE]
We are now ready to define a family of functional spaces for which speed of convergence results are easily obtained.
Definition 10**.**
If and , let denote the space of functions such that
- (1)
is times differentiable 2. (2)
if then for large .
Condition 2 obviously entails that is a subspace of for all positive . Condition 1 imposes some smoothness on . Functions in are thus sufficiently “well-behaved” both in the time and frequency domains.
Proposition 11**.**
Let be a positive integer and , , and be nonnegative real numbers satisfying , , and . Let be the -development of an . Then
- •
[TABLE]
- •
if moreover ,
[TABLE]
where .
Proof.
Since , we have . Consider the warped function . Due to 4.5 and to the fact , for all , one has,
[TABLE]
when . This means that extends as a -periodic -function (see [11]). It results the estimate for its Fourier coefficients. This implies , from which the conclusions easily follow.. ∎
Theorem 12**.**
Let belong to . Then one has the following facts.
- (1)
If , there exist and such that . 2. (2)
If , there exist and such that .
Where, in both cases, stands for the partial sum of the corresponding ()-warping expansion of .
Proof.
If suffices to check that, given and fulfilling the hypotheses, one can find and satisfying the constraints in Proposition • ‣ 11. ∎
The following corollary shows that functions with very regular Fourier transforms can be approximated with any prescribed polynomial speed.
Corollary 13**.**
Let belong to , with (rep. ). Then, for all , there exists a warping operator such that (resp. ).
4.3. Comparison with WKS sampling
Introductory remarks
In this section, we deal with the practical aspects of our warping method. We showed that, provided belongs to a given (large) class of signals, excellent approximations of can be obtained by keeping a finite number of terms in the sum .
Now, we are going to compare the warping with the classical sampling method based on low-pass filtering.
Assume we are given a analog signal , which needs to be digitized for purposes of storing, transmitting, or digital processing. A crude application of Shannon sampling consists in the following steps:
- (1)
to fix a sampling frequency , 2. (2)
to low-pass , i.e., to compute the convolution , where , 3. (3)
to approximate by .
This procedure generates two kinds of errors. The first one is due to low-pass filtering. The second one arises in step 3, because of the truncation of the series. Such a truncation is unavoidable since obviously one can access only finitely many samples in practice.
The warping procedure for digitizing signals proceeds as follows:
- (1)
to fix a natural number , 2. (2)
to compute the scalar products for , 3. (3)
to approximate by .
Again two kinds of errors are made. The first one lies in the estimation of the scalar products. As previously, the second one is a consequence of keeping finitely many terms in the sum in step 3. In this work, we shall assume that the first kind of error is negligible with respect to the second one. Indeed, when , we obtained explicit expressions for the . In this case, it is not too hard to devise a sufficiently precise numerical approximation scheme using these expressions. In more general cases, the scalar products may be harder to compute. We plan to investigate numerical quadrature schemes for solving this important problem in a forthcoming work.
If the WKS and warping procedures are to be compared, it is fair to set , henceforth denoted . One then needs to select a value for . Obviously, in the case where is not bandlimited, one would like to take as large as possible. However, in practice, one passes from the “time domain” to the “Fourier domain” through the Fast Fourier Transform. As a consequence, it does not make sense to choose larger than .
4.3.1. Worst case comparison
It is not easy to compare the error made in approximating an arbitrary function through WKS sampling and warping. In order to obtain tractable results, we shall rather compare the worst case approximations in both situations.
More precisely, for a function in , the error when considering terms in the cardinal series and setting is of order not larger than
[TABLE]
whereas the error is of order not larger than
[TABLE]
These errors only depend on , which is in contrast to what happens for the errors in the warping method.
Let us introduce the ratios of the worst cases errors corresponding to the warping and WKS sampling:
[TABLE]
[TABLE]
The following proposition gives conditions on , and under which warping is preferable to low-pass filtering, i.e., yields faster convergence rates.
Proposition 14** (Comparison in and ).**
Let be a positive integer and , , and be nonnegative real numbers satisfying , , , and . Then, the ratio of the worst cases errors for a function in sampled through the WKS theorem and through the warping operator with parameters () are such that:
- •
, and,
- •
if , .
Note that the conditions set on the parameters imply that for the error, and that for the error. Accordingly, must be at least 2 in the case, and at least 1 in the case: In order for the warping procedure to be better than the WKS one in, e.g., the sense, must thus be at least once differentiable with a derivative decaying faster than . For instance, functions in are advantageously sampled through warping (in the sense) with, e.g., .
Proof.
This results from Proposition • ‣ 11. ∎
5. Numerical experiments
We now present results of numerical experiments that illustrate the behavior of the warping method for approximating certain functions. We compare it to the quality of approximation obtained using the classical WKS sampling framework.
5.1. Methodology
We give ourselves a series of functions to be analyzed, and then reconstructed using the WKS sampling algorithm, and our method. We focus on the case , i.e., and the space of approximation is .
The full procedure is defined as:
- •
In the classical sampling approach, each signal is low-pass filtered at frequency , then sampled at the Nyquist frequency (the sampling pace is thus ). Finally, it is reconstructed as using the cardinal series. In our examples, all signals compactly supported (i.e., time limited) on , and therefore the summation is finite (there are terms).
- •
For our algorithm, each signal is decomposed into the system and is then reconstructed as
[TABLE]
- •
In each case we compute the uniform error, the error and the error. All errors are relative errors:
[TABLE]
- •
This process is repeated for several values of , typically .
This procedure allows us to study and compare the quality of approximation of both methods in terms of different metrics. Notice that in each case, the number of terms retained to reconstruct is . This is the cost of compression in terms of information quantity.
5.2. Practical implementation
Concerning the WKS sampling, functions must be low-pass filtered. From a practical point of view, two cases may be distinguished:
- •
Either the filtered version of has an analytic form, as is the case for the Riemann function
[TABLE]
In this case, bandlimiting is equivalent to truncating the sum, and the samples can be expressed in a closed form:
[TABLE]
The expression of the samples is then used to compute the cardinal series.
- •
Or there is no analytic form for the low-pass filtered version of . In this case the samples must be approximated using a Discrete Fourier Transform (DFT). We must thus first simulate a "continuous" (i.e., non-sampled) version of the signal. This is achieved by means of a large sampling rate. More precisely, we first discretize the signal on with a regular grid of points. We then compute the DFT (via a Fast Fourier Transform, FFT) of this approximate "continuous" signal, low-pass filtered the Fourier transform and then we applied an inverse DFT.
As regards the implementation of the warping method, two types of quantities must be computed. First the functions , for , and then the coefficients . The latter are expressed as a duality product between the signal to be analyzed and the dual functions .
We proceeded as follows: the functions were pre-computed under Maple in a discretized form (sampled on a regular grid of gridspace equal to ) using the analytic form given in section 3 for . For the dual functions , it is a bit more complicated: they correspond to and their expression is given in section 3 as a sum of a Dirac mass and an analytic part. These two components must be separated. We pre-computed the analytic part under Maple (like for the ) and was evaluated as the sum of the inner product of with the analytic part, plus a coefficient times (corresponding to the duality product with the Dirac mass).
It is to be noted that the error can also be evaluated in other Sobolev metrics, say in , where . In this case, one has to work in the Fourier domain and therefore use an FFT.
5.3. Results
We consider four examples of functions with increasing complexity. In each case, we display four curves. The first one is a superposition of the original function with the approximations yielded by both the WKS and the warping methods with a single, large, value of . The three other graphs describe the evolutions of the and errors of both approximation methods as a function of .
Cauchy Probability Distribution
Our first test deals with a smooth function, namely the Cauchy probability distribution . Since we consider the restriction of this function to , we however introduce a discontinuity at the endpoints, i.e., the values at 0 and 10 differ. The warping method appears extremely efficient when remains moderate (<30). Even for large values of , this method remains superior to the WKS algorithm as the errors for the latter is larger (see figure 7). One reason for this is the above mentioned discontinuity: As a consequence, the WKS approximation is quite bad around the boundaries of the domain , because in the sum many terms are missing. On the contrary, if one takes enough terms in the sum for the warping, the approximation is excellent around 0, and quite good at 10.
Chirp
We now consider a function with wild oscillations, the (modified) chirp , restricted to . The exponential factor aims at getting an function that is numerically equal to 0 at , so as not to penalize the WKS approximation with a boundary discontinuity. The two methods present similar performances, although there is a slight but noticeable gain of efficiency with the warping, as seen on figure 8.
Riemann function
We now focus on a function which is everywhere irregular and has a multifractal structure. The Riemann function is defined as
[TABLE]
In our numerical study, we took , which guarantees that . As above, we analyze the restriction to . The function is "numerically equal" to zero at , thus there is no discontinuity at the endpoints.
The results are shown on figure 9. Clearly the warping method gives better results. In fact, the sine series defining being lacunary, the WKS sampling method will not capture sine waves for increasingly long ranges of values of , and consequently, for , the WKS approximation remains the same (see the steps on figure 9). On the contrary, the warping approximation improves steadily as grows.
5.3.1. Weierstrass function
The same phenomenon occurs for the (modified) Weierstrass function
[TABLE]
where , and . This function has everywhere a Hölder exponent equal to . The Gaussian factor allows to obtain an function which is numerically 0 at , and with a Fourier transform:
[TABLE]
so that belongs to the spaces for all and .
From the results in Section 4, warping-based sampling will yield a better approximation than WKS sampling as soon as , with the following choice of the parameters:
, with , (when ).
In order to show that the warping method may outperform WKS sampling also for functions that do not belong to a space , we studied numerically the case and . The results are on figure 10. Again, the sine series is lacunary and the WKS error remains constant on large ranges of values of , resulting in strongly different behaviors for the WKS and warping approximations.
We conclude this section by mentioning how to treat the case where or . This is necessary in order to process with maximum accuracy functions in spaces with various values of and .
First, if and , we can use the expressions for given in section 3, and proceed exactly as for the case (i.e., ), that is by pre-computing and . Of course, for the dual functions, more Dirac masses come into play, and computing the inner product involves the evaluation of more derivatives of at 0. If , the warping function changes, and things get more complicated. There is however a situation where analytical computations are feasible: Indeed, when is an odd integer, it is possible to compute the expression of . Therefore one can proceed as in the case . In general, there will be no closed form expression for . These functions should then be approximated using their expression in the Fourier domain. More precisely, one can pre-compute the warping function on a grid:
[TABLE]
and use this to tabulate
[TABLE]
Then one can use an inverse DFT to obtain an approximation of . Likewise, the coefficients must be computed in the Fourier domain.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H.G. Feichtinger and K. Gröchenig, Theory and Practice of Irregular Sampling. In "Wavelets: Mathematics and Applications,” J. Benedetto and M. Frazier M., editors, CRC Press, 1993, 305–363.
- 2[2] I.S. Gradshteyn and I.M. Ryzhik, Table of integrals,series, and products. Academic Press, 2000. ISBN 0-12-294757-6.
- 3[3] Abdul J. Jerri, Integral and discrete transforms with applications and error analysis. Monographs and Textbooks in Pure and Applied Mathematics, 1992.
- 4[4] V.A. Kotel’nikov, On the transmission capacity of ether and wire in electrocommunications. Izd. Red. Upr. Svyazzi RKKA (Moscow), 1933.
- 5[5] W. Magnus and F. Oberhettinger, Formulas and theorems for the functions of mathematical physics. Chelsea publishing company.
- 6[6] R. J. Marks Introduction to Shannon Sampling and Interpolation Theory. Springer Texts in Electrical Engineering, New York, Berlin: Springer,1991
- 7[7] Advanced topics in Shannon sampling and interpolation theory. R. J. Marks (Ed.) Springer Texts in Electrical Engineering, New York, Berlin: Springer,1993.
- 8[8] C.E. Shannon, Communication in the presence of noise. in Proc. IRE, vol. 37, 1949, 10–21.
