Title of Invention  "A DEVICE FOR FINALLY DETECTING SYMBOLS IN A RADIO SYSTEM" 

Abstract  A receiver device (703) downspreads signals from a band spreading signal, which generates downspread symbol sequences (803). A vector generator (704) generates symbol vectors (805) which include a symbol from each downspread symbol sequence (803). An auxiliary receiver (705) detects symbol vectors (805) in a first window (809) with the length of one symbol time. The auxiliary receiver (705) generates provisional estimates of the symbol vectors (805) with the help of a device with a first window algorithm (811). A delaying module (706) delays the symbol vectors (805) from the vector generator (704) by one symbol time before they reach a main receiver (707). The main receiver (707) detects in a second window (806) the symbol vectors (805) with the length of one symbol time. The main receiver (707) uses a device with a second window algorithm (808) in order to estimate the received symbol vectors (805) with reference taken to the previously estimated symbol vectors in the main receiver (705) and the provisional estimates of the symbol vectors (805) from the auxiliary receiver (705). A component generator (710) divides up the estimated symbol vectors (807) from the main receiver into separate components (815). Publication Figure: Figure 8. 
Full Text  Field of Invention The present invention relates to a device for finally detecring symbols in a radio system. The present invention relates to receiving of radio signals which are transmitted by means of brand spreading techniques in a common frequency band in a radiocommunication system. A method which is used for transmitting information from a number of simultane¬ous users on a common frequency band is called a multiple access method. The most common forms of multiple access are based on frequency multiplexing, FDMA (Frequency Division Multiple Access) and time multiplexing, TDM A (Time Division Multiple Access). . In FDMA the available band width is divided up into a number of narrow frequen¬cy bands. A user in the System is allocated an empty frequency band for its exchange of information. In TDMA the available band width is divided up into a number of narrow frequency bands with a number of time slots in each frequency band. The time slots are repeated normally periodically and correspond to the narrow frequency band in FDMA. This considerably increases the capacity for a system with a given band w^dth compared with FDMA. An alternative to TDMA is a group of multiplex techniques which are called code multiplexing, CDMA (Code Division Multiple Access). These multiple techniques are also called band spreading techniques. CDMA means that a number of simultaneous connections can use a common frequency band. CDMA, like TDM A, is suitable for'digital techniques. A variant of CDMA is the direct sequence technique, DSCDMA. DSCDMA means that each user marks his connection with the help of a unique code, also called the spreading sequence, which is independent of the information which is to be sent. That the transmitter marks his signals with a spreading sequence before they are transmitted is called upspreading of the signals. The spreading sequences have a much larger band width than the information of the user whereby the signal is spread out over a large frequency band of the spreading sequence. Several simultaneous users in the system use the same frequency band whereby the information from these users is superimposed on each other. In a receiver the received signals are spread down with a copy of the user's spreading sequence which means that the original signal can be reconstituted. The down spreading can also be .performed with the help of a signal adapted filter. DSCDMA techniques use the available frequency space in an effective way. A large problem with DSCDMA techniques is that a strong signal can drown other weaker signals from more distant or hidden users in the system. This is usually called the nearfar problem. A solution to this problem has been to introduce power regulation into the system. These regulation systems are very complicated and expensive. The regulation system must be extremely fast at regulating for variations in the energy levels of the signals. A method of minimizing the requirement for advanced power regulation in CDMA systems is treated in several articles of S.S.H. Wijayasuriya, J.P. McGeehan and G.H. Norton. A first article is "Sliding Window Decorrelating Algorithm for DSCDMA Receivers", pages 15961598, in Electronic Letters, volume 28, number 17, from 13 August 1992. A second article is "RAKE Decorrelation as an Alternative to Rapid Power Control in DSCDMA Mobile Radio", pages 368371, from Proceedings 43rd Vehicular Technical Conference in New Jersey, 1993 and a third article is "A NearFar Resistant Algorithm to Combat Effects of Fast Fading in MultiUser DSCDMA Systems", pages 645649 from Proceedings 3rd IEEE International Symposium Personal, Indoor and Mobile Radio Communication in Boston in October 1992. By using a sliding window algorithm, called SLWA, the signals can be detected without extensive power regulation. The socalled window is a time interval in which the received signal is detected. SLWA detects a number of symbols, from the different users, which comprise at least one bit per symbol, from the down spread incoming signals. The time window which holds a number of symbols is moved over the signals one bit, or one symbol, at a time. An extensive calculation process corrects the bits/symbols in the window before a final estimation and detection of the received symbols is performed. The algorithm uses a preceding estimate of a bit/symbol and calculated expected estimate of a coming bit/symbol in order to adjust for edge effects, that is to say errors which occur at the beginning and at the end of the window. The calculated expected estimate of a coming bit/symbol is found via a probability calculation. By using a convolution code with half the working cycle time (1/2 rate convolutional code), and know¬ledge about the double number of bits of the last of the bits detected in sequence minus one (2 x constraint length 1), an expected estimate of the next bit/symbol in the window can be calculated. Said method presupposes that the last received bits are correctly detected. By choosing a large window length in SLWA the effect of the edge effects on the detection of the signals is reduced. This also facilitates the introduction of so called interleaving into the system. A large window, however, entails a large number of calculation processes as each new bit/symbol which falls in the window generates a new calculation process for all bit/symbols in the window. This means that a new calculation process overlaps the proceeding calculation process so closely as to one bit/symbol. A patent from MOTOROLA INC. WO 95/22208 describes a device for receiving DSCDMA signals without using power regulating. The device uses pilot symbols with known polarities which at equal intervals are put into the signals of the transmitter. Modulation with pilot symbols is called PS AM (Pilot Symbol Assisted Modulation). The received signals pass through a signal adapted filter in which the signals are spread down in order to be then stored in a memory. A predetermined part of each received signal forms a vector in a window. The receiver forms an inverse cross correlation matrix of the known used spreading sequences and time delays between the received signals. The receiver also calculates an estimate of the energy level before and after the window with the help of the known pilot symbols and a preceding estimate of the content in a received window. Said pilot symbols are sent in such a way that they frame the window. The energy estimate is multiplied with a part of the cross correlation matrix in order to then be subtracted from a vector in the memory. This removes interference from the symbols outside the window and forms a new vector. The device multiplies the new vector with the cross correlation matrix which forms a last vector. This last vector is detected in a detector in the device. As mentioned earlier the receiver requires that a modulation with the pilot symbols is provided in the system. DISCLOSURE OF THE INVENTION The present invention tackles said nearfar problem which occurs during radio transmissions with a band spreading technique. Defined more closely the problem occurs in the case one or more signals in a common frequency band has a more powerful signal level than the other signals which are to be received, whereby the other signals risk being drowned by the more powerful signal. .he object with the present invention is consequently, with a minimal energy loss, to detect the received signals and increase the possibility of correct detection of a signal which has a lower signal level than some stronger signal. This permits the introduction of simple power controlling algorithms and that the capacity of the system can be increased. The invention provides a method and a device for solving said problem. A predetermined time sector of the received signal is estimated and edge effects at the beginning and end of the time sector are eliminated. This takes place through comparing a part of the beginning of the received signal with a corresponding part which is detected in a preceding time sector. An estimate of the signal in a coming time sector is compared with the finish of the just received signal. At the same time the condition of the signal is compensated for and the interference which the other signals initiate in the received signal. More concretely, the solution is a method and a device with an auxiliary receiver and a main receiver. In the auxiliary receiver a preliminary estimate of a predetermined time sector of the signal is generated. In the main receiver a final estimate of the signal in the main receiver's time sector is generated. Here account is taken of on the one hand a preceding final estimate of the signal in a earlier time sector in the main receiver, on the other hand the preliminary estimate of the signal for the predetermined time sector from the auxiliary receiver, which precedes the time sector which the main receiver detects. The invention also takes account of the condition of the channel, the spreading sequences used for the received signals, which symbols are used and the time delay between the different received signals. The advantage with the following invention is thai the invention is not sensitive 10 interference from nearby users or systems without requiring extra coding or symbols 10 be introduced into the signaling. The need for complicated power regulation algorithms is reduced. The signal processing in the invention can be performed in such a way that energy losses are reduced compared with known methods. This means that the capacity in the system can be increased or that the qcaiiiN of the detected signals improved. The invention can be applied to both up and down links in radio connections. The invention can be used in different types :f receiver. The invention will now be described more closely with the help of preferred embodimems and with reference to the accompanying drawings. STATEMENT OF INVENTION: The present invention relates to a device for finally detecring symools in a radio system with band spreading, whereby the transmitted radio signals from at least one user are upspread with spreading sequences and the signals transmitted on a common frequency band, said device is characterized by: (a) a receiving device (703) with correlators (800) and spreading sequence generators (801) for the downspreading of the signals with the help of a preading sequence (100, 111) corresponding to the upspreading, wherein the sard receiver device (703) is arranged to generate a predetermined number of downspread symbol sequences (803) from each user (701a, 701b, 701c) on a channel; (b) a delaying module (706) connected to the receiver device (703), where the module is arranged to delay a predetermined number of symbols (401) from each symbol sequence (803) for a predetermined time period; (c) a main receiver (707) connected to the delay module (706) and arranged to detect the predetermined number of symbols (401) in a second window (806) with a predetermined length (601,604); (d) an auxiliary receiver (705) connected to the receiver device (703) and arranged to detect the predetermined number of symbols (401) in at least one first window (809) having a predetermined length (601, 604), which first window precedes the second window (806); (e) a cross correlation generator (709) connected to the receiver device (703) and arranged to generate cross correlation matrices corresponding to the downspread symbol sequences (803), wherein the cross correlation matrices include on the one hand the spreading sequences (100, 111), on the other hand a time delay which occurs between respective signals of the users; (f) a channel detecring on generator (708) arranged to generate channel detecring on matrices for the channel (702); (g) whereby the auxiliary receiver (705) is connected to the cross correlation generator (709) and the channel detecrting on generator (708) and is arranged to detect the predetermined number of symbols (401) in at least the first window (809) and the auxiliary receiver (705) also is arranged to generate a provisional detection (810) of the predetermined number of symbols (401) which he before the second window (806) with the help of the , cross correlation matrices, channel detecting on matrices and provisional detecting previously generated in the auxiliary receiver (705), of the predetermined number of symbols (401); and (h) whereby the main receiver (707) is connected to the cross correlation generator (709), channel detecting on generator (708)and auxiliary receiver (705) and is arranged to generate (807) a final detecting on of the predetermined nurnberof symbols (401) with the help of the cross correlation matrices, channel detecting on matrices, a final detecting on previously generated in the main receiver (701), and the provisional detecting on (810) generated in the auxiliary receiver (705). DESCRIPTION OF THE FIGURES Figure 1 shows a view of a simple DSCDMA system. Figure 2 shows a view of a vector diagram. Figure 3 shows a view of a DSCDMA signal received before a downspreading. Figure 4 shows a view of three DSCDMA signals received after a downspreading. Figure 5 shows a more detailed view of one of three DSCDMA signals received after downspreading. Figure 6 shows aview of two windows with different widths in a window algorithm. Figure 7 shows a simple block diagram for a first preferred embodiment of the invention. Figure 8 shows a more detailed block diagram of a first preferred embodiment of the invention. Figure 9 shows a block diagram for a window algorithm. Figure 10 shows a simple sketch for a multipath propagation between a trans¬mitting antenna and a receiver. Figure 1 la shows a simple sketch of a direct receiver. Figure 1 Ib shows a part of a direct receiver with a signal adapted filter. Figure 12a shows a first part of a block diagram with details from a second embodiment of the invention. Figure 12b shows a second part of a block diagram with further details from a second preferred embodiment of the invention. Figure 13 shows a block diagram with details from a third preferred embodiment of the invention. Figure 14 shows a block diagram with details from a fourth preferred embodiment of the invention. Figure 15 shows a flow diagram for a method. PREFERRED EMBODIMENTS A known technique for transmitting superimposed radio signals on a common channel for the signals in a radio system is the socalled direct sequence band spreading techniques, also known as DSCDMA technique (Direct Sequence Code Division Multiple Access). The expression channel means here the physical transmission medium between the transmitter and receiver and also transmitter and receiver filters. Figure 1 shows schematically a transmitter 102 and a receiver 108 with the signal diagram 100, 101, 104, 106 107, 109 and 111. These diagrams shows amongst others, a data sequence 100 and the narrow band spectrum 101 and a spreading sequence 111. In the diagram time is referenced with t, frequency with f and amplitude with A. The spreading sequence 111 has a significantly larger band width than the data sequence 100. DSCDMA means that the narrow band data sequences 100 and 101 from a user of the transmitter 102 is multiplied by the extremely wideband spreading sequence 111, also called the PNcode (Pseudo Noise Code) which is generated by a spreading sequence generator 103. This is called upspreading or coding of the data sequence, which means that the information in the sequence 100 is spread over a large frequency range. A resulting wide band signal 104 is mixed in turn with a carrier wave with a central frequency fo from a transmitter oscillator 105 to form a transmitted signal 106. The transmitter oscillator can also, according to an alternative, be directly modulated by the spreading sequence 111. Several users of the radio system transmit on the same frequency band which means that a number of signals are mixed with each other to form a signal 107. Each user who transmits a signal uses his own unique spreading sequence corresponding to the sequence 111. The length of these spreading sequences can vary between different systems and users. In a receiver 108, which receives the signal 107, a copy of the spreading sequence 111 is used in order to spread down the signal. The superimposed wide band signals 107 here are made into a narrow band data sequence and a little noise 109. The sequence 109 herewith corresponds to the original transmitted data sequences 100 and 101. In order that the receiver 108 shall be able to separate the different signals which are transmitted on the common channel, unique spreading sequences 111 are used as mentioned earlier. If the different spreadup signals during receiving, repre¬sented in vector form, are orthogonal, that is to say the vectors have an angle of 900 between each other, then the vectors are independent of each other. The downspread data sequences in this case only contain data from the respective user. It is, however, normal that different characteristics in the channels mean that the vectors become nonorthogonal. In the uplink, between the mobile and base stations, the time points for the transmissions from the mobiles are often not synchronized which leads to that it is not worth using completely orthogonal spreading sequences. This means that the vectors become dependent, which leads to the downspread data sequences being influenced by each other's signals. There are only a limited number of spreading sequences 111 which are completely orthogonal with each other. The number of orthogonal spreading sequences in¬creases with the length of them. A measurement of how orthogonal two vectors are is given by cross correlation. A small cross correlation means that the vectors are nearly orthogonal. When, for example, a socalled joint detection receiver receives two noncompletely orthogonal vectors 102 and 202 with a large cross correlation, see Figure 2, then according to a known method the joint detection receiver projects one of the vectors 201 so that it forms an orthogonal vector 204 to the other vector 202 before the signal 201 is detected. This means that the signal energy, the length of the vector, is reduced in the new vector 204 compared with the original vector 201. The vector 202 is projected 206 in the same way,as vector 201 so that it forms a vector 205 orthogonal with the vector 201. The example shows vectors in two dimensions while vectors which represent DSCDMA signals usually have many more dimensions than those which are shown in figure 2. As mentioned earlier, in the DSCDMA technique several signals are sent on the same frequency band. Figure 3 shows an example with three DSCDMA signals from three different users which are received by the receiver 108. They are superimposed on the same frequency band but are time shifted in relationship to each other. Figure 4 shows the three signals after downspreading whereby they are separated into three different symbol sequences yls y2 and y3 comprising a sequence of symbols 401 which are sent at discrete time points. Each symbol occupies a symbol time ts. The letter m is a time index for the symbols, wherein the time index is increased by integer numbers. If the three spreading sequences yb y2 and y3 are not orthogonal, see Figure 2, with each other then each separate symbol sequence yl5 y2 and y3 comprise the nonorthogonal parts of each other's symbol sequences. Figure 5 shows the symbol sequence y\ and the nonorthogonal to Y! parts of the symbol sequences y2 respectively y3. The nonorthogonal parts of y2 and y3 which overlap yt interfere with the subsequent detection of the symbol sequence yt. If the symbol sequences are received in a continuous stream then a window algorithm can be used for estimation and detection of the individual symbols in the symbol sequences. The window algorithm estimates a predetermined number of symbols from each received signal yt, y2 and y3 in a so called window 601, see Figure 6. The size of the window influences how large a part of the symbol sequences yl5 y2 and y3 the receiver detects in each time unit. The symbols 602 and 603 at the beginning of the window and its finish are not detected because only parts of these symbols fall within the length of the window. It is only whole symbols in the window 601 which are detected. Said cause of errors is known as edge effect. In large windows edge effects are ignored because the number of signals which are lost because of edge effects are small compared with the total number of symbols in the window 601. However, with small windows 604 then said error becomes noticeable. An example of a realization of a window algorithm can be a shift register which shifts one symbol forward at a time. The present invention builds on the idea that the received symbol sequences yi, y2 and y3 are detected in a short window, even as low down as a symbol time length ts. The edge effects are compensated for through overlapping and nonorthogonal parts of the symbol sequences y2 and y3 in the time being subtracted so that only the desired symbol sequence yt remains. In this way the energy in the symbol sequence yl is better utilized and a large part of the losses which were mentioned in connection to Figure 2 are avoided. igure 7 shows a first embodiment of the invention for detecting symbols out of DSCDMA signals from different users. This example shows three users 70la, 70 Ib and 701c. The signals are transmitted on a common radio channel 702 without multipath propagation. The device comprises a receiver means 703 which spreads down the received DSCDMA signals and generates the spread down symbol sequences. The receiver means are connected to a vector generator 704 and a cross correlation generator 709. The vector generator 704 generates vectors with downspread symbols, so called symbol vectors, which contain a symbol from each downspread symbol sequence yb y2 and y3. The vector generator 704 is directly connected to a input 713 on an auxiliary receiver 705 and an input 711 to a delay module 706. An output 712 on the delay module 706 is connected to a main receiver 707. The delay module 706 delays the symbol vectors by a symbol time ts, which means that if the vector generator 704 generates the symbol vector y(m+1) then the main receiver 707 detects the symbol y(m). The main receiver 707 is also connected to channel estimating generator 708 which generates channel estimate matrices, cross correlation generator 709 which generates cross correlation matrices and to a component generator 710 which divides up an incoming symbol vector into individual components. The auxiliary receiver 705 which is connected to the vector generator 704 via its input 713 is also connected to the channel estimate generator 708 and cross correlation generator 709 and via an output 714 connected to the main receiver 707. Described in a superficial way, the abovementioned inventive idea is performed so that the edge effects for the symbol vectors y(m) are compensated for in the main receiver 707 partly with the help of the already detected symbol vector y(m1) and partly with the help of the following symbol vector y(m+1), the value of which is estimated in the auxiliary receiver 705. The main receiver 707 and auxiliary receiver 705 detect the symbol vectors each in their own time windows. Figure 8 shows in more detail how the device is constructed. The receiver device 703 comprising correlators 800 and spreading sequence generators 801 for downspreading of the received DSCDMA signals 802 to the downspread symbol sequences 803. The receiver means 703 also generates a value for the delay \ 804 between the symbol sequences 803 of the users. The main receiver 707 detects the symbol vectors 805 from the vector generator 704 via the delay module 706 in a second window 806 with the length of one symbol time ts. This means that it is extremely important that the receiver corrects for edge effects. The main receiver 707 uses a device with a second window algorithm 808 in order to calculate a final estimated symbol vector 807 for the received symbol vectors 805. The following component generator 710 divides up the final estimated symbol vectors 807 into individual components 815 for each user. The auxiliary receiver 705 detects the symbol vectors 805, in a first window 809 with a length of one symbol time ts, one time unit before the symbol vectors which the main receiver 707 detects in the second window 806. This means that the auxiliary receiver 705 generates provisionally estimated symbol vectors 810 of the next coming symbol vector in the main receiver 707. When the auxiliary receiver 705 detects the symbol vector y(m+1) it generates a provisionally estimated symbol vector up(m+1) with the help of a device with a first window algorithm 811. The window algorithm in the auxiliary receiver 705, see Figure 9, comprises a calculation Bl, z(m+l) = Hl(m+l)C(m)up(m), a subtraction SI, x(m+l) = y(m+l)z(m+l), and an equation El, x(m+ l) = C(m+ l)H2(m+ l)u(m+1). In this connection the received symbol vector is referenced as'y(m+l), a first partial signal as x(m+l) which is a result of the subtraction SI, a first correction term as z(m+1), which is a result of the calculation Bl, a preceding provisionally estimated symbol vector as up(m), channel estimations from the channel estimation generator 708 as C(m) and C(m+1), cross correlation matrices from the cross correlation generator 709 as H^mf 1) and H2(m+1) and a first corrected symbol vector as u(m+1). The channel estimate matrix C corrects for the interference which occur in the channels between the transmitter and the receiver. The cross correlation matrices H and the preceding provisional estimated symbol vector up(m) are used in order to correct parts of overlaps from other users. In Figure 9 the channel estimation matrices are referenced by C and the cross correlation matrices by H. With the help of the first corrected symbol vector u(m+1) a decision is taken on which symbols said symbol vector u(m+1) covers. This generates the provisional estimated symbol vector up(m+1) with a received symbol from each user. The main receiver 707 takes account of both the preceding symbol vector y(ml) and the next symbol vector y(m+1) when the finally estimated symbol vector u(m) of y(m) is generated. The window algorithm in the main receiver 707 uses a calculation B2, z(m)=H3(m)C(m+ l)up(m+1), a calculation B3, w(m)=H1(m)C(ml)u(ml), a subtraction S2, x(rn)=y(m)[z(rn)+w(m)] and an equation E2, x(m)=C(m)H2(m)u(m). In this connection the symbol vector received in the main receiver 707 has the reference y(m), a preceding final estimated symbol vector in the main receiver 707 is u(ml), the provisionally estimated symbol vector from the auxiliary receiver 705 is up(ml), a second correction term is z(m), which is a result of the calculation B2, a third correction term is w(m) which is a result of the calculation B3, a second partial signal is x(m) which is a result of the subtraction S2, the channel estimate from the channel estimation generator 708 is C(m), C(m+l) respectively C(ml) and the cross correlation matrices from the cross correlation generator 709 are H^m), H2(m) and H3(m), and a second corrected symbol vector is u(m). With help of the second corrected symbol vector u(m) a decision is taken on which symbols said symbol vector u(m) includes. This generates the final estimated symbol vector u(m) with a symbol 401 received from each user. Each symbol is detected only once in the respective receivers which gives an effective symbol detection. The channel estimating generator 708 can be designed in a number of ways, for example as part of program code for a digital signal processor, DSP, or as part of an ASIC. The estimation of the channel estimate is complicated and can be performed with the help of different methods. An example of such a method is to transmit a number of known symbols 401 with a separate spreading sequence 111. Starting from how the received known symbols appear and how they should appear if the channel 702 was ideal, the channel estimate can calculated. The said method requires an extra connection 715, see Figure 7, between the channel estimate generator 708 and the receiving means 703. Another example is to place known symbols in the other signals in a regular manner which is similar to the earlier described PS AM technique. This method means that it is not necessary to have any extra connection 715 between the channel estimating generator 708 and the receiver means 703. This, however, requires that a double directed signal between the channel estimating generator 708 and the main receiver 707 can be produced. This signaling is illustrated in the Figures with two oppositely directed arrows 716. In said embodiment the channel estimating generator 708 includes a number of functions in the receiver which calculate an estimate of the interference which the channel 702 has introduced on the symbol sequences 803 of the respective users 701a701c. The interference is corrected in the receiver with the help of the channel estimation matrices C which comprise the values of the channel estimates which the channel estimation generator 708 generates. For a closer description of two examples of said functions and their design in a so called straight receiver reference is made to Digital Communications by John G. Proakis, published by McGrawHill, third edition, ISBN 0070517266 , pages 802804, 1995. The cross correction generator 709 comprises a number of functions in the receiver which calculates the dependency between the received signals 802. In this case the value of the cross correlation between the spreading sequences of the received signals 802. In order to generate cross correlation matrices information is required on the time delay T between respective user symbol sequences 803 and information on which spreading sequences 111 are used in the radio system. Information onr 804, see Figure 8, is taken from the receiver means 703 and information on the spreading sequences 813 used is taken from higher system levels 812 in the communication system. An estimate of T can for example be made by spreading down a received signal with different delayed versions of the spreading sequence 111. The time delay which gives the strongest signal gives the Twhich is been looked for. The cross correlation matrices H from the cross correlation generator 709 are used by the window algorithm in the devices 811 respectively 808 in order to correct for overlapping between the signals. The component generator 710 receives the final estimated symbol vector 807 from the main receiver 707. The symbol vectors which include a symbol 401 per user are divided up into separate components 815 which include symbols from the one and the same symbol sequence 803. That is to say the symbol generator 710 generates one component 815 per user. A signal from a transmitter can go different ways before it reaches a receiver. In this case the same signal is divided up into a number of beams, which is called multipath propagation. Figure 10 shows how a signal 1001 has been divided into three beams 1002, a direct beam 1003 and two reflected beams 1004 and 1005. These beams reach the'receiver 1006 with a certain mutual time displacement. A known type of receiver which can collect together the energy from several beams and take advantage of multipath propagation is a so called direct receiver. The direct receiver collects in a known way a predetermined number of beams from the one and same signal. Figure lla shows an example of a direct receiver 1100 for the three beams 1003, 1004 and 1005. The direct receiver 1100 is connected to an antenna 1116 via a unit 117 with, amongst others, receiver filters. The direct receiver comprises a first delaying element 1101 and a second delaying element 1002, each having an input and output. The input on the first delaying element 1101 is connected to the unit 1117. The output on the first delaying element 1101 is connected to the input on the second delaying element 1102. Two weighing devices 1106, 1111 and 1112 are connected to their own output on the delaying elements 1101 respectively 1102. A third weighing devices 1112 is connected to the input on the first delaying element 1101. The weighing devices 1106, 1111 and 1112 are each connected to their own correlator 1107, 1113 respectively 1114. The correlators are connected to a spreading sequence generator 1110 and an adder 1008. The incoming beams 1003, 1004 and 1005 reach the direct receiver 1100 with a mutual time displacement. The second beam 1004 is delayed the time rl in relationship to the first beam 1003. The third beam 1005 is delayed the time tl +c2 in relationship to the first beam 1003. The first beam 1003 passes through both delaying elements 1102 respective 1102 and is delayed the time T! + r2 while the second beam 1004 only passes through the first delaying element 1001 and is delayed the time x2. The third beam 1005 does not pass through any delaying element. This means that the time delay between the beams is eliminated. Each beam is weighed in the weighing devices 1106, 1111 respectively 1112 before the beams are spread down in the correlators 1107, 1113 respectively 1114, with the help of the spreading sequence generator 1110, to symbol sequences ql5 q2 and q3. The symbol sequences qt, q2and q3 are added in the adder 1008, which forms a resulting dowrispread signal 1109. The said correlators 1107, 1113 and 1114 and the spreading sequence generator 1110 can be replaced with three signal adapted filters 1118, 1119 and 1120, see Figure lib. A second preferred embodiment of the invention which can cope with multipath propagation is built upon the first preferred embodiment in connection to Figure 8. The receiver device 703 comprises a "direct receiver part 1115, see Figure 12a, which includes the direct receiver 1100 without the adder 1108 for the three beams 1003, 1004 and 1005, per user. The direct receiver part 1115 generates the three symbol sequences ql5 q2 and q3 per user. The main receiver 707 in Figure 12b includes a second adder 1203 for each user and the auxiliary receiver 705 includes a first adder 1202 for each user. Between the receiver arrangement 703 and the adders 1202 and 1203 the respective symbol sequences qlt q2 and q3 from the direct receiver part 1115 are treated in accordance with the first embodiment as described in connection to Figure 8. The first adder 1202 in the auxiliary receiver 705 sums the three first corrected symbol vectors u^m+l), u2(m+l) and u3(m+1) from a time point m+1. These symbol vectors originate from three symbol vectors qi(m+1), q2(m+1) and q3(m+1) which the auxiliary receiver 405 detects in the first window 809. The result of the summations are a first resulting corrected symbol vector ur(m+1). With the help of said symbol vector ur(m+1) a decision is taken to generate the provisional estimate up(m +1) of a symbol vector in the auxiliary receiver 705 in the same way as in the first embodiment. The second adder 1203 in the auxiliary receiver sums three second corrected symbol vector u^m), u2(m) and u3(m) from the time point m. These symbol vectors originate from three symbol vectors qi(m), q2(m) and q3(m) which the main receiver 707 detects in the second window 806. The result of the summations is a second resulting corrected symbol vector ur(m). With the help of said symbol vector ur(m) a decision' is taken to generate the final estimate u(m) of a symbol vector in the main receiver 706 in the same way as in the first embodiment. For the rest the two said embodiments are designed in the same way. A third preferred embodiment is based on the first preferred embodiment as described in connection to Figure 8. The second window 806 in the main receiver 707 is of the length four symbol times ts, see Figure 13. The vector generator 704 is arranged to generate wide symbol vectors 1302 and 1303 which include four symbols 4ts from each downspread symbol sequence 803. The auxiliary receiver 705 generates a provisional estimate 810 of a first symbol 1301 in the next wide symbol vector 1302 arriving at the main receiver 707. The main receiver 707 generates a final estimate 807 of all of the wide symbol vector 1303. The device with the window algorithm 808 in the main receiver 707 is adapted to the wide symbol vectors. Each symbol 401 in the symbol vector 1303 is detected once in the receiver 707. For the rest the first preferred embodiment corresponds with the third preferred embodiment. Even other lengths for the second window 806 can be conceived, whereby the number of signals from each symbol sequence 803 in the symbol vectors 805 are adapted to the length of the second window 806. The third suggested embodiment can also be combined with the second em¬bodiment. In this case the device is adapted to cope with multipath propagation and to work with wide symbol vectors 1302 and 1303. A fourth embodiment of the invention is based upon the first embodiment of the invention. In the fourth embodiment the auxiliary receiver 705 includes a first auxiliary unit 1401 and a second auxiliary unit 1402, see Figure 14. The delay module 706 includes a first delay unit 1403 and a second delay unit 1404. The two delay units 1403 and 1404 delay a symbol vector 805 each by a symbol time ts per unit. The input 711 on the delay module 706 is connected to the first delay unit 1403 which in turn is connected via an output 1405 to an input 1406 on the second delay unit 1404. The output 1405 to the first delay unit 1403 is also connected to the second auxiliary unit 1402 in the auxiliary receiver 705. An output 1407 on the second delay unit 1404 is connected to the output of the delay module 706. The first auxiliary unit 1401 is connected to the input 713 on the auxiliary receiver 705 and to the second auxiliary unit 1402 which in turn is connected to the output 714 on the auxiliary receiver 705. Both the first auxiliary unit 1401 and the second auxiliary unit 1402 are connected to the channel estimating generator 708 and the cross correlation generator 709. When the auxiliary receiver 705 detects a symbol vector y(m+2) then the first auxiliary unit 1401 generates a first provisional estimate upl(m+2) of the symbol vector y(m+2) with the help of an earlier first provisionally estimated symbol vector upl(m+1) in the first auxiliary unit 1401, channel estimate matrices C from the channel estimating generator 708 and cross correlation matrices H from the cross correlation generator 709. This has been described in detail in connection to Figure 8. The second auxiliary unit 1402 detects a symbol vector y(m+1) delayed in the first delay unit 1403, in a third window 1408 with the length of one symbol time ts. The second auxiliary unit 1402 generates a second provisional estimate up2(m+1) of the symbol vector y(m+1) with the help of an earlier second provisional estimated symbol vector up2(m) in the second auxiliary unit 1402, the first provisional estimate upl(m+2) of a symbol vector y(m+2) from the first auxiliary unit 1401, the channel estimate matrices C from the channel estimating generator 708 and the cross correlation matrices H from the cross correlation generator 709. This has also been described in detail in connection to Figure 8. The first auxiliary unit 1401 uses a device with a window algorithm 1409 in the same way as the auxilikry receiver 705 in the first embodiment. The second auxiliary unit 1402 uses a device with a window algorithm 1410 in the same way as the main receiver 707 in the first embodiment. The second provisional estimate up2(m+1) of a symbol vector y(m+1) corresponds to the provisional estimated symbol vector up(m+1) of the main receiver 707 in the first embodiment. The main receiver 707 generates the final estimated symbol vector u(m) as described in the first embodiment. For the rest the first preferred embodiment corresponds with the fourth preferred embodiment. The said devices, generators, modules and units in the said embodiments can be designed equally as hardware or software or as a combination of these. The main receiver 707 and auxiliary receiver 705 in said preferred embodiments can be of different types and variations, which are exemplified below. A receiver which treats the downspread symbol sequences 803 parallely in the receiver is called a joint detection receiver. A receiver which uses a linear transformation, for example multiplication with matrices, during treatment of the received symbols 401 is called a linear receiver. A linear receiver which uses matrices which are optimized to diminish interference without knowledge of the size of the noise are called linear decorrelated receivers. A linear receiver which uses an estimated value of the noise during treatment of a received symbol 401 is called an MMSEreceiver (Minimum Mean Squared Error receiver), that is to say a receiver which uses the minimum squared method. receiver can use coherent or noncoherent detection. A coherent receiver must know the phase position of the received carrier wave while a noncoherent receiver does not need to know said phase position. A receiver which during detection of the received symbols 401 chooses the most likely symbols is called a maximum likelihood receiver. The main receiver 707 and auxiliary receiver 705 in said preferred embodiments can be of linear receiver type, coherent receiver type, maximum likelihood receiver type, MMSEreceiver type, linear decorrelated receiver type, joint detection receiver type and decorrelated receiver type and different combinations of these. A method in accordance with the invention, which is performed in the device in Figure 3, is shown in a flow diagram in Figure 15. In Figure 15 the cross correlation matrices have the reference H and the channel estimating matrices the reference C. In a block 1501 the DSCDMA signals are received. The received signals are spread down in a block 1502 to the symbol sequences 803. A following block 1503 generates symbol vectors 805 which include a predetermined number of symbols from each symbol sequence 803. A block 1504 delays the symbol vectors in a first delay stage 706 before they reach a block 1514. In a block 1505 the cross correlation matrices H are generated and in a block 1506 the channel estimate matrices C are generated. The meaning of the cross correlation matrices H and channel estimation matrices C have been explained earlier in connection with the first embodiment, see Figure 8. In a block 1507 the first correction terms z(m+1) are generated with the help of on the one hand the preceding provisional estimated symbol vectors up(m) from a block 1511 and on the other hand the cross correlation matrices H and channel estimation matrices C belonging to said block 1507. The first correction terms from block 1507 are subtracted in a first btraction, in a block 1508, from the generated symbol vectors in block 1503. The first subtraction generates the first partial signals x(m+1). In a subsequent block 1509 the first corrected symbol vectors u(m+l) are generated with the help of on the one hand the first partial signals x(m+1) from the first subtractions in block 1508 and on the other hand the cross correlation matrices H and channel estimation matrices C belonging to said block 1509. The provisional estimation of the symbols in the first corrected symbol vectors u(m+1) is performed in a block 1510 which generates the provisional estimated symbol vectors up(m+1). In the subsequent block 1511 the estimated symbol vectors are delayed before they reach the block 1507 with the help of a second delay stage 901. Second correction terms z(m) generated in a block 1512 with the help of the one hand the provisionally estimated symbol vectors up(m.Tl1) from block 1510 and on the other hand the cross correlation matrices H and channel estimates C belonging to said block 1512. In a block 1513 the third correction terms w(m) are generated with the help of on the one hand the preceding final estimated symbol vectors u(m1) from one block 1517 and on the other hand the cross correlation matrices H and channel estimate matrices C belonging to said block 1513. In block 1514 the second and third correction terms are subtracted from the signal vectors from the block 1504 in a second subtraction. The second corrected symbol vectors u(m) generated in the following block 1515 with the help of on the one hand the cross correlation matrices H and channel estimation matrices C belonging to said block 1515 and, on the other hand, the second partial signals x(m) from the previous second subtraction in block 1514. In a block 1516 a final estimation of the symbols in the second corrected symbol vectors u(m) from block 1515 is performed, which generate the final estimated symbol vectors u(m). The said final estimated symbol vectors u(m) are delayed in block 1517 with the help of a third delay stage 902 before they reach block 1513. The method uses i.a. the earlier estimated symbol vectors up(m) and u(ml). This means that the first estimated symbol vectors in the receiver, at the start, are estimated without any knowledge of earlier preceding estimated symbol vectors. In order to achieve a good quality on the first symbol vectors estimated after the start a number of known symbols can be used at the start. These known symbols are sent in a known way from the users when they begin to transmit. The receiver compares these first symbols that are received with copies of them in a known way. This means that the following symbols can be estimated with a good accuracy. The said method can also be performed in the device of Figure 14. In said Figure the auxiliary receiver 705 includes, on the one hand, the first auxiliary unit 1401 and, on the other hand, the second auxiliary unit 1502.. The delaying module 706 includes the first delay unit 1403 and the second delay unit 1404. In the method the first preliminary estimation upl(mt2) of the symbol vector y(m+2) is performed and then the second preliminary estimation up2(m+1) of the symbol vector y(m+1), before the main receiver 707 performs the final estimation u(m) of the symbol vector y(m). The first said embodiment can also be performed in the device in connection to Figure 13. In said device the main receiver 707 performs a final estimation 1520 of four symbols 4ts at a time. The auxiliary receiver 705 performs a provisional estimation 1519 on the first symbol 1301 of the next four symbols 1302 arriving at the main receiver 707. CLAIMS 1. A method for finally estimating symbols (401) in a radio system with band spreading, wherein the transmitted radio signals (802) from at least one user (70la) are downspread with spreading sequences (111) and the signals transmitted on a common frequency band, which radio system includes a main receiver (707) and an auxiliary receiver (705), which read the signals in time windows (601) of predetermined lengths, and wherein the time window (809) of the auxiliary receiver lies in front of the time window (806) of the main receiver in time, and wherein the method includes the following steps: receiving of the signals (1501) which are transmitted over a channel (702); downspreading of the received signals (1502) to symbol sequences (803) by means of sequences corresponding to the spreading sequences (111); delaying of a predetermined number of symbols (401) from each symbol sequence (803) in a first delay step (1504, 706); generation of the value of cross correlations (1505, H) between the spreading sequences (111) of the received signals (802); generation of the value of the channel estimate (1506, C) for the received signals (802), which channel estimation (C) is an estimate of the transmission charac¬teristics of the channel (702); provisional estimation (1519) of the symbols in the auxiliary receiver (705) with the help of the values of the cross correlation (h) and channel estimate (C) and previous provisional estimated symbols (up(m)), whereby the auxiliary receiver generates provisionally estimated symbols (up(mf 1)): final estimation (1520) of symbols in the main receiver (707) with the help of the value of the cross correlation (H) and channel estimates (C), the provisionally esiimated symbols (up(m+ 1)) from th. auxiliary receiver (705; and the previous final estimated symbols (u(ml)) from ihe main receiver (101), which generates the final estimated svmbols (u(m)K 2. Method according to Claim 1, in which the provisional estimate (1519) in the auxiliary receiver (705) includes the following steps: generation of first correction terms (1507, z(m+1)), with the help of the previous provisional symbols (up(m)) estimated in the auxiliary receiver (705) and their corresponding values of the cross correlation (H) and channel estimation (C); first subtraction (1508) of the first correction terms (1507) from the number of predetermined symbols (401) from each symbol sequence (803), which generates a first partial signal (x(m+l)) in the provisional estimate (1519); generation (1509) of first corrected symbols (u(m + l) from the number of predetermined signals (401) from each symbol sequence (803) with the help of the values of the cross correlation (H) and channel estimate (C) corresponding to the first partial signal (x(m+ 1); provisional estimating (1510) of the first corrected symbols (u(mtl) from the number of predetermined symbols (401) from each symbol sequence (803) through deciding the value of the respective symbols (401), which generate said provisionally estimated symbols (up(m+l)); delaying of the provisionally estimated symbols (up(mf 1)) in a second delay stage (1511, 901) in order in a following step (1507) to be used for the generation (1507) of the said first correcting terms (z(m+l)). 3. Method according to Claim 1 or 2, in which the final estimation (1520) in the main receiver (707) includes the following steps: generation of second correction terms (1512, z(m)), with the help of the pro¬visionally estimated symbols (up(m+l)) from the auxiliary receiver (705) and the values of the cross correlation (H) and channel estimations (C) belonging to the provisionally estimated symbols (up(m + l)); generation of third correction terms (1513, wt.mj) with the help of the previous finally estimated svmbols (u(ml)1) from the main receiver (707) and the values of the cross correlation (H) and channel estimates (C) belonging to the previous finally estimated symbols (u(ml)); the second subtraction (1514) of the second and third correction terms (1512, z(m), 1513, w(m))from the number of predetermined symbols (401) from each symbol sequence (803), which are delayed in said first delay stage (1504), whereby a second partial signal (x(m)) in the final estimation is generated; generation (1515) of second correction symbols (u(m)) from the number of predetermined symbols (401) from each symbol sequence (803) with the help of the values of the cross correlation (H) and channel estimate (C) corresponding to the second partial signal (x(m)); final estimation (1516) of the second corrected symbol (u(m)) from the number of predetermined symbols (401) from each symbol sequence (803) through deciding the value of respective symbols, which generate said final estimated symbols delaying the final estimated symbols (u(m)) in a third delaying stage (1517, 902) in order in a subsequent step (1513) to be used for the generation of said third corrections terms (w(m)). 4. Method according to Claims 1, 2 or 3, which also includes the following steps: generation (1503) of symbol vectors (805) with the number of predetermined symbols from each symbol sequence (803), which form a symbol vector (805). 5. Method according to Claims 1 , 2, 3 or 4, in which the number of predetermined symbols from each symbol sequence (803) numbers one symbol (401). 6. Method according to Claim 1. in which the number of predetermined symbols i,401 ) from each symbol sequence (803) numbers four symbols (4ts"). whereby the main receiver (707) performs the final estimation (1520) on four symbols (4ts, 1303) in the main receiver (707) and the auxiliary receiver (705) performs the rovisional estimation (1519) on a first symbol (1301) of the four next arriving symbols (1302). V v7. A device for finally estimating symbols in a radio system with band spreading, whereby the transmitted radio signals from at least one user are upspread with spreading sequences and the signals transmitted on a common frequency band, which device includes: a receiving device (703) with correlators (800) and spreading sequence generators (801) for the downspreading of the signals with the help of a spreading sequence (100,111) corresponding to the upspreading, wherein the receiver device (703) is arranged to generate a predetermined number of downspread symbol sequences (803) from each user (701a, 701b, 701c); a delaying module (706) connected to the receiver device (703), where the module is arranged to delay a predetermined number of symbols (401) from each symbol sequence (803) for a predetermined time period (ts); a main receiver (707) connected to the delay module (706) and arranged to detect the predetermined number of symbols (401) in a second window (806) with a predetermined length (601, 604); an auxiliary receiver (705) connected to the receiver device (703) and arranged to detect the predetermined number of symbols (401) in at least one first window (809) having a predetermined length (601, 604), which first window precedes the second window (806); a cross correlation generator (709) connected to the receiver device (703) and arranged to generate the cross correlation matrices (H) corresponding to the downspread symbol sequences. (803), wherein the cross correlation matrices (H) include on the one hand the spreading sequences (100, 111), on the other hand the time delay (t) which occur between the respective signals of the users. a channel estimaiing generator (708) arranged to generate channel estimation matrices (C> for the channel (702): whereby the auxiliary receiver (705) is connected to the cross correlation generator (709) and the channel estimation generator (708) and is arranged to detect the predetermined number of symbols (40 H in at least the first window (809) and the auxiliary receiver (705) also is arranged to generate the provisional estimate (810, up(m+1)) of the predetermined number of symbols (401) which lie before the second window (806) with the help of the cross correlation matrices (H), channel estimation matrices (C) and the provisional estimate (up(m)) previously generated in the auxiliary receiver (705), of the predetermined number of symbols (401); and whereby the main receiver (707) is connected to the cross correlation generator (709), channel estimarion generator (708) and auxiliary7 receiver (705) and is arranged to generate the final estimate (u(m), 807) of the predetermined number of symbols (401) with the help of the cross correlation matrices (H), channel estimation matrices (C), final estimate (u(ml)) previously generated in the main receiver (707), and the provisional estimate (up(m +1, 810) generated in the auxiliary receiver (705). 8. Device according to Claim 7, in which the channel estimation generator (708) is connected (715) to the receiver device (703). 9. Device according to Claim 7 or 8, in which the respective receiver (705, 707) also includes a device (808, 811) with a window algorithm with a time window (604) displaceable in time in order to detect the predetermined number of symbols (401) from each symbol sequence (803). 10. Device according to Claim 7, 8 or 9, in which a component generator (710) is connected to the main receiver (707), wherein the component generator (710) is arranged to generate single sequences of symbols (815) for each user (701a701c) of the final estimate (u(.ni)) of the predetermined number of symbols (401) from each svmbol sequence (803) from the main receiver (707). 11. Device according to Claim 7, 8, 9 or 10, in which the predetermined length (604) of both the second window (806) in the main receiver (707) and the first window (809) in the auxiliary receiver (705) are as equally long as a symbol time (ts), where the predetermined number of symbols (401) from each symbol sequence (803) are equal to a symbol, wherein the delaying module (706) is arranged to delay the incoming predetermined number of symbols (401) from each symbol sequence (803) by a symbol time (ts). 12. Device according to Claim 7, 8, 9 or 10, in which the predetermined length for the second window (806) in the main receiver (707) is as equally long as a previously determined number of symbol times (4ts, 1303), wherein the predeter¬ mined number of symbols (401) from each symbol sequence (803) are as equally many as the predetermined number of symbols (4ts, 1303), and the auxiliary receiver (705) is arranged to detect a first symbol (1301) from the next arriving (1302) predetermined number of symbols (401) from each symbol sequence (803) in the first window (809), and wherein the delaying module (706) is arranged to delay the incoming predetermined number of symbols (401) from each symbol sequence (803) said predetermined number of symbol times (4ts). 13. Device according to Claim 7, 8, 9, 10, 11 or 12, in which the device includes a direct receiver (1100) per user (701a), wherein the receiver device (703) includes at least one direct receiver part (1115) which is arranged to generate at least two symbol sequences (qb q2) from at least one user (70la) signal (1001), where said signal (1001) includes at least two beams (1003, 1004) with a mutual time displacement (tl), and wherein the auxiliary receiver (705) includes an adder (.1108, 1202) per user, which is arranged to generate a first resulting predetermined number of symbols (401) from each symbol sequence (803) (u,(m+ 1)) with the help of which the auxiliary receiver (705) generates the rovisional estimates (up(m +1)) of the predetermined number of symbols (401), and wherein the main receiver (707) includes an adder (1108, 1203) per user which are arranged to generate a second resulting predetermined number of symbols (401) from each symbol sequence (803) (ur(m)) with the help of which the main receiver (707) generates the final estimates (u(m)) of the predetermined number of symbols from each symbol sequence (803). 14. Device according to 7, 8, 9, 10, 11, 12 or 12, wherein the auxiliary receiver (705) includes a first auxiliary unit (1401) and a thereto connected second auxiliary unit (1402), delaying module (706) includes a first delaying unit (1403) and a thereto connected second delaying unit (1404), where each delaying unit has the delay of one symbol time (ts), wherein the first delaying unit (1403) also is connected to the second auxiliary unit (1402), the first auxiliary unit (1401) is arranged to generate the first provisional estimate (upl(mf2)) of the predetermined number of symbols (401), corresponding to the said provisional estimate (up(m+1)) with the help of the incoming predetermined number of symbols (401) from each symbol sequence (y(m + 2), the cross correlation matrices (H), the channel estimation matrices (C) and the previously generated in the first auxiliary unit (1401) provisional estimates (upl(m + l), 810) of the predetermined number of symbols (401), the second auxiliary unit (1402) is arranged to generate the second provisional estimate (up2(mf 1)) of the predetermined number of symbols (401) with the help of the first provisional estimates (up](m + 2)), the in the first delaying unit (1403) delayed predetermined number of symbols (401) from each symbol sequence (y(m+ ])), the cross correlation matrices (H), the channel estimation matrices (C) and the previously, in the second auxiliary unit (1401) generated provisional estimate (up2(m)) of the predetermined number of symbols, whereby the main receiver (707) is arranged to generate said final estimates (u(m) with the help of the second provisional estimate (up2(mr 1)) from the second auxiliary unit (1402). the in the first delavinc unit (1403) and in the second delavinc unit (1404* delayed symbols (401) from each symbol sequence (y(m)), cross correlation matrices (H), channel estimation matrices (C) and final estimate (u(ml)) of the predetermined number of symbols (401) previously estimated in the main receiver (707). 15. Device according to Claim 7, 8, 9, 10, 11, 12, 13 or 14, wherein the device also includes a vector generator (704), which with by one input is connected to the receiver device (703) and with one output is connected to the delaying module (706) and auxiliary receiver (705), wherein the vector generator (704) is arranged to generate symbol vectors (805) at predetermined points of tune (to) with a predetermined number of symbols (401) from the symbol sequences (803) where the number of predetermined symbols from each symbol sequence form a symbol vector (805). 16. Device according to Claim 15, wherein the vector generator (704) is arranged to generate symbol vectors (805) which include a time portion (601) of the downspread symbol sequences (803) corresponding to the length of the second window (806). 17. Device according to Claim 15, wherein the vector generator (704) is arranged to generate symbol vectors (805) which include a symbol (401) from each and all of the downspread symbol sequences (803). 38. Device according to Claim 7, 8, 9, 10, 11, 12. 13, 14, 15. 16 or 17, in which the main receiver (707) and auxiliary receiver (705) are linear receivers. 10. Device according to Claim 7. 8, 9, 10. 11. 12, 13. 14, 15, 16 or 17, in which the main receiver (708) and auxiliary receiver (705) are a linear decorrelated receiver. 20. Device according to Claim 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 or 17, in which the main receiver (707) and auxiliary receiver (705) are receivers which use the minimum squared method during receiving. 21. Device according to Claim 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 or 17, in which the main receiver (707) and auxiliary receiver (705) are linear receivers which use the minimal squared method during receiving. 22. Device according to Claim 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 or 17, in which the main receiver (707) and auxiliary receiver (705) are receivers which use the maximum likelihood method during receiving. 23. A device for finally estimating symbols in a radio system substantially as hereinbefore described with reference to the accompanying drawings. Dated this 

2123del1997correspondenceothers.pdf
2123del1997correspondencepo.pdf
2123del1997description (complete).pdf
2123del1997petition137.pdf
2123del1997petition138.pdf
Patent Number  232183  

Indian Patent Application Number  2123/DEL/1997  
PG Journal Number  13/2009  
Publication Date  27Mar2009  
Grant Date  15Mar2009  
Date of Filing  30Jul1997  
Name of Patentee  TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)  
Applicant Address  S164 83 STOCKHOLM, SWEDEN.  
Inventors:


PCT International Classification Number  G06F7/00  
PCT International Application Number  N/A  
PCT International Filing date  
PCT Conventions:
