4.6 Article

Increasing the Huffman generation code algorithm to equalize compression ratio and time in lossless 16-bit data archiving

Related references

Note: Only part of the references are listed.
Article Engineering, Electrical & Electronic

A High-Throughput VLSI Architecture Design of Canonical Huffman Encoder

Zhenyu Shao et al.

Summary: In this paper, a high-throughput Huffman encoder VLSI architecture based on the Canonical Huffman method is proposed. The architecture utilizes parallel computing to improve encoding efficiency and reduce encoding time. Experimental results showed that the proposed architecture outperformed existing Huffman encoders using the standard algorithm in terms of encoding time, indicating significant advantages for encoding various data sizes.

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS (2022)

Article

Comprehensive Review on Lossy and Lossless Compression Techniques

S. Elakkiya et al.

Journal of The Institution of Engineers (India): Series B (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Building a Big Data Oriented Architecture for Enterprise Integration

Le Hoang Nam et al.

Summary: Digital transformation is crucial for companies across all industries, requiring flexible architecture and forward-thinking planning. The use of Microservice architecture is highlighted for its practicality in dealing with big data and various aspects of data systems. This study presented an enterprise integration solution for a large corporation, demonstrating the importance of comprehensive systems in enhancing work performance and quality.

COOPERATIVE DESIGN, VISUALIZATION, AND ENGINEERING (CDVE 2021) (2021)

Review Computer Science, Information Systems

A survey on data compression techniques: From the perspective of data quality, coding schemes, data type and applications

Uthayakumar Jayasankar et al.

Summary: The explosive growth of data in the digital world has led to the development of efficient data compression techniques to minimize storage and transmission requirements. Various approaches have been developed, and a detailed survey has been conducted to address current data quality needs, coding schemes, data types, and applications. Comparative analysis has been performed, and future research directions have been highlighted.

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Learning Better Lossless Compression Using Lossy Compression

Fabian Mentzer et al.

2020 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) (2020)

Proceedings Paper Computer Science, Software Engineering

Weighted Adaptive Huffman Coding

Aharon Fruchtman et al.

2020 DATA COMPRESSION CONFERENCE (DCC 2020) (2020)

Article Computer Science, Information Systems

Broth: A General-Purpose Data Compressor

Jyrki Alakuijala et al.

ACM TRANSACTIONS ON INFORMATION SYSTEMS (2019)

Proceedings Paper Computer Science, Artificial Intelligence

Storage Performance Prediction

Qiang Li et al.

PROCEEDINGS OF 2019 IEEE 10TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS 2019) (2019)

Article Computer Science, Artificial Intelligence

Image compression techniques: A survey in lossless and lossy algorithms

A. J. Hussain et al.

NEUROCOMPUTING (2018)

Article Computer Science, Interdisciplinary Applications

Evaluation and combination of pitch estimation methods for melody extraction in symphonic classical music

Juan J. Bosch et al.

JOURNAL OF NEW MUSIC RESEARCH (2016)

Article Computer Science, Artificial Intelligence

ZCR-aided neurocomputing: A study with applications

Rodrigo Capobianco Guido

KNOWLEDGE-BASED SYSTEMS (2016)

Article Computer Science, Interdisciplinary Applications

H-HIBASE: Compression Enhancement of HIBASE Technique Using Huffman Coding

Ahsan Habib et al.

JOURNAL OF COMPUTERS (2013)

Article Computer Science, Software Engineering

A fast algorithm for Huffman decoding based on a recursion Huffman tree

Yih-Kai Lin et al.

JOURNAL OF SYSTEMS AND SOFTWARE (2012)

Article Computer Science, Information Systems

Minimum Expected Length of Fixed-to-Variable Lossless Compression Without Prefix Constraints

Wojciech Szpankowski et al.

IEEE TRANSACTIONS ON INFORMATION THEORY (2011)

Article Mathematics, Applied

Joint compression and encryption using chaotically mutated Huffman trees

Houcemeddine Hermassi et al.

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION (2010)

Article Automation & Control Systems

A Bit-level Text Compression Scheme Based on the ACW Algorithm

Hussein Al-Bahadili et al.

INTERNATIONAL JOURNAL OF AUTOMATION AND COMPUTING (2010)

Article Computer Science, Hardware & Architecture

An architecture for storage-hosted application extensions

D. Chambliss et al.

IBM JOURNAL OF RESEARCH AND DEVELOPMENT (2008)

Article Computer Science, Hardware & Architecture

Test data compression based on variable-to-variable Huffman encoding with codeword reusability

Xrysovalantis Kavousianos et al.

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS (2008)

Article Computer Science, Information Systems

A general framework for codes involving redundancy minimization

MB Baer

IEEE TRANSACTIONS ON INFORMATION THEORY (2006)

Article Computer Science, Information Systems

An efficient decoding technique for Huffman codes

RA Chowdhury et al.

INFORMATION PROCESSING LETTERS (2002)