paper-with-me

Papers

Updatable Closed-Form Evaluation of Arbitrarily Complex Multi-Port Network Connections

2024-12-23 · Hugo Prod'homme, Philipp del Hougne

The design of large complex wave systems (filters, networks, vacuum-electronic devices, metamaterials, smart radio environments, etc.) requires repeated evaluations of the scattering parameters resulting from complex connections between constituent subsystems. Instead of starting each new evaluation from scratch, we propose a computationally efficient method that updates the outcomes of previous evaluations using the Woodbury matrix identity. To enable this method, we begin by identifying a closed-form approach capable of evaluating arbitrarily complex connection schemes of multi-port networks. We pedagogically present unified equivalence principles for interpretations of system connections, as well as techniques to reduce the computational burden of the closed-form approach using these equivalence principles. Along the way, we also achieve the closed-form retrieval of the power waves traveling through connected ports. We illustrate our techniques considering a complex meta-network involving serial, parallel and cyclic connections between multi-port subsystems. We further validate all results with physics-compliant calculations considering graph-based subsystems, and we conduct exhaustive statistical analyses of computational benefits originating from the reducibility and updatability enabled by our approach. Finally, we find that working with scattering parameters (as opposed to impedance or admittance parameters) presents a fundamental advantage regarding an important class of connection schemes whose closed-form analysis requires the treatment of some connections as delayless, lossless, reflectionless and reciprocal two-port scattering systems. We expect our results to benefit the design (and characterization) of large composite (reconfigurable) wave systems.

📄 PDF Abstract BibTeX arXiv:2412.17884

Code (0)

등록된 구현이 없습니다.

Tasks

Form

Similar Papers 제목 키워드 기반

Bye Bye Perspective API: Lessons for Measurement Infrastructure in NLP, CSS and LLM Evaluation

2026-04-28 · David Hartmann, Manuel Tonneau, Angelie Kraft, LK Seiling 외 arxiv

The closure of Perspective API at the end of 2026 discards what has functioned as the de facto standard for automated toxicity measurement in NLP, CSS, and LLM evaluation research. We document the structural dependence t…

Algorithms for Closed Under Rational Behavior (CURB) Sets

2014-01-16 · Michael Benisch, George B. Davis, Tuomas Sandholm

We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-player, normal-form games can be computed i…

MEMORYLLM: Towards Self-Updatable Large Language Models

2024-02-07 · Yu Wang, Yifan Gao, Xiusi Chen, Haoming Jiang 외

Existing Large Language Models (LLMs) usually remain static after deployment, which might make it hard to inject new knowledge into the model. We aim to build models containing a considerable portion of self-updatable pa…

Model Editing

About a structure of easily updatable full-text indexes

2020-07-18 · Alexander B. Veretennikov

We consider strategies to organize easily updatable associative arrays in external memory. These arrays are used for full-text search. We study indexes with different keys: single word form, two word forms, and sequences…

Study of the Proper NNUE Dataset

2024-12-23 · Daniel Tan, Neftali Watkinson Medina

NNUE (Efficiently Updatable Neural Networks) has revolutionized chess engine development, with nearly all top engines adopting NNUE models to maintain competitive performance. A key challenge in NNUE training is the crea…