Preprint
Article

This version is not peer-reviewed.

Generalization of Convolution

Submitted:

09 March 2026

Posted:

11 March 2026

You are already at the latest version

Abstract
We generalize the concept of convolution to basis sets other than the Fourier basis. The basis set is defined by the eigenfunctions of a self-adjoint operator, which in turn defines the generalized transform. Several special cases are considered, including the scale transform and the chirplet transform, among others. We also generalize the concept of correlation between two functions. Examples are given to illustrate each result.
Keywords: 
;  ;  ;  ;  

1. Introduction

For two functions f ( t ) and g ( t ) with respective Fourier transforms F ( ω ) and G ( ω ) , defined by
F ( ω ) = 1 2 π f ( t ) e i ω t d t
G ( ω ) = 1 2 π g ( t ) e i ω t d t
we multiply the two Fourier transforms,
H ( ω ) = F ( ω ) G ( ω )
and ask for the time function h ( t ) whose Fourier transform is H ( ω ) ,
h ( t ) = 1 2 π F ( ω ) G ( ω ) e i ω t d ω
By substituting Equations (1) and (2) into Equation (4), one obtains that
h ( t ) = 1 2 π f ( t t ) g ( t ) d t
= 1 2 π f ( t ) g ( t t ) d t
The function h ( t ) is called the convolution of the functions f ( t ) and g ( t ) , often symbolized with the notation h = f g .
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 H ( ω ) is the filtered version of F ( ω ) when it is filtered by G ( ω ) , and the resulting time function, the filtered time function, is the convolution. We point out that in some mathematical fields, h ( t ) , 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 t ; in cases where they do not, we will denote that by, for example, A ( t ) which indicates that A is operating on functions of t . 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
A u ( λ , t ) = λ u ( λ , t )
where the λ ’s are the eigenvalues, and u ( λ , t ) are the eigenfunctions respectively. If the spectrum is discrete, we write
A u n ( t ) = λ n u n ( t )
where now the eigenvalues are given by the discrete set, λ n , and the corresponding eigenfunctions by u n ( t ) . Self-adjoint operators have real eigenvalues, and the eigenfunctions form a complete set.
We normalize the eigenfunctions to a delta function, [8]).
u ( λ , t ) u * ( λ , t ) d λ = δ ( t t )
u ( λ , t ) u * ( λ , t ) d t = δ ( λ λ )
and for the discrete case the normalization is
u n * ( t ) u m ( t ) d t = δ n m
n u n * ( t ) u n ( t ) = δ ( t t )
For the continuous case, an arbitrary function can be expanded as [8])
f ( t ) = F ( λ ) u ( λ , t ) d λ
where
F ( λ ) = f ( t ) u * ( λ , t ) d t
The function F ( λ ) is called the transform of f ( t ) in the basis set generated by the operator A . For the case of a discrete basis set, u n ( t ) , indexed by n, we write
f ( t ) = n c n u n ( t )
where { c n } are the expansion coefficients given by
c n = f ( t ) u n * ( t ) d t
Functions of operators. In Appendix A, we prove the following statements regarding the operation of functions of operators. For a function of an operator, Q ( A ) , the operation on an eigenfunction is given by
Q ( A ) u ( λ , t ) = Q ( λ ) u ( λ , t )
Its action on an arbitrary function z ( t ) , is
Q ( A ) z ( t ) = q ( t , t ) z ( t ) d t
where
q ( t , t ) = u * ( λ , t ) Q ( λ ) u ( λ , t ) d λ
For the discrete case,
q ( t , t ) = n u n * ( t ) Q ( λ n ) u n ( t )
Consider the operator u ( A ( t ) , t ) , meaning that for an eigenfunction, substitute the operator A ( t ) for the eigenvalue λ . Operating on a function g ( t ) , we have
u ( A ( t ) , t ) g ( t ) = g ( t ) η ( t , t , t ) d t
where
η ( t , t , t ) = u ( λ , t ) u * ( λ , t ) u * ( λ , t ) d λ
Explicitly,
u ( A ( t ) , t ) g ( t ) = g ( t ) u ( λ , t ) u * ( λ , t ) u * ( λ , t ) d λ d t

3. Generalized Convolution

