Generalized Canonical Cosine Transform

DOI : 10.17577/IJERTV1IS6019

Download Full-Text PDF Cite this Publication

Text Only Version

Generalized Canonical Cosine Transform

GENERALIZED CANONICAL COSINE TRANSFORM

A. S. GUDADHE # and A.V. JOSHI *

# Govt. Vidarbha Institute of Science and Humanities, Amravati. (M. S.)

* Shankarlal Khandelwal College, Akola – 444002 (M. S.)

Abstract: As generalization of the fractional Cosine transform (FRCT), the canonical cosine transform (CCT) has been used in several areas, including optical analysis and signal processing. Besides, the canonical cosine transform is also useful for radar system analysis, filter design, phase retrieval pattern recognition, and many other verities of branches of mathematics and engineering. In this paper we have proved some important results about the analyticity theorem; Inversion theorem for canonical cosine transform, Uniqueness theorem, we have also proved the Properties of Canonical Cosine Transform.

Keywords: Linear canonical transform, Fractional Fourier Transform.

Introduction: Integral transforms had provided a well establish and valuable method for solving problems in several areas of both Physics and Applied Mathematics. The roots of the method can be stressed back to the original work of Oliver Heaviside in 1890. This method proved to be of great importance, in the initial and final value problems for partial differential equations. Due to wide spread applicability of this method for partial differential equations involving distributional boundary conditions, many of the integral transforms are extended to generalized functions.

The idea of the fractional powers of Fourier operator appeared in mathematical literature as early in 1930. It has been rediscovered in quantum mechanics by Namias [9]. He had given a systematic method for the development of fractional integral transforms by means of Eigenvalues. Later on numbers of integral transforms are extended in its fractional domain. For examples Almeida [2] had studied fractional Fourier transform, Akay [1] developed fractional Mellin transform, Pei, Ding [12] studied fractional cosine and sine transforms, etc. These fractional transforms found number of applications in signal processing, image processing, quantum mechanics etc.

Recently further generalization of fractional Fourier transform known as linear canonical transform was introduced by Moshinsky [8] in 1971. Pei, Ding [16] had studied its eigen value aspect.

Linear canonical transform is a three parameter linear integral transform which has several special cases as fractional Fourier transform, Fresnel transform, Chirp transform etc. Linear canonical transform is defined as,

[LCTf (t)](s)

1 i d

e2 b

2 ib

s2 i (a / b)t2

e2 e

i(s / b)t f (t) dt,

for b 0

i cd s2

= d e 2 f (ds) , for b = 0, with ad bc =1,

where a, b, c, and d are real parameters independent on s and t.

  1. 1.1 Definition:

    The Canonical Cosine Transform f

    E1(Rn )

    can be defined by,

    {CCT f (t)} (s) = < f(t), K c (t, s) > where,

    i d

    s 2 i (a / b)t2

    KC (t, s)

    1 e 2 b e2 2 ib

    cos

    s t .

    b

    . (1.1.1)

    Hence the generalized canonical cosine transform of f

    E1(Rn) can be defined by,

    CCTf (t)

    (s)

    1

  2. ib

i d

e2 b

s2

cos.

s i (a / b) t 2

t e2

b

