• Không có kết quả nào được tìm thấy

Convolution for The Offset Linear Canonical Transform with Gaussian Weight and Its Application

N/A
N/A
Protected

Academic year: 2022

Chia sẻ "Convolution for The Offset Linear Canonical Transform with Gaussian Weight and Its Application"

Copied!
8
0
0

Loading.... (view fulltext now)

Văn bản

(1)

47

Original Article

Convolution for The Offset Linear Canonical Transform with Gaussian Weight and Its Application

Quan Thai Ha

1,*

, Lai Tien Minh

2

, Nguyen Minh Tuan

3

1Faculty of Mathematics, Mechanics and Informatics, VNU Hanoi University of Science, 334 Nguyen Trai, Hanoi, Vietnam

2Department of Mathematics, Hanoi Architectural University, Hanoi, Vietnam

3Department of Mathematics, VNU University of Education, 144 Xuan Thuy, Hanoi, Vietnam Received 26 November 2018

Revised 25 February 2019; Accepted 15 March 2019

Abstract: This paper presents the convolution for the offset linear canonical transform (OLCT) with the Gaussian weight and its applications. The product theorem is also studied. In applications, some ways to design the filters in the OLCT domain as well as the multiplicative filter and the Gaussian filter are introduced.

Keywords: Reconstruction, Shannon theorem, convolution, filter, signal, offset linear canonical transform, fractional Fourier transform, Fourier transform.

1. Introduction

Throughout this paper we shall consider parameters a b c d u, , , , 0,0 and i will be denoted the unit imaginary number. The Offset Linear Canonical Transform (OLCT) (see [1]) of a signal f t

 

with real parameters A

a b c d u, , , , 0,0

, (adbc1) is defined as

           

 

 

2

0 0

( )

2

0

, 0

: :

, 0

A ,

cd

A A

i u u i u

u t

u f

f t dt b

F

d e f d u u

t u

b

 

  

  

, (1.1)

________

Corresponding author.

E-mail address: haqt80@gmail.com

https//doi.org/ 10.25073/2588-1124/vnumap.4300

(2)

where

2 1 2 ( 0 0) 0

2 2

( , ) :

b du u

d a

u tu t u t

b b b b b

i A u t K eA

 , and

2 0

2

2

idu b A

K e

bi

 .

The inverse OLCT expression is given by

      

1 1

( ) A A( ) A A ,

f t F u tC

F u u t du, (1.2)

where A1

d, b, c a b, , 0du cu0, 0a0

, and

02 2 0 0 02

1

2cdu adu ab

Cei . (1.3)

In this paper, we only consider b0 since the OLCT becomes a chirp multiplication operation otherwise.

The OLCT is generalization of many operations, as follows: the Linear Canonical Transform (LCT), the Fractional Fourier Transform (FRFT), the Fourier Transform (FT). When u0 0 0, we back to the definition of the Linear Canonical Transform (see [2]).

The Fractional Fourier Transform (FRFT) (see [3]) is considered a special case of the OLCT when parameters A have the form A

cos ,sin , sin ,cos ,0,0    

. For any real angle , the FRFT is defined as

  

1 cot ( ) cot2 2 sin cot2 2 , sin 0

2

i u ut t

f u i f t e dt

 

. (1.4)

When the angle 2

 , the FRFT becomes the Fourier Transform (FT) (see [4]). In this paper, we will use the Fourier Transform and its inverse defined by

     

:

 

iut

FT f t u f t e dt

 

, (1.5)

 

1

     

2

iut

f t FT f t u e du

 

  , (1.6)

respectively. If f h, L1( ), the classic Fourier convolution operation in the time domain is defined as

f *h t

 

f

  

h t 

d . (1.7)

It is easy to see that

f*h

 

t  f

   

t *h t ,   , (1.8)

and

  

*

              

FT f h t u FT f t u FT h t u

     . (1.9)

• We also have the Young’s inequality (see [5]). If fLp

 

, hLq

 

, and1 1 1 1

p   q r ,

p q r, , 1

. Then the following inequality holds

* r 1 p q

f hC fh , (1.10)

where C1is a positive constant.

(3)

Now we will exemplify some basic properties of A (see [6]).

Suppose fL1

 

, and  , , we have

• Time shift:

 

 

iac2 2 c(u u0) a 0

 

A f t e  F uAa .

• Modulation:

i t

    

ibd2 2 d (u u0) b 0

 

A e f t u e F uA b



  .

• Time shift/modulation:

 

y

i ac2 2 bc bd2 2 i c d u u0 i a b 0

 

A e f t  e  e   e    F uAab .

A is a linear, continuous and one-to-one map from the Schwartz space onto (whose inverse is obviously also continuous).

Let C0

 

be the Banach space of all continuous functions on that vanish at infinity and being endowed with the supremum norm  , and let 1 1

: ( )

2

f f t dt

 

be the norm in L1

 

.

• (Riemann-Lebesgue type lemma for the OLCT). If fL1

 

, then AfC0

 

, and

1

1

Af | | f

b .

• (Plancherel type theorem for the OLCT). Let f be a complex-valued function in the space

 

L2 and let

     

| |

, : ,

Af u k t k A u t f t dt

.

Then, as k , Af u k

 

, converges strongly (over ) to a function, say AfL2

 

, and, reciprocally,

 

, : | |t k A1

 

, A

 

f u k C u t f t dt

converges strongly to f u

 

, where C is the same as in (1.3).

• (Parseval type identity for the OLCT). For any f h, L2

 

the following identity holds

, ,

Af Ahf h ,

where ,  is denoting the usual inner product in L2

 

. In the special case when hf , it holds

2 2

Aff .

For convenience, we denote

du0b0

 

2 2

, A

 

t ei2abt2ub0t, f t

 

A

   

t f t , and

the Gaussian function

 

t 1 e 21b2t 2

b

 . The OLCT (1.1) becomes

(4)

       

i 2dbu2 b0bdu0u

 

iutb

A A A

F u f t u K e f t e dt

 

. (1.11)

There are many different types of convolutions for the OLCT. Most of them have the weight functions in the form iu2 u

e (see [1]). In [7], some convolutions for the FRFT with the Hermite weights in the form ei u 2n

 

u , and the Gaussian weight in the form

2 1 2 2u

ei u e , are also obtained. In this paper, we focus on studying the convolution for the OLCT with the Gaussian weight in the form

1 2 2u

e , and its applications.

The paper is divided into two sections and organized as follows. In the next section, we provide the convolution for the OLCT with the Gaussian weight function and study its product theorem. Some special cases of this convolution are also deduced.

2. Convolution for the OLCT with the Gaussian weight function and product theorem

Definition 2.1. Let f h, L1

 

, the convolution for the OLCT of two signals f t

 

and h t

 

with the Gaussian weight function

 

t is defined by

 

fh t

 

KA

A( )t

1

f * *h

  

2t . (2.1)

It easily seen that if f h, L1

 

then

 

fh t

 

L1

 

. Moreover, 1

1 2 1

fhC fh , where C2 is a positive constant.

Theorem 2.1. Assume that f h, L1

 

, z t

 

 

fh t

 

and F uA

 

, ZA

 

u , HA

 

u denote

the OLCT of the signals f t

 

, z t

 

, h t

 

with a set of parameters A, respectively. The factorization following identity is fulfilled

 

14 2

2 2

u

A A A

u u

Z ueF  H  

   .

Moreover, if 14 2

1

  

2 2

u

A A A

u u

eF  H   L

    then

 

1 14 2

 

2 2

u

A A

A

u u

z t e F H t

   

       . (2.2)

Proof. Based on classic Fourier convolution (1.7), the convolution (2.1) can be expressed as

 

fh t

 

KA

A( )t

1

 

f u h v

    

2t u v dudv

. (2.3)

Since (1.11), we realize that

   

2 0 0

   

2 2 2( )

1 1

2 2 2

b du

d iu iuv

i u u

u u

b b b b

A A A

e F u H u e K e f h v e e d dv

 

  

 

(5)

   

0 0

2 2 2

1 2 2

1 2

b du

d iu iuv

i u u

t iut b b b b

e dtK eA f h v e e d dv

 

  

   

2 1 ( 0 0) 12

2 ( ) ( 2 )

2

2

b du

i dbu b v bt u b u t

KA

e f h v e d dvdt

 

  

  

.

By making s    vbt, we obtain

   

1 2

2u

A A

e F u H u

   2 0 0 

1

2 1 2 2

2 2 2

2 2

b du

d s A A

i u u u

b b b

A A

K s K e s

b

 

 

 

  

  

   

  

 

 

   

21b2s v 2

fh v e    d dv ds

 



1

2, 2 ( ) ( ) ( )

2 2

A A

A

K s

s s

u f h v s v d dv d

b   

  

   

    

 

 

 

 

   

 

 

 

 

   

 

  

 

2,

2 2 2

A

s s s

u f h d

   

    

  

     

 

     2

A f h u

  .

The proof is completed.