For two functions f ( t ) and g ( t ) with respective transforms
F ( λ ) = f ( t ) u * ( λ , t ) d t
G ( λ ) = g ( t ) u * ( λ , t ) d t
we form
H ( λ ) = F ( λ ) G ( λ )
and ask for the function h ( t ) whose transform is H ( λ )
h ( t ) = H ( λ ) u ( λ , t ) d λ
= F ( λ ) G ( λ ) u ( λ , t ) d λ
We call h ( t ) the generalized convolution.
We now give two expressions for calculating h ( t ) . These are derived in Appendix B.
Expression 1:
h ( t ) = f ( t ) g ( t ) η ( t , t , t ) d t d t
where η ( t , t , t ) is given by
η ( t , t , t ) = u ( λ , t ) u * ( λ , t ) u * ( λ , t ) d λ
Explicitly,
h ( t ) = f ( t ) g ( t ) u ( λ , t ) u * ( λ , t ) u * ( λ , t ) d t d t d λ
Expression 2:
h ( t ) = F ( A ) g ( t )
The meaning of F ( A ) is that in the expression for the transform, Equation (24), which we repeat here
F ( λ ) = f ( t ) u * ( λ , t ) d t
we substitute the operator A for the eigenvalue λ . In particular
F ( A ) = f ( t ) u * ( A ( t ) , t ) d t
Then
h ( t ) = F ( A ) g ( t ) = f ( t ) u * ( A ( t ) , t ) g ( t ) d t
Similarly
h ( t ) = G ( A ) f ( t ) = g ( t ) u * ( A ( t ) , t ) f ( t ) d t

4. Fourier Case

This example is the standard case, but we use the methods presented above to illustrate the general procedure. The frequency operator W is
W = 1 i d d t
and the eigenvalue problem
W u ( ω , t ) = ω u ( ω , t )
gives
u ( ω , t ) = 1 2 π e i ω t
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 η ( t , t , t ) as given by Equation (30)
η ( t , t , t ) = 1 ( 2 π ) 3 / 2 e i ω t e i ω t e i ω t d ω
= 1 2 π δ ( t t t )
Substituting into Equation (29) we have
h ( t ) = f ( t ) g ( t ) η ( t , t , t ) d t d t
= 1 2 π f ( t ) g ( t ) δ ( t t t ) d t d t
which gives
h ( t ) = 1 2 π f ( t ) g ( t t ) d t
which is the expected result, Equation (5).
Using Expression 2, Equation (32),
h ( t ) = F ( W ) g ( t )
For F ( ω ) , we have
F ( ω ) = 1 2 π f ( t ) e i ω t d t
and therefore
F ( W ) = 1 2 π f ( t ) e i W t d t
Using Equation (29) we have
h ( t ) = 1 2 π f ( t ) e i t W g ( t ) d t
= 1 2 π f ( t ) e t d d t g ( t ) d t
Remembering that, e t d d t translates functions, [9,10]
e t d d t g ( t ) = g ( t t )
we obtain
h ( t ) = 1 2 π f ( t ) g ( t t ) d t
which is the same as Equation (44).

5. Scale Transform

The scale or dilation operator C is [10,11,12]
C = 1 2 i t d d t + d d t t
and has the following properties,
e i τ C f ( t ) = e τ / 2 f ( e τ t )
e i ln τ C f ( t ) = τ f ( τ t )
Also,
e i ln τ C f ( t ) = 1 τ f ( t / τ )
The eigenvalue problem
C u ( λ , t ) = λ u ( λ , t )
gives
u ( λ , t ) = 1 2 π e i λ ln t t , t 0
for the eigenfunctions [11]. The scale transform, D ( λ ) , of a function f ( t ) is
D ( λ ) = 1 2 π 0 f ( t ) e i c ln t t d t
with inverse
f ( t ) = 1 2 π D ( λ ) e i λ ln t t d λ ; t 0
We now obtain the convolution theorem for scale. Using Expression 1, we first calculate η ( t , t , t ) by way of Equation (30)
η ( t , t , t ) = 1 ( 2 π ) 3 1 t t t e i λ ( ln t ln t ln t ) d λ
= 1 2 π 1 t t t δ ( ln t ln t ln t )
and therefore Equation (29) yields
h ( t ) = f ( t ) g ( t ) η ( t , t , t ) d t d t
= 1 2 π 1 t t t f ( t ) g ( t ) δ ( ln t ln t ln t ) d t d t
Making the transformation
τ = ln t
and subsequently integrating over τ results in
h ( t ) = 1 2 π 0 1 t f ( t ) g ( t / t ) d t
which is also equal to
h ( t ) = 1 2 π 0 1 t f ( t / t ) g ( t ) d t
This is the convolution theorem for the scale transform.
Using Expression 2, Equation (35), we have
h ( t ) = D ( C ) g ( t ) = f ( t ) u * ( C ( t ) , t ) d t g ( t )
Substituting for u * ( C ( t ) , t ) as per in Equation (57) we obtain
h ( t ) = D ( C ) g ( t ) = 1 2 π 0 f ( t ) e i C ln t t g ( t ) d t
and using Equation (55) we obtain
h ( t ) = 1 2 π 0 1 t f ( t ) g ( t / t ) d t
which is Equation (65),

