2 ms·
> I am not sure what you mean by running in parallel. I literally mean in parallel. Computing a FSM from "backwards" and "forwards" simultaneously, as well as
by dragontamer 5y ago
> I am not sure what you mean by running in parallel.
I literally mean in parallel. Computing a FSM from "backwards" and "forwards" simultaneously, as well as "from the middle outward". From all bits, simultaneously, in parallel.
As I stated earlier: Kogge-Stone carry save adder is the first step to understanding this.
Lets take 32-bits of two numbers: A[0:31] and B[0:31]. C [0:32] = A + B.
Simple, yes? Lets focus on purely a singular bit: C[32], the so called "carry bit". It is easy to see that the carry bit (the 33rd bit of the addition operation) depends on all 32-bits of A, as well as all 32-bits of B.
Nonetheless, the carry bit can be computed in parallel with Kogge-Stone (as well as other parallel carry-lookahead adders).
I've explained this process in multiple sibling posts at this point. Please give them a look first, and ask questions after you've read them. I understand that I've written quickly, verbosely, and perhaps inaccurately, but hopefully there's enough there to get started.