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 7 of 7 for “"Huffman coding"”.
-
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 …
-
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 …
-
Digital image compression.
… compression. The first is a bit plane image coding system based on a hierarchic quadtree structure in a transmission domain, using the Hadamard transform as a kernel. Good compression has been achieved from this scheme, particularly for images with low detail. The second scheme uses a …
-
Datenkompression für die Auslese des ATLAS Level-1 Triggers
… untersucht. Die Ergebnisse von Simulationen mit Huffman Coding und Run-Length Coding, sowie für zwei speziell für die Nullunterdrückung von verrauschten Daten mit festen Wortgrenzen entwickelten Algorithmen (Huffman-Inspired und Difference Coding), werden vorgestellt. Die Parameter der …
-
Hybrid coding with enhanced RDC and Huffman compression algorithms
… thesis experiment is an exploration of Ross Data Coding (RDC) with several modifications intended to significantly improve compression efficiency. Experimental analysis show the RDC algorithm produces compression efficiency at a comparable level to other well known encoders with exceptionally low …
-
From Encoding to Decoding: Advancing Spiking Neural Network Technology for Improved Learning
… Reconstruction matters for SNNs because spike encoding is inherently lossy: continuous-valued inputs must be discretised into binary events, and without a decoding pathway, there is no way to measure how much information is preserved by this conversion. If critical signal features are lost during …
-
Transform Based And Search Aware Text Compression Schemes And Compressed Domain Text Retrieval
… use lossless methods at the final stage of the encoding stage underscoring the importance of lossless methods for both lossy and lossless compression applications. In order to be able to effectively utilize the full potential of compression techniques for the future retrieval systems, we need …