MétaCan
Menu
Back to cohort

Target localization for bistatic MIMO radar in unknown correlated noise

2011· article· en· W2532963432 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRadar Systems and Signal Processing
Canadian institutionsMcMaster University
FundersNational Natural Science Foundation of ChinaU.S. Department of Defense
KeywordsBistatic radarTransmitterComputer scienceMIMONoise (video)AlgorithmRadarPairingPassive radarCramér–Rao boundEstimation theoryArtificial intelligenceTelecommunicationsRadar imagingPhysics

Abstract

fetched live from OpenAlex

In this paper, target localization for bistatic MIMO radar in unknown spatially correlated noise is investigated. In our model, both the transmitter and receiver arrays are divided into two subarrays. A novel target localization algorithm is proposed by jointly estimating the directions-of-departure (DODs) and directions-of-arrival (DOAs) for transmitter and receiver subarrays in unknown noise. The algorithm exploits the canonical correlation decomposition (CCD) and the joint estimation technology based on the shift-invariance properties of different subarrays obtaining the automatic pairing. In addition, the compact formulas of stochastic Cramer-Rao bounds (CRB's) for DOD and DOA estimation are derived. The simulations show that our method effectively improves the performance of estimation by eliminating the unknown correlated noise.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.973
Threshold uncertainty score0.310

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.201
Teacher spread0.184 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations2
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicRadar Systems and Signal ProcessingFrench-language works237,207