Information and Systems Flashcards

1
Q

What defines something as analogue in nature?

A
  • The signal can take any value and there are infinite possibilities
  • The value of the signal varies with time
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What defines something as digital in nature?

A
  • Anything that deals in the realm of the discrete
  • There is a limited set of values they can take
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Define a bit

A

A binary digit

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

Define a byte

A

A sequence of 8 bits

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

Define a word

A

A sequence of N bits

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

What base is decimal?

A

Base-10

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

What base is binary?

A

Base-2

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

What base is hexadecimal?

A

Base-16

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

What does ADC stand for?

A

Analogue-to-digital converter

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

What is the role of an ADC?

A

To sample an analogue signal in order to produce a digital representation of the data in such a way that no important information is lost

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

State the Nyquist-Shannon Theorem

A

The sampling frequency must be at least two times the maximum frequency

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

In practice, what is the range of the sampling frequency?

A

Between two times and ten times the maximum frequency

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

Why is the Nyquist-Shannon Theorem used?

A
  • Most signals consist of a mix of frequencies
  • So, twice the max frequency ensures it is captured
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What happens when sampling below the Nyquist rate?

A

Signal information is lost meaning received signal will appear lower than original signal

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

Define ADC resolution

A

The smallest voltage that can be represented digitally

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

How do you calculate resolution?

A

Voltage range/N - 1

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

How finely will an 8-bit ADC digitise a signal that occupies a voltage range of 0V to 5V?

A
  • 2⁸ = 256
  • 5/256-1 = 0.02V or 20mV
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

What is combination logic?

A
  • In a circuit, output depends only on combination of its inputs
  • Output is not influenced by previous inputs
  • Circuit has no memory
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

What are the typical applications of combination logic?

A
  • Data transfer circuits: control logic flow around a system
  • Data processing circuits: process/transform data
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

How can data circuits be described?

A
  • Truth table
  • Boolean expression
  • Circuit diagram
  • Timing diagram
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

What type of Boolean expressions can’t be obtained from a truth table?

A

Expressions in minimised form

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

When can Boolean expression not be obtained from a truth table?

A

Never, they always can be obtained

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

Define Shannon’s expansion theorem

A

If there is a simplified Boolean expression, it’s fundamental form can always be found

24
Q

How does Shannon’s expansion theorem work?

A

By normalising each “AND” term with (X + X̄), where X is the missing variable

25
Q

Use Shannon’s expansion theorem to find the fundamental form of Y = A + BC

A
  • Y = A(¬B+B)(¬C+C) + BC(¬A+A)
  • Y = A¬B¬C + A¬BC + AB¬C + ABC + ¬ABC + ABC
  • Y = A¬B¬C + A¬BC + AB¬C + ABC + ¬ABC
26
Q

Why are Boolean expressions minimised?

A
  • Complex Boolean expressions lead to complex very circuits
  • So, by minimising, complexity and ultimately cost are reduced
27
Q

What are the minimisation techniques?

A
  • Boolean algebra/Inspection of truth tables
  • Karnaugh maps
  • Quine McCluskey techniques
28
Q

In a Boolean expression, what are product terms?

A

Expressions where Boolean variables are AND’d together

29
Q

In a Boolean expression, what are sum terms?

A

Expressions where Boolean variables are OR’d together

30
Q

What are octets, quads and duals?

A

Groups of 8,4 and 2 minterms in the K-map respectively

31
Q

Define minterms

A

A 1 in a single cell of a K-map which represents a fundamental product term

32
Q

Define prime implicants

A

A grouping of minterms

33
Q

Define essential prime implicants

A
  • A term which must be included in the minimised Boolean expression
  • Otherwise, all minterms won’t be captured and an incorrect expression will result
34
Q

What is a “don’t care” product term?

A
  • A term which value isn’t defined by the problem
  • Therefore, a 0 or 1 can be added to these terms to aid minimisation
35
Q

What does the number of columns in a truth table represent?

A

The sum of the number of inputs and the number of outputs

36
Q

What does the number of rows in a truth table represent?

A

The number of input combinations

37
Q

What is a fundamental product term?

A
  • A term containing all input variables which are AND’d together
  • Relates to a unique combination of input variables and therefore represents a single unique truth table row
38
Q

Determine the appropriate specification of an ADC for an analogue signal with max frequency 20kHz, min frequency 0Hz, voltage range 0V-2V and peak-to-peak noise voltage of 64µV

A
  • Resolution(ΔV) = Vrange/N-1
  • N = Vrange/Resolution(ΔV) + 1
  • N = 2V/64µV + 1 = 31251 levels
  • log₂(31251) = 14.93… = 15 bits
39
Q

State De Morgan’s Theorem

A
  • Complementing the result of OR’ing variables together is equivalent to AND’ing the complements of the individual variables
  • Complementing the result of AND’ing variables together is equivalent to OR’ing the complements of the individual variables
40
Q

Use De Morgan’s Theorem on “Y = ¬(A+B)”

A

Y = ¬A x ¬B

41
Q

What can be constructed from an AND gate and 2 inverters?

A

A NOR gate

42
Q

What can be constructed from an OR gate and 2 inverters?

A

A NAND gate

43
Q

Simplify A.A

A

A.A = A

44
Q

Simplify A + A

A

A + A = A

45
Q

Simplify A.¬A

A

A.¬A = 0

46
Q

Simplify A + ¬A

A

A + ¬A = 1

47
Q

Simplify A.0

A

A.0 = 0

48
Q

Simplify A.1

A

A.1 = A

49
Q

Simplify A + 0

A

A + 0 = A

50
Q

Simplify A + 1

A

A + 1 = 1

51
Q

True or False, Y = A + B is the same as Y = B + A?

A

True

52
Q

True or False, Y = A.B is the same as Y = B.A?

A

True

53
Q

True or False, Y = (A.B).C is not the same as Y = A.(B.C)

A

False

54
Q

True or False, Y = (A+B)+C is the same as Y = A+(B+C)

A

True

55
Q

Expand A.(B+C)

A

A.(B+C) —-> (A.B)+(A.C)

56
Q

Expand A+(B.C)

A

A+(B.C) —-> (A+B).(A+C)

57
Q

Expand (A+B).(C+D)

A
  • Let X = A+B
  • X.(C+D) = (X.C)+(X.D)
  • (A+B)C + (A+B)D
  • AC + BC + AD + BD