Next Article in Journal
Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices
Previous Article in Journal
Coercive and Noncoercive Mixed Generalized Complementarity Problems
Previous Article in Special Issue
A Vector Representation of Multicomplex Numbers and Its Application to Radio Frequency Signals
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Nonuniform Sampling in Lp-Subspaces Associated with the Multi-Dimensional Special Affine Fourier Transform

1
College of Electronic Engineering and Automation, Guilin University of Electronic Technology, Guilin 541002, China
2
Center for Applied Mathematics of Guangxi, Guilin University of Electronic Technology (GUET), Guilin 541002, China
3
School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541002, China
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(5), 329; https://doi.org/10.3390/axioms13050329
Submission received: 18 March 2024 / Revised: 26 April 2024 / Accepted: 12 May 2024 / Published: 15 May 2024

Abstract

:
In this paper, the sampling and reconstruction problems in function subspaces of L p ( R n ) 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 L p -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 L p -subspace associated with the multi-dimensional SAFT, and the validity of the algorithm is demonstrated via simulations.

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 [1]. 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 [2,3,4,5,6,7,8,9,10,11]. 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) [12,13,14,15,16,17,18,19,20,21]. The SAFT was first proposed in [22] 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 [23,24,25]. 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 [26,27]. Supported by the sampling theory, it has been widely applied to images and audio [28,29]. 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 [27,30,31,32]. 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 [33,34,35,36]. 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 [14,16,17] and the SAFT-convolution [12,19]. However, all the involved function spaces are L 2 -subspaces, and the discussion in the L p -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 L p -subspaces and discuss the corresponding properties including the existence of the dual basis functions and the L p -stability of the basis functions.
  • The theory of nonuniform sampling in shift-invariant spaces of the L p -setting associated with the classical FT has acquired great achievements [2,3]. Taking the existing results as a reference, consider the nonuniform sampling and reconstruction of signals in the L p -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 V p ( ϕ ) of L p ( R n ) 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 V p ( ϕ ) .

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
M = A B p C D q .
Here, A , B , C , D are n n real matrices, p , q are n 1 column vectors, and M 1 = A B C D is a symplectic matrix, that is, M 1 T J M 1 = J , where J = 0 I n I n 0 and I n is a n-dimensional identity matrix. In the following, we only care about the case of det B 0 .
Definition 1.
For f L 2 ( R n ) , the multi-dimensional SAFT with respect to the matrix M is defined as
F M ( w ) = R n f ( t ) K M ( w , t ) d t = ρ ( n , B ) R n f ( t ) exp j 2 ( w T D B 1 w + Ω B T w + t T B 1 A t + 2 p T B 1 t 2 w T B T t ) d t ,
where ρ ( n , B ) = 1 ( 2 π ) n 2 | det B | 1 2 , Ω = 2 ( B q D p ) T , t = ( t 1 , t 2 , , t n ) T and w = ( w 1 , w 2 , , w n ) T .
Similarly, for a sequence { f ( k ) } k Z n 2 ( Z n ) , the multi-dimensional SAFT transform is defined by
F ˜ M ( w ) = k Z n f ( k ) K M ( w , k ) .
Lemma 1.
Let
M 1 = D T B T B q D p C T A T B T C T B p B T A T B q .
Then the multi-dimensional SAFT kernel satisfies the following properties:
(i)
K M 1 ( t , w ) = K M ( w , t ) ¯ .
(ii)
R n K M ( w , t ) K M 1 ( z , w ) d w = δ ( t z ) .
Proof. 
(i) Since M 1 satisfies M 1 T J M 1 = J , we have A T D C T B = I n . Then
K M 1 ( t , w ) = ρ ( n , B ) exp { j 2 ( t T A T ( B T ) t + 2 t T ( B T ) ( B T ) ( B T C T B p B T A T B q )   A T ( B q D p ) + w T ( B T ) D T w + 2 w T ( B 1 ) ( B q D p ) 2 t T ( B 1 ) w ) }   = ρ ( n , B ) exp { j 2 ( t T A T B T t + 2 t T B T p + w T B T D T w + 2 w T B 1 ( B q D p )   2 t T B 1 w ) }   = ρ ( n , B ) exp { j 2 ( t T B 1 A t + 2 p T B 1 t + w T D B 1 w + 2 ( B q D p ) T B T w   2 w T B T t ) } = K M ( w , t ) ¯ .
(ii) It follows from (i) that
  R n K M ( w , t ) K M 1 ( z , w ) d w = R n K M ( w , t ) K M ( w , z ) ¯ d w = ρ 2 ( n , B ) R n exp j 2 ( w T D B 1 w + Ω B T w + t T B 1 A t + 2 p T B 1 t 2 w T B T t )   · exp j 2 ( w T D B 1 w + Ω B T w + z T B 1 A z + 2 p T B 1 z 2 w T B T z ) d w = ρ 2 ( n , B ) exp j 2 t T B 1 A t + 2 p T B 1 t z T B 1 A z 2 p T B 1 z   · R n exp { j w T B T ( t z ) } d w .
