The ECGs transmission problem becomes actual nowadays due to the tremendous progress in communications. One of the major aspects of the transmission is the source coding (compression). The wavelet theory becomes a too...
详细信息
The ECGs transmission problem becomes actual nowadays due to the tremendous progress in communications. One of the major aspects of the transmission is the source coding (compression). The wavelet theory becomes a tool frequently used in compression. The aim of this paper is a very fast compression algorithm based on wavelets. Some simulation results prove the performance of the proposed algorithm.
In this paper, a low power baseline JPEG image compressor architecture, to be interfaced directly with an image sensor, has been presented. It compresses the raster YCbCr 4:2:2 image data from the image sensor into JP...
详细信息
In this paper, a low power baseline JPEG image compressor architecture, to be interfaced directly with an image sensor, has been presented. It compresses the raster YCbCr 4:2:2 image data from the image sensor into JPEG format. The compressed image data are being packed into byte format and DMA can be used to retrieve the JPEG image. The JPEG image compression chip is designed using 0.18-μm CMOS technology. It consumes 1.69mW when compressing at 7.49 (VGA) frames per second.
We propose a simple and effective lossless compression algorithm for video display frames. It combines a dictionary-based compression algorithm and the Huffman coding method to achieve a high compression ratio. We qua...
详细信息
We propose a simple and effective lossless compression algorithm for video display frames. It combines a dictionary-based compression algorithm and the Huffman coding method to achieve a high compression ratio. We quantitatively analyze the characteristics of display frame data and propose the algorithm accordingly. We first use a dictionary-based algorithm and an adaptive quotient bit truncation method to generate codewords for all video pixels. Then, we employ the Huffman coding scheme to assign bit values to the codewords. Finally, we apply a simple algorithm to further reduce the size of the codeword bits. Compared with previous works, the proposed algorithm achieves at least 13% improvement in data reduction ratio.
The algorithm employs a technique which unlike other is independent of repetition. It is based on the replacement of characters through generated code. The total characters used in a file can be arranged in the differ...
详细信息
The algorithm employs a technique which unlike other is independent of repetition. It is based on the replacement of characters through generated code. The total characters used in a file can be arranged in the different dimension of a matrix. Each cell of the matrix will contain a unique code, which will be replaced for respective combination of characters. Further, the codes can be reduced to the binary system to get the final compressed file. It is a simple compression and decompression process which is free from huge dictionary and time complexity and moreover the codes are generated for each combination, hence independent of repetition.
IMS was introduced into R5 core network by 3GPP, and SIP was chosen as the call/session control portocol. However, CSIP message's size is becoming a performance bottleneck. Based on the SigComp, this paper gives a...
详细信息
IMS was introduced into R5 core network by 3GPP, and SIP was chosen as the call/session control portocol. However, CSIP message's size is becoming a performance bottleneck. Based on the SigComp, this paper gives a new compression algorithm. It includes LZSS and Huffman with pretreatment. And this paper gives a SigComp session delay model. Simulation results prove that the new algorithm can effectively improve performance, reduce the message sizes and shorten delay.
The paper presents a new methodology of finding and estimating main features of time series to achieve reduction of their components and thus providing the compression of information contained in it keeping the select...
详细信息
The paper presents a new methodology of finding and estimating main features of time series to achieve reduction of their components and thus providing the compression of information contained in it keeping the selected features invariant. The presented compression algorithm is based on estimation of truncated time series components in such a way that the spectrum functions of both original and truncated time series are sufficiently close together. In the end, the set of examples is shown to demonstrate the algorithm performance and to indicate the applications of the presented methodology on EEG (Electroencephalography) signals.
Adaptive resource management uses resource allocation mechanisms to guarantee a minimum availability of required resources to *** this paper, we propose an intuitive and low overhead (linear complexity) bandwidth comp...
详细信息
Adaptive resource management uses resource allocation mechanisms to guarantee a minimum availability of required resources to *** this paper, we propose an intuitive and low overhead (linear complexity) bandwidth compression *** overhead is necessary for on-line deployment and intuition provides for easy understanding of the *** resource allocation is proportional to the resource demand and importance of applications, hence providing for fairness and increased overall quality of service (QoS).Our compression algorithm is optimal and we present a qualitative analysis of the intuition, which is based on an analogy with pendulum systems.
More and more enterprises are moving beyond server virtualization to desktop virtualization in recent years. In virtualization environments, centralized shared storage systems are generally used to take advantage of v...
详细信息
More and more enterprises are moving beyond server virtualization to desktop virtualization in recent years. In virtualization environments, centralized shared storage systems are generally used to take advantage of virtualization features such as VM migration. Network file system (NFS) is considered to be the best choice in small or medium sized LANs due to its flexibility and low cost. But it becomes the bottleneck when many clients access the server simultaneously, especially when multiple virtual machines access a large amount of data at the same time, such as operation save and restore. In this paper, we present a new method named ComIO to quickly save and restore virtual machines using page compression. Based on the analysis of virtual machines' memory characteristics, we design a fast enhanced characteristic-based compression (ECBC) algorithm. Combined with multi-threaded techniques, the compression tasks are parallelized for significantly shortened compresssion time. Page boundary alignment is proposed to enable wanted page data to be directly extracted from the compressed block. The experimental results demonstrate that compared with Xen, our method ComIO not only greatly reduces the time spent on saving and restoring virtual machines on average, but also indirectly augments the effective storage space.
A novel loss less compression algorithm known as compression by sub string enumeration (CSE) is analyzed and modified. The CSE compression algorithm is a block-based, off-line method, as is the case with enumerative c...
详细信息
A novel loss less compression algorithm known as compression by sub string enumeration (CSE) is analyzed and modified. The CSE compression algorithm is a block-based, off-line method, as is the case with enumerative codes and the block-sorting compression scheme. First, we propose an encoding model that achieves asymptotic optimality for stationary ergodic sources. The codeword length attained by the proposed model converges almost surely to the entropy rate of a source when the length of a string generated by the source tends to infinity. Then, we propose a novel decoding algorithm that requires fewer code words than the original CSE.
In this paper, we propose novel randomized versions of the splay trees. We have evaluated the practical performance of these structures in comparison with the original version of splay trees and with their loglogn-com...
详细信息
In this paper, we propose novel randomized versions of the splay trees. We have evaluated the practical performance of these structures in comparison with the original version of splay trees and with their loglogn-competitive variations, in the application field of compression. In order to evaluate performance, we utilize plain splay trees, their loglog n-competitive variations, and our proposed randomized version with the Chain Splay technique to compress data. It is observed in practice, that the compression achieved in the case of the loglog n-competitive technique is, as intuitively expected, more efficient than the one of the plain splay trees.
暂无评论