In this paper,a novel bit-level image encryption method based on dynamic grouping is proposed.In the proposed method,the plain-image is divided into several groups randomly,then permutation-diffusion process on bit le...In this paper,a novel bit-level image encryption method based on dynamic grouping is proposed.In the proposed method,the plain-image is divided into several groups randomly,then permutation-diffusion process on bit level is carried out.The keystream generated by logistic map is related to the plain-image,which confuses the relationship between the plain-image and the cipher-image.The computer simulation results of statistical analysis,information entropy analysis and sensitivity analysis show that the proposed encryption method is secure and reliable enough to be used for communication application.展开更多
This paper presents a description and performance evaluation of a new bit-level, lossless, adaptive, and asymmetric data compression scheme that is based on the adaptive character wordlength （ACW（n）） algorithm. Th...This paper presents a description and performance evaluation of a new bit-level, lossless, adaptive, and asymmetric data compression scheme that is based on the adaptive character wordlength （ACW（n）） algorithm. The proposed scheme enhances the compression ratio of the ACW（n） algorithm by dividing the binary sequence into a number of subsequences （s）, each of them satisfying the condition that the number of decimal values （d） of the n-bit length characters is equal to or less than 256. Therefore, the new scheme is referred to as ACW（n, s）, where n is the adaptive character wordlength and s is the number of subsequences. The new scheme was used to compress a number of text files from standard corpora. The obtained results demonstrate that the ACW（n, s） scheme achieves higher compression ratio than many widely used compression algorithms and it achieves a competitive performance compared to state-of-the-art compression tools.展开更多
In this article, we exploit the idea of network-coded cooperative protocol in aeronautical communications which combines different source nodes＇ information at the relay and joint decoding at the destination. Recentl...In this article, we exploit the idea of network-coded cooperative protocol in aeronautical communications which combines different source nodes＇ information at the relay and joint decoding at the destination. Recently, the network coding in cooperative communications has been categorized into two mainstreams, bit-level and signal-level combinations, which are both discussed in the article. And to be exclusively,multiple access relay channel（MARC） is adopted. The mutual information expressions of both above-cited network-coded protocols are deduced, which prove that without proper selected relays to perform network coding, the spatial diversity of the proposed protocol cannot be obtained. This then leads to search for the selection and grouping algorithms. An adjacency matrix is defined to describe the connectivity of the nodes in one radio contact disk, so that, the selection and grouping of algorithm is equivalent to constructing this adjacency matrix to minimize the system outage probability evaluated in term of the mutual information. Besides, a network-coded cooperative protocol requires the acyclic network, of which the construction is to avoid loop-4 in the matrix. The article ends with simulations to demonstrate the viability of the proposed algorithms.展开更多
文摘In this paper,a novel bit-level image encryption method based on dynamic grouping is proposed.In the proposed method,the plain-image is divided into several groups randomly,then permutation-diffusion process on bit level is carried out.The keystream generated by logistic map is related to the plain-image,which confuses the relationship between the plain-image and the cipher-image.The computer simulation results of statistical analysis,information entropy analysis and sensitivity analysis show that the proposed encryption method is secure and reliable enough to be used for communication application.
文摘This paper presents a description and performance evaluation of a new bit-level, lossless, adaptive, and asymmetric data compression scheme that is based on the adaptive character wordlength （ACW（n）） algorithm. The proposed scheme enhances the compression ratio of the ACW（n） algorithm by dividing the binary sequence into a number of subsequences （s）, each of them satisfying the condition that the number of decimal values （d） of the n-bit length characters is equal to or less than 256. Therefore, the new scheme is referred to as ACW（n, s）, where n is the adaptive character wordlength and s is the number of subsequences. The new scheme was used to compress a number of text files from standard corpora. The obtained results demonstrate that the ACW（n, s） scheme achieves higher compression ratio than many widely used compression algorithms and it achieves a competitive performance compared to state-of-the-art compression tools.
基金National Natural Science Foundation of China(60532030)National Outstanding Youth Science Fund(60625102)
文摘In this article, we exploit the idea of network-coded cooperative protocol in aeronautical communications which combines different source nodes＇ information at the relay and joint decoding at the destination. Recently, the network coding in cooperative communications has been categorized into two mainstreams, bit-level and signal-level combinations, which are both discussed in the article. And to be exclusively,multiple access relay channel（MARC） is adopted. The mutual information expressions of both above-cited network-coded protocols are deduced, which prove that without proper selected relays to perform network coding, the spatial diversity of the proposed protocol cannot be obtained. This then leads to search for the selection and grouping algorithms. An adjacency matrix is defined to describe the connectivity of the nodes in one radio contact disk, so that, the selection and grouping of algorithm is equivalent to constructing this adjacency matrix to minimize the system outage probability evaluated in term of the mutual information. Besides, a network-coded cooperative protocol requires the acyclic network, of which the construction is to avoid loop-4 in the matrix. The article ends with simulations to demonstrate the viability of the proposed algorithms.
