• Nie Znaleziono Wyników

A digital implementation of the PSK transmitter and receiver as multirate algorithms of the digital

N/A
N/A
Protected

Academic year: 2021

Share "A digital implementation of the PSK transmitter and receiver as multirate algorithms of the digital"

Copied!
6
0
0

Pełen tekst

(1)

1

A digital implementation of the PSK transmitter and receiver as multirate algorithms of the digital

signal processing

Krzysztof Świder, and Michał Papaj

Abstract—In this paper designs of the transmitter and the receiver of PSK signals as three-rate algorithms of the digital signal processing are described. Additionally we show the examples of the transmitter and the receiver of the following signals: BPSK, QPSK. We discussed also an influence of the cascade of the shaping filter and the receiving filter on the intersymbol interference in the received complex envelope.

Index Terms—PSK, BPSK, QPSK, π/4-QPSK, matched filter, Nyquist filter.

I. Introduction

The phase modulation, PSK, is one of the most known and commonly used digital modulation in modern tele- communication systems. The simplest variant of this mo- dulation is two-valued, binary phase modulation (BPSK - Binary Phase Shift Keying), which is, among others, used in systems with a direct-sequence spread spectrum. In sys- tems, where the higher transmissions rate is a necessity the major solution is a four-valued phase modulation QPSK (Quadrature Phase Shift Keying), π/4-QPSK or OQPSK (Offset Quadrature Phase Shift Keying). Signals with the four-valued phase modulation are commonly used in North American Digital Cellular System NADC, Personal Handyphone System PHS, Pacific Digital Cellular System PDC [1], [2], a satellite TV Digital Video Broadcast - Satellite (DVB-S) and many other telecommunication systems. In the literature there are many publications describing the transmitter and receiver of PSK signals in the analog time domain, however it lacks their descriptions in the discrete-time domain. Therefore a purpose of this article is to present transmitters and receivers of PSK signals as multirate DSP algorithms using for the descrip- tion operational calculus which have not been done that way yet. The paper is organized as follows. The section II describes the conceptional scheme of the PSK signals transmitter. Next, in the section III the implementation of the PSK receiver is discussed. The next sections, IV-A and IV-B discusses examples of transmitters and receivers of BPSK and QPSK signals.

K. Świder is with the Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, 11/12 Gabrie- la Narutowicza Street, 80-233 Gdańsk-Wrzeszcz, Poland, e-mail:

krzysztof.swider@eti.pg.gda.pl

M. Papaj is with the Faculty of Health Sciences with Subfaculty of Nursing, 15 Tuwima Street, 80-210 Gdańsk, Poland, e-mail:

m.papaj@gumed.edu.pl.

II. The PSK transmitter

The block scheme of the digital triple-rate [3] PSK signal transmitter used in modern modems [4] is presented in Fig 1. In the transmitter we can observe three various sampling rates: the first one – bitrate called also transmission rate [bit/s], the second – baudrate called modulation rate [bod] and the third one – output rate [Sa/s], with which the quadrature modulation (QM) and digital to analog conversion are performed. Therefore, the presented transmitter is in fact a triple-rate DSP algorithm [3], [5].

d[i] encoder PSK c[k] cL[n] Quadrature ModulatorwS[n] u[n] x[n]

Quadrature Modulator with Interpolator

[bit/s] [symbol/s] [Sa/s]

L H

S Re( )

exp(jωcn)

Fig. 1. A block scheme of the PSK transmitter

In Fig. 1 marked samples corresponds to following series:

real, marked with single-line arrows and complex - marked with doubled-line arrows. Respectively, starting from the input, symbols represent: d[i] – a bits series (transmitted data), c[k] – transmitted complex symbols series, L↑ – a zeroinserter (a time expander), cL[n] – output of the time expander, HS – 1/L-bandpass baseband shaping filter (sender filter) [6], wS[n] – a transmitted complex envelope [7], u[n] – a transmitted analytic signal [10] and x[n] – a transmitted real signal given on the channel input.

According to the presented scheme, Fig. 1 the first operation performed on a transmitted data is their trans- formation (encoding) into complex symbols. On this stage for each of log2M -bit data series a complex symbol (a constellation point) belonging to the set of the M-point PSK constellation is assigned; cm= exp(j(2πm/M + ϕ)) where m = 0, 1, ..., M − 1, ϕ ∈ [−π, π) and M = 2l for l = 1, 2, 3, . . ..

