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

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

Designing Unimodular Codes Via Quadratic Optimization

Open access
Soltanalian, Mojtaba, Stoica, Petre·2014·IEEE Transactions on Signal Processing

Abstract

The NP-hard problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well as other active sensing and communication applications. To tackle this problem (which we call unimodular quadratic program (UQP)), several computational approaches are devised and studied. Power method-like iterations are introduced for local optimization of UQP. Furthermore, a monotonically error-bound improving technique (MERIT) is proposed to obtain the global optimum or a local optimum of UQP with good sub-optimality guarantees. The provided sub-optimality guarantees are case-dependent and may outperform the π/4 approximation guarantee of semi-definite relaxation. Several numerical examples are presented to illustrate the performance of the proposed method. The examples show that for several cases, including rank-deficient matrices, the proposed methods can solve UQPs efficiently in the sense of sub-optimality guarantee and computational time.

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/tsp.2013.2296883

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

Cited by

See all 222

Metadata

Authors
Soltanalian, M., & Stoica, P.
Venue
IEEE Transactions on Signal Processing
Published
2014-03
Volume
62
Issue
5
Pages
1221-1234
ISSN
  • 1053-587X (ISSN-L)
  • 1941-0476
OpenAlex
W1967790992
Cited by
222
References
1
FWCI
20.37
Type
journal article
Language
en
Open access
green

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: Designing Unimodular Codes Via Quadratic Optimization. https://app.cochat.ai/papers/10.1109/tsp.2013.2296883
The paper
Soltanalian, M., & Stoica, P. (2014). Designing Unimodular Codes Via Quadratic Optimization. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2013.2296883

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.