This work advocates the formulation of digital watermarking as a communication problem. We consider watermarking as communication with side information available for both encoder and decoder. A generalized watermarking channel is considered that includes geometrical attacks, fading and additive non-Gaussian noise. The optimal encoding/decoding scenario is discussed for the generalized watermark...

In principle, to nd the optimal code one needs to optimize the tness functionH with respect to all its 2 m s degrees of freedom, the m s entries of the encoder e i and the m s entries of the decoder dj!, taking into account the m conservation relations for the encoder P i e i = 1 and the s conservation relations for the decoder P ! dj! = 1. However, although the degrees of freedom of the encode...

A generic M-ary continuous phase modulation (CPM) scheme, with a modulation index of h = 1/M, can be decomposed into a continuous-phase encoder (CPE) followed by a memoryless modulator (MM), where the CPE is linear over the ring of integers modulo M. By using a channel encoder (CE), which is a convolutional encoder, to operate over the same ring of integers modulo M, the CE and the CPE can be c...

Electrical drives frequently use incremental encoders as position sensor. The paper deals with the modeling and simulation of an incremental encoder and associated units for processing the information provided by the encoder. A mathematical model of the incremental encoder is presented. Based on encoder signals the direction of the rotation, the position and the speed are identified. The descri...

In this paper we introduce a VLSI priority encoder that uses a novel priority lookahead scheme to reduce the delay for the worse case operation of the circuit, while maintaining a very low transistor count. The encoder's topmost input request has the highest priority; this priority descends linearly. Two design approaches for the priority encoder are presented, one without a priority lookahead ...

Images typically contain smooth regions, which are easily compressed by linear transforms, and high activity regions (edges, textures), which are harder to compress. To compress the first kind, we use a “zero” encoder that has infinite context, very low capacity, and which adapts very quickly to the content. For the second, we use an “interpolation” encoder, based on neural networks, which has ...

IEEE 802.11 and Bluetooth are the two different wireless systems that share the same frequency band in 2.4 GHz and are likely to interfere with each other if operating in the same environment and thus experience a severe decrease in throughput. The devices equipped with IEEE 802.11 and Bluetooth are mobiles, laptops, watches and many more and in future with WiMAX. Result is the number of co-loc...

To estimate the convolutional encoder state from received data, one may use the inverse to the encoder G. However, channel errors make this method unreliable. We propose a method that uses the received data in the following way. We calculate the syndrome, and after a specific number of received syndrome values equal to zero, we expect that the corresponding received data is also error-free. The...