f (t) dt,

    1. If f E1 (R n ) and its canonical cosine transform is given by,

      [CCTf (t)](s)

      1

      2 ib

      i d

      e 2 b

      s2

      cos.

      s i a

      t e 2 b

      b

      t 2

      f (t) dt,

      then [CCT f (t)](s) is analytic on Cn

      Proof:Let

      s : (s1 , s2

      ,s j

      sn )

      C n .

      We first prove that

      [CCT f (t)](s) exists,

      s j

      n

      s

      n

      {CCT

      j

      f (t)}(s)

      f (t),

      n

      s

      n Kc (t, s)

      j

      . .. (1.2.1)

      Where,

      Kc (t, s)

      1

      2 ib

      i d

      e2 b

      s2 i a

      e2 b

      t 2 s

      cos. t .

      b

      We prove the result for n = 1, the general result follows by induction.

      For fixed sj 0 choose two concentric circles C and C1 with centre sj and radii r and r1

      respectively, such that 0<r<r1<|sj|.

      Let

      s j be a complex increment satisfying 0<|

      s j | <r.

      Consider,

      [CCT](s j

      s j )

      s j

      [CCT](s j )

      f (t),

      Kc (t, s)

      s

      j

      f (t),

      s j (t)

      Where,

      s j (t)

      1

      s

      Kc (t, s1 , s2

      j

      ,, s j

      s j ,, sn )

      Kc (t, s)

      Kc (t, s) .

      s

      j

      For any fixed t

      Rn and any fixed integer k

      (k1 , k2

      ,kn )

      N n ,

      o

      Since for any fixed t Rn , fixed integer k.

      t

      c

      Dk K

      (t, s)

      is analytic inside and on C' , we have by Cauchy integral formula.

      Dk s

      (t)

      Dk { 1 1

      Kc (t, s)

      dz 1

      Kc (t, s) dz

      1. dz}

        t j t

        s j 2

        i C1 z

        (s j

        s j )

        2 i C1 z s j 2 i

        D

        s

        t j

        k (t)

        1 k

        D

        2 i

        K

        t c

        C1

        (t, s)

        1 1

        s j z s j

        1

        s j z s j

        1 dz

        2

        (z s j )

        D

        k t

        where,

        s j (t)

        s j

      2. i C1 (z

      k

      D

      K

      t c

      s s j

      (t, s)

      ) (z

      j

      s )2

      dz,

      s (s1 s j 1 , z, s j 1 ,sn )

      Dk s

      s

      (t) j

      M (t, s)

      dz.

      j

      t j 2

      i C1 (z s j

      s j ) (z

      s )2

      But, for all z C1 and t restricted to a compact subset of Rn,

      M (t, s)

      Dk K

      (t, s) is bounded by constant M1.

      t

      c

      Therefore, we have,

      D

      s

      t j

      k (t)

      s j

      (r1

      M1

      r) (r1 )

      Thus, as s j 0,

      k (t)

      tends to zero uniformly on the compact subset of Rn,

      D

      s

      t j

      therefore, it follows that

      s j (t)

      converges in E(Rn) to zero.

      Since f E1 , we conclude that [1] also tends to zero.

      C CT. f (t)

      s j

      (s)

      f (t),

      Kc (t, s) ,

      s

      j

      Also tends to zero.

      Therefore,

      CCT

      f (t)

      (s)

      is differentiable with respective sj.

      But this is true, for all j= 1, 2,.., n.

      Hence

      CCT

      f (t)

      (s)

      is analytic on Cn and

      D

      s

      k CCT

      f (t)

      (s)

      f (t), Dk

      Kc (t, s)

      s

      D

      i.e.

      k CCT

      f (t)

      (s)

      f (t), Dk

      Kc (t, s)

      s

      s

    2. Inversion theorem for canonical cosine transform:

      If CCT

      f (t)

      (s)

      canonical cosine transform of f(t) is given by,

      CCT

      f (t)

      (s)

      1

      2 ib

      i d s 2

      e2 b

      cos

      s t e2

      i

      b

      a t 2

      b

      f (t) dt

      then,

      f (t)

      2 i e 2

      i

      b

      1. t 2

        b

        i d

        e 2 b

        s2 s

        cos t b

        CCT

        f (t)

        1. ds

          Proof: The canonical cosine transform of f(t) is given by

          CCT

          f (t)

          (s)

          1

          2 ib

          i d s2

          e 2 b

          cos

          s t e 2

          i

          b

          a t 2

          b

          f (t) dt

          i

          d

          i

          a

          1. s 2 t 2 s

            F (s) e2 b e2 b cos t f (t) dt

          2. ib b

          Where {CCT f(t)}(s) F(s)

          i d s 2

          i a t 2 s

          F(s) 2

          ib e 2 b

          e2 b

          f (t) cos t dt

          b

          i d s 2

          i a t 2 s

          F(s) 2

          ib e 2 b

          e2 b

          f (t) cos t dt

          b

          C1 (s)

          g(t) cos s t dt

          b

          1 d s 2

          Where

          C1 (s)

          F (s) 2 ib e 2 b

          and g(t)

          i a

          e 2 b

          t 2

          f (t).

          C1(s)

          g(t) cos( .t) dt

          s d 1 ds

          b b

          C1(s)

          g(t) cos( .t) d .

          By using inverse formula of cosine transform.

          g(t)

          C1 cos( .t) d

          i a

          e 2 b

          t 2

          f (t)

          F(s)

          i d

          2 ib e 2 b

          s2

          cos(

          .t) d

          f (t)

          i a t 2

          e 2 b

          F(s)

          2 ib e

          i d s 2

          2 b

          cos( .t) d .

          f (t)

          i a t 2

          e 2 b

          i d s 2

          e 2 b

          2 ib

          F(s) cos( .t)

          1. ds. b

            f (t)

            i a t 2

            e 2 b

          2. ib 1

          b

          i d

          e 2 b

          s 2

          cos

          s t F(s) ds b

          i a t 2 2 i i d s 2 s

          f (t)

          e 2 b

          b

          e 2 b

          cos t b

          F(s) ds

          i a t 2 2 i i d s 2 s

          f (t)

          e 2 b

          b

          e 2 b

          cos

          t F(s) ds

          b

          f (t)

          2 i e b

          i a t 2

          2 b

          i d

          e 2 b

          s 2 s

          cos t b

          CCT

          f (t)

          (s)ds

    3. If CCT

      f (t)

      (s)

      and

      CCT

      g(t)

      (s)

      are canonical cosine transform and

      sup f

      sup g

      s , s

      s , s

      x : x

      x : x

      R, x

      R, x

      and

      and if

      CCT [ f (t)]

      (s)

      CCT

      g(t)

      (s)

      then, f = g in the sense of equality in D'(I ) .

      Proof:By inversion theorem

      f g 2 i b

      i a t 2

      1. 2 b

      i d

      e 2 b

      s 2 s

      cos t b

      CCT

      f (t)

      (s)ds

  1. i e b

