Professional Documents
Culture Documents
Abstract
The VLSI Implementation of the Watermarking
Digital watermarking is a technique of embedding technique demands the flexibility of implementation both
imperceptible information into the digital documents. In in the computation and design complexity. This mainly
this paper, VLSI implementation of Digital Watermarking limits the choice of the watermarking technique.
technique is presented for 8 bit gray scale images. This Spatial domain watermarking offers less computational
implementation of fragile invisible watermarking is overhead compared to that of frequency domain. The
carried out in spatial domain. The standard ASIC design alteration of LSB bit plane of host image with the
flow for 0.13µ CMOS technology has been used to watermark (copyright) provides a simple and faster
implement the algorithm. The area of the chip is 3,453 x technique and seems to hold up well under lossy image
3,453 µm2 and the power consumption is 37.6µW. compression and selected filtering techniques [2]- [4].
Digital Watermarking has many applications ranging
from document authentication to medical imaging [4] to
Index terms: Watermarking, Image Processing, VLSI, ASIC satellite image and VLSI Intellectual Property Protection
design [5].
Watermarking techniques for paper To our knowledge, this work gives the first VLSI
manufacturing have been in use since late middle ages. Implementation of Digital Watermarking technique. The
Digitization of our world has expanded this concept of above listed reasons are the criteria of selection of spatial
watermarking to the digital documents viz. text, graphics domain watermarking technique. Alteration of LSB bit
and multimedia. A digital watermark is essentially an plane with the copyright is used as the watermarking
imperceptible digital signal or pattern embedded into technique for the VLSI implementation for 8 bit gray scale
multimedia content for authentication and protecting images.
ownership rights. Section II describes the watermarking algorithm along
Watermarking technique can be implemented in both with the encryption process of the copyright. Section III
spatial domain and frequency domain. In spatial domain, details the extraction of the watermark and image
the lower order bits of the image pixels are replaced with authentication. Section IV details the 0.13µ CMOS ASIC
that of the watermark or adding some fixed intensity value design implementation, which features the design flow
to an image. In frequency domain, Watermarking can also from Verilog HDL coding to GDSII and the issues faced
be applied in the transform domain, including such during implementation. Simulation results and conclusion
transforms are Fast Fourier, discrete cosine, and wavelet. are presented in Sections V and VI respectively.
In the case of frequency domain, the lower frequency
components can be altered from the original [1], [2]. 2. Incorporating the watermark
______________________ Fig. 2 indicates the complete block diagram for the
†
The authors were presently with Texas Instruments India, on long
ASIC implementation of watermarking scheme for 8-bit
term project, where the computational work of this paper has been grayscale images. Here the spatial domain is considered
carried out. for the invisible watermark implementation.
RESETZ
BUSY
EZ
WZ READY
START
DATA1_OUT [7:0]
ADDRESS_IN [15:0]
RESET INITZ
CLK CLK
RAM1 INITIALIZATION
RESETZ • WZ
40K
ADDRESS_GEN
EZ
RAM1
40K X 8
RAM1 ADDR GEN RAM1 DATA INIT
ADDRESS IN RAM1 ADDR
16
RAM1 DATA
DATA IN 8
SYNC OF
RAM SIGNALS
•
RAM1 WZ
&
WZ
• RAM1 CTRL GEN RAM1_EZ
ADDR
EZ
• CLK ENCODING
8 DATA1 OUT
2048 BIT REG
START DATA
8 BIT REG SELECTION LOGIC
RAM2 EZ 8
DATA2 OUT
SYNC OF RAM2 WZ
RAM SIGNALS
ADDR [10 : 0]
& DATA
CONTROL SIGNAL A[15 : 11]
RAM2 CTRL GEN DATA
GENERATION FOR RAM2
ADDR
RAM1 & RAM2 WZ
EZ 2K X 8
CLK
BUSY
CLK RESET INITZ
RESETZ
READY
Design
Block Level Design Requirements and
Specifications
Pseudo Code
T RTL Coding
i
m Synthesis
i
n
g Prelayout Simulation
C Floor Planning
o
n
Timing Driven Placement and optimization
s
t
r Clock Tree Synthesis
a
i
Route Initial and Final
n
t
s Extraction
Hand Off
Export