# The apparatus and method of encoding/decoding indicator combination transport format in the mobile communication system mdcrc

The invention relates to radio communications, in particular to the transmission of data in the system of the IMT 2000. The technical result is to increase the speed of data transfer. In the encoding device ICTF bit generator produces a sequence with the same characters. Generator basic orthogonal sequence produces a set of basis orthogonal sequences. Generator basic sequences masks produces many basic sequences masks. The operation unit accepts bits ICTF, which are divided into the first data portion representing the transformation biorthogonol sequence, the second information part representing the transformation of the orthogonal sequence, and the third information part representing the transformation sequences masks, and combines orthogonal sequence selected from the basic orthogonal sequence based on the second information, biorthogonol sequence obtained by combining the selected orthogonal sequence with the same symbols, selected on the basis of the first information part, and the settlement of the parts, whereby creating a sequence ICTF. 7 C.p. f-crystals, 23 ill., 7 table.

The technical field to which the invention relates

The present invention relates in General to a device and method of information transfer in the system of the IMT 2000 (International mobile telecommunications 2000) and, in particular, the device and method of transmitting indicator combination transport format (ICTF).

System for mobile communications MDCRC (hereinafter called the system the IMT 2000) usually sends frames that provide voice service, transfer service, images, characters are transmitted over the physical channel of type dedicated physical data channel (VFTPD) on fixed or variable data rate. In the case when data frames, which include this kind of services are transmitted at a fixed data rate, there is no need to inform the receiving device relative to the speed of propagation of each frame of data. On the other hand, if data frames are transmitted at a variable data rate, which means that each frame of data has different data transfer speed, the transmitting device must inform the receiving and data. The data rate is proportional to the speed distribution of data, and speed data distribution is inversely proportional to the velocity of propagation in a typical system, the IMT 2000.

In the case of transfer formats data at a variable data rate region ICTV channel WFTPD informs the receiving device relative to the speed of data transfer of the current service of the frame. Region ICTF includes ICTF showing party information containing the data rate of the service frame. ICTF is information that helps securely maintain voice or data service.

In Fig.1A-1D show examples of applications ICTF. Fig.1A illustrates the use of ICTF to the line connection of the subscriber to the Central node WFTPD and the communication line of the subscriber to the Central node dedicated physical control channel (WFCU). Fig.1B illustrates the use of ICTF to the random access channel (cap). Fig.1C illustrates the use of ICTF to the line of the Central node with the subscriber WFTPD and the communication line of the Central node with the subscriber WFCU. Fig.1D illustrates the use of ICTF to the secondary shared physical control channel (VUFKU).

Considering Fig.1A-1D, note that one is t ICTF. Region ICTF includes N_{ICTF}bits and ICTF usually has 32 bits in the frame. To transfer a 32-bit ICTF in one frame, you can assign 2 bits ICTF each of the 16 plots (T_{Uch}=of 0.625 MS).

Fig.2 is a block diagram of a transmitting device of the base station in the General system of the IMT 2000.

As shown in Fig.2, the multipliers 211, 231 and 232 multiply the input signal by the gain G_{1}, G_{3}and G_{5}. The multipliers 221, 241 and 242 multiply keywords ICTF (code symbols ICTF) taken from the respective encoders ICTF, the gain G_{2}, G_{4}and G_{6}. The gain G_{1}-G_{6}can have different values in accordance with the types of services or situations of displacement of the call. The input signals include pilot signals and control signals power (SAR) data WFCU and WFTPD. The multiplexer 212 enters characters 32-bit code ICTF (keyword ICTF} received from the multiplier 221, in the field ICTF, as shown in Fig. 1C. The multiplexer 242 enters characters 32-bit code ICTF taken from the multiplier 241, in the field ICTF. The multiplexer 252 enters characters 32-bit code ICTF received from the multiplier 242, in the field ICTF. The introduction of the code symbols ICTF in ormation bits), which determine the data rate of the data signal on the corresponding data channel, the 1st, 2nd and 3rd series-parallel converters (SPT), 213, 233 and 234 are divided output signals of the multiplexers 212, 242 and 252 on the channel I and channel q Multipliers 214, 222 and 235-238 multiply the output signals of the converters SPT 213, 233 and 234 on codes_{K1}With_{K2}and C_{K3}forming channels. Codes forming channels are orthogonal codes. The first adder 215 adds the output signals of the multipliers 214, 235 and 237, and generates the signal of channel I, and the second adder 223 adds the output signals of the multipliers 222, 236 and 238, and generates a channel signal Q. the phase-shifting device 224 shifts the phase of the channel signal Q is received from the second adder 223, 90. The adder 216 adds the output signals of the first adder 215 and the phase-shifting device 224 and generates a complex signal I+jQ. The multiplier 217 scramblase complex signal with a complex psevdochumoy sequence_{scramb}assigned to the base station. The processor 218 of the signal (SPT) separates the scrambled signal on channel I and channel q low pass Filters (LPF) 219 and 225 limit bandwidth signal the output signals of the low-pass filter 219 and 225 through carriers cos(2f_{c}t) and sin(2f_{c}t), respectively, making converting the output signals of filters, low-pass filter 219 and 225 in HF (high frequency) band. The adder 227 adds the signals of the RF channel I and channel q

Fig.3 is a block diagram of the transmit side of the mobile station in the General system of the IMT 2000.

As shown in Fig.3, the multipliers 311, 321 and 323 multiply the appropriate signals on codes_{K1}With_{K2}and C_{K3}forming channels. Signals 1, 2, 3 are the first, second and third signals WFTPD. Input signal 4 includes a test signal and signals SAR, WFCU. Data bits ICTF are encoded in 32-bit code symbols ICTF by the encoder 309 ICTF. The multiplier 310 introduces 32-bit code symbols ICTF signal 4 as shown in Fig.1A. The multiplier 325 multiplies the signal WFCU, which includes the character code ICTF received from the multiplier 310, through the code With_{K4}forming channels. Codes_{K1}-C_{K4}forming channels are orthogonal codes. Characters 32-bit code ICTF get by coding information bits ICTF, which determine the data rate of signals WFTPD. The multipliers 312, 322, 324, and 326 multiply output signals to multiply
-G_{4}can have different meanings. The first adder 313 generates a signal of channel I by summing the output signals of the multipliers 312 and 322. The second adder 327 generates a channel signal Q by summing the output signals of the multipliers 324 and 326. The phase-shifting device 328 shifts the phase of the channel signal Q is received from the second adder 327, 90. The adder 314 adds the output signals of the first adder 313 and the phase-shifting device 328 and generates a complex signal I+jQ. The multiplier 315 scramblase complex signal with psevdochumoy (PN) sequence With_{scramb}assigned to the base station. SPT 329 divides scribbleboy signal on channel I and channel q LPF 316 and 330 filters the signal of channel I and channel Q taken from the SPT 329, and produce signals with limited frequency bands. Multipliers 317 and 331 multiply the output signals of the LPF 316 and 330 on the carriers cos(2f_{c}t) and sin(2f_{c}t), respectively, thereby converting the output signals of the LPF 316 and 330 in the HF bands. The adder 318 adds the high-frequency signal of channel I and channel q

ICTF are classified in the basic ICTF and advanced ICTF.

Basic ICTF is from 1 to 64 different investment bits ICTF, while advanced ICTF is from 1 to 128, from 1 to 256 1 to 512 or 1 to 1024 different types of information, using 7, 8, 9 or 10 information bits ICTF. Advanced ICTF was proposed to meet the system demand the IMT 2000 for a greater variety of services. Bits ICTF are important for a receiver in respect of the reception data frames received from the transmitting device. That is, the cause of unreliable transmission information bits ICTF is that transmission errors lead to wrong interpretation of personnel in the receiving device. Therefore, the transmitting device encodes the bits ICTF code with error correction before transmission so that the receiver can correct any generated errors ICTF.

