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 365 for “"Huffman"”.

  1. 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 …

    nps Repository record for Modification of Huffman Coding. (opens in a new tab)

  2. Huffman Approach to Opcode Compression

    … achieved. This thesis is an attempt to perform Huffman compression of instructions with the goal of achieving reasonable opcode compression, without overcomplicating the architecture. The Motorola 68HCI I was used as a baseline for the design, but the same methods can be applied to like …

    odu Repository record for Huffman Approach to Opcode Compression (opens in a new tab)

  3. Performance of Delta Huffman Compression Variants

    … that is a combination of the Elias Delta and Huffman algorithms known as δ-Huffman. Exploiting the fact that Elias Delta codes are uniquely decodable and tend to allocate fewer bits to small integers, while Huffman coding is a lossless compression method that provides compressed symbols with a …

    texas-state Repository record for Performance of Delta Huffman Compression Variants (opens in a new tab)

  4. 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 …

    texas Repository record for Scan test data compression using alternate Huffman coding (opens in a new tab)

  5. Application of Huffman Data Compression Algorithm in Hashing Computation

    … 2005]. The purpose of this study is to apply Huffman data compression algorithm to the SHA-1 hash function in cryptography. Huffman data compression algorithm is an optimal compression or prefix algorithm where the frequencies of the letters are used to compress the data [Huffman, 1952]. An …

    wku-diss Repository record for Application of Huffman Data Compression Algorithm in Hashing Computation (opens in a new tab)

  6. Hybrid coding with enhanced RDC and Huffman compression algorithms

    … the hybrid combines RDC coding with Adaptive Huffman coding. This thesis reviews background information of data compression as it pertains to this thesis. A preliminary analysis yields performance results of several traditional compression algorithms along with RDC coding. The analysis focuses …

    eastern-wash Repository record for Hybrid coding with enhanced RDC and Huffman compression algorithms (opens in a new tab)

  7. Lossless compression using binary necklace classes and multiple huffman trees

    … Our Indexed Tree Approach (ITA) also uses a Huffman forest, but disperses bit strings via a simpler mechanism based upon the first few bits of each string. For text compression, we find RTA to be competitive with standard Huffman encoding while ITA is generally superior by a small margin of …

    nps Repository record for Lossless compression using binary necklace classes and multiple huffman trees (opens in a new tab)

  8. Studies in Conjugation: Huffman Tree Construction, Nonlinear Recurrences, and Permutation Networks

    Made available in DSpace on 2014-12-13T18:02:07Z (GMT). No. of bitstreams: 1 7913571.pdf: 6291041 bytes, checksum: 2dcb006e5f0759a6f113324457fb606d (MD5) Previous issue date: 1978

    uiuc Repository record for Studies in Conjugation: Huffman Tree Construction, Nonlinear Recurrences, and Permutation Networks (opens in a new tab)

  9. 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. …

    texas Repository record for An efficient test vector compression scheme using base vector extraction and Huffman coding (opens in a new tab) Restricted access

  10. Implementation of linear predictive and Huffman coding algorithms for real time data compression

    … 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 dedicated …

    ut-knoxville Repository record for Implementation of linear predictive and Huffman coding algorithms for real time data compression (opens in a new tab)

  11. Cascading LZW algorithm with Huffman coding : a variable to variable length compression algorithm

    … the LZW , variable to fixed , coding with the Huffman , fixed to variable , coding. In this work we consider the effective way of performing this cascading , to optimize the compression using limited time resourses.</p>

    njit Repository record for Cascading LZW algorithm with Huffman coding : a variable to variable length compression algorithm (opens in a new tab)

  12. 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 …

    chalmers Repository record for Design and implementation of a decompression engine for a Huffman-based compressed data cache (opens in a new tab)

  13. Extensive Huffman-tree-based neural network for the imbalanced dataset and its application in accent recognition

    … classes, this thesis proposed an Extensive Huffman-Tree Neural Network (EHTNN), which fabricates multiple component neural network-enabled classifiers (e.g., CNN or SVM) using an extensive Huffman tree. Any given node in EHTNN can have arbitrary number of children. Compared with the Binary …

    utc Repository record for Extensive Huffman-tree-based neural network for the imbalanced dataset and its application in accent recognition (opens in a new tab)

  14. 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 …

    nps Repository record for Reduction in bandwidth and buffer size by using modified Huffman coding after dropping the less frequent source symbols (opens in a new tab)

  15. Reduction in bandwidth by using variable length codes

    … 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 delay during transmission and decoding respectively for on-line communication. This research examines …

    nps Repository record for Reduction in bandwidth by using variable length codes (opens in a new tab)

Page 1 of 19