Let w 1 = B 1 w . We can rewrite (5) as
  R n K M ( w , t ) K M 1 ( z , w ) d w = 1 ( 2 π ) n | det B | exp j 2 t T B 1 A t + 2 p T B 1 t z T B 1 A z 2 p T B 1 z   · R n exp { j w 1 T ( t z ) } | det B | d w 1 = δ ( t z ) .
Lemma 2.
For f , g L 2 ( R n ) , one has
F M , G M L 2 ( R n ) = f , g L 2 ( R n ) .
Proof. 
Note that
F M ( w ) = 1 det B 1 2 F f ( t ) exp j 2 t T B 1 A t + 2 p T B 1 t ( B 1 w ) · exp j 2 w T D B 1 w + Ω B T w .
Then, it follows from the Parseval’s formula in the FT domain that
  F M ( w ) , G M ( w )   = F f ( t ) exp j 2 t T B 1 A t + 2 p T B 1 t ( w 1 ) ,   F g ( t ) exp j 2 t T B 1 A t + 2 p T B 1 t ( w 1 ) = f ( t ) exp j 2 t T B 1 A t + 2 p T B 1 t , g ( t ) exp j 2 t T B 1 A t + 2 p T B 1 t = f ( t ) , g ( t ) .
When f = g , 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
R n F M ( w ) K M 1 ( t , w ) d w = R n R n f ( x ) K M ( w , x ) d x K M 1 ( t , w ) d w   = R n f ( x ) R n K M ( w , x ) K M 1 ( t , w ) d w d x   = R n f ( x ) δ ( t x ) d x = f ( t ) .
Definition 2
([37]). Let N be a real and non-singular matrix of order n. Define the lattice generated by N as
L ( N ) = N k ; k Z n .
For the lattice L ( N ) , the unit-cell U ( N ) R n is defined as
x L ( N ) U ( N ) + x = R n
and
U ( N ) + x U ( N ) + y = f o r x y L ( N ) .
The most convenient unit-cell is the parallelepiped given by
U ( N ) = N x ; x = x 1 , x 2 , , x n T , 0 x i 1 , i = 1 , , n .
Example 1.
If n = 2 and N = 1 0 0 2 , then
L ( N ) = N k = ( k 1 , 2 k 2 ) T ; k = ( k 1 , k 2 ) T Z 2
and U ( N ) = ( 0 , 1 ] × ( 0 , 2 ] .
Lemma 3.
For p , q 2 ( Z n ) , one has
P ˜ M , Q ˜ M L 2 U 2 π B = p , q 2 Z n .
Proof. 
Let p ˜ be a sequence such that
p ˜ ( k ) = p ( k ) exp j 2 ( k T B 1 A k + 2 p T B 1 k ) , k Z n .
Note that
P ˜ M ( w ) = 1 det B 1 2 F ˜ p ˜ ( B 1 w ) exp j 2 w T D B 1 w + Ω B T w ,
where F ˜ is the discrete FT. Then, one has
p , q 2 ( Z n ) = p ˜ , q ˜ 2 ( Z n )   = F ˜ p ˜ , F ˜ q ˜ L 2 0 , 2 π n   = det B 1 2 P ˜ M ( B w ) , det B 1 2 Q ˜ M ( B w ) L 2 0 , 2 π n = det B 0 , 2 π n P ˜ M ( B w ) Q ˜ M ( B w ) ¯ d w .
Note that
B x : x = x 1 , x 2 , , x n , 0 x i 2 π   = 2 π B x : x = x 1 , x 2 , , x n , 0 x i 1 = U ( 2 π B ) .
This together with (15) gives
p , q 2 ( Z n ) = U ( 2 π B ) P ˜ M ( w ) Q ˜ M ( w ) ¯ d w = P ˜ M , Q ˜ M L 2 U 2 π B .
The proposed multi-dimensional SAFT reduces to some special transforms when the sub-matrices of the matrix M take the particular forms. When M = A B 0 C D 0 , the transform falls back to the multi-dimensional LCT
L M [ f ] ( w ) = ρ ( n , B ) R n f ( t ) exp j 2 ( w T D B 1 w + t T B 1 A t 2 w T B T t ) d t
defined in [37]. In particular,
if A = D = 0 and B = C = I n , it returns to the classical n-dimensional Fourier transform
F ( w ) = 1 ( 2 π ) n 2 R n f ( t ) exp j w T t d t .
Definition 3.
For f , g L 2 ( R n ) , the canonical convolution in the multi-dimensional SAFT domain is defined by
( f Θ g ) ( t ) = R n f ( x ) g ( t x ) exp j 2 t T B 1 A t x T B 1 A x + 2 p T B 1 ( t x ) d x .
Lemma 4.
Let h ( t ) = ( f Θ g ) ( t ) . Then, the multi-dimensional SAFT of h satisfies
H M ( w ) = ( 2 π ) n 2 F M ( w ) G ( B 1 w ) ,
where G is the multi-dimensional Fourier transform of g.
Proof. 
It follows from the definition of the multi-dimensional SAFT that
H M ( w ) = R n h ( t ) K M ( w , t ) d t = ρ ( n , B ) R n R n f ( x ) g ( t x ) exp j 2 t T B 1 A t x T B 1 A x + 2 p T B 1 ( t x ) · exp j 2 ( w T D B 1 w + Ω B T w + t T B 1 A t + 2 p T B 1 t 2 w T B T t ) d x d t   = ρ ( n , B ) R n f ( x ) exp j 2 ( w T D B 1 w + Ω B T w + x T B 1 A x + 2 p T B 1 x 2 w T B T x )   · R n g ( t x ) exp { j w T B T ( t x ) } d t d x = ( 2 π ) n 2 F M ( w ) G ( B 1 w ) .
Similarly, the semi-discrete and discrete forms of the canonical convolution can be defined as
( c Θ f ) ( t ) = k Z n c ( k ) f ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k )
and
( c Θ d ) ( k ) = m Z n c ( m ) d ( k m ) exp j 2 k T B 1 A k m T B 1 A m + 2 p T B 1 ( k m )
for c , d 2 ( Z n ) and f L 2 ( R n ) , respectively. □
Lemma 5.
Let h ( t ) = { f ( k ) } k Z n Θ g ( · ) ( t ) . Then, the multi-dimensional SAFT of h satisfies
H M ( w ) = ( 2 π ) n 2 F ˜ M ( w ) G ( B 1 w ) .
Lemma 6.
Let h ( k ) = { f ( m ) } m Z n Θ { g ( m ) } m Z n ( k ) . Then, the multi-dimensional SAFT of { h ( k ) } k Z n satisfies
H ˜ M ( w ) = ( 2 π ) n 2 F ˜ M ( w ) G ˜ ( B 1 w ) ,
where G ˜ is the multi-dimensional Fourier transform of the sequence g.
Lemma 7.
The SAFT of { f ( k ) } k Z n 2 ( Z n ) satisfies the chirp-modulation periodicity as
  F ˜ M ( w + 2 π B m ) exp j 2 ( w + 2 π B m ) T D B 1 ( w + 2 π B m ) + Ω B T ( w + 2 π B m ) = F ˜ M ( w ) exp j 2 w T D B 1 w + Ω B T w ,
