The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 04, 2017

Filed:

Dec. 23, 2016
Applicant:

Amazon Technologies, Inc., Seattle, WA (US);

Inventors:

Michael Baranchik, Natanya, IL;

Ron Diamant, Albany, CA (US);

Muhannad Ghanem, Hafia, IL;

Ori Weber, Tel-Aviv, IL;

Assignee:

AMAZON TECHNOLOGIES, INC., Seattle, WA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H03M 7/40 (2006.01); H03M 7/30 (2006.01); H03M 7/42 (2006.01);
U.S. Cl.
CPC ...
H03M 7/40 (2013.01); H03M 7/30 (2013.01); H03M 7/42 (2013.01); H03M 7/6058 (2013.01);
Abstract

A method for generating Huffman codewords to encode a dataset includes selecting a Huffman tree type from a plurality of different Huffman tree types. Each of the Huffman tree types specifies a different range of codeword length in a Huffman tree. A Huffman tree of the selected type is produced by: determining a number of nodes available to be allocated as leaves in each level of the Huffman tree accounting for allocation of leaves in each level of the Huffman tree; allocating nodes to be leaves such that the number of nodes allocated in a given level of the Huffman tree is constrained to be no more than the number of nodes available to be allocated in the given level; and assigning the leaves to symbols of the dataset based an assignment strategy selected from a plurality of assignment strategies to produce symbol codeword information.


Find Patent Forward Citations

Loading…