Mu-Law Companding¶
A logarithmic companding law that allocates finer quantization resolution to small signal amplitudes and coarser resolution to large amplitudes, with an inverse expander at decoding.
Core Idea¶
Mu-law companding maps a normalized signal amplitude \(x\in[-1,1]\) through a signed logarithmic compressor before uniform quantization:
The receiver applies the inverse expansion
Because the compressor has greater slope near zero, equal steps in the compressed domain correspond to small linear-amplitude steps for quiet signals and larger steps for loud signals. The law thus improves effective signal-to-quantization-noise behavior over a wide speech range at fixed code width. The standardized telephony form uses \(\mu=255\) and an eight-bit piecewise encoding specified by ITU-T G.711.
Scope of Application¶
The canonical deployment is eight-bit PCM for voice-frequency telephony. G.711 specifies a nominal 8000 samples per second and two companding laws, mu-law and A-law. Mu-law has historically been associated with North American and Japanese systems. The standard's exact code words, sign handling, bias, segment selection, and bit inversion matter for interoperability.
The analytic law is also used as a pedagogical and computational model of nonuniform quantization. In machine learning and digital audio datasets, “mu-law encoding” may transform waveform samples into a discrete set of amplitude classes. Such uses instantiate the same compressor/quantizer logic but may not be bit-compatible with G.711.
Clarity¶
For \(\mu>0\), \(F(0)=0\), \(F(1)=1\), and \(F(-x)=-F(x)\). Its derivative for positive \(x\) is
which decreases with amplitude. Near zero, the large derivative expands small input differences before quantization. The inverse correspondingly compresses code-space error near zero back to a small linear error.
Manages Complexity¶
One monotone transform lets a uniform quantizer behave like a nonuniform quantizer. Hardware or software can quantize equal compressed intervals while allocating linear-domain precision according to amplitude. This avoids storing an arbitrary nonuniform threshold table in the conceptual model.
The compression also approximates a roughly constant ratio of quantization step to signal magnitude over much of the range, which suits speech's large dynamic range.
Abstract Reasoning¶
The compressor is strictly increasing and odd, so it preserves order and sign. Substituting the inverse verifies
before quantization. Let compressed quantizer step be \(\Delta_y\). A first-order linear-domain step near \(x\) is
Knowledge Transfer¶
The same law transfers from telephony PCM to waveform-class encoding when samples are normalized and the transform/quantize/invert roles remain literal. The implementation may use different bin counts, but changing \(\mu\), normalization, or code format must be documented.
The intuition transfers to logarithmic sensors and perceptual encodings only at a broader level. Those are not mu-law unless they use this characteristic or its standardized discrete approximation.
Relationships to Other Abstractions¶
Current abstraction Mu-Law Companding Domain-specific
Parents (1) — more general patterns this builds on
-
Mu-Law Companding is a kind of Logarithmic Perception and Encoding Prime
Logarithmic Perception and Encoding is the proposed minimal parent: mu-law is a strict logarithmic encoding specialization.
Hierarchy path (1) — routes to 1 parentless root
- Mu-Law Companding → Logarithmic Perception and Encoding → Representation → Abstraction
Neighborhood in Abstraction Space¶
Mu-Law Companding sits in a sparse region of the domain-specific corpus (96th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Q Number Format — 0.78
- Shannon–Hartley Theorem — 0.76
- Bisection Method — 0.75
- Trellis quantization — 0.75
- Restricted isometry property — 0.75
Computed from structural-signature embeddings · 2026-09-08