The popularity of parallel platforms, such as general purpose graphics processing units (GPGPUs) for large-scale simulations is rapidly increasing, however the I/O bandwidth and storage capacity of these massively-par...
详细信息
ISBN:
(纸本)9783540874744
The popularity of parallel platforms, such as general purpose graphics processing units (GPGPUs) for large-scale simulations is rapidly increasing, however the I/O bandwidth and storage capacity of these massively-parallel cards remain the major bottle necks. We propose a novel approach for post-processing of simulation data directly on CPGPUs by efficient data size reduction immediately after simulation that can considerably reduce the influence of these bottlenecks on the overall simulation performance, and present current performance results.
This paper considers large-scale OneMax and RoyalRoad optimization problems with up to 10(7) binary variables within a compact Estimation of Distribution Algorithms (EDA) framework. Building upon the compact Genetic A...
详细信息
ISBN:
(纸本)9781450311779
This paper considers large-scale OneMax and RoyalRoad optimization problems with up to 10(7) binary variables within a compact Estimation of Distribution Algorithms (EDA) framework. Building upon the compact Genetic Algorithm (cGA), the continuous domain Population-Based Incremental Learning algorithm (PBILc) and the arithmetic-coding EDA, we define a novel method that is able to compactly solve regular and noisy versions of these problems with minimal memory requirements, regardless of problem or population size. This feature allows the algorithm to be run in a conventional desktop machine. Issues regarding probability model sampling, arbitrary precision of the arithmetic-coding decompressing scheme, incremental fitness function evaluation and updating rules for compact learning, are presented and discussed.
In this paper, a performance comparison of an embedded zero tree wavelet (EZW) based codec is done on the basis of Huffman and arithmetic coding. The sub-band decomposition coefficients are coded into multilayer bit s...
详细信息
ISBN:
(纸本)9781467310499;9781467310475
In this paper, a performance comparison of an embedded zero tree wavelet (EZW) based codec is done on the basis of Huffman and arithmetic coding. The sub-band decomposition coefficients are coded into multilayer bit stream and then it is entropy coded using Huffman and arithmetic code. The comparison results shows that the arithmetic coded bit stream results in improved bit rate than Huffman coding at the same threshold.
In this paper we propose a novel efficient adaptive binary arithmetic coder which is multiplication-free and requires no look-up tables. To achieve this, we combine the probability estimation based on a virtual slidin...
详细信息
ISBN:
(纸本)9781467325332;9781467325349
In this paper we propose a novel efficient adaptive binary arithmetic coder which is multiplication-free and requires no look-up tables. To achieve this, we combine the probability estimation based on a virtual sliding window with the approximation of multiplication and the use of simple operations to calculate the next approximation after the encoding of each binary symbol. We show that the proposed algorithm is faster and provides a better compression efficiency compared to the M-coder in the CABAC entropy coding scheme of the H.264/AVC video coding standard.
We propose a hierarchical lossy bilevel image compression method that relies on adaptive cutset sampling (along lines of a rectangular grid with variable block size) and Markov Random Field based reconstruction. It is...
详细信息
ISBN:
(纸本)9781467325332;9781467325349
We propose a hierarchical lossy bilevel image compression method that relies on adaptive cutset sampling (along lines of a rectangular grid with variable block size) and Markov Random Field based reconstruction. It is an efficient encoding scheme that preserves image structure by using a coarser grid in smooth areas of the image and a finer grid in areas with more detail. Experimental results demonstrate that the proposed method performs as well as or better than the fixed-grid approach, and outperforms other lossy bilevel compression methods in its rate-distortion performance.
Memristive memories have received significant interest for application to on-chip storage. A multi-bit memristive memory circuit architecture based on arithmetic coding is presented in this paper. Both read and write ...
详细信息
ISBN:
(纸本)9781467326582
Memristive memories have received significant interest for application to on-chip storage. A multi-bit memristive memory circuit architecture based on arithmetic coding is presented in this paper. Both read and write circuits are presented which encode information into the memristive data cells. The proposed circuits provide fine control of the resistance within the memristor. The continuous resistance characteristic of memristive devices is exploited to provide additional storage by utilizing compression techniques. This approach yields an increase in overall bit density for a memristor based data array as compared to a standard multi-bit cell array.
Image compression is one of the most important topics in the field of digital image processing. JPEG2000 is considered as a new image compression standard that offers the requirements needed nowadays. Efficient hardwa...
详细信息
ISBN:
(纸本)9781457719677
Image compression is one of the most important topics in the field of digital image processing. JPEG2000 is considered as a new image compression standard that offers the requirements needed nowadays. Efficient hardware implementation of this complex standard is a considerable challenge in order to embed the compression engine inside the imaging devices. MQ encoder is one of the main and important modules in the JPEG2000 encoder. This paper proposes a hardware model written in VHDL for this MQ encoder. The design fully achieves all the required performance, identified in the JPEG2000 standard with reasonable hardware specifications and its results are compared with other similar designs.
In this paper, a kind of digital signature system is proposed. This method is based on the difficulty on getting the solutions of indefinite equations with integer coefficients in mathematical programming. It is a har...
详细信息
ISBN:
(纸本)9783642352102
In this paper, a kind of digital signature system is proposed. This method is based on the difficulty on getting the solutions of indefinite equations with integer coefficients in mathematical programming. It is a hard NP problem in computing. The signature system has random property like DSS so as to avoid forgery signature. Because only arithmetic plus and multiple operations are used, it is easy for hardware integration. This signature system can very suitably be used for digital signal processor development in DSP.
This work investigates the security issues of the recently proposed secure arithmetic coding (AC), which is an encryption scheme incorporating the interval splitting AC with a series of symbol and codeword permutation...
详细信息
ISBN:
(纸本)9781424414833
This work investigates the security issues of the recently proposed secure arithmetic coding (AC), which is an encryption scheme incorporating the interval splitting AC with a series of symbol and codeword permutations. We propose a chosen-ciphertext attack which is capable of recovering the key vectors for codeword permutations with complexity O(N), where N is the symbol sequence length. After getting the key vectors for codeword permutations, we can remove the codeword permutation module, and the resulting system has already been shown to be insecure in the original paper [5].
A simple and efficient nonblock coding scheme for binary sources is suggested. It uses a probability model to map any source string to a unique integer, and thereby defines an enumeration of all possible strings. Cont...
详细信息
A simple and efficient nonblock coding scheme for binary sources is suggested. It uses a probability model to map any source string to a unique integer, and thereby defines an enumeration of all possible strings. Contrary to normal enumerative coding, the new method is noncombinatorial and operates sequentially, incrementing the code value symbol by symbol, by simple arithmetic. It is akin to arithmetic coding but does not use intervals. For memoryless sources, the redundancy per symbol is shown to be asymptotically less than p(3) bits, where p is the smaller of symbol probabilities. Especially, for integer-valued 1/p, the code is asymptotically optimal. These results are confirmed by both analysis and experiments with arbitrary-precision arithmetic. In a practical implementation, the source is partitioned into substrings enabling restricted-precision arithmetic. Thanks to subtle implicit coding, the additional redundancy is marginal. The source model can be also context-based, and even adaptivity can be incorporated. A peculiarity of the method is that decoding is done backwards (LIFO). Hence, for higher-order models, the string suffix, not prefix, is used as the context domain. The speed of the practical version is close to that of binary arithmetic coders.
暂无评论