메뉴 건너뛰기




Volumn C-22, Issue 9, 1973, Pages 845-848

On Control Memory Minimization in Microprogrammed Digital Computers

Author keywords

Control memory; irredundant solution; maximum compatibility; microprogramming; minimal solution; minimization

Indexed keywords

DATA STORAGE, DIGITAL;

EID: 0015662064     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1973.5009176     Document Type: Article
Times cited : (37)

References (10)
  • 2
    • 33748203881 scopus 로고
    • On the minimization of READ-ONLY memories in microprogrammed digital computers
    • (Short Notes), Nov.
    • A. Grasselli and U. Montanari “On the minimization of READ-ONLY memories in microprogrammed digital computers,” IEEE Trans. Comput. (Short Notes), vol. C-19, pp. 1111–1114, Nov. 1970.
    • (1970) IEEE Trans. Comput. , vol.C-19 , pp. 1111-1114
    • Grasselli, A.1    Montanari, U.2
  • 5
    • 84934893751 scopus 로고
    • A method of determination of all the minimal forms of Boolean functions
    • Mono. 487E, Dec.
    • A. Mukhopadhyay, “A method of determination of all the minimal forms of Boolean functions,” Proc. Inst. Elec. Eng., Mono. 487E, Dec. 1961.
    • (1961) Proc. Inst. Elec. Eng.
    • Mukhopadhyay, A.1
  • 6
    • 0004802505 scopus 로고
    • Minimizing the number of states in incompletely specified sequential switching functions
    • Sept.
    • M. C. Paull and S. H. Unger “Minimizing the number of states in incompletely specified sequential switching functions,” IRE Trans. Electron. Comput., vol. EC-8, pp. 356–367, Sept. 1959.
    • (1959) IRE Trans. Electron. Comput. , vol.EC-8 , pp. 356-367
    • Paull, M.C.1    Unger, S.H.2
  • 7
    • 0001442299 scopus 로고
    • A method for minimizing the number of internal states in incompletely specified sequential networks
    • June
    • A. Grasselli and F. Luccio “A method for minimizing the number of internal states in incompletely specified sequential networks,” IEEE Trans. Electron. Comput., vol. EC-14, pp. 350–359, June 1965.
    • (1965) IEEE Trans. Electron. Comput. , vol.EC-14 , pp. 350-359
    • Grasselli, A.1    Luccio, F.2
  • 8
    • 84912286692 scopus 로고
    • On finding maximum compatibles
    • (Lett.), Apr.
    • S. R. Das and C. L. Sheng “On finding maximum compatibles,” Proc. IEEE (Lett.) vol. 57, pp. 694–695, Apr. 1969.
    • (1969) Proc. IEEE , vol.57 , pp. 694-695
    • Das, S.R.1    Sheng, C.L.2
  • 9
    • 0015022686 scopus 로고
    • An approach for simplifying switching functions by utilizing the cover table representation
    • (Short Notes), Mar.
    • S. R. Das “An approach for simplifying switching functions by utilizing the cover table representation,” IEEE Trans. Comput. (Short Notes), vol. C-20, pp. 355–359, Mar. 1971.
    • (1971) IEEE Trans. Comput. , vol.C-20 , pp. 355-359
    • Das, S.R.1
  • 10
    • 0015431347 scopus 로고
    • Clause-column table approach for generating all the prime implicants of switching functions
    • Nov.
    • S. R. Das and N. S. Khabra “Clause-column table approach for generating all the prime implicants of switching functions,” IEEE Trans. Comput., vol. C-21, pp. 1239–1246, Nov. 1972.
    • (1972) IEEE Trans. Comput. , vol.C-21 , pp. 1239-1246
    • Das, S.R.1    Khabra, N.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.