Abstract:
The method of synchronizing a receiver in a coded data transmission by means of an M-stage channel symbol alphabet, which includes dividing the channel symbol alphabet into a number of K not necessarily equal-sized groups (I,II) with K greater than one, so that at least one group contains less than M channel symbols; and either making preliminary or final data decisions in a data decoder, then making group membership decisions based on the preliminary or final data decisions and continuously using the group membership decisions for selecting a parameter detector (1, 2, . . . , K) or a parameter detector characteristic curve corresponding to an applicable group according to the group membership decisions; or making a group membership decision based on redundancies of received channel symbols present in the coded data transmission and then using the group membership decision for continuously selecting the parameter detector or the parameter detector characteristic curve according to the group membership decision; or determining a probability for group membership in at least one group based on the redundancies of the received channel symbols present in the coded data transmission and then using this probability for selecting weighting factors for output signals of the parameter detector corresponding to the concerned group.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention relates to methods of synchronizing a receiver in a coded data transmission. 
     2. Prior Art 
     In data signal transmission, coding is often employed, for instance to enable reducing the required transmission energy per data bit for the same error rate. Reducing the transmission energy per data bit, however, leads to an impairment in the synchronization of the demodulator, which is already problematic anyway in particular in higher-stage modulation methods. In that case, one possibility for improvement is to use estimated values c&#34; i  of the data decoder for the channel symbols c i  actually transmitted. Such a method is described in reference 1, a paper by Ungerboeck, &#34;Channel Coding with Multilevel/Phase Signals&#34;), IEEE IT-28, No. 1, January 1982, pages 55-67, especially FIG. 17). 
     However, this method is problematic in two ways. First, these estimated values are present only in delayed fashion; that is, stability problems can arise in the close-loop control circuit, or control loop, comprising the demodulator and the data decoder that is created by the feedback. Second, the data decoder means a high-level nonlinearity with memory in the control loop, making the initial synchronization problematic, and under some circumstances the closed-loop control circuit can remain for relatively long periods in unstable states of equilibrium, known as &#34;false locks&#34;. 
     SUMMARY OF THE INVENTION 
     It is an object of the present invention to provide an improved method of synchronization of a receiver in a coded data transmission of the above-described kind, that does not have the above-mentioned disadvantages. 
     According to the invention the method of synchronizing a receiver in a coded data transmission by means of an M-stage channel symbol alphabet, comprises: 
     a) dividing the channel symbol alphabet into a number of K not necessarily equal-sized groups (I,II) with K greater than one, so that at least one group contains less than M channel symbols; and 
     b) either making preliminary or final data decisions in a data decoder, then making group membership decisions based on the preliminary or final data decisions and continuously using the group membership decisions for selecting a parameter detector (1, 2, . . . , K) or a parameter detector characteristic curve corresponding to an applicable group according to the group membership decisions; or 
     making a group membership decision based on redundancies of received channel symbols present in the coded data transmission and then using the group membership decision for continuously selecting the parameter detector or the parameter detector characteristic curve according to the group membership decision; or 
     determining a probability for group membership in at least one group based on the redundancies of the received channel symbols present in the coded data transmission and then using the probability for selecting weighting factors for output signals of the parameter detector corresponding to the concerned one of the groups. 
     By means of the synchronization method of the invention, it is possible in the closed- or open-loop control circuit of a synchronization device to shorten the delay time and to improve the initial synchronization. 
     Advantageous features of the invention will become apparent from the dependent claims. 
     The essential characteristic of the invention is the use of a parameter detector for a channel symbol alphabet with N stages, in data transmission with a channel symbol alphabet with M stages, where 1&lt;N&lt;M, so that the information required by the data decoder is reduced. An advantage on the one hand is that this reduced information can be furnished by the data decoder with a shorter delay time, as shown in the parallel patent application entitled &#34;Datendecoder&#34; [Data Decoder] filed on the same date as the present application by the same Applicant, and on the other that as a result there are fewer unstable equilibrium points in the closed-loop control, and thus the initial synchronization is less problematic. 
    
    
     BRIEF DESCRIPTION OF THE DRAWING 
     The objects, features and advantages of the invention will now be illustrated in more detail with the aid of the following description of the preferred embodiments, with reference to the accompanying figures in which: 
     FIG. 1 shows a basic circuit diagram of the transmission system; 
     FIG. 2a illustrates the location of the channel symbols in QPSK modulation. 
     FIG. 2b shows a state transition diagram of the coding, also known as a trellis diagram. 
     FIG. 3 shows a basic circuit diagram of the receiver, 
     In FIG. 4, one possible realization of the parameter detector is shown; and 
     FIG. 5 shows another possible realization of the parameter detector. 
    
    
     DESCRIPTION OF EXEMPLARY EMBODIMENTS 
     In FIG. 1, the source Q generates a train of data bits d k , which is delivered to a data encoder De. The data encoder generates a train of channel symbols c i , which is delivered to a modulator Mo. If the transmission is based on a QPSK modulation, for instance, then the channel symbols c i  are elements of a four-stage channel symbol alphabet; that is, c i  ε {l, j, -l, -j}, in which j is the imaginary unit. 
     These four possible channel symbols are represented in FIG. 2 are points in the complex plane. The modulator Mo finally generates the actual transmission signal s(t) for transmission over the channel Ka. 
     In the receiver, the received signal r(t) is delivered to a demodulator Dm. The demodulator furnishes the train of estimated values c&#39; i  for the channel symbols, optionally provided with quality standards, which are delivered to a data decoder Dd. The data decoder, finally, determines the train of estimated data bits d&#39; k . It also furnishes a train of values f&#39; i , which are delivered to the demodulator Dm. In the method disclosed in reference 1, f&#39; i  would be a train of improved estimated values c&#34; i  for the channel symbols, while in a method according to the invention f&#39; i  is a train of estimated values g&#39; i  for membership in a channel symbol group, possibly provided with corresponding quality standards. 
     To illustrate the principle of determining the estimated values for the group membership, FIG. 2b shows a simple state transition diagram for a convolution code with a rate of 1/2 in QPSK. At each time, the data encoder De is in one of the four states U, V, W, X represented by circles. If the data encoder De receives the next data bit d k  from the source Q, then when d k  =0 it takes the path indicated by the solid-line arrow, while when d k  =1 it takes the path indicated by the dashed-line arrow. This accordingly defines the transition to the next state. The numbers on each of the arrows each define the next channel symbol, which is delivered to the modulator Mo. The data decoder Dd in the receiver is likewise based on this state transition diagram. Determining the train d&#39; k  is then equivalent to determining the most probable path through the state transition diagram. To that end, the data decoder Dd at each time i for each state z determines a so-called path metric p z ,i, which represents a standard for the probability that the path at time i runs through this state z (i=0, 1, 2, 3, . . . ). With the aid of the estimated value c&#39; i+1  from the demodulator Dm, possibly including an associated quality standard, the data decoder Dd then determines the corresponding path metrics at time i+1. This procedure is described at length in the paper by Forney, &#34;The Viterbi Algorithm&#34;, of the Proceedings of the IEEE, Volume 61, No. 3, March 1973, pages 268-278. For describing the method on which the invention is based, the only significant aspects are that these path metrics p z ,i exist, and that they are a standard for the probabilities of the states at time i. 
     From the state transition diagram it can be learned that only two channel symbols lead away from each state. If the channel symbol alphabet is divided into two channel symbol groups I and II, where channel symbol group, I contains the two symbols &#34;0&#34; and &#34;2&#34; while channel symbol group II contains the two symbols &#34;1&#34; and &#34;3&#34;, then only the channel symbols of one channel symbol group can lead away from each state. In other words, with the aid of the path metrics, at time i an estimated value can be derived for the group membership at time i+1. In the simplest case, to that end only what at the moment is the most probable state is determined, and the associated designation of the channel symbol group that is capable of leading away from this state is sent on to the demodulator Dm. In the usual way in which path metrics are shown, the most probable state is designated by the minimal path metric, so that only the state having the minimal path metric needs to be determined. 
     To explain the use of the method of the invention, a fed-back carrier phase synchronization in MPSK modulation will be looked at. A basic circuit diagram of a demodulator (Dm in FIG. 1) for this is shown in FIG. 3. The received signal r(t) is first delivered to a matched filter MF. The output signal u(t) of the matched filter is sampled at the optimal sampling times t=iT, where T is the symbol duration of the MPSK modulation. Next, the carrier phase is corrected with the aid of a multiplier Mu, resulting in the sampled values z&#39; i . From them, the soft decision values c&#39; i  are ascertained in a component group Sd, and are delivered to the data decoder Dd. This decoder finally determines the desired data bits d&#39; k  and in addition the values f&#39; i , which are needed for the synchronization. So that these values f&#39; i  can be used to determine the residual carrier phase error of the values z&#39; i , the latter are delayed in a delay member Lv in accordance with the transit time of the data decoder, resulting in the values z&#39; i . From z&#34; i  and f&#39; i , a parameter detector Pd, which in the case of closed-loop carrier phase control is as a rule called a phase detector, determines the residual phase error ΔΘ&#39; i , and from that, with the aid of a loop filter Sf and a numerically controlled oscillator NCO, the rotation factor e- j2 πΘ&#39; i, required for the carrier phase correction, is ascertained. The carrier synchronization is thus equivalent to a typical phase-locked loop, but the phase detector Pd additionally uses the values f&#39; i  of the data decoder Dd. 
     The mode of operation of the phase detector will now be described, using MPSK modulation as an example. It is assumed that in the ideal case, that is, without carrier phase errors and without any other disturbances, the channel symbols are located at the M set points s m , where 
     
         s.sub.m =e.sup.j2πm/M 
    
     and where m ε [0, 1, . . . , M-1] (as shown in FIG. 2a for QPSK). 
     If there are no values f&#39; i  available from the data decoder, then a normal phase detector for MPSK must be used. One possibility then is for instance to determine the phase difference between the value z&#39; i  and the next-closest set point sm. The phase error ΔΘ&#39; i  is then obtained by the equation 
     
         ΔΘ&#39;.sub.i =arg[z&#39;.sub.i.sup.M ], 
    
     or in other words, the determination of the phase of the value z&#39; i  taken to the Mth power. 
     If conversely, as in the method indicated in reference 1, an estimated value for the channel symbol is available from the data decoder, that is, if f&#39; i  stands for the number m of the corresponding set point, then the signal z&#39; i  can be traced back to an unmodulated signal by multiplication by e -j2 πf&#39; i /M  ; that is, the set point of this signal is always at s 0 , and the phase error can be determined for instance in accordance with the equation 
     
         ΔΘ&#39;.sub.i =arg[z&#39;.sub.i e.sup.-j2πf&#39; i.sup./M ]. 
    
     To explain the use of reduced information from the data decoder, the special case of QPSK will first be considered. The associated location of the set points in the complex plane for this has already been shown in FIG. 2a. The four possible channel symbols are now divided into two groups I and II. The channel symbols &#34;0&#34; and &#34;2&#34; are assigned to group I, and the channel symbols &#34;1&#34; and &#34;3&#34; are assigned to group II (FIG. 2b). Group I is thus equivalent to the usual configuration in BPSK, while group II is equivalent to a BPSK configuration rotated by pi/2. If the data decoder, by means of the signal f&#39; i , furnishes the information as to which group a channel symbol belongs to, then a phase detector adapted for the group can be used; if it belongs to group I, then a normal BPSK phase detector can be used, or in other words the phase error can be determined for instance in accordance with the equation 
     
         ΔΘ&#39;.sub.i =arg[z&#39;.sub.i.sup.2 ]. 
    
     Conversely, if it belongs to group II, the signal z&#39; i  can be traced back, by rotating it by -pi/2, to a normal BPSK configuration, and then a normal phase detector for BPSK can be used; that is, the phase error can be determined for instance by 
     
         ΔΘ&#39;.sub. =arg[(-jz&#39;.sub.i).sup.2 ]. 
    
     If the definition is made that f&#39; i  =0 means membership in group I, and f&#39; i  =1 means membership in group II, then the determination of the phase error for both cases can also be represented by 
     
         ΔΘ&#39;.sub.i =arg[(1-2f&#39;.sub.i)·z&#39;.sub.i.sup.2 ]. 
    
     The example of QPSK modulation with the division into two BPSK channel symbol groups rotated relative to one another can naturally be applied directly to other types of modulation as well. In MPSK modulation, for example, a division into two M&#39;PSK channel symbol groups (where M&#39;=M/2) rotated relative to one another, or into four M&#34;PSK channel symbol groups (where M&#39;=M/4) rotated relative to one another, can be done. In general terms, a channel symbol alphabet with M stages can be divided into K groups, not necessarily of equal size, and each group contains fewer than M symbols. These groups may possibly even be overlapping, or in other words one or more channel symbols may be included in more than one group. In that case, the phase detector can be realized as shown in FIG. 4, for example. The signal z&#39; i  is delivered to K processing blocks, and the r th  block represents a phase detector for a symbol configuration corresponding to the r th  channel symbol group, and 1≦r≦K. Depending on the signal f&#39; i  furnished by the data decoder, which signal after all provides information on the group membership, the output signal of the phase detector that belongs to this group is then used. If the definition is made that f&#39; i  =r designates membership in the r th  group, then the phase error ΔΘ&#39; i  is provided by the equation ΔΘ&#39; i  =ΔΘ&#39;f i ,i, where ΔΘ&#39; r ,i represents the output signal of the phase detector for the r th  group. But if the channel symbol groups differ from one another only in the rotation, then as in the above example of QPSK modulation the signal z&#39; i  can initially be traced back to a single group by means of a rotation determined by f&#39; i , and then only one phase detector for a single group is needed. 
     If the data decoder additionally furnishes a quality standard α i  for the group decision g&#39; i  that has been made, than the output signal can naturally also be weighted in accordance with the quality. This can be done for instance by simple multiplication, if α i  ≧0 and if greater values of α i  designate a higher reliability of the group decision. 
     If the data decoder furnishes one quality standard for each of the K groups, that is, α1,i, α2,i, . . . , αK,i, then it is also possible in accordance with FIG. 5 to add up the output signals, weighted in accordance with their quality, of all K phase detectors for the K groups using an adder Ad, so as to obtain a phase error signal for the control loop. 
     If the data decoder as in reference 1 furnishes estimated values for the channel symbols c&#39; i , then these values can be converted into a group decision, for instance by means of a table. If the group division is then chosen such that there are fewer groups than channel symbols, then f&#39; i  contains less information than c&#34; i , with the consequence that f&#39; i  has less error and is thus less problematic, especially for the initial phase of the synchronization. 
     Alternatively, with the estimated data bits d&#39; k  of the data decoder Dd, these estimated values c&#34; i  could be obtained as in reference 1 and then converted into the group decision as described above. 
     In both cases, a decision with regard to the data bits d k  or the channel symbols c i  is made, which will hereinafter summarily be called a data decision. 
     The method of the invention can naturally also be employed with other synchronization or compensation devices, in which case different names are merely used. In carrier frequency synchronization, the parameter detector is as a rule called a frequency error detector, and its output signal is accordingly called a frequency error. In clock phase or clock frequency synchronization, the same terms as in carrier phase or carrier frequency synchronization are typically used. In amplitude regulation, the parameter detector is as a rule called a level detector, and its output signal is called a level error. In quadrature error synchronization (or more accurately, quadrature error compensation), the terms &#34;quadrature error detector&#34; and &#34;quadrature error&#34; are used. 
     Instead of the reverse closed-loop control described, forward closed-loop control can also be performed.