By Topic

Prefix Coding of Histograms for Minimal Storage

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
I. Jacobs ; Univ of Calif., San Diego ; L. Kleinrock

The reduction of experimental data to histograms is often useful, particularly if the experimental site is remote (e.g., in a spacecraft). An implementation utilizing prefix coding is described which permits assembling an N -sample, K -cell histogram directly from sequentially received data with minimal logic and memory requirements. The necessary storage is shown to differ from the minimum number of bits required for unique specification of an ( N, K ) histogram by less than 3/4 K when N \gg K . The method codes the contents, denoted by n , of a cell into a binary code word of length f(n) . A minimax theorem is presented to justify selecting f(n) from a class of linear staircase functions, and the best such function satisfying the Kraft inequality is determined. Graphs are presented of the resulting storage requirements.

Published in:

IEEE Transactions on Communication Technology  (Volume:15 ,  Issue: 2 )