Hello, thank you for your contribution. But regarding your algorithm, I have a question that I don't quite understand. The size of each A or B block in the algorithm is 2226 * 1024, which is approximately 52 seconds per block. That is, the 510 bit synchronization information and 858 * 2 bit watermark information are hidden in the 2226 * 1024 frame (52 second audio). However, I first watermark the audio and then crop out 15 seconds, and the program can still complete the correct embedding. This is amazing, May I ask how your algorithm works?
Hello, thank you for your contribution. But regarding your algorithm, I have a question that I don't quite understand. The size of each A or B block in the algorithm is 2226 * 1024, which is approximately 52 seconds per block. That is, the 510 bit synchronization information and 858 * 2 bit watermark information are hidden in the 2226 * 1024 frame (52 second audio). However, I first watermark the audio and then crop out 15 seconds, and the program can still complete the correct embedding. This is amazing, May I ask how your algorithm works?