Distributed arithmetic coding has been shown to be effective for Slepian-Wolf coding with side information. In this letter, we extend it to rate-compatible coding, which is useful in presence of a feedback channel bet...
详细信息
Distributed arithmetic coding has been shown to be effective for Slepian-Wolf coding with side information. In this letter, we extend it to rate-compatible coding, which is useful in presence of a feedback channel between encoder and decoder. The performance loss with respect to the original version is negligible.
We propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along with a soft joint decoder. The proposed scheme provides several advantages over existing schemes, and its p...
详细信息
We propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along with a soft joint decoder. The proposed scheme provides several advantages over existing schemes, and its performance is equal to or better than that of an equivalent scheme based on turbo codes at short and medium block lengths.
In the note the author provides a critique of the paper 'Novel design of arithmetic coding for data compression' by J. Jiang. A number of problems in the proposed implementation are pointed out, and the origin...
详细信息
In the note the author provides a critique of the paper 'Novel design of arithmetic coding for data compression' by J. Jiang. A number of problems in the proposed implementation are pointed out, and the origins of some of the described mechanisms are discussed.
Based on the observation that iterating a skew tent map reversely is equivalent to arithmetic coding, a simultaneous compression and encryption scheme is proposed in which the chaotic map model for arithmetic coding i...
详细信息
Based on the observation that iterating a skew tent map reversely is equivalent to arithmetic coding, a simultaneous compression and encryption scheme is proposed in which the chaotic map model for arithmetic coding is determined by a secret key and keeps changing. Moreover, the compressed sequence is masked by a pseudorandom keystream generated by another chaotic map. This two-level protection enhances its security level, which results in high key and plaintext sensitivities. The compression performance of our scheme is comparable with arithmetic coding and approaches Shannon's entropy limit.
We give a new paradigm for lossless image compression, with four modular components: pixel sequence, prediction, error modeling, and coding. We present two new methods (called MLP and PPPM) for lossless compression, b...
详细信息
We give a new paradigm for lossless image compression, with four modular components: pixel sequence, prediction, error modeling, and coding. We present two new methods (called MLP and PPPM) for lossless compression, both involving linear prediction, modeling prediction errors by estimating the variance of a Laplace distribution, and coding using arithmetic coding applied to precomputed distributions. The MLP method is both progressive and parallelizable. We give results showing that our methods perform significantly better than other currently used methods for lossless compression of high resolution images, including the proposed JPEG standard. We express our results both in terms of the compression ratio and in terms of a useful new measure of compression efficiency, which we call compression gain.
Recently, Bose and Pathak proposed a joint compression-encryption scheme by incorporating an adaptive arithmetic coder with a coupled chaotic system [1]. In this comment, we first show that the scheme proposed by Bose...
详细信息
Recently, Bose and Pathak proposed a joint compression-encryption scheme by incorporating an adaptive arithmetic coder with a coupled chaotic system [1]. In this comment, we first show that the scheme proposed by Bose and Pathak [1] is not decodable. It is due to the fact that the current symbol to be encoded is swapped with a randomly selected symbol in the model prior to encoding it, making it impossible for the decoder to mirror the encoder's operations. We then suggest a natural solution to solve the undecodability problem by using the last encoded symbol to swap. Unfortunately, it can be shown that this modified scheme is vulnerable against a chosen-plaintext attack.
By the virtue of the large number of antennas, the massive Multiple Input Multiple Output (MIMO) systems grant high spectral efficiency along with the promising gain in capacity. For the optimal detection of system pa...
详细信息
ISBN:
(纸本)9781467391979
By the virtue of the large number of antennas, the massive Multiple Input Multiple Output (MIMO) systems grant high spectral efficiency along with the promising gain in capacity. For the optimal detection of system parameters, generally perfect Channel State Information (CSI) is assumed to be known at both transmitter and receiver. However, in practice, due to mobility of communication environment, the impulse response of the channel varies, thus inducing the need of channel estimation. In addition, a permanent feedback signalling is required to notify the estimated CSI at the transmitter. Large number of time slots are engaged during the feedback, thus reducing the bandwidth efficiency of the system. This paper deals with reduction of feedback overhead by using arithmetic coding for the estimated channel in the massive MIMO systems. Block type pilot estimation technique has been considered for the channel estimation.
This paper presents an application of the discrete cosine transform compression technique on medical images of the IRM type. The arithmetic coding method is used to encode the coefficients. The tests of this lossy com...
详细信息
ISBN:
(纸本)9781424417513
This paper presents an application of the discrete cosine transform compression technique on medical images of the IRM type. The arithmetic coding method is used to encode the coefficients. The tests of this lossy compression/decompression technique are performed on two IRM images representing the brain, in axial and sagital views, of a patient suffering from a cerebral hemorhage. The obtained results on these images show that the DCT technique permits to considerably improve the compression rate while mainting a good image quality when threshold varies in the interval: 0 <= TH <= 20 for bloc sizes: [16x16] and [32x32]. However, a severe degradation of the quality of the reconstructed medical image is observed when the threshold is greater than 30.
Since data are originated and processed by multiple agents in wireless sensor networks, data provenance plays an important role for assuring data trustworthiness. However, the size of the provenance tends to increase ...
详细信息
ISBN:
(纸本)9781479975754
Since data are originated and processed by multiple agents in wireless sensor networks, data provenance plays an important role for assuring data trustworthiness. However, the size of the provenance tends to increase at a higher rate as it is transmitted from the source to the base station and is processed by many intermediate nodes. Due to bandwidth and energy limitations of wireless sensor networks, such increasing of provenance size slows down the network and depletes the energy of sensor nodes. Therefore, compression of data provenance is an essential requirement. Existing lossy compression schemes based on Bloom filters or probabilistic packet marking approaches have high error rates in provenance-recovery. In this paper, we address this problem and propose a distributed and lossless arithmetic coding based compression technique which achieves a compression ratio higher than that of existing techniques and also close to Shannon's entropy bound. Unlike other provenance schemes, the most interesting characteristic of our scheme is that the provenance size is not directly proportional to the number of hops, but to the occurrence probabilities of the nodes that are on a packet's path. We also ensure the confidentiality, integrity, and freshness of provenance to prevent malicious nodes from compromising the security of data provenance. Finally, the simulation and testbed results provide a strong evidence for the claims in the paper.
In this paper, a dynamic user hierarchy mechanism based on arithmetic coding is proposed. Through careful design of keys, some economic keys are obtained. In our scheme, the relationship between two users can be easil...
详细信息
In this paper, a dynamic user hierarchy mechanism based on arithmetic coding is proposed. Through careful design of keys, some economic keys are obtained. In our scheme, the relationship between two users can be easily revealed by evaluating a simple formula to the relative key. In addition, whenever a new user is inserted into the user hierarchy system, the corresponding keys can be determined quickly without changing the existing keys except for the last existing key. Furthermore, the keys proposed by us are drastically reduced from the previous work. (C) 1999 Elsevier Science Ltd. All rights reserved.
暂无评论