Automated time domain modeling of linear and nonlinear microwave circuits using recurrent neural networks
Bibliographic record
Abstract
In this article, a recurrent neural network (RNN) method is employed for dynamic time-domain modeling of both linear and nonlinear microwave circuits. An automated RNN modeling technique is proposed to efficiently determine the training waveform distribution and internal RNN structure during the offline training process. This technique extends a recent automatic model generation (AMG) algorithm from frequency-domain model generation to dynamic time-domain model generation. Two types of applications of the algorithm are presented, transient electromagnetic (EM) behavior modeling of microwave structures, and time-domain envelope modeling of power amplifiers (PA). For transient EM modeling, we consider EM structures with varying material and geometrical parameters. AMG automatically varies the EM structural parameters during training and drives time-domain EM simulators to generate necessary amount of data for RNN to learn. AMG aims to model the transient behavior with minimum RNN order while satisfying accuracy requirements. In modeling PA behavior, an envelope formulation is used to specifically learn the AM/AM and AM/PM distortions due to third-generation (3G) digital modulation input. The RNN PA model is able to model these time domain distortions after training and can accurately model the amplifier behavior in both time (AM/AM, AM/PM) and frequency (spectral re-growth). © 2008 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2008.
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.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".