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

IEEE TRANSACTIONS ON INFORMATION THEORY 1999年第7期45卷 2612-2615页

作者： Ryabko, BY Sharova, MP Siberian State Acad Telecommun & Comp Sci Novosibirsk 630102 Russia Novosibirsk State Univ Novosibirsk 630102 Russia

The problem of coding low-entropy information sources is considered. Since the run-length code was offered about 50 years ago by Shannon, it is known that for such sources there Exist coding methods much simpler than for sources of a general type. However, known coding methods of low-entropy sources do not reach the given redundancy. In this correspondence, a new method of coding low-entropy sources is offered. It permits a given redundancy r with almost the same encoder and decoder memory size as that obtained by Ryabko for general methods, while encoding and decoding much faster.

关键词： complexity of coding fast algorithm low-entropy sources redundancy run-length coding

来源：评论

学校读者我要写书评

暂无评论

A data compression technique based on Reversed Leading Bits coding and Huffman coding 10

A data compression technique based on Reversed Leading Bits ...

引用

10th International Conference on Communications and Networking in China (CHINACOM)

作者： Ren, Haoqi Tongji Univ Sch Elect & Informat Shanghai 200092 Peoples R China

ISBN: (纸本)9781479987955

In this paper, a new test data compression technique is proposed. The compression is achieved by reversed leading bits coding together with Huffman coding (RLBC-HC). RLBC-HC fills the don't-care bit with the value of the bit before it at first. Then the test data is divided into codeword segments for pattern matching to generate corresponding symbols. With a proper number of patterns, the number of different symbols and the hardware complexity can be well balanced. Finally, Huffman coding is adopted upon those symbols to achieve high compression ratio. Experimental results demonstrate that the RLBC-HC technique can achieve better compression ratio on average over the other compression schemes.

关键词： test data compression Huffman coding run-length coding

来源：评论

学校读者我要写书评

暂无评论

Wavelet based hierarchical coding scheme for radar image compression

Wavelet based hierarchical coding scheme for radar image com...

引用

Conference on Medical Imaging, Parallel Processing of Images, and Optimization Techniques

作者： Sheng, Wen Jiao, Xiaoli He, Jifeng Air Force Radar Acad Dept Early Warning & Detecting Equipment Wuhan 430019 Peoples R China 23 Res Inst Mil Representat Off Beijing 100871 Peoples R China

ISBN: (纸本)9780819469533

This paper presents a wavelet based hierarchical coding scheme for radar image compression. Radar signal is firstly quantized to digital signal, and reorganized as raster-scanned image according to radar's repeated period frequency. After reorganization, the reformed image is decomposed to image blocks with different frequency band by 2-D wavelet transformation, each block is quantized and coded by the Huffman coding scheme. A demonstrating system is developed, showing that under the requirement of real time processing, the compression ratio can be very high, while with no significant loss of target signal in restored radar image.

关键词： image compression radar image wavelet decomposition run-length coding Huffman coding

来源：评论

学校读者我要写书评

暂无评论

A Test Vector Compression/Decompression Scheme Based on Logic Operation between Adjacent Bits (LOBAB) coding

A Test Vector Compression/Decompression Scheme Based on Logi...

引用

15th Pacific Rim International Symposium on Dependable Computing

作者： Liang, Huaguo Zhan, Wenfa Luo, Qiang Jiang, Cuiyun Anqing Normal Coll Dept Educ Technol Anqing Anhui Peoples R China Hefei Univ Technol Sch Elect Sci & Appl Phys Hefei Anhui Peoples R China Hefei Univ Technol Sch Comp & Informat Hefei Anhui Peoples R China

ISBN: (纸本)9780769538495

A new test vector compression/decompression scheme, namely a scheme of Logic Operation between Adjacent Bits (LOBAB) is presented, which is based on bitwise logic operation between itself and its previous bit. It turns all kinds of series including continuous series, such as a series of all Os and all Is, and reversal series, such as a series of 01 and 10, into series of all Os by logic operation between adjacent bits. On one hand, the two kinds of series, continuous series and reversal series, are both taken into account, which decreases the number of division to the original test data. On the other hand, all series are turned into series of all Os, which cases the process of encoding and decoding. Compared with other already known schemes this scheme has some characteristics, such as high compression ratio, easy control and implementation. The performance of the algorithm is mathematically analyzed and its merits are experimentally confirmed on the larger examples of the ISCAS89 benchmark circuits.

关键词： Test data compression run-length coding Frequency-directed run-length code Alternation and run-length code

来源：评论

学校读者我要写书评

暂无评论

LOW-COMPLEXITY VECTOR SOURCE coding FOR DISCRETE LONG SEQUENCES WITH UNKNOWN DISTRIBUTIONS 49

LOW-COMPLEXITY VECTOR SOURCE CODING FOR DISCRETE LONG SEQUEN...

引用

49th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Woldemariam, Leah Liu, Hang Scaglione, Anna Cornell Univ Dept Elect & Comp Engn Cornell Tech Ithaca NY 14850 USA

ISBN: (纸本)9798350344868;9798350344851

In this paper, we propose a source coding scheme that represents data from unknown distributions through frequency and support information. Existing encoding schemes often compress data by sacrificing computational efficiency or by assuming the data follows a known distribution. We take advantage of the structure that arises within the spatial representation and utilize it to encode run-lengths within this representation using Golomb coding. Through theoretical analysis, we show that our scheme yields an overall bit rate that nears entropy without a computationally complex encoding algorithm and verify these results through numerical experiments.

