The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Fast Karhunen-Loeve Transform for a Class of Random Processes
Abstract
The Karhunen-Loeve transform for a class of signals is proven to be a set of periodic sine functions and this Karhunen-Loeve series expansion can be obtained via an FFT algorithm. This fast algorithm obtained could be useful in data compression and other mean-square signal processing applications.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
Cited by
Image data compression: A review
Jain, A. K. (1981) · Proceedings of the IEEE · doi:10.1109/proc.1981.11971 · Cited by 709
Self-citationNetravali, A. N., & Limb, J. O. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11647 · Cited by 451
Local linear transforms for texture measurements
Unser, M. (1986) · Signal Processing · doi:10.1016/0165-1684(86)90095-2 · Cited by 256
Metadata
- Authors
- Jain, A.
- Venue
- IEEE Transactions on Communications
- Published
- 1976-09
- Volume
- 24
- Issue
- 9
- Pages
- 1023-1029
- ISSN
- 0096-2244 (ISSN-L)
- OpenAlex
- W2014512781
- Cited by
- 241
- References
- 1
- FWCI
- 10.50
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Fast Karhunen-Loeve Transform for a Class of Random Processes. https://app.cochat.ai/papers/10.1109/tcom.1976.1093409
- The paper
- Jain, A. (1976). A Fast Karhunen-Loeve Transform for a Class of Random Processes. IEEE Transactions on Communications. https://doi.org/10.1109/tcom.1976.1093409
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
