求符號(hào)網(wǎng)絡(luò)函數(shù)的變形雙圖分解分析法
MODIFIED DOUBLE-GRAPH DECOMPOSITION ANALYSIS FOR FINDING SYMBOLIC NETWORK FUNCTIONS
-
摘要: 引入了互補(bǔ)余因式對(duì)、正規(guī)雙圖和可行撕裂點(diǎn)集的概念。應(yīng)用它們導(dǎo)出了一階余因式C(Y)的分解定理。把它與變形雙圖法相結(jié)合,提出了求符號(hào)網(wǎng)絡(luò)函數(shù)的一個(gè)新的分解分析法變形雙圖分解分析法。它的優(yōu)點(diǎn)是所得符號(hào)網(wǎng)絡(luò)函數(shù)表達(dá)式緊湊而且不含對(duì)消項(xiàng),并且它的符號(hào)計(jì)算很簡(jiǎn)單。
-
關(guān)鍵詞:
- 變形雙圖; 分解分析法; 符號(hào)網(wǎng)絡(luò)函數(shù)
Abstract: The concepts of complementary cofactor pairs, normal double-graphs and feasible torn vertex sets are introduced. By using them a decomposition theorem for first-order cofactor C(Y) is derived. Combining it with the modified double-graph method, a new decomposition analysis-modified double-graph decomposition analysis is presented for finding symbolic network functions. Its advantages are that the resultant symbolic expressions are compact and contain no cancellation terms, and its sign evaluation is very... -
黃汝激.電子科學(xué)學(xué)刊,1987, 9(3): 244-255.[2]黃汝激.中國(guó)科學(xué),A輯,1999, (4): 441-448.[3]Chen W K. IEEE Trans. on CT, 1969, CT-16(11): 518-526.[4]黃汝激.中國(guó)科學(xué),A輯,1988, (7): 759-767.[5]黃汝激.電子科學(xué)學(xué)刊,1989, 11(3): 267-274.[6]黃汝激.電子科學(xué)學(xué)刊,1991, 13(3): 242-249.[7]Starzyk J A, et al. IEEE Trans. on CAS, 1986, CAS-33(3): 302-315.[8]黃汝激.電子科學(xué)學(xué)刊,1993, 15(4): 404-409.[9]黃汝激.電子學(xué)報(bào),1987, 15(3): 60-69.[10]黃汝激.電子學(xué)報(bào),1987, 15(1): 1-9.[11]黃汝激.電子科學(xué)學(xué)刊,1985, 7(4): 254-266. -
計(jì)量
- 文章訪問(wèn)數(shù): 2155
- HTML全文瀏覽量: 117
- PDF下載量: 400
- 被引次數(shù): 0
下載:
