Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 526

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

An analytical constant modulus algorithm

Open access
van der Veen, A.-J., Paulraj, A.·1996·IEEE Transactions on Signal Processing

Abstract

Iterative constant modulus algorithms such as Godard (1980) and CMA have been used to blindly separate a superposition of cochannel constant modulus (CM) signals impinging on an antenna array. These algorithms have certain deficiencies in the context of convergence to local minima and the retrieval of all individual CM signals that are present in the channel. We show that the underlying constant modulus factorization problem is, in fact, a generalized eigenvalue problem, and may be solved via a simultaneous diagonalization of a set of matrices. With this new analytical approach, it is possible to detect the number of CM signals present in the channel, and to retrieve all of them exactly, rejecting other, non-CM signals. Only a modest amount of samples is required. The algorithm is robust in the presence of noise and is tested on measured data collected from an experimental set-up.

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.

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

Integrity signals

Registry

Crossref · 10.1109/78.502327

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

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.

Citations

Cites

Cited by

See all 526

Metadata

Authors
van der Veen, A.-J., & Paulraj, A.
Venue
IEEE Transactions on Signal Processing
Published
1996-05
Volume
44
Issue
5
Pages
1136-1155
ISSN
1053-587X (ISSN-L)
OpenAlex
W2105186495
Cited by
526
References
1
FWCI
27.16
Type
journal article
Language
en
Open access
bronze

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: An analytical constant modulus algorithm. https://app.cochat.ai/papers/10.1109/78.502327
The paper
van der Veen, A.-J., & Paulraj, A. (1996). An analytical constant modulus algorithm. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.502327

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.