Abstract
A linear canonical S transform (LCST) is considered a generalization of the Stockwell transform (ST). It analyzes signals and has multi-angle, multi-scale, multiresolution, and temporal localization abilities. The LCST is mostly suitable to deal with chirp-like signals. It aims to possess the characteristics lacking in a classical transform. Our aim in this paper was to derive the sampling theorem for the LCST with the help of a multiresolution analysis (MRA) approach. Moreover, we discuss the truncation and aliasing errors for the proposed sampling theory. These types of sampling results, as well as methodologies for solving them, have applications in a wide range of fields where symmetry is crucial.
1. Introduction
R. G. Stockwell et al. in [1] studied the generalized version of the integral transform called the Stockwell transform or S transform (ST).
The uniqueness of the ST lies in the fact that, on the one hand, it provides a frequency-dependent resolution, while on the other hand, it maintains a direct relationship with the classical Fourier spectrum. Hence, it is used in wider applications in electrocardiograms, seismograms, power-quality, and sound analyses for detecting and interpreting events in time series [2,3,4,5]. The LCST was developed by Zhang et al. [6] in 2011 to provide a time linear canonical domain representation. The LCST aims to possess the characteristics lacking in a classical transform. Various types of transformations have been constructed using the LCT in recent times. For a further look at these constructions, we refer the readers to [7,8,9,10,11,12,13,14] and the references therein.
We introduce the sampling theorem with error estimations in this work (based on the LCST). The sampling theorem defines the rate at which a constant time signal is sampled so that the data from the end signal is utilized. In other words, data loss during this process should be zero [15,16,17,18,19,20,21]. It helps to recover the continuous-time signals from those of the sampled signals (due to the availability of natural values of time signals at a predetermined rate in reconstruction). However, there is a drawback, i.e., an infinite number of samples is needed for the perfect reconstruction process. A nice and useful feature of sampling is that it measures sampling frequencies at an accurate rate. To reduce the complexity of computing the information, it is necessary to limit the sampling frequencies, which are required to diminish the measured information. However, there is the threat of data loss in the signal whenever we choose a low sampling frequency. Hence, the need of the hour pertains to the trade-off between these two limits. The highlights of our contribution are:
- To develop a sampling theorem in the linear canonical S transform domain via the MRA approach.
- To introduce truncation and aliasing errors for sampling.
The findings of our work can be best utilized in symmetry. The remainder of the paper is organized as follows. In Section 2, we discuss some preliminaries that are required in subsequent sections. In Section 3, we introduce the sampling theorem for LCST associated with the multiresolution analysis (MRA). In Section 4, we discuss the truncation and aliasing errors for sampling.
2. Preliminaries
2.1. Linear Canonical Transform (LCT)
For a uni-modular matrix , the linear canonical transform of any function is stated as
where is called the kernel of the LCT, which is shaped as
note that for the LCT defined by Equation (1) reduces to the chirp multiplication operator and is of no use to us. Hence, for the sake of brevity, we set in this paper, unless stated otherwise.
The inversion formula for the LCT is given by
2.2. Linear Canonical S Transform (LCST)
The linear canonical S transform (LCST) is a hybrid of the S transform (ST), which is an extension of the LCT and the ST, given by
where is a Gaussian window scalable function of frequency and time and is given by
If we take the LCST given by Equation (2) reduces to the novel S transform.
Let us assume that , then we can introduce a new function , given by
and, thus, with the help of this new function, the LCST defined in (2) can be written as
where and represent the LCST and LCT of the signal Now, we shall introduce some notations and definitions that will be used in derivations conducted in later sections.
2.3. Notations and Definitions
The notations used in this paper are presented here for a better understanding of the proposed technique.
- : denotes the space of absolutely integrable functions on
- : denotes the space of all square integral functions on
- : denotes the space of all square-summable sequences on .
- : represents the discrete signal.
- : represents the finite-dimensional Hilbert space, whose every basis is a Riesz basis.
- : denotes the characteristic function of a subset
In the next section, the multiresolution analysis (MRA) associated with LCST is discussed, which will give the time and frequency information simultaneously.
2.4. Multiresolution Analysis
A technique for the estimation of the function with arbitrary accuracy is known as MRA.
Definition 1.
A multiresolution analysis (MRA) associated with LCST, as defined in [22], is a sequence of closed subspaces of , with the following properties:
- (a)
- (b)
- (c)
- , where 0 is the zero element of
- (d)
- (e)
- There exists a function φ in , such that belongs to .
The function in (d) is known as a scaling factor of the given MRA assuming that the set of functions is a Riesz basis of the subspace In (e), is such that , obtained by modulation of , forms an orthonormal basis for subspace . The modulated function mentioned in (e) is known as the scaling function of the MRA subspace Let us accept that sequence is a Riesz basis:
Theorem 1.
Let and , then is a Riesz basis of the subspace of , if there exist constants such that
where
satisfying the condition
where denotes the ST of the canonical scaling function , where the argument is scaled by and B with respect to frequency and time axis.
Proof.
The proof of the theorem is present in [22]. □
It is clear that is orthonormal if i.e., where and each is called a multiscale subspace of LCST. Let be the orthonormal basis of then is orthonormal. Assume that the LCT scaling function is an MRA of then is the Riesz basis of [22]. As is true for all there is a sequence , satisfying
for simplicity,
Suppose ; if is the Riesz basis of is the canonical function of MRA Hence, for any then there exits and in , such that
where are the LCST coefficients of in Subsequently,
and
Here, and are the STs of and , respectively, with the arguments scaled by and B for the frequency and time axis, respectively, where
and
are defined in For any iterating (5), we have
where and It can be verified that
now let us define
since, therefore, from (8), we have
and can be defined as
adding (5) and Poisson’s summation formula of the ST results, we have
where represents the discrete-time ST of being the sampled form of with the argument scaled by and B for the frequency and time axis.
As the sampling interval (or sampling theorem) plays an important role in MRA, the sampling theorem of LCST (based on the approach of the canonical scaling function of MRA) is discussed in the next section.
3. Sampling Theorem of LCST
In this section, the sampling procedure in the sequence of subspace for the stable generator function is a set of and a Gaussian function ,; its function space is defined as
where and We consider as a pointwise convergent because
hence, without loss of generality, any continuous function can be considered for the sampling. Now, let us begin by presenting the sampling theorem for the LCST.
Theorem 2.
Suppose generator functions and belonging to are the canonical scaling signals of MRA related to the LCST and its sampling sequence , which is an integer of belonging to Then a continuous function , which is a set of can be defined with , such that
where , and for all are sets of Equation (11) holds if
moreover, the function in (11) satisfies
where and represent the ST of and with the argument scaled by and B for the frequency and time axis, respectively.
Proof.
Let us assume that (12) is true; hence, holds for a.e in by [22]; we have a sequence such that
holds in the sense. As is periodic with period (14) can be written as
now applying (3), the above equation becomes
from (4) and (15), we can establish
which implies that Thus, we can obtain
where is the ST operator. Further simplifying, we have
now inserting (14) into (17),we obtain
next, by the relation between LCST and ST, we have
substituting, (16) and (18) into (19) the LCST of the modulated signal can be written as
where represents the DTLCST of . Implementing the semi-discrete canonical convolution theorem [23], we have
where as is the Riesz basis of . Now, adding (17) and (8) results in
implementing (7) and (9) in (20) and scaling by , we have
making use of Poisson’s summation formula of the ST from [16] in (21), we have
applying IST on both sides of (22)
now for any function there is a sequence , such that
from (24) and (23), we have
setting in (25), we have
using (24) above can be rewritten as
therefore, is well defined as This satisfies the condition of convergence, i.e.,
Let represent the discrete-time LCST of and belong to thus,
evaluating the Fourier coefficients in (28), we have
substituting the expression of in terms of in the above expression results in
substituting the expression of in (29), it can be solved as
as in (27) gives
however, if (30) is substituted in (26), we have (11). This actually proves the proposed sampling theorem presented in (11). Let us suppose that with , such that (11) holds in It is clear that ; therefore, taking for in (11) gives
with the help of LCST, (31) becomes
modifying by using the scaling operation, we have
applying (7) and (10) into LHS and RHS of (33), we obtain
solving the above equation yields
which proves the expression of the interpolation function, defined in (13), which is true , Therefore, (34) can be written as
as , then by using (4), the bounds of the square summable function of (35) can be defined as
hence,
therefore,
4. Error Estimation
Error estimation is important to study. So, we devote this section to the study of truncation and aliasing errors.
4.1. Truncation Error
The truncation error can be expressed as
where and are a set of
Theorem 3.
Let be a continuous scaling function of MRA alongside the LCST, then the sampling sequence and Then, the truncation error is bounded by
4.2. Aliasing Error
The aliasing error for any signal is a set of defined by
Theorem 4.
If is the canonical scaling function of an MRA with the sampling sequence and for some , then the aliasing error is bounded by
where LCST coefficients of in are denoted by and is defined in ([22], Theorem 3) as
Proof.
Let us suppose that is the direct complement of and , from (11), it will be required to show that (42) satisfies for any Let be set to begin the LCST coefficients of MRA , as from the Riesz basis of and , such that,
let denote the LCST OF , denote the discrete-time LCST of the product , and be the LCST coefficients of
Taking LCST on both sides of (41) and using (6), we have
taking the LCST on both (41) and (32) gives
where denotes the LCST of . Now, by the Poisson summation formula [25],
by inserting (43) into (45), we obtain
upon further simplification, we have
inserting (43) and (46) into (44) yields
Case I. When . Adding (47) and Parseval’s theorem of the LCT results in
using (5) and (48), it can be written as
assuming that then
then (5) and (6) yield
and
upon substituting (50) and (51) in (49), we have
5. Conclusions
In this work, a sampling theorem for LCST was proposed with help from the sampling kernel in the multiresolution subspace. Moreover, for the proposed sampling theory, the truncation and aliasing errors were determined with their bounds. In future works, we will extend the current study to quaternion algebra, which will lead the researchers to focus on quaternion-valued signals and their samplings.
Author Contributions
M.Y.B., B.A., A.H.D. and J.G.D. contributed equally. All authors have read and agreed to the published version of the manuscript.
Funding
No funding was received for the manuscript.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Data are available upon request from the authors.
Acknowledgments
This work was supported by a research grant (no. JKST&IC/SRE/J/357-60) provided by JKST&IC, UT of J&K, India.
Conflicts of Interest
The authors declare no conflict of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| LCST | linear canonical S transform |
| LCT | linear canonical transform |
| ST | Stockwell transform |
References
- Stockwell, R.G.; Mansinha, L.; Lowe, R.P. Localization of the complex spectrum: The S transform. IEEE Trans. Signal Process. 1996, 44, 998–1001. [Google Scholar] [CrossRef]
- Assous, S.; Humeau, A.; Tartas, M.; Abraham, P.; L’Huillier, J. S-transform applied to laser Doppler flowmetry reactive hyperemia signals. IEEE Trans. Biomed. Eng. 2006, 53, 1032–1037. [Google Scholar] [CrossRef] [PubMed]
- Livanos, G.; Ranganathan, N.; Jiang, J. Heart sound analysis using the S Transform. IEEE Comp. Cardiol. 2000, 27, 587–590. [Google Scholar]
- Dash, P.K.; Panigrahi, B.K.; Panda, G. Power quality analysis using S-transform. IEEE Trans. Power Del. 2003, 18, 406–411. [Google Scholar] [CrossRef]
- Fengzhan, Z.; Rengang, Y. Power-quality disturbance recogniion using S-transform. IEEE Trans. Power Del. 2007, 22, 944–950. [Google Scholar]
- Wei, Z.; Ran, T.; Yue, W. Linear canonical S transform. Chin. J. Elec. 2011, 20, 63–66. [Google Scholar]
- Bahria, M.; Toahab, S.; Landec, C. A generalized S-transform in linear canonical transform. J. Phys. 2019, 134, 062005. [Google Scholar] [CrossRef]
- Wang, Y.; Orchard, J. On the use of the Stockwell transform for image compression. In Proceedings of the Image processing: Algorithms and systems VII, San Jose, CA, USA, 10 February 2009; Volume 7245, pp. 33–39. [Google Scholar]
- Mallat, S.G. Multiresolution approximations and wavelet orthonormal bases of L2(R). Trans. Amer. Math. Soc. 1989, 315, 69–87. [Google Scholar]
- Bhat, M.Y.; Dar, A.H. The algebra of 2D Gabor quaternionic offset linear canonical transform and uncertainty principles. J. Anal. 2021, 30, 637–649. [Google Scholar] [CrossRef]
- Bhat, M.Y.; Dar, A.H. Donoho Starks and Hardys Uncertainty Principles for the Shorttime Quaternion Offset Linear Canonical Transform. arXiv 2021, arXiv:2110.02754. [Google Scholar]
- Bhat, M.Y.; Dar, A.H. Convolution and Correlation Theorems for Wigner-Ville Distribution Associated with the Quaternion Offset Linear Canonical Transform. SIVP 2021, 16, 1235–1242. [Google Scholar] [CrossRef]
- Khan, W.A. Construction of generalized k-Bessel-Maitland function with its certain properties. J. Maths. 2021, 2021, 5386644. [Google Scholar] [CrossRef]
- Tariq, M.; Sahoo, S.K.; Nasir, J.; Aydi, H.; Alsamir, H. Some Ostrowski type inequalities via n-polynomial exponentially s-convex functions and their applications. AIMS Math. 2021, 6, 13272–13290. [Google Scholar] [CrossRef]
- Ranjan, R.; Jindal, N.; Singh, A.K. Convolution theorem with its derivatives and multiresolution analysis for fractional S-transform. Circuits Syst. Signal Process. 2019, 38, 5212–5235. [Google Scholar] [CrossRef]
- Shi, J.; Liu, X.; Sha, X.; Zhang, Q.; Zhang, N. A sampling theorem for fractional wavelet transform with error estimates. IEEE Trans. Signal Process. 2017, 65, 4797–4811. [Google Scholar] [CrossRef]
- Ranjan, R.; Jindal, N.; Singh, A.K. A sampling theorem with error estimation for S-transform. Integral Transform. Spec. Funct. 2019, 30, 1–21. [Google Scholar] [CrossRef]
- Shi, J.; Chi, Y.; Zhang, N. Multichannel sampling and reconstruction of bandlimited signals in fractional Fourier domain. IEEE Signal Process. Lett. 2010, 17, 909–912. [Google Scholar]
- Huo, H.; Sun, W. Sampling theorems and error estimates for random signals in the linear canonical transform domain. Signal Process. 2015, 111, 31–38. [Google Scholar] [CrossRef]
- Zhang, Z. Sampling theorem for the short-time linear canonical transform and its applications. Signal Process. 2015, 113, 138–146. [Google Scholar] [CrossRef]
- Zayed, A.; Sun, W. Sampling theorem for two dimensional fractional Fourier transform. Signal Process. 2021, 181, 107902. [Google Scholar] [CrossRef]
- Bhat, M.Y.; Dar, A.H. Multiresolution analysis for linear canonical S transform. Adv. Opr. Theory 2021, 6, 1–11. [Google Scholar] [CrossRef]
- Shi, J.; Liu, X.; Sha, X.; Zhang, N. Sampling and reconstruction of signals in function spaces associated with the linear canonical transform. IEEE Trans. Signal Process. 2012, 60, 6041–6047. [Google Scholar]
- Bahri, M. Two uncertainty principles related to the linear canonical S-transform. J. Phys. Conf. Ser. 2019, 1341, 062006. [Google Scholar] [CrossRef]
- Zhuo, Z.H. Poisson summation formulae associated with special affine Fourier transform and offset Hilbert transform. Math. Probl. Eng. 2017, 2017, 1354129. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 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 (https://creativecommons.org/licenses/by/4.0/).