i a t 2

2 b

i d s 2

  1. 2 b

    cos s t b

    CCT g(t)

    (s)ds

  2. g 2 i b

i a t 2

e 2 b

i d

e 2 b

s 2 s

cos t b

CCT

f (t)

(s)

CCT g(t)

(s)

ds Thus f = g

in D'(I ) .

1.5 Properties of Canonical Cosine Transform:

1. 5. 1 Shifting property of canonical cosine transform:

If {CCT f(t)} (s) denotes generalized canonical cosine transform of f(t) and , is any real number. Then,

{CC T

sin

f (t

s b

)}(s)

CST

i a

e 2 b

f (t) e

2

[cos

it a

b

s b

(s)]

CCT

it a

f (t) e b

(s)

1. 5. 2 Differentiation property of canonical cosine Transform:

If {CCT f(t)}(s) denotes generalized canonical cosine transform of f(t), then

CCT ( f 1 (t))

(s)

s {CST

b

f (t)}(s) i a

b

CCT

f (t)

(s)

1. 5. 3 Scaling property of canonical cosine transform:

If {CCT f(t)}(s) denotes generalized canonical cosine transform, then

{CCT [ f (kt)]}(s)

  1. e 1 k

    1

    k

    i d s 2

  2. b

CCT

1

f (t) e k

1 i a t 2

2 bk

(s)

Conclusion: In this paper, brief introduction of the generalized canonical cosine transform is given and its analyticity theorem, Inversion theorem for canonical cosine transform, Uniqueness theorem is proved. Properties of Canonical Cosine Transform are also obtained which will be useful in solving differential equations occurring in signal processing and many other branches of engineering.

Acknowledgement: The author is thankful to referee, for his valuable comments. The suggestions made by Professor A. S. Gudadhe have been very helpful in this investigation.

References:

    1. Akay O. and Bertels, (1998): Fractional Mellin Transformation: An extension of fractional frequency concept for scale, 8th IEEE, Dig. Sign. Proc. Workshop, Bryce Canyan, Utah.

    2. Almeida, L.B., (1994): The fractional Fourier Transform and time- frequency representations, IEEE. Trans. on Sign. Proc., Vol. 42, No.11, 3084-3091.

    3. Bhosale B. N., and Chaudhary M. S., (2002): Fractional Fourier transform of distribution of compact support, Bull. Cal. Math. Soc., Vol.94, No.5, 349-358

    4. Gelfand I. M. and Shilov G. E., (1964): Generalized functions, Vol. I, Academic Press, New York.

    5. Gelfand I. M. and Shilov G. E., (1967): Generalized functions, Vol. I, Academic Press, New York.

    6. Lohamann, A. W.: Image Rotation, Winger Rotation and The Fractional Fourier Transform, Jour. Opt. Soc. Am. A; Vol. 10, No.10, Oct. 1993, 2181-2186.

    7. Mahalle, V.N.and Gudadhe A S: On Generalized Fractional Complex Mellin Transform AMSA, Vol. 19, No. 1,(2009) P. 31-38.

    8. Moshinsky, M.: Linear canonical transform and their unitary representation, Jour. Math, Phy.,Vol.12, No. 8 , P. 1772-1783, (1971).

    9. Namias V. (1980): The fractional order Fourier transform and its applications to quantum mechanics, Jour. Inst. Maths. App., Vol. 25, 241- 265.

    10. Ozaktas H.M., Zalevsky Z., Kutay M.A., (2000): The fractional Fourier transform with applications in optics and signal processing, Pub. John

      .Wiley and Sons Ltd.

    11. Pathak R.S., (1997): Integral transforms of generalized functions and their applications, Gardon and Breach Science Publisher.

    12. Pie and Ding, (2001): Relations between fractional operations and time- frequency distributions and their application, IEEE. Trans. on Sign. Proc., Vol. 49, No.8, 1638-1654.

    13. Sontakke, P. K. and Gudadhe, A.S.: Analyticity and Operation Transform On Fractional Hartley Transform Int. Journal of Math. Analysis, Vol.2, 2008,

      No. 20, 977-986.

    14. Torre, A.: Linear and Radial Canonical Transforms of Fractional Order, Jour. of Computational and applied Mathematics 153 (2003), 477 – 486.

    15. Zemanian A. H., (1968): Generalized integral transform, Inter Science Publishers, New York.

    16. Soo-Chang Pei, and Jian-Jiun Ding: Eigenfunctions of Linear Canonical Transform Vol. 50, No. 1, January (2002).

Leave a Reply