Cited by 22Digital Filter Design and ImplementationMathematical Analysis and Transform MethodsMatrix Theory and Algorithms

Space–bandwidth-efficient realizations of linear systems

Open access
Kutay, M. Alper, Erden, M. Fatih, Ozaktas, Haldun M., Arıkan, Orhan, Güleryüz, Özgür, Candan, Çaǧatay·1998·Optics Letters

Abstract

One can obtain either exact realizations or useful approximations of linear systems or matrix-vector products that arise in many different applications by implementing them in the form of multistage or multichannel fractional Fourier-domain filters, resulting in space-bandwidth-efficient systems with acceptable decreases in accuracy. Varying the number and the configuration of filters enables one to trade off between accuracy and efficiency in a flexible manner. The proposed scheme constitutes a systematic way of exploiting the regularity or structure of a given linear system or matrix, even when that structure is not readily apparent.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1364/ol.23.001069

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • In the linear-system-approximation application in [17] and [18], we can implement the fractional Fourier transform stages with this fast algorithm.

    “For example, in the linear-system-approximation application in [17] and [18], we can implement the fractional Fourier transform stages with this fast algorithm.”

    From The discrete fractional Fourier transform (2000) · cites this paper as [18]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 14

  1. [1]1. D. Mendlovic and H. M. Ozaktas, Appl. Opt. 32, 5119 (1993).
  2. [2]2. M. F. Erden, H. M. Ozaktas, and D. Mendlovic, Opt. Commun. 125, 288 (1996).
  3. [3]3. Z. Zalevsky and D. Mendlovic, Appl. Opt. 35, 3930 (1996).
  4. [4]4. M. A. Kutay, H. M. Ozaktas, O. Ar ıkan, and L. Onural, IEEE Trans. Signal Process. 45, 1129 (1997).
  5. [5]5. M. A. Kutay and H. M. Ozaktas, J. Opt. Soc. Am. A 15, 825 (1998).
  6. [6]6. H. M. Ozaktas, B. Barshan, D. Mendlovic, and L. Onural, J. Opt. Soc. Am. A 11, 547 (1994).
  7. [7]7. L. B. Almeida, IEEE Trans. Signal Process. 42, 3084 (1994).
  8. [8]8. A. W. Lohmann, J. Opt. Soc. Am. A 10, 2181 (1993).
  9. [9]9. A. Sahin, H. M. Ozaktas, and D. Mendlovic, Appl. Opt. 37, 2130 (1998).
  10. [10]10. H. M. Ozaktas, O. Arıkan, M. A. Kutay, and G. Bozdagi, IEEE Trans. Signal Process. 44, 2141 (1996).
  11. [11]11. H. M. Ozaktas and D. Mendlovic, J. Opt. Soc. Am. A 12, 743 (1995).
  12. [12]12. M. F. Erden, ''Repeated f iltering in consecutive frac- tional Fourier domains,'' Ph.D. dissertation (Bilkent University, Ankara, Turkey, 1997).
  13. [13]13. M. F. Erden and H. M. Ozaktas, J. Opt. Soc. Am. A 15, 1647 (1998).
  14. [14]14. B. Barshan, M. A. Kutay, and H. M. Ozaktas, Opt. Commun. 135, 32 (1997).

Cited by

Sorted by citations

Authors
Kutay, M. A., Erden, M. F., Ozaktas, H. M., Arıkan, O., Güleryüz, Ö., & Candan, Ç.
Affiliations
  • Bilkent University (TR)
  • Tampere University of Technology (FI)
Venue
Optics Letters
Published
1998-07-15
Volume
23
Issue
14
Pages
1069
ISSN
  • 0146-9592 (ISSN-L)
  • 1539-4794
OpenAlex
W2036745975
Cited by
22
References
13
Citations by year
2023: 1 · 2022: 1 · 2021: 2 · 2014: 1
FWCI
6.04
Type
journal article
Language
en
Open access
Locations
  • Optics Letters (publishedVersion)
  • PubMed (publishedVersion)
  • Bilkent University Institutional Repository (Bilkent University) (submittedVersion)
  • OpenMETU (Middle East Technical University) (submittedVersion, cc-by-nc-nd)
Topics
  • Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
  • Physical Sciences › Mathematics › Applied Mathematics › Mathematical Analysis and Transform Methods
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
Keywords
fractional Fourier transform, multistage filter, multichannel filters, matrix-vector multiplication, structured matrices, accuracy-efficiency trade-off

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review