FLEXIBLE HUFFMAN TREE APPROXIMATION FOR LOW LATENCY ENCODING

Techniques are described for encoding symbols using a new algorithm that provides a flexible Huffman tree approximation and that can be used for low latency encoding. For example, the new algorithm can perform encoding using one or more of the following phases: Shannon-based binning, code space opti...

Full description

Saved in:
Bibliographic Details
Main Authors HEIL, Timothy Hume, BURLACU, Bogdan Alexandru
Format Patent
LanguageEnglish
French
Published 25.02.2021
Subjects
BASIC ELECTRONIC CIRCUITRY
CODE CONVERSION IN GENERAL
CODING
DECODING
ELECTRICITY
Online AccessGet full text

Cover

More Information
Summary:Techniques are described for encoding symbols using a new algorithm that provides a flexible Huffman tree approximation and that can be used for low latency encoding. For example, the new algorithm can perform encoding using one or more of the following phases: Shannon-based binning, code space optimization, tree completion, and code assignment. L'invention concerne des techniques de codage de symboles à l'aide d'un nouvel algorithme qui fournit une approximation d'arbre de Huffman flexible et qui peut servir à un codage à faible latence. Par exemple, le nouvel algorithme peut réaliser un codage à l'aide d'une ou plusieurs phase(s) suivante(s) : le compartimentage basé sur Shannon, l'optimisation de l'espace code, la complétion d'arbre et l'attribution de code.
Bibliography:Application Number: WO2020US37674