Synchronization and Bit Detection in a Single Spreading Sequence SAMA Receiver
BACKGROUND OF THE INVENTION
This application claims the benefit of U.S. Provisional Application No. 60/082,863, filed April 24, 1998.
SUMMARY OF THE INVENTION
In a Spread ALOHA receiver, when the received signal is a linear combination of the transmitted signals the detection of multiple overlapping packets is simplified. In the present invention, equations are derived that describe a QAM modulation and demodulation process in order to specify a common notation to be used in the network design. In the case of a single transmitter the derived equations are well known. For the case of a Spread ALOHA multiple access channel however, interest lies in the simultaneous reception of many overlapping signals. The problem does not appear to have been treated in the literature.
A receiver for spread bit packet signal transmissions has an input line with a QAM modulator connected thereto. The QAM modulator has a splitter connected to the input line for separating the input into first and second paired inputs. First and second multipliers are connected to the first and second pair inputs. A numerically controlled oscillator is connected to the first multiplier. A 90° phase shifter is connected to the numerically controlled oscillator and is connected to the second multiplier. First and second output lines are connected to the first and second multipliers. First and second low pass filters are connected to the first and second output lines for removing high frequencies from the outputs. First and second demodulated signal lines are connected to outputs of the first and second low pass filters, and first and second despreading filters are connected to the first and second demodulated signal lines. First and second despread signal lines are connected to outputs of the first and second despreading filters. First
and second pairs of synchronization matched filters are connected to the first and second despread signal lines for producing packet synchronization sequence outputs.
A preferred method of information detection in a single spreading sequence receiver comprises receiving packet and chip signals in QAM modulated carrier wave signals with inline and quadrature components. The received signals are supplied to first and second multipliers. Output is supplied from a numerically controlled oscillator to the first multiplier and to a 90° phase shifter. An output is supplied from the 90° phase shifter to the second multiplier. Output signals are supplied from the first and second multipliers to first and second low pass filters, and high frequency signals are removed in the low pass filters. First and second outputs are provided from the first and second low pass filters to first and second despreaders. First and second despread signals are provided from output of the first and second despreaders to inputs of first and second pairs of synchronization filters.
In one preferred embodiment, inputs of first and second synchronization filters are connected in parallel and the first despread signal is supplied from the first despreader to the inputs of the first and second synchronization filters. Second and third synchronization filters are connected in parallel to an output of the second despreader. Despread signals are supplied from the output of the second despreader to inputs of the third and fourth synchronization filters. Outputs of the first and third synchronization filters are supplied to a first adder. Outputs of the second and fourth sychronization filters are supplied to a second adder. An output of the first adder and an output of the second adder are squared, and squared outputs from the first and second squarers are added in a third adder. A threshold of an output from the third adder is detected as a start of a packet.
These and further and other objects and features of the invention are apparent in the disclosure, which includes the above and ongoing written specification, with the claims and the drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 is a schematic representation of a QAM modulator.
Figure 2 is a schematic representation of a QAM demodulator.
Figure 3 is a schematic representation of a multiple access QAM demodulator.
Figure 4 is a schematic representation of synchronization matched filters.
Figure 5 is a schematic representation of a multiple access QAM demodulator and packet detector.
Figure 6 is a schematic representation of a multiple access QAM demodulator and packet detector.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Transmitter for One Signal
Assume we have two bandlimited signals, a, (t) and aQ(t) in transmitter 40. The QAM modulation 44 of these signals 41, 51 is accomplished by multiplying 43, 53 the signals 41, 41 by the output 45 of a numerically controlled oscillator (NCO) 47 while the quadrature multiplication 53 is shifted 90 degrees in phase. A block diagram of a QAM modulator 44 is shown in Figure 1.
The output 55 of the phase shifter 57 is used in multiplier 53. The outputs 49 and 59 of the multipliers 43 and 53 are added 62 to produce an output signal 61.
In the usual situation, the in-phase 41 and quadrature 51 signals, aj (t) and aQ(t), are bandlimited to a frequency much less than the carrier frequency ωQ. The phase shift, ΘQ of the NCO 47 is assumed to be a random variable and not a function of time.
Receiver for One Signal
The receiver 60 has a demodulator 64 for signal 61, as shown in Figure 2. The overall structure of the demodulator 64 is similar to that of the modulator 44. The multiplication 63, 73 of the input 61 by the output 65 of an NCO 67 and the output 75 of phase shifter 77 results in a double frequency component and a baseband component in each channel 69, 79. The double frequency component is filtered out by low pass filters (LPF) 83, 93 and the outputs 81, 91 are just the original baseband signal, if <5, the phase offset in the NCO 67 of the demodulator 64 is small.
To simplify the notation we define ωt + θ = Θ (1)
Then the result of the top multiplication in Figure 2 is
C| (t) = a, (t)cos(θ)cos(θ+δ) - aQ(t)sin(θ)cos(θ+<5) = 1/2 a, (t)cos(2θ+<5) + 1/2 a, (t) cost (<S)
- 1/2 aQ(t)sin(2Θ+(5) + 1/2 aQ(t)sin(δ) (2) and after elimination of the double frequency terms we have d, (t) = Y2 a, (t) cos( δ) + y2 aQ (t) sin( δ) (3) so that for <S = 0 we have d| (t) = 1/2 a( (t) .
Similarly, cQ (t) = - a, (t) cos( Θ) sirι( Θ + δ) + aQ (t) sin( Θ) sin( Θ + δ) = - y2 a, (t) sin( 2 Θ+ δ) - y2 at (t) siπ( δ)
- y2 aQ (t) cos( 2 Θ+ δ) + y2 aQ (t) cos( δ) (4) and after elimination of the double frequency terms, dQ (t) = -/2 a, (t) sin( δ) + y2 aQ (t) cos( δ) (5)
so that for 5 = 0, dQ(t) = 1/2 aQ(t).
Receiver for a Multiple Access Channel
In the case of a Spread ALOHA broadcast channel, the results of (3) and (5) show that a synchronous detector for the reception of a signal from a single transmitter can be
used for reception. In the case of the multiple access channel, however, the received signal is not in the form of c(t) as defined in Figure 1, but rather it consists of a sum of signals each having the form of c(t), but each with a different carrier phase and a different modulated signal. Define this received signal as C(t). π n c(0 = Σ 3 k,(t) cos(ω0t + θk) - ∑ akQ(t) sin(ω0t + θk)
1 , (6)
where the index k specifies a given transmitter and there are n active transmitters in the interval of interest.
Then (3) and (5) , which provide the received signal after the high order frequency terms have been filtered out, may be rewritten for the case of the multiple access channel with independent transmitters as,
D,(t) = ^∑akl(t) cos(δk) +- -∑ akQ(t) sin(δk) (7)
^ . 1 and
From (7) and (8) , it is shown that in the case of a multiple access channel with asynchronous transmitters (that is, multiple RF phase values) , the in-phase and quadrature components of the signal cannot be separated by a single receiver synchronization process.
Therefore, the following asynchronous multiple access generalization of the QAM transmitter 40 and receiver 60 described in Figures 2 and 3 were considered. We assume that the independent I and Q signals 41, 51 of Figure 1, a, (t) and aQ(t) , have been spread by the same spreading sequence, S.
The receiver 60 of Figure 2 is expanded to show the despreading operation at the output of the LPF. In the case of an asynchronous multiple access channel, an identical
despreading filter (DS) 85, 95 is provided at the output of each channel 81, 91 to produce signals 89 and 99.
In order to simplify the analysis, it is assumed that there are only two different active transmitters (k = 2) . After the problem is solved for the case of k = 2, the case for general values of k is obvious. When k = 2, equations (7) and (8) become,
D,(t) = — a1l(t) cos(δ1) + a2l(t) cos(δ2) + a1Q(t) siπ(δ1) + a2Q(t) sin(δ2)^ (9)
and
Defining the outputs of the two despreading filters as shown in Figure 3, and then ignoring the scale factor of 1/2, the equations become,
DID(t) = b1t(t) cos(^) 4- b2,(t) cos(δ2) + b1Q(t) sinfδ,) + b2Q(t ) siπ(δ2) + N, (11)
DQD(t) = -bu(t) sin(δ1) - b2l(t) sin(δ2) + b,Q(t) cosfa) + b2Q(t) cos(δ2) + NQ (12)
Equations (11) and (12) provide sequences of samples with both the I samples and the Q samples in both D| D and DQD. Separation of the desired b (t) signals by means of an RF phase tracking loop as would be done in the case of a channel with only one received signal is not possible here. Therefore, a suboptimal procedure is provided for detecting the packet, composed of a packet detection procedure followed by a bit detection procedure.
Packet Detection/Bit Detection
The two channel outputs, D, D and DQD 89, 99 are shown in Figure 3 and their expressions are provided in equations (11) and (12) . This section describes a suboptimal procedure that allows recovery of the bits in the packets received by the
asynchronous multiple access channel. Optimality is not claimed for this procedure, only that it will work, it is logical, and the processing required is not onerous.
The procedure begins with the process of packet detection, and uses the parameters derived from the packet detection process to make decisions on the bits in the packet. The reason for breaking the process apart in this manner is that the packet detection process operates with an output signal to noise ratio considerably higher than that of the bit detection process.
Equations (11) and (12) may be rewritten focusing on a single received signal and, in order to simplify the discussion, introduce a simplified notation.
Dιo(t) = *>ιι(t) cos(^) + bjQ(t) sin ) + n,(t) (13)
DQD(t) = -bn(t) sinfδ,) + b1Q(t) cos(^) + nQ(t) (U)
In order to detect a packet each of the D**(t) signals are passed through two filters matched to the I and Q channel synchronization pulse sequences. The continuous version of these filters have impulse response functions hj (-t) and hQ(-t), respectively. The result of the synching filters is defined on each of the component input signals, as shown in Figure 4.
The synchronization filters of Figure 4 are added to the multiple access demodulator, as shown in Figure 3, to provide the system defined by the block diagram of Figure 5.
The outputs 89, 99 are provided to synchronization filters 103, 105, 113, 115 to produce outputs 101, 109, 111 and 119.
Then, corresponding to equations (13) and (14) , the following equations are obtained,
Eιι(t) = c1t(t) cos(δ1) + n„(t) (15)
Eio(t) = c1Q(t) sin(δ^) + nIQ(t) (16)
EQI (t) = -c-, , (t) siπ(δ1 ) + nQI(t) (17)
EQQ(t) = c1Q(t) cosfδ,) + πQQ(t) (18)
Since the packet synchronization sequence is known, the pairs of these signals may then be added 121, 123 and then squared 125, 127 to obtain an output 131.
E- = [E (t) + EQQ(t )] [EiQ(t) -Eo/(0] 2 = [cu(t)+cια(f)] 2 + N (19)
and packet detection may be accomplished with a threshold on E2. Note that the pairs of the signals are added before squaring. This results in a 3 db improvement over simply squaring.
Once the start time, Ts , of a packet has been determined by the threshold 133 on E2 it is possible to use that information together with equations (15) through (18) in several ways to estimate either δ^ or sin(δ1) or cosf^).
The estimation procedure for sin (<-■-,) and cos (6-,) is given below.
The peak value of the c**(t) occurs at the start time of a packet and is given by, c..(Tsj = hr (20) where h is the length of the packet synch sequence and r is the spreading gain. The estimates of sin (-..,) and cos (5-,) are defined as,
Est[sm' (δ,)] = S = K E,Q EQ1 (21) hr
and
Est[cQs(δ,)] = C = K E" E°Q (22) hr where K is a normalization constant to ensure that the sum of the squares of the two estimates given above is equal to one.
(23)
E so that (24)
S ~ E and _ E„ + EQQ
(25)
Once the start time of a packet has been determined the bit values of the bits in the packet can be obtained by using (24) and (25) , as if they were known values, together with equations (13) to (14). Equations (13) and (14) can be rewritten as
D,D (V C buf + S b1Q(t) + n,(t) (26)
DQD (t) = -S b1t(t) + C b1Q(t) + nQ(t) (27)
Solving these equations for the b** (t) we get
b1 l(t) = C DID (t) - S DQD (t) + n, (t) (28)
biQ(t) = S DID (t) + C DQD (t) + n2(t) (29)
If the r-| (t) and nQ(t) terms are independent zero mean Gaussian random variables with variances equal to V2 then so are the n-,(t) and n2(t) terms. Then, using (28), the minimum probability of error decision rule for determining whether bι; is positive or negative is given by
b1t=r if CDID(t)-SDQD>0 b1t=-r if CDID(t)-SDQD<0
A similar argument starting from (29) leads to a similar binary hypothesis test for the Q channel
b1Q=r if SDID(t)4-CDQD(t)>0 b1Q=-r if SDID(t) + CDQD(t)<0
Equations (30) and (31) are not necessarily optimum decisions because the estimated values of the sine and cosine were used as if they were true values, and because it was assumed that the noise in (26) and (27) is Gaussian. But both assumptions look good because the signal to noise ratio out of the packet detection filter is much better than that out of the bit detection filter.
When the expressions for S and C are used in the inequalities (30) and (31) the following equations are obtained,
bn — r if DID (En +EQQ)- DQD (EIQ -EOI)>0 bi, ------- -r DlD(Eil +EQQ)-DQD(EIQ-EQ1)<0 (32) and
= bid r if DtD (EIQ -EQI) + DQD (E„ +EQQ)>0 bio = -r if DID (EIQ -EQl) + DQD (En + EQQ) < 0 (33)
While the invention has been described with reference to specific embodiments, modifications and variations of the invention may be constructed without departing from the scope of the invention, which is defined in the following claims.