RFID equipment usually makes use of EPC which has many unexploited codewords. Actually, the unexploited codewords are the vast majority of the codewords. When there is a code with so many unexploited codewords, many c...
详细信息
ISBN:
(纸本)9781509034741
RFID equipment usually makes use of EPC which has many unexploited codewords. Actually, the unexploited codewords are the vast majority of the codewords. When there is a code with so many unexploited codewords, many compression algorithms can significantly reduce the average codeword size. In this paper we explain how to select the most effective compression algorithm for RFID equipment.
In previous work, the authors developed a modular no-reference framework that compresses FASTA files by applying a predict-and-residue method, as used in video coding. We extended this framework with support for Conte...
详细信息
We present an optimal coding scheme that parameterizes the maximum-likelihood estimate of variance for frequency spectra belonging to the generalized Gaussian distribution, the distribution covering the Laplacian and ...
详细信息
We present an optimal coding scheme that parameterizes the maximum-likelihood estimate of variance for frequency spectra belonging to the generalized Gaussian distribution, the distribution covering the Laplacian and the Gaussian. By slightly modifying the all-pole model of the conventional linear prediction (LP), we can estimate the variance with the same method as in LP, which has low computational costs. Experimental results show that incorporating the coding scheme in a state-of-the-art wide-band audio coder enhances its objective and subjective quality in a low-bit-rate and low-delay situation by increasing the compression efficiency. Thus, this coding scheme will be useful in applications like mobile communications, which requires highly efficient compression.
arithmetic coding is a widely applied compression tool with superior coding efficiency to other entropy coding methodsHowever, it suffers from the error resilience and complexityIn this paper, the integer implementati...
详细信息
arithmetic coding is a widely applied compression tool with superior coding efficiency to other entropy coding methodsHowever, it suffers from the error resilience and complexityIn this paper, the integer implementation of binary arithmetic coding with forbidden symbol for error resilience is studiedcoding redundancies for employing different quantization coefficients in probability representation and cost effective backtracking distance in bits for maximum a posteriori(MAP) decoding are studied in depthWe observe that the optimal quantization coefficients are independent of forbidden symbol and the probabilities of source and the cost effective backtracking distance is related to the source entropy and the given forbidden symbol probabilitiesSuch observations are also demonstrated by extensive experiments.
In this paper two new hardware-based entropy coding architectures for asymmetric numeral systems are introduced, as entropy encoding is one of the major phases in a compression algorithm. The proposed architectures ar...
详细信息
ISBN:
(纸本)9781467380324
In this paper two new hardware-based entropy coding architectures for asymmetric numeral systems are introduced, as entropy encoding is one of the major phases in a compression algorithm. The proposed architectures are based on tabled asymmetric numeral systems (tANS). The tabled asymmetric numeral systems combines the speed advantage of table based approaches (e.g. Huffman encoding) with the higher compression rate advantage of arithmetic encoding. Both proposed architectures have been synthesized to a state-of-the-art FPGA, and the synthesis results show high encoding throughput. The architectures are capable of encoding one symbol per clock cycle. The performance of the architectures depends on the number of symbols in the alphabet and may vary from 146 up to 290 Mega symbols per second (Msps).
Entropy coding is an integral part of most data compression systems. Huffman coding (HC) and arithmetic coding (AC) are two of the most widely used coding methods. HC can process a large symbol alphabet at each step a...
详细信息
ISBN:
(纸本)9781479977833
Entropy coding is an integral part of most data compression systems. Huffman coding (HC) and arithmetic coding (AC) are two of the most widely used coding methods. HC can process a large symbol alphabet at each step allowing for fast encoding and decoding. However, HC typically provides suboptimal data rates due to its inherent approximation of symbol probabilities to powers of 1/2. In contrast, AC uses nearly accurate symbol probabilities, hence generally providing better compression ratios. However, AC relies on relatively slow arithmetic operations making the implementation computationally demanding. In this paper we discuss asymmetric numeral systems (ANS) as a new approach to entropy coding. While maintaining theoretical connections with AC, the proposed ANS-based coding can be implemented with much less computational complexity. While AC operates on a state defined by two numbers specifying a range, an ANS-based coder operates on a state defined by a single natural number such that the x is an element of N state contains approximate to log(2) (x) bits of information. This property allows to have the entire behavior for a large alphabet summarized in the form of a relatively small table (e.g. a few kilobytes for a 256 size alphabet). The proposed approach can be interpreted as an equivalent to adding fractional bits to a Huffman coder to combine the speed of HC and the accuracy offered by AC. Additionally, ANS can simultaneously encrypt a message encoded this way. Experimental results demonstrate effectiveness of the proposed entropy coder.
This paper proposes a new efficient bypass coding scheme (EBCS) based on Logarithmic Binary arithmetic coding (LBAC). The bypass coding model is used to encode a symbol which has equal probability (0.5). The percentag...
详细信息
ISBN:
(纸本)9781479977833
This paper proposes a new efficient bypass coding scheme (EBCS) based on Logarithmic Binary arithmetic coding (LBAC). The bypass coding model is used to encode a symbol which has equal probability (0.5). The percentage of the bypass coding model is about 25 in CABAC of H.265/HEVC. The proposed EBCS provides a hardware-efficient design that can significantly increase the processing speed, and it has a simple algorithm structure. Experimental results show that the EBCS can reduce bypass coding time by 60% roughly. For a hardware implementation in this paper, the overall processing speed is improved by about 96%, and the hardware cost is low.
Polar codes achieve the rate-distortion bound for nonuniform sources and/or asymmetric distortion measures. However, the performance is not always near optimal for finite code length, especially for short code length....
详细信息
ISBN:
(纸本)9781467377041
Polar codes achieve the rate-distortion bound for nonuniform sources and/or asymmetric distortion measures. However, the performance is not always near optimal for finite code length, especially for short code length. In this paper a new scheme for lossy source coding is proposed. In addition to polar coding, arithmetic coding is applied in the scheme. The source is first encoded by polar coding for lossy compression, then it is further compressed losslessly by arithmetic coding. It is shown that the scheme achieves the rate-distortion bound asymptotically with a good empirical performance. It is also shown that the distortion of the scheme has a better second-order exponent than those of the other polar coding schemes.
Conventional music coders, based on a modified discrete cosine transform (MDCT) suffer greatly when lowering their bit-rate and delay. In particular, tonal music signals are penalized by short analysis windows and the...
详细信息
ISBN:
(纸本)9780992862633
Conventional music coders, based on a modified discrete cosine transform (MDCT) suffer greatly when lowering their bit-rate and delay. In particular, tonal music signals are penalized by short analysis windows and the variable length coding of the quantized MDCT coefficients demands a significant amount of bits for coding the harmonic structure. For solving such an issue, the paper proposes a frequency-domain harmonic model aiming to amend the probability model of the variable length coding of the quantized MDCT coefficients. The new model was combined successfully with an envelope based arithmetic coding at rate lower than 10 kbps, and with a context based arithmetic coding at higher bit rates in the recent 3 GPP EVS (Enhanced Voice Services) codec standard. Objective and subjective quality tests indicate that the proposed harmonic model enhances the quality of music for low-delay audio coding.
This letter considers a new approach for the lossless progressive compression of light detection and ranging (LiDAR) data stored within a LAS file (public file format for the interchange of three-dimensional point clo...
详细信息
This letter considers a new approach for the lossless progressive compression of light detection and ranging (LiDAR) data stored within a LAS file (public file format for the interchange of three-dimensional point cloud data), which is used for storing the results of LiDAR scanning. The presented method builds a hierarchical data model for arranging LAS points into different levels in one pass. The higher levels are compressed using variable length and arithmetic coding, whilst the lower levels apply a prediction model of the non-progressive compression schema. The order of the points, as captured by the LiDAR scanner, has to be preserved within each level as better compression ratios are achieved in this way.
暂无评论