Huffman-based code compression techniques for embedded processors

Abstract

The size of embedded software is increasing at a rapid pace. It is often challenging and time consuming to fit an amount of required software functionality within a given hardware resource budget. Code compression is a means to alleviate the problem by providing substantial savings in terms of code size. In this article we introduce a novel and efficient hardware-supported compression technique that is based on Huffman Coding. Our technique reduces the size of the generated decoding table, which takes a large portion of the memory. It combines our previous techniques, Instruction Splitting Technique and Instruction Re-encoding Technique into new one called Combined Compression Technique to improve the final compression ratio by taking advantage of both previous techniques. The instruction Splitting Technique is instruction set architecture (ISA)-independent. It splits the instructions into portions of varying size (called patterns) before Huffman coding is applied. This technique improves the final compression ratio by more than 20% compared to other known schemes based on Huffman Coding. The average compression ratios achieved using this technique are 48% and 50% for ARM and MIPS, respectively. The Instruction Re-encoding Technique is ISA-dependent. It investigates the benefits of reencoding unused bits (we call them reencodable bits) in the instruction format for a specific application to improve the compression ratio. Reencoding those bits can reduce the size of decoding tables by up to 40%. Using this technique, we improve the final compression ratios in comparison to the first technique to 46% and 45% for ARM and MIPS, respectively (including all overhead that incurs). The Combined Compression Technique improves the compression ratio to 45% and 42% for ARM and MIPS, respectively. In our compression technique, we have conducted evaluations using a representative set of applications and we have applied each technique to two major embedded processor architectures, namely ARM and MIPS.

Enhancing dental bitewing radiograph datasets: a preprocessing approach for AI detection and diagnoses

“…The optimization of dataset quality, especially for real-time AI-based dental bitewing radiograph detection, is the main focus of this paper. Our goal is to improve dental radiograph interpretation accuracy and efficiency by utilizing AI technology, which will help with early diagnosis and treatment [11][12][13][14][15][16][17].…”

An Efficient and Fast VLIW Compression Scheme for Stream Processor

“…As the Huffman coding applied to MIPS and RISC instruction can reduce the code size effectively. Bonny et al [24]applied the Huffman coding to compress code for embedded system and achieved the average compression ratio of 48%. Rahman et al [25] [26] proposed two lossless compression schemes for image, the first one is based on Huffman coding and obtained a compression ratio of 44.8%, the other one is based on Huffman coding and binary coding, and achieved execution time reduction.…”

NeuroChaosCrypt: Revolutionizing Chaotic-Based Cryptosystem With Artificial Neural Networks—A Comparison With Traditional Cryptosystems

“…Field-Programmable Gate Arrays (FPGAs) offer a versatile platform for efficient and secure encryption system implementation [26], [27]. They provide high-speed parallel processing and can implement complex encryption algorithms in real-time, ideal for applications requiring fast and secure data processing [28]- [30].…”