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

A High-Performance FPGA-Based Implementation of the LZSS compression Algorithm

A High-Performance FPGA-Based Implementation of the LZSS Com...

26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Shcherbakov, Ivan Weis, Christian Wehn, Norbert TU Kaiserslautern Microelect Syst Design Res Grp Kaiserslautern Germany

ISBN: (纸本)9780769546766

The increasing growth of embedded networking applications has created a demand for high-performance logging systems capable of storing huge amounts of high-bandwidth, typically redundant data. An efficient way of maximizing the logger performance is doing a real-time compression of the logged stream. In this paper we present a flexible high-performance implementation of the LZSS compression algorithm capable of processing up to 50 MB/s on a Virtex-5 FPGA chip. We exploit the independently addressable dual-port block RAMs inside the FPGA chip to achieve an average performance of 2 clock cycles per byte. To make the compressed stream compatible with the ZLib library [1] we encode the LZSS algorithm output using a fixed Huffman table defined by the Deflate specification [2]. We also demonstrate how changing the amount of memory allocated to various internal tables impacts the performance and compression ratio. Finally, we provide a cycle-accurate estimation tool that allows finding a trade-off between FPGA resource utilization, compression ratio and performance for a specific data sample.

关键词： compression algorithms compression ratio Field programmable gate arrays average performance Growth acceleration Time compression Real time compression

来源：评论

学校读者我要写书评

暂无评论

A Zerotree Coding for compression of ECG Signal Using EZW and SPIHT

A Zerotree Coding for Compression of ECG Signal Using EZW an...

引用

38th Annual Conference on IEEE-Industrial-Electronics-Society (IECON )

作者： Ktata, S. Mahjoubi, H. Univ Tunis El Manar Higher Inst Med Technol Biophys & Med Technol Res Lab Tunis 1006 Tunisia

ISBN: (纸本)9781467324212

Biomedical waveforms, such as electrocardiogram (ECG), always posses a lot of important clinical information in medicine and are usually recorded in a long period of time in the application of telemedicine. Due to the huge amount of data to compress the ECG is vital. This paper evaluates the compression performance and characteristics of zerotree coding compression schemes of ECG applications. Two methods, namely the Embedded Zerotree Wavelet (EZW) and the Set Partitioning In Hierarchical Tree (SPIHT) are proposed. The EZW is one of the first algorithms to show the full power of wavelet based image compression. The SPIHT algorithm is a highly refined version of the EZW algorithm. EZW and SPIHT have achieved notable success in still image coding. We modified these algorithms for applied it to compression of ECG data. Both methodologies were evaluated using the percent root mean square difference (PRD) and the compression Ratio (CR). Theoretical results are contrasted with a simulation study with actual ECG signals from MIT-BIH arrhythmia database. The simulation results show that the both methods achieve a very significant improvement in the performances of compression ratio and error measurement for ECG, as compared with some other compression methods.

关键词： compression algorithms Electrocardiogram Discrete Wavelet transforms EZW SPIHT

来源：评论

学校读者我要写书评

暂无评论

Control Area Network Based Quotient Remainder compression-Algorithm for Automotive Applications

Control Area Network Based Quotient Remainder Compression-Al...

引用

38th Annual Conference on IEEE-Industrial-Electronics-Society (IECON )

作者： Kelkar, Supriya Rajkamal Cummins Coll Engn Women Pune Maharashtra India Devi Ahilya Vishwa Vidyalaya Sch Elect Indore India

ISBN: (纸本)9781467324212

The present day automotives have variety of attractive features. Incorporating these features is possible with more electronics or embedded systems inside the vehicle. Controller Area Network (CAN) protocol offers low cost solution for communication between these embedded systems. These embedded systems communicate on CAN bus via message passing. With limited speed and bandwidth offered by CAN, there are limitations in communication. One of the solutions to overcome these limitations is the use of Data-Reduction (DR) algorithms or techniques. These algorithms make it possible to send fewer amount of data in the given time, thus reducing the bandwidth per message. This paper develops an alternative approach to data reduction technique called Quotient Remainder compression (QRC) algorithm. It provides double or at least equal range to the variation in the parameter as compared to the Enhanced Data Reduction (EDR) algorithm. The compression ratio of QRC is comparable to the earlier algorithms.

关键词： compression algorithms Data Reduction Automotive Applications Controller Area Network Protocol (CAN)

来源：评论

学校读者我要写书评

暂无评论

Hybrid Pixel Encoding: An Effective Display Frame compression Algorithm for HD Video Decoder

Hybrid Pixel Encoding: An Effective Display Frame Compressio...

引用