Remark 2.1. Furthermore, using the fomula (1.8) the convolution (2.1) can also be rewritten as

 

fh t

 

2KA

A

 

t

1

f

     

2 *t h 2 *t 2t

. (2.4)

Remark 2.2. In particular, if we chosse h t( )( )t , where ( )t is the Dirac delta function, we then have

f A1

  

t KA

A

 

t

1

f *

  

2t 2KA

A

 

t

1

f

   

2 *t 2t

. (2.5)

3. Applications

3.1. The Gaussian filter in the OLCT domain. The Gaussian filter is of importance in the signal processing. In this subsection, based on the remark 2, the Gaussian filter in the OLCT domain will introduced.

(6)

The output signal rout

 

t can be expressed as following

 

2

   

1

    

2 * 2

out t A A t in

rK r t t . (3.1)

The method to achieve the multiplicative filter in the OLCT domain through the convolution (2.1) is shown in Fig 1.

In this following example, our objective is using the proposed filters to restore an observed signal

     

rin ty tn t where y t n t

   

, denote the desired signal and the additive noise, respectively.

Example 3.1. Let 2 1

, , 1, 3,0,0

A  7 7   , rin

 

te212t2sin 1.5

t

ei t202 ,

 

212t2 sin 1.5

 

y tet , n t

 

ei t202, and the Gaussian function

 

t 7 e 492t2

.

 

7 it2

    

2 * 2

out t in

r e r t t

i

.

Then the results of Gaussian filter is given in Fig. 2

Figure 1. The method to achieve Gaussian filter in the OLCT domain.

Figure 2. Results of Gaussian filter achieve by using the convolution (2.1).

(7)

3.2. The multiplicative filter in the OLCT domain. In this subsection, rin

 

t and rout

 

t are denoted as the input signal and output signal, respectively.

The output signal of OLCT can be obtained as following

     

1 14u2

   

2 2

 

out t in A A in u A u

r r h t e r t H t

   

  

 

      

 

    . (3.2)

Let HA

 

ue12u2HA

 

u , since the OLCT-frequency spectrum is usually interested only in the region

u u1, 2

, then the filter impulse response h t

 

can be selected such that HA

 

u is constant over

u u1, 2

, and zero or rapid decay outside that region. In paticular, we then have

 

1

     

, 1 2, 2 2

out t A A in t u2

r r t u u u

 

 

 

   

    .

Moreover, HA

 

u can also be chosen equal the constant over

u u1, 2

, and zero outside that region. Thus, we can get

 

1 14 2

     

, 1 2, 2 2

2

u

out t A A in t u

r e r t u u u

 

 

 

   

     .

By denoting

 

14 2

   

2 2

u

A in t u A u

E u e r   H  

   

 

 

 

, the realization method is given by Fig.3.

Therefore, when the OLCT becomes the LCT or the FRFT, it is easy to implement in the designing of multiplicative filters through the product in the OLCT domain (see [2]).

Figure 3. The method to achive multiplicative filter in the OLCT domain.

(8)

References

[1] Q. Xiang, K.Y. Qin, Convolution, correlation, and sampling theorems for the offset linear canonical transform, K.

SIViP 8(3) (2014) 433:442. https://doi.org/10.1007/s11760-012-0342-0.

[2] A. Koc, H.M. Ozaktas, Cagatay Candan, and M. Alper Kutay, Digital computation of linear canonical transforms, IEEE Transactions on Signal Processing 56(6) (2008) 2383-2394. https://doi.org/10.1109/TSP.2007.912890 [3] H.M. Ozaktas, Z. Zalevsky, M.A. Kutay, The Fractional Fourier Transform with Applications in

Optics and Signal Processing, Wiley, New York, 2001.

[4] R.N. Bracewell, The Fourier Transform and its Applications, 3rd ed, McGraw-Hill Press, New York, 2000.

[5] W. Beckner, Inequalities in Fourier analysis, Annals of Mathematics 102(1) (1975) 159-182.

https://doi.org/10.2307/1970980.

[6] L.P. Castro, L.T. Minh, N.M. Tuan, New convolutions for quadratic-phase Fourier integral operators and their applications, Mediterr. J. Math. (2018) 15:13. https://doi.org/10.1007/s00009-017-1063-y.

[7] P.K. Anh, L.P. Castro, P.T. Thao, N.M. Tuan, Inequalities and consequences of new convolutions for the fractional Fourier transform with Hermite weights, AIP Conference Proceedings 1798, 020006 (2017).

https://doi.org/10.1063/1.4972598.

Tài liệu tham khảo

Tài liệu liên quan