Continue to Site

Welcome to EDAboard.com

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.

Circuit iterative partitioning algorithm

Status
Not open for further replies.

lh-

Member level 1
Joined
Oct 5, 2016
Messages
37
Helped
0
Reputation
0
Reaction score
0
Trophy points
6
Activity points
277
i have an example of iterative partitioning of the circuit.

this is the formula for calculating values for iterative partitioning:
Code:
Dij = Di + Dj - 2rij -> max; Dij > 0

Di(j) = Di(j)[external] - Di(j)[internal]

then given this graph:
Capture.PNG
these two calculations are done:
Code:
D12 = (2 - 1) + (3 - 1) - 2 * 2 = -1
D14 = (2 - 1) + (1 - 1) - 2 * 0 = 1
Dijmax = D14 = 1 >  0

i don't understand a thing since no explanation is given. can someone please explain?

thanks in advance.
 

okay, i got how this is done.

but what are the k-l, f-m and g-b methods?
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top