where m = ( m 1 , m 2 , , m n ) T Z n .
Proof. 
By the definition of the multi-dimensional SAFT, one has
  F ˜ M ( w + 2 π B m )   = ρ ( n , B ) k Z n f ( k ) exp { j 2 ( ( w + 2 π B m ) T D B 1 ( w + 2 π B m ) + Ω B T ( w + 2 π B m ) + k T B 1 A k + 2 p T B 1 k 2 ( w + 2 π B m ) T B T k ) }   = ρ ( n , B ) k Z n f ( k ) exp j 2 w T D B 1 w + Ω B T w + k T B 1 A k + 2 p T B 1 k 2 w T B T k   · exp j 2 2 π ( B m ) T D B 1 ( w + 2 π B m ) + w T D B 1 2 π B m + Ω B T 2 π B m 2 ( 2 π B m ) T B T k   = exp j 2 2 π ( B m ) T D B 1 ( w + 2 π B m ) + w T D B 1 2 π B m + Ω B T 2 π B m F ˜ M ( w )   = exp j 2 ( w + 2 π B m ) T D B 1 ( w + 2 π B m ) + Ω B T ( w + 2 π B m ) · exp j 2 w T D B 1 w + Ω B T w F ˜ M ( w ) .
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 L p ( R n ) which is related to the canonical convolution in the multi-dimension SAFT domain.
Let 1 p . Define
V p ( ϕ ) = c Θ ϕ ( t ) : c p ( Z n ) = k Z n c ( k ) ϕ ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k ) : c p ( Z n ) .
In the following, we will give a sufficient and necessary condition for the stability of the basis functions of V 2 ( ϕ ) .
Theorem 1.
Let ϕ k ( t ) = ϕ ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k ) . Then, { ϕ k ( t ) } k Z n is the Riesz basis of V 2 ( ϕ ) if and only if there exist constants 0 < A 1 B 1 < such that
A 1 G ϕ , M ( w ) B 1 , w U ( 2 π B ) ,
where G ϕ , M ( w ) = d e f m Z n | Φ ( B 1 w + 2 π m ) | 2 and Φ is the FT of ϕ.
Proof. 
For any f V 2 ( ϕ ) , there exists a sequence q 2 ( Z n ) such that
f ( t ) = k Z n q ( k ) ϕ k ( t ) .
It follows from Lemma 5 that
F M ( w ) = ( 2 π ) n 2 Q ˜ M ( w ) Φ ( B 1 w ) .
Moreover, we know from Lemmas 2 and 7 that
f L 2 ( R n ) 2 = F M L 2 ( R n ) 2   = R n ( 2 π ) n 2 Q ˜ M ( w ) Φ ( B 1 w ) 2 d w   = ( 2 π ) n k Z n U ( 2 π B ) Q ˜ M ( w + 2 π B k ) 2 Φ B 1 w + 2 π k 2 d w   = ( 2 π ) n U ( 2 π B ) Q ˜ M ( w ) 2 k Z n Φ B 1 w + 2 π k 2 d w = ( 2 π ) n U ( 2 π B ) Q ˜ M ( w ) 2 G ϕ , M ( w ) d w .
Similarly, it follows from the Parseval’s formula in Lemma 3 that
q 2 ( Z n ) 2 = Q ˜ M L 2 U ( 2 π B ) 2 = U ( 2 π B ) Q ˜ M ( w ) 2 d w .
This together with (29) obtains the desired result. □
Theorem 2.
Suppose that { ϕ k ( t ) } k Z n is the Riesz basis of the space V 2 ( ϕ ) , there exist the dual basis { ψ k ( t ) } k Z n of V 2 ( ϕ ) with
ψ k ( t ) = ψ ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k )
such that for f ( t ) L 2 ( R n ) , the orthogonal projection operator P on V 2 ( ϕ ) can be given by
P f ( t ) = k Z n f , ψ k ϕ k ( t ) = k Z n f , ϕ k ψ k ( t ) .
Moreover, one has
Ψ B 1 w = Φ ( B 1 w ) ( 2 π ) n G ϕ , M ( w ) ,
where Ψ is the FT of ψ.
Proof. 
Since ψ k ( t ) V 2 ( ϕ ) , then there exists a sequence r 2 ( Z n ) such that
ψ 0 ( t ) = ψ ( t ) exp j 2 ( t T B 1 A t + 2 p T B 1 t ) = k Z n r ( k ) ϕ k ( t ) = r Θ ϕ ( t ) .
Taking the SAFT on both sides of (33), it follows from Lemma 5 that
ρ ( n , B ) exp j 2 ( w T D B 1 w + Ω B T w ) Ψ ( B 1 w ) = R ˜ M ( w ) Φ ( B 1 w ) .
Note that
ψ m , ϕ k = exp j 2 ( m T B 1 A k + k T B 1 A m 2 m T B 1 A m ) ψ 0 , ϕ k m .
Then, one has
δ ( k ) = ψ 0 , ϕ k   = m Z n r ( m ) ϕ m ( t ) , ϕ k ( t )   = m Z n r ( m ) ϕ m ( t ) , ϕ k ( t )   = m Z n r ( m ) λ ( k m ) exp j 2 k T B 1 A k m T B 1 A m + 2 p T B 1 ( k m ) = { r ( m ) } m Z n Θ { λ ( m ) } m Z n ( k ) ,
where λ ( k m ) = ϕ ( t m ) , ϕ ( t k ) . Taking the SAFT on both sides of (35), it follows from Lemma 6 that
ρ ( n , B ) exp j 2 ( w T D B 1 w + Ω B T w ) = ( 2 π ) n 2 R ˜ M ( w ) Λ ˜ ( B 1 w ) ,
where Λ ˜ is the discrete FT of λ . Moreover, we have
λ ( k m ) = ϕ ( t m ) , ϕ ( t k )   = exp j w T m Φ ( w ) , exp j w T k Φ ( w )   = R n | Φ ( w ) | 2 exp j w T ( k m ) d w = m 1 Z n [ 0 , 2 π ] n | Φ ( w + 2 π m 1 ) | 2 exp j w T ( k m ) d w = [ 0 , 2 π ] n m 1 Z n | Φ ( w + 2 π m 1 ) | 2 exp j w T ( k m ) d w .
Then, we can obtain
Λ ˜ B 1 w = ( 2 π ) n 2 G ϕ , M ( w ) .
This together with (34) and (36) obtains
Ψ B 1 w = Φ ( B 1 w ) ( 2 π ) n G ϕ , M ( w ) ,
which means that the function ψ exists because G ϕ , M ( w ) satisfies (26). □
Now, we introduce the Wiener amalgam space, more details can be found in [2]. A measurable function f belongs to W ( L p ( R n ) ) , 1 p < , if it satisfies
f W ( L p ( R n ) ) p = k Z n ess sup f ( t + k ) p ; t [ 0 , 1 ] n < .
If p = , a measurable function f belongs to W ( L ( R n ) ) if it satisfies
f W ( L ( R n ) ) = sup k Z n { ess sup { f ( t + k ) ; t [ 0 , 1 ] n } } < .
Note that W ( L ( R n ) ) coincides with L ( R n ) . Let W 0 ( L p ( R n ) ) be the subspace of continuous functions in W ( L p ( R n ) ) .
Lemma 8
([2]). If ϕ W ( L 1 ( R n ) ) , then the autocorrelation sequence
a k = R n ϕ ( t ) ϕ ( t k ) ¯ d t
belongs to 1 ( Z n ) , and we have
a 1 ( Z n ) ϕ W ( L 1 ( R n ) ) 2 .
Lemma 9
([2]). If f L p ( R n ) and g W ( L 1 ( R n ) ) , then the sequence d defined by d k = R n f ( t ) g ( t k ) ¯ d t belongs to p ( Z n ) , and we have
d p ( Z n ) f L p ( Z n ) g W ( L 1 ( R n ) ) , 1 p .
Lemma 10
([22]). (Wiener’s Lemma) If f ( w ) = k Z n a k exp { j w T k } is an absolutely convergent Fourier series with coefficient sequence a = ( a k ) k Z n 1 ( Z n ) and if f ( w ) 0 for all w R n , then 1 f also has an absolutely convergent Fourier series 1 f ( w ) = k Z n b k exp { j w T k } with coefficient sequence b = ( b k ) k Z n 1 ( Z n ) .
Lemma 11.
If f L p ( R n ) and g W ( L 1 ( R n ) ) , then the sequence d defined by
d k = R n f ( t ) g ( t k ) ¯ exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k ) d t
belongs to p ( Z n ) , and we have
d p ( Z n ) f L p ( R n ) g W ( L 1 ( R n ) ) , 1 p .
Proof. 
Note that
d k R n f ( t ) g ( t k ) d t .
It follows from Lemma 9 that the result holds. □
Lemma 12.
Let 1 p . If ϕ W ( L 1 ( R n ) ) and c p ( Z n ) , then the function
f ( t ) = k Z n c ( k ) ϕ ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k )
belongs to W ( L p ( R n ) ) and
f W ( L p ( R n ) ) c p ( Z n ) ϕ W ( L 1 ( R n ) ) .
Proof. 
Let b k = ess sup t [ 0 , 1 ] n | ϕ ( t + k ) | and d k = ess sup t [ 0 , 1 ] n | f ( t + k ) | . Note that
d k = ess sup t [ 0 , 1 ] n m Z n c ( m ) ϕ m ( t + k )   ess sup t [ 0 , 1 ] n m Z n c ( m ) ϕ ( t + k m ) m Z n c ( m ) b k m
and b 1 ( Z n ) = ϕ W L 1 R n . Then, we can obtain
f W L p R n = d p ( Z n ) c p ( Z n ) b 1 ( Z n ) = c p ( Z n ) ϕ W L 1 R n .
Theorem 3.
Suppose that ϕ W ( L 1 ( R n ) ) and { ϕ   k ( t ) } k Z n is the Riesz basis of V 2 ( ϕ ) , then the dual basis ψ is also in W ( L 1 ( R n ) ) .
Proof. 
It follows from Theorem 2 that there exists a c 2 ( Z n ) such that
ψ 0 ( t ) = ψ ( t ) exp j 2 ( t T B 1 A t + 2 p T B 1 t ) = k Z n c ( k ) ϕ ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k ) ,
which is equivalent to
ψ ( t ) = k Z n c ( k ) exp j 2 ( k T B 1 A k + 2 p T B 1 k ) ϕ ( t k ) = : k Z n c 1 ( k ) ϕ ( t k ) .
Moreover, we know from Theorem 2 that the FT of { c   1 ( k ) } k Z n is
C ˜ 1 ( w ) = 1 ( 2 π ) 3 n 2 k Z n Φ ( w + 2 π k ) 2 , w 0 , 2 π n .
By the Poisson summation formula, one has
k Z n Φ ( w + 2 π k ) 2 = k Z n ϕ , ϕ ( · k ) exp { j w T k } .
It follows from Lemma 8 that
ϕ , ϕ ( · k ) k Z n 1 ( Z n ) .
This together with (51) and Lemma 10 obtains c 1 1 ( Z n ) . Then, c 1 ( Z n ) . Finally, ψ W ( L 1 ( R n ) ) follows from (50) and Lemma 12. □
Theorem 4.
Suppose that ϕ W ( L 1 ( R n ) ) , then
(i)
The space V p ( ϕ ) is a subspace of L p ( R n ) and W ( L p ( R n ) ) for 1 p .
(ii)
If { ϕ k ( t ) } k Z n is a Riesz basis of V 2 ( ϕ ) , then there exist constants 0 < m p M p < such that for any c p ( Z n ) , one has
m p c p ( Z n ) k Z n c ( k ) ϕ k ( t ) L p ( R n ) M p c p ( Z n ) .
(iii)
If f V p ( ϕ ) , then we have the norm equivalences
f L p ( R n ) c p ( Z n ) f W ( L p ( R n ) ) .
Proof. 
Note that
f L p ( R n ) f W ( L p ( R n ) ) , 1 p .
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
T ϕ c = k Z n c ( k ) ϕ ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 t k , c p ( Z n )
and the operator
T ψ * f k = R n f ( t ) ψ ( t k ) ¯ exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 t k d t , f L p ( R n ) .
It follows from Lemmas 11 and 12 that T ϕ is a bounded map from p ( Z n ) to L p ( R n ) and T ψ * is also a bounded map from L p ( R n ) to p ( Z n ) .
Let f ( t ) = k Z n c ( k ) ϕ k ( t ) V p ( ϕ ) . Since { ϕ k ( t ) } k Z n and { ψ m ( t ) } m Z n are biorthogonal, c ( k ) = f , ψ k ( t ) = T ψ * f k . Then
c p ( Z n ) T ψ * o p f L p ( R n ) .
Choosing m p = T ψ * o p 1 obtains the desired result. The norm equivalences (55) follows from (54) and Lemma 12.
Theorem 5.
Let 1 p . Suppose that ϕ W 0 ( L 1 ( R n ) ) and { ϕ k ( t ) } k Z n are the Riesz basis of V 2 ( ϕ ) , then V p ( ϕ ) W 0 ( L p ( R n ) ) .
Proof. 
It is obvious that V p ( ϕ ) W ( L p ( R n ) ) follows from Lemma 12. Note that
f L ( R n ) f W ( L p ( R n ) ) , 1 p .
Let f ( t ) = k Z n c ( k ) ϕ k ( t ) V p ( ϕ ) and f N ( t ) = k N c ( k ) ϕ k ( t ) . If 1 p < , then it follows from Lemma 12 and (57) that
f f N L ( R n ) k > N | c ( k ) | p 1 p ϕ W ( L 1 ( R n ) ) ,
which means that f N ( t ) uniformly converges to the continuous function f ( t ) . □
Now, we will prove for the case p = . Since ϕ W 0 ( L 1 ( R n ) ) , there exists a sequence φ N of continuous function with compact support such that
lim N ϕ φ N W ( L 1 ( R n ) ) = 0 .
Let
g N ( t ) = k Z n c ( k ) φ N ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k ) .
Then, g N is continuous because the sum is locally finite. Using Lemma 12, we have
  f g N L ( R n )   = k Z n c ( k ) ( ϕ φ N ) ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k ) L ( R n ) c ( Z n ) ϕ φ N W ( L 1 ( R n ) ) .
