Performance Analysis of Binned Orthogonal/Bi-Orthogonal Block Code as Dirty-Paper Code for Digital Watermarking Application

A binned dirty-paper code (DPC) divides a set of codewords into a number of bins. The codeword in the bin that has the maximum correlation with the side information is selected as the transmitted dirty-paper codeword. This letter derives and verifies the analytical bit-error rate (BER) expression of binned orthogonal block code used as DPC in watermarking applications. The BER trends of such orthogonal DPC under constant code length or constant code rate constrains are analyzed. Finally, we propose a new class of DPC based on binned bi-orthogonal codes and demonstrate its BER performance gain over orthogonal DPC.