WO1999055048A9

WO1999055048A9 - Method and an arrangement for modulating a signal

Info

Publication number: WO1999055048A9
Application number: PCT/FI1999/000312
Authority: WO
Inventors: Olli Piirainen
Original assignee: Nokia Networks Oy; Olli Piirainen
Priority date: 1998-04-17
Filing date: 1999-04-16
Publication date: 2000-02-03
Also published as: CN1297639A; AU3423799A; EP1072134A1; NO20005185D0; NO20005185L; WO1999055048A1; FI980861A; FI980861A0; FI104773B; JP2002512486A

Abstract

The invention relates to a method and arrangement for modulating a signal to be transmitted using M-level continuous phase modulation, wherein M can obtain values (2, 4, 8, ...) and the symbols to be transmitted comprise more than one bit, the arrangement comprising a coder (104) and a frequency modulator (120). In order to flexibly enable high data rate transmission in a narrow frequency band, the coder (104) is arranged to code each symbol to be transmitted into a separate binary sequence to yield an M-level PSK constellation.

Description

METHOD AND AN ARRANGEMENT FOR MODULATING A SIGNAL

FIELD OF THE INVENTION

The invention relates to a method for modulating a signal, the method using continuous phase modulation and comprising coding and fre- quency modulation of a signal to be transmitted.

BACKGROUND OF THE INVENTION

A modulation method used on a transmission path is a significant parameter when new data transmission systems are developed. Because of losses occurring on the transmission path and because of transmission path capacity, data symbols to be transferred cannot be transmitted over the transmission path as such, but the symbols must be modulated using a suitable method so as to obtain good transmission path capacity and transmission quality.

The bandwidth required by transmission is a significant factor par- ticularly in radio systems. The aim is to achieve maximum transmission capacity while using a narrow bandwidth. On the other hand, the aim is to provide a transmitter and a receiver as easily and advantageously as possible. In radio systems, the aim is generally to use a modulation method having a constant envelope, because a C-class amplifier solution can then be used. The C-class amplifiers are simple in structure and advantageous in efficiency. This is particularly relevant as far as terminal power consumption is concerned.

There are several prior art modulation methods having a constant envelope, including Minimum Shift Keying MSK, Gaussian Minimum Shift Keying GMSK, Tamed Frequency Modulation TFM and Continuous Phase Modulation CPM. The GMSK method is used in the GSM cellular radio system. It has a narrow frequency spectrum and high performance, whereas data transmission rates are not very high. The coded CPM methods usually have a narrow frequency spectrum and high performance, making high data rates possible. However, equipment required become complex in structure, for which reason these methods have not been used in prior art systems.

BRIEF DESCRIPTION OF THE INVENTION

An object of the invention is to provide a method and an arrangement implying the method so as to enable high data rate transmission in a narrow frequency band without complex equipment required. This is achieved by a method for modulating a signal, the method using M-level continuous phase modulation, wherein M can obtain values (2, 4, 8..) and symbols to be transmitted comprise more than one bit, the method comprising coding and frequency modulation of the signal to be transmitted. The method of the invention is characterized by each signal to be transmitted being coded into a separate binary sequence, the sequences being transmitted binary-modulated so as to yield an M-level PSK constellation.

The invention further relates to an arrangement for modulating a signal to be transmitted by M-level continuous phase modulation, wherein M can obtain values (2, 4, 8..) and the symbols to be transmitted comprise more than one bit, the arrangement comprising a coder and a frequency modulator.

The arrangement of the invention is characterized by comprising a coder (104) arranged to code each symbol to be transmitted into a separate binary sequence so as to yield an M-level PSK constellation. The preferred embodiments of the invention are disclosed in the dependent claims.

The basic idea of the invention is thus to provide a PSK constellation, i.e. a state diagram, by means of binary modulation. The M-level symbols to be transmitted are coded into binary symbol sequences that are binary- modulated.

The method and arrangement of the invention provide several advantages. The invention allows continuous phase modulation to be implemented, which enables efficient frequency spectrum utilization and a relatively simple receiver structure compared with coded CPM methods, for example. The capacity of the modulation method in accordance with the invention is good particularly when the signal-to-noise ratio is not very good.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention is now described in closer detail in connection with the preferred embodiments with reference to the accompanying drawings, in which

Figure 1 illustrates a first example of an arrangement in accordance with the invention by means of a block diagram,

Figure 2 illustrates a second example of the arrangement in accordance with the invention by means of a block diagram, Figure 3 illustrates a third example of the arrangement in accordance with the invention by means of a block diagram,

Figures 4a to 4c show examples of PSK state diagrams, Figure 5 illustrates a state diagram's state-to-state transitions of the method in accordance with the invention,

Figure 6 shows an example of the implementation of a coder in accordance with the invention, and

Figure 7 shows an example of a coded bit stream.

DETAILED DESCRIPTION OF THE INVENTION Examine first an example of a preferred structure of an arrangement in accordance with the invention by means of a block diagram shown in Figure 1. The figure shows the structure of a terminal in a radio system in so far as relevant for the invention. Naturally, in order to function, a device to be implemented should also comprise further components than those shown in Figure 1 , as will be obvious to those skilled in the art. For the sake of clarity, however, these components are not dealt with in the figure and the description.

For simplicity, let us here examine an example wherein symbols to be transmitted comprise two bits, in which case M = 2^{(nu ber of blts)} = 4. The state diagram desired thus comprises four points. The arrangement comprises a data source 100, which produces a digital signal 102 to be transmitted. The data source can be a microphone, for instance, connected to a speech coder, the signal to be transmitted thus being speech in a digital form. Other data sources may include a computer or a modem. Data bits are conveyed in parallel, i.e. two at a time, to a coder 104, which, according to the invention, performs coding in which a two-bit symbol to be transmitted is presented by means of a binary symbol sequence. The coding will be described in closer detail below.

In a preferred embodiment of the invention, the binary symbols thus obtained are conveyed to a filter 108 filtering the signal according to a spectral pattern desired. A transfer function following the Gaussian distribution can preferably be selected as the transfer function of the filter. The transfer function can then be defined in the form

g(t) = h(t)®rect| γ where t is time, ® represents convolution and a function rect(x) is defined by

rect! — I = — when |t| < —

rectl — J = 0 in other cases.

When the Gaussian distribution is used, a function h(t) can be selected in the following manner:

