多路選擇器樹形結(jié)構(gòu)邏輯網(wǎng)絡(luò)設(shè)計
DESIGN OF TREE-TYPE LOGIC NETWORKS USING MULTIPLEXERS
-
摘要: 本文首先討論了邏輯函數(shù)的分解;然后給出利用多路選擇器實現(xiàn)多變量組合函數(shù)時,獲得最小或接近最小的樹形結(jié)構(gòu)網(wǎng)絡(luò)的設(shè)計方法。該方法適用于計算機(jī)自動綜合。
-
關(guān)鍵詞:
- 邏輯設(shè)計; 多路選擇器; 最小化
Abstract: A decomposition approach of logic functiony is discussed. The design method, by which the minimization or near minimization of tree-type logic networks can be obtained, is presented when multiple variables combinational logic function is implemented by using multiplexers. Using the method, the automatic synthesis of the logic function can easily be accomplished on conputers. -
R. P. Voith, IEEE Trans. on C, 626(1977)5, 117-424.[2]C. C. Cheung, R. W. Ehrich, IEEE Trans. on C, C-24(1975)11, 1110-1113.[3]K. Y. Fang, A. S. Wojcik, IEEE Trans. on C, C-37(1988)10, 1293-1301.[4]S. C. Lee, Modern Switching Theory and Digital Design, Prentice-Hall, Inc., Englewood Cliffs,N. J, (1978).[5]R. K. Coral, A. Pal, IEE Proc. -E, 137(1990)2. 164-170.[6]S. B. Akers, IEEE Trans. on C, C-27(1978)6, 509-516. -
計量
- 文章訪問數(shù): 1982
- HTML全文瀏覽量: 96
- PDF下載量: 700
- 被引次數(shù): 0
下載:
