Performance analysis of binned orthogonal/bi-orthogonal block code as dirty-paper code for digital watermarking application

Xiaotin Xu; Yong Liang Guan; Kah Chan Teh

doi:10.1109/LSP.2008.2010808

Performance analysis of binned orthogonal/bi-orthogonal block code as dirty-paper code for digital watermarking application

Xiaotin Xu^*, Yong Liang Guan, Kah Chan Teh

^*Corresponding author for this work

Nanyang Technological University

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	208-211
Number of pages	4
Journal	IEEE Signal Processing Letters
Volume	16
Issue number	3
DOIs	https://doi.org/10.1109/LSP.2008.2010808
Publication status	Published - 2009
Externally published	Yes

ASJC Scopus Subject Areas

Signal Processing
Electrical and Electronic Engineering
Applied Mathematics

Keywords

Digital watermarking
Dirty-paper coding

Access to Document

10.1109/LSP.2008.2010808

Cite this

@article{9b8caaf022c243adacfe1fb42cbd6ee8,

title = "Performance analysis of binned orthogonal/bi-orthogonal block code as dirty-paper code for digital watermarking application",

abstract = "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.",

keywords = "Digital watermarking, Dirty-paper coding",

author = "Xiaotin Xu and Guan, \{Yong Liang\} and Teh, \{Kah Chan\}",

year = "2009",

doi = "10.1109/LSP.2008.2010808",

language = "English",

volume = "16",

pages = "208--211",

journal = "IEEE Signal Processing Letters",

issn = "1070-9908",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Performance analysis of binned orthogonal/bi-orthogonal block code as dirty-paper code for digital watermarking application

AU - Xu, Xiaotin

AU - Guan, Yong Liang

AU - Teh, Kah Chan

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Digital watermarking

KW - Dirty-paper coding

UR - http://www.scopus.com/inward/record.url?scp=60849109220&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=60849109220&partnerID=8YFLogxK

U2 - 10.1109/LSP.2008.2010808

DO - 10.1109/LSP.2008.2010808

M3 - Article

AN - SCOPUS:60849109220

SN - 1070-9908

VL - 16

SP - 208

EP - 211

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

IS - 3

ER -

Performance analysis of binned orthogonal/bi-orthogonal block code as dirty-paper code for digital watermarking application

Abstract

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this