Device and method for generating codes in communication system

FIELD: data transfer technologies.

SUBSTANCE: method includes segmentation of length N of quasi-complementary turbo-codes on preset amount of sections, determining identifiers of sub-code packets appropriate for segmented portions, setting of said packets separated for initial transfer of sub-code, calculation of number of remaining symbols in form N-Fs, where N - length of quasi-complementary turbo-codes, and Fs - position of start symbol of sub-code of quasi-complementary turbo-codes, determining position of symbol of remaining symbols in amount equal to sub-codes amount, which have to be sent and serial transfer of sub-code symbols from position of starting symbol Fs to position of last symbol Ls.

EFFECT: higher efficiency.

5 cl, 17 dwg

 

The present invention relates generally to the formation of codes in the data transmission system and, in particular, relates to devices and method of forming complementary turbocodes based on the characteristics of turbocodes in the system packet communication or a conventional communication system, which uses the scheme of re-transmission.

Usually there are two types of systems with automatic request for repetition (ASP), which uses incremental redundancy (AI): a system with a hybrid automatic request for repetition (GASP) type II and with HASP type III. System with HASP type II supports at each transmission rate R code greater than 1.0 and varies redundancy transmission in accordance with the state of the channel. Here the situation when the rate R of a code greater than 1.0 means that the number of symbols of the code word is less than the number of information symbols. System with HASP type II combines the previously received redundancy redundant taken in the moment, to create a new code word with a low rate code, and repeats this process. However, the system with HASP type III is designed so that the rate R for the code used for each transmission or re-transmission of less than 1.0. This is done with the purpose to be able to perform decoding only with newly developed codes when errors SV is related to the poor condition of the channel, or error detection is lost many packets during transmission. If all codes are taken from the rate of the code R, can be decoded independently, such codes are called “samodelegirovanie codes” (DMS).

In a system with HASP type II or system HASP type III, where the use turbocode, to ensure maximum effectiveness of combination codes used quasicomplete turbocode (CCTC). Figure 1 shows the block diagram of the device for forming codes CCTC.

Refer to figure 1, where the encoder 301 generates the coded symbols by encoding the input packet encoder. The encoder 301 uses the parent code with R=1/5 or any other rate code. The parent code is defined by the system. In this example, as the parent code is used turbo code with R=1/5. The demultiplexer (DEMUX) 302 divides the coded symbols received from the encoder 301, the group of information symbols X (303), the symbols Y0(313) parity symbols Y1(323) parity symbols Y0’ (333) parity and character Y1’ (343) parity and gives five character groups in the corresponding subbotnyi premarital 304, 314, 324, 334 and 344, respectively. Subbotnyi premarital 304, 314, 324, 334 and 344 rearrange random sequence generated by the demultiplexer 302, using subblock AC is laid, and outputs rearranged symbols. The symbols of the code word, the randomized by subpackage interleave, served in the appropriate blocks.

Interspersed coded symbols X (306) from the output of the first interleaver 304 is transmitted directly to the input unit 307 clutch sequences (or characters). Alternating symbols Y0and Y1parity from the second and third premaritally 314 and 324 are fed to the input of the first multiplexer (MUX) 305, and alternating symbols Y0’ and Y1’ parity of the fourth and fifth premaritally 334 and 344 are fed to the input of the second multiplexer 315. The first multiplexer 305 multiplexes alternating symbols Y0and Y1parity and delivers the output signal (316) in block 307 clutch sequence. The second multiplexer 315 multiplexes alternating symbols Y0’ and Y1’ parity and delivers the output signal (326) in block 307 clutch sequence. In other words, the coded symbols received from the encoder 301, divided into three subgroups: intermittent symbols of the code words generated by the interleaver 304; the symbols Y0and Y1parity, reflow the first multiplexer 305; and the symbols Y0’ and Y1’ parity, reflow the second multiplexer 315. Then block 307 clutch sequence Il the characters) form one character sequence [A:B:C] by sequential coupling sequence And subblock intermittent information symbols and sequences b and C are multiplexed character parity. Repeater 308 concatenated sequences (or characters) provides the repetition of symbols by symbols from block 307 clutch sequence according to a predetermined rule. Block 309 perforation characters (or generator subcode Cij) generates subcodes (i.e., CCD) by piercing characters coming from the repeater 308 concatenated sequences according to a predetermined rule. Work unit 309 perforation of the symbols is described in detail below. The operation of forming subcode generator subcodes 09 disclosed in the patent application Korea No. 2001-7357 "Apparatus and Method for Generating Codes in a Communication System", filed by the applicant previously and included in the description by reference.

Here it is assumed that the transfer of subcode begins at time k, subcode transmitted at time (k+h), is expressed in the form Cij(k+h), and the coded symbols of the mother code with R=1/5 figure 1 are defined asm(0), Cm(1),..., Cm(N-1). The number N of encoded symbols is defined as N=L L_NFx5, because the rate mother code is 1/5. Here L_INF denotes the size of the intermittent subunit, or the number of information symbols.

Step 1: determine the length of the initial subcode

For the initial transmission is selected do one of the first subcodes Ci0/sub> With10With20from among the available subcodes CCD in accordance with this rate code, then the length of the selected subcode10is stored as a variable L_SC. The speed code or length L_SC of subcode pre-installed in the system in accordance with the conditions in the channel, including the state of the transmission channel and the transmission rate of the input data.

The description for a better understanding of the present invention is made in the context of the three codes CCD shown in figure 3, although in principle the number of subcodes not restricted.

Step 2: select and transfer of subcode for the initial transmission

Once you have identified the length of subcode to be transmitted, among the code symbols of the parent code selects the coded symbols Cm(0), Cm(1),..., Cm(L_SC-1). If L_SC exceeds N, then Cm(0), Cm(1),..., Cm(L_SC-1) transmit R times, and then passed to Cm(0)m(1), ..., Cm(q-l). Here P and q the quotient and the remainder of the division L_SC/N, respectively, and P and q are calculated as L_SC mod N. Then the variable q remember for the next transmission to be used when determining the position of the last character transmitted before this subcode, in relation to a block of intermittent character.

Step 3: define the starting position of subcode for the next transmission and the length of subcode

Next is peredachi determine the speed of the code R_SC for the new subcode, subject to the transfer, in accordance with the conditions in the channel, and determine the length L_SC of subcode in accordance with a specific rate code. Length L_SC and speed code R_SC connected by the relation:

The upper level system passes the length of subcode L_SC and speed code R_SC for subcode in block 309 perforation symbols for each transmission.

Step 4: select and transfer of subcode for the next transmission

After the selected length L_SC of subcode subject to transfer, from the coded symbols of the parent code selects the coded symbols Cm(q), Cm(q+1),..., Cm(q+L_SC-1). In other words, from the coded symbols of the parent code, starting with the character following the last character that was selected for the previous transfer, select the number of characters corresponding to the length of subcode. If q+L_SC exceeds N, recursively choose the N coded symbols, starting with Cm(q), which transmit R times, and then transmit the remaining q encoded symbols. Here P and q the quotient and the remainder of the division (q+L_SC)/N, respectively, and P and q is calculated as (q+L_SC) mod N. Then the variable q remember for the next transmission to be used when determining the position of the last character transmitted before this subcode, in relation to a block of intermittent character. After the transfer of sformirovann the th subcode procedure returns to step 3.

The selection method of subcode for CCTC detail shown in the example in the lower part of figure 1. Refer to figure 1, where in case 1 initially passed subcode low speed 1/7, and in case 2 is initially transmitted to subcode with high speed 4/7. As can be seen from these cases, the code word having N symbols is repeated R times, and recurring characters of the code word is sequentially divided into segments of appropriate size in accordance with the length (or speed code) subcode at each transfer. In the practical implementation does not use the buffer for storing the P code words, and is a single ring buffer for storing N symbol code word, which allows you to perform iterative transmission by ensuring continuous communication. In addition, there is a receive buffer for storing the received code words and coupling the stored code words until then, until it is memorized N flexible metrics.

As described above, the generator subcodes Cijin accordance with the last step divides the coded symbols with R=1/5, reflow in accordance with a certain rule in the previous steps, the segments of arbitrary length in accordance with the speed of subcode Rs=R_SC.

