Direction finding with a four-element Adcock-Butler matrix antenna array
Bibliographic record
Abstract
The conventional analog Adcock-Butler matrix (ABM) antenna array direction finder suffers from systemic errors, component matching problems, and bandwidth limitations. Three digital bearing estimators are developed as candidates to replace the analog signal processing portion of the ABM. Using the same antenna array, they perform all signal processing in the frequency domain, thereby benefitting from the computational efficiency of the fast Fourier transform (FFT) algorithm. The first estimator requires two analog-to-digital converters (A-D) and three antenna elements. It multiplies the difference between the discrete Fourier transforms (DFTs) of the output signals from two antenna elements with that from a third antenna element. At each frequency component, the phase of this product is a function of the bearing. A weighted least squares (LS) fit through all the phase components then gives a bearing estimate. The second estimator is similar to the first but uses three A-D and all four antenna elements. The output signal from the additional antenna element provides an independent estimate of the weights for the LS fit, giving an improvement in accuracy. The third estimator applies the physical constraint existing between the time-difference-of-arrival (TDOA) of a signal intercepted by two perpendicular sets of antenna elements. This yields a better estimator than simple averaging of the bearing from each set of antenna elements. The simulation studies used sinusoids and broadband signals to corroborate the theoretical treatment and demonstrate the accuracy achievable with these estimators. All three direction finders have superior performance in comparison with the analog ABM.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".