This together with (59) shows that g N ( t ) uniformly converges to continuous function f ( t ) .

4. Sampling and Reconstruction in V p ( ϕ )

In this section, we will discuss the sampling and reconstruction of signals in the space V p ( ϕ ) .
Definition 4
([2]). A set X = { t i : i I } is γ 0 -dense in R n if
R n = i I B γ ( t i ) γ > γ 0 ,
where B γ ( t i ) is a sphere with t i as the center and γ as the radius.
Definition 5
([2]). We call { β i } i I a bounded partition of unity associated with X = { t i : i I } , if
(i)
0 β i 1 for all i I ;
(ii)
s u p p β i B γ ( t i ) ;
(iii)
i I β i 1 .
Moreover, we define the operator Q X as
Q X f = i I f ( t i ) β i .
Theorem 6.
Suppose that ϕ W 0 ( L 1 ( R n ) ) , { ϕ k ( t ) } k Z n is a Riesz basis of V 2 ( ϕ ) and { ψ k ( t ) } k Z n V 2 ( ϕ ) is the dual basis of { ϕ k ( t ) } k Z n . Then the orthogonal projection operator
P : f k Z n f , ψ k ϕ k ( t )
is a bounded projection from L p ( R n ) onto V p ( ϕ ) for 1 p .
Proof. 
Note that
P f = k Z n f , ψ k ϕ k ( t ) = T ϕ T ψ * f , f L p ( R n ) .
Then, the desired result follows from the boundedness of the operators T ϕ and T ψ * in the proof of Theorem 4. □
Lemma 13
([2]). Suppose that φ W 0 ( L 1 ( R n ) ) and { φ ( t k ) : k Z n } are the Riesz basis of V F 2 ( φ ) = k Z n c ( k ) φ ( t k ) : c 2 ( Z n ) . Then, there exists a density γ > 0 such that any f belonging to
V F p ( φ ) = k Z n c ( k ) φ ( t k ) : c p ( Z n )
can be recovered from its samples { f ( t i ) : t i X } on any γ-dense set X = { t i : i I } by the iterative algorithm
f 1 = P F Q X f , f k + 1 = P F Q X ( f f k ) + f k ,
where P F is the bounded projection from L p ( R n ) onto V F p ( φ ) . Moreover, f k uniformly converges to f and
f f k L p ( R n ) f f k W ( L p ( R n ) ) C f L p ( R n ) α k ,
where α = α ( γ ) < 1 .
Define an operator M S as
M S f ( t ) = exp j 2 t T B 1 A t + 2 p T B 1 t f ( t ) .
Then, we can provide the following iterative reconstruction algorithm.
Theorem 7.
Suppose that ϕ W 0 ( L 1 ( R n ) ) and { ϕ k ( t ) } k Z n are the Riesz basis of V 2 ( ϕ ) . Then, there exists a density γ > 0 such that any f V p ( ϕ ) can be recovered from its samples { f ( t i ) : t i X } on any γ-dense set X = { t i : i I } by the iterative algorithm
f 1 = P M S Q X M S 1 f , f k + 1 = P M S Q X M S 1 ( f f k ) + f k .
Moreover, f k uniformly converges to f and
f f k L p ( R n ) f f k W ( L p ( R n ) ) C f L p ( R n ) α k ,
where α = α ( γ ) < 1 .
Proof. 
Note that
f ( t ) = k Z n c ( k ) ϕ k ( t ) = k Z n c ( k ) ϕ ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k )
is equivalent to
exp j 2 t T B 1 A t + 2 p T B 1 t f ( t ) = k Z n c ( k ) exp j 2 k T B 1 A k + 2 p T B 1 k ϕ ( t k ) .
Let
g ( t ) = exp j 2 t T B 1 A t + 2 p T B 1 t f ( t )
and c   2 ( k ) = c ( k ) exp j 2 k T B 1 A k + 2 p T B 1 k . Then, g ( t ) V F p ( ϕ ) . Since the FT of ϕ satisfies (26), { ϕ ( t k ) : k Z n } is the Riesz basis of V F 2 ( ϕ ) . Then it follows from Lemma 13 that g can be recovered from its samples
g ( t i ) = exp j 2 t i T B 1 A t i + 2 p T B 1 t i f ( t i )
by the iterative algorithm
g 1 = P F Q X g , g k + 1 = P F Q X ( g g k ) + g k .
Moreover, g k uniformly converges to g and
g g k L p ( R n ) g g k W ( L p ( R n ) ) C g L p ( R n ) α k ,
where α = α ( γ ) < 1 . Note that
P F f ( t ) = k Z n f , ψ ( t k ) ϕ ( t k )   = k Z n exp j 2 t T B 1 A t + 2 p T B 1 t f , ψ ( t k ) exp j 2 t T B 1 A t k T B 1 A k .   . + 2 p T B 1 ( t k ) ϕ ( t k ) exp j 2 t T B 1 A t k T B 1 A k + 2 p T B 1 ( t k ) · exp j 2 t T B 1 A t + 2 p T B 1 t   = k Z n exp j 2 t T B 1 A t + 2 p T B 1 t f , ψ k ϕ k ( t ) exp j 2 t T B 1 A t + 2 p T B 1 t = exp j 2 t T B 1 A t + 2 p T B 1 t P exp j 2 t T B 1 A t + 2 p T B 1 t f ( t ) ,
which means that
exp j 2 t T B 1 A t + 2 p T B 1 t P F f ( t ) = P exp j 2 t T B 1 A t + 2 p T B 1 t f ( t ) .
Therefore, the algorithm (72) can be rewritten as
M S g 1 = P M S Q X M S 1 f , M S g k + 1 = P M S Q X M S 1 ( f M S g k ) + M S g k .
Let f k = M S g k . Then, (75) is equivalent to
f 1 = P M S Q X M S 1 f , f k + 1 = P M S Q X M S 1 ( f f k ) + f k .
Note that
f f k = M S ( g g k ) = g g k .
Then, f f k L p ( R n ) = g g k L p ( R n ) and f f k W ( L p ( R n ) ) = g g k W ( L p ( R n ) ) . 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 A = 1 4 0 0 1 2 , B = 1 0 0 1 , C = 0 0 0 0 , D = 4 0 0 2 , p = 1 0 , q = 0 1 and a signal
f ( t ) = s i n c t 1 s i n c t 2 exp j 2 1 4 t 1 2 + 2 t 1 exp j 2 1 2 t 2 2 + 2 t 2
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.

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

  1. Shannon, C.E. Communication in the presence of noise. Proc. IRE 1949, 37, 10–12. [Google Scholar] [CrossRef]
  2. Aldroubi, A.; Gröchenig, K. Nonuniform sampling and reconstruction in shift-invariant spaces. SIAM Rev. 2001, 43, 585–620. [Google Scholar] [CrossRef]
  3. 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]
  4. 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]
  5. 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]
  6. Eldar, Y.C. Compressed sensing of analog signal in a shift-invariant spaces. IEEE Trans. Signal Process. 2009, 57, 2986–2997. [Google Scholar] [CrossRef]
  7. Führ, H.; Xian, J. Relevant sampling in finitely generated shift-invariant spaces. J. Approx. Theory 2019, 240, 1–15. [Google Scholar] [CrossRef]
  8. 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]
  9. 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]
  10. Unser, M. Sampling–50 years after Shannon. Proc. IEEE 2000, 88, 569–587. [Google Scholar] [CrossRef]
  11. Yang, J. Random sampling and reconstruction in multiply generated shift-invariant spaces. Anal. Appl. 2019, 17, 323–347. [Google Scholar] [CrossRef]
  12. 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]
  13. 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]
  14. 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]
  15. Stern, A. Sampling of compact signals in the offset linear canonical domain. Signal Image Video Process. 2007, 1, 359–367. [Google Scholar] [CrossRef]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. Xu, L.; Zhang, F.; Tao, R. Randomized nonuniform sampling and reconstruction in fractional Fourier domain. Signal Process. 2016, 120, 311–322. [Google Scholar] [CrossRef]
  22. 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]
  23. Collins, S.A. Lens-system diffraction integral written in terms of matrix optics. J. Opt. Soc. Am. 1970, 60, 1772–1780. [Google Scholar] [CrossRef]
  24. 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]
  25. Moshinsky, M.; Quesne, C. Linear canonical transformations and their unitary representations. J. Math. Phys. 1971, 12, 1772–1780. [Google Scholar] [CrossRef]
  26. 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]
  27. 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]
  28. 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]
  29. Woods, J.W. Multidimensional Signal, Image, and Video Processing and Coding; Academic Press: Cambridge, MA, USA, 2011. [Google Scholar]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. Zhao, J.; Tao, R.; Wang, Y. Sampling rate conversion for linear canonical transform. Signal Process. 2008, 88, 2825–2832. [Google Scholar] [CrossRef]
  35. Vaidyanathan, P.P. Multirate digital filters, filter banks, polyphase networks, and applications: A tutorial. Proc. IEEE 1990, 7, 56–93. [Google Scholar] [CrossRef]
  36. 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]
  37. 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]