Here figure 2 shows the segmentation methods according to the respective speeds of the subcodes for the case when the starting that is why Fs for segmentation is ‘0’. Refer to figures 1 and 2, where in the case of setting the length of subcode subject to segmentation, in accordance with the speed code for the corresponding subcode generator CCTC (1) segmenting the code symbols in an amount corresponding to the length of the reassembled sequence of code words with R=1/5. There are two different ways of segmentation. The first way is to use a variable starting point Fs. That is, initially passed subcode begins with Fs=0, and the starting point Fs of the next subcode is defined as the position (Ls+1)-th symbol based on the position Ls of the last character of the preceding subcode. In other words, all subcodes are segmented so that the reflow code words with R=1/5 continuously engage in repetitive sequence. This process is defined as a mode consistent with the starting point (RPST). The second way is to use a fixed starting point Fs. That is, initially passed subcode begins with Fs=0, a following subcodes begin with a predetermined starting point Fs. Therefore, not all subcodes can be sequentially concatenated in the sequence, where repeated reflow code words with R=1/5, and segmented in the form, where the symbols of the code words may overlap in accordance with the speed of subcode. This is the procedure defined here as a mode with a xed starting point (RFST).

When using CCTK optimal from the point of view of maximum efficiency decoding scheme is REST, which can ensure the maximum benefit from combining codes even with the AI. However, if the speed code for this subcode close to 1.0, there is a probability that the subcodes that is different from the initial subcode, will cease to be samodelegirovanie codes, then there will be gesamtakademie (NSDC), which is undesirable. As was established above, here it is assumed that the mode RPST has HASP type II and GASP type III. If the speed code for all transmitted subcodes less than 1.0, then use HASP type III, and, if the speed code for the part of subcodes greater than 1.0, then use HASP type II.

The fact that in the proposed system uses the query GASP type III, where the speed code for all subcodes of less than 1.0 means that the receiver performs decoding by successively combining the codes for all of the adopted subcodes. In addition, in the mode REST between transmitter and receiver is not exchanged redundancy version (VI). The reason for this is that in mode RPST no need for exchange version redundancy VI between the transmitter and the receiver.

However, when some subcodes disappear in very poor conditions in the channel, may occur a phenomenon expect the project for a missing subcodes to ensure continuous combination codes. Thus, in this case, you will need samodelegirovanie codes (DCS)capable of independent decoding of the corresponding subcodes, as in the case of a request GASP type III, where provided VI. This means that independent of the VI is transmitted through each sub-code transmission. In this context, the proposed scheme HST. In this case together with the indicator VI uses the standard 2-bit sub-code batch ID (SCPI)that allows independent transmit 4 type VI or starting points (Fs) for each sub-code transmission. Meanwhile scheme HST cannot be considered as optimal from the point of view of maximizing the effectiveness of decoding, since it occurs overlapping characters. In addition, the mode RFST cannot ensure maximum benefit from a combination of codes even with the AI.

Thus, in the subsequent description of the present invention will be first analyzed the difference between the schemes REST and HST, and then will discuss the benefits and drawbacks of these schemes. Next it is proved that the scheme REST exceeds scheme HST. Accordingly, the present invention proposes a method to ensure the scheme RFST the same efficiency as in the diagram REST. In particular, the present invention is shown in scheme RFST there problem is and a decrease in the efficiency due to the overlap of characters and perforation of characters and as a solution to this problem are proposed adaptive scheme for the choice of SKY.

Thus, the present invention is a device and method for minimizing the overlap of characters and perforation of the characters in the subcodes in the formation CCD mode REST or HST.

Another objective of the present invention is to provide a device and method for selecting SKI to minimize overlap of characters and perforation characters for subcodes, when the starting point is specified using SCPI, when forming CCD mode REST or HST.

According to the first aspect of the present invention proposes a method for transmitting subcode defined speed subcode that is identical to or different from the speed code turbolader in accordance with the conditions in the channel, from the code CCTC generated by turbocodes receiving the flow of information and working with this rate code. The method includes segmenting the length N KKTC on a predetermined number of segments, determining the identity of SCPI (IDs subcode packs) in accordance with segmented lines, and setting one of SKI allocated for the initial transfer subcode; calculate the number of remaining characters, represented as N-Fs, where N is the length CCTC, a Fs - position of the starting character of subcode CCTC; determine the position of the last character of Ls subcode by comparing the number of remaining characters with a length of subcode; and serial transmission symbols subcode from the position of the start symbol Fs to the position of the last symbol Ls.

Preferably as the position of the starting character for subcode retransmission to choose SKI that is closest to the position of the last symbol Ls among all SKI except given SKI to respond to a request for retransmission to the transmitted subcode. According to the second aspect of the present invention proposes a method for transmitting subcode defined speed subcode that is identical to or different from the speed code turbolader in accordance with the conditions in the channel, from CCTC generated by turbocodes receiving the flow of information and working with this rate code. The method involves calculating the number of remaining characters, represented as N-Fs, where N is the length of the code word CCTC, and Fs - position of the starting character of subcode CCTC; determining the position of the last character of Ls subcode by comparing the number of remaining characters with a length of subcode; and serial transmission symbols subcode from the position of the start symbol Fs to the position of the last symbol Ls.

The above and other objectives, features and advantages of the present invention will become more apparent from the subsequent detailed description together with the accompanying drawings, in which:

figure 1 - the block of the diagram of the device forming quasicomplete of turbo code (CCTC), to which the present invention is applicable;

figure 2 - illustration of the operation of forming the subcodes using turbocodes with the speed of the parent code R=1/5 with the help of the device forming CCTK of figure 1;

figure 3 - illustration of the operation of forming the subcodes mode with a xed starting point (HST) using the device formation CCTK of figure 1;

figure 4 - illustration of the operation of forming the subcodes mode HST using the device formation CCTK of figure 1;

5 is a detailed hardware structure of the device formation CCTK of figure 1 for the formation of subcodes with R=2/3 using turbocodes with the speed of the parent code R=1/5;

6 is a schematic diagram explaining the phenomenon of overlapping symbols that occur when the forming device CCD of figure 1 creates subcodes mode HST;

7 - characteristics of the decoding in the receiver, when the forming device CCD of figure 1 operates in the mode REST and mode HST;

Fig is an illustration of the operation of the receiver during decoding of subcodes, formed by the forming device CCD of figure 1, from the point of formation address;

figure 9 is an illustration of the operation of the receiver during decoding of subcodes, formed by the forming device CCD of figure 1;

figure 10 - process for the selection of SKI according to the first embodiment of the present invention;

F. g - the procedure for the formation of subcodes mode HST according to the second variant of the present invention;

Fig is the procedure of choice, SKI according to the second variant of the present invention;

Fig - procedure for the formation of subcodes mode HST according to the third variant of the present invention;

Fig is the procedure of choice, SKI according to the third variant of the present invention;

Fig - procedure for the formation of subcodes mode with a serial starting point (CST) according to the variant of the present invention;

Fig is the procedure of choice, SKI according to the fourth variant of the present invention (modification of the second embodiment); and

Fig is the procedure of choice, SKI according to the fifth variant of the present invention (modification of the third option).

Next, with reference to the accompanying drawings, describes preferred variants of the present invention. In the following description of known functions and structures are not described in detail so as not to obscure the invention with unnecessary detail.

In the following description, the invention is applied to the device formation CCD (or subcode), shown in figure 1, this invention provides a method for the transmission of sub-code words determined by the rate of subcode that is identical to or different from the speed of the code is turbochager, in accordance with the conditions in the channel of code words CCTC generated using turbocodes receiving the flow of information and with this rate code. The forming device subcode, which uses the present invention may form a sub-code word mode REST or HST, as described earlier. Here we consider two variants of the present invention: formation of subcodes mode RPST (Fig) and the formation of subcodes mode RFST to solve the problem associated with the regime REST (see Fig. from 10 to 14 and Fig and 17). According to the present invention there are several options selection of SKI and formation of subcodes mode HST: the first option (figure 10), the second option (11 and 12), the third option (Fig and 14), the fourth option (Fig) and the fifth option (Fig).

A. Analysis CCD with a xed starting point

Mode with a xed starting point (HST)

