[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Huang et al., 2008 - Google Patents

Hardware design for accelerating PNG decode

Huang et al., 2008

Document ID
3461906001991496423
Author
Huang S
Zheng T
Publication year
Publication venue
2008 IEEE International Conference on Electron Devices and Solid-State Circuits

External Links

Snippet

This paper discusses a hardware accelerated implementation for PNG image decoding within LZ77 and Huffman compression algorithm without any distortion, while compare with software decoding, parallel processing is the most significant feature of high efficiency. This …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G06F17/21—Text processing
    • G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding, e.g. from bit-mapped to non bit-mapped
    • G06T9/005—Statistical coding, e.g. Huffman, run length coding
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits

Similar Documents

Publication Publication Date Title
Miller et al. Variations on a theme by Ziv and Lempel
Adjeroh et al. The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching
US20110181448A1 (en) Lossless compression
CA2270472A1 (en) Computer sorting system for data compression
CN104811209B (en) A kind of the compressed file data embedding method and device of anti-most long matching detection
Kida et al. A unifying framework for compressed pattern matching
Thomborson The V. 42bis standard for data-compressing modems
US20100321218A1 (en) Lossless content encoding
CN1426629A (en) Method and apparatus for optimized lossless compression using plurality of coders
Al-Hashemi et al. A new lossless image compression technique based on Bose, Chandhuri and Hocquengham (BCH) codes
Huang et al. Hardware design for accelerating PNG decode
Shanmugasundaram et al. IIDBE: A lossless text transform for better compression
Al-Bahadili et al. A bit-level text compression scheme based on the ACW algorithm
Kim et al. Hardware-accelerated fast lossless compression based on LZ4 algorithm
Wu et al. Error-resilient LZW data compression
Hon et al. On entropy-compressed text indexing in external memory
Shanmugasundaram et al. Text preprocessing using enhanced intelligent dictionary based encoding (EIDBE)
Rigler FPGA-based lossless data compression using GNU Zip
Kadhem Text steganography method based on modified run length encoding
Nong et al. Efficient algorithms for the inverse sort transform
Li et al. On the security of a secure Lempel-Ziv-Welch (LZW) algorithm
Wang et al. Prefix Coding Scheme Supporting Direct Access Without Auxiliary Space
Bassiouni et al. Enhancing arithmetic and tree-based coding
Nithya et al. The Study of Text Compression Algorithms and their Efficiencies Under Different Types of Files
Wang et al. Internet-oriented optimization schemes for joint compression and encryption