A new digital watermarking algorithm based on the contourlet transform is proposed to improve the robustness and anti-attack performances of digital watermarking. The algorithm uses the Arnold scrambling technique and...A new digital watermarking algorithm based on the contourlet transform is proposed to improve the robustness and anti-attack performances of digital watermarking. The algorithm uses the Arnold scrambling technique and the singular value decomposition （SVD） scheme. The Arnold scrambling technique is used to preprocess the watermark, and the SVD scheme is used to find the best suitable hiding points. After the contourlet transform of the carrier image, intermediate frequency sub-bands are decomposed to obtain the singularity values. Then the watermark bits scrambled in the Arnold rules are dispersedly embedded into the selected SVD points. Finally, the inverse contourlet transform is applied to obtain the carrier image with the watermark. In the extraction part, the watermark can be extracted by the semi-blind watermark extracting algorithm. Simulation results show that the proposed algorithm has better hiding and robustness performances than the traditional contourlet watermarking algorithm and the contourlet watermarking algorithm with SVD. Meanwhile, it has good robustness performances when the embedded watermark is attacked by Gaussian noise, salt- and-pepper noise, multiplicative noise, image scaling and image cutting attacks, etc. while security is ensured.展开更多
A new method of constructing regular low-density parity-check (LDPC) codes was proposed. And the novel class of LDPC codes was applied in a coded orthogonal frequency division multiplexing (OFDM) system. This method e...A new method of constructing regular low-density parity-check (LDPC) codes was proposed. And the novel class of LDPC codes was applied in a coded orthogonal frequency division multiplexing (OFDM) system. This method extended the class of LDPC codes which could be constructed from shifted identity matrices. The method could avoid short cycles in Tanner graphs with simple inequation in the construction of shifting identity matrices, which made the girth of Tanner graphs 8. Because of the quasicyclic structure and the inherent block configuration of parity-check matrices, the encoders and the decoders were practically feasible. They were linear-time encodable and decodable. The LDPC codes proposed had various code rates, ranging from low to high. They performed excellently with iterative decoding and demonstrate better performance than other regular LDPC codes in OFDM systems.展开更多
In this paper, we propose a construction of functions with low differential uniformity based on known perfect nonlinear functions over finite fields of odd characteristic. For an odd prime power q, it is proved that t...In this paper, we propose a construction of functions with low differential uniformity based on known perfect nonlinear functions over finite fields of odd characteristic. For an odd prime power q, it is proved that the proposed functions over the finite field Fq are permutations if and only if q≡3(mod 4).展开更多
基金The National Natural Science Foundation of China( No. 69092008)
文摘A new digital watermarking algorithm based on the contourlet transform is proposed to improve the robustness and anti-attack performances of digital watermarking. The algorithm uses the Arnold scrambling technique and the singular value decomposition （SVD） scheme. The Arnold scrambling technique is used to preprocess the watermark, and the SVD scheme is used to find the best suitable hiding points. After the contourlet transform of the carrier image, intermediate frequency sub-bands are decomposed to obtain the singularity values. Then the watermark bits scrambled in the Arnold rules are dispersedly embedded into the selected SVD points. Finally, the inverse contourlet transform is applied to obtain the carrier image with the watermark. In the extraction part, the watermark can be extracted by the semi-blind watermark extracting algorithm. Simulation results show that the proposed algorithm has better hiding and robustness performances than the traditional contourlet watermarking algorithm and the contourlet watermarking algorithm with SVD. Meanwhile, it has good robustness performances when the embedded watermark is attacked by Gaussian noise, salt- and-pepper noise, multiplicative noise, image scaling and image cutting attacks, etc. while security is ensured.
文摘A new method of constructing regular low-density parity-check (LDPC) codes was proposed. And the novel class of LDPC codes was applied in a coded orthogonal frequency division multiplexing (OFDM) system. This method extended the class of LDPC codes which could be constructed from shifted identity matrices. The method could avoid short cycles in Tanner graphs with simple inequation in the construction of shifting identity matrices, which made the girth of Tanner graphs 8. Because of the quasicyclic structure and the inherent block configuration of parity-check matrices, the encoders and the decoders were practically feasible. They were linear-time encodable and decodable. The LDPC codes proposed had various code rates, ranging from low to high. They performed excellently with iterative decoding and demonstrate better performance than other regular LDPC codes in OFDM systems.
基金supported by National Natural Science Foundation of China(Grant Nos.61070172,10990011 and 61170257)the External Science and Technology Cooperation Program of Hubei Province(Grant No.2012IHA01402)+1 种基金National Key Basic Research Program of China(Grant No.2013CB834203)the Strategic Priority Research Program of Chinese Academy of Sciences(Grant No.XDA06010702)
文摘In this paper, we propose a construction of functions with low differential uniformity based on known perfect nonlinear functions over finite fields of odd characteristic. For an odd prime power q, it is proved that the proposed functions over the finite field Fq are permutations if and only if q≡3(mod 4).
