检索结果-内蒙古大学图书馆

Variants of golomb coding and the n-ary Versions

IEEE TRANSACTIONS ON COMMUNICATIONS 2020年第12期68卷 7460-7472页

作者： Wang, Na Lin, Sian-Jheng Han, Yunghsiang S. Yu, Nenghai Univ Sci & Technol China Sch Informat Sci & Technol Hefei 230026 Peoples R China Dongguan Univ Technol Sch Elect Engn & Intelligentizat Dongguan 523808 Peoples R China

golomb coding is a type of entropy encoding scheme for geometric distributions. It consists of two parts, and both parts are coded with variable-length coding, which requires a higher computational effort than fixed-length coding schemes. To solve this issue, the first part of this article presents a variant of golomb coding that uses fixed-length coding to code the first part. The simulations show that the proposed coding scheme has a higher throughput than golomb coding, due to the reduction of arithmetic complexity. In the second part, we discuss the n-ary versions of golomb coding and the proposed coding scheme.

关键词： Image coding Entropy Throughput Huffman coding Decoding Receivers Entropy encoding golomb coding Geometric distribution

来源：评论

学校读者我要写书评

暂无评论

Wavelet Image Encoder using Modified Simple Bit-plane with Run-length coding and golomb coding 12

Wavelet Image Encoder using Modified Simple Bit-plane with R...

引用

International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)

作者： Ngamsritus, Jeerachon Lamsrichan, Poonlap Kasetsart Univ Dept Elect Engn Fac Engn Bangkok 10900 Thailand

ISBN: (纸本)9781479979615

The Hybrid encoder is trying to choose the better encoder between the Wavelet Difference Reduction (Type-W) and Simple Bit-plane (Type-B) to get the better results than pure Type-W or pure Type-B was proposed in previous research. In case that the most pixels are insignificant, Type-B will generate a long consecutive sequence of zero bits. By experimental results, the Modified Simple Bit-plane which is the combination of Run-length encoding and golomb encoding (Type-G) can improve the efficiency of the output bits sequence. The New Hybrid encoder which automatically chooses one of encoding type from the Type-W, Type-B and Type-G in each bit-plane of each subband should get the better results than the previously proposed Hybrid algorithm in each bit-plane of each subband. The proposed coder is evaluated for the performance in this paper.

关键词： Hybrid encoder New Hybrid encoder Simple Bitplane encoding WDR Run-length coding golomb coding

来源：评论

学校读者我要写书评

暂无评论

A Real-Time Lossless Compression Method for Harmonic Phasor Measurement Data Based on golomb coding 4

A Real-Time Lossless Compression Method for Harmonic Phasor ...

引用

4th IEEE International Conference on Power, Electronics and Computer Applications, ICPECA 2024

作者： Jiao, Hao Li, Yuxuan Wang, Qingpeng Shan, Baofeng Zeng, Yiming Jin, Zongshuai Extrahigh Voltage Company State Grid Shandong Electric Power Company Shandong Jinan China School of Electrical Engineering Shandong University Shandong Jinan China

ISBN: (纸本)9798350359589

The harmonic distortion of commutation voltage is one of the important factors that increase the risk of commutation failure. Efficient acquisition and analysis of time-varying harmonic data are crucial prerequisites for analyzing the trends in maximum commutation overlap area and predicting commutation failure. This paper proposes a real-time compression method for harmonic phasor measurement data to improve the harmonic data processing efficiency. Firstly, the characteristics of harmonic data and the phasor angle transformation method are analyzed. Subsequently, a data classification method is introduced, along with a precision-based normalization technique to handle data from different frequency components. Following this, differential coding and golomb coding are adopted to process measurement data originating from identical frequency components. Finally, the compressed coding values of all frequency components at that moment are assembled. The compression algorithm is tested using a historical dataset of harmonic measurements from a high voltage direct current transmission station. The results demonstrate the method's superior capability in effectively compressing frequency, amplitude, and phasor angle values of the harmonic measurement data. © 2024 IEEE.

关键词： golomb coding Harmonic lossless compression power system

来源：评论

学校读者我要写书评

暂无评论

FPGA bitstream compression and decompression using LZ and golomb coding (abstract only) 13

FPGA bitstream compression and decompression using LZ and go...

引用

Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays

作者： Jinsong Mao Hao Zhou Haijiang Ye Jinmei Lai University of Fudan ShangHai China

ISBN: (纸本)9781450318877

In this paper we propose an optimized bitstream compression algorithm based on LZ and a novel architecture of decompressor, the proposed algorithm improves the Compression Ratio by fully utilizing the regularity of configuration bits of CLB (Configurable Logic Box) in FPGA and using the variable length golomb coding method. The experimental results show that the Optimized method can improve the Compression Ratio of LZSS by 32.3% for bitstream with high regularity and 10.3% for bitstream with low regularity, and our approach shows a higher flexibility than the BMC+RLE arithmetic when compressing the bitstream with high regularity for various FPGA. Moreover, we design a two-buffer-window decompressor to download the compressed bitstreams. In order to increase the throughput of the proposed decompressor, we design a multi-stage data selector in it. The post-simulation of the decompressor shows that its throughput is up to 9280 Mbps under 65nm CMOS process. And that is 4352Mbps when verified on a Virtex-5 FPGA.

关键词： decompression LZ golomb coding FPGA bitstream compression

来源：评论

学校读者我要写书评

暂无评论

Chain code compression with modified interpolative coding

引用

COMPUTERS & ELECTRICAL ENGINEERING 2019年 77卷 27-36页

作者： Zalik, Borut Zalik, Krista Rizman Zupancic, Eva Lukac, Niko Zalik, Mitja Mongus, Domen Univ Maribor Fac Elect Engn & Comp Sci Koroska Cesta 46 SI-2000 Maribor Slovenia

A lossless chain code compression algorithm consisting of Burrows-Wheeler Transform, Move-To-Front Transform, and a modified interpolative coding is presented in this paper. The interpolative coding divides a strictly increasing array of integers and encodes the middle element recursively, where the required number of bits is obtained from the difference of the array's border values. In this paper, it is shown that, for some intervals, golomb coding is more efficient than the interpolative coding. This fact was used to construct a hybrid approach that yields slightly better compression results than the state-of-the-art while compressing Three OrThogonal chain code, Freeman chain code in four and eight directions, and Vertex Chain Code. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Algorithm Chain codes Lossless compression golomb coding

来源：评论

学校读者我要写书评

暂无评论

Application of arithmetic coding to compression of VLSI test data

引用

IEEE TRANSACTIONS ON COMPUTERS 2005年第9期54卷 1166-1177页

作者： Hashempour, H Lombardi, F LTX Corp IC Dev & Appl Res San Jose CA 95134 USA Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

This paper proposes arithmetic coding for application to data compression for VLSI testing. The use of arithmetic codes results in a codeword whose length is close to the optimal value (as predicted by entropy in information theory), thus achieving a higher compression. Previous techniques (such as those based on Huffman or golomb coding) result in optimal codes for data sets in which the probability model of the symbols satisfies specific requirements. This paper shows empirically and analytically that Huffman and golomb codes can result in a large difference between the bound established by the entropy and the attained compression;therefore, the worst-case difference is studied using information theory. Compression results for arithmetic coding are presented using ISCAS benchmark circuits;a practical integer implementation of arithmetic coding/decoding and an analysis of its deviation from the entropy bound are pursued. A software implementation is proposed using embedded DSP cores. In the experimental evaluation, fully specified test vectors and test cubes from two different ATPG programs are utilized. The implications of arithmetic coding on manufacturing test using an ATE are also investigated.

关键词： test data compression golomb coding Huffman coding arithmetic coding SoC ATE

来源：评论

学校读者我要写书评

暂无评论

Bit Stream Compression Using Self-Adaptive EFDR coding 13

Bit Stream Compression Using Self-Adaptive EFDR Coding

引用

2016 13th IEEE International Conference on Solid-State and Integrated Circuit Technology (ICSICT)

作者： Tiandong Zhao Tianjiao Li Minwoo Nho Xiaofang Zhou Department of Electronic Engineering Fudan University Samsung Electronics Co. Ltd. State Key Labs.of ASIC &Systems Fudan University

ISBN: (纸本)9781467397209

With the rapid increase in the scale and complexity of circuits and systems, the storage of large amounts of output bit stream, which is the sequence of 0s and 1s, has become a severe problem. As the cost of data storage is high typically for FPGA reconfiguration stream, a particular compression algorithm needs to be introduced to minimize the data size. However current compression schemes either compromise to hardware overhead or lack adaption to different cases. This paper is to propose an improved scheme. Dictionary compression scheme based on bitmask is implemented on the source stream to find the analogous segments in the bit stream. Meanwhile, we make the selection and use run-length coding to achieve further compression. This paper is to present a novel Self-Adaptive Extended Frequency-Directed Run-Length（SA-EFDR）coding to improve the compression ratio by 15%in best case compared to golomb coding. Also our coding can make self-adaption to different cases. Improvement has been verified with typical benchmarks from ISCAS’89benchmarks.

