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

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

Least-square synthesis of radar ambiguity functions

Sussman, S.·1962·IEEE Transactions on Information Theory

Abstract

The synthesis of radar ambiguity functions is approached by minimizing the integrated square error between an arbitrary desired function and a realizable ambiguity function. The approximation is carried out via an orthonormal signal basis which generates an "induced basis" over the time-frequency plane consisting of all pair-wise cross-ambiguity functions of the signal basis. The minimum mean-square error and the corresponding signal are determined through an eigenvalue problem for 1) approximation by complex autoambiguity function and 2) approximation by complex cross-ambiguity function. A new form of the realizability theorem shows that the conditions for cross-ambiguity functions differ from those for autoambiguity functions only in the absence of the symmetry condition:F(\tau, \omega) = F^{\ast}(-\tau, -\omega). Moreover, the approximations by cross- and autoambiguity functions coincide whenever the desired function has the above symmetry. When an ambiguity function realizable by a known signal is to be approximated on a finite basis, least-square approximation in signal space or in ambiguity-function space leads to equivalent results. The relation between the mean-square errors in the two spaces is obtained. For the phase incoherent radar case an iteration procedure is presented for successively modifying the arbitrary phase assigned to the desired function. Convergence is proved in the sense that the error is nonincreasing at each stage of the iteration, but arrival at the best approximation to the desired magnitude is not guaranteed. As an aid in numerical applications, a formulation based on a discrete sample grid in the time-frequency plane is derived. With the appropriate grid dimensions, the analytic procedures carry over directly into sampled-data representation.

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/tit.1962.1057703

Cites

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

Show all 2 references

Cited by

See all 195

Metadata

Authors
Sussman, S.
Venue
IEEE Transactions on Information Theory
Published
1962-04
Volume
8
Issue
3
Pages
246-254
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2101381994
Cited by
195
References
2
FWCI
9.03
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: Least-square synthesis of radar ambiguity functions. https://app.cochat.ai/papers/10.1109/tit.1962.1057703
The paper
Sussman, S. (1962). Least-square synthesis of radar ambiguity functions. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1962.1057703

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.