|
3.1 Combinational Networks and Switching Algebra
3.2 Logic Circuits
3.3 Registers and Their Applications
3.4 Programmable Arrays
3.5 Arithmetic Logic Units
3.6 Programmable Logic
Logic Elements
79.1 IC Logic Family Operation and Characteristics
79.2 Logic Gates (IC)
79
|
|
|
LOGIC AND GATES
1) Binary Logic
2) Logic Gates
2. BOOLEAN ALGEBRA
1) Basic identities of Boolean Algebra
2) Algebraic Manipulation
3) Complement of a Function
3. STANDARD FORMS
4. MAP SIMPLIFICATION
1) Two-Variable Map
2) Three-Variable Map
5. MAP MANIPULATION
1) Essential Prime Implican
|
|
|
combinational logic circuit)
전가산기 (Full Adder)
디코더(Decoder)
인코더(Encoder)
조합 논리회로(combinational logic circuit)
전가산기 (Full Adder)
디코더(Decoder)
인코더(Encoder)
순서 논리회로
입력값과 회로의 현재 상태에 따라 출력값 결정
기억능력 갖
|
|
|
Switching Hub)
27. 액세스포인트(access point)
28. 원격 감시(RMON : Remote Monitoring)
29. 위상 편이 변조(PSK : Phase Shift Keying)
30. 이용성
31. 인터네트워킹(Internetworking)
32. 주파수 편이 변조(FSK : Frequency Shift Keying)
33. 주파수 홉핑(frequency hopping) 방식
34.
|
|
|
and organization in the brain, psychol. Rev. 65, 386 (1958).
[Rumelhart, Hinton, Williams, 1986] D.E. Romelhart, G.E. Hinton and R.J. Williams, Learning representations by back-propagating errors, Nature, 323, 533 (1986).
[Hopfield, 1982] J.J. Hopfield, Neural networks and physical systems with emer
|
|
 |
and protection scheme.
11. The following diagram shows the basic interlock logic sequence. Explain how the logic works and describe dependent on input signal A and B. Also, write a logic table and describe it by using a
logic gate. (R1 ~ R7 is nothing but just a path of electrical signal. For ex
|
|
메뉴펼치기
