{ "@context": "https://schema.org", "@type": "Organization", "name": "Brainscape", "url": "https://www.brainscape.com/", "logo": "https://www.brainscape.com/pks/images/cms/public-views/shared/Brainscape-logo-c4e172b280b4616f7fda.svg", "sameAs": [ "https://www.facebook.com/Brainscape", "https://x.com/brainscape", "https://www.linkedin.com/company/brainscape", "https://www.instagram.com/brainscape/", "https://www.tiktok.com/@brainscapeu", "https://www.pinterest.com/brainscape/", "https://www.youtube.com/@BrainscapeNY" ], "contactPoint": { "@type": "ContactPoint", "telephone": "(929) 334-4005", "contactType": "customer service", "availableLanguage": ["English"] }, "founder": { "@type": "Person", "name": "Andrew Cohen" }, "description": "Brainscape’s spaced repetition system is proven to DOUBLE learning results! Find, make, and study flashcards online or in our mobile app. Serious learners only.", "address": { "@type": "PostalAddress", "streetAddress": "159 W 25th St, Ste 517", "addressLocality": "New York", "addressRegion": "NY", "postalCode": "10001", "addressCountry": "USA" } }

Physical Flashcards

(14 cards)

1
Q

packetization

A

bits obtained by the source coding are divided into packets

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

encapsulation

A

headers added to various layers of the network stack

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

forward error correction

A

error control capabilities of a code depend on the redundancy introduced by the code(set of code words)

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

hamming distance

A

number of bits in which two codewords differ

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

distance of a code

A

minimun hamming distance between two codewords

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

Hamming(7,4)

A

detects single but not double errors, d1-d4 are data bits, p1=d1+d2+d4, p2=d1+d3+d4, p3 = d2+d3+d4

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

How good is FEC?

A

may not be able to correct or detect all layers, incurs overhead which reduces data rate

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

Watt conversions

A

dBW = 10log10(W)
dBm = 10
log10(W*10^3 or 1mW)

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

what is the path loss

A

1/gain(R/T), so T/R, PL(db) = 10log10(PL)

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

power budget

A

Pr = Pt + gains - losses, all in dBm/dB

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

Signal to Noise Ratio

A

10log10(signal power/noise power), higher SNR means higher quality signal.

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

free space propagation models

A

Pr = Pt-PL, PL(d) = PL(d0) + 20log(d/d0), (Pt/Pr) = (4pid^A)2/wlength2, Ldb = 20log(f)+20log(d)-147.56dB, Pr(d) = Pr(d0)(d0^A/d^A)

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

additive white gaussian noise

A

Capacity = Wlog2(1+ Pr/(Inter+N0W))

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

Energyperbit / N0

A

(S/bit rate) / No

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