6. Chirplet Transform

The operator
A = α t i β d d t
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
α t i β d d t = λ u ( λ , t )
gives
u ( λ , t ) = 1 2 π β e i ( λ t α t 2 / 2 ) / β
where we have normalized to a delta function. Hence, we have the following transform pairs
F ( λ ) = 1 2 π β f ( t ) e i ( λ t α t 2 / 2 ) / β d t
f ( t ) = 1 2 π β F ( λ ) e i ( λ t α t 2 / 2 ) / β d λ
Expression 1,Calculating η ( t , t , t ) as per Equation (30) we have
η ( t , t , t ) = 1 ( 2 π β ) 3 e i λ ( t t t ) / β e i α ( t 2 t 2 t 2 ) / ( 2 β ) d λ
which simplifies to
η ( t , t , t ) = 1 2 π β δ ( t t t ) e i α t ( t t ) / β
Calculating h ( t ) as per Equation (29) we have
h ( t ) = 1 2 π β f ( t ) g ( t ) δ ( t t t ) e i α ( t 2 t t ) / β d t d t
resulting in
h ( t ) = 1 2 π β f ( t ) g ( t t ) e i α t ( t t ) / β d t
Expression 2.Using Equation (32), we have
h ( t ) = F ( A ) g ( t )
From Equation (74) we have that
F ( A ) = 1 2 π β f ( t ) e i ( A t α t 2 / 2 ) / β d t
and substituting into Equation (35) we obtain
F ( A ) g ( t ) = 1 2 π β f ( t ) e i α t i β d d t t α t 2 / 2 ) / β g ( t ) d t
Using the Baker–Campbell–Hausdorff theorem , we have [9]
e i α t i β d d t t / β = e i α t t / β d d t t = e i α t t / β e i α t 2 / 2 β e t d d t
Therefore
e i α t i β d d t t / β g ( t ) = e i α t t / β e i α t 2 / 2 β g ( t t )
Calculating h ( t ) by way of Equation (35) we have
h ( t ) = 1 2 π β f ( t ) e i α t 2 / 2 ) / β e i α t t / β e i α t 2 / 2 β g ( t t ) d t
= 1 2 π β f ( t ) g ( t t ) e i α t ( t t ) / β d t
which is the same as Equation (78)

7. The operator A = α t 2 i c d d t

The operator
A = α t 2 i c d d t
is self adjoint for real α and c . We take c to be positive. This operator is connected with the Airy function. The eigenvalue problem
α t 2 i c d d t u ( λ , t ) = λ u ( λ , t )
gives eigenfunctions,
u ( λ , t ) = c 2 π e i c λ t α t 3 / 3
The transform is
F ( λ ) = c 2 π f ( t ) e i c λ t α t 3 / 3 d t
where
f ( t ) = c 2 π F ( λ ) e i c λ t α t 3 / 3 d λ
To obtain the generalized convolution, we first use Expression 1, and we first calculate
η ( t , t , t ) = u ( λ , t ) u * ( λ , t ) u * ( λ , t ) d λ
Substituting Equation (88) into Equation (91) results in
η ( t , t , t ) = c 2 π e i c α t t ( t t ) δ ( t t t )
Therefore,
h ( t ) = f ( t ) g ( t ) η ( t , t , t ) d t d t
which evaluates to
h ( t ) = c 2 π f ( t ) g ( t ) e i c α t t ( t t ) δ ( t t t ) d t d t
and hence
h ( t ) = c 2 π f ( t ) g ( t t ) c i c α t t ( t t ) d t
To use Expression 2, we have
F ( λ ) = c 2 π f ( t ) e i c λ t α t 3 / 3 d t
and therefore
F ( A ) = c 2 π f ( t ) e i c A t α t 3 / 3 d t
= c 2 π f ( t ) e + i c α t 3 / 3 e i c t α t 2 i c d d t d t
the convolution is hence
h ( t ) = F ( A ) g ( t ) = c 2 π f ( t ) e i c α t 3 / 3 e i c t α t 2 i c d d t g ( t ) d t
A variety of methods may be used to establish that
e i c t α t 2 i c d d t g ( t ) = exp i c α t 2 t t t 2 + t 3 3 g ( t t )
Upon substitution int Equation (98) we have
h ( t ) = F ( A ) g ( t ) = c 2 π f ( t ) e + i c α t 3 / 3 exp i c α t 2 t t t 2 + t 3 3 g ( t t ) d t
giving
= c 2 π f ( t ) exp i c α t t t t g ( t t ) d t
which is the same as Equation (94)

