arXiv (All)
open access
Upper Bounds on Efficiency of Pixel Antennas
This letter presents a method to compute fundamental bounds on the total efficiency of pixel antennas. Using semidefinite relaxation, we obtain an upper bound on the optimization problem of maximizing the antenna's total efficiency subject to binary-valued pixel states. The bounds are demonstrated f
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Reflection of optimal supports for k-wise independent bits#1061233
- Message-Passing Algorithm for Sum-Rate Maximization in Multi-Antenna Underlay D2d Communications#212621
- Capacity of Multi‐antenna Gaussian Channels#7077
- Upper and lower bounds on the OBDD-width of a special integer multiplication#818720
- Upper and lower bounds on the OBDD-width of a special integer multiplication#808728
Record · ID 1156042
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive