Follow along with the video below to see how to install our site as a web app on your home screen.
Note: This feature may not be available in some browsers.
Your superficiality is disarming.Hi guys,
I'm searching for a general mathematical definition of an FPGA.
I propose this y=F(x,u) where y is a vector of output , u is a vector
of input and x is a vector of internal state and F is a certain
function of x,u. Have you some idea to generalize more this
definition?
Thank you,
Silvio
What an incredibly daft idea!
---------------------------------------
Posted throughhttp://www.FPGARelated.com
A mathematical description of what you call "FPGA-ness" may be veryBy the time you captured all of the "FPGA-ness" you would have a
mathematical description that would be so complex it would be useless.
A mathematical model *does not* give up the complexity of theIn general the art of mathematical modeling lies not in capturing
everything there is to capture about a thing that you want to model.
Rather, it lies in capturing _just enough_ information about the thing so
that you can get a _representative_ answer for your _immediate problem_.
Capture too much information, and at best your model will be confusing,
and at worst it'll be so unwieldy that you can't do anything useful with
it.
IMHO it should not be very hard to model the logic and it has nothing toI'm interested only to the logical behavior of an FPGA; not the
complex (transitory) phenomenons between two steady states and the way
to implement the logic core and the memory ones.
Thanks,
Silvio
Hi Alessandro,On 2/20/2011 4:42 AM, silvio.baccari wrote:
By the time you captured all of the "FPGA-ness" you would have a
mathematical description that would be so complex it would be useless.
A mathematical description of what you call "FPGA-ness" may be very
useful, since it may be a very effective way to verify your logic before
any component is available.
In general the art of mathematical modeling lies not in capturing
everything there is to capture about a thing that you want to model.
Rather, it lies in capturing _just enough_ information about the thing so
that you can get a _representative_ answer for your _immediate problem_.
Capture too much information, and at best your model will be confusing,
and at worst it'll be so unwieldy that you can't do anything useful with
it.
A mathematical model *does not* give up the complexity of the
phenomenon, it rather describe the relationships between variables in
within precisely described boundary conditions and most of the time it
is harder to describe the latter rather than the phenomenon itself.
I'm interested only to the logical behavior of an FPGA; not the
complex (transitory) phenomenons between two steady states and the way
to implement the logic core and the memory ones.
IMHO it should not be very hard to model the logic and it has nothing to
do with the FPGA. I just want to draw your attention to the following
example:
A = B and C
is already a mathematical description, with a boolean operation on a set
of signals.
Unfortunately this description is limited to deterministic logic, while
it is not suitable to describe the behavior of non-deterministic, where
a state maybe defined with a probability function (time dependent).
There exists a mathematical abstraction called graph, which is often
used to represent finite state machines and I believe that is the most
appropriate object to represent logical paths.
Thanks,
Silvio
I'm talking about graphs:There exists a mathematical abstraction called graph, which is often
used to represent finite state machines and I believe that is the most
appropriate object to represent logical paths.
Hi Alessandro,
in the last period, are you talking about Petri net?