Noniterative entropy coding
AssigneeSynaptics Incorporated
InventorVikram Singh RANA
Life of this patent
Estimating the term…
Abstract
This disclosure provides methods, devices, and systems for data compression and decompression. The present implementations more specifically relate to entropy encoding and decoding techniques for keeping a state variable within upper and lower bounds using a noniterative process. The entropy encoding uses a fixed state threshold to determine a number of bits to remove and removes the bits from a current state prior to encoding a symbol with the current state. The entropy decoding decodes encoded data in a bitstream based on a current state to obtain the symbol and a new state and determines a number of bits to read from the bitstream and to add to the new state to update the current state.
Claims20
A method of data encoding, comprising:
- obtaining a current state for encoding a symbol;
- obtaining a fixed state threshold;
- determining a total number of bits to remove from the current state based on the fixed state threshold;
- encoding the current state with the symbol after removing the total number of bits from the current state to generate a new state;
- generating a bitstream based on the new state and the bits removed from the current state;
- and
- transmitting the bitstream to a decoder.
An encoder configured for data encoding, comprising:
- at least one memory;
- and
- a processing system comprising one or more processors coupled to the at least one memory, the processing system configured to:
- obtain a current state for encoding a symbol;
- obtain a fixed state threshold;
- determine a total number of bits to remove from the current state based on the fixed state threshold;
- encode the current state with the symbol after removing the total number of bits from the current state to generate a new state;
- generate a bitstream based on the new state and the bits removed from the current state;
- and
- transmit the bitstream to a decoder
A method of data decoding, comprising:
- obtaining a fixed lower bound for states;
- obtaining a current state;
- receiving a bitstream from an encoder, the bitstream comprising a state encoded with a number of symbols and a series of bits removed from the state as part of the encoding process;
- decoding the state based on the current state to generate a new state and obtain a symbol;
- determining a total number of bits removed for the state for the symbol and to be read from the bitstream into the new state based on the new state and the fixed lower bound;
- and
- reading the total number of bits from the bitstream into the new state.
Dependencies are inferred from the claim text.