Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
OK
I'm interested in this problem in general, i.e. how I can determine how much time it is
necessary to execute algorithm on a processor? Let us assume that algorithm complexity and
processor throughput are known.
Hi,
How I can estimate algorithm run-time on some digital devices theoretically? Can I do it in the following way:
1. Algorithm complexity estimation;
2. MFLOPS;
3. Comparison of these values?
Hello,
Help me, please, to find algorithm for constructing a chordal completion of a planar graph. In paper "CHORDAL COMPLETIONS OF PLANAR GRAPHS" (authors F. R. K. CHUNG and DAVID MUMFORD) one is proved that every planar graph on n vertices has a chordal completion with cn log n edges for some...
I'm interesting in only the first level, i.e. level there is verilog module. I want to make sure that this module does right. When I chose random a range of values and correct error, one seems there are special values that finds all errors at once. For example if adder add 1 to 2 correctly then...
Hello,
How correctly to verify some simple digital circuit at a RTL level?
For example floating-point shifter, I'm really concerned about it.
There are many kinds of verification and I can't choose a right. Perhaps I need functional verification, do I?
I usually verify simple digital circuit...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
