During the past decade, there have been an increasing number of papers devoted to the use of polynomial splines in signal processing -. The interest in these techniques grew after it was shown that most classical spline- fitting problems on a uniform grid (interpolation, least squares, and smoothing splines) could be solved efficiently using recursive digital filtering techniques. These spline-based algorithms have been found to be quite advantageous for image processing and medical imaging, especially in the context of high-quality interpolation, where it has been demonstrated that they yield the best cost-quality tradeoff among all linear techniques -. Polynomial splines have also been shown to play a fundamental role in wavelet theory .
Although there are a few applications of polynomial splines in continuous-time signal processing, splines have apparently had less impact in this area. Part of the reason may be that (piecewise) polynomials do only appear marginally in basic systems theory. The most prominent functions in continuous-time signal-and-systems theory are the exponentials, which correspond to the modes of differential systems (analog filters and circuits). Having made this observation and motivated by the search for a unification between the continuous and discrete-time approaches to signal processing, Unser  deals with the task of extending the previously mentioned formulation to the enlarged class of exponential splines. These splines, as their name suggests, are made up of exponential segments that are connected together in a smooth fashion. They form a natural extension of the polynomial splines and have been characterized mathematically in relatively general terms  .
The kind of splines that are the most appropriate for signal processing are the cardinal ones, which are defined on a uniform grid. Mathematically, this corresponds to the simplest possible setup, which goes back to the pioneering work of Schoenberg on polynomial splines in 1946 . In his early paper, it was shown that every cardinal polynomial spline has a unique and stable representation in terms of B-spline expansion. For cardinal exponential spline which is general concept of polynomial spline, Unser showed that if one excludes the pathological case of improperly spaced imaginary roots, then every cardinal exponential spline with suitable parameter has a unique and stable representation in terms of its B-spline expansion .
We present several methods to implement exponential B-splines. The paper is organized as follows. In Section 2, we begin with abrief introduction of exponential B-splines and notations needed throughout the paper. In Section 3, the methods will be presented. The conclusion is given in Section 4.
Vectors are marked with an arrow and are used to represent N-tuples, i.e.,.
The Fourier transform of is denoted by. For, it is given by
otherwise, it is defined in the distributional sense. The Laplace transform of a causal (possibly exponentially increasing) function is defined as
The one-sided power function is. The discrete signal, , is characterized by its z-transform.
2.2. Exponential B-Splines (E-Splines)
Let us consider the generic differential operator of order N
with constant coefficients,whose argument is some continuously varying time function. Here, denotes the nth-order derivative, and is the identity operator. The operator L is also characterized by the roots of its characteristic polynomial
We will therefore use the notation, where is a vector that specifies the roots explicitly.
Definition 2.1. An exponential spline with parameter and knots is a function such that
where the sequence is bounded and where is the Dirac distribution.
The cardinal exponential splines correspond to the specialized case where the knots are at the integer, i.e.,. This particular framework allows for important simplifications and that it is ideally suited for a signal processing formulation.
We now introduce the exponential B-spline (say E-spline from now on) representation theorem, which is a generalization of Schoenberg’s classical result  for cardinal polynomial splines and which shows the implementation of E-splines is enough to get for a signal processing using exponential spline.
Theorem 2.2.  The set of functions provides a Riesz basis of, the space of cardinal exponential splines with finite energy, if and only if, for all pairs of distinct, purely imaginary roots.
Thus, if one excludes the pathological cases of improperly spaced imaginary roots first identified by Ron , this means that every cardinal exponential spline with parameter has a unique and stable representation in terms of its B-spline expansion
The E-splines are localized, that is compactly supported and shortest possible, versions of the Green functions that generate the exponential splines. The way in which such E-splines are constructed is especially easy to understand in the first-order case. One takes the green function of and subtracts a shifted, and properly weighted, version of it to annihilate the exponential term. This yields the first order E-spline with parameter
Note that this first-order E-spline is supported in [0, 1), irrespective of. In addition, it is non-negative, provided that is not oscillating, that is, when is real.
The higher order E-splines are obtained by successive convolution of lower order ones:
which is a process that is justified by the convolution relation of the corresponding Green functions.
3. Method to Implementing E-Splines
In general, E-splines with parameter with is compactly supported and N-2 times differentiable so that it has a convergent Poisson summation formula as
From the Poisson summation formula of E-splines, we take a finite number of terms of the summation as an approximation of E-splines and find its truncation error bound as follows:
Theorem 3.1. Define ()-term approximation of E-splines as
and let. Then we have
The proof completes by.
In this paper, we present the method to implement exponential B-splines by its Poisson summation formula. We achieve an explicit formula on the truncation error bound for exponential B-spline. As the future work, one can generalize de Boor’s order recursion for the calculation of B-splines  into that for E-splines.
The author thanks Prof. Michael Unser for useful comments and suggestions during the preparation of the manuscript.
 Meijering, E.H.W., Niessen, W.J. and Viergever, M.A. (2001) Quantitative Ecaluation of Convolution-Based Methods for Medical Image Interpolation. Med. Image Anal., 5, 111-126. http://dx.doi.org/10.1016/S1361-8415(00)00040-2
 Dahmen, W. and Micchelli, C.A. (1987) On Theory and Application of Exponential Splines. In: Chui, C.K., Shumaker, L.L. and Utreras, F.I., Eds., Topics in Multivariate Approximation, Academic, New York, 37-46. http://dx.doi.org/10.1016/b978-0-12-174585-1.50008-7