Structured flowchart( SFC) and Automatic code generation based on SFC( CG-SFC) have been widely used in software requirements,design and testing phases. Some CG-SFC tools such as Rhapsody have the ability to build flo...Structured flowchart( SFC) and Automatic code generation based on SFC( CG-SFC) have been widely used in software requirements,design and testing phases. Some CG-SFC tools such as Rhapsody have the ability to build flowchart and generate code,but they do not check whether a given flowchart is correct or structural. For unstructured error ‘goto'statements will be generated randomly. We proposed three algorithms and some error recognition criteria to solve those problems. Structure recognition algorithm can recognize Selection,While/for and do-while structures. Error recognition algorithm incorporating criteria can check all the errors. At last,we develop a CG-SFC system,and compared with existing Rhapsody,it shows that the proposed algorithms are correct and effective.展开更多
A new method to design parity-check matrix based on Henon chaos model is presented. The designed parity-check matrix is with rather random behavior. Simulation results show that the proposed method makes an improvemen...A new method to design parity-check matrix based on Henon chaos model is presented. The designed parity-check matrix is with rather random behavior. Simulation results show that the proposed method makes an improvement in bit error rate （BER） performance by 0.4 dB compared with that of Luby for AWGN channel. The proposed method decreases the complexity of decoding significantly, and improves the error correcting performance of LDPC codes. It has been shown that Henon chaotic model is a powerful tool for construction of good LDPC codes, which make it possible to apply the LDPC code in real communication systems.展开更多
Low-density parity-check （LDPC） codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate （BER） performance approaches remarkably close to the Shannon limit. The LDPC cod...Low-density parity-check （LDPC） codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate （BER） performance approaches remarkably close to the Shannon limit. The LDPC codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular LDPC codes based on group divisible designs which have Tanner graphs free of four-cycles.展开更多
In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are de...In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are derived by permuting the matrices of the corresponding RC-LDPC block codes,are systematic and have maximum encoding memory.Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation(BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels(BI-AWGNCs).展开更多
A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional densit...A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.展开更多
In this paper, the Multiple Input Multiple Output (MIMO) doubly-iterative receiver which consists of the Probabilistic Data Association detector (PDA) and Low-Density Parity-Check Code (LDPC) decoder is developed. The...In this paper, the Multiple Input Multiple Output (MIMO) doubly-iterative receiver which consists of the Probabilistic Data Association detector (PDA) and Low-Density Parity-Check Code (LDPC) decoder is developed. The receiver performs two iterative decoding loops. In the outer loop, the soft information is exchanged between the PDA detector and the LDPC decoder. In the inner loop, it is exchanged between variable node and check node decoders inside the LDPC decoder. On the light of the Extrinsic Information Transfer (EXIT) chart technique, an LDPC code degree profile optimization algorithm is developed for the doubly-iterative receiver. Simulation results show the doubly-receiver with optimized irregular LDPC code can have a better performance than the one with the regular one.展开更多
In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the ...In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the analysis of the code rate and parameters of these eight kinds of structures, we find that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced. We propose that the current development cost should be lower with the progress of electronic technology and we need research on more practical Low-Density Parity-Check Codes (LDPC). Combined with the application of the quantum distribution key, we urgently need to explore the research direction of relevant theories and technologies of LDPC codes in other fields of quantum information in the future.展开更多
The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder nee...The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.展开更多
Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz（THz） wireless communications. An error control coding scheme based on low density parit...Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz（THz） wireless communications. An error control coding scheme based on low density parity check（LDPC） codes with soft decision decoding algorithm is proposed to improve the bit-error-rate（BER） performance of an on-off keying（OOK） modulated THz signal through atmospheric channel. The THz wave propagation characteristics and channel model in atmosphere is set up. Numerical simulations validate the great performance of LDPC codes against the atmospheric fading and demonstrate the huge potential in future ultra-high speed beyond Gbps THz communications.展开更多
This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach s...This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach synthesizes two techniques： protograph LDPC codes and OFDM. One symbol of encoded information by protograph LDPC codes corresponds to one sub-carrier, namely the length of encoded information equals to the number of sub-carriers. The design of good protograph LDPC codes with short lengths is given, and the proposed proto- graph LDPC codes can be of fast encoding, which can reduce the encoding complexity and simplify encoder hardware implementa- tion. The proposed approach provides a higher coding gain in the Rayleigh fading channel. The simulation results in the Rayleigh fading channel show that the bit error rate （BER） performance of the proposed time-frequency codes is as good as random LDPC- OFDM codes and is better than Tanner LDPC-OFDM codes under the condition of different fading coefficients.展开更多
The well-known CCSDS(consultative committee for space data systems) LDPC(low density parity check) code for near-earth applications is discussed and used for a case study of Mc Eliece system. First, a data error is pi...The well-known CCSDS(consultative committee for space data systems) LDPC(low density parity check) code for near-earth applications is discussed and used for a case study of Mc Eliece system. First, a data error is picked out with the CCSDS LDPC code. The problem with its generator matrix is illustrated and overcome by a shortened code with some middle code bits deleted. In correspondence, its parity check matrix is also revised with the new quasi-cyclic(QC)-LDPC code. Second, a fast decoding scheme for general QC-LDPC codes is proposed based on flipping bits and fetching words. Besides, a lightweight CCSDS LDPC code based Mc Eliece system can be set up with such codes. The repaired CCSDS LDPC code is supposed to be still useful for communications and storages, and the normalized decoding algorithm is also efficient for general QC-LDPC codes.展开更多
In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results fr...In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results from the neighbouring Huffman coded bits. Simulations demonstrate that in the presence of source redundancy, the proposed algorithm gives better performance than the Separate Source and Channel Decoding algorithm (SSCD).展开更多
This paper presents a simple yet effective decoding for general quasi-cyclic low-density parity-check （QC-LDPC） codes, which not only achieves high hardware utility efficiency （HUE）, but also brings about great me...This paper presents a simple yet effective decoding for general quasi-cyclic low-density parity-check （QC-LDPC） codes, which not only achieves high hardware utility efficiency （HUE）, but also brings about great memory block reduction without any performance degradation. The main idea is to split the check matrix into several row blocks, then to perform the improved mes- sage passing computations sequentially block by block. As the decoding algorithm improves, the sequential tie between the two-phase computations is broken, so that the two-phase computations can be overlapped which bring in high HUE. Two over- lapping schemes are also presented, each of which suits a different situation. In addition, an efficient memory arrangement scheme is proposed to reduce the great memory block requirement of the LDPC decoder. As an example, for the 0.4 rate LDPC code selected from Chinese Digital TV Terrestrial Broadcasting （DTTB）, our decoding saves over 80% memory blocks com- pared with the conventional decoding, and the decoder achieves 0.97 HUE. Finally, the 0.4 rate LDPC decoder is implemented on an FPGA device EP2S30 （speed grade -5）. Using 8 row processing units, the decoder can achieve a maximum net throughput of 28.5 Mbps at 20 iterations.展开更多
The existing constructions of quasi-cyclic low-density parity-check （QC-LDPC） codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead ...The existing constructions of quasi-cyclic low-density parity-check （QC-LDPC） codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead to the bit error rate （BER） performance of QC-LDPC codes being much poorer than that of randomly constructed LDPC codes even decoding failure. To solve the problem, some theorems of the specific chosen parity-check matrix of QC-LDPC codes without small stopping sets and small girth are proposed. A novel construction for QC-LDPC codes with long block lengths is presented by multiplying mmin or the multiple of mmin, which is the minimum order of the identity matrix for the chosen parity-check matrix. The simulation results show that the specific chosen parity-check matrix of QC-LDPC codes can effectively avoid specified stopping sets and small girth and exhibit excellent BER performance than random LDPC codes with the same longer codes length.展开更多
A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and...A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and the designed codes perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing EG-LDPC codes.展开更多
Watermarking system based on quantization index modulation （QIM） is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronizati...Watermarking system based on quantization index modulation （QIM） is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronization attacks of QIM digital watermarking,a low density parity check （LDPC） code-aided QIM watermarking algorithm is proposed,and the performance of QIM watermarking system can be improved by incorporating LDPC code with message passing estimation/detection framework.Using the theory of iterative estimation and decoding,the watermark signal is decoded by the proposed algorithm through iterative estimation of amplitude scaling parameters and decoding of watermark.The performance of the proposed algorithm is closer to the dirty paper Shannon limit than that of repetition code aided algorithm when the algorithm is attacked by the additive white Gaussian noise.For constant amplitude scaling attacks,the proposed algorithm can obtain the accurate estimation of amplitude scaling parameters.The simulation result shows that the algorithm can obtain similar performance compared to the algorithm without desynchronization.展开更多
基金Sponsored by the National Natural Science Foundation of China(Grant No.61402131)the China Postdoctoral Science Foundation(Grant No.2014M551245,2016T90293)+1 种基金the Heilongjiang Postdoctoral Science Foundation(Grant No.LBH-Z13105)the Fundamental Research Funds for the Central Universities(Grant No.HIT.NSRIF.201651)
文摘Structured flowchart( SFC) and Automatic code generation based on SFC( CG-SFC) have been widely used in software requirements,design and testing phases. Some CG-SFC tools such as Rhapsody have the ability to build flowchart and generate code,but they do not check whether a given flowchart is correct or structural. For unstructured error ‘goto'statements will be generated randomly. We proposed three algorithms and some error recognition criteria to solve those problems. Structure recognition algorithm can recognize Selection,While/for and do-while structures. Error recognition algorithm incorporating criteria can check all the errors. At last,we develop a CG-SFC system,and compared with existing Rhapsody,it shows that the proposed algorithms are correct and effective.
基金Supported by the National High Technology Research and Development Program of China (2001AA123053)
文摘A new method to design parity-check matrix based on Henon chaos model is presented. The designed parity-check matrix is with rather random behavior. Simulation results show that the proposed method makes an improvement in bit error rate （BER） performance by 0.4 dB compared with that of Luby for AWGN channel. The proposed method decreases the complexity of decoding significantly, and improves the error correcting performance of LDPC codes. It has been shown that Henon chaotic model is a powerful tool for construction of good LDPC codes, which make it possible to apply the LDPC code in real communication systems.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1107105611201114)
文摘Low-density parity-check （LDPC） codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate （BER） performance approaches remarkably close to the Shannon limit. The LDPC codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular LDPC codes based on group divisible designs which have Tanner graphs free of four-cycles.
基金the National Natural Science Foundation of China(Nos.61401164,61471131 and 61201145)the Natural Science Foundation of Guangdong Province(No.2014A030310308)
文摘In this paper,a family of rate-compatible(RC) low-density parity-check(LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method.The resulted RC-LDPC convolutional codes,which are derived by permuting the matrices of the corresponding RC-LDPC block codes,are systematic and have maximum encoding memory.Simulation results show that the proposed RC-LDPC convolutional codes with belief propagation(BP) decoding collectively offer a steady improvement on performance compared with the block counterparts over the binary-input additive white Gaussian noise channels(BI-AWGNCs).
基金Leading Academic Discipline Project of Shanghai Municipal Education Commission,China(No.J51801)Shanghai Second Polytechnic University Foundation,China(No.QD209008)Leading Academic Discipline Project of Shanghai Second Polytechnic University,China(No.XXKZD1302)
文摘A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check （LDPC） codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation resuits show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.
基金Supported by the National Natural Science Foundation of China (No. 60772061)Science Foundation of Nanjing University of Posts and Telecommunications (No. NY207132)
文摘In this paper, the Multiple Input Multiple Output (MIMO) doubly-iterative receiver which consists of the Probabilistic Data Association detector (PDA) and Low-Density Parity-Check Code (LDPC) decoder is developed. The receiver performs two iterative decoding loops. In the outer loop, the soft information is exchanged between the PDA detector and the LDPC decoder. In the inner loop, it is exchanged between variable node and check node decoders inside the LDPC decoder. On the light of the Extrinsic Information Transfer (EXIT) chart technique, an LDPC code degree profile optimization algorithm is developed for the doubly-iterative receiver. Simulation results show the doubly-receiver with optimized irregular LDPC code can have a better performance than the one with the regular one.
文摘In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the analysis of the code rate and parameters of these eight kinds of structures, we find that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced. We propose that the current development cost should be lower with the progress of electronic technology and we need research on more practical Low-Density Parity-Check Codes (LDPC). Combined with the application of the quantum distribution key, we urgently need to explore the research direction of relevant theories and technologies of LDPC codes in other fields of quantum information in the future.
基金supported by Beijing Natural Science Foundation(4102050)the National Natural Science of Foundation of China(NSFC)-Korea Science and Engineering Foundation (KOSF) Joint Research Project of China and Korea (60811140343)
文摘The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.
基金Project supported by the National Key Basic Research Program of China(Grant No.2014CB339803)the National High Technology Research and Development Program of China(Grant No.2011AA010205)+4 种基金the National Natural Science Foundation of China(Grant Nos.61131006,61321492,and 61204135)the Major National Development Project of Scientific Instrument and Equipment(Grant No.2011YQ150021)the National Science and Technology Major Project(Grant No.2011ZX02707)the International Collaboration and Innovation Program on High Mobility Materials Engineering of the Chinese Academy of Sciencesthe Shanghai Municipal Commission of Science and Technology(Grant No.14530711300)
文摘Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz（THz） wireless communications. An error control coding scheme based on low density parity check（LDPC） codes with soft decision decoding algorithm is proposed to improve the bit-error-rate（BER） performance of an on-off keying（OOK） modulated THz signal through atmospheric channel. The THz wave propagation characteristics and channel model in atmosphere is set up. Numerical simulations validate the great performance of LDPC codes against the atmospheric fading and demonstrate the huge potential in future ultra-high speed beyond Gbps THz communications.
基金supported by the Beijing Natural Science Foundation of China (4102050)the National Natural Science of Foundation of China (NSFC)-Korea Science and Engineering Foundation (KOSF) Joint Research Project of China and Korea (60811140343)
文摘This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach synthesizes two techniques： protograph LDPC codes and OFDM. One symbol of encoded information by protograph LDPC codes corresponds to one sub-carrier, namely the length of encoded information equals to the number of sub-carriers. The design of good protograph LDPC codes with short lengths is given, and the proposed proto- graph LDPC codes can be of fast encoding, which can reduce the encoding complexity and simplify encoder hardware implementa- tion. The proposed approach provides a higher coding gain in the Rayleigh fading channel. The simulation results in the Rayleigh fading channel show that the bit error rate （BER） performance of the proposed time-frequency codes is as good as random LDPC- OFDM codes and is better than Tanner LDPC-OFDM codes under the condition of different fading coefficients.
基金Supported by the Guangzhou Innovation Leading Team Program (201909010008)。
文摘The well-known CCSDS(consultative committee for space data systems) LDPC(low density parity check) code for near-earth applications is discussed and used for a case study of Mc Eliece system. First, a data error is picked out with the CCSDS LDPC code. The problem with its generator matrix is illustrated and overcome by a shortened code with some middle code bits deleted. In correspondence, its parity check matrix is also revised with the new quasi-cyclic(QC)-LDPC code. Second, a fast decoding scheme for general QC-LDPC codes is proposed based on flipping bits and fetching words. Besides, a lightweight CCSDS LDPC code based Mc Eliece system can be set up with such codes. The repaired CCSDS LDPC code is supposed to be still useful for communications and storages, and the normalized decoding algorithm is also efficient for general QC-LDPC codes.
文摘In this paper, we present a Joint Source-Channel Decoding algorithm (JSCD) for Low-Density Parity Check (LDPC) codes by modifying the Sum-Product Algorithm (SPA) to account for the source redun-dancy, which results from the neighbouring Huffman coded bits. Simulations demonstrate that in the presence of source redundancy, the proposed algorithm gives better performance than the Separate Source and Channel Decoding algorithm (SSCD).
基金Science and Technology on Avionics Integration Laboratory and Aeronautical Science Foundation of China (20115551022)
文摘This paper presents a simple yet effective decoding for general quasi-cyclic low-density parity-check （QC-LDPC） codes, which not only achieves high hardware utility efficiency （HUE）, but also brings about great memory block reduction without any performance degradation. The main idea is to split the check matrix into several row blocks, then to perform the improved mes- sage passing computations sequentially block by block. As the decoding algorithm improves, the sequential tie between the two-phase computations is broken, so that the two-phase computations can be overlapped which bring in high HUE. Two over- lapping schemes are also presented, each of which suits a different situation. In addition, an efficient memory arrangement scheme is proposed to reduce the great memory block requirement of the LDPC decoder. As an example, for the 0.4 rate LDPC code selected from Chinese Digital TV Terrestrial Broadcasting （DTTB）, our decoding saves over 80% memory blocks com- pared with the conventional decoding, and the decoder achieves 0.97 HUE. Finally, the 0.4 rate LDPC decoder is implemented on an FPGA device EP2S30 （speed grade -5）. Using 8 row processing units, the decoder can achieve a maximum net throughput of 28.5 Mbps at 20 iterations.
基金supported by the National Natural Science Foundation of China (60572093)Specialized Research Fund for the Doctoral Program of Higher Education (20050004016)
文摘The existing constructions of quasi-cyclic low-density parity-check （QC-LDPC） codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead to the bit error rate （BER） performance of QC-LDPC codes being much poorer than that of randomly constructed LDPC codes even decoding failure. To solve the problem, some theorems of the specific chosen parity-check matrix of QC-LDPC codes without small stopping sets and small girth are proposed. A novel construction for QC-LDPC codes with long block lengths is presented by multiplying mmin or the multiple of mmin, which is the minimum order of the identity matrix for the chosen parity-check matrix. The simulation results show that the specific chosen parity-check matrix of QC-LDPC codes can effectively avoid specified stopping sets and small girth and exhibit excellent BER performance than random LDPC codes with the same longer codes length.
基金Supported by the National Key Basic Research Program (973) Project (No. 2010CB328300)the 111 Project (No. B08038)
文摘A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and the designed codes perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing EG-LDPC codes.
基金National Natural Science Foundation of China(No.61272432)Qingdao Science and Technology Development Plan(No.12-1-4-6-(10)-jch)
文摘Watermarking system based on quantization index modulation （QIM） is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronization attacks of QIM digital watermarking,a low density parity check （LDPC） code-aided QIM watermarking algorithm is proposed,and the performance of QIM watermarking system can be improved by incorporating LDPC code with message passing estimation/detection framework.Using the theory of iterative estimation and decoding,the watermark signal is decoded by the proposed algorithm through iterative estimation of amplitude scaling parameters and decoding of watermark.The performance of the proposed algorithm is closer to the dirty paper Shannon limit than that of repetition code aided algorithm when the algorithm is attacked by the additive white Gaussian noise.For constant amplitude scaling attacks,the proposed algorithm can obtain the accurate estimation of amplitude scaling parameters.The simulation result shows that the algorithm can obtain similar performance compared to the algorithm without desynchronization.
