US 5,790,595 AGrant
Method for Obtaining Bit-Specific Reliability Information
Issue Date:1998-08-04
•12 Claims
•2 Drawing Sheets
Abstract
In a method for demodulation of multistage-modulated data, correspondence variables (decision variables) are determined from the comparison of the received signal with stored signals, and these correspondence variables are converted into a posteriori symbol probabilities. The received signal represents a symbol which in turn represents a data group. The a posteriori symbol probabilities are now accounted for in turn such that one individual probability information item is produced for each bit of a data group, which information indicates the probability of a relevant bit being +1. Reliability values are determined from these bit-specific probabilities, and these reliability values are output, together with the bits, as soft bits.
Metadata
Assignee
- Robert Bosch GmbH
Inventors
- Marcus Benthin
- Karl-Dirk Kammeyer
Application Information
Application Number:US 5236991
Filing Date:1995-09-05
Priority Date:1994-09-02
Art Unit:267
Classifications
IPC:
H04B 0000
Field of Search:
375371224;226;227;254;278;284;285;324;341;3406;43
Patent Drawings (2 sheets)
Description
Field of the Invention
The present invention relates to a method for obtaining reliability information for M-stage modulation.
Background Information
A method for obtaining reliability information for M-stage modulation is described in A. J. Viterbi, "Performance of power-controlled wideband terrestrial digital communication", IEEE Transactions on Communications, Vol. 41, No. 4, April 1993, page 559 et seq., in the case of which, however, only one reliability information item is calculated via a symbol, that is to say via a data group, and all of the data of a data group are assessed using the same reliability information. Consequently, the information which is located in the individual bits of a data group is not evaluated completely in order to determine the distinct data. Information which is available is thus not used.
Furthermore, a mean received energy, which is split uniformly between a plurality of diversity paths, is used as the basis for the calculation of the reliability information. The individual reception paths of an actual transmission channel in general transmit different energies, however. Both the assumption of a mean total energy and the assumption of uniform distribution of this mean energy between the diversity paths normally leads to a less accurate determination of the reliability information.
Summary of the Invention
The method according to the present invention has the advantage that an individual reliability information item is determined for each bit of a data group. The significance of the determined reliability information is thus advantageously enhanced.
It is particularly advantageous to use the current noise power and the instantaneous useful energy of the received signal to determine the reliability information. Consequently, it is possible to calculate the reliability information with high accuracy. The noise power and the useful energy are preferably estimated at defined time intervals.
A preferred calculation of the reliability information comprises using the specific distribution densities of the observed received signal subject to the assumptions of the M possible transmitted signals, as a result of which particularly accurate calculation of the reliability information is possible.
Brief Description of the Drawings
FIG. 1 shows a block diagram of an arrangement for carrying out the method according to the present invention.
FIG. 2 shows a flow chart illustrating the method according to the present invention.
FIG. 3 shows a value table for illustrating the method according to the present invention.
Detailed Description
FIG. 1 shows a receiving antenna 10 which is connected to the input of a receiving unit 13. An output of the receiving unit 13 is connected to an input of a demodulator 11. An output of the demodulator 11 represents memory. The signal which is received by the receiving antenna 10 is passed on to the receiving unit 13. The receiving unit 13 amplifies the received signal. Subsequently, the amplified signal is changed from the carrier frequency to an intermediate frequency, by means of frequency mixing. The frequency-shifted signal is amplified and is fed to the demodulator 11. The demodulator 11 carries out carrier demodulation and passes the demodulated signal to the computer unit 12.
FIG. 2 shows schematically the program sequence for operation of the computer unit 12. The demodulated signal is fed to the computer unit 12 in program step 1. The demodulated signal represents a signal which has been modulated using M-stage modulation. The number M of stages is greater than or equal to 2. Each of the M signals which are used for modulation represents a symbol which represents a defined group of data bits. The M signals used for modulation are stored in the memory of the computer unit 12. The corresponding group of data bits is stored in a table, which is stored in the memory of the computer unit 12, for each of the M signals used for modulation.
In program step 2, the computer unit 12 compares the demodulated signal with the stored signals. The comparison is carried out using cross-correlation, as is described, for example, in Proakis, "Digital Communications", McGraw-Hill Int. Book Company, 1983, ISBN 0-07-Y 66490-0, Chapter 4, page 139 et seq. However, other comparison methods such as that of the adapted filter demodulator, for example, can also be used. In this way, a number M of correspondence variables V.sub.j, j=0,. . . , M-1, are calculated for the received, demodulated signal, which correspondence variables indicate the level of correspondence between the received, demodulated signal and the individual stored signals.
A probability value P.sub.j is calculated using the correspondence variables V.sub.j, for each symbol, in accordance with the following formula:
The terms Q(V.sub.j) and q(V.sub.j) represent distribution densities. They describe the probabilities of occurrence for values V.sub.j of a determined correspondence variable. The density Q(V.sub.j) includes the assumption that the j-th symbol has actually been transmitted, while, in contrast, q(V.sub.j) is based on the assumption that the current symbol is not the j-th but one of the others. On the basis of the symmetry conditions, which are in general satisfied, of the transmitted symbols (orthogonality, the same symbol energy, etc.), the formulae for the densities Q(x) and q(x) are themselves independent of the symbol being considered; the reference to the transmitted symbol is produced only by the argument V.sub.j.
The formula definition of the densities Q(V.sub.j) and q(V.sub.j) is dependent on the receiver implementation and on the formation law which is used to determine the correspondence variables, and can differ from the described definition depending on the receiver or the formation law.
An incoherent L-path RAKE receiver having Square-Law-Combining (cf. J. G. Proakis, Digital Communications, McGraw-Hill, New York, 1983, Chapter 7.5) is considered in this exemplary embodiment. The additive channel interference is assumed to be statistically independent Gaussian interference. The distribution densities are then: ##EQU1## where 2.sigma..sup.2 =Power of the additive channel interference (complex; equivalent low-pass representation),
.rho..sup.2 =Total available useful energy (distributed between L paths),
I.sub.n (x)=Modified n-th order Bessel function of the first type, and
the constant .alpha. is governed, independently of the selected receiver structure, by the relationship: ##EQU2##
The noise power 2.sigma..sup.2 and the useful energy .rho..sup.2 must be known in order to calculate the probabilities P.sub.j. Both variables must be estimated continuously during operation.
In program step 3, an individual a posteriori probability is subsequently determined for each data bit of a group, and reliability information is calculated from this for each data bit. In this case, the probability values P.sub.j of the symbols for which the data bit at the v-th position in the data group corresponds with a fixed hypothesis for the data bit (for example b.sub.v =+1) are added up. The sum represents, for example, an a posteriori probability P(b.sub.v =+1) in that b.sub.v =+1. An a posteriori probability can be determined for the assumptions b.sub.v =-1 in a corresponding manner.
This method will be explained using the table in FIG. 3. The table shows the bit groups (b.sub.o,b.sub.1), which are assigned to the symbols, of in each case two data bits, the decision variables V.sub.i of the symbols and the probability values P.sub.i of the symbol decision.
Four different symbols are numbered successively from 0 to 3 in the first column 14 in FIG. 3, under the letter i. The decision variables (correspondence variables) having the values 0.9, 0.8, 0.1 and 0.05 are shown in the second column 15, under V.sub.i. M=4 symbols are used in this exemplary embodiment, which are represented by two data bits b.sub.o and b.sub.1, it being possible for each data bit to assume the value -1 or +1. The bit combinations assigned to the four symbols S.sub.0, S.sub.1, S.sub.2, S.sub.3 are shown line by line in the third column 16. The specific form of the symbols themselves is irrelevant to the current considerations; orthogonal Walsh symbols can be used, for example.
The probability values, calculated in accordance with the formula (11), of the symbols are illustrated in the last column 17, under P.sub.i. It can be seen from FIG. 3 that the value -1 of the data bit b.sub.0 in one case has the probability 0.5 for the symbol S.sub.0 and in one case has the probability 0.45 for the symbol S.sub.1. A total probability of (0.50+0.45)=0.95 thus results for the value -1 of the data bit b.sub.0. A probability of 0.03 results for the symbol S.sub.2 for the value 1 of the data bit b.sub.0, and a probability of 0.02 for the symbol S.sub.3. A total probability of (0.03+0.02)=0.05 thus results from a value +1 of the data bit b.sub.0.
It can be seen from this that the data bit b.sub.0 has a greater total probability for the value -1 than for the value +1. It is thus more probable that the value -1 is correct for the data bit b.sub.0. If one considers the data bit b.sub.1, then a probability of 0.5 results from the value -1 for the symbol S.sub.0 and a probability of 0.03 for S.sub.2. A total probability of (0.5+0.03)=0.53 thus results for the value -1 of the data bit b.sub.1. If one considers the value +1 for the data bit b.sub.1, then a probability of 0.45 results from the symbol S.sub.1, and a probability of 0.02 from the symbol S.sub.3. This leads to a total probability for the value +1 of the data bit b.sub.1 of (0.45+0.02)=0.47.
The result of this is that the value -1 is more probable for the data bit b.sub.1.
The following formula (1) shows the total probability for the value -1 of the data bit b.sub.0 :
The following formula (2) shows the calculation of the total probability for the value +1 of the data bit b.sub.0 :
The comparison in formula (3) results in the decision that the data bit b.sub.0 has the value -1:
The following formula (4) indicates the calculation of the total probability for the value -1 of the data bit b.sub.1 :
The following formula (5) indicates the total probability for the value +1 of the data bit b.sub.1 :
A comparison of formula (4) with formula (5) shows that the data bit b.sub.1 having the value -1 is distinct:
The associated reliability information L.sub.bo for the data bit b.sub.0 and L.sub.b1 for the data bit b.sub.1 are calculated in accordance with: ##EQU3##
Reliability information for the values -1 or +1 of the data bit b.sub.0 and b.sub.1 can be calculated from the total probabilities using the formula (7) and the formula (8). The reliability information is used for the purpose of making a statement relating to how probable is the decision to assign the values +1 or -1 to the data bits b.sub.0 and b.sub.1.
In an embodiment of the method according to the present invention, the reliability information is multiplied by the value of the data bits b.sub.0 or b.sub.1 in accordance with the following formulae (9) and (10):
Soft data bits b.sub.u v=0, . . . ,ld(M)-1 are thus calculated for each symbol interval. ld(M) designates the base 2 logarithm of the value M. Soft data bits are indicated explicitly in the following text for the soft data bit b.sub.0 for the value -1 and the value +1. ##EQU4##
This equality applies generally for each data bit b.sub.v of the data group.
Thus, only the values of the soft data bits b.sub.u.sup.(+1) need to be determined without any limitation of generality, in order to be able to make a decision on a statement of whether the value of the data bit b.sub.0 is +1 or -1. An explicit decision for a symbol is no longer necessary or sensible, since a decision is made for each data bit of the symbol.
The reliability information and the soft data bit b.sub.u.sup.(+1) are subsequently output in program step 4.
Finally, a jump is made to program step 1 and a new received and demodulated signal is processed.
If there is no further decoder stage in the transmission system for which the reliability information could advantageously be used, the final data bits b.sub.v are decided on firmly from the soft data bits b.sub.u.
The term firmly decided means that a decision is made on one of two values which are predetermined in a fixed manner, for example +1 or -1. The soft data bits can also assume values not equal to +1 or -1. A decision element outputs a +1 for each data bit b.sub.v if the mathematical sign of the soft data bit b.sub.u is positive. If the mathematical sign of the soft data bit is negative, then the decision is that b.sub.u , is -1.
However, the more usual case is for the output soft data bits or the reliability information to be further processed for example by a decoder in order to decide about information bits. A channel decoder or a source decoder, which is designed, for example, in the form of a Viterbi decoder, can be used as the decoder.
If the soft data bits b.sub.u are used to decide on information bits, the information bit is assumed to be -1 in the case of the soft data bit having a negative value, and the information bit is assumed to be +1 in the case of the soft data bit having a positive value.
The magnitude of the soft data bit is interpreted to be reliability information and is used, for example, for assessment of the path metrics during decoding using the Viterbi algorithm.
As a result of the reliability information and the soft data bits respectively being obtained and used, it is possible in the case of M-stage modulation to obtain bit-by-bit additional information (reliability information, soft data bit) during the demodulation, which additional information indicates a probability of how reliable a decision on a data bit is. Consequently, M-stage transmission methods are improved with respect to the reliability of the decision relating to "hard" data bits, that is to say data bits which can assume only predetermined values such as +1 or -1, for example.
If the additional information is included, M-stage transmission methods can be used efficiently in systems having downstream decoders. The additional information is advantageously used by subsequent signal processing units such as channel decoders or source decoders in order to improve the decision reliability.
The comparison of the received demodulated signal with the stored signals is carried out, for example, in the form of a Walsh-Hadamard-Transformation if orthogonal Walsh functions are used for M-stage modulation. A simple, incoherent receiver can be used in this way. The squares of the magnitudes of the Walsh-Hadamard-Transformations are used as decision variables.
In the case of a diversity receiver, such as a RAKE receiver or an antenna diversity, for example, which has a defined number L of transmission paths, the decision variables of the individual transmissions paths are added to form an overall decision variable Vg.sub.j. This is done, for example, using the following formula: ##EQU5##
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method for obtaining bit-specific reliability information during demodulation of multi-stage-modulated data transmitted via at least one modulated signal, comprising the steps of: receiving the modulated signal and comparing the modulated signal with a plurality of stored signals, each of the modulated signal and the stored signals representing a defined group of stored data bits; calculating a probability for each stored signal as a function of the comparison of the modulated signal with the stored signals; and determining reliability information as a function of the calculated probabilities.
2. The method according to claim 1, further comprising the step of determining a soft data bit as a function of the reliability information.
3. The method according to claim 1, wherein the probabilities are calculated for each data bit of a group.
4. The method according to claim 1, wherein the reliability information is determined as a further function of a known mean noise power and a known useful energy.
5. The method according to claim 4, further comprising the step of estimating the mean noise power and the useful energy at predetermined time intervals.
6. The method according to claim 1, wherein the probabilities P.sub.j are calculated in accordance with the following formulae: where Q(V.sub.j) is a first distribution density function of a determined correspondence variable V.sub.j assuming that the actually transmitted symbol is the j-th symbol and q(V.sub.j) is a second distribution density function of the determined correspondence variable V.sub.j assuming that the actually transmitted symbol is not the j-th symbol, wherein the constant .alpha. is obtained from the equation ##EQU6## where M represents a number of stages of modulation.
7. The method according to claim 1, further comprising the step of determining a probability that a data bit b.sub.v at a v-th position in the group is one of +1 and -1, P(b.sub.v =+1/-1), as a function of a summation of the calculated probabilities in which the data bit of the stored signals at the v-th position of the group likewise represents one of +1 and -1.
8. The method according to claim 7, wherein a value of +1 is assumed for the data bit b.sub.v, and further comprising the step of determining the reliability information L.sub.u (+1) in accordance with ##EQU7##
9. The method according to claim 8, further comprising the step of determining a soft data bit b.sub.u.sup.(+1) as a function of the reliability information L.sub.v.sup.(+1) in accordance with ##EQU8##
10. The method according to claim 7, wherein a value of -1 is assumed for the data bit b.sub.v, and further comprising the step of determining the reliability information L.sub.u.sup.(-1) in accordance with ##EQU9##
11. The method according to claim 10, further comprising the step of determining a soft data bit b.sub.u.sup.(-1) in accordance with ##EQU10##
12. The method according to claim 2, wherein the reliability information and the soft data bit are used for channel decoding and for source decoding, respectively.
Patent Citations (11)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4224689 | 1980-09-01 | Sundberg | |
| US5119400 | 1992-06-01 | Koch | |
| US5222101 | 1993-06-01 | Ariyavisitakul et al. | |
| US5333150 | 1994-07-01 | Ketterling | |
| US5335250 | 1994-08-01 | Dent et al. | |
| US5414738 | 1995-05-01 | Bienz | |
| US5432821 | 1995-07-01 | Polydoros et al. | |
| US5537444 | 1996-07-01 | Nill et al. | |
| DEX3910739A | 1990-10-01 | ||
| DEX4224214A | 1994-01-01 | ||
| GBX2185367A | 1987-07-01 |
Non-Patent Literature (9)
- Vardy, A. et al: "Bit Level Soft Decision Decoding of Reed-Solomon Codes", Proceedings of the 16th IEEE Conference of Electrical and Electronics Engineers in Israel, 7-9 Mar. 1989, New York, US.
- Bahl, L. R. et al, "Optimal Decoding of Linear Codes For Minimizing Symbol Error Rate", Transcactions on Information Theory, Bd IT-20, Nr. 2, Mar. 1974, New York, US.
- Woerz T et al.: "Iterative Decoding For Multilevel Codes Using Reliability Information", Globecom '92, Communication For Global Users, Bd. 3 of 3, 6-9 Dec. 1992, New York, US.
- Kazuhiko Yamaguchi.: "A Soft Decision Viterbi Decoding Method Using Received Carrier Level In Fading Channel", Electronics & Communications in Japan, Part I--Communications, Bd. 73, Nr. 2, 1 Feb. 1990, New York, US.
- Hagenauer, J.: "Viterbi decoding of convolutional codes for fading--and burst-channels", 1980 International Zurich Seminar On Digital Communications, 4-6 Mar. 1980, New York, US.
- Benthin, M. et al.: "Viterbi Decoding of Convolutional With Reliability Information For A Noncoherent Rake-Receiver In A CDMA-Environment", Proceedings of the Global Telecommunications Conference (Globecom), San Francisco, Nov. 28-Dec. 2, 1994, Bd. 3 of 3, 28 Nov. 1994, Institute of Electrical and Elctronics Engineers.
- A.J. Viterbi, "Performance of power-controlled wideband terrestrial digital communication", IEEE Transactions on Communications, vol. 41, No. 4, Apr. 1993, p. 559 et seq.
- Proakis, "Digital Communications", McGraw-Hill Int. Book Company, 1983, ISBN 0-07-Y 66490-0, Chapter 4, p. 139 et seq.
- J.G. Proakis, Digital Communications, McGraw-Hill, New York, 1983, Chapter 7.5.