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

Cost-efficient approximation of linear systems with repeated and multi-channel filtering configurations

Open access
Kutay, M.A., Erden, M.F., Ozaktas, H.M., Arikan, O., Candan, C., Guleryuz, O.·2002·Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181)

Abstract

It is possible to obtain either exact realizations or useful approximations of linear systems or matrix-vector products arising in many different applications, by synthesizing them in the form of repeated or multi-channel filtering operations in fractional Fourier domains, resulting in much more efficient implementations with acceptable reduction in accuracy. By varying the number and configuration of the filter blocks, which may take the form of arbitrary flow graphs, it is possible to trade off between accuracy and efficiency in the desired manner. The proposed scheme constitutes a systematic way of exploiting the information inherent in 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.1109/icassp.1998.679603

Cites

14 of 14 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

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

Cited by

Sorted by citations

Authors
Kutay, M. A., Erden, M. F., Ozaktas, H. M., Arikan, O., Candan, C., & Guleryuz, O.
Affiliations
Bilkent University (TR)
Venue
Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181)
Publisher
IEEE
Published
2002-11-27
Volume
6
Pages
3433-3436
ISSN
1520-6149 (ISSN-L)
OpenAlex
W2130927911
Cited by
8
References
14
FWCI
0.63
Type
conference paper
Language
en
Open access
Locations
  • IEEE International Conference on Acoustics Speech and Signal Processing (publishedVersion)
  • Bilkent University Institutional Repository (Bilkent University) (submittedVersion)
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
linear system approximation, fractional Fourier transform, multichannel filtering, matrix-vector multiplication, flow graphs, accuracy-efficiency trade-off, structured matrices

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