Abstract
In this paper, the sampling and reconstruction problems in function subspaces of associated with the multi-dimensional special affine Fourier transform (SAFT) are discussed. First, we give the definition of the multi-dimensional SAFT and study its properties including the Parseval’s relation, the canonical convolution theorems and the chirp-modulation periodicity. Then, a kind of function spaces are defined by the canonical convolution in the multi-dimensional SAFT domain, the existence and the properties of the dual basis functions are demonstrated, and the -stability of the basis functions is established. Finally, based on the nonuniform samples taken on a dense set, we propose an iterative reconstruction algorithm with exponential convergence to recover the signals in a -subspace associated with the multi-dimensional SAFT, and the validity of the algorithm is demonstrated via simulations.
Keywords:
the multi-dimensional special affine Fourier transform; nonuniform sampling; canonical convolution; iterative reconstruction algorithm MSC:
46E22; 94A20
1. Introduction
The well-known Shannon sampling theorem had a great impact on many engineering fields, such as communication and information processing, which provides a basic bridge between discrete and continuous signals []. However, it is not suitable for numerical realization due to the slow decay of the sinc function generating the bandlimited signal space. Moreover, many signals in the practical applications are not bandlimited. With the development of wavelet analysis, many sampling results have been generalized to more general shift-invariant spaces [,,,,,,,,,]. However, most results are studied in the framework of classical Fourier transform (FT).
In recent years, many sampling theories have been attempted to be established in the setting of more general integral transforms including the fractional Fourier transform (FrFT), the linear canonical transform (LCT) and the special affine Fourier transform (SAFT) [,,,,,,,,,]. The SAFT was first proposed in [] for modeling optical systems and had been generally applied to signal processing, communications and quantum mechanics, which is a six-parameter integral transform and can contain many classical transforms as special cases, such as the FT, the FrFT, the Laplace transform and the LCT [,,]. These results indicate that the studies related to one-dimensional signals in the SAFT domain have been relatively complete, but the results of multi-dimensional signals are rarely seen.
The SAFT is also called the offset linear canonical transform (OLCT) because it can be seen as a time-shifted and frequency-modulated version of the four-parameter LCT by introducing two extra flexible parameters. The LCT, as a tool for signal processing, had been intended to analyze multi-dimensional signals in the sense that a product of n-copies of the usual one-dimensional LCT was used [,]. Supported by the sampling theory, it has been widely applied to images and audio [,]. With the development of the sampling theory, the sampling of multi-dimensional signals will also have more potential applications, such as image scaling, and image super-resolution [,,,]. In addition, the conversion between different sample rates also plays an important role in communication, image processing, etc. All kinds of classical transform domains such as FT, FrFT, LCT and other one-dimensional sampling rate conversions or multi-dimensional extractions or interpolations with integer matrices are also proposed [,,,]. The SAFT, as the offset version of the LCT, is more flexible, so it is necessary to discuss the problems related to multi-dimensional signals in the SAFT transform domain.
As an extension of bandlimited signals in the SAFT domain, different function spaces associated with various types of convolutions are defined to model non-bandlimited signals, and the corresponding sampling theories are studied, such as the canonical convolution [,,] and the SAFT-convolution [,]. However, all the involved function spaces are -subspaces, and the discussion in the -setting is still not explored. Motivated by the above observations, we will devote ourselves to the following problems:
- State the definition of the multi-dimensional special affine Fourier transform with multi-dimensional kernel and establish some basic conclusions including the inverse transform formula, the Parseval’s relation, the canonical convolution theorems and the chirp-modulation periodicity.
- Based on the proposed multi-dimensional SAFT and the canonical convolution in the multi-dimensional SAFT domain, introduce a class of -subspaces and discuss the corresponding properties including the existence of the dual basis functions and the -stability of the basis functions.
- The theory of nonuniform sampling in shift-invariant spaces of the -setting associated with the classical FT has acquired great achievements [,]. Taking the existing results as a reference, consider the nonuniform sampling and reconstruction of signals in the -subspaces associated with the multi-dimensional SAFT.
The paper is organized as follows. In Section 2, we give the definition of the multi-dimensional SAFT and its properties. In Section 3, a class of subspaces of associated with the canonical convolution in the SAFT domain are discussed. In Section 4, an iterative reconstruction algorithm based on nonuniform samples is proposed to recover the signals living in the space .
2. The Multi-Dimensional Special Affine Fourier Transform
In this section, we will give the definition of the multi-dimensional special affine Fourier transform and introduce its properties. Let
Here, are real matrices, are column vectors, and is a symplectic matrix, that is, , where and is a n-dimensional identity matrix. In the following, we only care about the case of .
Definition 1.
For , the multi-dimensional SAFT with respect to the matrix M is defined as
where , , and
Similarly, for a sequence , the multi-dimensional SAFT transform is defined by
Lemma 1.
Let
Then the multi-dimensional SAFT kernel satisfies the following properties:
- (i)
- (ii)
Proof.
(i) Since satisfies , we have Then
(ii) It follows from (i) that
Let . We can rewrite (5) as
□
Lemma 2.
For , one has
Proof.
Note that
Then, it follows from the Parseval’s formula in the FT domain that
When , then the relation is the Plancherel’s formula in the multi-dimensional SAFT domain.
By the item (ii) of Lemma 1, one can obtain the inverse SAFT as
□
Definition 2
([]). Let N be a real and non-singular matrix of order n. Define the lattice generated by N as
For the lattice , the unit-cell is defined as
and
The most convenient unit-cell is the parallelepiped given by
Example 1.
If and , then
and .
Lemma 3.
For , one has
Proof.
Let be a sequence such that
Note that
where is the discrete FT. Then, one has
Note that
This together with (15) gives
□
The proposed multi-dimensional SAFT reduces to some special transforms when the sub-matrices of the matrix M take the particular forms. When , the transform falls back to the multi-dimensional LCT
defined in []. In particular,
if and , it returns to the classical n-dimensional Fourier transform
Definition 3.
For , the canonical convolution in the multi-dimensional SAFT domain is defined by
Lemma 4.
Let Then, the multi-dimensional SAFT of h satisfies
where G is the multi-dimensional Fourier transform of g.
Proof.
It follows from the definition of the multi-dimensional SAFT that
Similarly, the semi-discrete and discrete forms of the canonical convolution can be defined as
and
for and , respectively. □
Lemma 5.
Let Then, the multi-dimensional SAFT of h satisfies
Lemma 6.
Let Then, the multi-dimensional SAFT of satisfies
where is the multi-dimensional Fourier transform of the sequence g.
Lemma 7.
The SAFT of satisfies the chirp-modulation periodicity as
where
Proof.
By the definition of the multi-dimensional SAFT, one has
The desired result can be obtained by transposition. □
3. The Space Associated with the Canonical Convolution
In this section, we will define a class of subspaces in which is related to the canonical convolution in the multi-dimension SAFT domain.
Let . Define
In the following, we will give a sufficient and necessary condition for the stability of the basis functions of
Theorem 1.
Let . Then, is the Riesz basis of if and only if there exist constants such that
where and Φ is the FT of ϕ.
Proof.
For any , there exists a sequence such that
It follows from Lemma 5 that
Moreover, we know from Lemmas 2 and 7 that
Similarly, it follows from the Parseval’s formula in Lemma 3 that
This together with (29) obtains the desired result. □
Theorem 2.
Suppose that is the Riesz basis of the space , there exist the dual basis of with
such that for , the orthogonal projection operator on can be given by
Moreover, one has
where Ψ is the FT of ψ.
Proof.
Since , then there exists a sequence such that
Taking the SAFT on both sides of (33), it follows from Lemma 5 that
Note that
Then, one has
where Taking the SAFT on both sides of (35), it follows from Lemma 6 that
where is the discrete FT of . Moreover, we have
Then, we can obtain
This together with (34) and (36) obtains
which means that the function exists because satisfies (26). □
Now, we introduce the Wiener amalgam space, more details can be found in []. A measurable function f belongs to , , if it satisfies
If , a measurable function f belongs to if it satisfies
Note that coincides with . Let be the subspace of continuous functions in
Lemma 8
([]). If then the autocorrelation sequence
belongs to , and we have
Lemma 9
([]). If and , then the sequence d defined by belongs to , and we have
Lemma 10
([]). (Wiener’s Lemma) If is an absolutely convergent Fourier series with coefficient sequence and if for all , then also has an absolutely convergent Fourier series with coefficient sequence
Lemma 11.
If and , then the sequence d defined by
belongs to , and we have
Proof.
Note that
It follows from Lemma 9 that the result holds. □
Lemma 12.
Let . If and , then the function
belongs to and
Proof.
Let and Note that
and Then, we can obtain
□
Theorem 3.
Suppose that and is the Riesz basis of , then the dual basis ψ is also in .
Proof.
Theorem 4.
Suppose that then
- (i)
- The space is a subspace of and for
- (ii)
- If is a Riesz basis of , then there exist constants such that for any one has
- (iii)
- If , then we have the norm equivalences
Proof.
Note that
This together with Lemma 12 obtains (i) and the right side of (54) holds. □
Now, we prove the left side of (54). Define the operator
and the operator
It follows from Lemmas 11 and 12 that is a bounded map from to and is also a bounded map from to .
Let . Since and are biorthogonal, . Then
Choosing obtains the desired result. The norm equivalences (55) follows from (54) and Lemma 12.
Theorem 5.
Let . Suppose that and are the Riesz basis of then .
Proof.
It is obvious that follows from Lemma 12. Note that
Let and If then it follows from Lemma 12 and (57) that
which means that uniformly converges to the continuous function . □
Now, we will prove for the case . Since , there exists a sequence of continuous function with compact support such that
Let
Then, is continuous because the sum is locally finite. Using Lemma 12, we have
This together with (59) shows that uniformly converges to continuous function .
4. Sampling and Reconstruction in
In this section, we will discuss the sampling and reconstruction of signals in the space .
Definition 4
([]). A set is -dense in if
where is a sphere with as the center and γ as the radius.
Definition 5
([]). We call a bounded partition of unity associated with , if
- (i)
- for all ;
- (ii)
- ;
- (iii)
Moreover, we define the operator as
Theorem 6.
Suppose that , is a Riesz basis of and is the dual basis of Then the orthogonal projection operator
is a bounded projection from onto for .
Proof.
Note that
Then, the desired result follows from the boundedness of the operators and in the proof of Theorem 4. □
Lemma 13
([]). Suppose that and are the Riesz basis of . Then, there exists a density such that any f belonging to
can be recovered from its samples on any γ-dense set by the iterative algorithm
where is the bounded projection from onto Moreover, uniformly converges to f and
where
Define an operator as
Then, we can provide the following iterative reconstruction algorithm.
Theorem 7.
Suppose that and are the Riesz basis of . Then, there exists a density such that any can be recovered from its samples on any γ-dense set by the iterative algorithm
Moreover, uniformly converges to f and
where
Proof.
Note that
is equivalent to
Let
and Then, . Since the FT of satisfies (26), is the Riesz basis of Then it follows from Lemma 13 that g can be recovered from its samples
by the iterative algorithm
Moreover, uniformly converges to g and
where Note that
which means that
Therefore, the algorithm (72) can be rewritten as
Let Then, (75) is equivalent to
Note that
Then, and . Finally, the desired result follows from (73). □
Finally, we will give simulations to verify the proposed methods. Consider the matrix M, where the elements are , , , , , and a signal
which is bandlimited in the multi-dimensional SAFT domain. Then, we use the proposed iterative algorithm (68) to reconstruct the signal f. The special affine spectrum of f, the sampled signal and the reconstructed signal are shown in Figure 1, Figure 2, Figure 3 and Figure 4.
Figure 1.
The real and imaginary parts of f.
Figure 2.
The real and imaginary parts of the SAFT of f.
Figure 3.
The real and imaginary parts after sampling f.
Figure 4.
The real and imaginary parts of the reconstructed signal.
Author Contributions
J.Y.: Writing—original draft. Y.J.: Writing—review and editing. All authors have read and agreed to the published version of the manuscript.
Funding
The project is partially supported by the National Natural Science Foundation of China (No. 12261025), the Guangxi Natural Science Foundation (No. 2019GXNSFFA245012), Center for Applied Mathematics of Guangxi (No. AD23023002).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Data is contained within the article.
Conflicts of Interest
This work does not have any conflicts of interest.
References
- Shannon, C.E. Communication in the presence of noise. Proc. IRE 1949, 37, 10–12. [Google Scholar] [CrossRef]
- Aldroubi, A.; Gröchenig, K. Nonuniform sampling and reconstruction in shift-invariant spaces. SIAM Rev. 2001, 43, 585–620. [Google Scholar] [CrossRef]
- Aldroubi, A.; Sun, Q.; Tang, W.-S. Nonuniform average sampling and reconstruction in multiply generated shift-invariant spaces. Constr. Approx. 2004, 20, 173–189. [Google Scholar] [CrossRef]
- Chen, Y.; Cheng, C.; Sun, Q.; Wang, H. Phase retrieval of real-valued signals in a shift-invariant space. Appl. Comput. Harmon. Anal. 2020, 49, 56–73. [Google Scholar] [CrossRef]
- Cheng, C.; Jiang, J.; Sun, Q. Phaseless sampling and reconstruction of real-valued signals in shift-invariant spaces. J. Fourier Anal. Appl. 2019, 25, 1361–1394. [Google Scholar] [CrossRef]
- Eldar, Y.C. Compressed sensing of analog signal in a shift-invariant spaces. IEEE Trans. Signal Process. 2009, 57, 2986–2997. [Google Scholar] [CrossRef]
- Führ, H.; Xian, J. Relevant sampling in finitely generated shift-invariant spaces. J. Approx. Theory 2019, 240, 1–15. [Google Scholar] [CrossRef]
- Gontier, D.; Vetterli, M. Sampling based on timing: Time encoding machines on shift-invariant subspaces. Appl. Comput. Harmon. Anal. 2014, 36, 63–78. [Google Scholar] [CrossRef]
- Li, Y.; Sun, W. Random phaseless sampling for causal signals in shift-invariant spaces: A zero distribution perspective. IEEE Trans. Signal Process. 2020, 68, 5473–5486. [Google Scholar] [CrossRef]
- Unser, M. Sampling–50 years after Shannon. Proc. IEEE 2000, 88, 569–587. [Google Scholar] [CrossRef]
- Yang, J. Random sampling and reconstruction in multiply generated shift-invariant spaces. Anal. Appl. 2019, 17, 323–347. [Google Scholar] [CrossRef]
- Bhandari, A.; Zayed, A.I. Shift-invariant and sampling spaces associated with the special affine Fourier transform. Appl. Comput. Harmon. Anal. 2019, 47, 30–52. [Google Scholar] [CrossRef]
- Shah, F.A.; Firdous, A.; Teali, A.A.; Tantary, A.Y. Special affine wavelet transform and the corresponding Poisson summation formula. Int. J. Wavelets Multiresolut. Inf. Process. 2021, 19, 2050086. [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]
- Stern, A. Sampling of compact signals in the offset linear canonical domain. Signal Image Video Process. 2007, 1, 359–367. [Google Scholar] [CrossRef]
- Wang, J.; Ren, S.; Chen, Z.; Wang, W. Periodically nonuniform sampling and reconstruction of signals in function spaces associated with the linear canonical transform. IEEE Commun. Lett. 2018, 22, 756–759. [Google Scholar] [CrossRef]
- Wang, J.; Wang, Y.; Ren, S.; Wang, W. Periodically nonuniform sampling and averaging of signals in multiresolution subspaces associated with the fractional wavelet transform. Digit. Signal Process. 2018, 80, 1–11. [Google Scholar] [CrossRef]
- Xiang, Q.; Qin, K.; Huang, Q. Multichannel sampling of signals band-limited in offset linear canonical transform domain. Circ. Syst. Signal Process. 2013, 32, 2385–2406. [Google Scholar] [CrossRef]
- Xu, S.; Feng, L.; He, Y.; Chai, Y. New shift-invariant spaces for the linear canonical transform and their applications. Optik 2021, 227, 165892. [Google Scholar] [CrossRef]
- Xu, S.; Huang, L.; Chai, Y.; He, Y. Nonuniform sampling theorems for bandlimited signals in the offset linear canonical transform. Circuits Syst. Signal Process. 2018, 37, 3227–3244. [Google Scholar]
- Xu, L.; Zhang, F.; Tao, R. Randomized nonuniform sampling and reconstruction in fractional Fourier domain. Signal Process. 2016, 120, 311–322. [Google Scholar] [CrossRef]
- Abe, S.; Sheridan, J.T. Optical operations on wave functions as the abelian subgroups of the special affine Fourier transformation. Opt. Lett. 1994, 19, 1801–1803. [Google Scholar] [CrossRef]
- Collins, S.A. Lens-system diffraction integral written in terms of matrix optics. J. Opt. Soc. Am. 1970, 60, 1772–1780. [Google Scholar] [CrossRef]
- Healy, J.J.; Kutay, M.A.; Ozaktas, H.M.; Sheridan, J.T. Linear Canonical Transforms: Theory and Applications; Springer Ser. Optical Sci.; Springer: New York, NY, USA, 2016. [Google Scholar]
- Moshinsky, M.; Quesne, C. Linear canonical transformations and their unitary representations. J. Math. Phys. 1971, 12, 1772–1780. [Google Scholar] [CrossRef]
- Wei, D.; Li, Y. Reconstruction of multidimensional bandlimited signals from multichannel samples in linear canonical transform domain. IET Signal Process. 2014, 8, 647–657. [Google Scholar] [CrossRef]
- Wei, D.; Yang, W.; Li, Y.M. Lattices sampling and sampling rate conversion of multi-dimensional bandlimited signals in the linear canonical transform domain. J. Frankl. Inst. 2019, 356, 7571–7607. [Google Scholar] [CrossRef]
- Cheung, K.F.; Marks, R.J. Imaging sampling below the Nyquist density without aliasing. J. Opt. Soc. Am. 1990, 7, 92–105. [Google Scholar] [CrossRef]
- Woods, J.W. Multidimensional Signal, Image, and Video Processing and Coding; Academic Press: Cambridge, MA, USA, 2011. [Google Scholar]
- Hore, A.; Ziou, D.; Deschenes, F. A new image scaling algorithm based on the sampling theorem of papoulis and application to color images. In Proceedings of the IEEE Fourth International Conference on Image and Graphics, Chengdu, China, 22–24 August 2007; Volume 4366, pp. 39–44. [Google Scholar]
- Wei, D.; Li, Y. Multichannel sampling theorem for bandpass signals in the linear transform domain and its application to superresolution. Opt. Commun. 2011, 284, 5424–5429. [Google Scholar] [CrossRef]
- Wei, D.; Li, Y. Generalized sampling expansion with multiple sampling rates for lowpass and bandpass signals in the fractional fourier domian. IEEE Trans. Signal Process. 2016, 64, 4861–4974. [Google Scholar] [CrossRef]
- Feuer, A.; Goodwin, G.C. Reconstruction of multidimensional bandlimited signals from nonuniform and generalized samples. IEEE Trans. Signal Process. 2005, 53, 4273–4282. [Google Scholar] [CrossRef]
- Zhao, J.; Tao, R.; Wang, Y. Sampling rate conversion for linear canonical transform. Signal Process. 2008, 88, 2825–2832. [Google Scholar] [CrossRef]
- Vaidyanathan, P.P. Multirate digital filters, filter banks, polyphase networks, and applications: A tutorial. Proc. IEEE 1990, 7, 56–93. [Google Scholar] [CrossRef]
- Tao, R.; Deng, B.; Zhang, W.Q.; Wang, Y. Sampling and sampling rate conversion of band-limited signals in the fractional Fourier transform domain. IEEE Trans. Signal Process. 2008, 88, 158–171. [Google Scholar] [CrossRef]
- Shah, F.A.; Tantary, A.Y. Multi-dimensional linear canonical transform with applications to sampling and multiplicative filtering. Multidimens. Syst. Signal Process. 2022, 33, 621–650. [Google Scholar] [CrossRef]
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. |
© 2024 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/).