Digital Modulation
Digital Modulation
A more complex digital modulation technique can transmit more bits per
second than a less complex digital modulation technique. There is therefore a
trade-off between the complexities of the system and its capacity. In recent
years, microprocessors, DPS and FPGAs have improved in performance, while
being smaller and cheaper. These technological advances have contributed to
the improvement of systems using digital modulation.
Robustness to noise
An analog modulation is not very robust to noise while a digital modulation can
be exposed to a certain intensity of noise before displaying transmission errors.
This difference is explained by the very nature of digital modulation, that is to
say, by the fact that the digitally modulated signal take one state among a finite
number of states. Thus, the receiver will succeed in re-establishing a digital
signal disturbed by noise (up to a certain noise level). ASK-FSK-PSK
ASK-FSK-PSK.jpg
A: the amplitude
f: frequency
φ: phase
y (t) = A sin (2 π ft + φ)
For example, when a carrier is phase shift modulated by a binary signal, the
carrier can take only two phase values. In short, the carrier can take a finite
number of phases (2) which means that it is a digital modulation.
PSK
Digital phase modulation is called phase-shift keying (PSK) or phase-shift
modulation. In the simplest case, the carrier is modulated by a binary signal.
We then speak of 'binary phase-shift keying' (BPSK). When the modulating
signal has more than one level, for example 4, the modulated carrier has four
possible phases (4PSK). When the modulating signal has 3 bits per symbol (8
levels), the carrier has 8 possible phases (8PSK). As the number of bits per
symbol increases, it becomes difficult for a demodulator to distinguish the
symbols since they are very close on the constellation. PSK modulation only
involves a phase change of the carrier which gives a circular pattern on the
constellation. QAM modulation uses a matrix scheme which allows more bits
per symbol to be transmitted under the same conditions (same noise, same
bandwidth).
I/Q
500px-Unit circle.svg.png
This article titled I / Q Data for Dummies provides excellent visual aids that can
facilitate understanding of spinning vectors as well as I / Q data.
QAM
Schematic diagram of a QAM modulator.
A small MER implies a large cloud of points over the constellation. That is to
say, significant modulation errors which is bad!
A large MER implies a small cloud of points over the constellation. That is,
low modulation errors which is good!
For more information on MER, see the presentation by Ron Hranac, Engineer at
Cisco.
Filtering
Error detection and correction are techniques that allow the transmission of
digital data over imperfect transmission media (with noise).
Error detection
The simplest error detection method is to transmit the same data successively.
In Example 1 of the table above, one byte is transmitted twice and these two
bytes are received without problem. In example 2, a byte is transmitted twice
without the reception having received two different bytes, which indicates a
transmission error.
Another method of error detection is called goal parity. Suppose the goal is the
transmission of seven bits plus the parity bit. The parity bit can be defined as
being equal to zero if the sum of the other bits is even and to one otherwise.
We speak of even parity (3rd column of the table below).
Parity
A second convention can be taken, the parity bit is then defined as being equal
to one if the sum of the other bits is even and to zero otherwise. The result
corresponds to the fourth column of the table below.
We must not confuse parity of a number, and the fact that it is even or odd (in
the mathematical sense of the term). The binary number 00000011 (3 in
decimal number) is odd (not divisible by 2) but of even parity (even number of
bits at 1).
An error is detected when the parity bit of the data received does not
correspond to the number of bits equal to 1. This method has the advantage of
being simple, except that it only allows the detection of an odd number of
errors.
CRC
In telecommunications, computers and some digital devices, a cyclic
redundancy check or CRC (Cyclic Redundancy Check) is a technique for
detecting transmission errors. CRCs are evaluated (sampled) before and after
transmission or transfer, then compared to make sure the data is exactly the
same. The most commonly used CRC calculations are designed so that errors of
certain types can always be detected, such as those due, for example, to
interference during transmission.
CRC functions are found in various software such as those dedicated to backup,
data capture (sampling) as well as in digital signal transmission devices and
devices: DVB, MPEG-2 TS, DAB, etc.
Error correction
There are several error correction codes, but the most famous are:
Hamming code
Golay code
BCH code
Reed-Solomon code
Reed-solomon
The Reed-Solomon code is used among others for CD, DVB protocol (European
digital television), DOCSIS, ADSL.
The number of bits that can be corrected depends on the complexity of the
code.
Concept (approximation)
The difference between the simple sum calculated (27) and that received (23)
indicates the value of the error: 4 (27-23 = 4)
The difference between the calculated weighted sum (64) and that received
(56), itself divided by the value of the error indicates the position where the
error is found: 2 ((64-56) / 4 = 2) .
We must therefore remove 4 from the number of row 2.