9th Computing in Aerospace Conference 1993
DOI: 10.2514/6.1993-4541
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms for high-speed universal noiseless coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0

Year Published

1996
1996
2010
2010

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(40 citation statements)
references
References 0 publications
0
39
0
Order By: Relevance
“…To overcome this, a loss-less data compression algorithm was implemented. The compression scheme is based on Rice's adaptive coding algorithm (Rice, 1993). Normally, for particle data, this scheme results in compression in the order of 4 to 5.…”
Section: Onboard Data Reductionmentioning
confidence: 99%
“…To overcome this, a loss-less data compression algorithm was implemented. The compression scheme is based on Rice's adaptive coding algorithm (Rice, 1993). Normally, for particle data, this scheme results in compression in the order of 4 to 5.…”
Section: Onboard Data Reductionmentioning
confidence: 99%
“…In the cases we have tested, the successive residual images from this decomposition have monotonically decreasing entropy, and appear to possess the stationarity properties that would make it possible for a single codebook to be adequate for all residual images. The final residual image and the VQ encoding indices from each level are losslessly compressed using either the Rice algorithm [10] or the Ziv-Lempel algorithm [11].…”
Section: Implementation Of Progressive Vqmentioning
confidence: 99%
“…The residual image is obtained by taking the difference between the pixel values and their prediction values. The residual encoding primarily exploited Rice codes [12]. Two other forms of variable length coding were also evaluated.…”
Section: -Dimensional Adaptive Differential Pulse Coded Modulation (mentioning
confidence: 99%
“…A simple variable length code, the Rice code, and two other variable length codes based on Huffman codes are evaluated. Rice codes have been shown to be the optimum codes for the information sources with a geometric distribution [12]. They are also very simple to implement in hardware.…”
Section: Encoding Of Residualsmentioning
confidence: 99%