Computer Composition Test Center essay 1

1. Number conversion, complement anti-code
Conversion of the numbering:
Binary--Decimal (add by right expansion)
Decimal---binary (with the exception of the second and last obtained as the most significant bit)
Decimal decimal number, binary decimal, rounding by two
Hex <-> binary (one hex for four-bit binary)
Notation number notation:
Original code: Highest bit represents sign bit, 0 is positive, 1 is negative
Inverse code: Positive number of the inverse code is not changed, negative number of the anti-code is the symbol bit unchanged, the remaining bits are all reversed.
Complement: The complement of positive numbers is the same; the complement of negative numbers is its inverse code plus a

2. Computer composition, architecture
Computer Five parts: memory, arithmetic, controller, input device, output device
Harvard structure: Instruction and data are stored separately
Von Neumann structure: instruction and Data merge storage

3. History of development (first computer, time)
eniac;1946.2.15, University of Pennsylvania, USA

4. Moore's Law
Every 18 months, the performance of integrated circuits will be increased by one-fold, and the price will be reduced by half

5. Minimum item
N variables have a minimum of 2n items. For example: N=3, for A, B, C, there are 8 minimum items

6. Implementation principle (sum of minimum items)
A logical function can be expressed as a form of the sum of the smallest items (with or as an expression) or the product of the largest item.
Formula (or with an expression)
"Any logical function can be written as a sum of several minimum items." 】

7. Prom implementation Steps (Karnaugh map, expression, figure) of the half-add device
Prom:programmableread-onlymemory (Programmable read-only memory)

8. Application of CPLD and FPGA basic unit programmable principle programming method

 	CPLD	FPGA
basic unit	macro cell	le
programmable principle	Product item	lookup table
programmatic	e2prom	sram
apply	combination circuit	sequential circuit

9. Two or three examples of register addressing methods

Immediate addressing: The operand is stored directly in the instruction.

Register addressing: The operand is stored in the register.

Direct addressing: The operand is stored in memory and the instruction gives the memory address.

Register Direct addressing: The operand is stored in memory and the register stores the memory address.

. Verilog judgment parity

Modulo 2 op a%2

One by one. Moore state Machine Miller State machine finite state machine

The output of the Moore state machine depends only on the current state, regardless of the input conditions.

The output of the Miller state machine depends not only on the current state, but also on the input conditions of that state.

Computer Composition Test Center essay 1