Fig.4A schematically illustrates the basic structure of coding bits ICTF in a typical system, the IMT 2000, and Fig.4B is an example of a table of the encoding applied to biorthogonol the encoder shown in Fig.4A. As stated above, the base ICTF has 6 bits ICTF (hereinafter called basic bits ICTF) that show from 1 to 64 different information.

As shown in Fig.4A and 4B, biorthogonol encoder 402 receives the bits of the base ICTF and output which shall be expressed 6 bits. Therefore, when in biorthogonol encoder 402 serves bits base ICTF in the amount of less than 6 bits to the left end, that is, to SDR (senior binary bit) bits base ICTF add 0 and to increase the number of bits of the base ICTF to 6. Biorthogonol encoder 402 has a predetermined coding table, as shown in Fig. 4B, to output the 32 coded symbols for input 6 bits of the base ICTF. As shown in Fig. 4B, the coding table lists 32 (32-character) orthogonal keywords (c_{32.1}-c_{32.32}and 32 biorthogonol keywords (), which are additions keyword c_{32.1}-c_{32.32}. If MDR (Junior binary digit) is the basic ICTF is 1, biorthogonol encoder 402 selects from 32 biorthogonol keywords. If MDR is 0, biorthogonol encoder 402 selects from 32 orthogonal keywords. Then, on the basis of other bits ICTF choose one of the selected orthogonal keywords or biorthogonol keywords.

As stated above, the keyword ICTF must have the ability to correct errors. The possibility of error correction binary linear codes depends on the minimum rnany codes described in O. E. Brouwer and Tom Verhoeff "Adjusted table of limit values for the minimum distance of binary linear codes", proceedings of the IEEE transactions on information theory, vol 39, No. 2, March 1993 (hereafter referred to as reference 1).

Reference 1 gives the minimum distance 16 for binary linear codes, the amount by which displays 32 bits for input of 6 bits. Conclusion keywords ICTF of biorthogonol encoder 402 has a minimum distance of 16, which means that keywords ICTF are optimal codes.

Fig.5A schematically illustrates an extended coding structure bits ICTF in a typical system, the IMT 2000, Fig.5B represents the approximate allocation algorithm bits ICTF in the controller shown in Fig.5A, and Fig.5C illustrates an example of a table of the encoding applied to biorthogonol the encoders shown in Fig.5A. Advanced ICTF is also determined by the number of bits ICTF. That is, advanced ICTF includes 7, 8, 9, or 10 bits ICTF (hereinafter referred to as bits of the extended ICTF), which are from 1 to 128, from 1 to 256 1 to 512 or 1 to 1024 different types of information, as set out above.

As shown in Fig.5A, 5B and 5C, the controller 500 divides the bits ICTF into two halves. For example, to enter 10 bits of the extended ICTF controller 500 outputs the first half of the extended ICTF as the nom expressed by 10 bits. Therefore, in the case where bits are entered advanced ICTF in the amount of less than 10 bits, the controller adds 500 0-and SDR bits extended ICTF to represent advanced ICTF 10 bits. Then, the controller 500 divides the 10 bits of the extended ICTF word 1 and word 2. Word 1 and word 2 are served in biorthogonol encoders 502 and 504, respectively. The method of separation of the bits a_{1}-a_{10}advanced ICTF word 1 and word 2 is illustrated in Fig.5V.

Biorthogonol encoder 502 generates a first key word ICTF with 16 characters by encoding word 1, received from the controller 500. Biorthogonol encoder 504 generates the second key word ICTF with 16 characters by encoding word 2 received from the controller 500. Biorthogonol encoders 502 and 504 have a predefined code tables to output 16-character keyword ICTF for two 5-bit input signals ICTF (word 1 and word 2). Tentative coding table is illustrated in Fig.5S. As shown in Fig.5C, the coding table lists the 16 orthogonal keyword length 16 bits of C_{16.1}-C_{16.16}and biorthogonol keywordsthat are dopolneniya 16 biorthogonol keywords. If MDR is 0, biorthogonol encoder selects the 16 orthogonal keywords. Then biorthogonol encoder selects one of the selected orthogonal keywords or biorthogonol keywords on the basis of other bits ICTF and outputs the selected keyword as the first or second keyword ICTF.

The multiplexer 510 multiplexes the first and second keywords ICTF in the final 32-character keyword ICTF.

When receiving a 32-character keywords ICTF the receiving device decodes the keyword ICTF separate halves (word 1 and word 2) and gets 10-bit ICTF by combining two decoded 5-bit halves ICTF. In this situation, the possible error in a single decoded 5-bit output signal ICTP during decoding leads to the error on all 10 bits ICTF.

Advanced keyword ICTF must also have a strong possibility of correcting the error. For this extended keyword ICTF must have a minimum distance, as suggested in reference 1.

Given the number 10 bits of the extended ICTF and the number of 32 characters keywords ICTF, reference 1 gives 12 as the minimum distance to optimalisatie 8, because the error in at least one of word 1 and word 2 during decoding gives an error in full 10-bit ICTF. That is, although the bits of the extended ICTF are encoded separately by halves, the minimum distance between the end of key words ICTF equal to the minimum distance 8 between the output keywords biorthogonol encoders 502 and 504.

Therefore, the keyword ICTF passed from the structure of the encoding shown in Fig.5A, is not optimal, and it can increase the probability of error bits ICTF in the same configuration of the radio channel. When increasing the likelihood of errors in bits ICTF receiving device incorrectly estimates the data rate of received frames with an increased error rate, resulting in reducing the efficiency of the system the IMT 2000.

In accordance with the conventional technology requires a separate structure hardware to support basic ICTF and advanced ICTF. As a result, the implementation of the system of the IMT 2000 restricted as the cost and size of the system.

Therefore, the present invention is a device and method for encoding an extended ICTF in the system of the IMT 2000.

Savage ICTF and extended ICTF in the system of the IMT 2000.

Another objective of the present invention is to provide a device and method for decoding an extended ICTF in the system of the IMT 2000.

Another object of the present invention is to provide a device and method for joint decoding of the base ICTF and extended ICTF in the system of the IMT 2000.

Another object of the present invention is to provide a device and method for generating optimal code by coding the enhanced ICTF in the system of the IMT 2000.

Another objective of the present invention is the provision of a method of forming a sequence of masks for use in encoding/decoding the extended ICTF in the system of the IMT 2000.

To solve the above problems, a device and method for encoding/decoding ICTF in the mobile communication system MDCRC. In the encoding device ICTF, one-bit generator generates a sequence with the same characters. Generator basic orthogonal sequence to generate a set of basis orthogonal sequences. Generator basic sequences masks generated a lot of basic sequences masks. The operation unit accepts bits ICTF, Coti, 2nd information part representing the transformation of the orthogonal sequence, and the 3-d information part representing the sequence transformation masks, and combines orthogonal sequence selected from the basic orthogonal sequence, based on the 2nd of information biorthogonol sequence obtained by combining the selected orthogonal sequence with the same symbols, selected on the basis of the 1st information part, and a sequence of masks, selected on the basis of biorthogonol code sequence and 3rd information part, in consequence of which produces a sequence ICTF.

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

Fig.1A-1D illustrate an exemplary application of ICTP to channel frames in a typical system, the IMT 2000;

Fig.2 is a block diagram of a transmitting device of the base station in the conventional system the IMT 2000;

Fig.3 is a block diagram of a transmitting device of the mobile station in the conventional system the IMT 2000;

Fig.4A is tons of example code tables, used in biorthogonol the encoder shown in Fig.4A;

Fig.5A schematically illustrates the structure of the encoding of the extended ICTF in a typical system, the IMT 2000;

Fig.5B represents an example of the expansion algorithm bits ICTF in the controller shown in Fig.5A;

Fig.5C shows an example of the code tables used in biorthogonol the encoders shown in Fig.5A;

Fig.6 schematically illustrates the structure of the coding ICTF in the MMT system 2000 in accordance with the present invention; and

Fig.7 is a graphical chart of the program, illustrating a variant of the procedure of the formation sequence of masks for encoding ICTF in the MMT system 2000 in accordance with the present invention; and

Fig.8 is a block diagram of a variant of implementation of the encoder ICTF in the MMT system 2000 in accordance with the present invention; and

Fig.9 is a block diagram of a variant of implementation of the decoding device ICTF in the MMT system 2000 in accordance with the present invention; and

Fig.10 is a graphical diagram of a program illustrating the effect of the control comparator correlation shown in Fig. 9;

Fig.11 is a graphical diagram of a program illustrating varianttable graphic programs illustrating another variant of the procedure coding ICTF in the MMT system 2000 in accordance with the present invention; and

Fig.13 illustrates an implementation option structures orthogonal sequences and sequences masks defined ICTF in accordance with the present invention; and

Fig.14 is a block diagram of another variant implementation of the encoder ICTF in the MMT system 2000 in accordance with the present invention; and

Fig.15 is a block diagram of another embodiment of exercise device decoding ICTF in the MMT system 2000 in accordance with the present invention; and

Fig.16 is a graphical diagram of a program illustrating another variant of the procedure coding ICTF in the MMT system 2000 in accordance with the present invention; and

Fig.17 is a block diagram of a third variant of the implementation of the decoding device ICTF in the MMT system 2000 in accordance with the present invention.

Below will be described the preferred embodiments of the present invention with reference to the accompanying drawings. In the following description provides a detailed description of known functions or constructions, as they have shade would predlagaemoj end code (keywords ICTF) by adding the first code (the first keyword ICTF), the resulting bits of the first ICTF, and second code symbols (the second keyword ICTF), resulting from the second bits ICTF in the system of the IMT 2000. The concept of coding ICTF shown in Fig.6. Here biorthogonol sequence and consistency of the mask is given as the first keyword ICTF and second keywords ICTF, respectively.

As shown in Fig.6, bits ICTF divided into the first bits ICTF and second bits ICTF. Generator 602 sequences masks generates a predetermined sequence of masks by coding the second bit ICTF and generator 604 biorthogonol sequences generates a predetermined biorthogonol sequence by encoding the first bit ICTF. The adder 610 adds the sequence of masks and biorthogonol sequence, and outputs the resulting code symbols (keyword ICTF). Generator 602 sequences masks may have a coding table, which lists the sequence of masks for all possible second bits ICTF. Generator 604 biorthogonol sequences may also have the coding table, which lists biorthogonol posledovatelnoy defined sequence of masks and a method of generating a sequence of masks. For example, in embodiments implementing the present invention as orthogonal sequences are Walsh codes.

1. Method of generating sequences masks

The present invention relates to encoding and decoding bits ICTF and use advanced code, reed-Muller system, the IMT 2000. For this purpose, using the predefined sequence, and the sequence must have a minimum distance that ensures excellent perform error correction.

A significant parameter that identifies a characteristic or ability of a linear code with error correction, represents the minimum distance between the keywords code with error correction. The weight ratio of Hamming keywords is the number of characters other than 0. If the keyword is set to "0111", a weighting factor Hamming equal 3. The smallest weighting factor Hamming keywords, except for the keywords with all "0" is called the minimum weight and the minimum distance of binary linear code is the minimum weight ratio.

Linear code with error correction has the information given in the work "Theory of codes with error correction" F. j.MacWilliams and N. J.E. Sloan, North Holland (hereafter referred to as reference 2).

Extended code, a reed-Muller can be obtained from a set of sequences, each of which is the sum of the elements of the m-sequence and a predetermined sequence. To use a set of sequences as linear code with error correction, the set of sequences must have a large minimum distance. These sets of sequences include a set of sequences of the Kazi, the set of sequences of Gould and the set of Kerdock sequences. If the total length of the sequences in this set of sequences is L=2^{2m}then the minimum distance is (2^{2m}-2^{m})/2. For L=2^{2m+1}the minimum distance is (2^{2m+1}-2^{2m})/2. That is, if L=32, then the minimum distance is 12.

Below, description will be made of the method of manufacturing a linear code with error correction with excellent execution, i.e. extended code with error correction codes of the Walsh sequences and masks).

