Amplitude-shift keying

From Wikipedia, the free encyclopedia

(Redirected from Amplitude Shift Keying)

Modulation techniques
Analog modulation
AM \| SSB \| FM \| PM \| QAM
Digital modulation
OOK \| FSK \| ASK \| PSK \| QAM \| APSK \| MSK \| CPM \| PPM \| TCM \| OFDM
Spread spectrum
v • d • e FHSS \| DSSS

Amplitude-shift keying (ASK) is a form of modulation that represents digital data as variations in the amplitude of a carrier wave.

The amplitude of an analog carrier signal varies in accordance with the bit stream (modulating signal), keeping frequency and phase constant. The level of amplitude can be used to represent binary logic 0s and 1s. We can think of a carrier signal as an ON or OFF switch. In the modulated signal, logic 0 is represented by the absence of a carrier, thus giving OFF/ON keying operation and hence the name given.

Like AM, 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.

1 Encoding
- 1.1 Probability of error
2 See also
3 External links

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, 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.

Here is a diagram showing the ideal model for a transmission system using an ASK modulation:

It 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(t) is the carrier signal for the transmission
h_c(t) is the impulse response of the channel
n(t) is the noise introduced by the channel
h_r(t) 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,A] and they are given by:

$v_i = \frac{2 A}{L-1} i - A; \quad i = 0,1,\dots, L-1$

the difference between one voltage and the other is:

$\Delta = \frac{2 A}{L - 1}$

Considering the picture, the symbols v[n] are generated randomly by the source S, then the impulse generator creates impulses with an area of v[n]. These impulses are sent to the filter h_t 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) = \sum_{n = -\infty}^{\infty} v[n] \cdot h_t (t - n T_s)$

In the receiver, after the filtering through h_r (t) the signal is:

$z(t) = n_r (t) + \sum_{n = -\infty}^{\infty} v[n] \cdot g (t - n T_s)$

where we use the notation:

n r (t) = n (t) * h r (t)

g (t) = h t (t) * h c (t) * h r (t)

where * indicates the convolution between two signals. After the A/D conversion the signal z[k] can be expressed in the form:

$z[k] = n_r [k] + v[k] g[0] + \sum_{n \neq k} v[n] g[k-n]$

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 second 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 [k] = n r [k] + v [k] g [0]

the transmission will be affected only by noise.

The probability density function to make an error after a certain symbol has been sent can be modelled by a Gaussian function; the mean value will be the relative sent value, and its variance will be given by:

$\sigma_N = \int_{-\infty}^{+\infty} \Phi_N (f) \cdot |H_r (f)|^2 df$

where $Φ N (f)$ is the spectral density of the noise within the band and H_r (f) is the continuous Fourier transform of the impulse response of the filter h_r (f).

The possibility to make an error is given by:

$P_e = P_{e/H_0} \cdot P_{H_0} + P_{e/H_1} \cdot P_{H_1} + \dots + P_{e/H_{L-1}} \cdot P_{H_{L-1}}$

where $P_{e/H_0}$ is the conditional probability of making an error after a symbol v_i has been sent and $P_{H_0}$ is the probability of sending a symbol v₀.

If the probability of sending any symbol is the same, then:

$P_{H_i} = \frac{1}{L}$

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 possibility of making an error after a single symbol has been sent is the area of the Gaussian function falling under the other ones. It is shown in cyan just for 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 \left( 1 - \frac{1}{L} \right) P^+$

We have now 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^+ = \int_{\frac{A g(0)}{L-1}}^{\infty} \frac{1}{\sqrt{2 \pi} \sigma_N} e^{-\frac{x^2}{2 \sigma_N^2}} d x = \frac{1}{2} \operatorname{erfc} \left( \frac{A g(0)}{\sqrt{2} (L-1) \sigma_N} \right)$

where erfc() is the complementary error function. Putting all these results together, the probability to make an error is:

$P_e = \left( 1 - \frac{1}{L} \right) \operatorname{erfc} \left( \frac{A g(0)}{\sqrt{2} (L-1) \sigma_N} \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.

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

Retrieved from "http://en.wikipedia.org/wiki/Amplitude-shift_keying"

Category: Radio modulation modes

Searching reference...

Reference

Sources

Amplitude-shift keying

From Wikipedia, the free encyclopedia

Contents

Top Matching Results

Sponsored Links
This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Searching reference...

Reference

Sources

Amplitude-shift keying

From Wikipedia, the free encyclopedia

Contents

Top Matching Results

Sponsored Links This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Sponsored Links
This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.