The Application Of BCH Code In Parallel Money Search Structure And Digital Watermarking

With the rapid development of science and technology,people have more and more high demands for the current information’s transmission speed,reliability and safety.NAND flash with the high rate of transmission,small equipment volume and data nonvolatile,which is widely applied in many fields,such as digital camera,memory card and other digital media.But the high-capacity SSD cannot ensure the data occur error due to the Due to the limitation of craftwork and technology,in the actual,error correction coding is performed to improve the accuracy of the data.In ensuring the speed of information transmission,at the same time,but also to ensure that personal information,trade secrets are not stolen.Digital watermarking technology as an important branch of information security and copyright protection,which is extensive used in the protection of digital media copyright.Currently,digital watermarking technology is still not a unified standard,to ensure that the technology can protect the data in different kinds of environment is the urgent problem to be solved at present.1)This paper briefly introduces the basic principles of error correcting codes and finite fields,and proposes a new method of improving and optimizing the parallel money in BCH decoder based on the literature and related algorithms.Firstly,the traditional parallel Chien search and related references are analyzed and studied.Then,the search range of common subexpression is extended,and the relevant calculation is merged.Finally,iterative matching algorithm is improved,and an improved iterative matching algorithm based on two-dimensional search is proposed.The experimental results show that this method has achieved good optimization results,effectively reduces the complexity of parallel Chien search,and can better adapt to parallel Chien search architectures of various parallel factors and various error correcting capability.2)A digital watermarking algorithm based on JND model of BCH error correcting code and visual system is also studied.A kind of digital image watermarking algorithm is proposed which based on primitive BCH code and the JND model of human visual system’s features.The original carrier image and the watermark image are gray image,firstly,scramble the watermark image with Arnold transform to generate the encrypted watermark information,and systematic encode it with BCH code;afterwards,divide the carrier image into blocks and deal it with 2-D discrete wavelet transform and calculate the JND value of each pixel in the low frequency sub-band,embed the watermark information into the low frequency region of the carrier image combined with the JND model adaptively.The feasibility of the algorithm is verified through software simulation experiment.