Chapter 2 Flashcards

1
Q

Layered Architecture (1)

A
  1. Makes system easier to understand.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Channel properties (4)

A
  1. Bit rate
  2. Delay
  3. Storage capacity
  4. Error rate
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Bit rate (1)

A
  1. Number of bits per second
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Delay (1)

A

How long does it take to get to the end?

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

Storage Capacity (2)

A
  1. How many bits can the channel hold at once

2. Capacity = BitRate * Delay

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

Error rate (1)

A
  1. Probability of bit flipping.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Twisted pair (2)

A
  1. Twisted because otherwise the cables would act as an antenna
  2. Bandwidth of 500 MHz
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Coax Cable (1)

A
  1. Bandwidth in order of GHz
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Optical Fiber (3)

A
  1. Uses light pulses to transmit bits.
  2. Receiver transforms light pulses in electric signals.
  3. Bandwidth in order of 100 GHz.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Radio frequencies (2)

A
  1. Can travel long distances
  2. Power of waves falls with distance from the source.
  3. f = 1 or 100 MHz based on AM or FM
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Microwave (3)

A
  1. Needs line of sight because waves travel in straight lines.
  2. Do not travel through objects.
  3. f = 10Ghz
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Baseband Transmission (4)

A
  1. Signal occupies frequencies from 0 to a max.
  2. NRZ
  3. Clock recovery problems
  4. Balanced signals.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Manchester encoding (1)

A
  1. XOR with the clock signal
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

NRZI (1)

A
  1. Codes 1 as transition and 0 as a non transition.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

4B/5B (1)

A
  1. 4 bits are mapped into 5 bits so that no more than 3 consecutive 0 can appear.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Scrambling (1)

A
  1. Data is XOR with random sequence that is then XORed back from the receiver
17
Q

Passband transmission (2)

A
  1. Signal is inside a certain frequency band which is shifted from the 0
  2. Data is sent by modulating phase frequency or amplitude.
  3. Frequency and phase are not independent so they canโ€™t be modulated together.
18
Q

Constellation diagram (3)

A
  1. Modulation of the signal is defined in amplitude and phase shift
  2. Phase shift is indicated by angle with x axis
  3. Amplitude defined by distance from origin
19
Q

Nyquistโ€™s theorem (1)

A
  1. Max data rate of a noiseless channel = 2. ๐‘…=2ร—๐ต ร— log2(๐‘‰)
20
Q

Shannonโ€™s theorem (2)

A
  1. Max data rate in noisy channel = ๐‘…= ๐ต ร— log2(1+(๐‘/๐‘†))

2. S/N = signal to noise radio, x db = 10^(x/10)

21
Q

Multiplexing (1)

A
  1. Sending multiple signals on a single medium.
22
Q

Simplex channels (1)

A

Only allow unidirectional data.

23
Q

Duplex channels (1)

A

Allow data to pass through in both directions at the same time.

24
Q

Half-duplex channels (1)

A

Allows data in both direction but not at the same time.

25
Q

Frequency division Multiplexing FDM (2)

A
  1. Divides frequency spectrum in bands, each user can access a certain band.
  2. Guard bands are assigned to keep channels separated.
26
Q

Time division multiplexing TDM (2)

A
  1. Users take turns to send data on a fixed schedule.

2. Guard time is used to protect against small time variations.

27
Q

Code division multiplexing CDM (3)

A
  1. All stations send at the same time using the same frequencies.
  2. The receiver has to figure out who and what was sent.
28
Q

CDM How ? ()

A
  1. Each station is assigned a bit sequence.
  2. When sending a 1 the station will send the sequence, when sending a 0 it will send the negation of the sequence.
  3. The sent sequences are added linearly.
  4. The receiver calculates the product between the sent sequence and the stations and then divides by n (size of the bit seqeunce)