# Lesson 16 Flashcards

Click a question to reveal the answer.

<div data-flashcards data-deck="b2l16"></div>

<details>
<summary><strong>1. Why is a narrowband link easy to find and intercept?</strong></summary>
<div class="card-answer"><p>All its energy sits in one small slice of spectrum, so a wideband receiver sees a tall spike at a known frequency — an obvious feature to lock onto and intercept.</p></div>
</details>

<details>
<summary><strong>2. Why is a narrowband link easy to jam?</strong></summary>
<div class="card-answer"><p>Its energy is concentrated in one band, so a jammer can aim all of its power at that band and overwhelm the receiver — nothing dilutes the attack.</p></div>
</details>

<details>
<summary><strong>3. Why doesn't encryption defeat a jammer?</strong></summary>
<div class="card-answer"><p>Encryption hides the message <em>content</em>, not the <em>signal</em>. The spike is still there to be jammed; a jammer denies the channel regardless of what the bits mean. You can encrypt everything you send and still be silenced.</p></div>
</details>

<details>
<summary><strong>4. What is the core idea of spread spectrum?</strong></summary>
<div class="card-answer"><p>Smear the signal across a band far wider than the data needs, using a code both ends share. The energy spreads until the signal looks like noise — low and flat, hard to find and hard to jam — and only a receiver with the same code can pull it back together.</p></div>
</details>

<details>
<summary><strong>5. What is processing gain, and what is the formula?</strong></summary>
<div class="card-answer"><p>The ratio of spread bandwidth to data bandwidth, in dB: <span class="math notranslate nohighlight">\(G_p = 10\log_{10}(B_{\text{spread}}/B_{\text{data}}) = 10\log_{10} N_{\text{chips}}\)</span>, where <span class="math notranslate nohighlight">\(N_{\text{chips}}\)</span> is chips per bit. Typically 10–60 dB.</p></div>
</details>

<details>
<summary><strong>6. A code runs 1000 chips per bit. What is the processing gain?</strong></summary>
<div class="card-answer"><p><span class="math notranslate nohighlight">\(G_p = 10\log_{10}(1000) = 30\)</span> dB. (Each factor of ten in chip rate is another 10 dB; a 64-chip code gives <span class="math notranslate nohighlight">\(\approx 18\)</span> dB.)</p></div>
</details>

<details>
<summary><strong>7. What does despreading do to the signal and to the jammer?</strong></summary>
<div class="card-answer"><p>Multiplying by the same code <strong>concentrates the wanted signal</strong> (its chips line up and add, collapsing it back to narrowband) and <strong>spreads the jammer</strong> (uncorrelated with the code, it gets smeared across the band). The picture before and after despreading is simply reversed.</p></div>
</details>

<details>
<summary><strong>8. How does processing gain let a link survive a positive J/S?</strong></summary>
<div class="card-answer"><p>After despreading, the effective ratio is roughly <span class="math notranslate nohighlight">\((\text{J/S})_{\text{in}} - G_p\)</span>. So even when the jammer is louder than the signal at the antenna, the link closes if <span class="math notranslate nohighlight">\(G_p\)</span> exceeds the deficit with margin. With <span class="math notranslate nohighlight">\(G_p = 30\)</span> dB against a 20 dB jammer, ~10 dB of margin remains.</p></div>
</details>

<details>
<summary><strong>9. How does processing gain relate to bit-error rate?</strong></summary>
<div class="card-answer"><p>BER is set by <span class="math notranslate nohighlight">\(E_b/N_0\)</span> after despreading, and despreading raises the effective <span class="math notranslate nohighlight">\(E_b/N_0\)</span> by <span class="math notranslate nohighlight">\(G_p\)</span>. Drive the post-despread margin positive and the BER collapses — bits lost in the jammer come through clean.</p></div>
</details>

<details>
<summary><strong>10. How does DSSS spread the signal?</strong></summary>
<div class="card-answer"><p>It multiplies each data bit by a fast pseudo-noise (PN) chip sequence. <span class="math notranslate nohighlight">\(N\)</span> chips per bit spreads the bandwidth by <span class="math notranslate nohighlight">\(N\)</span> and sets <span class="math notranslate nohighlight">\(G_p\)</span>. The receiver multiplies by the same PN code and integrates per bit, so the signal re-collapses and the jammer smears.</p></div>
</details>

<details>
<summary><strong>11. How does FHSS spread the signal, and how does it relate to L15?</strong></summary>
<div class="card-answer"><p>It hops the carrier across many channels on a code-driven schedule; transmitter and receiver hop together. A spot jammer can't follow and must spread its power across the whole hop set (partial-band/barrage). It is L15's radar frequency agility pushed onto our links — same lose-lose, same J/S relief, spread in frequency instead of code.</p></div>
</details>

<details>
<summary><strong>12. What is LPD, and what is the canonical example?</strong></summary>
<div class="card-answer"><p>Low probability of detection — with enough processing gain a signal rides <em>below</em> the noise floor and only correlation digs it out. GPS is the example: it arrives below thermal noise. If the threat can't find the signal, it can't intercept or jam it well. LPD is the comms cousin of LPI radar — "you cannot jam what you cannot find."</p></div>
</details>