Figure 1. The real and imaginary parts of f.
Figure 1. The real and imaginary parts of f.
Axioms 13 00329 g001
Figure 2. The real and imaginary parts of the SAFT of f.
Figure 2. The real and imaginary parts of the SAFT of f.
Axioms 13 00329 g002
Figure 3. The real and imaginary parts after sampling f.
Figure 3. The real and imaginary parts after sampling f.
Axioms 13 00329 g003
Figure 4. The real and imaginary parts of the reconstructed signal.
Figure 4. The real and imaginary parts of the reconstructed signal.
Axioms 13 00329 g004
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.

Share and Cite

MDPI and ACS Style

Jiang, Y.; Yang, J. Nonuniform Sampling in Lp-Subspaces Associated with the Multi-Dimensional Special Affine Fourier Transform. Axioms 2024, 13, 329. https://doi.org/10.3390/axioms13050329

AMA Style

Jiang Y, Yang J. Nonuniform Sampling in Lp-Subspaces Associated with the Multi-Dimensional Special Affine Fourier Transform. Axioms. 2024; 13(5):329. https://doi.org/10.3390/axioms13050329

Chicago/Turabian Style

Jiang, Yingchun, and Jing Yang. 2024. "Nonuniform Sampling in Lp-Subspaces Associated with the Multi-Dimensional Special Affine Fourier Transform" Axioms 13, no. 5: 329. https://doi.org/10.3390/axioms13050329

APA Style

Jiang, Y., & Yang, J. (2024). Nonuniform Sampling in Lp-Subspaces Associated with the Multi-Dimensional Special Affine Fourier Transform. Axioms, 13(5), 329. https://doi.org/10.3390/axioms13050329

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop