Contents
- 1 Signal space representation of linear modulation
- 2 Coherent demodulation and optimal receiver
- 3 On–off keying (2–ASK)
- 4 Binary phase shift keying (BPSK)
- 5 M–level amplitude shift keying (M–ASK)
- 6 Quadrature amplitude modulation (M-QAM)
- 7 Multi-level phase–shift keying (M–PSK)
- 8 Binary frequency shift keying (2–FSK)
- 9 Minimum Shift Keying (MSK)
- 10 Exercises for the chapter
- 11 References
Signal space representation of linear modulation
In the first three chapters of this fourth main chapter: "Generalized Description of Digital Modulation Methods", the structure of the optimal receiver and the signal representation by means of basis functions were treated by the example of baseband transmission.
With the same systematics and the same uniformity, band–pass systems will now also be considered which have already been described in earlier books or chapters, namely
- in the main chapter 4: "Digital Modulation Methods" of the book "Modulation Methods",
- in the chapter "Linear Digital Modulation - Coherent Demodulation" of the present book.
In the following, we restrict ourselves to linear modulation methods and coherent demodulation. This means that "the receiver must know exactly the frequency and phase of the carrier signal added to the transmitter".
In the following chapter "Carrier Frequency Systems with Non-Coherent Demodulation" are discussed.
In the case of coherent demodulation, the entire transmission system can be described in the "equivalent low-pass domain", and the relationship to baseband transmission is even more obvious than when band-pass signals are considered.
This results in the sketched model. Complex quantities are marked by a yellow filled double arrow. It should be noted with regard to this graph:
- From the incoming bit stream ⟨qk⟩∈{0, L}, b data bits each are converted serially/parallel. These output bits result in the message m∈{m0,...,mM−1}, where M=2b indicates the level number. For the following, the message m=mi is assumed.
- In the signal space allocation, a complex amplitude coefficient ai=aIi+j⋅aQi is assigned to each message mi, whose real part will form the "in-phase component" and whose imaginary part will form the "quadrature component" of the later transmitted signal.
- At the output of the blue marked block generation of the low-pass signal the (in general) complex-valued "equivalent low-pass signal" is present, where gs(t) shall be limited for the time being to the range 0≤t≤T just like sTP(t). The index i again provides an indication of the message mi sent:
- sTP(t)|m=mi=ai⋅gs(t)=aIi⋅gs(t)+j⋅aQi⋅gs(t)
- By energy normalization one gets from the basic transmission pulse gs(t) to the basis function
- φ1(t)=gs(t)/√EgswithEgs=∫T0gs(t)2dt
- ⇒sTP(t)|m=mi=sIi⋅φ1(t)+sQi⋅j⋅φ1(t).
- While the coefficients aIi and aQi are dimensionless, the new coefficients sIi and sQi have the unit "root of energy" ⇒ see page "Nomenclature in the fourth main chapter":
- sIi=√Egs⋅aIi,
- sQi=√Egs⋅aQi.
- The equations show that the system considered here is completely described in the equivalent low-pass (German: "Tiefpass" ⇒ "TP") domain by one real basis function φ1(t) and one purely imaginary basis function ψ1(t)=j⋅φ1(t) each, or by a single complex basis function ξ1(t).
- The gray shaded part shows the model for generating the band-pass signal sBP(t), first the generation of the "analytical signal" s+(t)=sTP(t)⋅ej2π⋅fT⋅T and then the real part formation.
- The two basis functions of the band-pass signal sBP(t) result here as energy-normalized and time-limited to the range 0≤t≤T cosine and minus-sine oscillations, respectively.
Coherent demodulation and optimal receiver
In the following, we always assume the equivalent low-pass signal unless explicitly stated otherwise. In particular, the signals
- s(t)=sTP(t) and
- r(t)=rTP(t)
in the graph are "low-pass signals" and thus generally complex. The suffix "TP" is omitted in the remainder of this paper.
To this figure is to be noted:
- The phase delay of the channel (i.e. a phase function increasing linearly with frequency) is expressed in the low-pass range by the time-independent rotation factor ejϕ.
- The signal n′(t) describes a complex white Gaussian random process in the low-pass domain, as given in the section "N-dimensional Gaussian noise". The apostrophe was added in order to be able to work with n(t) later in the overall system.
- The receiver knows the channel phase ϕ and corrects it by the conjugate-complex rotation factor e−jϕ. Thus, the received signal in the equivalent low-pass range is:
- r(t)=s(t)+n′(t)⋅ejϕ=s(t)+n(t).
- The phase rotation does not change the properties of the circular symmetric noise ⇒ n(t)=n′(t)⋅e−jϕ has exactly the same statistical properties as n′(t). The left graphic in the figure above illustrates the facts just described.
- The right graph shows the overall system as used for the rest of the fourth main chapter.
- The AWGN channel is followed by an optimal receiver according to the section "N-dimensional Gaussian noise".
Definition: A symbol error occurs whenever ˆm does not match the sent message m:
- m=mi∩ˆm≠mi.
On–off keying (2–ASK)
The simplest digital modulation method is "On–off keying" (OOK), which has already been described in detail in the book "Modulation Methods" on the basis of its band-pass signals. There, this method was partly also called "Amplitude Shift Keying" (2–ASK).
This method can be characterized as follows:
- OOK is a one-dimensional modulation method (N=1) with sIi={0,E1/2} and sQi≡0 or sIi≡0 and sQi={0,−E1/2}. As an abbreviation, E=Egs.
- The first combination describes a cosinusoidal carrier signal, the second combination a sinusoidal carrier.
- Each bit is assigned to a binary symbol (b=1, M=2); thus, no serial/parallel converter is needed.
- For equally probable symbols, which is assumed for what follows, both the "mean energy per symbol" (ES) and the "mean energy per bit" (EB) are equal to E/2.
- The optimal OOK receiver virtually projects the complex–valued received signal r(t) onto the basis function φ1(t), if one starts from the left sketch (cosine carrier).
- Because of N=1, the noise can be one-dimensional with the variance σ2n=N0/2.
- Using the statements in the section "Error probability for symbols with equal probability", we obtain for the (mean) "symbol error probability":
- pS=Pr(E)=Q(d/2σn)=Q(√E2N0)=Q(√ES/N0).
- Since each bit is mapped to one symbol, the average bit error probability pB is exactly:
- pB=Q(√ES/N0)=Q(√EB/N0).
Binary phase shift keying (BPSK)
The very often used method "Binary Phase Shift Keying" (BPSK), which was already described in detail in the chapter "Linear Digital Modulation" of the book "Modulation Methods" using the band–pass signals (typical: phase jumps), differs from "On–off keying" by a constant envelope.
For the signal space points, s1=−s0 always holds. For example:
- with cosine carrier: sIi={±E1/2} and sQi≡0,
- with sinusoidal carrier: sIi≡0 and sQi={±E1/2}.
The improvements compared to on–off keying can be seen from the equations given in the graphic (in the field with green background):
- For a given normalization energy E, the distance between s0 and s1 is twice as large as with OOK.
- This gives the error probability (both related to symbols and bits):
- pS=pB=Pr(E)=Q(√2E/N0)=Q(√2ES/N0).
- Now ES=EB=E applies, which means that the average energies per symbol or per bit are now twice as large as with OOK.
- Because of factor 2 in the square root in Q-function's argument, the BPSK error probability is noticeably lower than OOK with same ES and N0.
- In other words: With the same N0, BPSK only requires half the symbol energy ES in order to achieve the same error probability as OOK. The logarithmic gain is 3 dB.
M–level amplitude shift keying (M–ASK)
In analogy to "M–level baseband transmission", we now consider "M–level Amplitude Shift Keying" (M–ASK), whose low-pass signal space constellation for the parameters b=3 ⇒ M=8 ⇒ "8–ASK" looks as follows.
The name "M–ASK" is not entirely accurate. Rather, it is a "combined ASK/PSK method", since e.g.
- the two innermost signal space points (±1) do not differ in terms of amplitude ("envelope"),
- but only in terms of phase (0∘ or 180∘).
It should also be noted:
- The "average energy per symbol" can be calculated as follows for this one-dimensional modulation method using symmetry:
- ES=2M⋅M/2∑k=1(2k−1)2⋅E=M2−13⋅E.
- Since each of the M symbols represents b=log2(M) bits, the "average energy per bit" is:
- EB=ESb=ESlog2(M)=M2−13⋅log2(M)⋅E
- ⇒M=8:ES/E=21,EB/E=7.
- The probability that one of the two outer symbols is falsified due to AWGN noise is therefore the same:
- Pr(E|outer symbol)=Q(√2E/N0).
- The falsification probability of the M−2 inner symbols is twice as large, since other decision regions border on both the right and the left. By averaging one obtains for the "symbol error probability":
- pS=Pr(E)=1M⋅[2⋅1⋅Q(√2E/N0)+(M−2)⋅2⋅Q(√2E/N0)]
- ⇒pS=2⋅(M−1)M⋅Q(√2E/N0)=2⋅(M−1)M⋅Q(√6⋅ES(M2−1)⋅N0).
- When using the "Gray code" (neighboring symbols each differ by one bit), the "bit error probability" pB is approximately factor b=log2 (M) smaller than the pS:
- pB≈pSb=2⋅(M−1)M⋅log2(M)⋅Q(√6⋅log2(M)/(M2−1)⋅EB/N0).
Quadrature amplitude modulation (M-QAM)
"Quadrature amplitude modulation" (M–QAM) results from a M–ASK each for the "in-phase component" and the "quadrature component" ⇒ M2 signal space points.
- Each symbol now represents b=log2(M) binary characters (bits).
- The graphic shows the special case M=16 ⇒ b=4.
- The bit assignment for "Gray coding" is shown in red (neighboring symbols each differ by one bit).
The "average energy per symbol" (ES) or the "average energy per bit" (EB) can be easily derived from the result for the "M–ASK" (note the difference in the equation between an energy "E" and the expected value "E[...]"):
- ES=E[|si|2]=E[|sIi|2]+E[|sQi|2]=2⋅E[|sIi|2]
- ⇒ES=2⋅M2I−13⋅E=23⋅(M−1)⋅E,EB=2⋅(M−1)3⋅log2(M)⋅E.
In addition, the M–level quadrature amplitude modulation shows the following properties:
- The "Union Bound" can be used as an upper bound for the symbol error probability, whereby it should be noted that an inner symbol can be falsified in four directions:
- pS=Pr(E)≤{4⋅p2⋅pforM≥16,forM=4,withp=Q(√2E/N0).
- If one takes into account that only the (b−2)2 inner points are falsified in four directions, in contrast, the four vertices are falsified only in two and the remaining points in three directions (blue arrows in the graphic), therefore one obtains with M=b2 the better approximation
- pS≈1/M⋅[(b−2)2⋅4p+4⋅2p+4⋅(b−2)⋅3p]=p/M⋅[4⋅M−16⋅√M+16+8+12⋅√M−24]
- ⇒pS≈4⋅p/M⋅[M−√M]=4p⋅[1−1/√M]
- ⇒M=16:pS≈3⋅p=3⋅Q(√2E/N0)=3⋅Q(√1/5⋅ES/N0).
Conclusion: With M–level QAM, EB=ES/log2(M) generally applies and with Gray coding, pB=pS/log2(M) is also applicable.
- This gives the mean bit error probability:
- pB≈4⋅(1−1/√M)log2(M)⋅Q(√3⋅log2(M)M−1⋅EB/N0).
- The approximation is exactly valid for M≤16 if – as assumed for the upper graphic – no "diagonal falsifications" occur.
- The special case "4–QAM" (without inner symbols) is dealt with in "Exercise 4.13".
Multi-level phase–shift keying (M–PSK)
In the case of multi-level phase modulation, in which case the level number M is usually a power of two in practice, all signal space points are evenly distributed on a circle with radius E1/2. This means that
- ES=E holds for the "'average symbol energy", and
- EB=ES/b=E/log2(M) for the "average energy per bit".
- For the in-phase and quadrature components of the signal space points si, the general rule is (i=0,...,M−1):
- sIi=cos(2πi/M+ϕoff),
- sQi=sin(2πi/M+ϕoff)
- ⇒||si||=√s2Ii+s2Qi=1.
- The phase offset is set to ϕoff=0 in the graphic above. The 4–PSK with ϕoff=π/4 (45∘) is identical to the "4–QAM".
- The distance between two adjacent points is the same in all cases:
- dmin=d0,1=d1,2=...=dM−1,0=2⋅√E⋅sin(π/M)
- ⇒M=4:dmin/E1/2=√2≈1.414,M=8:dmin/E1/2≈0.765,M=16:dmin/E1/2≈0.390.
- The upper bound pUB for the AWGN symbol error probability pS after the "Union Bound" yields:
- pUB=2⋅Q(sin(π/M)⋅√2ES/N0)≥pS.
- One recognises:
- For M=2 (BPSK) one obtains the estimate pS≤pUB=2⋅Q(√2ES/N0). A comparison with the equation pS=Q(√2ES/N0) given on the "BPSK section" shows that in this special case the "Union Bound" returns double the value as the upper limit.
- The larger M is, the more precisely pUB approximates the exact symbol error probability pS. an. The interactive applet "Multi-level PSK & Union Bound" also gives the more accurate error probability obtained through simulation.
Conclusion: The limit for the M–PSK bit error probability is (assuming Gray code ⇒ red labeling):
- pB≤2log2(M)⋅Q(√log2(M)⋅sin(π/M)⋅√2EB/N0).
- However, this limit only has to be applied for M>4.
- For M=2 (BPSK) and M=4 (identity between 4–PSK and 4–QAM), the bit error probability can be specified exactly:
- pB=Q(√2EB/N0).
Binary frequency shift keying (2–FSK)
This type of modulation with parameter b=1 ⇒ M=2 has already been described in detail in the section "FSK – Frequency Shift Keying" of the book "Modulation Methods" using the band-pass signals.
The two possible signal forms are represented by two different frequencies in the range 0≤t≤T:
- sBP0(t)=A⋅cos(2π⋅(fT+ΔfA)⋅t),
- sBP1(t)=A⋅cos(2π⋅(fT−ΔfA)⋅t).
fT designates the carrier frequency and ΔfA the (one-sided) frequency deviation. The average energy per symbol or per bit is the same in each case:
- ES=EB=E=A2⋅T2.
The FSK in the equivalent low-pass signal space is now to be considered here. Then:
- sTP0(t)=√E/T⋅e+j⋅2π⋅ΔfA⋅t,0≤t≤T,
- sTP1(t)=√E/T⋅e−j⋅2π⋅ΔfA⋅t,0≤t≤T,
and for the inner product one obtains
- <sTP0(t)⋅sTP1(t)>=∫T0sTP0(t)⋅s⋆TP1(t)dt=A2⋅∫T0ej⋅4π⋅ΔfA⋅tdt=A2j⋅4π⋅ΔfA⋅[ej⋅4π⋅ΔfA⋅T−1].
Definition: The modulation index h=2⋅ΔfA⋅T is the ratio between the total (bilateral) frequency deviation (2⋅ΔfA) and the symbol rate (1/T).
The two signals are then orthogonal if this inner product is equal to zero:
- <sTP0(t)⋅sTP1(t)>=A2⋅Tj⋅2π⋅h⋅[ej⋅2h−1]=0⇒h=2⋅ΔfA⋅T=1,2,3, ... .
If the modulation index h is assumed to be an integer, the low-pass signals can be written in the form
- sTP0(t)=√E⋅ξ1(t),
- sTP1(t)=√E⋅ξ2(t)
with complex basis functions:
- ξ1(t)=√1/T⋅e+j⋅π⋅h⋅t/T,0≤t≤T,
- ξ2(t)=√1/T⋅e−j⋅π⋅h⋅t/T,0≤t≤T.
The result is the signal space representation of the binary FSK outlined here.
Conclusion:
- With an integer modulation index h, the low-pass signals sTP0(t) and sTP1(t) of the binary FSK are orthogonal to one another.
- This results in the symbol error probability (derivation in the graphic):
- pS=Pr(E)=Q(√ES/N0).
- The bit error probability has the same value: pB=pS.
Note: In contrast to the representation in [KöZ08][1], the frequency deviation ΔfA is defined here on one side. Therefore, the equations sometimes differ by a factor of 2. However, if you work with the modulation index h, there are no differences.
Minimum Shift Keying (MSK)
"Minimum Shift Keying" (MSK) is a binary FSK system with the modulation index h=0.5 ⇒ frequency deviation ΔfA=1/(2T). The graphic shows an MSK signal for the carrier frequency fT=4/T:
- The two frequencies within the transmission signal are f0=fT+1/(4T) to represent the message m0 (yellow background) and f1=fT−1/(4T) ⇒ message m1 (green background).
- The graph also accounts for continuous phase adjustment at the transitions to further reduce the signal bandwidth. This is then referred to as "Continuous Phase Modulation" (CPM).
Without this phase adjustment, the two band-pass waveforms are:
- sBP0(t)=√2E/T⋅cos(2πf0t),0≤t≤T,
- sBP1(t)=√2E/T⋅cos(2πf1t),0≤t≤T.
If you form the inner product of the band-pass signals, you get with fΔ=f0−f1 and fΣ=f0+f1:
- <sBP0(t)⋅sBP1(t)>=2E/T⋅∫T0cos(2πf0t)⋅cos(2πf1t)dt=E/T⋅∫T0cos(2πfΔt)dt+E/T⋅∫T0cos(2πfΣt)dt
- ⇒<sBP0(t)⋅sBP1(t)>=E/T⋅∫T0cos(π⋅t/T)dt+E/T⋅∫T0cos(2π⋅2fT⋅t)dt.
The first integral is zero (integral over "cosine" from 0 to π). For fT≫1/T, which can be assumed in practice, the second integral also vanishes. This gives the inner product:
- <sBP0(t)⋅sBP1(t)>=0.
Conclusion:
- This shows that the two band-pass signals are orthogonal for the modulation index h=0.5 (i.e. MSK) and all multiples thereof.
- With the new real basis functions
- φ1(t)=√2/T⋅cos(2πf0t),0≤t≤T,
- φ2(t)=√2/T⋅cos(2πf1t),0≤t≤T
- one obtains exactly the same signal space constellation as for even-numbered h=1,2,3, ....
- This results in the same error probability:
- pS=Pr(E)=Q(√ES/N0)=pB.
Exercises for the chapter
Exercise 4.11: On-Off Keying and Binary Phase Shift Keying
Exercise 4.11Z: OOK and BPSK once again
Exercise 4.12: Calculations for the 16-QAM
Exercise 4.14: 8-PSK and 16-PSK
Exercise 4.14Z: 4-QAM and 4-PSK
Exercise 4.15: Optimal Signal Space Allocation
Exercise 4.16: Binary Frequency Shift Keying
References
- ↑ Kötter, R., Zeitler, G.: Nachrichtentechnik 2. Vorlesungsmanuskript, Lehrstuhl für Nachrichtentechnik, Technische Universität München, 2008.