Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUST940013 I4
Publication typeGrant
Publication dateNov 4, 1975
Filing dateSep 17, 1974
Priority dateSep 17, 1974
Publication numberUS T940013 I4, US T940013I4, US-I4-T940013, UST940013 I4, UST940013I4
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Network design process using multiple performance functions
US T940013 I4
Abstract  available in
Images(10)
Previous page
Next page
Claims  available in
Description  (OCR text may contain errors)

W? K OFFICE n1 Notice 0r Dec. 11;, 1930 nbered scrlcsaml are m eluding elnlms and sheets 0; drawings (in are man-Able i0 the public for inspection and 1:

Published at the roquert of the applicant or own abstracts of Defens Minn 1111; :qtlons are Mont The heaiiing: of each absiuict incllcltcs the 111 in the an cation as originally filed. The 11in may be .ased for 30 cents a shoot.

hove not men ex:

merits of alleged invention. The Patent and to the novelty 0;. the L: 1.

made

rsrzrwcnrr DESEGN l nto a computer sysfor the proc- COllSlSYlZZg of a symbolic represennsiworl; structure plus a plurality functions, together with the net- 5 which are defined as design ormalion is paced in a data lurality of arrays, d by the process to operate on odncccl by the usor. The procy stair: or transient analysis of network provides as output a list pararnstsrs whic 1 optimize the s of a1: eioclri nppplimiiion E33. (Ii. G'Mi 15/96, 15/56 U i l.

of node equations, performance E'TUEiiOZE for either ths steady es. Then, the adjoint equation wed by utilizing a We 0 each of tho performances. Both of squaiions are solved in an iterative loop to gensrzxto a ssnsitivity vector which is ussd to converge on an GEHEWE o iiz'nizcd solution of the multiyie performances given by usrr.

NEWTON RslLFHSW ncomnm Nov. 4, 1975 C. W. HO

NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS Original Filed Sept. 17, 1974 FIG.1

ENTER USER INPUTS I0 I SET UP TABLES FROM INPUT DATA GENERATE INDICES AND CODES FOR CIRCUIT EQUATIONS Sheet 1 of 10 DETERMINE PIVOTING SEQUENCE XII;

y 24 NO IS D.C. ANALYSIS REQUESTED "-18 SETI=Lf EQUATIONS,PARAMETER EQUATIONS.

GENERATE NODE EQUATIONS,PERFORMANCE FUNCTION 22 SOLVING EQUATIONS BY USING GAUSSIAN ELIMINATION IS THERE CONVERGENCE NEWTON RALPHSON ALGORITHM 36 YES YES IMPLICIT INTEGRATION ALGORITHM YES 48 ARE DESIGN CONSTRAINTS SATISFIED? "mmt DETERMINE THE WEIGHTING VECTOR Z END SOLVE THE ADJOINT EQUATION UPDATING DESIGN ALGORITHM FOR PARAMETERS THE NOV. 4, 1975 c. W. HO T940,013

NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS Original Filed Sept. 17, 1974 Sheet 2 of 10 FIG. 2

EXEC1 i FIG. 3A

DISSCV COMBINE ELE1 EXEC ELE2 HELER MATBH FUNS PARS PARL FLOC FLOC EXEC2 Fl G. 38

INTGRT PMAT EVAL CAUSS SENSITY FLETCHER I l l INTGRT LU EVAL GAUSS F1 F2 F3 1 I F1 F2 F3 NOV. 4, 1975 c. w. HO T940,013

NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS Original Filed Sept. 17, 1974 Sheet 3 of 10 K? O FIG. 4 -0 FUNS J=RUNNING COUNTER FOR NAM1 IS K NF NO YES END x os zI 108 X-NODES [INDU] J16 /114 PARL 2 PARL 1 x-(xo)/x FIG.6

FLOC

TEMP (PX) xpY 256 X+TEMP NOV. 4, 1975 c. w. HO T940,013

NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS Original Filed Sept. 17, 1974 Sheet 4 of 10 0055 M=2? R/ZO? FIG. 5 N0 k PARI- M FLOC 2o4 i V OUT-0UT,X 206 L002 *LOC2,Y

1&0 ,210

/214 |SI FUN [m]? NO YES Y--NEQ[P[11] \216 END 21s ISM=2? NO YES /22o FLOC 0UT*0UT,X LOCP'LOCKY OUTHFQ-COUTHJ /222 LOCH LOCH,Y v

Nov. 4, 1975 C. W. HO

NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS Original Filed Sept. 17, 1974 Sheet 5 of 10 PARS 300 F I G. 7

END

RDV J; 2] ,0x

308 FLOC 510 RDEGN [J -,51*x

LOCD-LOCD,Y

s12 J J 1 314 IS J NDR Nov. 4, 1975 On'ginal Filed Sept.

C. W. HO

NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS FIG. 8

PMAT

Sheet 6 of 10 FIG.9

MATBH LOCBT [2;] RILOCBT [2;]

LOCBT- LOCBT CPH] LOCVD- LZ LOCDV LOCB -L LOCB LOCH Z LOCH Nov. 4, 1975 C. W. HO

NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS Original Filed Sept.

*i INTGRT I MAT*LL0C, 0

MAT[LOCC] -CON PMAT IS 0.00015F/|XX-XX1 NO ms IStZtf? IS KzNP? .E J-0 YES FLETCHER STOP Sheet 7 of 10 Fl G. 10

EXEC 2 NOV. 4, 1975 0. W. HO

T940,013 NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS Original Filed Sept. 17, 1974 Sheet 9 of 10 SENSITY /soo FIG. 12A FIG. 12

no. ,5o2 12A ARE STATES GIVEN BY USER? NO YES FIG. 12B z-2 0 /506 IS THE Ith. PERFORMANCE 0? NO YES 514 I 7 z z,0 Z Z, 1

' 504 Z-STATE[ -,K

IS I NQ /516 YES N0 C. W. HO

NETWORK DESIGN PROCESS USING MULTIPLE PERFORMANCE FUNCTIONS Original Filed Sept. 17, 1974 Sheet 10 of 10 LOCH EVAL OUTH FIG. 12B

IS MODE=0 INTGRT 540 GAUSS SfS to? /544 YES YES

END

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US5047971 *Aug 15, 1989Sep 10, 1991Intergraph CorporationCircuit simulation
US5081590 *May 10, 1990Jan 14, 1992Westinghouse Electric Corp.Computer aided technique for post production tuning of microwave modules
US5111413 *Mar 24, 1989May 5, 1992Vantage Analysis Systems, Inc.Computer-aided engineering
US5257201 *Aug 14, 1989Oct 26, 1993International Business Machines CorporationMethod to efficiently reduce the number of connections in a circuit
US5400270 *Aug 24, 1992Mar 21, 1995Mitsubishi Denki Kabushiki KaishaSimulator for conducting timing analysis of a circuit
US5402358 *Oct 29, 1993Mar 28, 1995Vlsi Technology, Inc.Method and structure for the automated design of analog integrated circuits
Classifications
U.S. Classification716/106, 716/132
International ClassificationG06F17/50
Cooperative ClassificationG06F17/5036
European ClassificationG06F17/50C4