关键词： Data compression run-length coding vector coding bit analysis

来源：评论

学校读者我要写书评

暂无评论

Fast coding of low-entropy sources

Fast coding of low-entropy sources

引用

IEEE International Symposium on Information Theory

作者： Ryabko, BY Sharova, MP Siberian State Acad Telecommun & Comp Sci Novosibirsk 630102 Russia Novosibirsk State Univ Novosibirsk 630102 Russia

ISBN: (纸本)0780350006

关键词： complexity of coding fast algorithm low-entropy sources redundancy run-length coding

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Compression Method for Compound Power Quality Disturbance Signals in Active Distribution Networks

引用

Journal of Modern Power Systems and Clean Energy 2023年第6期11卷 1902-1911页

作者： Xiangui Xiao Kaicheng Li Chen Zhao State Key Laboratory of Advanced Electromagnetic Engineering and Technology School of Electrical and Electronic EngineeringHuazhong University of Science and TechnologyWuhan 430074China College of Mechanical and Electrical Engineering Fujian Agriculture and Forest UniversityFuzhou 350002China

In the compression of massive compound power quality disturbance(PQD) signals in active distribution networks, the compression ratio(CR) and reconstruction error(RE) act as a pair of contradictory indicators, and traditional compression algorithms have difficulties in simultaneously satisfying a high CR and low RE. To improve the CR and reduce the RE, a hybrid compression method that combines a strong tracking Kalman filter(STKF), sparse decomposition, Huffman coding, and run-length coding is proposed in this study. This study first uses a sparse decomposition algorithm based on a joint dictionary to separate the transient component(TC) and the steady-state component(SSC) in the PQD. The TC is then compressed by wavelet analysis and by Huffman and runlength coding algorithms. For the SSC, values that are greater than the threshold are reserved, and the compression is finally completed. In addition, the threshold of the wavelet depends on the fading factor of the STKF to obtain a high CR. Experimental results of real-life signals measured by fault recorders in a dynamic simulation laboratory show that the CR of the proposed method reaches as high as 50 and the RE is approximately 1.6%, which are better than those of competing methods. These results demonstrate the immunity of the proposed method to the interference of Gaussian noise and sampling frequency.

关键词： Signal compression power quality disturbance Huffman coding run-length coding wavelet analysis sparse decomposition

来源：评论

学校读者我要写书评

暂无评论

FAST STRING-MATCHING ALGORITHMS FOR run-length CODED STRINGS

引用

COMPUTING 1995年第2期54卷 119-125页

作者： CHUNG, KL National Taiwan Institute of Technology

Given a run-length coded text of length 2n and a run-length coded pattern of length 2m, m much less than n commonly, this paper first presents an O(n+m) time sequential algorithm for string matching, then presents an ... 详细信息

关键词： KNUTH-MORRIS-PRATT ALGORITHM MESH WITH A RECONFIGURABLE BUS SYSTEM PARALLEL ALGORITHM run-length coding SEQUENTIAL ALGORITHM STRING MATCHING

来源：评论

学校读者我要写书评

暂无评论

Fault tolerance in computing, compressing, and transmitting FFT data

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2001年第12期49卷 2095-2105页

作者： Redinbo, GR Manomohan, R Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA Hewlett Packard Corp Internet Software Syst Engineer Cupertino CA 95014 USA

Remote-sensing applications often calculate the discrete Fourier transform of sampled data and then compress and encode it for transmission to a destination. However, all these operations are executed on computing resources potentially affected by failures. Methods are presented for integrating various fault detection capabilities throughout the data flow path so that the momentary failure of any subsystem will not allow contaminated data to go undetected. New techniques for protecting complete source coding schemes are exemplified by examining a lossy compression system that truncates fast Fourier transform (FFT) coefficients to zero, then compresses the data further by using lossless arithmetic coding. Novel methods protect arithmetic coding computations by internal algorithm checks. The arithmetic encoding and decoding operations and the transmission path are further protected by inserting sparse parity symbols dictated by a high-rate convolutional symbol-based code. This powerful approach introduces limited redundancy at the beginning of the system but performs detection at later stages. While the parity symbols degrade efficiency slightly, the overall compression gain is significant because of the run-length coding. Well-known fault tolerance measures for FFT algorithms are extended to detect errors in the lossy truncation operations, maintaining end-to-end protection. Simulations verify that all single subsystem errors are detected and the overhead costs are reasonable.

关键词： arithmetic coding fault detection FFT protection lossy compression protected source coding remote sensing run-length coding symbol convolutional codes

来源：评论

学校读者我要写书评

暂无评论

Data-independent pattern run-length compression for testing embedded cores in SoCs

引用

IEEE TRANSACTIONS ON COMPUTERS 2007年第4期56卷 545-556页

作者： Ruan, Xiaoyu Katti, Rajendra S. N Dakota State Univ Dept Elect & Comp Engn Fargo ND 58105 USA

This paper presents a new compression technique for testing the intellectual property (IP) cores in system-on-chips. The pattern run-length compression applies the well-known run-length coding to equal and complementary consecutive patterns of the precomputed test data. No structural information of the IP cores is required by the encoding procedure. A data-independent decompressor can be realized by the embedded processor or on-chip circuitry. The decompressed test set can be flexibly applied to a single-scan or multiple- scan chain of each core-under-test. Experiments on ISCAS-89 benchmarks show that the new technique results in superior compression performance. The test application time is also significantly reduced.

关键词： automatic test equipment automatic test pattern generator embedded core testing run-length coding system-on-chips test data compression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：