The next operation is L-times sampling rate increment achieved by inserting L− 1 zero-valued samples between each two samples of the c[k] series

cL[n] :=

 c[n/L]; n = 0,±L, ±2L, . . .

0 for the rest n for n∈ I, L ∈ N (1) (where I denotes the set of real numbers, N denotes the set of the natural numbers) and filtration of a such

2011

(2)

„condensed” series with the ideal (non-casual and with infinitely short transition band) 1/L-bandpass shaping filterHS with a frequency response given by a formula:

HS(e) =

 = 0 for ω∈ (−π/L, π/L)

0 for ω /∈ (−π/L, π/L) (2) where ω ∈ [−π, π) is a normalized frequency given in radians per sample [rad/Sa]. (Because HS(e) is periodi- cal, with period equal to 2π in the normalized frequency domain ω, it is sufficient to analyze only the main period, which is range ω ∈ [−π, π) [8], [9]). In a result of a L- times interpolation of the symbol series we obtain a series of samples of the transmitted complex envelope {wS[n]}.

The sampling rate of the complex envelope{wS[n]} is L- times higher than the modulation sampling rate:

{wS[n]} = HS{L↑ {c[k]}} ; k, n ∈ I (3) where I is set of integer numbers, L↑ denotes abovemen- tioned expansion of a series of the length L.

The autocorrelation function of the series of statisti- cally independent and uniformly randomized transmitted symbols c[k] is given by the following formula [7]:

Rc[k1, k2] :=E {c[k1]c[k2]} =

=

 E {|c[k1]|2} + (E {c[k1]})2 for k1= k2 (E {c[k1]})2 for k1= k2 (4) where E { } denotes the operator of the expected value.

Additionally, assuming that {c[k]} is a random series of a zero-valued mean, E {c[k]} = 0, and a singleton variance (average power), E {|c[k]|2} = 1, we obtain the following formula for the autocorrelation function of the series{c[k]}:

Rc[k1, k2] = δ[k1− k2] (5) where δ[ ] denotes the Kronecker delta. Assuming, that Δk= k1− k2autocorrelation function formula (5) can be {c[k]} defined as follows:

Rck] = δ[Δk], where Δk:= k1− k2; (6) Power spectral density (PSD) of the series {c[k]} (at least wide-sense stationary) is defined by:

Pc(e) :=F{Rck]}; ω∈ [−π, π) (7) whereF denotes DTFT.

Considering the formula (6) for the autocorrelation function of the series{c[k]} we can observe that the PSD of the series is constant

Pc(e) = 1 (8)

Thus, in result of a time expansion (3), a fullband power spectral density Pc(e) of the series{c[k]} is transformed into power spectral density of the interpolated series (the transmitted complex envelope) wS[n])

PwS(e) =

 |HS(e)|2Pc(ejLω) for ω∈ (−π/L, π/L)

0 for ω /∈ (−π/L, π/L)

(9)

where a normalized frequency corresponding to a L- times higher sampling rate stays in a range of ω (−π/L, π/L) – 1/L-band spectrum.

In contrast to the full-band PSD Pc(e), 1/L-band spectrum PwS(e) can be shifted on the frequency axis ω: (PwS(ej(ω−ωc))) in a range of ωc∈ (−π/L, π(1 − 1/L)) (where ωcis a carrier frequency) using complex heterodyne – a multiplicator with two complex inputs, one for the transmitted complex frequency wS[n] and one for the complex sinusoid (complexoid) ecn. The outcome of the heterodyne block is the complex („analytic”) signal [10]:

u[n] = wS[n]ecn⇔ Pu(e) = PwS(ej(ω−ωc)) (10) whose spectrum corresponds to the spectrum PwS(e) of the transmitted complex envelope wR[n] heterodyned to the center frequency ωc. A quadrature modulator together with the precedent interpolator forms a QMI block (Quadrature Modulator with Interpolator) [9], [11]

and gives on the output a real signal x[n] transmitted afterwards into a channel:

x[n] = Re(u[n]) = Re(wS[n]ecn) (11) III. The PSK receiver

