Amplitude-shift keying (ASK) is a form of amplitude modulation that represents digital data as variations in the amplitude of a carrier wave.
In an ASK system, a symbol, representing one or more bits, is sent by transmitting a fixed-amplitude carrier wave at a fixed frequency for a specific time duration. For example, if each symbol represents a single bit, then the carrier signal will be transmitted when the input value is 1, but will not be transmitted when the input value is 0.
Any digital modulation scheme uses a finite number of distinct signals to represent digital data. ASK uses a finite number of amplitudes, each assigned a unique pattern of binary digits. Usually, each amplitude encodes an equal number of bits. Each pattern of bits forms the symbol that is represented by the particular amplitude. The demodulator, which is designed specifically for the symbol-set used by the modulator, determines the amplitude of the received signal and maps it back to the symbol it represents, thus recovering the original data. Frequency and phase of the carrier are kept constant.
Like AM, an ASK is also linear and sensitive to atmospheric noise, distortions, propagation conditions on different routes in PSTN, etc. Both ASK modulation and demodulation processes are relatively inexpensive. The ASK technique is also commonly used to transmit digital data over optical fiber. For LED transmitters, binary 1 is represented by a short pulse of light and binary 0 by the absence of light. Laser transmitters normally have a fixed "bias" current that causes the device to emit a low light level. This low level represents binary 0, while a higher-amplitude lightwave represents binary 1.
The simplest and most common form of ASK operates as a switch, using the presence of a carrier wave to indicate a binary one and its absence to indicate a binary zero. This type of modulation is called on-off keying (OOK), and is used at radio frequencies to transmit Morse code (referred to as continuous wave operation),
More sophisticated encoding schemes have been developed which represent data in groups using additional amplitude levels. For instance, a four-level encoding scheme can represent two bits with each shift in amplitude; an eight-level scheme can represent three bits; and so on. These forms of amplitude-shift keying require a high signal-to-noise ratio for their recovery, as by their nature much of the signal is transmitted at reduced power.
ASK system can be divided into three blocks. The first one represents the transmitter, the second one is a linear model of the effects of the channel, the third one shows the structure of the receiver. The following notation is used:
*''h_{t}''(f) is the carrier signal for the transmission
*''h_{c}''(f) is the impulse response of the channel
*''n''(t) is the noise introduced by the channel
*''h_{r}''(f) is the filter at the receiver
*''L'' is the number of levels that are used for transmission
*''T''_{s} is the time between the generation of two symbols
Different symbols are represented with different voltages. If the maximum allowed value for the voltage is A, then all the possible values are in the range ˆ’A, Aand they are given by:
:$v\_i\; =\; \backslash frac\; i\; -\; A;\; \backslash quad\; i\; =\; 0,1,\backslash dots,\; L-1$
the difference between one voltage and the other is:
:$\backslash Delta\; =\; \backslash frac$
Considering the picture, the symbols vare generated randomly by the source S, then the impulse generator creates impulses with an area of v These impulses are sent to the filter ht to be sent through the channel. In other words, for each symbol a different carrier wave is sent with the relative amplitude.
Out of the transmitter, the signal s(t) can be expressed in the form:
:$s\; (t)\; =\; \backslash sum\_^\backslash infty\; v\backslash cdot\; h\_t\; (t\; -\; n\; T\_s)$
In the receiver, after the filtering through hr (t) the signal is:
:$z(t)\; =\; n\_r\; (t)\; +\; \backslash sum\_^\backslash infty\; v\backslash cdot\; g\; (t\; -\; n\; T\_s)$
where we use the notation:
:$\backslash begin\; n\_r\; (t)\; \&=\; n\; (t)\; *\; h\_r\; (t)\; \backslash \backslash \; g\; (t)\; \&=\; h\_t\; (t)\; *\; h\_c\; (t)\; *\; h\_r\; (t)\; \backslash end$
where * indicates the convolution between two signals. After the A/D conversion the signal zcan be expressed in the form:
:$z=\; n\_r+\; vg+\; \backslash sum\_\; vg-n/math>\; In\; this\; relationship,\; the\; second\; term\; represents\; the\; symbol\; to\; be\; extracted.\; The\; others\; are\; unwanted:\; the\; first\; one\; is\; the\; effect\; of\; noise,\; the\; third\; one\; is\; due\; to\; the\; intersymbol\; interference.\; If\; the\; filters\; are\; chosen\; so\; that\; g(t)\; will\; satisfy\; the\; Nyquist\; ISI\; criterion,\; then\; there\; will\; be\; no\; intersymbol\; interference\; and\; the\; value\; of\; the\; sum\; will\; be\; zero,\; so:\; :$ z=\; n\_r+\; vg/math>\; the\; transmission\; will\; be\; affected\; only\; by\; noise.$$