15th IEEE International Conference on Computational Science and Engineering (CSE) / 10th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Li, Yifu Wang, Wenxiang Zhang, Guangfei Loongson Technol Corp Ltd Beijing 100190 Peoples R China Grad Univ Chinese Acad Sci Beijing 100149 Peoples R China Chinese Acad Sci ICT State Key Lab Comp Architect Beijing 100190 Peoples R China

ISBN: (纸本)9781467351652;9780769549149

High definition (HD) video decoder processes a great amount of data within a bounded time and thus requires high memory bandwidth. The memory bandwidth will dominate system performance, especially in embedded systems. In this paper, we propose a lossless hybrid display frame compression algorithm called HPE (Hybrid Pixel Encoding) for HD video decoder considering high compression performance and real time operation. The algorithm combines dictionary coding and run length coding to achieve a low compression ratio. We integrate the proposed design into an H. 264 decoder. Experimental results show that the proposed algorithm gains 67.7% of data reduction ratio on average when decoding 1080-HD video. It is much more effective than all previous works.

关键词： high definition video decoders memory bandwidth low compression ratio compression algorithms Embedded systems deceleration rate System performance pixel

来源：评论

学校读者我要写书评

暂无评论

Kronecker Compressive Sensing

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2012年第2期21卷 494-504页

作者： Duarte, Marco F. Baraniuk, Richard G. Rice Univ Dept Elect & Comp Engn Houston TX 77005 USA

Compressive sensing (CS) is an emerging approach for the acquisition of signals having a sparse or compressible representation in some basis. While the CS literature has mostly focused on problems involving 1-D signals and 2-D images, many important applications involve multidimensional signals;the construction of sparsifying bases and measurement systems for such signals is complicated by their higher dimensionality. In this paper, we propose the use of Kronecker product matrices in CS for two purposes. First, such matrices can act as sparsifying bases that jointly model the structure present in all of the signal dimensions. Second, such matrices can represent themeasurement protocols used in distributed settings. Our formulation enables the derivation of analytical bounds for the sparse approximation of multidimensional signals and CS recovery performance, as well as a means of evaluating novel distributed measurement schemes.

关键词： Compressed sensing compression algorithms hyperspectral imaging multidimensional signal processing video compression

来源：评论

学校读者我要写书评

暂无评论

Tiled Image Container for Web Compatible Compound Image compression

Tiled Image Container for Web Compatible Compound Image Comp...

引用

8th International Conference on Signal Image Technology and Internet Based Systems (SITIS)

作者： Kuruvilla, Ashok Mathew Adobe Syst Inc San Jose CA 95110 USA

ISBN: (纸本)9780769549118

Encoding images containing mixed content in web compatible formats like PNG, GIF and JPEG poses challenges in maintaining the quality along with good compression. In this paper, we describe a method for improving the compression of web compatible compound images while retaining high quality. The proposed method is based on the principle that the compression ratio of a given image depends upon both the image content and the compression algorithm used. Therefore, encoding various tiled regions in a given image with the algorithm appropriate to the content in the region improves the overall compression of the image. Further optimizations like sharing of indexed colors between the various tiles in the same image and removal of duplicate tiles improve the compression. This method would support both lossy and lossless compression. The resulting encoded data can be rendered by a web browser supporting CSS background-cropping or HTML5 canvas APIs.

关键词： compression algorithms Web and internet services Image quality

来源：评论

学校读者我要写书评

暂无评论

Memory Efficient Lossless compression of Image Sequences with JPEG-LS and Temporal Prediction

Memory Efficient Lossless Compression of Image Sequences wit...

引用

29th Picture Coding Symposium (PCS)

作者： Wang, Zhe Chanda, Debasish Simon, Sven Richter, Thomas Univ Stuttgart Dept Parallel Syst Univ Str 38 D-70569 Stuttgart Germany Univ Stuttgart RUS Comp Ctr D-70550 Stuttgart Germany

ISBN: (纸本)9781457720482

In this paper, a lossless encoder for image sequences based on JPEG-LS defined for still images with temporal-extended prediction and context modeling is proposed. As embedded systems are one important field of application of the codec, on-line lossy reference frame compression is used to reduce the encoder's memory requirement. Variations of the pixel values in the reference frame due to lossy compression are acceptable since the predictor provides only estimations of the pixel values being encoded in the current frame. Larger variations decrease the final lossless compression performance of the encoder such that a trade-off between the memory requirement and the overall compression ratio is required. Different compression algorithms for the reference frame, including JPEG, JPEG 2000 and near-lossless JPEG-LS, and their impacts on the memory requirement and the overall lossless compression ratio have been studied. Experimental results show 9.6% or more gain in lossless compression ratio compared to applying the standard JPEG-LS frame-by-frame and 80% reduction in the encoder buffer size compared to storing the uncompressed reference frame.

关键词： REFERENCE FRAMES lossless compression memory requirements ENCODER image sequences compression ratio compression algorithms Context modeling JPEG lossy compression Still images codecs