The processing of the signal at the receiver end (Fig.2) is a transposition of the discussed in the section II a transmitter’s side processing (Fig.1).

r[n] wR[n]

H R

[Sa/s] [symbol/s] [bit/s]

ˆ

c[k] d[i]ˆ

decoder and slicer

L

exp(−jωcn)

Quadrature Modulator

Quadrature Demodulator with Decimation

Fig. 2. A coherent PSK receiver

In Fig. 2 the following notation is used: r[n] – a real signal at the output of a channel,HR – a receiving filter, wR[n] – a received complex envelope, L↓ – a compressor of a series of a L multiplicity, ˆc[k] – an estimate of transmitted complex symbols and ˆd[i] – estimate of a transmitted binary series.

Assuming that the channel introduce only an additive white Gaussian noise (AWGN) [12], [13], the signal (real) received at the channel output is given by:

r[n] = x[n] + [n]; n∈ I (12) where [n] is a realization of an AWGN. The purpose of the processing in the PSK receiver is to obtain a series d[i] which is the best estimate of a transmitted (binary)ˆ data series, which is directly bind to obtaining a received complex envelope wR[n], that is the best estimate of the transmitted one wS[n].

(3)

The first algorithm of signal processing on the receiver side is a quadrature demodulation of the received series r[n]. The quadrature demodulation consists of two opera- tions: heterodyning the signal downward, to the baseband, in such way that its center frequency gets equal to zero, and further a filtration with a real lowpass receiving filter HR of a following frequency response:

HR(e)= 0 dla ω ∈ (−π/L, π/L) (13) In the result we obtain a received complex envelope wR[n]:

wR[n] =HR{r[n]e−jωcn} n∈ I (14) In order to obtain a series of estimates of transmitted complex symbols ˆc[k] we collect samples of the received complex envelope wR[n] in time instances in which the complex envelope is the closest to the adequate transmit- ted symbols (in recovered symbols instants)

{ˆc[k]} = L↓ {wR[n]} = L↓

HR{r[n]e−jωcn}

n, k∈ I (15) Assuming that there is the full synchronization between the transmitter and the receiver, the obtained by L-times decimation of the received complex envelope series ˆc[k] is given by [14]:

ˆ

c[k] = c[k]g1/L[0] +

l=k

c[k]g1/L[(k− l)L] + 1/L[k] (16)

where

{g1/L[k]} := L↓ {g[n]} (17) and

g[n] =

l=∞

l=−∞

hR[l]hS[n− l] (18) denotes the convolution of the impulse response hS[n] of the shaping filter in the transmitter with the impulse response hR[n] of the receiving filter in the receiver. The first component in the formula (16), depending only on the transmitted symbols, is a product of transmitted complex symbols c[k] with g1/L[0]. The third component:

1/L[k] = L↓ {HR{[n]}} (19) is a noise from the quadrature demodulator output at the output of the L-times decimator, whereas the second component of the formula 

l=kc[l]g1/L[(k− l)L] corre- sponds to intersymbol interferences (ISI) in the receiver [15], [7]. We can observe from the formula (16) that besides the noise component 1/L[k] the decisive influence on the received complex symbols estimate ˆc[k] belongs to the cascade of the shapingHSand the receiving filterHR. The cascade mentioned above will be denoted asG := HRHS

further in the paper.

In Fig.3 the simplified scheme (assuming ideal syn- chronization: carrier and symbol and lack of the noise in the channel) of interpolator (in the transmitter) and the decimator (in the receiver) is presented. We can

c[k] cL[n] wS[n] wR[n] c[k]ˆ

L L H S H R

G

Fig. 3. A block scheme of the simplified QMI-QDD baseband cascade

observe, that according to the formula (16) in order to eliminate intersymbol interferences, which have the negative influence on the transmitted complex symbols estimate ˆc[k] (16), the cascadeG of the shaping filter HS and the receiving one HR has to fulfill the condition of (Nyquist condition [8]):

g1/L[kL] =

 1 for k = 0

0 for k= 0 (20)

Having the condition fulfilled together with the lack of the noise in the channel, the estimate of transmitted complex symbols ˆc[k] is error-free.

ˆ

c[k] = c[k] (21)

The third component of the sum in the formula (16) forces an additional condition for the filters cascadeG , to ensure the best signal to noise ratio in the receiver in symbol instances [8]:

SNR = |k=∞

k=−∞c[k]g[n− kL]|2n=kL

E {|w[n]|2}n=kL (22) The condition mentioned above is fulfilled when the receiving filter is matched to the shaping filter in the transmitter [16]:

HR(e) = HS(e) (23) which implicates following relationship between the im- pulse response of the shaping filter hS[n] and a receiving one (matched) hR[n]:

hR[n] = hS[−n] (24) In classical solutions both filters: sending HS and receiving HR have frequency response in shape of the square root raised cosine (SRRC) given by the formula [3]:

HSRRC(e) =

=

⎧⎪

⎪⎩

1, |ω| < (1−α)πL

cos π

π − (1 − α)

, (1−α)πL  |ω|  (1+α)πL

0, |ω| > (1+α)πL

(25) Using in the cascade filters of the SRRC frequency response (Fig.4) effects with G being the Nyquist filter

(4)

of the frequency response of the raised cosine (RC) [17]:

GRC(e) =

=

⎧⎨

1, |ω| < ω1

12

1 + cos π

π − (1 − α)

, ω1 |ω|  ω2

0, |ω| > ω2

(26) where ω1 = (1−α)πL , ω2 = (1+α)πL , whereas α∈ [0, 1] is called a bandwidth excess factor [18], [7] or roll-off factor [3].

0 0

a

ω

−2πL −π

L

π L L L

2

L

0 0

b

ω

−2πL −π

L

π L L L2

L

Fig. 4. An amplitude characteristics (in the passband) of ideal filters: (a) (square raised root cosine) SRRC, (b) (Nyquist) RC, for following coefficientα values: (red α = 0, black α = 0.5, blue α = 1).

The last operation on the PSK receiver side is symbol detection and decoding of data basing on the series ˆ

c[k] (decoder decision statistics). The series ˆc[k] is put on the input of the multithreshold (complex) decision algorithm (slicer). At the output of the slicer the estimate of the transmitted symbols series is obtained. Further, the estimate is decoded and at the output we obtain a received data binary series ˆd[i].

There is many variants of the PSK modulation; to the classical ones [7], [19] belongs: Binary Phase Shift Keying (BPSK ) [20], Quadrature Phase Shift Keying (QPSK) [21], and π/4-QPSK [22]. All of the mentioned PSK signals can be obtained using a transmitter whose scheme is presented in Fig.1 and can be received using the receiver from the Fig.2.

IV. Examples of PSK modulators and demodulators A. BPSK modulator and demodulator

The simplest PSK modulation type is a two-state phase modulation (BPSK) in which the phase keying is done by generation of the complex envelope of M = 2 complex (real) symbols:

cm∈ {exp(j0), exp(jπ))} = {1, −1} where m = 1, 2 (27) The abovementioned is realized by encoder in the following way:

c[k] = 2(d[k]− 0.5); k ∈ I (28) It is worth noticing that the modulation BPSK for each of symbols assigns log22 = 1 bit of data. That means, that the symbol rate (baudrate) is equal to the bitrate. In Fig. 7 the scheme of the transmitter is presented, whereas Fig.6 shows the block scheme of the receiver.

d[k] c[k] wS[n] x[n]

encoder

−1/2



2

L H

S Re( )

exp(jωcn)

QMI

[bit/s] [symbol/s] [Sa/s]

Fig. 5. A block scheme of the BPSK transmitter

-1 1

r[n] wR[n]

H

R ˆc[k] d[k]ˆ decoder and slicer

L↓

exp(−jωcn)

1/2  +1/2

QDD

[bit/s]

[symbol/s]

[Sa/s]

Fig. 6. A block scheme of the BPSK receiver

The signal processing on the receiver side (Fig.6) consi- sts of (analogous to Fig.2) following stages: heterodyning the received signal r[n] to the baseband, L-times decima- tion (16), in result of which we obtain the estimate of the transmitted complex symbols:

{ˆc[k]} = {L↓ {HR{r[n]e−jωcn}}} (29) and decoding, which can be realized as follows:

d[k] = 0.5ˆˆ c[k] + 0.5 (30) In result we obtain at the output an estimate of the transmitted binary series.

−1.5 −1 0 1 1.5

−1.5

−1 0 1

1.5 a

real

imag

−20 −10 0 10 20

.5

−1 0 1

.5 b

n [Sa]

−1.5 −1 0 1 1.5

−1.5

−1 0 1

1.5 c

real

imag

−20 −10 0 10 20

.5

−1 0 1

.5 d

n [Sa]

Fig. 7. BPSK (shaping and receiving filter SRRC with coefficients:

L = 40, N = 6L + 1, α = 0.5): (a) transmitted complex envelope wS[n], (b) eye diagram Re(wS[n]), (c) received complex envelope wR[n], (d) eye diagram Re(wR[n]). Red dotes mark the series values in the symbol instant

In Fig.7 are presented examples of realizations of transmitted complex envelope wS[n] and the received complex envelope wR[n] on the Gauss plain together with

(5)

corresponding eye diagrams (of real components). Analysis of the presented figures leads to a conclusion that if there is in the transmitter a SRRC filter that introduces intersymbol interferences (ISI) into transmitted complex envelope wS[n] (Fig.7.a, Fig.7.b), and the filer in the rece- iver is matched SRRC (24), then in the received complex envelope wR[n] ISI does not occur(Fig.7.c, Fig.7.d), which proves the conclusions from the section (?ref).

B. QPSK modulator and demodulator

The four-state (quadrature) phase keying (QPSK) is a generation of a complex envelope of M = 4 complex symbols:

cm∈ {exp(jπ/4), exp(j3π/4), exp(−j3π/4)), exp(−jπ/4)}

(31) where m = 1, . . . , 4. In this case for each of symbols log24 = 2 bits of data are assigned. In Fig.8 the block scheme of three-rate QPSK modulator is presented.

d[i] dI[k]

dQ[k]

cI[k]

cQ[k]

wI[n]

wQ[n] j

wS[n] x[n]

−1/2

−1/2 





L↑ L↑

2

2

HS

HS Re( )

z−1 2 2

exp(jωcn)

encoder

debiplekser QMI

[bit/s] [symbol/s] [Sa/s]

Fig. 8. A block scheme of the QPSK transmitter

In the QPSK transmitter transmitted data d[i] are split using a debiplexer (a serial-parallel converter) into two parallel path: in-phase (I) with the BPSK modulator and quadrature (Q) also with the BPSK modulator. In each of paths Cartesian components cI[k] i cQ[k] of the transmitted symbols series are interpolated by L-valued interpolation factor. In effect we obtain following series:

{wI[n]} = HS{L↑ {cI[k]}} =

=

2HS{L↑ {2↓ {d[i]} − 0.5}} i, k, n ∈ I (32) {wQ[n]} = HS{L↑ {cQ[k]}} =

= 2HS

L↑ {2↓ z−1{d[i]} − 0.5}

i, k, n∈ I (33) where z−1 is a one sample delay.

Further the output of the in-phase wI[n] and the quadrature wQ[n] component are put on the quadrature summation block. The resulting series is a transmitted complex envelope of the QPSK signal.

wS[n] = wI[n] + jwQ[n] (34) It is worth noticing that binary series dQ[k] and dI[k] are processed separately in the in-phase and the quadrature path with a bitrate two times lower than the bitrate of the data series d[i] at the input of the QPSK transmitter.

Thus, the advantage of the QPSK modulation over the BPSK modulation is that having the same symbol rate we acquire two times faster transmission of the binary data

occurring at the input of the QPSK transmitter. The pair of bits at the output of the debiplexer is called a dibit.

The transmitted QPSK complex envelope, similarly as BPSK, is given at the input of the quadrature modulator consisting of: the complex multiplicator and the functor determining the real component of the analytic signal (10)). In result we obtain a real signal transmitted into a channel:

x[n] = Re(ecnwS[n]); n∈ I (35) In Fig.10.a and Fig.10.b examples of realizations of series occurring in the QPSK transmitter (Fig. 8) are presented. Similarly to the BPSK transmitter the shaping filter, if its impulse response is a SRRC (and here we assu- me that it is),HSin the transmitter purposely introduces an ISI (Fig.10). Intersymbol interferences can be observed in eye diagrams of particular Cartesian components of the transmitted complex envelope wS[n] and also through an analysis of the trajectory wS[n] – by occurrences of the characteristic dispersions in the neighborhood of nominal constellation points in symbol instances.