关键词： Bit stream compression golomb coding SA-EFDR coding FPGA

来源：评论

学校读者我要写书评

暂无评论

Split field coding: low complexity, error-resilient entropy coding for image compression

Split field coding: low complexity, error-resilient entropy ...

引用

Conference on Applications of Digital Image Processing XXXI

作者： Meany, James J. Martens, Christopher J. Boeing St Louis MO 63166 USA

ISBN: (纸本)9780819472939

In this paper, we describe split field coding, an approach for low complexity, error-resilient entropy coding which splits code words into two fields: a variable length prefix and a fixed length suffix. Once a prefix has been decoded correctly, then the associated fixed length suffix is error-resilient, with bit errors causing no loss of code word synchronization and only a limited amount of distortion on the decoded value. When the fixed length suffixes are segregated to a separate block, this approach becomes suitable for use with a variety of methods which provide varying protection to different portions of the bitstream, such as unequal error protection or progressive ordering schemes. Split field coding is demonstrated in the context of a wavelet-based image codec, with examples of various error resilience properties, and comparisons to the rate-distortion and computational performance of JPEG 2000.

关键词： entropy coding golomb coding Rice coding start-step coding error resilience image compression wavelet compression JPEG 2000

来源：评论

学校读者我要写书评

暂无评论

Enhancing WBAN Data Transmission: A Lightweight Approach With Fixed Binary golomb Compression and Symmetric Mutual Authentication Protocol

引用

International Journal of Communication Systems 2025年第9期38卷

作者： Kavya Sabapathy Praveen Kumar Ramajayam Department of Electronics and Communication Engineering Easwari Engineering College Ramapuram Chennai Tamil Nadu India

Wireless body area networks (WBAN) containing wearable sensing medical devices have enticed huge attention by providing high-quality medical services to people without restraint in their day-to-day activities. WBAN monitors elderly people or patients suffering from any long-lasting diseases from their place without being hospitalized, saving critical time transportation delays and admission costs. Wireless medical devices are attached or implanted in the human body to sense medical-related data and further transmit it for medical services in an unsecured wireless medium. These sensing medical devices are miniature-sized with a limited battery source, so energy should be exploited carefully. The sensing devices deplete their energy more during data transmission. Efficient energy exploitation and assuring data security and privacy in WBAN are highly recommended. Data to be transmitted from the sensing device are compressed before transmission to reduce the number of data transmissions and save energy. In this paper, to attain efficient energy exploitation, Lightweight Fixed Binary golomb (LFBG) data compression is performed at each sensor before transmission, and further to guarantee the privacy and security of the data, Lightweight Symmetric Mutual Authentication (LSMA) protocol is implemented. The LFBG compression with the least computation saves up to 84% of energy, and LSMA with the least computation and transmission authenticates and also shares the session key securely.

关键词： authentication and key distribution compression golomb coding Lightweight Fixed Binary golomb compression Lightweight Symmetric Mutual Authentication protocol privacy security

来源：评论

学校读者我要写书评

暂无评论

Subsample-based image compression for capsule endoscopy

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2013年第1期8卷 5-19页

作者： Khan, Tareq Hasan Wahid, Khan A. Univ Saskatchewan Dept Elect & Comp Engn Saskatoon SK S7N 5A9 Canada

The key design challenge in capsule endoscopic system is to reduce the area and power consumption while maintaining acceptable video quality. In this paper, a subsample-based image compressor for such endoscopic application is presented. The algorithm is developed around some special features of endoscopic images. It consists of a differential pulse coded modulation followed by golomb-rice coding. Based on the nature of endoscopic images, several subsampling schemes on the chrominance components are applied. This scheme is particularly suitable to work with any commercial low-power image sensors that outputs image pixels in a raster scan fashion, eliminating the need of memory buffer, as well as temporary storage (as needed in transform coding schemes). An image corner clipping algorithm is also presented. The reconstructed images have been verified by medical doctors for acceptability. The proposed algorithm has a very low complexity and is suitable for the VLSI implementation. Compared to other transform-based algorithms targeted to capsule endoscopy, the proposed raster-scan-based scheme performs very strongly with a compression ratio of 80% and a very high reconstruction PSNR (over 45 dB).

关键词： Differential pulse coded modulation Capsule endoscopic application golomb coding Image compression

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：