• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.4
• /
• pp.195-201
• /
• 2024

In this paper, we propose an improved technique called HAB (Huffman encoding Aware Bitpacking) that enhances the Sprintz method, which is a representative time series data compression technique. The proposed technique boosts compression rates by incorporating Huffman encoding-aware bitpacking in the secondary compression stage. Additionally, it can be applied to terminal nodes or edge nodes with limited available resources, as it does not require separate parameters or storage space for compression. The proposed technique is a lossless method and is suitable for fields that require the generation of artificial intelligence models and accurate data analysis. In the experimental evaluation, the proposed HAB showed an average improvement of 14.7% compared to the existing technique in terms of compression rate.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.7
• /
• pp.23-33
• /
• 1996

This paper deals with the design of a recursively-indexed binary code for facsimile soruces and its performance. Sources used here are run-lengths of white pixels form higher-resolution facsimile. The modified huffman code used for G.3 facsimile is chosen for the performance comparison. Experiments confirm the fact that recursive indexing preserves the entropy of a memoryless geometric source: the entropy of recursively-indexed physical surce iwth roughly geometric distributin remains within 2% of the empirical source entropy. The designed recursively-indexed binary codes consist of a code applied to text-type documents and to graphics - type documents is compared iwth that of the modified huffman code. Numerical resutls show that the modified huffman code performs well for text-type documents and not equally well for graphics-tyep documents. On the other hand, recursively-indexed binary codes have shown a better performance for graphics-type documents whose distribution are similar to a geometric distribution. Specifically, the code rates of recursively-indexed binary codes with 60 codewords are from 8% to 20% of the empirical source entropy smaller than that of th emodified huffman code with 91 codewords.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.439-446
• /
• 2011

In this paper, we proposed and implemented a dedicated hardware for Huffman coding which is a method of entropy coding to use compressing multimedia data with video coding. The proposed Huffman codec consists Huffman encoder and decoder. The Huffman encoder converts symbols to Huffman codes using look-up table. The Huffman code which has a variable length is packetized to a data format with 32 bits in data packeting block and then sequentially output in unit of a frame. The Huffman decoder converts serial bitstream to original symbols without buffering using FSM(finite state machine) which has a tree structure. The proposed hardware has a flexible operational property to program encoding and decoding hardware, so it can operate various Huffman coding. The implemented hardware was implemented in Cyclone III FPGA of Altera Inc., and it uses 3725 LUTs in the operational frequency of 365MHz

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.529-531
• /
• 2000

본 논문은 Geometry Compression 분야에서 다뤄지는 압축기법 중 delta encoding 과정을 보완하여 좀 더 높은 압축률을 얻고자 하는 vertex position prediction 과정에 대한 내용으로 구성되어 있다. 이것은 triangle strip 형태의 입력을 받아서 그 vertex data 중 position 정보들간의 delta encoding 과정을 예측 기법을 이용한 encoding 과정으로 대체하여 Huffman encoding 과정에서의 symbol 개수를 줄여 압축률을 향상시키자는 개념에서 출발한다. triangle strip 생성 기법 중 greedy algorithm을 적용한 후, 기존의 parallelogram 방식과 이 논문에서 새로이 제안하는 방식을 비교하여 보다 나은 압축 방식을 제시하는 것이 이 논문의 목적이다. 이 논문에서 제시하는 방식을 실험한 결과, 기존의 예측 기법에 비해 2.4% 정도의 향상을 보여주고 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.545-553
• /
• 2004

Expansion of network environment and multimedia demand universality of application service as HDTV, etc. During these processes, it is essential to process multimedia in real time in the wireless communication system based on mobile phone network and in the wire communication system due to fiber cable and xDSL. So, in this Paper the optimal memory allocation algorithm combines the merit of huffman encoding which is superior in simultaneous decoding ability and lempel-ziv that is distinguished in execution of compress is proposed to improve the channel transmission rate and processing speed in the compressing procedure and is verified in the entropy encoder of HDTV. Because the entropy encoder system using proposed optimal memory allocation algorithm has memory saturation prevention we confirms that the compressing ratio for moving pictures is superior than Huffman encoding and LZW.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.11
• /
• pp.1-10
• /
• 1998

The advent of deep submicron technologies in the age of portable electronic systems creates a moving target for CAB algorithms, which now need to reduce power as well as delay and area in the existing design methodology. This paper presents a resynthesis algorithm for logic decomposition on mapped circuits. The existing algorithm uses a Huffman encoding, but does not consider glitches and effects on logic depth. The proposed algorithm is to generalize the Huffman encoding algorithm to minimize the switching activity of non-critical subcircuits and to preserve a given logic depth. We show how to obtain a transition-optimum binary tree decomposition for AND tree with zero gate delay. The algorithm is tested using SIS (logic synthesizer) and Level-Map (LUT-based FPGA lower power technology mapper) and shows 58%, 8% reductions on power consumptions, respectively.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.1163-1167
• /
• 2018

The selective encryption scheme for canonical Huffman codes using the inversion of bit values is proposed. The symbols are divided into blocks of a certain size, and each symbol in the block is compressed by canonical Huffman coding. Blocks are determined to be sent in the original code or encrypted form. The encryption block inverts the values of the whole bits, and bits of block that do not encrypt are not inverted. Those compressed data are transmitted with the encryption information. It is possible to decrypt the compressed data on the receiving side using the encryption information and compressed data.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.9
• /
• pp.57-64
• /
• 2008

This paper proposes a new test data compression scheme which has good performance. The proposed scheme is composed of adding transition stage and shifting transition stage using don't care remapping technique. The experimental results show that the new scheme provides higher compression ratio than RL-huffman encoding which is the one of the highest performance schemes, and requires smaller hardware overhead. Therefore it can be widely used as a practical solution for test data compression.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.705-708
• /
• 2005

Mobile Mapping Systems using the vehicle equipped the GPS, IMU, CCD Cameras is the effective system for the management of the road facilities, update of the digital map, and etc. They must provide users with the sensor data which is acquired by Mobile Mapping Systems in real-time so that users can process what they want by using the latest data. But it' s not an easy process because the amount of sensor data is very large, particularly image data to be transmitted. So it is necessary to reduce the amount of image data so that it is transmitted effectively. In this study, the effective method was suggested for the compression/decompression image data using the Wavelet Transformation and Huffman Coding. This technique will be possible to transmit of the geographic information effectively such as position data, attitude data, and image data acquired by Mobile Mapping Systems in the wireless internet environment when data is transmitted in real-time.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.262-264
• /
• 1999

본 논문은 IJG(Independent JPEG Group)의 JPEG 부호기의 처리 과정과 동작을 기술한다. IJG JPEG 부호기의 구조는 color conversion, downsampling, preprocessing 과정과 MCU 처리, FDCT, quantization, entropy encoding(sequential 혹은 progressive, huffman 혹은 arithmetic)의 실제적인 JPEG 압축 과정인 JPEG proper로 구성된다. 또한 이러한 모듈들외에 시스템 전체 controller, marker 생성기, 기억장소 관리, 에러 처리를 위한 모듈들을 포함하고 있다. 이에 본 논문에서는 IJG JPEG 부호기의 전체 시스템 구조 및 controller 와 주요 모듈간 인터페이스, 시스템에서 사용하는 주요 자료 구조에 대하여 분석하고자 한다.