Constant bitrate
Constant bitrate (CBR) is a term used in telecommunications, relating to the quality of service. Compare with variable bitrate.[1]
When referring to codecs, constant bit rate encoding means that the rate at which a codec's output data should be consumed is constant. CBR is useful for streaming multimedia content on limited capacity channels since it is the maximum bit rate that matters, not the average, so CBR would be used to take advantage of all of the capacity.[1]
CBR is not optimal for storing data as it may not allocate enough data for complex sections (resulting in degraded quality); and if it maximizes quality for complex sections, it will waste data on simple sections.
The problem of not allocating enough data for complex sections could be solved by choosing a high bitrate to ensure that there will be enough bits for the entire encoding process, though the size of the file at the end would be proportionally larger.
Most coding schemes such as Huffman coding or run-length encoding produce variable-length codes, making perfect CBR difficult to achieve. This is partly solved by varying the quantization (quality), and fully solved by the use of padding. (However, CBR is implied in a simple scheme like reducing all 16-bit audio samples to 8 bits.)
In the case of streaming video as a CBR, the source could be under the CBR data rate target. So in order to complete the stream, it's necessary to add stuffing packets in the stream to reach the data rate wanted. These packets are totally neutral and don't affect the stream.
See also
- Bitrate
- Average bitrate
- Variable bitrate
- Bit stuffing
References
- ^ a b drewbatgit (2023-06-20). "Constant Bit Rate (CBR) Encoding - Win32 apps". learn.microsoft.com. Retrieved 2023-07-15.
- v
- t
- e
Entropy type |
|
---|---|
Dictionary type | |
Other types | |
Hybrid |
Transform type | |
---|---|
Predictive type |
Concepts | |
---|---|
Codec parts |
Concepts | |
---|---|
Methods |
Concepts | |
---|---|
Codec parts |
- Compressed data structures
- Entropy
- Information theory
- Kolmogorov complexity
- Prefix code
- Quantization
- Rate–distortion
- Redundancy
- Symmetry
- Smallest grammar problem
- Hutter Prize
- Global Data Compression Competition
- encode.su
- Matt Mahoney
- Mark Adler
Compression formats
Compression software (codecs)
![]() | This computer networking article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e