1. Introduction
For two functions
and
with respective Fourier transforms
and
defined by
we multiply the two Fourier transforms,
and ask for the time function
whose Fourier transform is
,
By substituting Equations (
1) and (2) into Equation (
4), one obtains that
The function
is called the convolution of the functions
and
often symbolized with the notation
It is remarkable that this simple idea has found applications in almost all fields of science, engineering, and mathematics [
1,
2,
3,
4]. This is the case because it naturally arises for various physical and mathematical reasons. In some sense, the fundamental reason for the importance of convolution is filtering, as one can view the situation that
is the filtered version of
when it is filtered by
and the resulting time function, the filtered time function, is the convolution. We point out that in some mathematical fields,
is called the convolution transform [
5]. A related concept is the correlation of two functions, which we discuss in Sec. X.
Our aim in this paper is to generalize the concept of convolution to basis sets other than the Fourier basis.
2. Notation and Mathematical Preliminaries
All integrals go from
to
∞ unless otherwise indicated. Operators are indicated by boldface characters and operate on functions of
in cases where they do not, we will denote that by, for example,
which indicates that
is operating on functions of
. We shall be dealing with self-adjoint operators (called Hermitian operators in Physics and Chemistry [
6,
7,
8]).
For the eigenvalue problem, for the continuous case, we write
where the
’s are the eigenvalues, and
are the eigenfunctions respectively. If the spectrum is discrete, we write
where now the eigenvalues are given by the discrete set,
, and the corresponding eigenfunctions by
. Self-adjoint operators have real eigenvalues, and the eigenfunctions form a complete set.
We normalize the eigenfunctions to a delta function, [
8]).
and for the discrete case the normalization is
For the continuous case, an arbitrary function can be expanded as [
8])
where
The function
is called the
transform of
in the basis set generated by the operator
. For the case of a discrete basis set,
, indexed by
n, we write
where
are the expansion coefficients given by
Functions of operators. In Appendix A, we prove the following statements regarding the operation of functions of operators. For a function of an operator,
the operation on an eigenfunction is given by
Its action on an arbitrary function
, is
where
Consider the operator
meaning that for an eigenfunction, substitute the operator
for the eigenvalue
Operating on a function
we have
where
Explicitly,
3. Generalized Convolution
For two functions
and
with respective transforms
we form
and ask for the function
whose transform is
We call
the generalized convolution.
We now give two expressions for calculating These are derived in Appendix B.
where
is given by
Explicitly,
Expression 2:
The meaning of
is that in the expression for the transform, Equation (
24), which we repeat here
we substitute the operator
for the eigenvalue
In particular
Then
Similarly
4. Fourier Case
This example is the standard case, but we use the methods presented above to illustrate the general procedure. The frequency operator
is
and the eigenvalue problem
gives
for the eigenfunctions, which are normalized to a delta function. The transform and its inverse are given by Equations (
1) and (2). We now calculate the convolution using the two methods described by Equations (
29) and (
34).
Using
Expression 1 as given by Equation (
29), we first calculate
as given by Equation (
30)
Substituting into Equation (
29) we have
which gives
which is the expected result, Equation (
5).
Using
Expression 2, Equation (
32),
For
we have
and therefore
Using Equation (
29) we have
Remembering that,
translates functions, [
9,
10]
we obtain
which is the same as Equation (
44).
5. Scale Transform
The scale or dilation operator
is [
10,
11,
12]
and has the following properties,
Also,
The eigenvalue problem
gives
for the eigenfunctions [
11]. The scale transform,
of a function
is
with inverse
We now obtain the convolution theorem for scale. Using
Expression 1, we first calculate
by way of Equation (
30)
and therefore Equation (
29) yields
Making the transformation
and subsequently integrating over
results in
which is also equal to
This is the convolution theorem for the scale transform.
Using
Expression 2, Equation (
35), we have
Substituting for
as per in Equation (
57) we obtain
and using Equation (
55) we obtain
which is Equation (
65),
6. Chirplet Transform
The operator
is self adjoint for real
and
This operator and its associated eigenfunctions are related to coherent states in quantum mechanics [
13,
14,
15] and to the chirplet transform in signal processing [
16,
17,
18]. Solving the eigenvalue problem
gives
where we have normalized to a delta function. Hence, we have the following transform pairs
Expression 1,Calculating
as per Equation (
30) we have
which simplifies to
Calculating
as per Equation (
29) we have
resulting in
Expression 2.Using Equation (
32), we have
From Equation (
74) we have that
and substituting into Equation (
35) we obtain
Using the Baker–Campbell–Hausdorff theorem , we have [
9]
Therefore
Calculating
by way of Equation (
35) we have
which is the same as Equation (
78)
7. The operator
The operator
is self adjoint for real
and
We take
c to be positive. This operator is connected with the Airy function. The eigenvalue problem
gives eigenfunctions,
To obtain the generalized convolution, we first use
Expression 1, and we first calculate
Substituting Equation (
88) into Equation (
91) results in
Therefore,
which evaluates to
and hence
To use
Expression 2, we have
and therefore
the convolution is hence
A variety of methods may be used to establish that
Upon substitution int Equation (
98) we have
giving
which is the same as Equation (
94)
8. Generalized Correlation
For the Fourier case, correlation is where one takes [
1,
2,
3,
4]
and ask for the function
such that
This arises in a number of signal processing applications, particularly in detection problems [
19]. By substituting Equations (
1) and (2), into Equation (
103) one obtains that
This is called the correlation between
f and
g.
We now generalize and form,
and ask for the function
that corresponds to
The same type of derivation used for convolution gives
which we write as
where
8.1. Example: Fourier case
Calculating
as per Equation (
110) and using
we have
Substituting into Equation (
109), we obtain that
which gives, as expected, that
8.2. Example: Scale
Using Equation (
110) with Equation (
57) we have
Substituting into Equation (
109) we obtain
which evaluates to
Appendix A
We prove Equations (
18)–(
21) of the text. Starting with the eigenvalue equation, for the continuous case,
where the
’s are the eigenvalues, and
are the eigenfunctions, respectively. For a function of an operator,
the operation on an eigenfunction is given by
For the operation on an arbitrary function
, we expand
where
Operating on Equation (
A3) with
and remembering that
operates on functions of
t we obtain
Substituting for
as given by Equation (
A4) we have
which we write as
with
which is Equation (
29) of the text.
For the discrete case where
we have
To derive Equation (
21) and (
22) consider the operator
which means that for an eigenfunction we substitute the operator
for the eigenvalue
We use
where
Operating with
on a function
Substituting for
as per (
A13) we obtain
which we write as
where
which is Equation (
22).
Appendix B
We show Equation (
29) and (
29) of the text. Starting with
and using
and substituting into Equation (
A20), we have
which is Equation (
31) of the text.
To derive Equation (
32), consider
giving
which is Equation (
32). In going from Equation (
A24) to Equation (A25), we have used that
References
- Marks, R.J., II. Handbook of Fourier Analysis & Its Applications; Oxford Univ. Press, 2009. [Google Scholar]
- Papoulis, A. Signal Analysis; McGraw-Hill, 1977. [Google Scholar]
- Franks, L. Signal Theory; Prentice-Hall, Inc.: Englewood Cliffs, NJ, 1969. [Google Scholar]
- Poularikas, A. D. Transforms; Applications Handbook - 2nd Edition; CRC press: Boca Raton, Fl, 2010. [Google Scholar]
- Hirschman, I. I.; Widder, D. V. The convolution transform; Dover, 2005. [Google Scholar]
- Bohm, D. Quantum Theory; Prentice-Hall: New York, 1951. [Google Scholar]
- Merzbacher, D. Quantum Mechanics; John Wiley & Sons, Inc., 1998. [Google Scholar]
- Arfken, G. B.; Weber, H. J.; Harris, F. E. Mathematical Methods for Physicists: A Comprehensive Guide, 7th ed.; Academic Press, 2012. [Google Scholar]
- Wilcox, R. M. Exponential Operators and Parameter Differentiation in Quantum Physics. J. Math. Phys. 1967, 8, 962. [Google Scholar] [CrossRef]
- Cohen, L. The Weyl Operator and its Generalization, Birkhäuser Basel, New York; Springer, 2013. [Google Scholar]
- Cohen, L. The scale representation. IEEE Trans. on Signal Processing 1993, 41, 3275–3293. [Google Scholar] [CrossRef]
- Bertrand, J.; Bertrand, P. Time-Frequency Representations of Broad Band Signals in: The Physics of Phase Space; Kim, Y.S., Zachary, W.W., Eds.; Springer Verlag, 1987; pp. 250–252. [Google Scholar]
- Schleich, W.P. Quantum Optics in Phase Space; Wiley, 2001. [Google Scholar]
- Scully, M. O.; Zubairy, M. S. Quantum Optics; Cambridge University Press, 1997. [Google Scholar]
- Klauder, J. R.; Skagerstam, B. S. Coherent States; World Scientific, 1985. [Google Scholar]
- Baraniuk, R.G.; Jones, D.L. New Signal-Space Orthonormal Bases Via the Metaplectic Transform. In Proceedings of the IEEE-SP International Symposium on Time-Frequency and Time-Scale Analysis, Victoria, BC, Canada, 4–6 October 1992. [Google Scholar]
- Baraniuk, R.G.; Jones, D. L. Wigner-Based Formulation of the Chirplet Transform. IEEE Trans. Signal Process. 1996, 44, 3129–3135. [Google Scholar] [CrossRef]
- Mann, S.; Haykin, S. The chirplet transform: A generalization of Gabor’s logon transform. IEEE Transactions on Signal Processing 1995, 43, 295–300. [Google Scholar]
- Middleton, D. An Introduction to Statistical Communication Theory; McGraw-Hill, 1960. [Google Scholar]
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).