Skip to content
akaturk Academic measurement

Article detail · 2008

Digital Computation of Linear Canonical Transforms

YÖKSİS OpenAlex Open access · green SJR Q1 JCR Q1 Citations 164 Top 1% Percentile 99.5% FWCI 14.14
Year
2008
Type
article

Data source split

  • YÖKSİS YÖKSİS article record
  • YÖKSİS venue IEEE TRANSACTIONS ON SIGNAL PROCESSING
  • Catalog match (ISSN) IEEE Transactions on Signal Processing
  • OpenAlex OpenAlex enrichment (abstract, citations, topics)

Abstract

OpenAlex · English

We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the original function. Two approaches are presented and compared. The first is based on decomposition of the LCT into chirp multiplication, Fourier transformation, and scaling operations. The second is based on decomposition of the LCT into a fractional Fourier transform followed by scaling and chirp multiplication. Both algorithms take ~ N log N time, where N is the time-bandwidth product of the signals. The only essential deviation from exactness arises from the approximation of a continuous Fourier transform with the discrete Fourier transform. Thus, the algorithms compute LCTs with a performance similar to that of the fast Fourier transform algorithm in computing the Fourier transform, both in terms of speed and accuracy.

Topics

Citations

OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.

164 citations

OpenAlex cited_by_count (cache / database)

Authors

  1. AYKUT KOÇ İHSAN DOĞRAMACI BİLKENT ÜNİVERSİTESİ
  2. MEMDUH HALDUN ÖZAKTAŞ
  3. ÇAĞATAY CANDAN
  4. MEHMET ALPER KUTAY İHSAN DOĞRAMACI BİLKENT ÜNİVERSİTESİ