Consider the problem arising from the formation of codes CCD mode RFST. HST is a transmission scheme for determining the 4 existing templates with the same length of subpacket by fixing the initial position of the code symbol for the corresponding subcodes 2-bit message, the transmitting version information redundancy, call ID, SCPI followed by the provision of 4 available subcodes in to the operation imagecolormatch codes (KFOR). If subcodes are different lengths of subpackets or speed code, then any additional templates redundancy with 2 bits in SKY.

Of course, the number of bits of SCPI is not limited. Here for example, it is assumed that the number of bits of SKY equal to 2. This scheme, which is offered initially regardless codes CCD designed for uniform distribution of the coded symbols with R=1/5, using a random interleaver, provide four starting points and subsequent determination of the positions of the respective starting points according to the identifier of SKI. Here the speed code for subcodes can take an arbitrary value, as shown in figure 3.

Refer to figure 3, where turbocodes 401 performs turbomotive input with length L (L=4a) when velocity code R=1/5 and generates a code word of length N (N=5L=20a). Random interleaver 402 performs random interleaving for code word (or encoded characters)coming from turbolader 401. Block 403 education subcode forms subcodes based on four starting points determined in advance of the code word after the alternation in random interleaver 402. As shown in figure 3, the start point is defined as the position obtained by dividing the code word length N into four equal segments.

Figure 4 show the and block diagram of the device for the formation of subcodes with R=2/3 in the scheme HST with the speed of the parent code R=1/5. Refer to figure 4, where turbocodes 401 performs turbomotive input with length L (L=4a) when velocity code R=1/5 and generates a code word of length N (N=5L=20a). Random interleaver 402 performs random interleaving for code word (or encoded characters)coming from turbolader 401. Block 403 education subcode forms subcodes based on four starting points determined in advance of the code word after the alternation in random interleaver 402. As shown in figure 4 of the start point is defined as the position obtained by dividing the code word length N into four equal parts, and each subcode is a code word with R=2/3, with 6A coded characters.

Figure 5 shows a device for forming subcodes with R=2/3, with turbocodes with the speed of the parent code R=1/5. Refer to figure 5, where the reference position 501 503 correspond to turbocodes. The first part of the encoder (ENC1) 502 encodes the bits of the X input length L (=4A) and emits the symbols Y0(L bits) and Y0’ (L bits) parity. Interleaver (T1) 501 performs interleaving bits of input data in accordance with a predetermined rule. The second part of the encoder (ENC2) 503 encodes characters after their alternation in the interleaver 501 and outputs the symbols Y1(L bits) and Y1’ (L bits) chemostat 504 characters (or block perforation characters) performs puncturing bits of the X input (L bits) and the symbols Y 0and Y1, Y0’ and Y1’ parity in accordance with a predetermined rule, and outputs the subcodes with rate R=2/3 code.

Decoding mode RFST

When decoding mode RFST the following problems occur. First, as shown in figure 3, when the speed code for subcodes exceed 0.8, SC00 part of the coded character disappears (that is, they is unused). Secondly, as shown in figure 4, the subcodes SC00, SC01 and SC10 appear overlapping code symbols, when the speed code for subcodes less than 0,8. This ratio is shown in Fig.6. As can be seen from figure 3, if the speed code for subcodes less than 0,8, there is a lot of overlapping characters between subcode SC01 and subcodes SC10.

For example, if the maximum speed of subcode Rs is 0.8 (=4/5), then disappearing symbols associated with the first problem, do not appear. That is, in all cases, the missing characters are missing. Alternatively, if the maximum speed of subcode Rs is very small, between the subcodes there is a lot of overlapping coded symbols, which means that the decoder before decoding performs flexible combinations of characters. Average energy Es encoded characters must be constant in order to guarantee the efficiency of turbodecoding (uniformity), and the SLI Es uneven, you will need periodic pattern regular shape (the property of periodicity). However, increasing the number of overlapping characters complicates the maintenance of attribute properties overlapping symbols, which reduces the efficiency of decoding. In other words, the mode REST provides greater uniformity than HST from the point of view of the average energy Es.

7 shows the difference between REST (case a) and mode RFST (case C), used in the receiver. 7 the number of repetitions of a code word or sequence is 2. In the case, And the distribution of energy (Es) demonstrate consistent starting point. That is, if the receiver performs flexible combinations of symbols, the average energy Es is doubled. Alternatively, one part is tripled, and the other part is doubled. However, in the case of a fixed starting point does not show the specified distribution of energy, instead of the figure shows that the difference between the energy values of the symbols may be up to 9 dB. The uneven distribution of energy of character, combined in the receiver, has a direct impact on the efficiency of decoding and leads to deterioration of average efficiency. But REST increment of energy Es, corresponding to the factor repeated the I sequence, evenly distributed over the coded symbols, and only the remaining repeated characters have energy exceeding Es at +3 dB, and this energy is also evenly distributed in the code word. That is, the mode REST guarantee optimal efficiency by repeating the same sequence. This circumstance is described with reference to Fig.

Contact Fig, where the receiver uses N buffers (or one NxQ-bit buffer). These buffers can be implemented using a circular buffer. Alternatively, you can calculate the amount of memory for buffers so that the generator buffer address with a fixed size could create a loopback addresses. As shown in Fig, for subcode C00 receiver stores N characters, starting from the starting address ADDRO, and from this position remembers 6144 (=21504-15360) characters in the buffer. Since in this step, memorable characters after the first N symbols, the receiver performs flexible combinations to remember in the moment of symbols with the previously stored characters videoustanovok way, and then remembers these flexibly combined symbols. Here the address of the end of the flexible combination is defined as “ADDR”. Next, when receiving the same by subcode C10 receiver memorizes the received symbols in the buffer, increasing addresses on 10752 characters from “ADDR is”. Since this step is memorizing characters after the first N symbols, the receiver performs flexible combinations to remember in the moment of symbols with the previously stored characters videoustanovok way, and then remembers these flexibly combined symbols. Here the address of the end of the flexible combination is defined as “ADDR”. Next, when receiving the same image subcode C20 receiver memorizes the received symbols in the buffer, increasing addresses on 5376 characters from “ADDR”. Then when you receive the same by subcode C21 receiver memorizes the received symbols in the buffer, increasing addresses on 5376 characters from “ADDR”. Here the address of the end of the flexible combination is defined as “ADDR D”. Finally, the receiver creates a flexible metric indicators for all N symbols of the code word by continuous implementation of flexible combination on the subcodes are sent using the same encoder packet as described above. Also this method can be seen as a way of implementation of the scheme of formation of subcodes for CCD in the transmitter. Summarizing the above, we can say that this method is identical to the method implementation step 1 determine the length of the initial subcode, step 2 of the selection and transfer of subcode for the initial transmission, step 3 determine the starting position of subcode for the next transmission and the length of subcode and step 4 you is ora and transfer subcode for the next transmission. Thus, the receiver can perform soft combining, adequately reflect the subcodes in code words with R=1/5 in accordance with information about the type of subcode transmitted by the transmitter, when implementing the method of cyclic buffering. Since the received symbols stored in the cyclic buffer, regularly accumulate successive starting points are evenly summed Es, as described in connection with Fig.7.

Figure 9 presents a flowchart of the execution of the decoding process mode REST according to the present invention. As shown in this figure, it is assumed here that at the moment the transmitter gave subcodes C00, C10, C20 and C21. In particular, C00 is transmitted subcode with 21504 symbol in the code word, C10 is transmitted subcode with 10752 symbols in the code word, and C20 and C21 are transferred subcodes, each having 5376 symbols in the code word. Therefore, at the moment the receiver has received a total of four subcode, and all of these subcodes were transferred in the form of subcodes having different speeds of subcodes, using the coding package (here for example was used 3072 bits), which represents one information block. Thus, the receiver creates a flexible metric indicators for the N code words by a flexible combination is obchodov above established. The receiver performs flexible combinations by reflow four subcodes so that the position of 15360 (=3072×5) symbols of the code words with R=1/5 were identical to the positions of the symbols of the code word corresponding subcodes. Since the length component 21504 for subcode C00 greater than N, the receiver assembles 15360 characters, and then rearranges the remaining 6144 (=21504-15360) symbols of the code words from the beginning according to the method of repeating sequences and performs flexible combinations of characters to reflow the symbols of the code words. Similarly, because of subcode C10 was transferred after subcode C00, the receiver also stores C10 after the completion of C00, and then performs flexible combinations of these characters. Similarly, because the subcodes C20 and C21 were transferred after subcode C10, the receiver remembers subcode C20 and subcode C21 after the end of subcode C10, and then performs a flexible combination of characters stored on the subcodes.

Century

Transfer mode BST

On Fig shows the algorithm for transmission mode REST according to a variant of the present invention. On Fig LSc represents the size of subpackets, N represents the number of symbols of a code word encoded by turbocodes speed code R, Fs is the starting character position (or starting point) of each subpacket, a Ls pre what is the position of the last character (or the last point). In addition, NRESrepresents a variable, calculated by the given formula. In the following algorithm ‘[x]’ represents the maximum integer that is less than the given value ‘x’. In addition, NCRrepresents the frequency of repetition of the entire code word containing N symbols.

Contact Fig, where in step 1501 generator subcode sets the starting point Fs to zero (0) for the new batch encoder. If you have previously sent subcode, the generator subcode uses as Fs value Ls, some of the previously transmitted subpacket. Then at step 1503 generator subcode calculates the number nres of the remaining symbols by subtracting a certain starting point Fs of the number N of symbols of the code words. In step 1505 generator subcode determines greater than or equal to the calculated value of NRESthe remaining characters in length Lsc transmitted at the moment of subcode (or subacute). If the number of NRESthe remaining characters greater than or equal to the length Lsc of subcode, the generator subcode in step 1507 updates the last point Ls of subcode, assigning it the value of ‘Fs+Lsc-1’. After that, in step 1509 generator subcode sequentially transmits the coded symbols with a specific start point of the Fs to some of the last point Ls. However, if the number of NRESthe remaining characters is less than the length Lsc of subcode, then the gene is ATOR of subcode determines the last point Ls of subcode in later steps 1511 and 1513 in accordance with the following equations (2) and (3).

After step 1507 or step 1513 generator subcode in step 1509 sequentially transmits characters from the starting point Fs to the point (N-1)-th symbol. Further, the generator subcode repeats all N symbols NCRtime to transfer. Finally, the generator subcode transmits symbols from the position of the 0-th symbol to the position of Ls-th symbol, and then proceeds to step 1515. After the transmission symbols assigned to subcode generator subcode in step 1515 updates starting point Fs, assigning it the value ‘(Ls+1)mod N’. In step 1517 generator subcode determines whether the request for the next subpacket (or retransmission). If you have a request for transmission of the next subpacket, the generator subcode returns to step 1503, and repeats the above steps. Otherwise, the generator subcode returns to step 1501.

As was established above, the lack of mode FRST is that there is a lot of overlapping characters, and these overlapping characters reduce the efficiency of the decoder. Accordingly there is a need in the way of minimizing the number of overlapping characters.

The first method transmission mode RFST

Mode RFST identifiers of SKI must be transmitted either sequentially or in a predetermined order

It is necessary to improve the ability of detecting errors in the preamble and reduce the frequency of false alarms (CLT). In other words, identifiers, SCPI must be transmitted sequentially. If they are irregular, there is no way to detect an error in the identity of SKI without using the control on the basis of the cyclic redundancy code (CEC). Below are two examples. In case 2, there is no possibility to detect an error in the identity of SKY, as it depends on the detection of errors in all transmitted the preamble, including the identity of SKI. Therefore, if we assume that the system that uses direct additional control channel packet data (PDCEBD), transmits identifiers of SKI without applying CEC, identifiers, SCPI must be assigned either sequentially or in a predetermined order.

Case 1) the sequence identifiers of SCPI:

0→1→2→3→0→1→2→3→0→...

Case 2) Random identifiers SCPI:

0→3→1→2→1→0→3→2→1...

When designing a system for Case 1 and Case 2, special attention should be paid to the detection of errors, not the problem of overlapping characters.

Figure 10 shows the procedure of choice SKI according to the first embodiment of the present invention. Figure 10 the value of R is to the number of bits dedicated to SKI, and M represents the maximum integer be expressed using P bits. That is, if P=2, then M=4. Further, N represents the number of encoded symbols is encoded using the parent code. For example, when the rate of the code R=1/5, a length of the input data, L=100, the number of encoded symbols is encoded using the parent code will be N=L/R=500. In addition, Lsc is the size of subpackets, Fs represents the position of the starting character (or starting point) of each subpacket, a Ls represents the position of the last character (or the last point of each subpacket. NRESrepresents a variable, calculated by the given formula. In the following algorithm[x]’ represents the maximum integer less than the value ‘x’. NCRrepresents the frequency of repetition of the entire code word containing N symbols. This procedure is performed by the generator subcode in the forming device CCD of figure 1.

Refer to figure 10, where in step 1001 generator subcode initializes SKY, setting it to zero (0) for the new package (PC) encoder. Further, the generator subcode initializes the starting point Fs and the last point Ls of subcode. SKY and the starting point Fs related ratios:

SPID=1:{N/M)

SPID=2:{2N/M)

SPID=3:{3N/M)

.

.

.

SPID=(M-1): (M-1)(N/M)

In step 1003 generator subcode vices yet the number of N RESthe remaining symbols by subtracting a certain starting point Fs of the number N of symbols of the code words. In step 1005 generator subcode determines greater than or equal to the calculated amount of NRESthe remaining characters in length Lsc transmitted at the moment of subcode (or subacute). If the number of NRESthe remaining characters greater than or equal to the length Lsc of subcode, the generator subcode in step 1007 updates the last point Ls of subcode, assigning it the value of ‘Fs+Lsc-1’. After that, in step 1009 generator subcode sequentially transmits the encoded symbols from the starting point Fs to some of the last point Ls, and then proceeds to step 1015. Otherwise, if the number of NRESthe remaining characters is less than the length Lsc of subcode, the generator subcode determines the last point Ls of subcode in later steps 1011 and 1013 in accordance with the following equations (2) and (3).

After step 1007 or step 1013 generator subcode in step 1009 sequentially transmits characters from the starting point Fs to the point (N-1)-th symbol. Further, the generator subcode repeats all N symbols NCRtimes before passing. Finally, the generator subcode transmits symbols from the position of the 0-th symbol to the position of Ls-th symbol, and then proceeds to step 1015. After transferring the SIM is tins, relevant subcode generator subcode in step 1015 selects the next ID from the specific IDs of SKY as a starting point Fs for the next subpacket. In step 1017 generator subcode determines whether the request for the next subpacket (or retransmission). Here the presence of the request for the next batch” means that there is a request for retransmission of the current batch encoder (PC)transmitted by the transmitter, due to the fact that the packet encoder is not accepted. Thus, this SKI should not be discarded, but should be linked to the next SKI. Therefore, if you have a request for transmission of the next subpacket, the generator subcode returns to step 1703, and repeats the above steps. Otherwise, if there is no request for transmission of the next subpacket, this means that SKY need to be reset. In this case, as passed at the moment the PC is successfully accepted, and therefore, there is a transfer request for a new PC, the generator subcode returns to step 1701.

The second option transfer mode RFST

If the message, transmitting SCPI uses CEC (i.e., the CEC used in the channel PDCEBD), provides error detection. Therefore, in this case, the order of the IDs SCPI mode RFST not necessarily succession is compulsory. Alternatively, if the message, transmitting SKI, the error detection is not required, the order of the IDs SCPI mode RFST may not be consistent. In this case, it is preferable to choose subcode for transmission in accordance with the following rule in order to reduce the number of overlapping characters to optimise the performance of decoding. This is because, if the speed of subcode less than 0,8 (at a maximum speed of subcode, equal to 0.8), because SKI, which divides the coded symbols with R=1/5 into four equal parts, there is inevitably an overlap between the characters. Therefore, after the transfer of one subcode the best way minimizes the number of punctured symbols, that is, those characters that are removed instead of them to transfer when the transfer of two subcodes. Accordingly, there is a need in the way of minimizing the number of overlapping characters. That is, the value of the start point Fs of the next subpacket set less than or equal to the value of the last point Ls of the previous subpacket from among SKI closest to the last point Ls of the previous subpacket (or subcode). When the starting point Fs is selected so that transfer subpackets, as shown in figure 11. As can be seen from this figure, after the transmission is of subpacket SC1 generator subcode selects from among the identifiers (SKI=00, SKI=01, SCPI=10) nearest SKI=11, less than or equal to the value of the last point subpacket SC1, and then transmits the next subpacket SC2, from the starting point.

On Fig shows the procedure of choice SKI according to the second variant of the present invention. On Fig P represents the number of bits allocated for SKI, and M represents the maximum integer be expressed using P bits. That is, if P=2, then M=4. Further, N represents the number of encoded symbols is encoded using the parent code. For example, when the rate of the code R=1/5, and the length of the input data, L=100, the number of encoded symbols is encoded using the parent code will be N=L/R=500. In addition, Lsc is the size of subpackets, Fs represents the position of the starting character (or starting point) of each subpacket, a Ls represents the position of the last character (or the last point of each subpacket. NRESrepresents a variable, calculated by the given formula. In the following algorithm ‘[x]’ represents the maximum integer less than the value ‘x’. NCRrepresents the frequency of repetition of the entire code word containing N symbols. Meanwhile, the position of the last symbol Ls can be defined differently according to the used algorithm. For example, you can also use a way to determine if what ESCWA characters in accordance with this speed subcode, to perform an incremental repetition by comparing a certain number of characters N and to determine the position of the last symbol Ls based on the number of remaining characters, as is done in the above way serial transmission.

Contact Fig, where in step 1201 generator subcode initializes SKY, setting it to zero (0) for the new package (PC) encoder. Further, the generator subcode initializes the starting point Fs and the last point Ls of subcode. SKY and the starting point Fs related ratios:

SPID=1:(N/M)

SPID=2:(2N/M)

SPID=3:(3N/M)

.

.

.

SPID=(M-1):(M-1)(N/M)

In step 1203 generator subcode calculates the number of NRESthe remaining symbols by subtracting a certain starting point Fs of the number N of symbols of the code words. In step 1205 generator subcode determines greater than or equal to the calculated value of NRESthe remaining characters in length Lsc transmitted at the moment of subcode (or subacute). If the number of NRESthe remaining characters greater than or equal to the length Lsc of subcode, the generator subcode in step 1207 updates the last point Ls of subcode, assigning it the value of ‘Fs+Lsc-1’. After that, in step 1209 generator subcode sequentially transmits the encoded symbols from the starting point Fs to some of the last point Ls, and then proceeds to step 1215. Otherwise, if the number of N RESthe remaining characters is less than the length Lsc of subcode, the generator subcode determines the last point Ls of subcode in later steps 1211 and 1213 in accordance with the following equations (2) and (3).

After step 1207 or step 1213 generator subcode in step 1209 sequentially transmits characters from the starting point Fs to the point (N-1)-th symbol. Further, the generator subcode repeats all N symbols NCRtimes before passing. Finally, the generator subcode transmits symbols from the position of the 0-th symbol to the position of Ls-th symbol, and then proceeds to step 1215. After the transmission symbols assigned to subcode generator subcode in step 1215 selects a starting point Fs of the defined identifiers SKI. Here the generator subcode selects the value of the start point Fs of the next subpacket is less than or equal to the value of the last point Ls of the previous subpacket from among SKI closest to the last point Ls of the previous subpacket (or subcode). In step 1217 generator subcode determines whether the request for the next subpacket (or retransmission). Here the presence of the request for the next batch” means that there is a request for retransmission of the current batch encoder (PC)transmitted by the transmitter, due to the fact that the package of coder adopted. T is thus, this SKI should not be discarded, but should be linked to the next SKI. Therefore, if you have a request for transmission of the next subpacket, the generator subcode returns to step 1203, and repeats the above steps. Otherwise, if there is no request for transmission of the next subpacket, this means that SKY really need to be reset. In this case, as passed at the moment the PC is successfully accepted, and therefore, there is a transfer request for a new PC, the generator subcode returns to step 1201.

A third option transfer mode RFST

The invention provides another method for selecting the start point of the next subcode in the form of SKI nearest to Ls previous subcode, after sending one of subcode. That is, as Fs is set to the closest ID, SCPI greater than or equal to the value of the last point Ls of the previous subpacket. For this method, you must puncturing symbols, but this method limits the maximum number of overlapping symbols to N/8 (=(N/4)/2). Similarly is also limited and the number of peelable characters to a value of N/8 (=(N/4)/2). Of course, you will need to coordinate the positive effect caused by reducing the number of overlapping characters, and losses caused by the sharp increase in the number of characters. That is,for the next subpacket (or subcode) generator subcode selects the closest SKI (or Fs) from the start point Ls of the previous subpacket (or subcode). When the starting point Fs is selected so that transfer subpackets, as shown in Fig. As can be seen from this figure, after the transfer of subpacket SC1 generator subcode selects the closest SKI=00 based on the value of Ls last point subpacket SC1, and then transmits the next subpacket SC2, from the starting point. In this case, between subpackets SC1 and subpackets SC2 are punctured symbols.

On Fig shows the procedure of choice SKI according to the third variant of the present invention. On Fig the value of P represents the number of bits allocated for SKI, and M represents the maximum integer be expressed using P bits. That is, if P=2, then M=4. Further, N represents the number of encoded symbols is encoded using the parent code. For example, when the rate of the code R=1/5, a length of the input data, L=100, the number of encoded symbols is encoded using the parent code will be N=L/R=500. In addition, Lsc is the size of subpackets, Fs represents the position of the starting character (or starting point) of each subpacket, a Ls represents the position of the last character (or the last point of each subpacket. NRESrepresents a variable, calculated by the given formula. In the following algorithm ‘[x]’ represents the maximum integer less than the value ‘x’. NCRPR is dstanley repetition rate of the entire code word, containing N symbols. Meanwhile, the position of the last symbol Ls may be defined differently in accordance with the algorithm to use.

Contact Fig, where in step 1401 generator subcode initializes SKY, setting it to zero (0) for the new package (PC) encoder. Further, the generator subcode initializes the starting point Fs and the last point Ls of subcode. SKY and the starting point Fs related ratios

SPID=1:(NIM)

SPID=2:(2N/M)

SPID=3:(3N/M)

.

.

.

SPID=(M-1):(M-1)(N/M)

In step 1403 generator subcode calculates the number of NRESthe remaining symbols by subtracting a certain starting point Fs of the number N of symbols of the code words. In step 1405 generator subcode determines greater than or equal to the calculated value of NRESthe remaining characters in length Lsc transmitted at the moment of subcode (or subacute). If the number of NRESthe remaining characters greater than or equal to the length Lsc of subcode, the generator subcode in step 1407 updates the last point Ls of subcode, assigning it the value of ‘Fs+Lsc-1’. After that, in step 1409 generator subcode sequentially transmits the encoded symbols from the starting point Fs to some of the last point Ls, and then proceeds to step 1415. Otherwise, if the number nres of the remaining symbols is less than the length Lsc of subcode, the generator subcode determines the last point Ls is bcoda in later steps 1411 and 1413 in accordance with equations (2) and (3).

After step 1407 or step 1413 generator subcode in step 1409 sequentially transmits characters from the starting point Fs to the point (N-1)-th symbol. Further, the generator subcode repeats all N symbols NCRtimes before passing. Finally, the generator subcode transmits symbols from the position of the 0-th symbol to the position of Ls-th symbol, and then proceeds to step 1415. After the transmission symbols assigned to subcode generator subcode in step 1415 selects a starting point Fs of the defined identifiers SKI. Here the generator subcode chooses as a starting point Fs of the next subpacket the point corresponding to SKI (or Fs)is equal to or closest to the last point Ls of the previous subpacket (subcode). In step 1417 generator subcode determines whether the request for the next subpacket (or retransmission). Here the presence of the request for the next batch” means that there is a request for retransmission of the current batch encoder (PC)transmitted by the transmitter, due to the fact that the packet encoder is not accepted. Thus, this SKI should not be discarded, but should be linked to the next SKI. Therefore, if you have a request for transmission of the next subpacket, the generator subcode returns to step 1403, and repeats the above steps. Otherwise case is e, if there is no request for transmission of the next subpacket, this means that SKY need to be reset. In this case, as passed at the moment the PC is successfully accepted, and therefore, there is a transfer request for a new PC, the generator subcode returns to step 1401.

The invention provides another method used when the primary transfer of the second and third options applies the specified SKI. In this case, the methods proposed in the second and third options are used equally, but during re-transmission cannot be applied, SCPI specified for the initial transmission. For example, when as SKI for the initial transmitting the pre-selected SKI=0, for re-transmission can use the IDs of SKY equal to 1, 2, 3,..., (M-1) (N/M). Thus, the generator subcode selects SKI used for retransmission, in accordance with the selection algorithm in the second and third options. In figures 16 and 17 show modifications of the second and third options for the case when the initial transmission is used SKI=0. Here SCPI=0 for the initial transmission is used as the example. If necessary, you can use other values SCPI for the initial transmission.

The fourth option transfer mode RFST

On Fig shows the procedure of choice SKI according to the fourth the WMD version of the present invention. In particular, Fig shows a modification of the procedure of selection of SKI according to the second variant. On Fig the value of P represents the number of bits allocated for SKI, and M represents the maximum integer be expressed using P bits. That is, if P=2, then M=4. Further, N represents the number of encoded symbols is encoded using the parent code. For example, when the rate of the code R=1/5, and the length of the input data, L=100, the number of encoded symbols is encoded using the parent code will be N=L/R=500. In addition, Lsc is the size of subpackets, Fs represents the position of the starting character (or starting point) of each subpacket, a Ls represents the position of the last character (or the last point of each subpacket. NRESrepresents a variable, calculated by the given formula. In the following algorithm ‘[x]’ represents the maximum integer less than the value ‘x’. NCRrepresents the frequency of repetition of the entire code word containing N symbols. Meanwhile, the position of the last symbol Ls can be defined differently according to the used algorithm. For example, you can also use the method for determining the number of characters in accordance with this speed subcode, to perform successive repetition by comparing a certain number of simbolos N and to determine the position of the last symbol Ls based on the number of remaining characters, as this is done in the above way serial transmission.

Contact Fig, where in step 1601 generator subcode initializes SKY, setting it to zero (0) for the new package (PC) encoder. Further, the generator subcode initializes the starting point Fs and the last point Ls of subcode. SKY and the starting point Fs related ratios:

SPID=1:{N/M}

SPID=2:(2N/M)

SPID=3:(3N/M)

.

.

.

SPID=(M-1):(M-1)(N/M)

At step 1603 the generator subcode calculates the number of NRESthe remaining symbols by subtracting a certain starting point Fs of the number N of symbols of the code words. In step 1605 generator subcode determines greater than or equal to the calculated value of NRESthe remaining characters in length Lsc transmitted at the moment of subcode (or subacute). If the number of NRESthe remaining characters greater than or equal to the length Lsc of subcode, the generator subcode in step 1607 updates the last point Ls of subcode, assigning it the value of ‘Fs+Lsc-1’. After that, in step 1609 generator subcode sequentially transmits the encoded symbols from the starting point Fs to some of the last point Ls, and then proceeds to step 1615. Otherwise, if the number of NRESthe remaining characters is less than the length Lsc of subcode, the generator subcode determines the last point Ls of subcode in a subsequent step 1611 and 1613 in accordance equations is (2) and (3).

After step 1607 or step 1613 generator subcode in step 1609 sequentially transmits characters from the starting point Fs to the point (N-1)-th symbol. Further, the generator subcode repeats all N symbols NCRtimes before passing. Finally, the generator subcode transmits symbols from the position of the 0-th symbol to the position of Ls-th symbol, and then proceeds to step 1615. After the transmission symbols assigned to subcode generator subcode in step 1615 selects a starting point Fs of the defined identifiers SKI. Here the generator subcode chooses as a starting point Fs of the next subpacket a non-zero value of the number of values less than or equal to the value of the last point Ls of the previous subpacket from among SKI closest to the last point Ls of the previous subpacket (or subcode). That is, the generator subcode excludes from resubmit SKI allocated for the initial transmission. In step 1617 generator subcode determines whether the request for the next subpacket (or retransmission). Here the presence of the request for the next batch” means that there is a request for retransmission of the current batch encoder (PC)transmitted by the transmitter due to the fact that the packet encoder is not accepted. Thus, this SKI should not be discarded, but should be linked to SL is blowing SKY. Therefore, if you have a request for transmission of the next subpacket, the generator subcode returns to step 1603, and repeats the above steps. Otherwise, if there is no request for transmission of the next subpacket, this means that SKY should really be dropped. In this case, as passed at the moment the PC is successfully accepted, and therefore, there is a transfer request for a new PC, the generator subcode returns to step 1601.

The fifth transfer mode RFST

On Fig shows the procedure of choice SKI according to the fifth variant of the present invention. In particular, Fig presents a modification of the procedure of selection of SKI according to the third embodiment. On Fig the value of P represents the number of bits allocated for SKI, and M represents the maximum integer be expressed using P bits. That is, if P=2, then M=4. Further, N represents the number of encoded symbols is encoded using the parent code. For example, when the rate of the code R=1/5, and the length of the input data, L=100, the number of encoded symbols is encoded using the parent code will be N=L/R=500. In addition, Lsc is the size of subpackets, Fs represents the position of the starting character (or starting point) of each subpacket, a Ls represents the position of the last character (or the last point) each is about subpacket. NRESrepresents a variable, calculated by the given formula. In the following algorithm ‘[x]’ represents the maximum integer less than the value ‘x’. NCRrepresents the frequency of repetition of the entire code word containing N symbols. Meanwhile, the position of the last symbol Ls can be defined differently according to the used algorithm. For example, you can also use the method for determining the number of characters in accordance with this speed subcode, to perform successive repetition by comparing a certain number of characters N and to determine the position of the last symbol Ls based on the number of remaining characters, as is done in the above way serial transmission.

Contact Fig, where in step 1701 generator subcode initializes SKY, setting it to zero (0) for the new package (PC) encoder. Further, the generator subcode initializes the starting point Fs and the last point Ls of subcode. SKY and the starting point Fs related ratios:

SPID=1:(N/M)

SPID=2:(2N/M)

SPID=3:(3N/M)

.

.

.

SPID=(M-1):(M-1)(N/M)

In step 1703 generator subcode calculates the number of NRESthe remaining symbols by subtracting a certain starting point Fs of the number N of symbols of the code words. In step 1705 generator subcode determines greater than or equal to vacilando is the value of N RESthe remaining characters in length Lsc transmitted at the moment of subcode (or subacute). If the number nres of the remaining symbols is greater than or equal to the length Lsc of subcode, the generator subcode in step 1707 updates the last point Ls of subcode, assigning it the value of ‘Fs+Lsc-1’. After that, at step 1709 generator subcode sequentially transmits the encoded symbols from the starting point Fs to some of the last point Ls, and then proceeds to step 1715. Otherwise, if the number nres of the remaining symbols is less than the length Lsc of subcode, the generator subcode determines the last point Ls of subcode in a subsequent step 1711 and 1713 in accordance with equations (2) and (3).

After step 1707 or step 1713 generator subcode at step 1709 sequentially transmits characters from the starting point Fs to position (N-1)-ro symbol. Further, the generator subcode repeats all N symbols NCRtimes before passing. Finally, the generator subcode transmits symbols from the position of the 0-th symbol to the position of Ls-th symbol, and then proceeds to step 1715. After the transmission symbols assigned to subcode generator subcode in step 1715 selects a starting point Fs of the defined identifiers SKI. Here the generator subcode chooses as a starting point Fs of the next subpacket non-zero then the ku of the number of points relevant SKI (or Fs)is equal to or closest to the last point Ls of the previous subpacket (or subcode). That is, the generator subcode excludes from resubmit SKI allocated for the initial transmission. At step 1717 generator subcode determines whether the request for the next subpacket (or retransmission). Here the presence of the request for the next batch” means that there is a request for retransmission of the current batch encoder (PC)transmitted by the transmitter, due to the fact that the packet encoder is not accepted. Thus, this SKI should not be discarded, but should be linked to the next SKI. Therefore, if you have a request for transmission of the next subpacket, the generator subcode returns to step 1703, and repeats the above steps. Otherwise, if there is no request for transmission of the next subpacket, this means that SKY need to be reset. In this case, as passed at the moment the PC is successfully accepted, and therefore, there is a transfer request for a new PC, the generator subcode returns to step 1701.

As described above, the present invention minimizes the overlap of characters and perforation of characters between the subcodes in the formation codes CCD mode REST or mode RFST, thereby increasing system throughput.

Although this invention has been shown is about and described with reference to specific preferred implementation, specialists in the art it is obvious that it can be made various changes in form and detail, not beyond being and scope of the invention defined by the claims.

1. The transfer method of subcode defined speed subcode identical to or different from the speed code turbolader, in accordance with the conditions in the channel of quasicomplete of turbo code (CCTC)generated by turbocodes receiving the flow of information and working with the mentioned speed code, and the method includes:

segmentation of length N code CCTK on a predetermined number of segments, determining subcode packet identifiers (SCPI), the corresponding segmented segments, and setting one of SKI allocated for the initial transfer subcode;

calculate the number of remaining characters, represented as N-Fs, where N is the length CCTC, a Fs - position of the starting character of subcode CCD, which should be transferred;

determining the position of the last character of Ls subcode by counting from the first character position of the remaining characters in the number equal to the number of subcodes, which are to be transferred; and

serial transmission symbols subcode from the position of the start symbol Fs to the position of the last symbol Ls.

2. The method according to claim 1, distinguished by the different topics what further includes selecting, as the position of the starting character of subcode retransmission ID, SCPI nearest to the position of the last symbol Ls from among the identifiers of SKI except given SKI to respond to a request for retransmission to the transferred subcode.

3. The method according to claim 2, characterized in that the nearest SKI is SKI located at the position closest to the position of the last symbol Ls, from among the identifiers of SKI less than or equal to the position of the last symbol Ls from among the identifiers of SKY.

4. The method according to claim 1, characterized in that it further includes selecting, as the position of the starting character of subcode retransmission ID, SCPI nearest to the position of the last symbol Ls, from among the identifiers of SKI to respond to a request for retransmission to the transferred subcode.

5. The method according to claim 4, characterized in that the closest ID SKI is SKI located at the position closest to the position of the last symbol Ls from among the identifiers of SKI less than or equal to the position of the last symbol Ls from among the identifiers of SKY.

6. The method according to claim 1, wherein, if the remaining number of characters greater than or equal to the length of subcode, the position of the last symbol Ls update, presenting it in the form of Fs+Lsc-1, Lsc - length subcode.

7. SPO is about according to claim 1, wherein, if the number of remaining characters is less than the length of subcode, the position of the last symbol Ls is defined as the position represented in the form (Lsc-NRES) - NXNCR-1, where Lsc specifies the length of subcode, NRESspecifies the number of remaining characters, N specifies the length CCTC, a NCRspecifies the repetition rate defined for forming the code word length n

8. The transfer method of subcode defined speed subcode identical to or different from the speed code turbolader, in accordance with the conditions in the channel of quasicomplete of turbo code (CCTC)generated by turbocodes receiving the flow of information and working with the mentioned speed code, and the method includes:

calculate the number of remaining characters, represented as N-Fs, where N is the length of the code word CCD, a Fs - position of the starting character of subcode CCD, which should be transferred;

determining the position of the last character of Ls subcode by counting from the first character position of the remaining characters in the number equal to the number of subcodes, which are to be transferred; and

serial transmission symbols subcode from the position of the start symbol Fs to the position of the last symbol Ls.

9. The method according to claim 8, characterized in that it includes the selection of a position of the starting character is ubada retransmission, as (Ls+1)mod N, where Ls is the position of the last symbol, and N is the length CCTC to respond to a request for retransmission to the transferred subcode.

10. The method of claim 8, wherein, if the remaining number of characters greater than or equal to the length of subcode, the position of the last symbol Ls update, presenting it as Fx+Lsc-1, Lsc - length subcode.

11. The method of claim 8, wherein, if the number of remaining characters is less than the length of subcode, the position of the last symbol Ls is defined as the position represented in the form (Lsc-NRES) - NxNCR-1, where Lsc specifies the length of subcode, NRESspecifies the number of remaining characters, N specifies the length CCTC, a NCRspecifies the repetition rate defined for forming the code word length n

12. The transfer device subcode in the communication system, containing

turbocodes;

interleaver to interleave the stream of characters from turbolader; and

generator subcode for forming quasicomplete of turbo code (CCTC) by receiving the stream of characters after their alternation in the interleaver and transfer subcode defined by subcodes, equal or different from the speed code turbolader of CCTC;

moreover, the generator subcode includes

segmentation of length N code CCTK on a predetermined number of segments determined is giving subcode packet identifiers (SCPI), the corresponding segmented segments, and setting one of SKI allocated for the initial transfer subcode;

calculate the number of remaining characters, represented as N-Fs, where N is the length CCTC, a Fs - position of the starting character of subcode CCD, which should be transferred;

determining the position of the last character of Ls subcode by counting from the first character position of the remaining characters in the number equal to the number of subcodes, which are to be transferred; and

serial transmission symbols subcode from the position of the start symbol Fs to the position of the last symbol Ls.

13. The device according to item 12, characterized in that the generator subcode selects as the position of the starting character of subcode retransmissions, the identifier of SKI nearest to the position of the last symbol Ls from among the identifiers of SKI except given SKI to respond to a request for retransmission to the transferred subcode.

14. The device according to item 13, wherein the nearest SKI is SKI located at the position closest to the position of the last symbol Ls from among the identifiers of SKI less than or equal to the position of the last symbol Ls from among the identifiers of SKY.

15. The device according to item 12, characterized in that the generator subcode selects as the position of the starting character subcode the retransmission, identifier SKI that is closest to the position of the last symbol Ls from among the identifiers of SKI to respond to a request for retransmission to the transferred subcode.

16. The device according to item 15, wherein the nearest SKI is SKI located at the position closest to the position of the last symbol Ls from among the identifiers of SKI less than or equal to the position of the last symbol Ls from among the identifiers of SKY.

17. The device according to item 12, wherein, if the remaining number of characters greater than or equal to the length of subcode generator subcode updates the position of the last symbol Ls to a position represented as Fs+Lsc-1, where Fs is the starting position of character, a Lsc - length subcode.

18. The device according to item 12, wherein, if the number of remaining characters is less than the length of subcode generator subcode selects as the position of the last symbol Ls position, represented in the form (Lsc-NRES)-NxNCR-1, where Lsc specifies the length of subcode, NRESspecifies the number of remaining characters, N specifies the length CCTC, a NCRspecifies the repetition rate defined for forming the code word length n

19. The transfer device subcode in the communication system, containing:

turbocodes;

interleaver to interleave the stream of characters from turbolader; and

generator submodule formation quasicomplete of turbo code (CCTC) by receiving the stream of characters after their alternation in the interleaver and transfer subcode, defined subcodes, equal or different from the speed code turbolader of CCTC;

moreover, the generator subcode includes:

calculate the number of remaining characters, represented as N-Fs, where N is the length CCTC, and Fs - position of the starting character of subcode CCD, which should be transferred;

determining the position of the last character of Ls subcode by counting from the first character position of the remaining characters in the number equal to the number of subcodes, which are to be transferred; and

serial transmission symbols subcode from the position of the start symbol Fs to the position of the last symbol Ls.

20. The device according to claim 19, characterized in that the generator subcode selects the position of the starting character of subcode retransmission, represented as (Ls+1)mod N, where Ls is the position of the last symbol, and N is the length CCTC to respond to a request for retransmission to the transferred subcode.

21. The device according to claim 19, wherein, if the remaining number of characters greater than or equal to the length of subcode, the generator subcode updates the position of the last symbol Ls to a position represented as Fs+Lsc-1, where Fs is the starting position of character, a Lsc - length subcode.

22. The device according to claim 19, wherein, if the number of remaining characters is less than the length of subcode, the generator subcode chooses to the operation position of the last symbol Ls position, (Lsc-NRES)-NxNCR-1, where Lsc specifies the length of subcode, NRESspecifies the number of remaining characters, N specifies the length CCTC, a NCRspecifies the repetition rate defined for forming the code word length n

23. How to re-transfer subcode defined speed subcode identical to or different from the speed code turbolader, in accordance with the conditions in the channel of quasicomplete of turbo code (CCTC)generated by turbocodes receiving the flow of information and working with the mentioned speed code, and the method includes:

segmentation of length N code CCTK on a predetermined number of segments, determining subcode packet identifiers (SCPI), the corresponding segmented segments, and setting one of SKI allocated for the initial transfer subcode;

determining the number of characters subcode, which should be transferred;

the selection of Fs (position of the starting character of subcode)that minimizes the number of repeated characters by comparing each Fs, corresponding segmented segments previously transmitted symbols; and

transfer the number of characters subcode that must be transferred to the selected Fs.



 

Same patents:

The invention relates to a device and method for transmission and reception of the bit stream, through which the bitstream of video data stably transmitted through the effective use of two logical channels, when communication is established through logical channels during transmission of the bitstream of video data in a communication network

The invention relates to a wireless communication

The invention relates to telecommunications systems and methods for secure transmission of information, and more specifically to encoding for error correction in order to ensure the reliability of the transmitted information

FIELD: communication systems.

SUBSTANCE: method includes generating sets of sub-codes of quasi-additional turbo-codes with given encoding speeds, and given sub-codes are reorganized as a set of sub-codes with another encoding speed for use in next transfer of sub-code with given encoding speed.

EFFECT: higher efficiency.

9 cl, 13 dwg

FIELD: communications engineering; network remote measuring and control systems.

SUBSTANCE: proposed noise-immune cyclic code codec designed for data transfer without pre-phasing has on sending end code-word information section shaper incorporating shift-register memory elements, units for computing verifying parts of noise-immune code of code-word information section, and modulo two adder of code-word information section shaper; code-word synchronizing section shaper and modulo two adder of code-word synchronizing section; on receiving end it has binary filter incorporating binary-filter shift register memory elements, computing units for verifying parts of binary-filter noise-immune code, and binary-filter modulo two adder; shift register of code word information section; decoder; accumulator; error correction unit; unit for shaping synchronizing section of code word; and modulo two adder units.

EFFECT: enhanced speed of device.

1 cl, 1 dwg

FIELD: communications engineering; network remote measuring and control systems.

SUBSTANCE: proposed noise-immune cyclic code codec designed for data transfer without pre-phasing has on sending end code-word information section shaper incorporating shift-register memory elements, units for computing verifying parts of noise-immune code of code-word information section, and modulo two adder of code-word information section shaper; code-word synchronizing section shaper and modulo two adder of code-word synchronizing section; on receiving end it has binary filter incorporating binary-filter shift register memory elements, computing units for verifying parts of binary-filter noise-immune code, and binary-filter modulo two adder; shift register of code word information section; decoder; accumulator; error correction unit; unit for shaping synchronizing section of code word; and modulo two adder units.

EFFECT: enhanced speed of device.

1 cl, 1 dwg

FIELD: communications engineering.

SUBSTANCE: proposed device and method for mobile code-division multiple access communication system including device for transferring channel of backward-link transmission speed indicator afford generation of optimal code words ensuring optimal coding for all types of coding procedures from optimal type (24.1) up to optimal coding procedure 24.7 and supporting all optimal-coding devices.

EFFECT: optimized capacity.

74 cl, 21 dwg, 44 tbl

FIELD: Witterby algorithm applications.

SUBSTANCE: system has first memory element for storing metrics of basic states, multiplexer, capable of selection between first and second operating routes on basis of even and odd time step, adding/comparing/selecting mechanism, which calculates metrics of end states for each state metric. Second memory element, connected to adding/comparing/selecting mechanism and multiplexer is used for temporary storage of end states metrics. Multiplexer selects first operating route during even time steps and provides basic states metrics, extracted from first memory element, to said mechanism to form end state metrics. During odd cycles multiplexer picks second operating route for access to second memory element and use of previously calculated end state metrics as metrics of intermediate source states.

EFFECT: higher efficiency.

2 cl, 9 dwg

The invention relates to the field of radiocommunications, telecommunications and computing, and more particularly to methods and devices for data transmission in computer networks

The invention relates to the transmission of data to generate codes using turbocodes in the communication system based on retransmission

The invention relates to radio communications, in particular to the transmission of data in the system of the IMT 2000

FIELD: Witterby algorithm applications.

SUBSTANCE: system has first memory element for storing metrics of basic states, multiplexer, capable of selection between first and second operating routes on basis of even and odd time step, adding/comparing/selecting mechanism, which calculates metrics of end states for each state metric. Second memory element, connected to adding/comparing/selecting mechanism and multiplexer is used for temporary storage of end states metrics. Multiplexer selects first operating route during even time steps and provides basic states metrics, extracted from first memory element, to said mechanism to form end state metrics. During odd cycles multiplexer picks second operating route for access to second memory element and use of previously calculated end state metrics as metrics of intermediate source states.

EFFECT: higher efficiency.

2 cl, 9 dwg

FIELD: communications engineering.

SUBSTANCE: proposed device and method for mobile code-division multiple access communication system including device for transferring channel of backward-link transmission speed indicator afford generation of optimal code words ensuring optimal coding for all types of coding procedures from optimal type (24.1) up to optimal coding procedure 24.7 and supporting all optimal-coding devices.

EFFECT: optimized capacity.

74 cl, 21 dwg, 44 tbl

FIELD: communications engineering; network remote measuring and control systems.

SUBSTANCE: proposed noise-immune cyclic code codec designed for data transfer without pre-phasing has on sending end code-word information section shaper incorporating shift-register memory elements, units for computing verifying parts of noise-immune code of code-word information section, and modulo two adder of code-word information section shaper; code-word synchronizing section shaper and modulo two adder of code-word synchronizing section; on receiving end it has binary filter incorporating binary-filter shift register memory elements, computing units for verifying parts of binary-filter noise-immune code, and binary-filter modulo two adder; shift register of code word information section; decoder; accumulator; error correction unit; unit for shaping synchronizing section of code word; and modulo two adder units.

EFFECT: enhanced speed of device.

1 cl, 1 dwg

FIELD: communications engineering; network remote measuring and control systems.

SUBSTANCE: proposed noise-immune cyclic code codec designed for data transfer without pre-phasing has on sending end code-word information section shaper incorporating shift-register memory elements, units for computing verifying parts of noise-immune code of code-word information section, and modulo two adder of code-word information section shaper; code-word synchronizing section shaper and modulo two adder of code-word synchronizing section; on receiving end it has binary filter incorporating binary-filter shift register memory elements, computing units for verifying parts of binary-filter noise-immune code, and binary-filter modulo two adder; shift register of code word information section; decoder; accumulator; error correction unit; unit for shaping synchronizing section of code word; and modulo two adder units.

EFFECT: enhanced speed of device.

1 cl, 1 dwg

FIELD: communication systems.

SUBSTANCE: method includes generating sets of sub-codes of quasi-additional turbo-codes with given encoding speeds, and given sub-codes are reorganized as a set of sub-codes with another encoding speed for use in next transfer of sub-code with given encoding speed.

EFFECT: higher efficiency.

9 cl, 13 dwg

FIELD: data transfer technologies.

SUBSTANCE: method includes segmentation of length N of quasi-complementary turbo-codes on preset amount of sections, determining identifiers of sub-code packets appropriate for segmented portions, setting of said packets separated for initial transfer of sub-code, calculation of number of remaining symbols in form N-Fs, where N - length of quasi-complementary turbo-codes, and Fs - position of start symbol of sub-code of quasi-complementary turbo-codes, determining position of symbol of remaining symbols in amount equal to sub-codes amount, which have to be sent and serial transfer of sub-code symbols from position of starting symbol Fs to position of last symbol Ls.

EFFECT: higher efficiency.

5 cl, 17 dwg

FIELD: communications engineering.

SUBSTANCE: method includes selecting one combination among given combinations, appropriate for several or every generated symbols of code word to transmit generated symbols of code word with length of sub-packet, determined in accordance to data transfer speed, information, appropriate for data transfer speed, is read, also based on length of sub-packet and chosen combination, from a table, wherein identification information, pointing at data transfer speed, sub-packet length and selected combination, is, is previously displayed for given information, and generated code word symbols are transmitted in accordance to read information and in accordance to selected combination.

EFFECT: possible check transmission of information by means of hybrid automatic repeat query for increasing carrying capacity during high-speed information transfer.

4 cl, 16 dwg, 6 tbl

Up!