According to theory of encoding feature is the transpose columns to generate Walsh codes of m-sequences in the group, which was education is another m-sequence. In other words, each of the m-sequences generated by cyclic shift of the initial m-sequence specific number of times. Function transpose of the column is a conversion function that converts a sequence in the group of m-sequences in the Walsh codes. We assume that there is a sequence type sequence of Gould or sequence Kazi, which is formed by summing the initial m-sequences with different initial in-sequence. Another group of m-sequences is formed similarly by a cyclic shift of another initial m-sequence per unit ‘n’ times, where ‘n’ is the length of the predefined sequence. Subsequently applies the inverse function transpose column to the second group of m-sequences generated from different initial m-sequence. Applying the inverse function transpose column to the second group of m-sequences creates another set of sequences, which should be defined as a sequence of masks.

In the embodiment, the present invention describes a method of generating pic), using the set of sequences of Gould. Code (2^{n}n+k) represents the output signal of the 2^{n}-character keywords ICTF for input (n+k) bits ICTF (input information bits). It is known that the sequence of Gould can be expressed as the sum of two different m-sequences. Therefore, for generating code (2n+k), you must create a sequence of Gould length (2^{n}-1). Here the sequence of Gould is the sum of two m-sequences m_{1}(t) and m_{2}(t), which are produced from the generating polynomials f1(x) and f2(x). The data generating polynomials f1(x) and f2(x), m-sequence m_{1}(t) and m_{2}(t) is calculated using the function Slicktrace.

and

(Equation 1)

where a is determined by the initial value of m-sequences- the root of a polynomial, a n - order polynomial.

Fig.7 is a graphical chart of the program, illustrating the sequence of masks generating process for use in production code (2^{n}n+k) from a set of sequences of Gould.

As shown in Fig.7, at step 710 produced by m-posledovatelbno. At step 712, the calculated function(t) transposition sequence to form a code from a set of Walsh sequences with m-sequence formed by a cyclic shift of m_{2}(t) from 0 to n-2 times, where all columns ‘0’ is inserted in front of m-sequences, made of m_{2}(t), as shown below:

(Equation 2)

A set of 31 sequences generated by cyclic shift of the m-sequence m_{1}(t) from 0 to 30 times, transposed to columns using^{-l}(t)+2 obtained from the inverse functions(t), at step 730. Then add the 0-and at the beginning of each of the resulting sequences with the transpose columns to form a sequence length 2^{n}. Thus, the generated set of d_{i}(t) sequence (2^{n}-1) of length 2^{n}(i=0, ... , 2^{n}-2, t=1, ... , 2^{n}).

(Equation 3)

Many d_{i}(t) is the function of masks that can be used in the form of 31 mask.

