MétaCan
Menu
Back to cohort
Record W2148453647 · doi:10.1109/tsp.2005.845466

Theory and design of multirate sensor arrays

2005· article· en· W2148453647 on OpenAlexaff
Omid S. Jahromi, Parham Aarabi

Bibliographic record

VenueIEEE Transactions on Signal Processing · 2005
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMultilaterationWireless sensor networkComputer scienceFilter bankSensor arraySensor fusionChannel (broadcasting)Real-time computingAlgorithmNode (physics)EngineeringTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

This paper studies the basic design challenges associated with multirate sensor arrays. A multirate sensor array is a sensor array in which each sensor node communicates a low-resolution measurement to a central processing unit. The objective is to design the individual sensor nodes and the central processing unit such that, at the end, a unified high-resolution measurement is reconstructed. A multirate sensor array can be modeled as an analysis filterbank in discrete-time. Using this model, the design problem is reduced to solving the following two problems: a) how to design the sensor nodes such that the time-delay of arrival (TDOA) between the sensors can be estimated and b) how to design a synthesis filterbank to fuse the low-rate data sent by the sensor nodes given the TDOA? In this paper, we consider a basic two-channel sensor array. We show that it is possible to estimate the TDOA between the sensors if the analysis filters incorporated in the array satisfy specific phase-response requirements. We then provide practical sample designs that satisfy these requirements. We prove, however, that a fixed synthesis filterbank cannot reconstruct the desired high-resolution measurement for all TDOA values. As a result, we suggest a fusion system that uses different sets of synthesis filters for even and odd TDOAs. Finally, we use the H/sub /spl infin// optimality theory to design optimal synthesis filters.

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.

How this classification was reachedexpand

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.805
Threshold uncertainty score0.535

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
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.026
GPT teacher head0.255
Teacher spread0.229 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations24
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Signal ProcessingSame topicTarget Tracking and Data Fusion in Sensor NetworksFrench-language works237,207