Chapters

28 Voice Compression: Codec and Link Constraints

fundamentals
signal
processing
voice

28.1 Start With the Decision

A door intercom can sound clear on the bench but break into gaps on its radio link. Format, loss, and delay must fit the same path.

28.2 Route Overview

This is part 1 of 2. Continue with Voice Compression: Samples, Companding, and Speech Models.

28.3 Part Objectives

  • Test why voice gets compressed with a concrete scenario and pass criteria.
  • Validate apply it: match the codec to the link with a concrete scenario and pass criteria.

28.4 Chapter Roadmap

  • In 60 Seconds
  • Start With the Story
  • Why Voice Gets Compressed
  • Apply It: Match the Codec to the Link

28.5 In 60 Seconds

Fit One Clear Message Through the Real Link

Picture a door intercom that sounds clear on the bench but breaks into gaps over its radio link. The audio format, packet overhead, loss, and delay must fit the same path.

Analog-to-digital converter means a circuit that turns microphone voltage into numbers; it is often shortened to ADC. Latency means the delay between speech and useful playback. Measure both the encoded stream and the listening result.

Send one known phrase at two quality settings, then add loss and a slow link. Keep sample settings, encoded size, packet overhead, delay, losses, energy, and listening notes.

This runway does not prove that one codec fits every voice task. The deeper sections explain sampling, quantization, compression, packet framing, link budgets, loss handling, and listening validation.

Voice compression turns a raw microphone sample stream into a stream small enough for constrained IoT links. Review it as a complete link-budget, packet-overhead, latency, loss, CPU, energy, and listening-validation decision.

28.6 Start With the Story

You will compare audio codecs against a PCM baseline and include packet costs when judging whether voice fits a link. Start with the speech task, capture quality, and available transmission budget.

Follow one voice message across four beats to see how codec, overhead, and delay must fit the same constrained link.

  1. Packet Pete speaks into a microphone while Remi watches dense raw voice samples enter the radio path.

    Packet Pete: “The baseline keeps the voice detail, but it asks the link to carry every sample.”

  2. Packet Pete and Remi see uncompressed voice packets crowd the link and arrive as a delayed broken waveform.

    Remi: “Payload and overhead together are delaying the speech we need.”

  3. Packet Pete and Remi compare dense baseline audio with a compact codec path using the same microphone source.

    The team: “Balance intelligibility, link capacity, packet cost, and delay before choosing the codec.”

  4. Packet Pete and Remi verify a clear received waveform and orderly compressed packets across the constrained radio link.

    Packet Pete: “The compressed speech now arrives intelligibly inside the delay budget.”

Voice compression succeeds when intelligibility, packet overhead, and end-to-end delay are verified together.

The mathematical gist. At the chapter’s 88 kHz rate, Nyquist gives a 44 kHz content ceiling. Ideal linear PCM gives 6.02(8)+1.76=49.96.02(8)+1.76=49.9 dB full-scale SNR, but a talker 4040 dB below full scale keeps only 9.99.9 dB. Companding reshapes the amplitude ruler so quiet speech receives finer effective steps while the wire still carries 88 bits at 6464 kbps.

Math Bridge · guided foundationsWhy does quiet speech need companding?Phoebe separates sample rate from bit depth and works the chapter’s 9.9 dB quiet-talker case.

28.9 Continue to the Next Part

Carry this evidence into Voice Compression: Samples, Companding, and Speech Models, which begins with Under the Hood: From Samples to a Speech Model.