Digital concepts Flashcards

(33 cards)

1
Q

Give one important characteristic of analogue quantities

A

They can vary over a continuous range of values

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Describe Binary digits

A
  • The two digits of the binary system are 1 and 0, these are called bits
  • Two different voltage levels are used to represent the two

HIGH = 1 LOW = 0

  • Combinations of bits are called codes and are used to represent; numbers, letters, symbols, instructions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are logic levels

A
  • the voltages used to represent 1 and 0

- in practice 1 is any voltage between a specified minimum and maximum value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the rise time and what is the fall time

A

rise time: time required for a digital pulse to go from LOW to HIGH

fall time: time required for a digital pulse to go from HIGH to LOW

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Equation for duty cycle (%)

A

Duty cycle = tw/T x 100

T = time period
tw = time of HIGH pulse
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

In Boolean algebra which gate is used as a logic addition

A

OR gate

y = A + B

(1+1 = 1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

In Boolean algebra which gate is used as a logic multiplication

A

AND gate

y= A.B

(1 x 0 = 0) (1 x 1 = 0) (0 x 0 = 0)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

In Boolean algebra which gate is used as a logic inversion i.e. 1 -> 0 and 0 -> 1

A

NOT gate

y = A(bar)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is commutative law of in Boolean Algebra

A

A + B = B + A
and
A.B = B.A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is associative law of in Boolean Algebra

A

A + (B + C) = (A + B) + C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is distributive law of in Boolean Algebra

A

A.(B + C) = A.B + A.C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What are DeMorgan’s theorems

A

First:
(A.B)(all bar) = A(bar) + B(bar)

Second:
(A+B)(all bar) = A(bar).B(bar)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the NAND gate

A

y = A.B(all bar)

multiply then inverse

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the NOR gate

A

y = A + B (all bar)

add then inverse

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the XOR gate

A

y = A (+) B

Use to find if there is a difference between A and B i.e. 1 if difference, 0 if same

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the XNOR gate

A

inverse of XOR gate

Therefore output 1 means A and B are same and 0 means different

17
Q

Which two forms can any Boolean expression be converted into

A
  • Sum of products (SOP)
  • Product of sums (POS)

For both SOP and POS a single over-bar cannot extend for more then one variable

18
Q

How to determine standard SOP expressions from a truth table

A
  • only consider inputs which combine to get an output of 1
19
Q

How to determine standard POS expressions from a truth table

A
  • only consider inputs which combine to get an output of 0
20
Q

What does a comparator do

A

Performs the magnitude comparison function and compares the magnitudes of two binary numbers

21
Q

What does an adder do

A

Adds two binary inputs to make one output

22
Q

What does an counter do

A

The counting function counts events represented by changing levels

i.e. if 8 bit counter, can count up to 2^8 = 256, then resets

23
Q

What does an encoder do

A

It converts information, such as a decimal number, into a coded form

24
Q

What does a decoder do

A

It converts coded information, such as a binary number, into a non coded form, such as a decimal form

25
Describe the Binary coded decimal (BCD)
A method of expressing decimal numbers decimal digits are represented by a binary code of 4 bits Decimal BCD 0 0000 1 0001 2 0010 3 0011 8 1000 9 1001
26
Describe American standard code for information interchange (ASCII)
It is a 7-bit code, in which the decimal digits are represented by the BCD code preceded by 011 e.g. 8 -> 0111000
27
Describe Gray code
Important feature of Gray code is that it only exhibits a single bit change from one number to the next 3-bit binary 3-bit Gray 000 000 001 001 010 011 011 010 100 110 101 111
28
Describe parity method of error detection
- a parity bit is attached to a group of bits to make the number of 1s, including the parity bit, always even or always odd. i.e. even parity: 8 --> 1 1000 odd parity: 8 --> 0 1000 A parity bit can only detect a one bit error
29
Equation for resolution of a DAC (Digital-to-analogue conversion)
Res = (Vmax - Vmin) / 2^n - 1 n - number of bits
30
Equation for accuracy of an n-bit DAC
+- 1/2 LSB LSB = 1/2^n
31
Equation for resolution of a ADC (analogue-to-Digital conversion)
Res = (Vmax - Vmin) / 2^n n - number of bits
32
Definition of Aliasing
when the sampling frequency fs < 2f the output from the ADC gives a false low-frequency waveform called an alias
33
What is a good sampling rate
fs = 10f