The QPSK receiver Fig.9 consist of (because of a simple interpretation of the QPSK modulation as a sum of two BPSK signals) BPSK demodulator, both in the in- phase and quadrature path. Thus the signal processing on the receiver side (Fig.9) consisting of heterodyning the signal to the baseband and L-times decimation (36, 37) is the inverse of the abovementioned processing on the transmitter side.

-1 1

-1 1

r[n]

HR

HR cˆI[k] dˆI[i]

ˆ

cQ[k] dˆQ[i]

L L Re( )

Im( ) exp(−jωcn)







1 2

1 2

1/2 1/2

d[i]ˆ 2

2 z−1

biplekser

decoder and slicer QDD

[bit/s]

[symbol/s]

[Sa/s]

Fig. 9. A block scheme of the QPSK receiver

{ˆcI[k]} = L↓ HR

Re(r[n]e−jωcn)

(36)

{ˆcQ[k]} = L↓ HR

Re(r[n]e−jωcn)

(37) The recovered Cartesian components ˆcI[k], ˆcQ[k] of estimates ˆc[k] of transmitted complex symbols c[k] are given on the input of the detector and the symbol decoder.

On this stage series ˆcI[k], ˆcQ[k] are passed to the input of a biplexer (a parallel-serial converter) on the output of which we obtain estimates of the transmitted binary series:

dˆI[i]



=

 z−1

 2

 1

cI[k] + 0.5



(38)

dˆQ[i]



=

 2

 1

cQ[k] + 0.5



(39)

(6)

Series ˆdI[i] and ˆdQ[i] at the output of the receiver are summed and in result the estimate of the transmitted data series is obtained:

d[i] = ˆˆ dI[i] + ˆdQ[i] (40) Similarly to the discussed previously BPSK receiver, in the QPSK receiver properties of the filters cascadeG has the same influence on the ISI occurrence.

a

real

imag

1 2

1 2

−1 2

−1 2 1.1

−1.1−1.1 1.1 0

0 −20 −10 0 10 20

b

n [Sa]

1 2

−1 2 1.1

−1.1 0

c

real

imag

1 2

1 2

−1 2

−1 2 1.1

−1.1−1.1 1.1 0

0 −20 −10 0 10 20

d

n [Sa]

1 2

−1 2 1.1

−1.1 0

Fig. 10. QPSK (the shaping and the receiving SRRC filer with coefficients:L = 40, N = 6L + 1, α = 0.5): (a) transmitted complex envelope wS[n], (b) eye diagram Re(wS[n]), (c) received complex envelopewR[n], (d) eye diagram Re(wR[n]). Red dots mark series values in symbol instants

In Fig.10.c and Fig.10.d are presented i.a. received envelope (complex if the cascadeG is a RC filter). From analysis of figures mentioned above we can conclude that when the pair of SRRC filters is used in the transmitter and the receiver, then the level of the ISI in the received complex envelope is negligibly small and comes from the finite length of filters impulse response. The ISI introduced in the transmitter (Fig.10.a) to the transmitted complex envelope wS[n], if the shaping filterHSis the SRRC filter, are leveled in the received complex envelope wR[n] by the receiving SRRC filterHR.

V. Summary

In the paper the design of the transmitter (Fig.1) and the receiver (Fig.2) of PSK signals as three-rate DSP algorithms is discussed. Additionally, there are shown examples of the implementation of the transmitter and the receiver of signals: BPSK (sec.IV-A) and QPSK (sec.IV-B). Basing on the abovementioned designs the transmitter and the receiver for other modulations: the OQPSK (in which the quadrature component is delayed by the half of the symbol interval z−L/2), the π/4-QPSK (by adding the difference encoder [19] on the transmitter side) and the M -PSK can be implemented.

References

[1] K. Feher, and H. Mehdi: Modulation/microwave integrated di- gital wireless developments,IEEE Transactions on Microwave Theory and Techniques, 1995.

[2] Application Note 1298: Digital Modulation in Communications Systems – An Introduction, Hewlett-Packard Company, 1997.

[3] F. Harris: Multirate Signal Processing for Communication Sys- tems, Prentice Hall,2004.