8. Generalized Correlation

For the Fourier case, correlation is where one takes [1,2,3,4]
H * ( ω ) = F * ( ω ) G ( ω )
and ask for the function h + ( t ) such that
h * ( t ) = 1 2 π F * ( ω ) G ( ω ) e i ω t d ω
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
h * ( t ) = 1 2 π f * ( t ) g ( t + t ) d t
This is called the correlation between f and g.
We now generalize and form,
H * ( ω ) = F * ( λ ) G ( λ )
and ask for the function h * ( t ) that corresponds to H * ( λ ) ,
h * ( t ) = H * ( λ ) u ( λ , t ) d λ
= F * ( λ ) G ( λ ) u ( λ , t ) d λ
The same type of derivation used for convolution gives
h * ( t ) = f * ( t ) g ( t ) u ( λ , t ) u ( λ , t ) u * ( λ , t ) d λ d t d t
which we write as
h * ( t ) = f * ( t ) g ( t ) η * ( t , t , t ) d t d t
where
η * ( t , t , t ) = u ( λ , t ) u ( λ , t ) u * ( λ , t ) d λ

8.1. Example: Fourier case

Calculating η * ( t , t , t ) as per Equation (110) and using λ = ω , we have
η * ( t , t , t ) = u ( ω , t ) u ( ω , t ) u * ( ω , t ) d ω
= 1 2 π δ ( t + t t )
Substituting into Equation (109), we obtain that
h * ( t ) = f * ( t ) g ( t ) η ( t , t , t ) d t d t
= 1 2 π f * ( t ) g ( t ) δ ( t + t t ) d t d t
which gives, as expected, that
h * ( t ) = 1 2 π f * ( t t ) g ( t ) d t

8.2. Example: Scale

Using Equation (110) with Equation (57) we have
η * ( t , t , t ) = 1 ( 2 π ) 3 1 t t t e i λ ( ln t + ln t ln t ) d λ
= 1 2 π 1 t t t δ ( ln t + ln t ln t )
Substituting into Equation (109) we obtain
h * ( t ) = 1 2 π f * ( t ) g ( t ) 1 t t t δ ( ln t + ln t ln t ) d t d t
= 1 2 π f * ( t ) g ( t ) 1 t t t δ ( ln t t / t ) d t d t
which evaluates to
h * ( t ) = 1 2 π f * ( t ) g ( t t ) d t

Appendix A

We prove Equations (18)–(21) of the text. Starting with the eigenvalue equation, for the continuous case,
A u ( λ , t ) = λ u ( λ , t )
where the λ ’s are the eigenvalues, and u ( λ , t ) are the eigenfunctions, respectively. For a function of an operator, Q ( A ) , the operation on an eigenfunction is given by
Q ( A ( t ) ) u ( λ , t ) = Q ( λ ) u ( λ , t )
For the operation on an arbitrary function z ( t ) , we expand
z ( t ) = Z ( λ ) u ( λ , t ) d λ
where
Z ( λ ) = z ( t ) u * ( λ , t ) d t
Operating on Equation (A3) with Q ( A ) and remembering that A operates on functions of t we obtain
Q ( A ) z ( t ) = Z ( λ ) Q ( A ) u ( λ , t ) d λ
Substituting for Z ( λ ) as given by Equation (A4) we have
Q ( A ) z ( t ) = z ( t ) u * ( λ , t ) Q ( A ) u ( λ , t ) d t d λ
which we write as
Q ( A ) z ( t ) = q ( t , t ) z ( t ) d t
with
q ( t , t ) = u * ( λ , t ) Q ( A ) u ( λ , t ) d t
= u * ( λ , t ) Q ( λ ) u ( λ , t ) d t
which is Equation (29) of the text.
For the discrete case where
A u n ( t ) = λ n u n ( t )
we have
q ( t , t ) = n u n * ( t ) Q ( λ n ) u n ( t )
To derive Equation (21) and (22) consider the operator u ( A ( t ) , t ) , which means that for an eigenfunction we substitute the operator A ( t ) for the eigenvalue λ . We use
g ( t ) = G ( λ ) u ( λ , t ) d λ
where
G ( λ ) = g ( t ) u * ( λ , t ) d t
Operating with u ( A ( t ) , t ) on a function g ( t )
u ( A ( t ) , t ) g ( t ) = u ( A ( t ) , t ) G ( λ ) u ( λ , t ) d λ
= G ( λ ) u ( A ( t ) , t ) u ( λ , t ) d λ
= G ( λ ) u ( λ , t ) u ( λ , t ) d λ
Substituting for G ( λ ) , as per (A13) we obtain
u ( A ( t ) , t ) g ( t ) = g ( t ) u ( λ , t ) u * ( λ , t ) u * ( λ , t ) d t d λ
which we write as
u ( A ( t ) , t ) g ( t ) = g ( t ) η ( t , t , t ) d t
where
η ( t , t , t ) = u ( λ , t ) u * ( λ , t ) u * ( λ , t ) d λ
which is Equation (22).

