Systems and methods for decompressing neural network coefficients
AssigneeMobileye Vision Technologies Ltd.
InventorOren AGAM
Life of this patent
Estimating the term…
Abstract
A method for decompressing data may include receiving a first sequence of bits and performing a plurality of iterations. Each of the plurality of iterations may include scanning bits of the first sequence, starting from a starting point, to search for at least one of a variable length codeword or a bypass indicator, the starting point being either a starting point of the first sequence or a starting point defined in a previous iteration. The method also include, for at least one of the plurality of iterations, when a bypass indicator is found, outputting a neural network coefficient related value (NNCRV) that is non-compressed and follows the bypass indicator, and defining a starting point that follows the NNCRV as a starting point for a next iteration.
Claims22
-16. (canceled)
A method for decompressing data, the method comprising:
- receiving a sequence of bits;
- searching for, starting from a first start point, at least one of a variable length codeword or a bypass indicator in the sequence, the first start point being a start point of the sequence;
- when a bypass indicator is found from the first start point:
- determining at least one neural network coefficient related value (NNCRV) that is non-compressed and follows the bypass indicator;
- outputting the at least one NNCRV;
- and
- designating a bit in the sequence that follows the at least one NNCRV as a second starting point;
- and
- when a variable length codeword is found from the first start point:
- determining at least one NNCRV based on the variable length codeword;
- outputting the at least one NNCRV;
- and
- designating a bit in the sequence that follows the variable length codeword as a third starting point, wherein a maximal length of the variable length codeword does not exceed a predefined size;
- and
- searching for, starting from the second or third start point, at least one of a next variable length codeword or a next bypass indicator in the sequence.
-28. (canceled)
A system for decompressing data, the system comprising:
- at least one processor comprising circuitry and a memory, wherein the memory includes instructions that when executed by the circuitry cause the at least one processor to:
- receive a sequence of bits;
- search for, starting from a first start point, at least one of a variable length codeword or a bypass indicator in the sequence, the first start point being a start point of the sequence;
- when a bypass indicator is found from the first start point:
- determine at least one neural network coefficient related value (NNCRV) that is non-compressed and follows the bypass indicator;
- output the at least one NNCRV;
- and
- designate a bit in the sequence that follows the at least one NNCRV as a second starting point;
- and
- when a variable length codeword is found from the first start point:
- determine at least one NNCRV based on the variable length codeword;
- output the at least one NNCRV;
- and
- designate a bit in the sequence that follows the variable length codeword as a third starting point, wherein a maximal length of the variable length codeword does not exceed a predefined size;
- and
- search for, starting from the second or third start point, at least one of a next variable length codeword or a next bypass indicator in the sequence.
A non-transitory computer readable medium containing instructions that when executed by at least one processor, cause the at least one processor to perform operations comprising:
- receiving a sequence of bits;
- searching for, starting from a first start point, at least one of a variable length codeword or a bypass indicator in the sequence, the first start point being a start point of the sequence;
- when a bypass indicator is found from the first start point:
- determining at least one neural network coefficient related value (NNCRV) that is non-compressed and follows the bypass indicator;
- outputting the at least one NNCRV;
- and
- designating a bit in the sequence that follows the at least one NNCRV as a second starting point;
- and
- when a variable length codeword is found from the first start point:
- determining at least one NNCRV based on the variable length codeword;
- outputting the at least one NNCRV;
- and
- designating a bit in the sequence that follows the variable length codeword as a third starting point, wherein a maximal length of the variable length codeword does not exceed a predefined size;
- and
- searching for, starting from the second or third start point, at least one of a next variable length codeword or a next bypass indicator in the sequence.
Dependencies are inferred from the claim text.