d_{i}(t) is characterized by the fact that two different masks among the above masks are added to one of the (2^{n}at least two of the specific n masks, n masks called a basic sequence of masks. If you want to create code (2^{n}n+k), the total number of keywords is 2^{n+k}for n+k input information bits (bits ICTF). Number 2^{n}orthogonal sequences (sequences Walsh) and their amendments, that is, biorthogonol sequence, is 2^{n}^{}2=2^{n+l}. 2^{k-l}-1(=(2^{n+k}/2^{n+l})-1) masks, which is not 0-m required for production code (2^{n}n+k). Here, 2^{k-1}-1 masks can be expressed through the use of k-1 basic sequences masks, as set out above.

Now will be described how the choice of k-1 basic sequences masks. To create a set of sequences at step 730 of Fig.7 m-sequence_{1}(t) cyclically shift 0-2^{n-l}times. Here m is the sequence obtained by a cyclic shift of the m-sequence m_{1}(t) i times, is expressed by the value of Tr(^{i}^{t}according to equation 1. That is, the set of sequences generated by cyclic shift m-c="https://img.russianpatents.com/chr/945.gif">^{2n-2}}. Here, linearly independent k-1 basis elements found from the elements Galoise 1, a, ... ,^{2n-2}a sequence of masks corresponding output sequences of functions Slicktrace with k-1 basis elements as the initial sequence, steel base sequences masks. The condition of linear independence is expressed as follows:

_{1},... ,_{k-1}: linearly independent

c_{1}_{1}+c_{2}_{2}+... +c_{k-1}_{k-1}_{}0,c_{1}c_{2},... ,c_{k-1}

(Equation 4)

For a detailed description of the above-mentioned generalized method of production function of a mask will be described by way of code generation (32, 10) with reference to Fig.7, using the set of sequences of Gould. It is known that the sequence of Gould expressed as the sum of different predetermined m-sequence. Consequently, the first must be received sequence Gould length 31, with the purpose of education is scheduled code (32, 10). Consistently is sup>+x^{2}+1 and x^{5}+x^{4}+x+1. Corresponding generating polynomial for each of m-sequences m_{1}(t) and m_{2}(t) is calculated using the function Slicktrace

m_{1}(t)=Tg(A^{t}) t=0, 1, ... , 30 and

(Equation 5)

where a is determined by the initial value of m-sequencesis a root of the polynomial, a n - order polynomial is equal to 5.

Fig.7 illustrates the method of creating the function of the mask, with the purpose of education code (32, 10).

As shown in Fig.7, the m-sequence m_{1}(t) and m_{2}(t) are generated in accordance with equation 1, using generating polynomials fl(x) and f2(x), respectively, at step 710. At step 712 is calculated in function(t) is the transpose of the column, with the aim of creating a Walsh code m-sequence m_{2}(t) by the equation

(Equation 6)

Then a set of 31 sequences generated by cyclic shift of the m-sequence m_{1}(t) 0-30 times is the transpose of the column using^{-l}(t)+2 obtained from the inverse functions(t), at step 730. Then to the button to make the length of the sequence is equal to 31. Thus, a 31 d_{i}(t) of length 32. Here, if i=0, ... , 31, t=1, ... 32. The set of sequences formed in step 730, can be expressed by the equation

(Equation 7)

Many d_{i}(t), obtained in accordance with equation 7, can be used in the form of 31 sequences masks.

d_{i}(t) is characterized by the fact that two different masks among the above masks are added to one of the 31 masks, in addition to the two masks. In other words, each of the 31 mask can be expressed as the sum of 5 private masks. These 5 masks are the basic sequence of masks.

When it is necessary to form a code (32, 10), the total number of keywords is 2^{n}=1024 for all possible 10 input information bits (bits ICTF). The number biorthogonol sequences of length 32 is a 32 - 2=64. To education code (32, 10) to 15 masks. 15 masks can be expressed as a combination of 4 basic sequences masks.

Now will be described how the choice of 4 basic sequences masks, the m-sequence obtained by a cyclic shift of the m-sequence m_{1}(t) i times is expressed in the form Tr(1(t) 0-30 times relative to the initial sequence A={1,, ... ,^{2n-2}}. Here are 4 linearly independent basis element is found from the elements Galoise 1,, ... ,^{2n-2}and series of masks corresponding output sequences of functions Slicktrace with 4 basic elements as the initial sequence, becoming the base sequence of masks. The condition of linear independence is expressed as follows

,,,is linearly independent

c_{1}_{}+c_{2}_{}+c_{3}_{}+c_{4}_{}_{}0,c_{1}c_{2}c_{3}c_{4}(equation 8)

In fact, 1,,^{2},^{3}in the function Galoise GF(2^{5}are Podlasie polynomial, which are known in the form of four linearly independent elements. The way the easen masks.

M1 = 00101000011000111111000001110111

M2 = 00000001110011010110110111000111

M4 = 00001010111110010001101100101011

M8 = 00011100001101110010111101010001

Below is a description of the device and method of encoding/decoding ICTF, using the base sequence of masks obtained in the above way in the MMT system 2000 in accordance with the variants of implementation of the present invention.

2. The first version of the exercise device and method of encoding/decoding

Fig.8 and 9 are block diagrams of devices for encoding and decoding ICTF in the MMT system 2000 in accordance with the embodiment of the present invention.

As shown in Fig.8, 10 bits ICTF A0-A9 served on the appropriate multipliers 840-849. Bit generator 800 continuously generates a predefined code bits. That is, since the present invention deals with biorthogonol sequences are generated bits are required for the production of biorthogonol sequence of orthogonal sequences. For example, one-bit generator 800 generates a 1-s to inverse orthogonal sequence (i.e., Walsh code) created by the generator 810 basis Walsh code, and thus create biorthogonol Pasini. Basis Walsh codes refer to the codes Walsh, from which you can create all planned codes that can be performed by arbitrarily adding. For example, when using Walsh codes of length 32, basis Walsh codes are 1st, 2nd, 4th, 8th and 16th Walsh codes W1, W2, W4, W8 and W16, where:

W1: 01010101010101010101010101010101

W2: 00110011001100110011001100110011

W4: 00001111000011110000111100001111

W8: 00000000111111110000000011111111

W16: 00000000000000001111111111111111.

Generator 820 basic sequences masks generates the base sequence masks a predetermined length. The way to create the base sequence of masks already described above, and its detailed description will not operate. If you use the sequence mask length of 32, the base sequences of the masks are the 1-St, 2-nd, 4-th and 8-th sequence of masks M1, M2, M4, M8, where:

M1: 00101000011000111111000001110111

M2: 00000001110011010110110111000111

M4: 00001010111110010001101100101011

M8: 00011100001101110010111101010001.

The multiplier 840 unit multiplies the output signal of the one-bit generator 800 on the input information bit A0 in the character bits.

The multiplier 841 multiplies the basis Walsh code W1, taken from the generator 810 basis Walsh codes, the bit A1 of the input information. The multiplier 842 multiplies the basis Walsh code W2, prenata W4, taken from the generator 810 basis Walsh codes, bit A3 of the input information. The multiplier 844 multiplies the basis Walsh code W8 taken from the generator 810 basis Walsh codes, the bit A4 of the input information. The multiplier 845 multiplies the basis Walsh code W16 taken from the generator 810 basis Walsh codes, the bit A5 of the input information. Multipliers 841-845 character multiply accepted basis Walsh codes W1, W2, W4, W8 and W16 in their respective bits of the input information.

Meanwhile, the multiplier 846 multiplies the base sequence of the mask M1 on the bit A6 of the input information. The multiplier 847 multiplies the base sequence of the mask M2 on the bit A7 input information. The multiplier 848 multiplies the base sequence of the mask M4 bits A8 input information. The multiplier 849 multiplies the base sequence mask M8 on bits A9 input information. Multipliers 846-849 character multiply adopted the base sequence of masks M1, M2, M4 and M8 on their respective bits of the input information.

The adder 860 adds the coded bits of the input information received from the multipliers 840-849, and outputs the resulting coded symbols of length 32 bits (keyword ICTF). The length of the resulting code (keyword ICTF) is determined by the lengths of the basis of izdavaemyh generator 820 basic sequences masks.

For example, if bits A0-A9 input information are "0111011000", multiplier 840 multiplies 0, in the form A0, 1-s, taken from the one-bit generator 800, and generates the 32 coded symbols, which are all "0". The multiplier 841 multiplies 1 A1 W1, taken from the generator 810 basis Walsh code, and generates code symbols "01010101010101010101010101010101". The multiplier 842 multiplies 1 as A2 on W2, taken from the generator 810 basis Walsh code, and generates code symbols 00110011001100110011001100110011". The multiplier 843 1 multiplies in the form of A3 W4 taken from the generator 810 basis Walsh code, and generates code symbols 00001111000011110000111100001111". The multiplier 844 multiplies 0 as A4 on W8, taken from the generator 810 basis Walsh code, and generates the 32 coded symbols, which are all "0". The multiplier 845 multiplies 1 A5 W16 taken from the generator 810 basis Walsh code, and generates a "00000000000000001111111111111111". The multiplier 846 1 multiplies in the form of A6 on M1, adopted from generator 820 basic sequences masks, and generates a "00101000011000111111000001110111". The multiplier 847 multiplies 0 in 7 M2, adopted from generator 820 basic sequences masks,and generates the 32 coded symbols, which are all "0". The multiplier 848 multiplies 0 in the form A8 M4,are "0". The multiplier 849 multiplies 0 in the form A9 on the M8, adopted from generator 820 basic sequences masks, and generates the 32 coded symbols, which are all "0". The adder 860 adds the code symbols received from the multipliers 840-849, and outputs the resulting code symbols 01000001000010100110011011100001". The resulting code symbols can be obtained by one by adding the basis Walsh codes W1, W2, W4, and W16, relevant information bits "1", and the base sequence of the mask M1. In other words, the basis Walsh codes W1, W2, W4 and W16 are W23, and Walsh code W23 and the base sequence of the mask M1 formed with the purpose of education keywords ICTF (final code symbols) (=W23-M1), which is output from the adder 860. Fig.11 is a graphical chart of the program, illustrating a variant of the method of encoding ICTF in the MMT system 2000 in accordance with the present invention.

As shown in Fig.11, in step 1100 accepted 10 bits of input information (i.e., bits ICTF), and the amount of variables and j are set to the initial value 0. The sum of the variable shows the resulting code symbols, and j indicates the number of the final code output after adding on a character basis. N is utilized to encode the bits of the input information. Step 1110 is performed to check whether all bits of the input character is encoded Walsh codes and sequences of masks.

If at step 1110 j is not equal to 32, it means that the bits of the input information is encoded not fully on all character codes are Walsh sequences masks, j-th symbols W1(j), W2(j), W4(j), W8(j) and W16(j) of the basis Walsh codes W1, W2, W4, W8 and W16, and at step 1120 j accept-s symbols M1(j), M2(j), M4(j) and M8(j) basic sequences masks M1, M2, M4 and M8. Then on the stage FROM the received symbols are multiplied by the bits of the input information on a character basis, and works of symbols are added. Amount is the sum of the variable.

Step 1130 can be expressed as follows:

Amount = A0 + a1W1(j) + a2W2(j) + a3W4(j) + a4W8(j) + a5W16(J) + a6M1(j) + a7M2(j) + a8M4(j) + a9M8(j)

(Equation 9)

As noted in equation 9, the bits of the input are multiplied by the corresponding symbols of the basis Walsh codes and the base sequence of masks, the works of symbols are summed, and the sum becomes prednaska j is incremented by 1, and then, the procedure returns to step 1110. Meanwhile, if j at stage 1110 is 32, the encoding procedure ends.

It is shown in Fig.8, the encoding device corresponding to a variant implementation of the present invention can provide enhanced ICTF, and basic ICTF. Encoders to provide an enhanced ICTF include an encoder (32, 10), coder (32, 9) and the encoder (32, 7).

Input 10 bits of input information coder (32, 10) displays a combination of 32 Walsh codes of length 32, 32 biorthogonol code is inverted relative to the Walsh codes, and 15 sequences masks. 32 Walsh code can be created from combinations of 5 basis Walsh codes. 32 biorthogonol code can be obtained by adding 1 to 32 characters each Walsh code. This result has the same effect as multiplying -1 to 32 Walsh code, visible as a real number. 15 sequence of masks can be obtained by combinations of the 5 basic sequences masks. Therefore, the encoder (32, 10) you can create a total number of 1024 keywords.

Coder (32, 9) takes 9 bits of the input information and outputs a combination of 32 Walsh codes of length 32, 32 biorthogonol codes inverse of the Walsh codes, and 4 sequence the positions of the masks.

Coder (32, 7) receives 7 bits of the input information and outputs a combination of 32 Walsh codes of length of the order of 1024 keywords, 32 biorthogonol codes inverse of the Walsh codes, and one of the 4 basic sequences masks.

The above encoders to provide enhanced ICTF have a minimum distance of 12 and can be performed by blocking the input and output of at least 4 basic sequences masks produced by the generator 820 basic sequences masks.

That is, the encoder (32, 9) can be performed by blocking the input and output of one of the four basic sequences masks produced by the generator 820 basic sequences masks shown in Fig.8. Coder (32, 8) can be implemented by blocking the input and output of two of the basic sequences of the masks produced by the generator 820 basic sequences masks. Coder (32, 7) can be implemented by blocking the input and output of three of the basic sequences of the masks produced by the generator 820 basic sequences masks. As described above, the encoding device corresponding to a variant implementation of the present invention may coderivatives the number of bits ICTF, to be transmitted, and maximizes the minimum distance, which is determined by the characteristics of the encoder.

Keywords of the above-described device encoding represent the sequence obtained by combining the 32 Walsh codes of length 32, 32 biorthogonol codes resulting from adding units to the Walsh codes, and 15 sequences masks of length 15. The structure of the keywords shown in Fig.13.

For a better understanding of the procedures of coding bits ICTF, in tables 1a-1f are listed code symbols (keywords ICTF) depending on 10 bits ICTF.

The decoding device according to the embodiment of the present invention will be described with reference to Fig.9. The input signal r(t) is 15 multipliers 902-906 and calculator 920 correlation. The input signal r(t) is encoded predetermined Walsh code and a predetermined sequence of masks in the sending unit. Generator 910 sequences masks generates all possible 15 sequences masks M1-M15. Multipliers 902-906 multiply sequence of masks obtained from the generator 910 sequences masks, the input signal r(t). The multiplier 902 multiplies the input signal r(t) at a sequence of masks M1, adopted from the generator 910 sequences masks. The multiplier 904 multiplies the input signal r(t) into a sequence of mask M2, adopted from the generator 910 sequences masks. The multiplier 906 multiplies the input signal r(t) into a sequence of mask M15 adopted from the generator 910 series the Askey, one of the output signals of the multipliers 902-906 is free from the sequence of masks, and this means that the sequence mask has no effect on the correlation calculated by one of the calculators correlation. For example, if the sending device uses the sequence mask M2 for encoding bits ICTF output signal of the multiplier 904, which multiplies the sequence mask M2 on the input signal r(t), is free from a sequence of masks. Free from the sequence mask signal represents bits ICTF encoded predetermined Walsh code. Calculators 920-926 correlation computes the correlation of the input signal r(t) and output signals of the multipliers 902-906 64 biorthogonol codes. 64 biorthogonol code were defined before. Calculator 920 correlation computes the correlation values of the input signal r(t) for 64 biorthogonol codes of length 32, selects the maximum correlation value of the 64 correlations, and outputs the selected correlation value, where index biorthogonol code corresponds to the selected correlation value, and its unique index "0000" - comparator 940 correlation.

Calculator 922 correlation computes the correlation values and outputs the selected correlation value, index biorthogonol code corresponding to the selected correlation, and its unique index "0001" to the comparator 940 correlation. Calculator 924 correlation computes the correlation values of the output signal of the multiplier 904 64 biorthogonol codes, selects the maximum of the 64 correlation values and outputs the selected correlation value, index biorthogonol code corresponding to the selected correlation value, and its unique index "0010" to the comparator 940 correlation. Other calculators correlation (not shown) calculates the correlation values of the output signals of the respective multipliers 64 biorthogonol codes and work like the above calculators correlation, respectively.

And finally, calculator 926 correlation computes the correlation values of the output signal of the multiplier 906 64 biorthogonol codes, selects the maximum value of 64 correlations, and outputs the selected correlation value, index biorthogonol code corresponding to the selected correlation value, and its unique index "1111" to the comparator 940 correlation.

Unique indexes calculators 920-926 correlation are the same as the indices of the sequences masks, multiplied by the input signal r (the index of the mask, assigned to the case when the sequence mask is not used.

As shown in table 2, the calculator 922 correlation, which receives the signal, which is the product of the input signal r(t) and the sequence of masks M1, displays "0001" as its index. Calculator 926 correlation, which receives the signal representing the product of the input signal

r(t) and the sequence mask M15, displays "1111" as its index. Calculator 920 correlation, which accepts only the input signal r(t) outputs "0000" as its index.

Meanwhile, indexes biorthogonol code is expressed in binary code. For example, if the correlation forthat is in addition to the value of W4, is the greatest correlation value corresponding to the index biorthogonol code (A0-A9) is "001001".

The comparator 940 correlation 16 compares the maximum of the correlation values received from calculators 920-926 correlation, selects the highest correlation value of the 16 received the maximum of the correlation values, and outputs the bits ICTF on the basis of the index biorthogonol code and index sequence mask (unique index) taken from medeleni by combining index biorthogonol code and index sequence mask. For example, if the index sequence of masks is the index of the M4 (0100), and the index biorthogonol code is the index of the(001001), bits (A9-A0) ICTF are "index (0100) M4 + index (001001). That is, bits (A9-A0) ICTF are 0100001001".

Assuming that transmitted by the transmitting device code symbols corresponding to bits ICTF (A0-A9) "1011000010", we can say that the transmitting device encodes the bits ICTP valuesand M4 according to the above procedure coding. The receiving device may determine that the input signal r(t) is encoded by a sequence of mask M4 by multiplying the input signal r(t) for all sequences masks, and that the input signal r(t) is encoded by a sequence ofby calculating the correlations of the input signal r(t) for all biorthogonol codes. Based on the above example, the fifth correlation calculator (not shown) displays the largest value of the correlation index(101100) and its unique index (0010). Then the receiving device outputs the decoded bits ICTF (A0-A9) "1011000010" posredstvu decoding the input signal r(t) is processed in parallel according to the number of sequences masks. It may be further assumed that the input signal r(t), is multiplied by a sequence of masks, and the correlation works consistently calculated in another embodiment, the decoding device.

Fig.17 illustrates another variant of implementation of the decoding device.

Considering Fig.17, note that the memory 1720 remembers the input 32-character signal r(t). Generator 1710 sequences masks 16 generates sequences of the masks that were used in the transmitting device, and sequentially writes. The multiplier 1730 multiplies one of the 16 sequences masks obtained from the generator 1710 sequences masks, the input signal r(t) taken from the memory 1720. Calculator 1740 correlation calculates the output signal of the multiplier 1730 64 biorthogonol codes of length 32, and outputs the maximum correlation value and the index biorthogonol code corresponding to the largest correlation value, the comparator 1750 correlation. The comparator 1750 correlation remembers the maximum correlation value and the index biorthogonol code taken from the calculator 1740 correlation, and the index sequence masks taken from the generator 1710 posledovatelnostei signal r(t) to the multiplier 1730. The multiplier 1730 multiplies the input signal r(t) on one of the other sequences masks. Calculator 1740 correlation computes the correlation of the output signal of the multiplier 1730 64 biorthogonol codes of length 32, and outputs the maximum correlation value and the index biorthogonol code corresponding to the maximum correlation value. The comparator 1750 correlation memorizes the maximum value of the correlation index biorthogonol code that corresponds to the maximum correlation value, and the index sequence masks taken from the generator 1710 sequences masks.

The above procedure is performed on all 16 sequences masks produced by the generator 1710 sequence of masks. Then, 16 maximum values of the correlation index biorthogonol codes corresponding to the maximum correlation value, stored in the comparator 1750 correlation. The comparator 1750 correlation compares the memorized 16 the correlation values and selects one with the highest correlation, and outputs the bits ICTF through a combination of indexes biorthogonol code and the index sequence of the mask corresponding to the selected maximum correlation value. When decoded is l r(t+1).

Although the comparator 1750 correlation simultaneously 16 compares the maximum of the correlation values in the decoding device of Fig.17, it is possible to compare the correlation values in real-time. That is, the first input to the maximum correlation value is compared with the next input maximum correlation value and remember the greater of the two values of the correlation and the index sequence of the mask and the index biorthogonol code corresponding to the correlation. Then the third input maximum correlation is compared with the stored correlation and remembered most of the two correlations, and the index sequence of the mask and the index biorthogonol code corresponding to the selected correlation. This comparison/action occurs 15 times, which corresponds to a sequence of masks produced by the generator 1710 sequence of masks. At the completion of all operations comparator 1750 correlation outputs finally remembered biorthogonol index (A0-A6) and the index sequence mask (A7-A9) and displays additional bits as bits ICTF.

In Fig.10 shows a graphical diagram of a program illustrating the operation of the comparator 940 correlation shown in fiè the correlation value of 16 and maximum of the correlation values, and outputs the bits ICTF based indexes biorthogonol code and sequence mask, the corresponding selected the largest correlation value. Sixteen of the correlation values are compared, and the bits ICTF are derived indexes biorthogonol code and the sequence of masks corresponding to the largest correlation value.

As shown in Fig.10, the maximum correlation index i is set to 1, and the indices of the maximum correlation values, biorthogonol code and subject to verification sequence mask set at step 1000 0-I. At step 1010, the comparator 940 correlation takes 1 second maximum correlation value, 1st index biorthogonol code and 1-th index sequence mask from the calculator 920 correlation. Phase comparator 1020 940 correlation compares the 1-th maximum correlation with the previous maximum correlation value. If 1-th maximum correlation is greater than the previous maximum correlation, the procedure goes to step 1030. If 1-th maximum correlation is equal to or less than the previous maximum correlation, the procedure goes to step 1040. At step 1030, the comparator 940 correlation denotes the 1-th maximum correlation as the final maximum correlation and remembers the index of the 1st of biorthogonalization mask. At step 1040, the comparator 940 correlation compares the index i with a number 16 of correlation calculators to determine whether conducted a full comparison of all 16 maximum correlations. If i is not equal to 16, then at step 1060, the index i is incremented by 1, and the procedure returns to step 1010. Then the above procedure is repeated.

At step 1050, the comparator 940 correlation lists the indexes biorthogonol code and consistency of the mask that correspond to the total maximum correlation, as the decoded bits. Index biorthogonol code and the index sequence of the mask corresponding to the decoded bits are indices corresponding to the final maximum correlation among the 16 maximum of the correlation values obtained from the 16 calculators correlation.

3. The second option exercise device and method of encoding/decoding

Encoder ICTF (32, 10) that outputs a 32-character keyword ICTF in the form of 16 sectors described in the first embodiment of the present invention. In the present specification standard IMT-2000 detects the presence of 15 sites in one shot. Therefore, the second option is the implementation of the present invention relates to encoder (30, 10) is tvline the present invention provides a device and a coding method for deducing 30 code by removing two characters in the 32 coded symbols (keyword), produced by the encoder (32, 10) ICTF.

The encoder corresponding to the first and second variants of implementation of the present invention have the same configuration, except for the sequences output from the one-bit generator, generator basis Walsh code generator basic sequences masks. Device for encoding outputs coded symbols of length 30 with remote symbol # 0 (1st character) and symbol No. 16 (17-th symbol in the encoding device of the second variant implementation.

As shown in Fig.8, 10 input information bits A0-A9 are fed to the inputs 840-849. Bit generator 800 displays the symbols of units (length 32) on the multiplier 840. The multiplier 840 multiplies the bit A0 of the input information for each of up to 32 characters taken from the one-bit generator 800. Generator 810 basis Walsh code simultaneously generates the basis Walsh codes W1, W2, W4, W8 and W16 long 32. The multiplier 841 multiplies the input information bit A1 on the basis Walsh code W1 "01010101010101010101010101010101". The multiplier 842 multiplies the input information bit A2 on the basis Walsh code W2 "00110011001100110011001100110011". The multiplier 843 multiplies the input information bit A3 on the basis Walsh code W4 "00001111000011110000111100001111". The multiplier 844 multiplies rmational bit A5 on the basis Walsh code W16 "00000000000000001111111111111111".

Generator 820 basic sequences masks simultaneously produces the base sequence of masks M1, M2, M4 and M8 long 32. The multiplier 846 multiplies the input information bit and 6 on the base sequence of the mask M1 "00101000011000111111000001110111". The multiplier 847 multiplies the input information bit A7 on the base sequence of the mask M2 "00000001110011010110110111000111". The multiplier 848 multiplies the input information bit A8 of the underlying sequence mask M4 "00001010111110010001101100101011". The multiplier 849 multiplies the input information bit A9 of the underlying sequence mask M8 "00011100001101110010111101010001". Multipliers 840 849 operate like switches that control the outcome or picking bits of bit generator, each of the basis Walsh code and each of the base sequence of the mask.

The adder 860 performs character-wise summation of the output signals of the multipliers 840-849 and output signals 32 coded symbols (i.e., keyword ICTF). From the 32 coded symbols will be deleted two characters in predetermined locations (i.e., removes the symbol # 0 (first character) and the symbol No. 16 (17-th symbol of the output signal of the adder 860). The remaining 30 characters 30 characters who nerator 800, the basic generator 810 Walsh, basic generator 820 sequences masks can generate 30 characters, excluded characters No. 0 and No. 16. Then the adder 860 adds the output signal of the one-bit generator 800, the base generator 810 Walsh and basic generator 820 sequences masks on bit basis, and outputs the 30 coded symbols as symbols ICTF.

Fig.12 represents the encoding for the second variant implementation of the present invention. Graphical layout program illustrates the stages of the encoder according to the second variant of implementation of the present invention, when the number of lots is 15.

As shown in Fig.12, in step 1200 accepted 10 input information bits A0-A9, and the amount of variables and j are set to the initial value 0. At step 1210 is determined, the value is j 30-and. If at step 1210 j is not equal to 30, then at step 1220 j accept-s symbols W1(j), W2(j), W4(j), W8(j) and W16(j) of the basis Walsh codes W1, W2, W4, W8 and W16 (each of which has two remote bits) and j-th symbols M1(j), M2(j), M4(j) and M8(j) basic sequences M1, M2, M4 and M8 masks (each of which has two remote bits). Then the received symbols are multiplied by a character based on the input integnty the j-th code symbol, at step 1250 j is incremented by 1, and then the procedure returns to step 1210. Meanwhile, if j at stage 1210 equal to 30, the encoding procedure ends.

Encoder (30, 10) displays 1024 keywords, is equivalent keywords encoder (32, 10) with remote characters No. 0 and No. 16. Hence, the total amount of information can be expressed by the value 1024.

The output signal of the encoder (30, 9) is a combination of 32 Walsh codes of length 30, obtained by removing characters No. 0 and No. 16 of each of the 32 Walsh codes of length 32, 32 biorthogonol codes obtained by adding 1 to each symbol Walsh codes with the removal (by multiplying -1 to each symbol in the case of real numbers), and 8 sequences masks obtained by combining any three of the four basic sequences masks with destruction.

The output signal of the encoder (30, 8) represents the merging of 32 Walsh codes of length 30, obtained by removing characters No. 0 and No. 16 in each of the 32 Walsh codes of length 32 characters 32 biorthogonol codes obtained by adding 1 to each symbol Walsh codes with the removal (by multiplying -1 to each symbol in the case of real numbers), and 4 sequences masks, marching signal encoder (30, 7) represents combinations of 32 Walsh codes of length 30, obtained by removing characters No. 0 and No. 16 in each of the 32 Walsh codes of length 32 characters 32 biorthogonol codes obtained by adding 1 to each symbol Walsh codes with the removal (by multiplying -1 to each symbol in the case of real numbers), and one of the four basic sequences masks with destruction.

All of the above encoders to provide an enhanced ICTF have a minimum distance equal to 10. Coders(30, 9), (30, 8) and (30, 7) can be implemented by blocking the input and output of at least one of the four basic sequences of masks created by the generator 820 basic sequences masks shown in Fig.8.

The above encoders flexibly encode bits ICTF according to the number of bits ICTF and have a maximized minimum distance, which determines the performance of the encoding.

The decoding device according to the second variant of implementation of the present invention has the same configuration and operates as a decoding device of the first variant of implementation, except for the different lengths of the signals encoded characters. That is, after encoding (32, 10) udalyayte and the base sequence of masks with two remote symbols to generate the 30 coded symbols. Therefore, with the exception of a received signal r(t), which includes the signal of the 30 coded symbols, and the introduction of dummy signals in remote locations, all steps of decoding the same with the description of the first variant implementation of the present invention.

As shown in Fig.17, this second variant implementation of the decoding can also be performed through a single multiplier for multiplying masks with r(t) and a correlation calculator for calculating the correlation values biorthogonol codes.

4. A third option exercise device and method of encoding/decoding

Third alternative implementation of the present invention provides an encoding device for blocking the output signal of the one-bit generator in the encoder(30, 7), (30, 8), (30, 9) or (30, 10) (in the future we Express it (30, 7-10)) of the second variant of realization and production of a different sequence of masks, instead of how to set the minimum distance 11. Coders belong to the encoder that outputs a 30-character keyword ICTF to enter 7, 8, 9, or 10 bits ICTF.

Fig.14 is a block diagram of a third variant of the implementation of the encoder for encoding ICTF in the system of the Finance of the third variant of the implementation structure similar to the device of the second variant implementation, except that in the encoding device corresponding to the third variant of implementation of the present invention, additionally provided with a generator 1480 sequences masks for the production of the base sequence of masks M16 and switch 1470 to turn off the generator 1480 sequence of masks and the bit generator 1400 for multiplier 1440.

The basic sequence of masks with two remote bits M1, M2, M4, M8, and M16 used in Fig.14, are

M1=000001011111000010110100111110

M2=000110001100110001111010110111

M4=010111100111101010000001100111

M8=011011001000001111011100001111

M16=100100011110011111000101010011

As shown in Fig.14, when using the encoder (30, 6), switch 1470 connects the bit generator 1400 to the multiplier 1440 and blocks all of the base sequence of masks generated by the generator 1480 basic sequences masks. The multiplier 1440 character multiplies the symbols of the one-bit generator 1400 with a bit A0 of the input information.

If an encoder is used (30, 7-10), the switch 1470 connects the generator 1480 sequences masks to the multiplier 1440 and selectively uses four base sequence of masks generated by the generator 1420 basic sequences masks. In this is the capacity of masks.

The structure and action of the output code symbols as bits of the input data A0-A9, using multipliers 1440-1449, are the same as in the first and second versions of the implementation. Therefore, their description will be omitted.

As stated above, the switch 1470 connects the generator 1480 sequences masks to the multiplier 1440 to use the encoder (30, 7-10), while the switch 1470 connects the bit generator 1400 to the multiplier 1440 to use the encoder (30, 6).

To enter the 6 information bits encoder (30, 6) displays 30-character keyword by combining 32 Walsh codes of length 30 32 biorthogonol codes obtained by inversion of Walsh codes using one-bit generator 1400.

To enter the 10 information bits encoder (30, 10) displays a 30-character keyword by combining 32 Walsh codes of length 30 and 32 sequences masks created using five basic sequences masks. Here are five basic sequences masks are M1, M2, M4, M8, and M16, as set out above, and the base sequence of masks M16 derived from the generator 1480 sequence of masks, which is added to the encoder agostinetti by the encoder (30, 10). Encoder (30, 9) displays 30-character keyword by combining 32 Walsh codes and 16 sequences masks for input 9 data bits. 16 sequences masks are obtained by combining four of the five basic sequences masks. Encoder (30, 8) displays a 30-character keyword by combining 32 Walsh codes and 8 sequences masks for input 8 data bits. 8 sequences masks are obtained by combining three of the five basic sequences masks. To enter the 7 information bits encoder (30, 7) displays a 30-character keyword by combining 32 Walsh codes of length 30 and four sequences masks. Four sequences masks are obtained by combining two of the five basic sequences masks.

All of the above encoders (30, 7-10) have a minimum distance of 11 to provide extended ICTF. Coders (32, 7-10) can be performed by controlling the use of at least one of the five basic sequences masks produced by the generator 1420 basic sequences masks, and generator 1480 sequences masks shown in the ry-coding ICTF in the MMT system 2000 in accordance with the present invention.

As shown in Fig.16, accepted 10 information bits (bits ICTF) A0-A9, and the amount of variables and j are at the stage of 1600 on the initial values 0-I. the sum of the variable shows the output of the final code after adding the basic characters, and the variable j indicates the number of the final code symbols after the addition of the basic symbol. At step 1610 is determined whether j length 30, 30 codes are Walsh sequences and masks with remote symbols used for encoding.

The purpose of the execution of step 1610 is evaluated, coded whether the bits of the input information relative to 30 characters each Walsh code and 30 characters each sequence of masks.

If at step 1610 j is not equal to 30, and this implies that the encoding is not completed with respect to all of the character codes of the Walsh sequences and masks, at step 1620 j accept-s symbols W1(j), W2(j), W4(j), W8(j) and W16(j) of the basis Walsh codes W1, W2, W4, W8 and W16 and j-th symbols M1(j), M2(j), M4(j), M8(j) and M16(j) basic sequences masks M1, M2, M4, M8, and M16. At step 1630, the bits of the input character are multiplied by the received symbols and sum the products of characters.

Step 1630 can be expressed in this form:

Amount = a0W8(j) + a5W16(J) + a6M1(j) + a7M2(j) + a8M4(j) + a9M8(j) (Equation 10)

As can be seen from Equation 10, the assigned code symbol is obtained by multiplying each bit of the input information on the characters of the corresponding basis Walsh code or the base sequence of masks and summing the products.

At step 1640 is displayed amount, showing the j-th code symbol. At step 1650 j is incremented by 1, and then the procedure returns to step 1610. Meanwhile, if j at step 1610 is 30, the encoding procedure ends.

Now will be described the third variant of the implementation of the decoding device with reference to Fig.15. The input signal r(t), which includes the signal 30 coded symbols transmitted by the transmitting device, and two fictitious characters that were introduced at the locations where the encoder deleted characters, serves on 31 multiplier 1502-1506 and calculator 1520 correlation. Generator 1500 sequences masks produces all possible 31 sequence of masks M1-M31 length 32. Multipliers 1502-1506 multiply sequence of masks taken from generatorname certain sequence of masks, one of the outputs of the multipliers 1502-1506 is free from the sequence of masks, and this means that the sequence of the mask does not affect the following calculator correlation. For example, if the sending device uses the sequence mask M31 to encode bits ICTF, the output of multiplier 1506, which multiplies the sequence mask M31 on the input signal r(t), is free from a sequence of masks. However, if the transmitting device does not use a sequence of masks, himself the input signal r(t) supplied to the calculator 1520 correlation, is free from the sequence of the mask signal. Each of the calculators correlation 1520-1526 calculates the correlation value of the output signals of the multipliers 1502-1506 64 biorthogonol codes of length 32, determines the maximum value of the correlation set with 64 correlations, and outputs the determined maximum correlation values, where the indices of each biorthogonol code correspond to the determined maximum correlation values, and each index sequences masks - comparator 1540 correlation, respectively.

The comparator 1540 correlation 32 compares the maximum correlation values received from to the creation of the maximum correlation. Then the comparator 1540 correlation outputs the decoded bits ICTF transmitted by the transmitting device based on the index biorthogonol code and the sequence of masks corresponding to a finite maximum value of the correlation. As shown in Fig.17, a third alternative implementation of the present invention can also be implemented by a single multiplier for multiplying the masks on r(t) and only the correlation calculator for calculating the correlation values biorthogonol codes.

As described above, the present invention provides an apparatus and method for encoding and decoding variable base ICTF and extended ICTF so that simplified hardware. Another advantage is that support coding scheme with error correction and main ICTF and extended ICTF increases the stability of the service. In addition, the minimum distance, i.e. the factor that determines the characteristic of the encoder, is large enough to satisfy the system demand MMT 2000, ensuring excellent execution.

Although the invention is illustrated and described with regard to certain preferred his variana forms and details, without going beyond the nature and scope of the present invention, as defined in the attached claims.

Claims

1. Device for encoding indicator combination transport format (ICTF) in the mobile communication system mdcr, comprising a generator (810) orthogonal sequences to produce a variety of basic biorthogonol sequences, in accordance with the first part of data bits, the generator sequences masks (820) to generate the set of basic sequences of the mask in accordance with the second part of data bits, and an adder (860) to summarize the basic biorthogonol sequences and base sequences of the masks produced by the generator orthogonal sequence generator sequence of masks.

2. Device for encoding ICTF under item 1, wherein a set of basic biorthogonol sequences are a first Walsh code, a second Walsh code, a fourth Walsh code, the eighth code Walsh, sixteenth Walsh code and a sequence of "all 1", in which Walsh codes are the basis Walsh codes from which all other implied codes is 2, in which the generator sequences masks prisposobene to produce a first m-sequence and a second m-sequence put together to form a code Gould further adapted to generate the first group of sequences generated by cyclic shift of the second m-sequence, further adapted to generate and apply the function transpose column to sequences in the first group to convert the sequences in the first group in the orthogonal sequence, further adapted to insert a column to “0” in front of the sequences in the second group, and further adapted to generate and apply the inverse function transpose column to sequences in the second group to convert the sequences in the second group in the sequence of masks.

4. Device for encoding ICTF according to any one of paragraphs.1-3, containing the set of first multipliers (840-845) for multiplying the basic biorthogonol sequences on the first part of the information bits, the set of second multipliers (846-849) for multiplying the basic sequences of the masks on the second part of the information bits, and an adder adapted Sammie adapted to produce at the output 30-character sequence in which the symbols No. 0 and No. 16 exclude from 32-character codes Walsh, “01010101010101010101010101010101”, “00110011001100110011001100110011”, “00001111000011110000111100001111”, “00000000111111110000000011111111”, “00000000000000001111111111111111”, “11111111111111111111111111111111”.

6. Device for encoding ICTF according to any one of paragraphs.1-5, which is adapted to produce at the output 30-character sequences in which the characters No. 0 and No. 16 exclude from 32-character basic sequences masks, “00101000011000111111000001110111”, “00000001110011010110110111000111”, “00001010111110010001101100101011”, “00011100001101110010111101010001”.

7. Device for encoding ICTF according to any one of paragraphs.1-4, which is adapted to produce at the output 30-character sequence in which the characters No. 0 and No. 16 is excluded from the sequence obtained by summing the basic biorthogonol sequences and base sequences masks.

8. Device for encoding ICTF under item 7, in which the basic biorthogonol sequences are“01010101010101010101010101010101”, “00110011001100110011001100110011”, “00001111000011110000111100001111”, “00000000111111110000000011111111”, “00000000000000001111111111111111”, and in which the base sequences of the masks are“00101000011000111111000001110111”, “00000001110011010110110111000111”, “00001010111110010001101100101011”, “00011100001101110010111101010001”.

**Same patents:**

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

FIELD: communications engineering; simulating digital communication channels with separate and grouping errors.

SUBSTANCE: proposed method includes evaluation of set of communication channel states S_{0},S_{1}, ..., S_{m - 1} and calculation of conditional error probabilities P(e/s) in each state s" i = 0, ..., m - 1 of communication channel, and error acquisition in communication channel in compliance with conditional error probability for current state of communication channel; in the process probability of error-free interval p(0^{i}) of i bits is found, and conditional probabilities p(0^{i}1/11), p(0^{i}1/01) of error-free intervals of i bits are calculated with respect to them basing on probabilities p(0^{i}) and using recurrent rules during each current time interval and preceding one on condition that for error generation use is made of two states of communication channel corresponding to combination of errors 11 or 01; random number p uniformly distributed within interval between 0 and 1 is generated; conditional probabilities p(0^{i}1/11), p(0^{i}1/01) are summed up starting from i = 0 resulting in sequence 0^{k}1 that constitutes bit-by-bit stream of communication channel errors.

EFFECT: enhanced speed.

1 cl, 1 tbl