来源：评论

学校读者我要写书评

暂无评论

Interactive compression algorithms for Streaming Media Over High Speed Networks

Interactive Compression Algorithms for Streaming Media Over ...

引用

International Conference on Telecommunications and Networking/International Conference on Industrial Electronics, Technology and Automation

作者： Psannis, Kostas E. Univ Macedonia Dept Technol Management Thessaloniki Greece

ISBN: (纸本)9781402087363

This paper presents interactive compression algorithms for streaming media over high speed networks. An MPEG coded media sequence is typically partitioned into small intervals called GoP (Group Of Pictures). This structure allows a simple realization of forward (normal)-pay operation but imposes several additional constraints on the other interactive functions. Implementation of the rewind operations requires that the decoder either decodes the whole GoP and store it, or it decodes the GoP up to the current frame to be displayed. Both of these techniques lead either to the requirement for large storage at the client machine (to store a fully decoded GoP) or massive decoding processing power (to full), decode a GoP at required displayed frame rate). Neither of these options is desirable. Furthermore, Fast Play (Fast Forward/Jump Forward) functions of MPEG coded video present are problematic. When a P-/B-frame is requested, all the related previous P-/I-frames need to be sent over the network. This is likely to lead in considerable increase in communication bandwidth and decoding power compared to the normal-play mode. Several interactive algorithms are detailed with respect to server load /network bandwidth and decoder complexity. Finally an extensive comparative study has been carried out in order to determine the trade offs of the proposed approaches.

关键词： compression algorithms Interactive Video VCR functionality Streaming Interactive Media

来源：评论

学校读者我要写书评

暂无评论

ADAPTING BOYER-MOORE-LIKE algorithms FOR SEARCHING HUFFMAN ENCODED TEXTS

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2012年第2期23卷 343-356页

作者： Cantone, Domenico Faro, Simone Giaquinta, Emanuele Univ Catania Dipartimento Matemat & Informat Viale A Doria 6 I-95125 Catania Italy

In this paper we propose an efficient approach to the compressed string matching problem on Huffman encoded texts, based on the BOYER-MOORE strategy. Once a candidate valid shift has been located, a subsequent verification phase checks whether the shift is codeword aligned by taking advantage of the skeleton tree data structure. Our approach leads to algorithms that exhibit a sublinear behavior on the average, as shown by extensive experimentation.

关键词： String matching compression algorithms Huffman coding Boyer-Moore algorithm text processing information retrieval

来源：评论

学校读者我要写书评

暂无评论

CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup with Reduced Dynamic Redundancy

CLUE: Achieving Fast Update over Compressed Table for Parall...

引用

32nd IEEE International Conference on Distributed Computing Systems (ICDCS)

作者： Yang, Tong Duan, Ruian Lu, Jianyuan Zhang, Shenjiang Dai, Huichen Liu, Bin Tsinghua Univ Dept Comp Sci & Technol Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9781457702952

The sizes of routing table in backbone routers continue to keep a rapid growth and some of them currently increase up to 400K entries [1]. An effective solution to deflate the large table is the routing table compression. Meanwhile, there is an increasingly urgent demand for fast routing update mainly due to the change of network topology and new emerging Internet functionalities. Furthermore, the Internet link transmission speed has scaled up to 100Gbps commercially and towards 400Gbps Ethernet for laboratory experiments, resulting in a raring need of ultra-fast routing lookup. To achieve high performance, backbone routers must gracefully handle the three issues simultaneously: routing table compression, fast routing Lookup, and fast incremental UpdatE (CLUE), while previous works often only concentrate on one of the three dimensions. To address these issues, we propose a complete set of solutions-CLUE, by improving previous works and adding a novel incremental update mechanism. CLUE consists of three parts: a routing table compression algorithm, an improved parallel lookup mechanism, and a new fast incremental update mechanism. The routing table compression algorithm is based on ONRTC algorithm [2], a base for fast TCAM parallel lookup and fast update of TCAM. The second part is the improvement of the logical caching scheme for dynamic load balancing parallel lookup mechanism [3]. The third one is the conjunction of the trie, TCAM and redundant prefixes update algorithm. We analyze the performance of CLUE by mathematical proof, and draw the conclusion that speedup factor is proportional to the hit rate of redundant prefixes in the worst case, which is also confirmed by experimental results. Large-scale experimental results show that, compared with the mechanism in [3], CLUE only needs about 71% TCAM entries, 4.29% update time, and 3/4 dynamic redundant prefixes for the same throughput when using four TCAMs. In addition, CLUE has another advantage over the mechanis

关键词： route list backbone router Telecommunications Access Method hit rate Fasting refresh time speedup factor Redundant formal proof control surfaces compression algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：