Lazy matching with reduced latency for dictionary-based compression

Abstract

A method may include obtaining input symbols and a hash table. The method may also include storing the input symbols in a first buffer at a current coding position, and processed input symbols in a second buffer. The method may further include defining a plurality of delayed match window (DMW) offsets, comprising a highest DMW offset and at least one lower DMW offset. The method may also include performing a substring match search using the input symbols, the processed input symbols, and the highest DMW offset, to determine one or more candidate matches. The method may further include outputting a result from the substring match search corresponding to a determination associated with the one or more candidate matches.

Dependencies are inferred from the claim text.