** Probability of error **

The probability density function of having an error of a given size can be modelled by a Gaussian function; the mean value will be the relative sent value, and its variance will be given by:
:$\backslash sigma\_N^2\; =\; \backslash int\_^\; \backslash Phi\_N\; (f)\; \backslash cdot\; |H\_r\; (f)|^2\; df$
where $\backslash Phi\_N\; (f)$ is the spectral density of the noise within the band and Hr (f) is the continuous Fourier transform of the impulse response of the filter hr (f).
The probability of making an error is given by:
:$P\_e\; =\; P\_\; \backslash cdot\; P\_\; +\; P\_\; \backslash cdot\; P\_\; +\; \backslash cdots\; +\; P\_\; \backslash cdot\; P\_\; =\; \backslash sum^\_\; P\_\; \backslash cdot\; P\_$
where, for example, $P\_$ is the conditional probability of making an error given that a symbol v0 has been sent and $P\_$ is the probability of sending a symbol v0.
If the probability of sending any symbol is the same, then:
:$P\_\; =\; \backslash frac$
If we represent all the probability density functions on the same plot against the possible value of the voltage to be transmitted, we get a picture like this (the particular case of $L\; =\; 4$ is shown):
The probability of making an error after a single symbol has been sent is the area of the Gaussian function falling under the functions for the other symbols. It is shown in cyan for just one of them. If we call $P^+$ the area under one side of the Gaussian, the sum of all the areas will be: $2\; L\; P^+\; -\; 2\; P^+$. The total probability of making an error can be expressed in the form:
:$P\_e\; =\; 2\; \backslash left(\; 1\; -\; \backslash frac\; \backslash right)\; P^+$
We now have to calculate the value of $P^+$. In order to do that, we can move the origin of the reference wherever we want: the area below the function will not change. We are in a situation like the one shown in the following picture:
it does not matter which Gaussian function we are considering, the area we want to calculate will be the same. The value we are looking for will be given by the following integral:
:$P^+\; =\; \backslash int\_^\; \backslash frac\; e^\; d\; x\; =\; \backslash frac\; \backslash operatorname\; \backslash left(\; \backslash frac\; \backslash right)$
where $\backslash operatorname(x)$ is the complementary error function. Putting all these results together, the probability to make an error is:
$P\_e\; =\; \backslash left(\; 1\; -\; \backslash frac\; \backslash right)\; \backslash operatorname\; \backslash left(\; \backslash frac\; \backslash right)$
from this formula we can easily understand that the probability to make an error decreases if the maximum amplitude of the transmitted signal or the amplification of the system becomes greater; on the other hand, it increases if the number of levels or the power of noise becomes greater.
This relationship is valid when there is no intersymbol interference, i.e. $g(t)$ is a Nyquist function.

See also

* Frequency-shift keying (FSK)

External links

Calculating the Sensitivity of an Amplitude Shift Keying (ASK) Receiver

{{DEFAULTSORT:Amplitude-Shift Keying Category:Quantized radio modulation modes Category:Applied probability Category:Fault tolerance

See also

* Frequency-shift keying (FSK)

External links

Calculating the Sensitivity of an Amplitude Shift Keying (ASK) Receiver

{{DEFAULTSORT:Amplitude-Shift Keying Category:Quantized radio modulation modes Category:Applied probability Category:Fault tolerance