ArticleslgStudy

science

G.711

G.711 is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand G.711 rather than just read about it. In short: G.711 is a narrowband audio codec originally designed for use in telephony that provides toll-quality audio at 64 kbit/s. It is an ITU-T standard (Recommendation) for audio encoding, titled Pulse code modulation (PCM) of voice frequencies released for use in 1972.

G.711 — main illustration
G.711 — illustration

Key takeaways

  • G.711 belongs to science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect G.711 to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of G.711 from memory before moving on to harder problems.

Reference excerpt

G.711 is a narrowband audio codec originally designed for use in telephony that provides toll-quality audio at 64 kbit/s. It is an ITU-T standard (Recommendation) for audio encoding, titled Pulse code modulation (PCM) of voice frequencies released for use in 1972. G.711 passes audio signals in the frequency band of 300–3400 Hz and samples them at the rate of 8000 Hz, with the tolerance on that rate of 50 parts per million (ppm). It uses one of two different logarithmic companding algorithms: μ-law, which is used primarily in North America and Japan, and A-law, which is in use in most other countries outside North America. Each companded sample is quantized as 8 bits, resulting in a 64 kbit/s bit rate. G.711 is a required standard in many technologies, such as in the H.320 and H.323 standards. It can also be used for fax communication over IP networks (as defined in T.38 specification). Two enhancements to G.711 have been published: G.711.0 utilizes lossless data compression to reduce the bandwidth usage and G.711.1 increases audio quality by increasing bandwidth.

Features 8 kHz sampling frequency 64 kbit/s bitrate (8 kHz sampling frequency × 8 bits per sample) Typical algorithmic delay is 0.125 ms, with no look-ahead delay G.711 is a waveform speech coder G.711 Appendix I defines a packet loss concealment (PLC) algorithm to help hide transmission losses in a packetized network G.711 Appendix II defines a discontinuous transmission (DTX) algorithm which uses voice activity detection (VAD) and comfort noise generation (CNG) to reduce bandwidth usage during silence periods PSQM testing under ideal conditions yields mean opinion scores of 4.45 for G.711 μ-law, 4.45 for G.711 A-law PSQM testing under network stress yields mean opinion scores of 4.13 for G.711 μ-law, 4.11 for G.711 A-law

Types G.711 defines two main companding algorithms, the μ-law algorithm and A-law algorithm. Both are logarithmic, but A-law was specifically designed to be simpler for a computer to process. The standard also defines a sequence of repeating code values which defines the power level of 0 dB. The μ-law and A-law algorithms encode 14-bit and 13-bit signed linear PCM samples (respectively) to logarithmic 8-bit samples. Thus, the G.711 encoder will create a 64 kbit/s bitstream for a signal sampled at 8 kHz. G.711 μ-law tends to give more resolution to higher range signals while G.711 A-law provides more quantization levels at lower signal levels. The terms PCMU, G711u and G711MU are also used for G.711 μ-law, and PCMA and G711A for G.711 A-law.

A-law

A-law encoding thus takes a 13-bit signed linear audio sample as input and converts it to an 8 bit value as follows:

Where s is the sign bit, s is its inverse (i.e. positive values are encoded with MSB = s = 1), and bits marked x are discarded. Note that the first column of the table uses different representation of negative values than the third column. So for example, input decimal value −21 is represented in binary after bit inversion as 1000000010100, which maps to 00001010 (according to the first row of the table). When decoding, this maps back to 1000000010101, which is interpreted as output value −21 in decimal. Input value +52 (0000000110100 in binary) maps to 10011010 (according to the second row), which maps back to 0000000110101 (+53 in decimal). This can be seen as a floating-point number with 4 bits of mantissa m (equivalent to a 5-bit precision), 3 bits of exponent e and 1 sign bit s, formatted as seeemmmm with the decoded linear value y given by formula

y = ( − 1 ) s ⋅ ( 16 ⋅ min { e , 1 } + m + 0.5 ) ⋅ 2 max { e , 1 } , {\displaystyle y=(-1)^{s}\cdot (16\cdot \min\{e,1\}+m+0.5)\cdot 2^{\max\{e,1\}},}

which is a 13-bit signed integer in the range ±1 to ±(212 − 26). Note that no compressed code decodes to zero due to the addition of 0.5 (half of a quantization step). In addition, the standard specifies that all resulting even bits (LSB is even) are inverted before the octet is transmitted. This is to provide plenty of 0/1 transitions to facilitate the clock recovery process in the PCM receivers. Thus, a silent A-law encoded PCM channel has the 8 bit samples coded 0xD5 instead of 0x80 in the octets. When data is sent over E0 (G.703), MSB (sign) is sent first and LSB is sent last. ITU-T STL defines the algorithm for decoding as follows (it puts the decoded values in the 13 most significant bits of the 16-bit output data type).

See also "ITU-T Software Tool Library 2009 User's manual" that can be found at.

μ-law

The μ-law (sometimes referred to as ulaw, G.711Mu, or G.711μ) encoding takes a 14-bit signed linear audio sample in two's complement representation as input, inverts all bits after the sign bit if the value is negative, adds 33 (binary 100001) and converts it to an 8 bit value as follows:

Where s is the sign bit, and bits marked x are discarded. In addition, the standard specifies that the encoded bits are inverted before the octet is transmitted. Thus, a silent μ-law encoded PCM channel has the 8 bit samples transmitted 0xFF instead of 0x00 in the octets. Adding 33 is necessary so that all values fall into a compression group and it is subtracted back when decoding. Breaking the encoded value formatted as seeemmmm into 4 bits of mantissa m, 3 bits of exponent e and 1 sign bit s, the decoded linear value y is given by formula

y = ( − 1 ) s ⋅ [ ( 33 + 2 m ) ⋅ 2 e − 33 ] , {\displaystyle y=(-1)^{s}\cdot [(33+2m)\cdot 2^{e}-33],}

which is a 14-bit signed integer in the range ±0 to ±8031. Note that 0 is transmitted as 0xFF, and −1 is transmitted as 0x7F, but when received the result is 0 in both cases.

… excerpt ends here. Continue reading the full article.

Illustrations

G.711 illustration

Worked examples

Example 1 — a first encounter with G.711

Start with the simplest possible case. Write down what G.711 claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to G.711 before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about G.711 ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of G.711

In research
G.711 appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses G.711 in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
G.711 is common in secondary-school and first-year university syllabi. It links to neighbouring topics Audio codecs, ITU-T G Series Recommendations, ITU-T recommendations, so understanding it makes those chapters shorter.
In everyday life
Look for G.711 outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “G.711” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study G.711 in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what G.711 means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain G.711 out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is G.711 in simple terms?

G.711 is a narrowband audio codec originally designed for use in telephony that provides toll-quality audio at 64 kbit/s. It is an ITU-T standard (Recommendation) for audio encoding, titled Pulse code modulation (PCM) of voice frequencies released for use in 1972.

Why does G.711 matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study G.711?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on G.711.

Tags

  • Audio codecs
  • ITU-T G Series Recommendations
  • ITU-T recommendations
  • Internet fax
  • Speech codecs
  • Telecommunications-related introductions in 1972

Keep exploring