Computer NetworksTextbook

Bits, Signals, and Packets

Not rated yetRate this book

Bits, Signals, and Packets by Hari Balakrishnan, Christopher J. Terman, and George C. Verghese connects information representation with reliable communication across physical channels and packet networks. These instructions follow the nineteen chapters in the MIT 6.02 lecture-note compilation.

FormatExternal access
LanguageEnglish
SubjectComputer Networks
LevelNot specified
No. of pages—
PublishedNot specified

Free reading is available at the official source. Opens in a new tab.

Bits, Signals, and PacketsFree

About this book

Bits, Signals, and Packets by Hari Balakrishnan, Christopher J. Terman, and George C. Verghese connects information representation with reliable communication across physical channels and packet networks. These instructions follow the nineteen chapters in the MIT 6.02 lecture-note compilation.

How to study this book

Keep separate diagrams for the information being represented, the physical signal carrying it, and the packet-level protocol. Track assumptions about noise, channel behavior, timing, loss, and feedback. Use short hand-worked traces before simulations so that an apparently successful output can be explained.

Chapter-wise explanations and study tasks

Chapter 1 — Introduction

The opening frames digital communication as a sequence of representation, transmission, and network problems. Distinguish the functions of system layers before investigating their interactions.

Study task: Draw an end-to-end communication path and label where representation, channel effects, and packet forwarding arise.

Chapter 2 — Information and Entropy

Entropy describes information under a probabilistic source model and motivates source coding. A claim about average code length depends on the source probabilities and the unit being encoded.

Study task: Calculate entropy for a small source and compare it with a proposed fixed-length representation.

Chapter 3 — Huffman and LZW Compression

Huffman coding uses symbol probabilities, while LZW builds an adaptive dictionary from sequences. Encoder and decoder state must remain compatible for recovery of the original message.

Study task: Encode a short message with each method and trace how the decoder recovers it.

Chapter 4 — Digital Signaling

The discussion contrasts analog and digital representations and introduces communication abstractions. Digital decisions do not remove physical noise; they change how a receiver interprets a signal.

Study task: Explain how a continuous-valued received signal is turned into a digital decision and identify where errors enter.

Chapter 5 — Error-Correction Codes

Redundancy can enable detection or correction of bit errors. The code’s distance properties constrain what errors can be distinguished, so redundancy alone is not a sufficient guarantee.

Study task: Compare the minimum distance of two small codes and state their resulting error-handling capability.

Chapter 6 — Linear Block Codes

Generator and parity-check relationships organize encoding and syndrome decoding. Keep vector conventions consistent and distinguish a syndrome from the original message.

Study task: Encode a short message, introduce an error, and use the syndrome to explain the decoding decision.

Chapter 7 — Convolutional Encoding

A convolutional encoder uses memory, so output depends on current and earlier input. State diagrams and trellises make that dependence explicit.

Study task: Trace a short input sequence through an encoder and record both outputs and state transitions.

Chapter 8 — Viterbi Decoding

The Viterbi method searches a trellis through path metrics and survivor choices. Its efficiency relies on state-based reuse of partial decisions rather than enumerating every complete path.

Study task: Decode a short noisy sequence by hand and justify one discarded path using its metric.

Chapter 9 — Noise

Noise is modeled statistically to analyze communication errors. The model’s distribution and dependence assumptions affect the predicted performance.

Study task: Compare an empirical noise histogram with a stated model and explain one conclusion the histogram alone cannot establish.

Chapter 10 — Physical Channel Models

A physical channel can distort a signal as well as add noise. Identify which effects the selected model captures before interpreting receiver performance.

Study task: Propose a simple channel model and distinguish its deterministic distortion from its random disturbance.

Chapter 11 — LTI Models and Convolution

An impulse response provides an input–output description for a linear time-invariant channel. Convolution links the transmitted waveform with spreading and overlap in the received signal.

Study task: Convolve a short input with a simple channel response and identify contributions from neighboring symbols.

Chapter 12 — Frequency Response

Sinusoids and complex exponentials reveal how an LTI channel changes frequency components. Magnitude and phase both matter when reconstructing a waveform.

Study task: Compare two channels with similar magnitude responses but different phases and explain the effect on a pulse.

Chapter 13 — Fourier Analysis

Spectral representations connect signal structure with frequency-domain channel behavior. Maintain the distinction between a signal spectrum and a system frequency response.

Study task: Describe the spectrum of a simple signal and use it to predict which components a stated channel suppresses.

Chapter 14 — Modulation and Demodulation

Modulation maps information into a transmitted waveform and demodulation extracts the relevant component. Keep carrier, information, and receiver operations distinct.

Study task: Sketch a simple modulation chain and explain how the receiver separates the desired information from the carrier-related representation.

Chapter 15 — Media Access

Shared channels require rules for coordinating competing transmitters. Throughput, collisions, and fairness depend on access behavior and offered load.

Study task: Trace a small shared-channel scenario and compare the consequences of two access rules.

Chapter 16 — Sharing and Switching

Packet networks use switching and shared resources to connect endpoints. Resource sharing introduces queueing and contention rather than guaranteeing the same delay for every packet.

Study task: Follow packets through a small switch network and identify where sharing can create a queue.

Chapter 17 — Routing without Failures

Routing selects forwarding paths through a network. Distinguish the information a node has from the global path a packet ultimately follows.

Study task: Compute routes in a small static network and verify the forwarding decisions at each node.

Chapter 18 — Routing around Failures

Failures require routes and distributed state to change. The transition to a new route can matter as much as the final route because nodes may temporarily have inconsistent information.

Study task: Trace a link failure and identify a possible transient inconsistency before routing converges.

Chapter 19 — Reliable Data Transport

End-to-end reliability must cope with lost, delayed, or repeated packets. Sequence information, acknowledgments, and retransmission rules make recovery possible under explicit assumptions.

Study task: Trace a short transport exchange with one lost packet and explain how the protocol avoids accepting duplicate data.

Applied assignment

Build a small communication walkthrough from a source message to a receiver across a lossy packet network. Include one compression trace, one error-correction example, a simple channel response, a routing decision, and a retransmission exchange. Identify what each layer guarantees and which failures remain outside its model.

Suggested reading plan

Read Chapters 1–4 for representation, 5–8 for coding, 9–14 for physical signals and channels, and 15–19 for shared media and networks. Complete a short trace or calculation at each stage before combining the layers.

Questions for reflection

  • Which uncertainty is addressed by coding, and which requires a protocol?
  • How can individually correct layer models still produce an incomplete system explanation?
  • What state must a receiver retain to recognize repeated information?

Edition and source notes

The source identifies MIT 6.02 draft lecture notes, with a November 2012 title-page update and chapter-specific update dates. This guide follows the nineteen supplied chapters. Protocol and channel exercises illustrate the source’s models and are not instructions for deploying a contemporary network stack.

Consult the official source and full text.

About access & copyright

This page provides book information and study material. Full-text access is provided by the original publisher or authorised source; a listing does not grant permission to republish the book.

Read our Library Access & Copyright policy

Explore the contents

Check the chapters covered in this edition.

Visit the official source

See reading, preview or purchase options.

Save for later

Keep this textbook in your saved collection.

Reader ratings & reviews

Be the first to rate

No ratings yet

0%0%
0%0%
0%0%
0%0%
0%0%

Share your thoughts

Your review helps other students choose the right resources.

Rate this book

How helpful was this book?No sign-up needed. Your rating appears instantly.