Skip to main content

AnalogCell

Enum AnalogCell 

Source
pub enum AnalogCell {
    Sum {
        inputs: Vec<ASrc>,
        weights: Vec<f64>,
    },
    Mul {
        a: ASrc,
        b: ASrc,
    },
    GainConst {
        a: ASrc,
        k: f64,
    },
    Select {
        c: ASrc,
        t: ASrc,
        f: ASrc,
    },
    Exp {
        a: ASrc,
    },
    Log {
        a: ASrc,
    },
    Tanh {
        a: ASrc,
    },
    Sqrt {
        a: ASrc,
    },
    Div {
        a: ASrc,
        b: ASrc,
    },
}
Expand description

One analog tile. Ideal (math-domain) semantics are given per variant; physical parameters (gm, C, rails) attach at the target/gain layers, not here.

Variants§

§

Sum

Kirchhoff current-summing node with programmed input-conductance weights: v = Σ wᵢ·xᵢ. Signed weights are free (differential wiring).

Fields

§inputs: Vec<ASrc>
§weights: Vec<f64>
§

Mul

Four-quadrant transconductance multiplier for variable×variable: v = a·b.

Fields

§

GainConst

Programmed-conductance constant gain: v = k·a.

Fields

§

Select

Comparator-driven analog switch: v = if c < 0 { t } else { f } (the O5 tile). The condition is a DIFFERENCE net (the lowering emits c = ca − cb as a Sum); strict vs inclusive comparison is indistinguishable on the analog plane — the boundary lives inside the comparator’s ambiguity band, which the budget prices (CompareBand).

Fields

§

Exp

Translinear exponential (subthreshold-MOS / diff-pair current law): v = eˣ. NOT scale-invariant — translinear nets run at unit block scale (volt ≡ math), enforced by the schedule (the O6 pinning rule).

Fields

§

Log

Translinear logarithm (forward-diode law): v = ln x, domain x > 0 — certified fail-closed by the range rules.

Fields

§

Tanh

Differential-pair saturation: v = tanh x.

Fields

§

Sqrt

Translinear square root (Gilbert 1975 loop): v = √x, domain x > 0 for a bounded error slope (the budget’s Lipschitz factor diverges at 0).

Fields

§

Div

Translinear ratio (Gilbert 1975): v = a / b; the divisor’s certified box must clear zero (DivisorRangeSpansZero otherwise — the starvation refusal).

Fields

Implementations§

Source§

impl AnalogCell

Source

pub fn kind(&self) -> AnalogCellKind

The tile kind this cell demands of a target.

Source

pub fn eval(&self, inputs: &[f64], vals: &[f64]) -> f64

Ideal math-domain evaluation.

Trait Implementations§

Source§

impl Clone for AnalogCell

Source§

fn clone(&self) -> AnalogCell

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for AnalogCell

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl PartialEq for AnalogCell

Source§

fn eq(&self, other: &AnalogCell) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl StructuralPartialEq for AnalogCell

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,