{ -'² ) h(t) = - = where σ = ^-^- ja BT = /?.

■f lσT 2πBT ^H Here, B is the 3-dB bandwidth of the filter with the impulse response h(t), T being thus the length of the data symbol.

The signal thus obtained is further conveyed to a multiplier 110 to be multiplied by a factor h of the form X The signal thus obtained is further conveyed to a frequency modulator 120 performing prior art frequency modu- lation by means of a voltage-controlled or a numerically controlled oscillator, for example. The phase of the modulated signal is of the form

where oi_; = 1 - 2 * bs obtaining a value -1 or 1. The term bs comprises the binary sequence bits. The formation and form of the binary sequence are described below. A time reference t' is the beginning of the data to be transmitted.

The modulated signal is further conveyed to radio frequency parts 122, which can be implemented according to the prior art. It is an advantage of the invention that the radio frequency parts of the GSM system, for example, can be used as the radio frequency parts. The modulated RF signal can be expressed in the form

where E_c is the energy of a modulating symbol, f₀ is the centre frequency, and φ₀ is a random phase, which is constant for a period of one burst. In the radio frequency parts, a C-class amplifier can thus be used, which is a significant advantage particularly as far as portable terminals are concerned. From the radio frequency parts the signal is conveyed to an antenna 124.

As the transfer function of the filter 108, a raised cosine-type function following a root raised cosine RRC function, for example, can also be advantageously selected. Figure 2 illustrates a second embodiment of the invention. This embodiment does not have a filter after the coder. In other respects, the solution is similar to the solution described above.

Figure 3 illustrates a third alternative embodiment of the invention. In this alternative, the voltage-controlled oscillator of Figure 1 is replaced by an integrator 300 and a phase modulator 302, from which the signal is further conveyed to the radio frequency parts. In other respects, the solution is similar to the one described above in connection with Figure 1.

Examine next the coding of the invention performed in the coder 104 in closer detail. In the solution of the invention, coding is performed wherein a symbol to be transmitted comprising several bits is presented by means of a binary symbol sequence. In this example, examine a case where M = 4. Hence, the symbol to be transmitted comprises two bits, and the symbol can thus have four feasible values, for example values {0, 1 , 2, 3}, the corresponding bit pairs being {00, 01 , 10, 1 1}, for example. These four values are thus to be transmitted by means of binary symbols. In the solution of the invention, coding is performed wherein each two-bit symbol is presented by means of a sequence comprising three binary symbols. The coder 104 performs this modification, which can also be performed by a computer, for example. Figure 4a shows an example of a feasible state diagram of the modulation method of the invention when M = 4. Since a modulation method with a constant amplitude is here concerned, the transitions of the state diagram form a unit circle. The origins and terminals of the transitions are indicated by points on the unit circle. The points are placed at regular intervals π/2 phase difference away from each other. There are four points, one for each feasible symbol {00, 01 , 10, 11}. The receiver aims at interpreting transitions from one state to another from a signal received. For example, a transition from state 00 to state 01 can take place by a transition 400, and to state 11 by means of a transition 402. In the prior art modulation methods the transitions are implemented in one step in a manner shown by Figure 4a. The modulation method's susceptibility to errors is indicated by the Euclidean distance between adjacent points.

In the solution of the invention, symbols to be transmitted comprising more than one bit are presented by means of binary symbol sequences. When M = 4, the number of bits is two, and the length of a binary symbol se- quence representing one symbol is three bits. In the state diagram this means that each state-to-state transition, the transition 00 → 01 for example, is implemented employing three transitions, as illustrated in Figure 4b, in which the transition from state 00 to state 01 is performed by means of three transitions 404, 406 and 408. From each four points of the state diagram, a transition from one point to another can take place by means of three transitions, a 3-bit-long binary symbol sequence corresponding to these transition alternatives. Naturally, transition combinations are numerous, as illustrated by Figure 4c by way of example. In Figure 4c, the transition from state 00 to state 01 takes place by means of three different transitions 410, 412, 414. Despite the fact that the origins and terminals are the same, the path generated by the transitions differs from the one shown in Figure 4b. A different binary symbol sequence corresponds to the transitions of Figure 4c than to the transitions of Figure 4b. In order for the coding to be unambiguous, each state-to-state transition should be chosen a particular binary symbol sequence.

It should be noted here that when a signal modulated in accordance with the invention is received, the receiver multiplies the received signal be- jk- -jk~ tween the symbols either by a value e ⁴ or e ⁴ , where k = 0, 1 , 2,... This makes the state diagram rotate by half the symbol interval (π/4). The rotation takes place either counter-clockwise or clockwise, depending on the sign of the exponent. In the example described above, bit '1 ' is coded into value '-V, resulting in a counter clockwise transition. When said rotation by multiplier

,τ jk- e ⁴ is taken into account, rotation in the state diagram always takes place clockwise. Binary combination '000' keeps the constellation stationary, and correspondingly, '111 ' results in a % rotation on the circle. The exponential multiplier thus causes the constellation either to be stationary or to move in one direction, never in both directions during one state transition.

The state diagram transitions of the modulation method in accordance with the invention can be presented as a three-dimensional path ac- cording to Figure 5. The figure illustrates two examples of a path comprising three transitions when the transition takes place from one state diagram point to another. A first path 508 It is indicated by a broken line, corresponding to the path shown in Figure 4b. A second path 510 denotes the transition from point 00 to point 11 , being indicated by a line of dots and dashes. In an initial situation 500 the paths diverge, and via steps 502 and 504, terminate at different points in step 506.

Four different paths exist from each point (state), ending up at four different points. Susceptibility to transfer errors of the modulation method of the invention is thus not indicated by the Euclidean distance between the points but by the Euclidean distance between the paths.

In the method of the invention, coding can be implemented by means of a computer. A block diagram in Figure 6 illustrates a feasible embodiment of a coder of the invention. Parallel-mode bits 102 of an M-level symbol to be coded are supplied as input to the coder. Each bit is conveyed to the coder both directly and delayed in delay parts 600 to 604. In general, the number of the symbol bits is a two-based M logarithm, i.e. log₂(M). Typically, M is 4, 8, 16.... A coder 606 comprises a state machine having M number of binary symbol sequences, the length of each being M-1 , and one being selected for the output on account of the bits in the input. The output can be imple- mented in parallel mode, the output thus having M-1 lines 608, which are converted into serial mode by reading them sequentially with a switch 610. Naturally, converting into serial mode can also be implemented in other manners known. In the examples given above M = 4, in which case the number of lines 102 is two and the number of the output lines 608 is three. Correspondingly, if M = 8, the number of the lines 102 is three and the number of the output lines 608 is seven.

The coder of the invention can preferably be implemented by software by using a signal processor or a general purpose processor.

Examine an example of feasible binary symbol sequences for dif- ferent state-to-state transitions. The present example examines a case where M = 4. Consequently, a symbol to be transmitted thus comprises two bits, the symbol then being capable of having four feasible values, for example values {0, 1 , 2, 3}, the corresponding bit pairs being {00, 01 , 10, 11}, for example. The table has a binary symbol sequence corresponding to each transition. In total, there are four different sequences, and a transition from one point to another can take place by any one of the four sequences. In the present example, the sequences are S_T = {000, 010, 101 , 111}. The rightmost column in the table indicates the index of the sequence.

Table 1 Another alternative to a sequence is S₂ = {000, 100, 011 , 111}. The sequences should preferably be selected such that the number of '1 ' bits grows by one when a transition from a sequence to another takes place. It is

-jk- to be noted that the rotation of the state diagram by the value e ⁴ where k =

0, 1 , 2,.. at the receiver has been taken into account in the above sequences. Hence, coding is performed in such a manner that the current state and the state to which a transition is being performed are determined, after which a binary sequence corresponding to the transition obtained is looked up in the table, the binary sequence then being set in the output of the coder. Figure 7 further illustrates a bit stream after the coding. The bit stream comprises a group of binary sequences 700 to 704, each binary sequence corresponding to one symbol to be transmitted. These binary sequences are transmitted sequentially in a time slot or in a frame, depending on the multiple access method used.

The solution of the invention can preferably be applied to any digital data transfer system, to a cellular radio system, subscriber terminal equipment and base stations, for example.

Although the invention has been described above with reference to the example of the accompanying drawings, it is obvious that the invention is not restricted thereto but it can be modified in many ways within the scope of the inventive idea disclosed in the attached claims.

Claims

1. A method for modulating a signal, the method using M-level con- tinuos phase modulation, wherein M can obtain values (2, 4, 8..) and symbols to be transmitted comprise more than one bit, the method comprising coding and frequency modulation of the signal to be transmitted, characterized by each symbol to be transmitted being coded into a separate binary sequence, the sequences being transmitted binary-modulated so as to yield an M-level PSK constellation.

2. A method as claimed in claim 1, characterized by each symbol to be transmitted being presented by means of a predetermined, serial mode binary sequence.

3. A method as claimed in claim 1, characterized by the length of each binary sequence representing the symbol to be transmitted being M-1 bits.

4. A method as claimed in claim 2, characterized by each transition from one point to another of the PSK constellation being implemented by means of several different transitions determined by the binary sequence bits.

5. A method as claimed in claim 4, characterized by the point-to-point transition being implemented by means of M-1 transitions.

6. A method as claimed in claim ^ characterized by the binary sequences being selected such that the number of '1' bits increases by one when a transition from one sequence to another takes place.

7. An arrangement for modulating a signal to be transmitted by M- level continuous phase modulation, wherein M can obtain values (2, 4, 8..) and the symbols to be transmitted comprise more than one bit, the arrangement comprising a coder (104) and a frequency modulator (120), characterized by the arrangement comprising the coder (104) arranged to code each symbol to be transmitted into a separate binary sequence so as to yield an M- level PSK constellation.

8. An arrangement as claimed in claim 7, characterized by the arrangement comprising the coder (104) arranged to code each symbol to be transmitted into a binary sequence whose length is M-1 bits.

9. An arrangement as claimed in claim 7, characterized by the frequency modulator (120) being implemented by means of a voltage- controlled oscillator.

10. An arrangement as claimed in claim 7, characterized by the arrangement comprising a filter (108), which is operatively connected to the output of the coder.

11. An arrangement as claimed in claim 7, characterized by the coder (104) being implemented by software as a processor software.