Device and method for generation and distribution of coded symbols in the communication system, multiple access, code-distribution channels

 

(57) Abstract:

The invention relates to data transmission for communication systems, multiple access, code-division multiplexing (mdcr), in particular to a device and method of manufacture and distribution of characters, preventing deterioration of characteristics of the channel during transmission of data. The technical result is the extension of functionality, reducing the impact of symbols distorted during transmission in the communication system mdcr with many carriers. Convolutional encoder encodes data to be transmitted with a bit rate of R=1/6 and it can be used as a channel coder. This channel encoder can be used in the communication system mdcr direct modulation sequence, and the communication system mdcr with many carriers. If the channel encoder is used in the communication system mdcr with many bearing the symbols generated by the many component encoders to the channel encoder are assigned to channels with multiple bearing in accordance with a predefined rule and component encoders to the channel encoder can minimize the deterioration in the General channel encoder even if the output SIG">

The technical field

The invention relates to a device and data transmission method for a communication system, multiple access, code-division multiplexing (mdcr), and more specifically to a device and method of manufacture and distribution of characters, preventing deterioration of characteristics of the channel during transmission of data.

Prior art

In present communication systems (mdcr) implemented based on the standard IS-95. However, with the development of communication technology dramatically increases the number of subscribers to the communications services. Therefore, it is suggested many ways that allow you to meet the growing needs of customers in a high quality of service. One of such methods is a method of improving the structure of a straight line.

In the case of an improved structure of a direct line of communication there is a main channel for direct communication line, intended for system mdcr with many supporting the third generation, which was proposed at the conference EIA/TIA TR45.5. The structure of a direct line of communication for the communication system mdcr with many bearing shown in Fig.1.

As shown in Fig.1, the channel encoder 10 encodes the input analnogo encoder 10. In this case, the data that are entered in the channel encoder 10, have a variable bit rate. Block 20 speed negotiation repeats and puncture the encoded data bits (i.e., characters), which receives output from the channel encoder 10 to match the speed of the character encoding for data that has a variable velocity encoding bits. Channel interleaver 30 performs interleaving the output of the device 20 speed negotiation. As the interleaver 30 is typically used block interleaver.

Generator 91 long codes generates a long code that is identical to the long code used by the subscriber. Long code is a unique identification code of the subscriber. Thus, different long codes are assigned to the respective subscribers. Thinner 92 thins long code to match the baud rate of the long code with the speed at which characters are transmitted out of the interleaver 30. The adder 93 adds the output signal of the channel interleaver 30 and the output signal of thinner 92. As the adder 93 is commonly used logical element "exclusive OR".

The demultiplexer 40 successively demotivate 51-53 two-level signal in the four-level signal to convert the signal levels of the binary data, coming from the output of the demultiplexer 40, by converting the input data "0" to "+1" and the input data "1" to "-1". From the first to the third orthogonal modulators 61-63 encode the data coming from the outputs from the first to the third inverters 51-53 levels, using the corresponding Walsh codes. In this case, the Walsh codes have a length of 256 bits. From the first to the third dilator 71-73 broaden the spectrum on the spectrum of the output signals of the orthogonal modulators 61-63, respectively. In this case, as extenders spectrum 71-73, you can use the extenders on the basis of the quadrature phase manipulation. From first to third attenuators (or regulators gain) 81-83 regulate the gain of signals with spread spectrum, which come from the output of the spreader 71-73, according to the respective signals of weakening GA-GC. In this case, the signals provided from the outputs of the attenuators 81-83, have different carriers a, b and C.

In the structure of a straight line (Fig.1) channel encoder 10 having a speed coding R=1/3, encodes the input data into 3-bit encoded data (i.e., code words or symbols) on a bit. Such bits of encoded data demultiplexers three not the Ohm load-bearing (Fig.1) can be modified in a communication system mdcr with one carrier by removing the demultiplexer 40 and use only set consisting of the level Converter, the orthogonal modulator, the range extender and attenuator.

In Fig. 2 shows a detailed diagram illustrating the channel encoder 10, block 20 speed negotiation and channel interleaver 30. In Fig.2 data from the first speed consist of 172 bits (full speed) on a frame duration of 20 MS, the data from the second speed to consist of 80 bits (1/2 speed) on a frame duration of 20 MS, the data from the third speed consists of 40 bits (1/4 speed) on a frame duration of 20 MS and the data from the fourth speed consist of 16 bits (1/8 speed) on a frame duration of 20 MS.

As shown in Fig.2, first to fourth generators 111-114 cyclic redundancy code (CEC) produce the bits of the CEC, the corresponding input data, which have different speed and summarize the generated bits of the CEC with the input data. In particular, 12-bit, CEC summarize with 172-bit data from the first speed, 8-bit CEC summarize with 80-bit data with the second speed, the 6-bit CEC summarize with 40-bit data with the third speed, and 6-bit CEC summarize with 16-bit data from the fourth speed.

First to fourth generators 121-124 end bits dobavlyautsya bits produces a 192-bit, the second generator 122 of end bits produces 96 bits, the third generator 123 end bits gives 54 bits, and the fourth generator 124 of end bits gives 30 bits.

First to fourth encoders 11-14 encode the data coming from the output of the generators 121-124 end bits, respectively. In this case, as encoders 11-14 can be used convolutional encoder having a code length limit K=9 and rate coding R=1/3. In this case, the first encoder 11 encodes a 192-bit data, which are received from the output of the first generator 121 end bits, 576 characters at full speed, the second encoder 12 encodes a 96-bit data, which are received from the output of the second generator 122 of end bits, 288 symbols with rate 1/2, the third encoder 13 encodes a 54-bit data, which are received from the output of the third generator 123 end bits, 162 character with a speed of approximately 1/4 and the fourth encoder 14 encodes the 30-bit data, coming from the output of the fourth generator 124 of end bits, 90 characters with a speed of approximately 1/8.

