Extended Hammerstein Behavioral Model Using Artificial Neural Networks
Bibliographic record
Abstract
In this paper, a novel extended Hammerstein model is presented to accurately mimic the dynamic nonlinearity of wideband RF power amplifiers (RFPAs). Starting with a conventional Hammerstein model scheme, which fails to predict the behavior of the RFPA with short-term memory effects, two areas of improvements were sought and found to allow for substantial improvement. First, a polar feed-forward neural network (FFNN) was carefully chosen to construct the memoryless part of the model. The error signal between the output and the input signal of the memoryless sub-model was then filtered and then post-injected at the model output. This extra branch, when compared to the conventional Hammerstein scheme, allowed for an extra mechanism to account for the memory effects due to dispersive biasing network that was present otherwise. The excellent estimation capability of the polar FFNN together with the additional filtered error signal post-injection led to remarkable accuracy when modeling two different RFPAs both driven with four-carrier wideband code division multiple access signals. Despite its simple topology and identification procedure, the extended Hammerstein model demonstrated is capable in accurately predicting the dynamic AM/AM and AM/PM characteristics and the output signal spectrum of the RFPA under test.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".