[4] M. Blok, M. Rojewski, and K. Świder: Estymacja szybkości sym- bolowej i liczby gwiazdek konstelacji sygnałów PSK w oparciu o ich zespoloną pulsację chwilową Systemy Rozpoznania i Walki Elektronicznej : VI Konferencja Naukowo-Techniczna, Soczewka k/Płocka 20-22 czerwca 2006, 2006.

[5] N. Fliege: Multirate Digital Signal Processing: Multirate Systems - Filter Banks - Wavelets,Wiley, 2000.

[6] J. Barry, D. Messerschmitt, and E. Lee: Digital Communication, Springer, 2003.

[7] K. Wesołowski: Podstawy cyfrowych systemów telekomunikacyj- nych, Wydawnictwo Komunikacji i Łączności, 2003.

[8] J. Proakis, and D. Manolakis: Digital Signal Processing, Prentice Hall, 2006.

[9] E. Hermanowicz: Specjalne filtry dyskretne o skończonej odpo- wiedzi impulsowej i ich zastosowania do modulacji i demodulacji kwadraturowej, Zeszyty Naukowe Politechniki Gdańskiej, Poli- technika Gdańska 1995.

[10] S. Hahn: Hilbert Transforms in Signal Processing, Artech House,1996.

[11] E. Hermanowicz: Special discrete-time filters and applications, Exit, 2005.

[12] McClaning, Kevin and Vito, Tom: Radio Receiver Design, Noble Publishing Corporation, 2001.

[13] A. Papoulis: Probability, Random Variables and Stochastic Processes, McGraw Hill Higher Education, 2002.

[14] T.N. Davidson: Efficient design of waveforms for robust pulse amplitude modulation, IEEE Transactions on Signal Processing, vol. 49, 2001.

[15] J. Proakis, Digital Communications,McGraw-Hill, 1996.

[16] G.D. Cain, A. Yardim, and M.A. Mughal: Compromises in FIR matched filter design, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004, vol.2, 2004.

[17] Xiang-Gen Xia: A family of pulse-shaping filters with ISI-free matched and unmatched filter properties, IEEE Transactions on Communications, vol.45, 1997.

[18] S.H. Muller-Weinfurtner, and J.B. Huber: Optimum Nyquist windowing for improved OFDM receivers, Global Telecommuni- cations Conference, 2000. GLOBECOM ’00. IEEE, vol.2, 2000.

[19] F. Xiong: Digital Modulation Techniques,Artech House, 2000.

[20] D. Arnstein: Phase Measurement Accuracy with Modulated Sounding Signals, IEEE Transactions on Communication Tech- nology, vol. 16, 1968.

[21] D. Morais, A. Sewerinson, and K. Feher: The Effects of the Amplitude and Delay Slope Components of Frequency Selective Fading on QPSK, Offset QPSK and 8 PSK Systems, IEEE Transactions on Communications, vol. 27, 1979.

[22] C.-L. Liu, and K. Feher: A new generation of Rayleigh fade compensatedπ/4-QPSK coherent modems,Vehicular Technology Conference, 1990 IEEE 40th, 1990.

Cytaty

Powiązane dokumenty

Keeping the type of option constant, in-the-money options experience the largest absolute change in value and out-of-the-money options the smallest absolute change in

² If the data values are grouped in classes on a frequency table or column graph, do we still know what the highest and lowest values are..

(1 point) The sides of a rectangle has been measured to be 40cm and 50cm correct to the nearest 10cmA. The lower bound for the area of the rectangle is (select all

This abstract result provides an elementary proof of the existence of bifurcation intervals for some eigenvalue problems with nondifferentiable nonlinearities1. All the results

We suggest in this paper a method for assessing the validity of the assumption of normal distribution of random errors in a two-factor split-plot design.. The vector

and [9]. Generally, if X is an algebraic set of pure dimension n ≥ 1, X is said to be uniruled if every component of X is uniruled. Points at which a polynomial map is not proper.

N ) whenever N is such that the norms of three or more consecutive (as determined by the continued fraction expansion of ω (see [13])) principal reduced ideals are powers of a

This generalisation of gauge theory uses the notion of coalgebra ψ-bundles, which was proposed by the author at his lecture delivered at the Banach Center Minisemester on Quantum