US 11,722,149 B2
Deflate compression using sub-literals for reduced complexity Huffman coding
Yingquan Wu, Palo Alto, CA (US)
Assigned to Beijing Tenafe Electronic Technology Co., Ltd.
Filed by Beijing Tenafe Electronic Technology Co., Ltd., Beijing (CN)
Filed on Aug. 31, 2022, as Appl. No. 17/899,993.
Application 17/899,993 is a continuation of application No. 17/350,706, filed on Jun. 17, 2021, granted, now 11,469,773.
Prior Publication US 2022/0416811 A1, Dec. 29, 2022
Int. Cl. H03M 7/42 (2006.01); H03M 7/30 (2006.01); H03M 7/46 (2006.01); H03M 7/40 (2006.01)
CPC H03M 7/42 (2013.01) [H03M 7/3086 (2013.01); H03M 7/405 (2013.01); H03M 7/46 (2013.01); H03M 7/6005 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A system, comprising:
an interface that is configured to:
receive an input sequence that has a plurality of bits, wherein the input sequence is associated with a first section of data within a compressed block; and
output encoded data that includes information associated with a first Huffman code tree, information associated with a second Huffman code tree, a first codeword, and a second codeword; and
a processor that is configured to:
divide the plurality of bits in the input sequence into a first sub-sequence comprising a first set of bits and a second sub-sequence comprising a second set of bits;
encode the first sub-sequence using the first Huffman code tree to obtain the first codeword; and
encode the second sub-sequence using the second Huffman code tree to obtain the second codeword.