Engineering Commons^™

On Computation Rates For Arithmetic Sum, Ardhendu Tripathy, Aditya Ramamoorthy

Ardhendu Tripathy

For zero-error function computation over directed acyclic networks, existing upper and lower bounds on the computation capacity are known to be loose. In this work we consider the problem of computing the arithmetic sum over a specific directed acyclic network that is not a tree. We assume the sources to be i.i.d. Bernoulli with parameter 1/2. Even in this simple setting, we demonstrate that upper bounding the computation rate is quite nontrivial. In particular, it requires us to consider variable length network codes and relate the upper bound to equivalently lower bounding the entropy of descriptions observed by the terminal …

A Long-Channel Model For The Asymmetric Double-Gate Mosfet Valid In All Regions Of Operation, Abhishek Kammula, Bradley Minch

Bradley Minch

We present a physically based, continuous analytical model for long-channel double-gate MOSFETs. The model is particularly well suited for implementation in circuit simulators due to the simple expressions for the current andthe continuous nature of the derivatives of the current which improves convergence behavior.

Derivation And Application Of A Conserved Orbital Energy For The Inverted Pendulum Bipedal Walking Model, Jerry E. Pratt, Sergey V. Drakunov

Sergey V. Drakunov