Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 75 for “"huffman coding"”.
-
Modification of Huffman Coding.
Huffman Coding minimizes the average number of coding digits per message. Minimizing the mean time by this method raises the problem of large variance. When the variance is large there is a greater probability that an arbitrary encoded message significantly exceeds the average. The delicate point …
-
Scan test data compression using alternate Huffman coding
Huffman coding is a good method for statistically compressing test data with high compression rates. Unfortunately, the on-‐chip decoder to decompress that encoded test data after it is loaded onto the chip may be too complex. With limited die area, the decoder complexity becomes a drawback. This …
-
An efficient test vector compression scheme using base vector extraction and Huffman coding
… pool of uncompressed test vectors combined with Huffman Coding. The base vectors are used to generate coefficient vectors, which are associated with each test vector and are used to span the whole test space. Resultant base vectors and coefficient vectors can represent the entire test space. …
-
Implementation of linear predictive and Huffman coding algorithms for real time data compression
… shown that a combination of linear predictive coding and Huffman coding offers a significantly improved method of data compression for instrumentation data. The purpose of this thesis is to adapt these techniques to perform data compression of instrumentation signals in real time, using a …
-
Cascading LZW algorithm with Huffman coding : a variable to variable length compression algorithm
… in data compression are fixed to variable length coding and variable to fixed length coding. Higher compression is expected from the more flexible scheme of variable to variable length coding. In such a scheme a compression dictionary is used to transfer variable length string over the text …
-
Reduction in bandwidth and buffer size by using modified Huffman coding after dropping the less frequent source symbols
This research employs the modified Huffman coding technique after dropping the selected source symbols, with respect to the usage frequencies. The expected results are a decrease in average length as well as in variance. The ultimate purpose is to reduce the required bandwidth and buffer size in a …
-
Design and implementation of a decompression engine for a Huffman-based compressed data cache
… the implementation of a decompression engine for Huffman based compressed data cache. Decoding by traversing a Huffman tree bit by bit from the root is straightforward but has many implications. In order to store a Huffman tree, it requires too much memory resources, and the compressed memory …
-
Dynamic Unbounded Integer Compression
… In this research, we have exploited dynamic Huffman compression method referred to as δ-Huffman coding for compressing integers and improved the attainable compression ratios. To achieve this, we have explored a combination of static and dynamic compression algorithms. To the best of our …
-
EEG data compression
… technique. The Adaptive Delta modulation and Huffman coding are used in the former method to predict or interpolate the data. Linear orthognal transformation algorithms are used in the latter method to detect and reduce the redundancies of the data by analyzing the spectral and energy …
-
Exploring the Benefits of Compression to Improve Data-intensive Neural Network Inference
… selection of the prediction functions, and Huffman coding and downsampling stages. We evaluate ASZ against lossless (Huffman coding, RLE) and lossy baselines (quantization with Huffman coding (QH), Lorenzo prediction, SZ1, downsampling, SVD and JPEG) on the 74 skip connections of eight CNN …
-
Compression and cryptology
… compression techniques are not sufficient. Both coding techniques (arithmetic coding and Huffman coding) and modelling techniques (splaying, Ziv-Lempel, and prediction by partial matching—PPM) are examined. It is shown that all these systems have significant security flaws. Explicit attacks are …
-
Compression of bitmapped graphic data
… to graphic bitmapped data. Run-length encoding, statistical encoding (including Huffman codes), and relative encoding are examined and evaluated. A compression application of the Huffman coding of a run-length encoded file is designed and partially implemented in Chapter VII. A listing of …
-
Performance Analysis of Hybrid Algorithms For Lossless Compression of Climate Data
… compression algorithms such as differential encoding and Huffman coding to generate high compression ratios. The performance of the two techniques based on MLP and CFNN types are compared using metrics including compression ratio, Mean Square Error (MSE) and Root Mean Square Error (RMSE). The …
-
Investigation of compression algorithms for the purposes of medical archiving and remote diagnostics
… compression algorithms are investigated: Huffman Coding, Arithmetic Coding and Huffman Coding using Splay Trees. These algorithms are written in C, transformed into (Dynamic Linked Library) DLLs using Visual C++ for use in a Visual Basic application. The algorithms are tested on five …
-
Reduction in bandwidth by using variable length codes
A method of coding an ensemble of messages of a finite number of symbols is developed. Minimizing the average number of coding digits per message by using Huffman coding can result in a large variance. This is a problem because a large variance requires a large buffer and also creates more time …
-
Compression of climate data through Artificial Neural Networks
… of the model is assessed. Differential encoding is then applied followed by Huffman coding. This is compared with results obtained by directly applying differential encoding and Huffman coding to raw data. Performance of the method is measured by metrics like Compression Ratio (CR) and …
-
Binary image compression using run length encoding and multiple scanning techniques
While run length encoding is a popular technique for binary image compression, a raster (line by line) scanning technique is almost always assumed and scant attention has been given to the possibilities of using other techniques to scan an image as it is encoded. This thesis looks at five different …
-
Color image compression using wavelet transform
C language coding of image compression algorithms can be a difficult and tedious task. Image compression methods are usually composed of many stages of cascaded algorithms. Each algorithm may be developed independently. This thesis will address the problem of interfacing new image compression …
-
Progressive transmission of images using pyramidal structure
… Laplacian pyramid structure is used for image coding over low-bandwidth channels. The filtering and differential pulse code modulation (DPCM) methods of image coding are generalized to allow quantization of the Laplacian images. Filtering is performed with a local, symmetric weighting function. …
Page 1 of 4