Optimal Compression for Two-Field Entries in Fixed-Width Memories

Data compression is a well-studied (and well-solved) problem in the setup of long coding blocks. But important emerging applications need to compress data to memory words of small fixed widths. This new setup is the subject of this paper. In the problem we consider, we have two sources with known di...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 64; H. 6; S. 4309 - 4322
Hauptverfasser:	Rottenstreich, Ori, Cassuto, Yuval
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.06.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Codes Compression algorithms Data compression Decoding Dictionaries fixed-width memories Heuristic algorithms Huffman coding Machine learning network switches and routers Optimization Random access memory Routers Switches table compression Tables
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!