J-K 플립플롭을 위한 순차회로의 최적 상태할당에 관한 고찰|RISS 상세보기

J-K 플립플롭을 위한 순차회로의 최적 상태할당에 관한 고찰 = A Study on the optimum state assignment of sequential circuits for J-K Flip Flop

한글로보기

https://www.riss.kr/link?id=A2041659

저자

金明中 (電子科)
발행기관
忠州大學校
학술지명
한국교통대학교 논문집(THESES COLLECTION)
권호사항

Vol.13 No.1 [1980]
발행연도
1980
작성언어
Korean
KDC
050
자료형태
학술저널
수록면

391-400(10쪽)
제공처
RISS

0
상세조회
0
다운로드
0
내보내기

부가정보

다국어 초록 (Multilingual Abstract)

The problem of encoding the internal atate of sequential circuits soas to minimize the combinational network cost is treated. Cost is defined as the number of AND-OR inputs required in the two-level implementation of each memory element input equation separately.
An algorithm has been developed that considers implicitly all aistinct state assignment schemes for a given state table, thus ensuring that the state assignment that results in the least cost combinational network is selected.
Since any optimum state assignment scheme is dependent on the type of memory element, the algorithm is designed for use with J-K fip flop.

번역하기

The problem of encoding the internal atate of sequential circuits soas to minimize the combinational network cost is treated. Cost is defined as the number of AND-OR inputs required in the two-level implementation of each memory element input equatio...

The problem of encoding the internal atate of sequential circuits soas to minimize the combinational network cost is treated. Cost is defined as the number of AND-OR inputs required in the two-level implementation of each memory element input equation separately.
An algorithm has been developed that considers implicitly all aistinct state assignment schemes for a given state table, thus ensuring that the state assignment that results in the least cost combinational network is selected.
Since any optimum state assignment scheme is dependent on the type of memory element, the algorithm is designed for use with J-K fip flop.