Unit2-S3-Baseband Data Format and Protocol and Code Hopping
Unit2-S3-Baseband Data Format and Protocol and Code Hopping
The number of bits in the address field depends on the number of different transmitters
there may be in the system. Often the number of possibilities is far greater than this, to
prevent confusion with neighboring, independent systems and to prevent the statistically
possible chance that random noise will duplicate the address. The number of possible
addresses in the code is 2L1, where L1 is the length of the message field. In many simple
security systems the address field is determined by dip switches set by the user.
Commonly, eight to ten dip switch positions are available, giving 256 to 1024 address
possibilities. In other systems, the addressfield, or device identity number, is a code
number set in the unit microcontroller during manufacture.
This code number is longer than that produced by dip switches, and may be 16 to 24 bits
long, having 65,536 to 16,777,216 different codes. The longer codes greatly reduce the
chances that a neighboring system or random event will cause a false alarm. On the other
hand, the probability of detection is lower with the longer code because of the higher
probability of error. This means that a larger signal-to-noise ratio is required for a given
probability of detection.
Data Field &Parity Bit Field
Data Field
The next part of the message frame is the data field. Its number of bits
depends on how many pieces of information the transmitter may send to
the receiver. For example, the motion detector may transmit three types of
information: motion detection, tamper detection, or low battery.
Parity Bit Field
The last field is for error detection bits, or parity bits. As discussed
later, some protocols have inherent error detection features so the last field
is not needed.
Address field
In all cases, the receiver must be set up to recognize transmitters in its own
system. In the case of dip-switch addressing, a dip switch in the receiver is set
to the same address as in the transmitter. When several transmitters are used
with the same receiver, all transmitters must have the same identification
address as that set in the receiver.
In order for each individual transmitter to be recognized, a subfield of two to
four extra dip switch positions can be used for this differentiation. When a
built-in individual fixed identity is used instead of dip switches, the receiver
must be taught to recognize the identification numbers of all the transmitters
used in the system; this is done at the time of installation.
Several common
ways of accomplishing this are:
(a) Wireless “learn” mode. During a special installation procedure, the
receiver stores the addresses of each of the transmitters which are
caused to transmit during this mode;
(b) Infrared transmission. Infrared emitters and detectors on the
transmitter and receiver, respectively, transfer the address information
(c) Direct key-in. Each transmitter is labelled with its individual address,
which is then keyed into the receiver or control panel by the
system installer;
(d) Wired learn mode. A short cable temporarily connected between
the receiver and transmitter is used when performing the initial address
recognition procedure during installation
Advantages and disadvantages of
the two addressing systems
Code-hopping addressing
While using a large number of bits in the address field reduces the possibility of false
identification of a signal, there is still a chance of purposeful duplication of a
transmitter code to gain access to a controlled entry. Wireless push buttons are
used widely for access control to vehicles and buildings. Radio receivers exist,
popularly called “code grabbers,” which receive the transmitted entry signals and
allow retransmitting them for fraudulent access to a protected vehicle or other site.
To counter this possibility, addressing techniques were developed that cause the
code to change every time the push button is pressed, so that even if the
transmission is intercepted and recorded, its repetition by a would-be intruder will
not activate the receiver, which is now expecting a different code.
This method is variously called code rotation, code hopping, or rolling code
addressing. In order to make it virtually impossible for a would-be intruder to guess
or try various combinations to arrive at the correct code, a relatively large number
of address bits are used. In some devices, 36-bit addresses are employed, giving a
total of over 68 billion possible codes.
How code hopping works
Both the receiver and the transmitter use a common algorithm
to generate a pseudorandom sequence of addresses. This
algorithm works by manipulating the address bits in a certain
fashion. Thus, starting at a known address, both sides of the
link will create the same next address.
For demonstration purposes, Figure in the next slide shows
the same sequence of two digit decimal numbers at the
transmitting side and the receiving side. The solid transmitter
arrow points to the present transmitter address and the solid
receiver arrow points to the expected receiver address.
How code hopping works
Code hopping
After transmission and reception, both transmitter and receiver calculate
their next addresses, which will be the same. The arrows are synchronized
to point to the same address during a system set-up procedure. As long as
the receiver doesn’t miss a transmission, there is no problem, since each
side will calculate an identical next address.
However, if one or more transmissions are missed by the receiver, when it
finally does receive a message, its expected address will not match the
received address. In this case it will perform its algorithm again to create a
new address and will try to match it. If the addresses still don’t match, a
new address is calculated until either the addresses match or a given
number of trials have been made with no success. At this point, the
transmitter and receiver are unsynchronized and the original setup
procedure has to be repeated to realign the transmitter and receiver
addresses.
source encoder
• The source encoder is responsible for
compressing the input information sequence
to represent it with less redundancy. The
compressed data is passed to the channel
encoder.
source encoder
• Source encoding aims to convert information waveforms (text,
audio, image, video, etc.) into bits, the universal currency of
information in the digital world.
• The three major steps are:
• Sampling: convert the continuous-time analog waveform to
discrete-time sequence (but still continuous-valued).
• Quantization: convert each continuous-valued symbol to
discrete-valued representatives.
• Data compression: remove the redundancy in the data and
generate roughly i.i.d. uniformly distributed bits. Source
decoding does the reverse of encoding. In this course, we
focus on the channel coding part and will not go into details of
source coding.
channel encoder
• The channel encoder introduces some
redundancy in the binary information
sequence that can be used by the channel
decoder at the receiver to overcome the
effects of noise and interference encountered
by the signal while in transit through the
communication channel
Modulator and Demodulator
• The purpose of channel encoder is to map the
incoming digital signal into a channel input and for
the decoder to map the channel output into an
output digital signal in such a way that the effect of
channel noise is minimized. That is the combined roll
of channel encoder and decoder is to provide reliable
communication. This provision is satisfied by
introducing redundancy in a prescribed fashion. In the
channel encoder and exploiting it in the decoder, to
reconstruct the original encoder input as accurately
as possible.