A Demonstration of a Wideband Low-Complexity Multibeam Analog Beamforming Network
Bibliographic record
Abstract
This work proposes using a sparse factorization of the multibeam delay Vandermonde matrix (DVM) for reducing the complexity of multibeam analog beamformers. The example of a proof-of-concept sparse-factorized DVM theoretically requires only 70 of unit true time delays (TTDs) to implement four beams with eight antennas, compared with the 252 unit TTDs required in conventional implementations. The number of TTDs was further reduced to 65 by simplifying the signal-flow graph (SFG). A proof-of-concept integrated multibeam radio-frequency (RF) beamformer is discussed. It utilizes TTDs to realize four simultaneous beams to cover a spatial area of 0° to 60°. To demonstrate the concept, a prototype of the proposed four-beam beamformer was fabricated in a 22-nm fully depleted silicon-on-insulator (FDSOI) CMOS process. This proof-of-concept prototype operates from 1.6 to 5.6 GHz, occupies a chip area of 0.37 mm2, uses 58 current-mode unit TTDs, 27 current-mode adders, and consumes 3.7 mW/channel of dc power. This simplified approach to realizing multibeam networks has the potential to enhance the implementation efficiency in analog and hybrid beamforming systems, including multi-input multi-output (MIMO) arrays, 5G and 6G arrays, and SATCOM arrays.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".