Design and performance of an efficient rectenna incorporating a fractal structure
Bibliographic record
Abstract
SUMMARY We present an efficient rectenna capable of harvesting ambient radio frequency energy to obtain utilizable direct current power at a frequency of 2.45 GHz. The rectifying antenna incorporates a fractal structure at its antenna section. The unique space‐filling property of fractals is implemented to develop an antenna with a significant size reduction. A Sierpinski carpet, which is a simple and effective fractal design, is edge‐fed and iterated up to the 3rd order. The received signal from the 2nd‐order fractal iterated patch antenna is rectified using a rectifier circuit that uses an HSMS 8202 (Avago Technologies, California, USA) diode. The realized rectenna has the capacity to exhibit a maximum efficiency of 57% at an input power level of 20 dBm. Simulations for the fractal iterated patch antennas and rectifier circuit are performed in Ansoft HFSS, Ver. 10 (Ansys, Canonsburg, USA) and ADS (Agilent Technologies, Mississauga, Canada), respectively. The simulated antenna and rectenna are experimentally tested to verify the simulation results. The simulation and experimental results for the antenna and rectenna design are found to be in good agreement with each other. Copyright © 2013 John Wiley & Sons, Ltd.
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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".