Block 20 speed negotiation data includes repeaters 22-24 and devices 27-28 delete characters. Repeaters 22-24 recurring characters that wynonie the symbol rate up to full speed. Devices 27 and 28 delete characters delete characters that come from the outputs of the repeaters 23 and 24 and which exceed a certain number of characters at full speed. Because the second encoder 12 generates 288 characters, which is 1/2 of 576 symbols, which are issued from the first encoder 11, the second repeater 22 repeats twice adopted 288 characters in order to give 576 characters. In addition, since the third encoder 13 generates 162 symbol, which is approximately 1/4 of 576 symbols that come from the output of the first encoder 11, the third repeater 23 repeats adopted 162 character four times in order to give 648 characters that exceed the number 576 characters with full speed. To negotiate transmission speed character with full speed, device 27 delete characters removes every ninth symbol to display 576 characters with full speed. In addition, since the fourth encoder 14 generates 90 characters, which is approximately 1/8 from 576 characters that come from the output of the first encoder 11, the fourth repeater 24 repeats adopted 90 characters eight times for the issuance of 720 characters that exceed the number 576 characters with full speed. To coordinate the symbol rate with the full near.

First to fourth channel premarital 31-34 perform interleaving symbols with full speed from the output of the first encoder 11, the second repeater 22, device 27 delete characters and devices 28 delete characters, respectively.

Forward error correction (VEC) is used to maintain a sufficiently low frequency of occurrence of erroneous bits (CPOB) mobile station for a channel having a low signal-to-noise ratio (SNR), by providing gains of channel coding. When using the overlay method is a direct link for communication systems with multiple carrier allows you to share the same frequency band with a direct line to an existing system standard IS-95. However, this mapping method causes some problems.

In the overlay method three bearing a direct line of communication for a system with plenty of supporting superimposed on the three bandwidth of 1.25 MHz, which are used in the existing system mdcr standard IS-95. In Fig.3 shows the transmit power levels (for the respective frequency bands) base stations for the system standard IS-95 system with multiple carriers. In the overlay method, since the bandwidth of the system with many bearing awn channel shared base station standard IS-95 base station and with a lot of bearing in the same frequency band. In the case where the transmit power is shared in the two systems, the transmit power is first assigned channel of the standard IS-95, which basically supports the transmission of speech signals, and then determines the maximum transmit power allowed for the respective bearing system mdcr with many carriers. In this case, the maximum transmission power does not exceed a predetermined level, since the base station has a limited transmit power. In addition, if the base station transmits data to a large number of subscribers, the mutual interference between subscribers increase, resulting in increase of noise level. In Fig. 3 shows a state in which the base station standard IS-95 base stations with many bearing allocate almost equal to the transmission power in the corresponding frequency bands with a width of 1.25 MHz.

However, the channels of the standard IS-95 frequency bands with a width of 1.25 MHz have different transmit power in accordance with the change in the number of subscribers served and the change in voice activity subscribers. Fig.4 and 5 illustrate situations in which the transmit power allocated to the base station with many nussimista increases in the respective frequency bands due to the increase in the number of subscribers of the system standard IS-95. In the result, it is impossible to allocate sufficient transmit power to one or more of a number of carrier power of the basic data transfer, which is different. Accordingly, for a signal received on a carrier with low SNR, increasing the bit error rate (CPAB). That is, when the number of subscribers of the system standard IS-95 is increased, and the speech activity is relatively high in the signal transmitted on one of a number of carrier superimposed on the corresponding frequency band increases CPOB, which reduces system throughput and increase mutual interference between subscribers of the system standard IS-95. That is, the mapping method may cause a decrease in system throughput with lots of supporting and increasing mutual interference between subscribers of the system standard IS-95.

In a system with many bearing the corresponding bearing can have an independent power transmission, as shown in Fig.4 and 5. In Fig.4 presents the distribution of power, which is similar to the case when using a channel encoder with R= 1/2, and Fig.5 power distribution, the worst in comparison with the case where the channel encoder is not used. In these cases, one or may not be transmitted, reducing the efficiency of the system.

Moreover, even in the communication system mdcr direct expansion of the spectrum, which uses a single carrier, the weight distribution of the symbols generated by channel coding is poor, which may cause deterioration of characteristics of the decoding channel.

The invention

Therefore, the present invention is to create a device and method of channel coding for the generation of encoded data, which has good characteristics of channel coding in a communication system mdcr.

Another object of the present invention is to provide device and method of channel coding for the generation of the channel encoded data with good performance of channel coding and efficient distribution of generated impeller coded data at the respective bearing in the communication system mdcr with many carriers.

Also the present invention is the creation of a channel transmitting device and method of distribution of generated symbols on the bearing so that it was possible to minimize the influence of symbols, selenia is to create a device and method convolutional coding with R=1/6, to improve the characteristics of the channel in channel transmitter for a communication system mdcr.

The achievement of the above results is provided in the communication system using at least two carriers. The communication system includes a channel encoder for encoding the data channel controller to generate the control signal for the channel coded symbols so that you can perform decoding using the data taken at least by one carrier and dispenser of symbols for channel coded symbols by at least two load-bearing.

In addition, the claimed device channel coding, containing a number of delay elements for delaying the input data bits for forming the first to the eighth detainees data bits, the first operator to perform a logical exclusive OR operation on the input bit data and the third, fifth, sixth, seventh and eighth detainees data bits to generate a first symbol, a second operator to perform a logical exclusive OR operation for the input data bit and first, second, third, fifth, sixth and eighth detainees bits of data is one bit of data and the second the third, fifth and eighth detainees data bits to generate a third symbol, the fourth operator to perform a logical exclusive OR operation for the input data bit and the first, fourth, fifth, sixth, seventh and eighth detainees data bits to generate the fourth symbol, the fifth operator to perform a logical exclusive OR operation for the input data bit and the first, fourth, sixth and eighth detainees data bits to generate the fifth symbol and a sixth operator to perform a logical exclusive OR operation for the input data bit and the first, second, fourth, sixth, the seventh and eighth detainees data bits to generate the sixth symbol.

Brief description of drawings

The invention is illustrated with reference to the drawings, which represent the following:

Fig.1 is a diagram illustrating the structure of a direct line of communication to known communication systems mdcr with many bearing;

Fig. 2 is a diagram illustrating the structure of the main channel for direct communication line according to Fig.1 ;

Fig. 3 is a diagram illustrating the distribution of power transmission for frequency bands of channels standard IS-95 and for frequency bands channel systems, the same frequency bands;

Fig. 4 is a diagram illustrating a state in which the transmission power for one of the many bearing decreases when the transmission power for the corresponding channel standard IS-95 increases due to restrictions on transmit power or bandwidth of the system;

Fig. 5 is a diagram illustrating a state in which power transmission for two of the number of carrier decreases when the values of the power transmission for the corresponding channel standard IS-95 increase due to the restrictions on transmission power or bandwidth of the system;

Fig.6 is a circuit for generating convolutional codes with rate coding symbols 1/6, which uses channel encoder and distributor of characters according to a variant implementation of the present invention;

Fig.7 is a detailed diagram of the convolutional encoder with R=1/6 in Fig.6;

Fig.8 is a detailed diagram of the distributor of the symbols in Fig.6;

Fig. 9 - scheme transfer to a straight line using a channel encoder and distributor of symbols according to a variant implementation of the present invention;

Fig.10 - results of mathematical modeling, illustrating the comparison of characteristics for convolutional codes with R=1/3, soya, illustrating the comparison of the worst characteristics among convolutional codes with R=1/2 using generating polynomials of the convolutional encoder with rate coding R=1/3;

Fig. 12 - results of mathematical modeling, illustrating the comparison of characteristics for the limited codes with R=1/2 convolutional code with R=1/6;

Fig. 13 - the mathematical modeling results illustrating the comparison of the worst characteristics for the limited codes with R=1/2 using a convolutional encoder with R=1/6 with the best performance.

Embodiments of the

The preferred implementation of the present invention is described below with reference to the drawings. In the following description, well-known functions or structures are not described in detail so as not to obscure the invention in unnecessary detail.

The term "symbol" as used in the present invention, refers to the encoded bit output data from the output of the encoder. For convenience of explanation it is assumed that the communication system with multiple bearing is a communication system mdcr with three carriers.

In the communication system, supporting system standard IS-95, tie bandwidth, the coded symbols are distributed so as to minimize the deterioration of the characteristics decoding distorted characters, and then distributed the coded bits are assigned to the appropriate bearing. Thus, even if one bearing is interference during the reception, you can only decoding for coded bits, which are transmitted through the other bearing, thereby improving characteristics of the system.

In addition, in a straight line convolutional code with R=1/6 can be used for the channel encoder. Therefore, if the channel encoder produces convolutional codes with R= 1/6, it is very difficult to find convolutional codes with R=1/6, having good characteristics decoding. Accordingly, the present invention aims at providing a convolutional code with R=1/6 and good characteristics decoding and distribution of generated convolutional codes on many carriers. Convolutional codes with R=1/6, which are produced according to the present invention, have good characteristics as in the communication system mdcr with many carrier, and the communication system mdcr direct modulation sequence (mdcr-RAP).

Below is a description of the operation vyrabotki is according to a variant implementation of the present invention. For convenience, the present invention is described with reference to the communication system mdcr with many carriers.

First will be considered convolutional codes with R=1/6 for communication systems mdcr with many bearing that uses three carriers. Fig.6 illustrates a convolutional encoder and distributor of symbols according to a variant implementation of the present invention.

As shown in Fig.6, the convolutional encoder 601 encodes input data bits in six characters, which are divided into three bearing a, b and C. In the distribution of characters allocator 602 characters in the same way distributes six input bits by two bits to three carriers. Allocator 602 characters distributes the symbols that come from the output of the convolutional encoder 601 considering how much bearing of these three have a bearing distortion. Using this method the distribution of the characters, even if one or two of the three bearing distorted, it is possible to minimize the deterioration of the characteristics of the decoding channel.

Below is a description of the method of construction of the distributor 602 characters. The bit error rate (CPOB) after decoding of the channel depends on the deformed part of the symbols encoded with distorted social characteristics evenly distributed on the bearing. Accordingly, even if the symbols for a particular channel is completely distorted, it is possible to minimize the increase CPOB after decoding the channel.

In addition, in the transmission of characters issued from the output component of the encoder, the channel encoder are distributed on the bearing, while in the process of decoding component decoder in the channel decoder is chosen so that CPAB would be low, even if the symbols for a particular carrier is completely distorted.

The selection of component decoder in the channel decoder is performed in the following procedure. First consider the convolutional code having a code length limit K=9 and rate coding R=1/3. In the following description of the generating polynomials giexpressed as an octal number. Convolutional code with parameters K=9 and R=1/3 has a free distance of dfree=18. It should be noted that there 5685 sets when you search for convolutional codes with parameters K= 9, R=1/3 and dfree=18, by changing the generating polynomial g1, g2and g3. In this case, choose only decatastrophizing codes. In addition, when used in a system with multiple carrier there. From this point of view, it is preferable to maximize the free distance.

