Digital computation of the complex linear canonical transform.

نویسندگان

  • Changgeng Liu
  • Dayong Wang
  • John J Healy
  • Bryan M Hennelly
  • John T Sheridan
  • Myung K Kim
چکیده

An efficient algorithm for the accurate computation of the linear canonical transform with complex transform parameters and with complex output variable is presented. Sampling issues are discussed and the requirements for different cases given. Simulations are provided to validate the results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain

Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...

متن کامل

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Fast and accurate algorithm for the computation of complex linear canonical transforms.

A fast and accurate algorithm is developed for the numerical computation of the family of complex linear canonical transforms (CLCTs), which represent the input-output relationship of complex quadratic-phase systems. Allowing the linear canonical transform parameters to be complex numbers makes it possible to represent paraxial optical systems that involve complex parameters. These include loss...

متن کامل

Determining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

متن کامل

Why is the Linear Canonical Transform so little known ?

The linear canonical transform (LCT), is the name of a parameterized continuum of transforms which include, as particular cases, the most widely used linear transforms and operators in engineering and physics such as the Fourier transform, fractional Fourier transform (FRFT), Fresnel transform (FRST), time scaling, chirping, and others. Therefore the LCT provides a unified framework for studyin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of the Optical Society of America. A, Optics, image science, and vision

دوره 28 7  شماره 

صفحات  -

تاریخ انتشار 2011