Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Reducing latch count to save hardware area for dynamic huffman table generation

A Huffman coding, dynamic technique used in instrumentation, computing, data transformation, etc., to solve problems such as area power and expensive timing/wiring

Pending Publication Date: 2021-09-07
IBM CORP
View PDF0 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Sequencing symbol counts (frequency) during the process is expensive in terms of area (number of latches and width comparators required), power, and timing / wiring considerations

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Reducing latch count to save hardware area for dynamic huffman table generation
  • Reducing latch count to save hardware area for dynamic huffman table generation
  • Reducing latch count to save hardware area for dynamic huffman table generation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] Various embodiments of the invention are described herein with reference to the associated drawings. Alternative embodiments of the invention may be devised without departing from the scope of the invention. In the following description and drawings, various connections and positional relationships (eg, above, below, adjacent, etc.) are set forth between elements. Unless stated otherwise, such connections and / or positional relationships may be direct or indirect, and the invention is not intended to be limited in this regard. Accordingly, the coupling of entities may refer to direct or indirect coupling, and the positional relationship between entities may be a direct or indirect positional relationship. Furthermore, the various tasks and process steps described herein can be incorporated into a more comprehensive procedure or process having additional steps or functionality not described in detail herein.

[0029] The following definitions and abbreviations are used ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

Embodiments of the invention are directed to a DEFLATE compression accelerator and to a method for reducing a latch count required for symbol sorting when generating a dynamic Huffman table. The accelerator includes an input buffer and a Lempel-Ziv 77 (LZ77) compressor communicatively coupled to an output of the input buffer. The accelerator further includes a Huffman encoder communicatively coupled to the LZ77 compressor. The Huffman encoder includes a bit translator. The accelerator further includes an output buffer communicatively coupled to the Huffman encoder.

Description

Background technique [0001] This invention relates to digital computer systems, and more particularly, to digital data compression and decompression schemes employed in digital computer systems. [0002] Digital computer systems perform data compression to achieve more efficient use of limited storage space. Computer systems typically include hardware components called compression accelerators that accept requests for work or data from a host system to compress or decompress one or more blocks of the requested data. When designing an accelerator to perform compression, there is a trade-off between the size of the input data to be compressed compared to the possible compression ratio and the latency incurred by the compressed data. [0003] Compression accelerators typically utilize the "DEFLATE" algorithm, which is a lossless compression scheme that combines a Lempel-Ziv (eg, LZ77) compression algorithm with a Huffman coding algorithm to perform compression. The computationa...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H03M7/40H03M7/30
CPCH03M7/405H03M7/4062H03M7/3086H03M7/6011H03M7/6058G06F5/01G06F5/012H03M7/40
Inventor B·阿巴利A·米什拉S·普萨拉
Owner IBM CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com