370 Final Flashcards
A codeword is a….
A codeword is a unique sequence of bits that satisfies certain criteria
Error control codes are….
A set of codewords used by an encoder and decoder pair to detect and possibly correct errors
What does the encoder do?
The encoder adds redundant bits to the sender’s bitstream to create the codewords
What does the decoder do?
The decoder uses the redundant bits to detect and/or correct as many bit errors as the particularly used error-control code will allow
What error does single parity bit check?
The parity check detects odd number of errors only, won’t detect even number of errors
What are some examples of errors?
Noise, fading, EM interference, ISI
The redundancy bits are computed using..?
The redundancy bits are computed according to some criteria (usually, a mathematical algorithm)
The parity bit is computed for the transmitted data block at….?
The transmitter side
The parity bit is checked for the transmitted data block at….?
The receiver’s side
The checksum is an error detection technique that ensures that the sum of packet words is….?
always zero
In checksum the receiver accepts the data only if the sum of the checksum and the packet bits is zero, if not it means something was wrong with the packet. True or false?
False, something could also be wrong in the checksum
What does CRC stand for? What does it do?
it is an error detection technique that is based on binary division to ensure that the total packet is divisible by a known divisor
What does FCS stand for?
frame check sequence
In CRC, what does Tx need to find?
FCS (F), such that : [𝐷, 𝐹 ] divisible by 𝐺, where D is the data bits, and G is the generator
The FCS field contains…?
The FCS field contains a checksum value, which is used by the receiving side to prove that the data is not corrupted
CRC checks for errors by..1 & .. 2?
1- Checking that the received codeword T’=T (the transmitted codeword)
2- Dividing T’ by G to verify it’s still divisible
if the Divisor G has 𝑛 bits, the FCS field F must have..?
FCS field F must have 𝑘=𝑛-1 bits
An error correcting code is an algorithm that …?
expresses a sequence of bits such that any introduced errors can be detected and corrected
What does ARQ stand for? what does it do?
Automatic repeat request,
A data block is encoded for error detection and when an error is detected at the receiver it requests a retransmission
What does FEC stand for? what does it do?
Forward error correction, When FEC is employed, a data block or sequence is encoded for error correction (or error control)
What is controlled redundancy?
It’s a type of error-correcting coding where bits or codewords are repeated so the original message can be recovered if it has been corrupted
A code is defined as…?
A code is defined as an n-tuple of q elements where q is any alphabet
What is the naive approach for repetition codes?
In repetition codes, the same message is appended (transmitted) multiple times. Then, decide the value with the highest average
The 𝑅x attempts to…?
The 𝑅x attempts to locally correct errors without going back to the 𝑇x
How is the Hamming Distance calculated? Which is better codes with shorter or larger distances? How is it detected?
the distance is the bit difference between the codes, Codes with larger distance are better, counting the number of 1’s after Detecting using XOR-ing
𝑑min = ?
smallest distance between all codeword pairs
Coding gain is..?
The difference (in dB) in the required signal-to-noise ratio to maintain reliable communications after coding is employed
What does ARQ use? What are the ARQ protocols used for?
ARQ protocols use the concept of 𝑇 and 𝑅 windows, ARQ protocols are also used to control the flow of information between the 𝑇 and the 𝑅
What are Tx windows? What are Rx windows?
𝑇 window: how many packets can the 𝑇 send before expecting a positive acknowledgment (ACK), 𝑅 window: how many packets can 𝑅 accept and send Acks for
Two main types of ARQ protocols…?
– Stop-and-Wait ARQ: only one frame is sent at a time
– Sliding-window ARQ: several frames can be sent at a time – (time permits)
What happens in Stop-and-wait ARQ?
The transmitter sends a block of data (packet) and remains idle until the
reception of a positive acknowledgment (ACK) or a negative acknowledgment
(NACK)
What happens in Stop and wait ARQ if a NACK is received?
when a negative acknowledgment (NACK) is returned, the transmitted data block (packet) that was kept in the buffer is retransmitted
Is the Stop and Wait ARQ efficient?
The stop & wait method is inherently inefficient due to the idle time spent waiting for confirmation
What is the window size of Tx & Rx in S&W? How many bits are needed for sequencing?
1,1
S&W is known as..?
alternating-bit protocol
In S&W, If ACK is not received before the timer expires then…?
𝑇x automatically retransmits the previous packet
what is Go-back-N ARQ?
The idle time is eliminated by continuously sending data blocks (packets) while waiting for confirmation (acknowledgment)
If a data block is Nack’d,….?
this block and the 𝑁 1 subsequent blocks sent
during the round-trip delay are retransmitted
IS GO BACK IN efficient?
o-back-N preserves the ordering of received data blocks at the
receiver, it still suffers from some inefficiency
what’s the differnce between Selective Repeat & GO BACK IN?
data blocks are continuously transmitted, except that
only the block corresponding to the Nack message is retransmitted, Order of transmitted packets is not preserved, Throughput is improved
what’s Hybrid ARQ?
Forward error correction (FEC) is employed in conjunction with ARQ, applications have a lower bound on the data rate, an upper band on the BER & delay.
ARQ protocol work in ….?
packet switching networks
What does RDT stand for?
reliable data transfer: “No errors” + “No data loss” + “No out-of-order data”
MA protocol stands for?
multiple access
In random access scenarios Stations 𝑇x data packets arrive from upper layer, at……..times
random times
ALOHA transmission protocol
-The transmitter 𝑇 sends data to a receiver 𝑅 via intermediary base station
-The BS relays data to the intended 𝑅 station
-All stations use the same frequency to talk to the BS
ALOHA uses………..used after collision occurs
exponential backoff
pure ALOHA
The 𝑇x node transmits a packet then waits for an ACK from the receiver
– If the ACK message arrives within 2𝑇fr then the transmission is successful
– If no ACK is received within 2𝑇 fr the 𝑇x needs to retransmit
does pure ALOHA produce optimal throughput?
no, there is some associated time waste
Throughput is..?
Throughput is the how efficiently I’m using the shared resource
In the Throughput equation g is…..?
number of transmission attempts per frame time
Slotted ALOHA
-The 𝑇x node transmits a packet then waits for an ACK from the receiver
-The link time is divided into time slots 𝑇s=𝑇fr
difference between pure & slotted ALOHA collisions..?
in pure ALOHA the collisions occur in twice the time frame, in slotted ALOHA collisions occur in one frame time
difference between pure & slotted ALOHA throughput..?
- Pure: Maximum throughput is 𝑅 0.184, which occurs when 𝑔 0.5
- Slotted: The maximum throughput is 𝑅 0.368, which occurs when 𝑔 1
CSMA protocols:
Carrier Sense Multiple Access
In CSMA protocols, nodes follow two rules:
1- “listen before you talk”
2- “stop talking (sending) if someone else begins talking (sending) at the same time”
What dictates the size of LAN networks implementing CSMA?
Propagation delay
CSMA/CD is used in…?
wired Ethernet LANs
(CSMA/CD)
Carrier Sense Multiple Access with collision
detection
In CSMA/CD, when hearing a collision, a station…?
– Uses a persistence strategy
– Aborts transmission
– Sends jamming signal to inform other stations of collision
Each time there’s a collision in CSMA/CD a station increases its..and……?
back-off time to avoid new collisions, Repeats the algorithm until successful transmission or reaching the maximum limit
In CSMA/CD, when does a station stop re-transmitting?
1- successful transmission
2- reaching the maximum time limit
Multiplication by an exponential in one domain (time or frequency) corresponds to a…..?
shift in the other domain
What is a link budget?
The calculation of losses over communication medium while still getting a correct reception
Losses & gains are dimensionless so they use
dB not dBm
What is receiver sensitivity?
The minimum power required by a receiver to properly operate
Bandwidth-limited channels induce ……………., which increases…….?
distortion, BER
How does distortion occur?
Channels are limited and limit the bandwidth which causes expansion in the time domain which causes distortion
What is Thermal noise? Why is it also called white noise?
-It is caused due to electron motion
-The spectrum of thermal noise is flat over a wide range of frequencies, and hence it is said to be white.
The receiver noise………..as we increase the receiver bandwidth
increases
Sampling is……?
Reading analog signal values at discrete moments in time
Sampling converts analog signals….?
from continuous time to discrete time
Quantization is….?
the use of a finite set of amplitude levels and the selection of a level nearest to sample value
What is the quantization noise?
The rounding error introduced by quantization
The minimum required sampling 𝑓 is called the……? It is…….?
Nyquist sampling frequency, 2* fmax (Baseband),
2*(fmax-fmin) (bandpass)