By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaotian Xu ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Yong Liang Guan ; Kah Chan Teh

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.

Published in:

Signal Processing Letters, IEEE  (Volume:16 ,  Issue: 3 )