18495514. HANDLING TRAILING BITS IN ARITHMETIC ENCODING AND DECODING simplified abstract (Huawei Technologies Co., Ltd.)
HANDLING TRAILING BITS IN ARITHMETIC ENCODING AND DECODING
Organization Name
Inventor(s)
Maxim Borisovitch Sychev of Moscow (RU)
Elena Alexandrovna Alshina of Munich (DE)
Sergey Yurievich Ikonin of Moscow (RU)
HANDLING TRAILING BITS IN ARITHMETIC ENCODING AND DECODING - A simplified explanation of the abstract
This abstract first appeared for US patent application 18495514 titled 'HANDLING TRAILING BITS IN ARITHMETIC ENCODING AND DECODING
Simplified Explanation
The method and apparatus described in the patent application encode data into a bitstream and decode data from a bitstream by including only the relevant significant bits within the trailing bits of the encoding process. This reduces the length of the bitstream and eliminates the need for padding, resulting in fewer bits that need to be signaled.
- The method reduces the length of the bitstream by including only the relevant significant bits within the trailing bits of the encoding process.
- The amount of leading trailing bits is determined and the trailing bits with the least amount can be constructed.
- Indications of the amount of leading trailing bits are included in the bitstream.
- Padding is not required, resulting in fewer bits that need to be signaled.
Potential Applications
- Data compression in communication systems
- Efficient storage of data in memory devices
- Improved transmission of data over networks
Problems Solved
- Reducing the length of bitstreams
- Eliminating the need for padding
- Improving efficiency in data encoding and decoding processes
Benefits
- Reduced data transmission time
- Lower bandwidth usage
- Improved data storage efficiency
Original Abstract Submitted
Methods and apparatuses are described to encode data into a bitstream and to decode data from a bitstream. The method is able to reduce the length of the bitstream by including only the relevant significant bits within the trailing bits of the encoding process. The amount of these leading trailing bits is determined and the trailing bits, which have the least amount, can be constructed. Indications of the amount of leading trailing bits are included into the bitstream. Therefore, padding is not required, resulting in less bits, which need to be signaled.