Appendix B

We show Equation (29) and (29) of the text. Starting with
h ( t ) = F ( λ ) G ( λ ) u ( λ , t ) d λ
and using
F ( λ ) = f ( t ) u * ( λ , t ) d t
G ( λ ) = g ( t ) u * ( λ , t ) d t
and substituting into Equation (A20), we have
h ( t ) = f ( t ) g ( t ) u ( λ , t ) u * ( λ , t ) u * ( λ , t ) d t d t d λ
which is Equation (31) of the text.
To derive Equation (32), consider
h ( t ) = F ( λ ) G ( λ ) u ( λ , t ) d λ
= F ( A ) G ( λ ) u ( λ , t ) d λ
giving
h ( t ) = F ( A ) g ( t )
which is Equation (32). In going from Equation (A24) to Equation (A25), we have used that
F ( λ ) u ( λ , t ) = F ( A ) u ( λ , t )

References

  1. Marks, R.J., II. Handbook of Fourier Analysis & Its Applications; Oxford Univ. Press, 2009. [Google Scholar]
  2. Papoulis, A. Signal Analysis; McGraw-Hill, 1977. [Google Scholar]
  3. Franks, L. Signal Theory; Prentice-Hall, Inc.: Englewood Cliffs, NJ, 1969. [Google Scholar]
  4. Poularikas, A. D. Transforms; Applications Handbook - 2nd Edition; CRC press: Boca Raton, Fl, 2010. [Google Scholar]
  5. Hirschman, I. I.; Widder, D. V. The convolution transform; Dover, 2005. [Google Scholar]
  6. Bohm, D. Quantum Theory; Prentice-Hall: New York, 1951. [Google Scholar]
  7. Merzbacher, D. Quantum Mechanics; John Wiley & Sons, Inc., 1998. [Google Scholar]
  8. Arfken, G. B.; Weber, H. J.; Harris, F. E. Mathematical Methods for Physicists: A Comprehensive Guide, 7th ed.; Academic Press, 2012. [Google Scholar]
  9. Wilcox, R. M. Exponential Operators and Parameter Differentiation in Quantum Physics. J. Math. Phys. 1967, 8, 962. [Google Scholar] [CrossRef]
  10. Cohen, L. The Weyl Operator and its Generalization, Birkhäuser Basel, New York; Springer, 2013. [Google Scholar]
  11. Cohen, L. The scale representation. IEEE Trans. on Signal Processing 1993, 41, 3275–3293. [Google Scholar] [CrossRef]
  12. 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]
  13. Schleich, W.P. Quantum Optics in Phase Space; Wiley, 2001. [Google Scholar]
  14. Scully, M. O.; Zubairy, M. S. Quantum Optics; Cambridge University Press, 1997. [Google Scholar]
  15. Klauder, J. R.; Skagerstam, B. S. Coherent States; World Scientific, 1985. [Google Scholar]
  16. 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]
  17. Baraniuk, R.G.; Jones, D. L. Wigner-Based Formulation of the Chirplet Transform. IEEE Trans. Signal Process. 1996, 44, 3129–3135. [Google Scholar] [CrossRef]
  18. 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]
  19. 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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated