High throughput decoding of variable length data symbols
View Patent ↗A method of decoding data includes: receiving an encoded data stream transmitted as a plurality of variable length symbols; dividing the data stream into a sequence of blocks, each block having a sequence of adjacent bit positions starting a first bit position and ending with a last bit position; pre-processing each block prior to fully decoding each block, wherein pre-processing includes, for each block, selecting a bit position in a current block and determining a starting position of a first symbol in an adjacent block based on the selected bit position, wherein determining is initially performed for the last bit position in the current block, and is repeated sequentially for each preceding bit position through and including the first bit position; and fully decoding each block by decoding a first block starting at the first bit position and decoding each adjacent block starting at the starting position.
1. An apparatus for decoding data, comprising:
processing circuitry including a pre-processing engine and a decoding pipeline, the processing circuitry configured to perform:
receiving a data stream, the data stream encoded by an encoding algorithm and transmitted as a plurality of variable length symbols;
dividing the data stream into a sequence of blocks, each block having a sequence of adjacent bit positions starting with a first bit position and ending with a last bit position;
pre-processing each block prior to fully decoding each block by the pre-processing engine, wherein pre-processing includes, for each block, selecting a bit position in a current block and determining a starting position of a first symbol in an adjacent block based on the selected bit position, wherein determining is initially performed for the last bit position in the current block, and is repeated sequentially for each preceding bit position through and including the first bit position; and
inputting the data stream into the pipeline and fully decoding each block by decoding a first block starting at the first bit position and decoding each adjacent block starting at the starting position.
2. The apparatus of claim 1 , wherein the encoding algorithm is a compression algorithm, and decoding includes expanding data represented by each symbol to recreate an original data stream.
3. The apparatus of claim 1 , wherein determining the starting position includes identifying a symbol and determining the starting position based on a length of the symbol.
4. The apparatus of claim 1 , wherein determining the starting position includes storing the starting position in a table indexed to the current block and the selected bit position.
5. The apparatus of claim 3 , wherein determining the starting position includes:
determining the length of the identified symbol that would begin at the selected bit position; and
calculating a position of a following symbol by adding the length of the identified symbol to the selected bit position.
6. The apparatus of claim 5 , wherein calculating the starting position includes:
responsive to the position of the following symbol being in the adjacent block, recording the position as the starting position in the table; and
responsive to the position of the following symbol being in the selected block, reading the starting position of the first symbol in the next block from an entry in the table corresponding to the position, and recording the starting position in the table.
7. The apparatus of claim 1 , wherein the pre-processing engine is configured to pre-process two or more of the blocks in parallel.
8. A computer program product for decoding data, the computer program product comprising:
a non-transitory tangible storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing:
receiving a data stream, the data stream encoded by an encoding algorithm and transmitted as a plurality of variable length symbols;
dividing the data stream into a sequence of blocks, each block having a sequence of adjacent bit positions starting with a first bit position and ending with a last bit position;
pre-processing each block prior to fully decoding each block, wherein pre-processing includes, for each block, selecting a bit position in a current block and determining a starting position of a first symbol in an adjacent block based on the selected bit position, wherein determining is initially performed for the last bit position in the current block, and is repeated sequentially for each preceding bit position through and including the first bit position; and
fully decoding each block by decoding a first block starting at the first bit position and decoding each adjacent block starting at the starting position.
9. The computer program product of claim 8 , wherein determining the starting position includes identifying a symbol and determining the starting position based on a length of the symbol, and storing the starting position in a table indexed to the current block and the selected bit position.
10. The computer program product of claim 9 , wherein determining the starting position includes:
determining the length of the identified symbol that would begin at the selected bit position;
calculating a position of a following symbol by adding the length of the identified symbol to the selected bit position;
responsive to the position of the following symbol being in the adjacent block, recording the position as the starting position in the table; and
responsive to the position of the following symbol being in the selected block, reading the starting position of the first symbol in the next block from an entry in the table corresponding to the position, and recording the starting position in the table.