For the reference code for comparing the characteristics of the used convolutional code (g1, g2, g3)=(557, 663, 711), which is used in the existing system standard IS-95. In the system standard IS-95 free distance of the convolutional code dfree=18, and the free distance between the constituent codes are dfree= (g557, g663)= 9 dfree=(g557, g711)=11 and dfree=(g663, g711)=10. The characteristics of the convolutional code can be predicted using the formula for the upper limit CPOB, which is determined by the transfer function.

For the system standard IS-95 transfer function of the convolutional code is

T(D,I)|I=1= 5D18+7D20+O(D21)

but the formula for the upper limit CPOB -

(/I)T(D,I|I=1= 11D18+32D20+O(D21).

If the convolutional code system standard IS-95 be considered in light of the component code, the spread of catastrophic errors in the combination of a generating polynomial g1and g2. Therefore, when convolutional codes system standard IS-95 is used for si is since convolutional codes standard IS-95 peculiar distribution of catastrophic errors in the light of the mentioned component codes, you must search new convolutional codes, suitable for systems with many carriers. For K= 9 dfree(gi, gj)12. When you perform a full analysis on the ECM detected that the convolutional code with free distance between the component codes is always equal to 12, does not exist. Therefore, there are only eight codes that have free distance dfree(gi, gj)11. In this case, not only codes, but also the component codes are neocatastrophism. Since the first term of the formula for the upper limit CPAB is the most important, the first and eighth codes can be considered as the most optimal codes. In this case, since the pair of the first and eighth codes, the second codes and seventh, third, and fourth codes, fifth, and sixth codes are in inverse relationship, they are essentially the same codes. Therefore, there are only four of the code.

Table 1 provides an explanation of the characteristics of the convolutional encoder with parameters K=9 and R=1/3 (see the end of the description).

In table 1, d12in the first member means d467,543) and then used in the same meaning. For information, when comparing codes to perform superior to the codes of the standard IS-95, third, fourth, fifth and sixth codes in their characteristics such codes standard IS-95, and the second and seventh codes slower than the codes of the standard IS-95. Therefore, it is preferable to use the eighth (or first) code.

Meanwhile, there are four or more codes available distances among which the component codes is equal to 12, 12 and 10, with among these codes, the generating polynomial for the best code with respect to the first member formula for the upper limit CPAB is a (g1, g2, g3)=(515, 567, 677). In Fig. 10 shows the simulation result for the characteristics of the convolutional code with R=1/3 in terms of additive white Gaussian noise (abgs) in the case when a system with multiple carriers (with three carriers) has optimal characteristics without distortion of the respective bearing. As described below, the simulation (Fig.11-13) is completely performed in abgs. <Case 1> is a convolutional code with R=1/3 for the existing system standard IS-95, and <Case 2> and <Case 3> is a convolutional code with R=1/3, which was found in the above way.

<Case 1> IS-95 (g1=557, g2=663, g3=711)-->dfree=18.

<Case, free(g1,g3)= 11, dfree(g2,g3)=12.

<Case 3> g1=515, g2=567, g3=677-->dfree=18.

dfree(g1,g2)=11, dfree(g1,g3)=12, dfree(g2,g3)=10.

The following describes the case of applying a convolutional code with R=1/3 in the system with three carriers, one of the three bearing corrupted (or lost). Although the initial encoding speed equal to 1/3, the loss of one carrier lead to the coding rate of 1/2. Therefore in Fig.11 shows the simulation results for convolutional codes 1/2 using generating polynomials for convolutional codes 1/3. In Fig.11 appropriate conditions can be explained on the example of <Case 1> -- <Case 4>. Fig.11 shows the worst performance for convolutional codes with R=1/2 when using generating polynomials for convolutional code with R=1/3.

<Case 1> - optimal convolutional code with value 1/2-->g1=561, g2= 753, dfree(g1,g2)=12

<Case 2> the worst feature, g1=557, g2=711 of the three convolutional codes with R= 1/2, using the generating polynomial (557, 663, 711) for svetocheloveka error

<Case 3> the worst feature, g1=731, g2=615 (dfree(g1, g2)= 11) For the convolutional code with R=1/2, using a generating polynomial (731, 615, 537) for the convolutional code with R=1/3

<Case 4> the worst feature, g1= 567, g2=677 (dfree(g1/g2)= 10) for the convolutional code with R=1/2, using a generating polynomial (515, 567, 677) for the convolutional code with R=1/3.

If one bearing is distorted in a system with three carriers using a convolutional code with R=1/3, the encoding speed is equal to R=1/2. In this case, the allocation of symbols for the distributor characters are using the appropriate distribution of the original convolutional code with R= 1/3 on three bearing using matrices removal of the following characters to minimize performance degradation even if the encoding speed becomes equal to R=1/2.

The simplest way to form the matrix of the removal of the following two characters. In the matrix, remove the following characters "0" refers to the case where a carrier, which provides an appropriate symbol, distorted, and "1" refers to the case where a carrier, which provides an appropriate symbol, not a carrier, which is distorted during transmission. So choose one of the following different configurations of the matrix delete characters, which minimizes the deterioration of the characteristics even if distorted one carrier and dispenser 602 characters provides the symbols of the respective bearing using the selected configuration. Matrix delete characters to find the configuration used for the distributor 602 characters are the following:

< / BR>
< / BR>
In addition, the m-sequence of length equal to 8, is produced during the two stages of GF(3) using m-sequences. For the ninth convolutional code produces the sequence { 1,2,0,2,2,1,0,1,2} and then is a matrix of D3remove the following characters using this sequence

< / BR>
In addition, the matrix D4and D5remove the following characters are formed by changing the row of the matrix D3delete characters

< / BR>
< / BR>
In addition, the sequence {2,1,0,1,1,0,1,2,1,0,0,0,2,1,2} is obtained by generate 15 random numbers over GF(3) using random numbers and the matrix D6remove the following symbols are created using the above the ay modifying rows, as in the method using m-sequence.

< / BR>
< / BR>
Below is a description of a convolutional code, which has a speed of encoding symbols is equal to 1/6. Convolutional code with parameters K=9 and R=1/6 has a free distance of dfree=37. In the process of searching for a convolutional code with free distance dfree=37 by random changes of the generating polynomials g1, g2..., g6must meet the following conditions.

First, it must be a convolutional code with R=1/6 with good characteristics decoding.

Secondly, it must be a convolutional code with R=1/4 good characteristic of the decoding, which has a generating polynomial (g1, g2, g3, g4), (g1, g2, g5, g6) and (g3, g4, g5, g6), taking into account the case when one of the three bearing is distorted in a system with three carriers.

Thirdly, it must be a convolutional code with R=1/2 with a good description of the decoding, which has a generating polynomial (g1, g2), (g3, g4) and (g5, g6), taking into account the case when two of the three distorted in a system with three carriers.

In the second and third conditions is missing one or two of the three bearing, providing a system with lots of bearing, in which six output bits of the convolutional code distinguish three carries two bits. From this point of view, it is preferable that a convolutional code with R=1/4 and a convolutional code with R=1/2 have the maximum free distance.

The way search convolutional code with R=1/2, satisfying the third condition, it is clear from the following description. There are 35 decatastrophizing convolutional codes with parameters R=1/2, K=9 and dfree=12. The formula for the upper limit for CPOB below, and the coefficient C12the most important member of the D12when determining CPAB is in the range from 33 to 123.

(/I)T(D,I)|I=1C12D12+C13D13+...

First, for a convolutional code with R=1/6 there are 180 convolutional codes with parameters R= 1/6 and dfree= 37, satisfies the third condition. It is assumed thatfree(g2i-1, g2i)=12. In this case, there are 58 convolutional codes in which the first term of the formula for the upper limit CPOB convolutional code with R=1/6 has a coefficient of C37=1. Listed below are convolutional codes with R=1/6, selected among 58 convolutional codes after verification features:

1) (457, 755, 551, 637, 523, 727): C3817): C38= 6(NO=7);

5) (515, 677, 453, 755, 551, 717): C38= 6(NO=9);

6) (515, 677, 557, 651, 455, 747): C38= 6(N=11);

7) (457, 755, 465, 753, 551, 637): C38= 6(NO=13);

8) (515, 677, 551, 717, 531, 657): C38= 8(NO=27);

9) (515, 677, 455, 747, 531, 657): C38= 8(NO=29);

10) (453, 755, 557, 751, 455, 747): C38= 10(NO=31);

11) (545, 773, 557, 651, 551, 717): C38= 12(NO=51);

12) (453, 755, 457, 755, 455, 747): C38= 20(NO=57).

Listed below are 5 convolutional code with R=1/6 and good feature of decoding, selected among the 12 convolutional codes with R=1/6 and verification features:

1) (457, 755, 551, 637, 523, 727): C38= 4(NO=1);

2) (515, 677, 453, 755, 551, 717): C38= 6(NO=7);

3) (545, 773, 557, 651, 455, 747): C38= 6(NO=8);

4) (515, 677, 557, 651, 455, 747): C38= 6(N=11);

5) (515, 677, 455, 747, 531, 657): C38= 8(NO=29).

Characteristics of convolutional codes with R=1/2, using five of the generating polynomials for convolutional code with R=1/6, verificada, and, in addition, verificada characteristics of convolutional codes with R=1/4, using five of the generating polynomials for convolutional code with R=1/6. It describes the transfer function for convolutional codes with R=1/2 with reference to table 2, in which the generating polynomials represented by octal number.

Convolutional code with R=1/2 and the good features the table 2. Furthermore, the characteristics of convolutional codes with R= 1/2 compared with the characteristics of the optimal convolutional codes with R=1/2, which are used for system standard IS-95.

<Case 1> generating polynomial --> (435, 657)8, NO=1, C12=33.

<Case 2> generating polynomial --> (561, 753)8, NO=2, C12=33, optimal convolutional code with R=1/2, which is used for the standard IS-95.

<Case 3> generating polynomial --> (557, 751)8, NO=7, C12=40.

<Case 4> generating polynomial --> (453, 755)8NO=9, C12=40.

<Case 5> generating polynomial --> (471, 6 7 3)8NO=11, C12=50.

<Case 6> generating polynomial --> (531, 657}8NO=17, C12=52.

<Case 7> generating polynomial --> (561, 755)8NO=22, C12=57.

<Case 8> generating polynomial --> (465, 771)8NO=24, C12=58.

Comparison of characteristics for the respective cases shown in Fig.12. Fig. 12 depicts a comparison of characteristics among the component codes with R=1/2 convolutional code with R=1/6. It should be noted that the component codes with R= 1/2 convolutional code with R=1/6 similar characteristics, optimal convolutional codes with R=1/2.

and component codes with R=1/2, using five convolutional codes with R=1/6, and with good characteristics decoding below with reference to table 3.

<Case 1> the worst feature of the convolutional code with R=1/6 (NO=l), with generating polynomials(457, 755, 551, 637, 523, 727)8, --> (523, 727)8C12=68.

<Case 2> the worst feature of the convolutional code with R=1/6 (NO=7), with generating polynomials(515, 677, 453, 755, 551, 717)8, --> (515, 677)8C12=38.

<Case 3> the worst feature of the convolutional code with R=1/6 (NO=8), with generating polynomials(545, 773, 557, 651, 455, 747)8, --> (545, 773)8C12=38.

<Case 4> the worst feature of the convolutional code with R=1/6 (N=11), with generating polynomials(551, 677, 557, 651, 455, 747)8, --> (551, 677)8C12=38.

<Case 5> the worst feature of the convolutional code with R=1/6 (NO=29), with generating polynomials(515, 677, 455, 747, 531, 657)8, --> (515, 677)8C12=38.

Worst characteristics for component codes with R=1/4 is shown below using convolutional codes with R=1/6, whose characteristics verificada for component codes with R=1/2.

<Case 1> the worst feature of the convolutional code with <Case 2> the worst feature of the convolutional code with R=1/6 (NO=7), with generating polynomials(515, 677, 453, 755, 551, 717)8--> (515, 677, 551, 717)8C24=2.

<Case 3> the worst feature of the convolutional code with R=1/6 (NO=8), with generating polynomials(545, 773, 557, 651, 455, 747)8--> (545, 773, 455, 747)8C24=2.

<Case 4> the worst feature of the convolutional code with R=1/6 (N=11), with generating polynomials(551, 677, 557, 651, 455, 747)8--> (551, 677, 557, 651)8C24=4.

<Case 5> the worst feature of the convolutional code with R=1/6 (NO=29), with generating polynomials(515, 677, 455, 747, 531, 657)8--> (515, 677, 531, 657)8C24=6.

Fig. 13 depicts a comparison among the worst characteristics of the component codes with R=1/2, using a convolutional code with R=1/6 with the best feature.

Below are two convolutional code with R=1/6 with good decoding characteristic, selected from among a convolutional code with R=1/6, the characteristics of which will verify for various instances of the aforementioned ways.

1) (515, 677, 453, 755, 551, 717)8: C38=6 (NO=7);

2) (545, 773, 557, 651, 455, 747)8: C38=6 (NO=8).

In addition, for finding configuration remove IC is I situation, when distorted one carrier, i.e. where convolutional codes with R=1/6 replaced with convolutional codes with R=1/4. The reason for the search configuration matrix delete characters is the same as described for convolutional codes with R=1/3. The following matrix can be used as a configuration matrix delete characters for the allocation of symbols for convolutional codes with R=1/6:

< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
Considering the case when the distorted two-bearing system with three carriers, you can use the configuration matrix removal of the following characters in the allocation of symbols for convolutional codes with the removal of symbols and R= 1/2, using generating polynomials for convolutional codes with R=1/6 with good decoding characteristic:

< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
In Fig. 6 shows a convolutional encoder 601 and allocator 602 symbols according to a variant implementation of the present invention. In the example embodiment, the convolutional encoder 601 is the encoding rate of the R= 1/6 and uses the generating polynomial(545, 773, 557, 651, 455, 747). The detailed structure of the convolutional code with R=1/6 shown in Fig.7.

As display the data. In the process of sequential delay of the input data bits, the logical elements 721--721-F "exclusive OR" generate encoded symbols. Encoded characters (Fig. 7) enter the dispenser 602 characters, which has the structure shown in Fig.8.

As shown in Fig. 8, the dispenser 602 characters implemented on the switches 811 and 811-Century, According to Fig.8, if the symbol rate clock signal to control the switches 811 and 811-more than six times the speed of the characters allocator 602 characters, symbols can be distributed without losing characters. That is, the switch 811 And consistently receives input symbols g1, g2, g3, g4, g5, g6, g1, g2, g3... , and switch 811-In distributes the input symbols to output nodes C1WITH2WITH3C4C5and C6.

In Fig.9 shows a diagram of a transmission that includes a channel encoder 601 and allocator 602 characters (Fig.6).

As shown in Fig.9, first to fourth generators 911-914, add CEC CEC data in a specific number of bits to the input data. In particular, 12-bit, CEC is added to 172-byte data from the first speed, 8-Bito is her speed and 6-bit CEC is added to the 16-bit data from the fourth speed. First to fourth generators 921-924 end bits add 8 end bits in the data added by the CEC. Therefore, the first generator 921 end bits produces 192 bits, the second generator 922 end bits produces 96 bits, the third generator 923 end bits gives 54 bits, and the fourth generator 924 end bits gives 30 bits.

First to fourth encoders 931-934 encode data outputs of generators 921-924 end bits, respectively. In this case, the convolutional encoder with parameters K=9 and R=1/6 can be used for encoders 931-934, the first encoder 931 encodes a 192-bit data, which are received from the output of the first generator 921 end bits, 1152 character with full speed, a second encoder 932 encodes a 96-bit data, which are received from the output of the second generator 922 end bits, 576 symbols with rate 1/2, the third encoder 933 encodes a 54-bit data, which are received from the output of the third generator 923 end bits 324 character with a speed of approximately 1/4, and the fourth encoder 934 encodes the 30-bit data, which are received from the output of the fourth generator 924 end bits, 180 characters with a speed of approximately 1/8.

First to fourth valves 941-944 characters raspredeleniya controller (not shown) generates the control signals for channel coded bits so that in order to minimize the deterioration of the characteristics in the process of decoding the received distorted bits when encoded symbols are transmitted with application to characters of another system in the same frequency band. Distributors 941-944 characters then distribute the characters from the outputs of the encoders 931-934 on the respective bearing according to the control signals.

Each of the matching units 951-953 speed of encoding includes the repeater characters and removal device of the character. Matching blocks 951-953 encoding speed agree on the speed of encoding symbols with the output of the respective distributors 942-944 characters with the speed of encoding symbols from the output of the distributor 941 characters. First to fourth channel premarital 961-964 perform interleaving of the symbols that are allocated from the allocator 941 characters and matching units 951-953 the coding rate, respectively.

For communication systems mdcr-RAP distributors 941-944 characters (Fig.9) can be omitted.

As described above, in a system with multiple carriers using the overlay method, frequency, appropriate carriers have limited transmission power in accordance with nameemah in one or more bands of the carrier frequencies. In order to solve the problem using generating polynomials for the channel encoder and method of distribution of characters, can provide significant gains at the expense of coding compared to the loss of data due to loss of carrier, thereby preventing the deterioration CPOB.

1. Channel transmitting device for communication systems, multiple access, code-division multiplexing (mdcr) using at least two carrier containing a channel coder for channel coding of the transmitted data symbols with predefined bit rate, channel controller to generate a signal distribution of symbols in accordance with a predefined configuration matrix delete characters, the configuration of the matrix delete characters provides uniform distribution of characters from the channel outputs of the encoders on the respective bearing, and distributor of characters to accept characters and distribution of the received symbols by the carrier in accordance with the signal distribution of the symbols.

2. Channel transmitting device under item 1, wherein the channel encoder is a convolutional encoder with bit rate R= 1/6.

4. Channel transmitting device under item 1, characterized in that the dispenser of the character contains the first selector to sequentially multiplexing the received symbols and a second selector for distributing the multiplexed symbols to the carrier in accordance with the signal distribution of the symbols.

5. Channel transmitter for a communication system mdcr with many carrier that uses at least two carrier containing a channel coder for channel coding of the transmitted data symbols with a predefined encoding speed, the distributor of characters to accept characters and distribution of the received symbols by the carrier in accordance with a predefined configuration matrix delete characters, the configuration of the matrix delete characters provides uniform distribution of characters from the channel outputs of the encoders on the corresponding bearing, channel interleaver for channel interleave distributed symbols, a demultiplexer for distributing alternating symbols for sound, a lot of the orthogonal modulator for the generation of orthogonal mo the channels, many extenders spectrum for receiving orthogonal modulated signals and generate signals extended range by multiplying the received orthogonal-modulated signals at the code spread spectrum and multiple transmitters to receive advanced signals and transmit the received signals, extended spectrum, using load-bearing.

6. Channel transmitting device under item 5, wherein the channel encoder is a convolutional encoder with rate coding R= 1/6.

7. Channel transmitting device according to p. 6, wherein the convolutional encoder generates characters by using one of the generating polynomials presented in the following table (see graphic part).

8. Channel transmitting device under item 5, characterized in that the dispenser of the character contains the first selector to sequentially multiplexing the received symbols and a second selector for distributing the multiplexed symbols to the carrier in accordance with the signal distribution of the symbols.

9. Way channel of transmission for the communication system mdcr using at least two carriers, including the stages at which encode canalfront signals distribution of symbols in accordance with a predefined configuration matrix delete characters for uniform distribution of the symbols output from the channel encoder according to the respective bearing and take the characters and choose the received symbols via the signal distribution of the symbols for the appropriate distribution and transmission of symbols on the respective carriers.

10. Way channel of transmission under item 9, wherein the channel encoder is a convolutional encoder with bit rate R= 1/6.

11. Way channel of transmission under item 9, characterized in that the distribution of characters sequentially multiplexer the received symbols and distributes the multiplexed symbols in a bearing in accordance with the signal distribution of the symbols.

12. The device convolutional coding used to encode the input data bits from the encoded bit rate of R= 1/6, and the said device convolutional coding uses from the first to the sixth generating polynomials, containing a number of delay elements for delaying the input data bits to generate the first to the eighth delayed data bits, the first operator to perform a logical exclusive OR operation on the input bit data and the third, fifth, sixth, seventh and eighth detainees data bits to generate a first symbol corresponding to the first generating polynomial, a second operator to perform a logical exclusive OR operation on the input bit data and the first, second, third, fifth, sixth and eighth detainees bits of data for Virab the tion of the exclusive OR operation on the input bit data and the second the third, fifth and eighth detainees data bits to generate a third symbol corresponding to the third generating polynomial, the fourth operator to perform a logical exclusive OR operation on the input bit data and the first, fourth, fifth, sixth, seventh and eighth detainees bits of data to generate the fourth character corresponding fourth generating polynomial, the fifth operator to perform a logical exclusive OR operation on the input bit data and the first, fourth, sixth and eighth detainees bits of data to generate fifth character corresponding to the fifth generating polynomial, and the sixth operator to perform a logical exclusive OR operation on the input bit data and the first, second, fourth, sixth, seventh and eighth detainees data bits to generate the sixth character corresponding to the sixth generating polynomial, and from the first to the sixth generating polynomials are polynomials(457, 755, 551, 637, 625, 727)8.

13. The device channel transmission for the communication system mdcr containing the channel encoder, which represents a convolutional encoder using the first to the sixth generating polynomials(457, 755, 551, 637, 625, 727)

14. The method of channel coding using device convolutional encoding using the first to the sixth generating polynomials encoding input data bits from the encoded bit rate of R= 1/6, and from the first to the sixth generating polynomials correspond(457, 755, 551, 637, 625, 727)8including the stages at which delay the input data bits to generate the first to the eighth delayed data bits, perform a logical exclusive OR operation on the input bit data and the third, fifth, sixth, seventh and eighth detainees data bits to generate the first character of the first generating polynomial, perform a logical exclusive OR operation on the input bit data and the first, second, third, fifth, sixth and eighth detainees bits for verybottom data and the second the third, fifth and eighth detainees data bits to generate a third symbol of the third generating polynomial, perform a logical exclusive OR operation on the input bit data and the first, fourth, fifth, sixth, seventh and eighth detainees bits of data to generate the fourth symbol of the fourth generating polynomial, perform a logical exclusive OR operation on the input bit data and the first, fourth, sixth and eighth detainees bits of data to generate fifth character of the fifth generating polynomial, perform a logical exclusive OR operation on the input bit data and the first, second, fourth, sixth, the seventh and eighth detainees data bits to generate the sixth symbol of the sixth generating polynomial.

 

Same patents:

The invention relates to a receiving device and method for communication systems

The invention relates to a device and method of coding for mobile communications and more particularly to a device and method for producing the Quaternary complex quasiorthogonal codes and further use of these developed Quaternary complex quasiorthogonal codes to generate signals channel expansion

The invention relates to digital communication systems in which data is variable speed transmitted without the indication of speed transmission data and received in a coherent receiver, in which the transfer rate of data transferred is determined for use in data processing

The invention relates to the field of generation scramblers codes in mobile communication system

The invention relates to communication systems, multiple access, code-division multiplexing, and more particularly to a device and method for communication control in selected time intervals

The invention relates to telecommunication systems

FIELD: radio engineering.

SUBSTANCE: suggested algorithm for quasi-coherent receipt of multi-beam signal with continuous pilot signal is based on algorithm, adaptive to freeze frequencies, for estimation of complex skirting curve, which uses both pilot and information signal. Use of information symbols for estimation of complex skirting curve allows, with weak pilot signal, to substantially increase precision of estimation of said curve and, as a result, significantly decrease possible error of information parameters estimation.

EFFECT: higher interference resistance.

2 cl, 10 dwg

FIELD: communication systems.

SUBSTANCE: device has block for synchronizing clock speeds, input displacement register, commutator, intermediate storage register, memory block, comparison block, threshold block, record control block, count displacement register, reading control block, synchronization signals forming block, commutator, interference level measuring device, additional memory block, channels counter, communication channel.

EFFECT: higher interference resistance.

1 dwg

FIELD: radio engineering.

SUBSTANCE: implementation of soft decisions generating method in case of receiving multi-beam signal allows substantial decrease of complication level of receiver, because it contains lesser amount of one-beam receivers, than a prototype.

EFFECT: increased interference resistance and increased capacity of communications system during receiving of multiple-beam signal due to efficient periodic procedure of renewal of multiple-beam signal components when receiving estimates of components search, also considering mutual influence of signal components.

6 cl, 13 dwg

FIELD: transmission of information, applicable in cellular and satellite communication systems.

SUBSTANCE: the receiver has two frequency converters, two quadrature correlators, phase error filter, controlled oscillator, two control elements, error delay filter, controlled clock oscillator, reference signal generator, two multipliers, two analog-to-digital converter, delay line, demodulator, decoder, two matched filters, phase shifter.

EFFECT: enhanced power efficiency of the communication system.

2 cl, 3 dwg

FIELD: mobile telecommunication systems.

SUBSTANCE: base station receives information, pointing out presence on mobile station of information for transfer. Then, base station transmits information about state of use of physical channels and information about maximal allowed possible data transfer speed. Mobile station receives aforementioned data and transmits access header to base station to request given physical channel, determined on basis of aforementioned data.

EFFECT: higher stability, decreased number of errors during assignment of channel.

3 cl, 52 dwg, 8 tbl

FIELD: data channels in wireless communications system.

SUBSTANCE: for realization of method, base station sends request of booting protocol (BOOTP) to operation and service center, and base station receives IP-address assigned to it from response, dispatched by operation and service center, as a result of which between base station and controller of base stations, operation and service channel is set up. Problem of automatic launch of base station is also solved by this, preventing conflicts of IP-addresses and making it possible to realize parallel launch of base stations.

EFFECT: setting up of Internet-based channel for protocol over asynchronous transfer mode between base station and controller of base stations with default configuration of base station.

6 cl, 7 dwg

FIELD: radio communications; wireless-access, fixed, land mobile and satellite communication systems.

SUBSTANCE: newly introduced in prior-art code-division transmitter (IS-95 standard) are following components: orthogonal M-code generator, two (n + k) modulators, and n + k + j + 1 signal spectrum shaper in transmitter circuit; divider, second coder, multiplier, and second character compactor in each data channel; divider, second coder, and multiplier in each call channel; relevant interconnections to organize new signal-code structure and channel code multiplexing type which has made it possible to enhance spectral efficiency of communication system by more than three times.

EFFECT: enhanced data-transfer spectral efficiency of promising communication systems.

1 cl, 1 dwg

FIELD: radio communications.

SUBSTANCE: in known transmitter with code division of channels (IS-95 standard), new elements are additionally introduced, namely: transmitter circuit additionally features P orthogonal code generators, (N+K+J+1) signal spectrum generator, P channel signal adders, channel group signal adder, and each information channels features a divider, second encoder, interlacing device and second symbol compressor, each call channel features divider, second coder and interlacing device and appropriate connections between them for creation of new signal code structure and of a form of code compression of channels.

EFFECT: more than 3 times increased spectral efficiency of communication system.

5 dwg

FIELD: methods for assigning Walsh space.

SUBSTANCE: in base station and mobile stations a list of Walsh functions is contained. Walsh space pointer is transferred to point at which exactly Walsh functions from the list are used for realizing communication. Walsh space pointer is corrected according to available dynamically changing transmission power, or according to usage of Walsh functions in base station.

EFFECT: assignment of Walsh space for efficient distribution of Walsh space among different users, while minimizing usage of system resources for its distribution.

10 cl, 12 dwg, 5 tbl

FIELD: wireless mobile communication system, in particular, methods and systems for transmitting complex symbols with usage of transmission code matrix.

SUBSTANCE: in accordance to the invention, transmission code matrix is generated with usage of transformed orthogonal codes in such a way, that the code is resistant to static channel characteristics and operates efficiently both in Rician channels and in (correlated) Rayleigh channels. Also, invention provides for high speed transmission of symbols with usage of several transmitting antennas and one or more receiving antennas.

EFFECT: invention simultaneously ensures high order of diversion and high speed of symbol or data transmission.

6 cl, 3 dwg

Up!