Transmission with increasing redundancy for numerous parallel channels in communication system with many inputs and many outputs (mimo)

FIELD: information technologies.

SUBSTANCE: transmitter handles (for example, codes, parts, alternates and modulates) each package of data for each parallel channel, being grounded on the velocity chosen for the parallel channel, and gains numerous blocks of figures for a package. For each package of data the transmitter transmits one block of figures for once on the parallel channel until the receiver will not recover a package, or all blocks will not be transmitted yet. The receiver carries out detection and gains the blocks of figures transmitted on parallel channels. The receiver recovers the packages of data transmitted on parallel channels is independent or in the appointed order. The receiver handles (for example, demodulates, deinterlaces, carries out the recurring integration and decodes) all blocks of figures gained for each package of data, and gives out the decoded package. The receiver can estimate and kill the noises caused by recovered packages of data so packages of data recovered later can reach higher signal-noise-jamming ratio (SNJR).

EFFECT: maintenance of transmission with accruing redundancy on numerous parallel channels.

63 cl, 17 dwg, 2 tbl

 

This application claims the priority of provisional application U.S. No. 60/501 776, entitled "H-ARQ for MIMO Systems with Successive Interference Cancellation" (Hybrid automatic request for repetition (GASP) for systems with MVPS and successive interference), filed September 9, 2003, and application U.S. No. 60/531 393, entitled "Incremental Redundancy Transmission for Multiple Parallel Channels in a MIMO Communication System" (Transfer with increasing redundancy for multiple parallel channels in the communication system with MVPS), filed on December 19, 2003, the assignee of which is the assignee of the present application.and are included in this application by reference in its entirety for all purposes.

The technical field to which the invention relates

The present invention relates generally to communications and, more specifically, to methods of data transfer over multiple parallel channels in the communication system with many inputs and many outputs (MVPS).

The level of technology

In a system with MVPS are numerous (NT) transmit antennas and multiple (NR) receive antennas for data transmission, and it is denoted as (NTNR-the system. Channel MVPS formedNTtransmitting andNRreceiving antennas may be decomposed intoNSspatial channels, whereN S≤ min {NT,NR}as described below.NSdata streams can be transmitted onNSspatial channels. System with MVPS can provide increased throughput, ifNSspatial channels created multiple transmitting and receiving antennas are used to transmit data.

The main problem in the system with MVPS is the selection of appropriate speeds for data transmission through a channel with MVPS based on the channel mode. "Speed" can specify a particular data rate or transmission rate of information bits, a particular coding scheme, a specific modulation scheme, a specific data packet, etc. Target speed selection consists in maximizing the total throughput byNSspatial channels at the same time satisfying certain requirements on the quality that can be measured by the target probability of error on the package (GPS) (e.g., 1% GPS) or some other measures.

The throughput of each spatial channel depends on the ratio of signal to total noise and interference (OSSP)achieved this spatial channel. OSSP forNSspatial channels depends on the channel mode and can also depend on how the sweat is key data restored in the receiver. In one conventional system with MVPS transmitter encodes, modulates and transmits each data stream in accordance with the speed selected on the basis of the model of the static channel with MVPS. Can achieve good performance if the model is accurate, and if the channel MVPS is relatively static (i.e. not much is changing in time). In another conventional system with MWMW the receiver estimates the channel MVPS, selects the appropriate speed for each spatial channel based on the estimated channel, and sends aNSthe selected speeds forNSspatial channels of the transmitter. The transmitter then processesNSdata flows in accordance with the selected speed and transmits these threads onNSspatial channels. Performance of this system depends on the nature channel with MVPS and the accuracy of the estimates of the channels.

For both conventional systems with MVPS described above, the transmitter processes and transmits each data packet for each spatial channel with a speed selected for that spatial channel. The receiver decodes each data packet received from each spatial channel, and determines whether the decoded packet or error. The receiver may send back an acknowledgement (PP), if the package decoderules the right, or otherwise receive (SPE), if the packet is decoded with error. The transmitter may retransmit each data packet is decoded with error receiver for receiving the GMP package.

Performance of both systems with MVPS described above, are highly dependent on the accuracy of the speed selection. If the selected speed for the spatial channels are too cautious (for example, because the actual OCSP significantly higher than the scores of OSSP), then excessive system resources are spent on the transmission of data packets, and the underutilization of bandwidth. Conversely, if the selected speed for the spatial channels too aggressive, then the data packets can be decoded with error receiver, and system resources can be used for retransmission of these packets. Select the speed for a system with MVPS is a problem because (1) greater complexity in the evaluation of the channel for a channel with MVPS, (2) time-varying and independent nature of the spatial channels, and (3) the relationship of multiple data streams that are transmitted over the spatial channels.

There is, therefore, the need for effective data transmission over multiple spatial channels in a system with MVPS that do not require precise speed selection to achieve the choir is our performance.

Disclosure of invention

This paper presents methods for performing transmission with incremental redundancy (NO) multiple (ND) parallel channels in the system with MVPS. These parallel channels may be formed (1) by the number of spatial channels in a system with MVPS, (2) in such a way that they achieved such ASSP, or (3) some other way. Initially, the receiver or transmitter in the system with MVPS estimates of OCSP forNDparallel channels and selectsNDspeeds for these parallel channels. OSSP can depend on various factors, such as the transmission scheme used by the transmitter, the processing performed by the receiver, and so on, the Transmitter is provided to the selected speed if the receiver performs the speed selection.

The transmitter processes (e.g., encodes, parts, punctuates and modulates each data packet for each parallel channel based on the speed selected for that channel, and receives numerous (NB) blocks of data symbols for the packet. The first block of data characters usually contains enough information to restore the receiver of the data packet under favorable channel mode. Each of the remaining blocks of character data contains more the redundancy allowing the receiver to recover the data packet when less favourable treatment channel. For each data packet transmitter transmits one block of data symbols at a time, until you have transferred all the blocks for the package. The transmitter in advance completes the transmission of the data packet, if the packet is restored (i.e., decoded) by the receiver with fewer than all of the blocks of character data.

The receiver performs detection ofNRsequences of received symbols and unit receives the detected symbols for each block of data symbols transmitted by the transmitter. Subsequent processing depends on whether the parallel channels are independent or interdependent.

NDparallel channels are independent, if the data transfer for each parallel channel is not dependent on data on other parallel channels. In this case, for each data packet in each parallel channel receiver processes (e.g., demodulates, departmeat, re-assemble and decode all blocks of the detected symbols obtained for the data packet, and outputs the decoded packet. The receiver can send back the PP, if the decoded packet is good, and SPE, if the decoded packet error. The receiver finishes processing the at for each data packet, which is recovered or if all of the blocks of data symbols were adopted for the package.

NDparallel channels are interdependent, if the data transfer for each parallel channel depends on data on other parallel channels. This is the case, if the receiver uses a processing method with successive interference (RFP) to obtain blocks of the detected symbols. Using the SPT, whenever a data packet is restored to the parallel channel interference that this package is called for has not yet received data packets for other parallel channels are estimated and are suppressed to perform detection with the aim of obtaining the detected symbols for these other data packets. OSSP for later recovered data packets, therefore, are higher, and higher speeds can be selected for these packages. The data packets are then reconstructed by a receiver in a specific order determined based on the selected velocities that can be obtained OSSP needed to restore these data packets.

For the scheme "orderly" transfer with the SPT, if the data packet on this parallel channelxrestored before the expected time, then only one of several options. In the United erwich, the transmitter may not transmit on the parallel channelxand to use most or all of the radiation power for data packets that have not yet been restored. Secondly, the transmitter may transmit a new "short" data package for parallel channelx. A short packet is expected to be restored at the moment should be restored the next batch of data, or in front of him. Thirdly, the transmitter may transmit a new "long" data package for parallel channelx. Long the service is expected to be restored after the time when he should be restored the next data packet. One of these options may be selected based on the metric, which compares the bandwidth packet transmission without packet on parallel channelxafter a premature termination.

For transmission schemes with SPT and "cyclic repeat, whenever a data packet is restored for the parallel channel, the transmitter transmits a new data packet on this parallel channel, and the receiver cyclically moves to the next parallel channel and tries to recover the data packet on the next parallel channel.

SPT and other transmission schemes are described below. Various aspects and embodiments of the invention also over the center are described below.

Brief description of drawings

Distinctive features and essence of the present invention will become more apparent from the detailed description set forth below considered in conjunction with the drawings, in which similar position determined in the same way on all drawings on which:

figure 1 depicts a block diagram of the transmitter and receiver in the system with MVPS, which implements the transfer, NOR for numerous (ND) parallel channels;

figure 2 depicts the process of performing transmission with NO parallel channels;

figure 3 illustrates the transmission of ANY data stream, one parallel channel;

figure 4 depicts the transmission scheme for a system of orthogonal frequency division channels (OCRC) MVPS;

figure 5 illustrates the transmission with NONDindependent parallel channels;

figa-6C illustrate a scheme of ordered transmission with the SPT with three different options for the premature termination of the data packet on one of the parallel channel;

7 depicts graphs GP for a Package 1b Package and 2A depending on the number of cycles of transmission for Packet 2A;

Fig depicts a state diagram for the circuit orderly transfer with the SPT;

figa and 9B illustrate a transmission scheme with the SPT and cyclic repetition;

figure 10 depicts a processor Yes the data transmission (TX) on the transmitter;

11 illustrates the processing of a single data packet by the transmitter;

Fig depicts the spatial processor TX and the transmitting node in the transmitter;

Fig depicts one implementation of the receiver.

Fig depicts the processor data reception (RX) receiver Fig; and

Fig depicts a receiver that implements the method of the SPT.

DETAILED DESCRIPTION

The word "model" in this document is used to mean "serving as an example, option, or illustration". Any variant of implementation or design described herein as "exemplary"is not necessarily to be construed as preferred or advantageous with respect to other embodiments or developments.

For a system with MVPSNDdata streams can be transmitted simultaneously byNDparallel channels, one stream of data for each parallel channel, whereND>1. Each parallel channel may correspond to a spatial channel or may be formed in some other way, as described below. Each data stream may be processed independently, based on the speed selected for that data stream, and transmitted by its parallel channel.

Figure 1 depicts a block diagram of a transmitter 110 and a receiver 150 in a system which EME 100 MVPS, which implements the transfer, or for multiple data streams on multiple parallel channels. In the transmitter 110, the processor 120 data TX takesNDdata flows from the source data 112. The processor 120 TX data processes (e.g., formats, encodes, parts, punctuates and modulates each data packet in each data stream in accordance with the rate selected for that data stream, and generatesNBblocks of data symbols for a package, whereNB>1 and may depend on the selected speed. Each block of data symbols can be transmitted in one time interval (or simply "interval"), which is a predefined period of time for the system 100 with MVPS. Speed is selected for each data stream may specify the data rate, coding scheme or encoding speed, modulation scheme, packet size, number of blocks of data symbols, etc. that are specified by different control signals issued by the controller 140. Speed is selected for each data stream may be static or continuously updated (e.g., based on the channel mode). For communication with ANY given stream of data blocks of data symbols for each data packet of the data stream is transmitted in one block at a time up until acket not be recovered by the receiver 150, or will not be passed on to all blocks.

The spatial processor 130 TX takesNDstreams of data symbols from processor 120 data TX. Each stream of data symbols comprises a set of blocks of data symbols for each data packet in the corresponding data stream. The spatial processor 130 TX performs processing (e.g., demultiplexing, spatial processing, and so on) for the transmission ofNDstreams of data characters fromNTtransmitting antennas. Can be implemented by different transmission schemes, as described below. Depending on the transmission scheme selected for use, toNDblocks of data symbols for toNDdata streams are transmitted simultaneously on up toNDparallel channels in any given interval. The spatial processor 130 TX also multiplexes pilot symbols used for channel estimation by the receiver 150, and generatesNTstreams of characters transmission to the transmitting node 132 (TMTR).

The transmitting node 132 receives and leads to a defined state (e.g., converts to analog form, transforms with increasing frequency, filters and amplifies)NTstreams of characters transmission to receiveNTmodulated signals. Each modulated signal is then passed from suitable the th transmitting antenna (not shown in figure 1) and the channel MVPS to the receiver 150. Channel MVPS distortsNTtransmitted signals in accordance with the characteristics of the channel with MVPS and additionally degrades the transmitted signals in additive white Gaussian noise and possibly interference from other transmitters.

In the receiver 150NTtransmitted signals, each of theNRreceiving antennas (not shown in figure 1), andNRreceived signals from theNRreceiving antennas are served at the receiving unit (RCVR) 154. The receiving node 154 results in a certain state, digitizes and performs pre-processing of each received signal to obtain a stream of received symbols. The receiving node 154 takes theNRstreams of received symbols (for data) on the spatial processor 160 RX and received pilot symbols (pilot signal) at the node 172 channel estimation. The spatial processor 160 RX processes (for example, detects, multiplexes, demuxes, etc.,)NRstreams of received symbols to obtainNDstreams of detected symbols, which are estimatesNDstreams of data symbols sent by transmitter 110.

The processor 170 data RX receives and processesNDstreams of detected symbols to obtainNDstreams decoded data, which represent the Wallpaper evaluation NDdata streams sent by transmitter 110. For each data packet of each data stream processor 170 data RX processes (e.g., demodulates, departmeat, re-assemble and decode all blocks of data characters received for the data packet in accordance with the selected speed, and outputs the decoded packet, which is an assessment of the data package. The processor 170 RX data also gives the status of each decoded packet that indicates whether the decoded packet or error.

Node 172 channel estimation processes the received pilot symbols and/or received data symbols to obtain estimates of the channel (for example, estimates of the gain channel and estimates of ASSP) forNDparallel channels. The selector 174 speed makes channel estimation and selects a speed for each of theNDparallel channels. The controller 180 receivesNDthe selected speed selector 174 speed and the status of the package from the processor 170 RX data and performs the Assembly of the feedback information to the transmitter 110. Feedback can include theNDthe selected speeds, PP and NPP for the decoded packets and other Information feedback is processed by the spatial processor 190 data TX, additionally, it presents the particular state of the sending node 192 and transmitted over the feedback channel to the transmitter 110.

In the transmitter 110, the signal(s)transmitted by the receiver 150, accepted and given in a particular state of the receiving node 146 and is further processed by the spatial processor 148 data RX to obtain feedback information sent by the receiver 150. The controller 140 receives feedback information, uses PP/NPP for transmission control with NO current data packets sent byNDparallel channels, and usesNDthe selected speed for the processing of new data packets to be parcel toNDparallel channels.

The controllers 140 and 180 control the operation of the transmitter 110 and receiver 150, respectively. Nodes 142 and 182 memory provides storage for program codes and data used by controller 140 and 180, respectively. Nodes 142 and 182 memory may be internal to controller 140 and 180, as shown in figure 1, or external to these controllers. The processing units are shown in figure 1, are described in detail below.

Figure 2 depicts the block diagram of the process flow 200 for performing transmission with NONDdata flow forNDparallel channels in the system with MVPS. Initially, the receiver estimates theNDparallel channels based on the pilot signal and/or data characters received from a transmitter and a receiver is a (step 210). The receiver selects a speed for each of theNDparallel channels based on the estimated channel, and sends aNDthe selected speed on the transmitter (step 212). The transmitter acceptsNDthe selected speeds and processes the data packets forNDdata flows in accordance withNDselected speeds to obtainNDstreams of data symbols (step 220). The transmitter can format, encrypt, split, interleave, and modulate each data packet of each data stream in accordance with the rate selected for that data stream to obtainNBblocks of data symbols for a data packet. The transmitter then transmits theNDstreams of data symbols byNDparallel channels (step 222). For example, the transmitter may transmit one block of data symbols at a time for each data packet of each data stream until, until you have transferred all the blocks of data characters or will not be accepted PP for the data packet. Various schemes may be used for transmission with NONDdata streams, as described below.

The receiver accepts theNDstreams of data symbols from a transmitter byNRreceiving antennas and processesNRstreams of received symbols to obtainN streams of detected symbols (step 230). The receiver then processes theNDstreams of detected symbols and restores the data packets transmitted by the transmitter (step 232). For each interval, the receiver can attempt to restore the current data packet is transmitted for each of theNDdata streams. For example, whenever you get a new block detected symbols for the data packet, the receiver can demodulate, departmeat, re-assemble and decode all blocks of the detected symbols adopted for this package, to obtain a decoded packet. The receiver also checks each decoded packet to determine whether the decoded (good) package or with error (erased) (step 232).

Feedback PP/NPP can be achieved in different ways. In one embodiment, the receiver sends NPP for each decoded packet, which erased, and the transmitter uses this feedback to send next block of data symbols are erased for the package. In another embodiment, the transmitter sends one block of data symbols at a time for each data packet until then, until it is made of PP for a package from the receiver (the receiver can send back and can not send back NPP). In Liu the om case, the receiver completes the processing for each packet of data that is restored, or if you have taken all the blocks of data symbols for the packet (step 234).

Figure 2 depicts a typical variant transmission NOR forNDdata flow forNDparallel channels. Transfer to or for multiple parallel channels can also be performed in other ways, and it is within the scope of the invention.

Figure 3 illustrates the transmission of ANY data stream (denoted as Streamione parallel channel (designated as Channeli). The receiver estimates the Channeliselects the speed of theri,1for Channelibased on the estimated channel, and sends the selected speed transmitter in the interval 0. The transmitter receives the selected speed, process the packet (Packet 1) data Flowiin accordance with the selected speed and transmits the first block (Block 1) character data Package 1 in interval 1. The receiver receives and processes Unit 1, determines that Packet 1 is decoded with error, and sends back NPP in the interval 2. The transmitter accepts NPP and transmits the second block (Block 2) character data Package 1 in the interval 3. The receiver receives the Unit 2 processes the Blocks 1 and 2, determines that Packet 1 is still decoded in error, and sends back GMP in in the Arvale 4. Transfer blocks and the response of RPE may be repeated any number of times. In the example shown in figure 3, the transmitter receives a GMP for theNX-1 character data and transmits the blockNX(BlockNXcharacter data Package 1 in the intervalmwhereNXless than or equal to the total number of blocks for the Package 1. The receiver receives the BlockNXhandles allNXblocks of data symbols are taken to Package 1, determines that the packet is decoded correctly, and sends back the PP in the intervalm+1. The receiver estimates the Channeliselects the speed of theri,2for the next data packet for Streamiand sends the selected speed transmitter in the intervalm+1. The transmitter accepts PP for theNXand completes the transmission of Packet 1. The transmitter also handles the following package (Package 2) data in accordance with the selected speedri,2and transmits the first block of data symbols for Package 2 in the intervalm+2. Processing in the transmitter and the receiver for Package 2 continues in the same way as described for the Package 1.

For the variant of implementation, shown in figure 3, there is a delay of one time interval for response PP/NPP from the receiver to transmit each block. To improve channel utilization can be passed numerous puck is s of data for each data stream interleaved manner. For example, one data packet can be transmitted at intervals with odd numbers, and another data packet can be transmitted at intervals with even numbers. More than two data packets can be interleaved, if the delay PP/NPP more than one interval.

NDparallel channels in the system with MVPS can be formed in various ways, as described below. In addition, depending on the processing performed at the receiver,NDparallel channels may be independent one from the other, or are interdependent. For independent parallel channels passing with or for each data stream may be independent of the transmission NOR for other data streams or considering it. For interdependent parallel transmission channels with NO for each data stream depends on the transmission with NO other data streams.

1. Transfer to or for multiple independent parallel channels

Various schemes may be used for the transmission ofNDdata streams simultaneously onNDparallel channels, whereND>1. Some exemplary transmission schemes are described below. For simplicity, the following description assumes panoramaweg channel with MVPS andNDNS=NTNR.

In the first transfer scheme od the n data stream is transmitted from each of the NTtransmitting antennas without any spatial processing at the transmitter. The model for this transmission scheme can be expressed as:

Ur.(1)

wheresrepresents a data vector {NT×1} withNTelements for character data;

rnspis a vector of receive {NR×1} withNRelements forNRthe received symbols obtained byNRreceiving antennas;

His a matrix of characteristics of the channel {NR×NT} for the channel with MVPS; and

nis a vector of additive white Gaussian noise (abgs).

VectorsincludesNTelements forNTtransmitting antennas, andNDthe elements are set equal toNDdata characters forNDdata streams, and the remainingNT-NDelements are set to zero. Vectornas expected, has zero mean and covariance matrixwhere σ2represents the noise variance, andIrepresents the identity matrix with ones on diagonally opposite corners of the and and zeros in all other places.

Due to scattering in the channel with MVPS,NDdata streams transmitted fromNTtransmitting antennas interfere with each other in the receiver. The data stream transmitted from the transmitting antenna can be taken allNRreceiving antennas with different amplitudes and phases. The received signal for each receiving antenna then includes each component of theNDdata streams.

The receiver can estimate the vectorsdata based on different schemes of spatial and space-time processing (i.e., "detection"). For example, the receiver can estimate the vectorsdata using the optimal detector, the addition (OS), detector according to the minimum mean square error (ISCED), a linear detector with a crossing of the zero (LB) (also referred to as the detector with the treatment of the correlation matrix of the channel (OCMC)), linear corrector according to ISCED, the corrector with decision feedback, or some other detector/corrector. Spatial processing for some of these detectors is described below.

Spatial processing for the detector system can be expressed as:

Ur. (2)

whereW mrcrepresents the characteristic of the detector OS, which is aWmrc=H;

is a vector {NT×1} forNTthe detected symbols from the OS detector; and

"N" denotes conjugate the result of transposition.

Spatial processing for a detector at ISCED can be expressed as:

Ur. (3)

whereWmmse=(HHH+ σ2I)-1Hfor a detector according to ISCED.

Spatial processing for a detector with a crossing of the zero can be expressed as:

Ur. (4)

whereWzf=H(HHH)-1for a detector with a crossing of the zero. For the first transmission schemes each spatial channel corresponds to the corresponding transmitting antenna.

In the second transfer scheme, one data stream is transmitted on each "own fashion channel MVPS. MatrixHthe characteristics of the channel can be decomposed using or decomposition on special values, or decomposition on the inherent values to obtain NSown fashion channel MVPS.NSown fashion channel MVPS orthogonal to each other, and improved performance may be achieved by transmitting multiple data streams using these own mod. Decomposition for special values of the matrixHthe characteristics of the channel can be expressed as:

H=UΣVHUr. (5)

whereUrepresents the identity matrix, {NR×NR} left eigenvectorsH;

Σis a diagonal matrix {NR×NT} special valuesH; and

Vrepresents the identity matrix, {NT×NT} right eigenvectorsH.

The identity matrix is characterized by the propertyMHM=I. Identity matrixVandUused for spatial processing by the transmitter and receiver, respectively, for the transmission ofNDdata flow forNSown fashion channel MVPS.

The transmitter performs spatial processing using matrixVas follows:

xsvd=VsUr. (6)

wherexsvdis a vector {NT×1} withNTelements forNTcharacter transmission sent fromNTtransmitting antennas. Vector reception then defined asrsvd=HVs+n. The receiver performs spatial processing using matrixUas follows:

Ur. (7)

For the second transmission schemes each spatial channel corresponds to a respective own fashion.NSown fashion can be viewed as orthogonal spatial channels obtained through decomposition.

For the first and second transmission schemesNDdata streams can reach different and possibly changing to a significant degree of OSSP "after processing" or "after detection, which represent OSSP achieved after the linear detection receiver (for example, using a detector according to ISCED, by forcing zero or optimal combination). Then require different speeds for data streams.

In the third transfer scheme is transferred to each of theNDflow data from the SEH NTcharacter transfer, so that all data streams have similar channel modes and achieve the same OSSP after treatment. Then you can use the same or similar speed toNDdata streams. For this scheme, the transmitter performs the matrix multiplication of the vectorsdata from the basic transfer matrix and a diagonal matrix as follows:

xtbm=MΛsUr. (8)

wherextbmis a vector {NT×1} withNTsymbols of the transmission ofNTtransmitting antennas;

Mrepresents the base matrix {NT×NT} transmission, which is the unit matrix; and

Λis a diagonal matrix {NT×NT}.

The basic matrixMtransmission makes it possible to send each data stream from allNTtransmitting antennas and additionally makes use of the full powerPanteach transmitting antenna for transmitting data. MatrixMcan be defined aswhereEis a matrix of Walsh-Hadamard transform. MatrixMalso op is adalats as whereFis a matrix of the discrete Fourier transform (DFT) with (m,n)-an element defined aswheremrepresents the index of the row, andnrepresents the column index for matrixFandm=1...NTandn=1...NT. Diagonal matrix withΛincludesNDnonzero elements on the diagonal and zeros in all other places. TheseNDnonzero elements can be used to assign different radiation powerNDthe data streams at the same time meeting the constraint on the total power radiationPantfor each transmitting antenna.

"Effective" characteristic of the channel seen by the receiver for the transmission schemes, equalHeff=HM. The receiver can estimate the vectorsdata using the detector/corrector OS, by ISCED level, with the crossing of the zero or some other, where the characteristic ofWdetector (which may beWmrc,WmmseorWzf) is calculated using a matrixHeffeffective characteristics of the channel instead of the matrixHthe characteristics of the channel. The third transmission scheme is described in detail in application for U.S. patent by assignment together is the use of No. 10/367 234, entitled "Rate Adaptive Transmission Scheme for MIMO Systems" (Scheme adaptive to the transmission speed for systems with MVPS), filed on February 14, 2003

The third scheme transfer can transfer any number of data streams simultaneously withNTtransmitting antennas (i.e., 1≤NDNS)allowsNDparallel channels to achieve similar OSSP after processing (which can simplify the operation of the receiver with the SPT) and additionally makes use of the same or different radiation power for data streams.

Methods of communicating with ANY described herein can be implemented in the system with MVPS and one carrier, which uses a single carrier for data transmission, and in the system with MVPS and with many carriers, which uses many carriers for data transmission. Many carriers can provide orthogonal frequency division multiplexing (OCRC), other modulation methods with many carriers or some other structures. OCRC effectively divides the total bandwidth of the system on numerous (NF) orthogonal subbands, which are also commonly referred to as tones, Bina or frequency channels. In OCRC each sub-band associated with the respective carrier, which may be modulated with data.

For a system with MVPS, which implements CRC (so that is, the system OCRC with MVPS),NDdata streams can be transmitted onNFsubrangesNTtransmitting antennas in different ways. For example, each data stream can be transmitted onNFthe sub-bands corresponding transmitting antenna. Alternatively, each data stream may be transmitted over multiple sub-bands and multiple transmitting antennas to achieve diversity in terms of frequency and spatial diversity.

In the fourth scheme to transmit each data stream is transmitted diagonally byNFthe sub-bands, and allNTtransmitting antennas. This scheme provides both diversity in frequency and space diversity for allNDdata streams that are transmitted simultaneously, and additionally reaches such OSSP after treatment forNDdata streams after the linear detection in the receiver.

Figure 4 shows a fourth transmission scheme for the case in which two streams (ND=2) data is transmitted in an exemplary system OCRC with MVPS with four transmitting antennas (NT=4) and 16 sub-bands (NF=16). For the first data stream the first four characters ofs1,1,s1,2,s1,3ands1,4data is transmitted in sub-bands 1, 2, 3, and 4, respectively, transmitting the antennas 1, 2, 3 and 4, respectively. The following four characterss1,5,s1,6,s1,7andsa 1.8data execute cycle and is transmitted in the sub-bands 5, 6, 7 and 8, respectively, the transmit antennas 1, 2, 3, and 4, respectively. For the second data stream, the first four characters ofs2,1,s2,2,s2,3ands2,4data is transmitted in sub-bands 1, 2, 3, and 4, respectively, transmitting antennas 3, 4, 1, and 2, respectively. The following four characterssthe 2.5,s2,6,s2,7ands2,8data execute cycle and is transmitted in the sub-bands 5, 6, 7 and 8, respectively, transmitting antennas 3, 4, 1, and 2, respectively. For the variant of implementation, shown in figure 4, not all sub-bands are used to transmit data, and unused sub-bands are filled with zero values signal. The multiplexing/demultiplexing can also be performed in other ways.

System for OCRC with MVPS spatial processing described above for the transmitter and receiver, can be performed for each subbandkfork=1...NFbased on the matrixH(k) characteristics of the channel for this subband.

For a system with MVPS that implements multiple access orthogonal frequency division channel is (MLOCR) (i.e. system MLOCR with MVPS), only a subset of theNFthe sub-bands may be available for data transmission for each receiver. The process described above for system OCRC with MVPS, can also be used for system MLOCR with MVPS, although only on the sub-bands available for data transmission. For example,NDdata streams for a given receiver can be transmitted diagonally through the available sub-bands (instead of allNFof sub-bands) andNTtransmitting antennas.

NDparallel channels may be formed in various ways in systems with MVPS systems and OCRC with MVPS. Four transmission schemes described above represent the four exemplary method of forming multiple parallel channels. Generally speaking, parallel channels may be formed using any combination of space, frequency and time.

In the following description of "transmission cycle" (or just "cycle") is a period of time covering the transfer of a block of data symbols by the transmitter and the transmission of the response signal PP/NPP for this block by the receiver. "F" indicates a negative outcome of the decoding by the receiver, and "S" indicates a favorable outcome decoding. For simplicity, interleaving multiple data packets for each data stream is not shown in the following the x timing charts.

Figure 5 illustrates the transmission with NONDdata flow forNDindependent parallel channels. As these parallel channels are independent, the receiver can recover each data stream independently and to issue a stream of feedback PP/NPP for this data flow. The transmitter sends a new block of data symbols for the current data packet of each data stream in each cycle.

In the example shown in figure 5, for stream 1 data is transmitted on the parallel channel 1 (Channel 1), the receiver met with unfavorable outcome ("F1a") decoding, when trying to restore the package 1A (Package 1A) data block 1 data characters in cycle 1, with adverse outcome decoding, when trying to restore the Package 1A with blocks 1 and 2 characters data in cycle 2, with adverse outcome decoding, when trying to restore the Package 1A with blocks 1, 2 and 3 characters of data in cycle 3, and with a favorable outcome (S1a") decoding, when trying to restore the Package 1A with blocks 1-4 character data in cycle 4. Then, the transmitter completes transmission of the Package 1A and starts the transmission of blocks of data symbols for another package 1b (Package 1b) data. The receiver attempts to recover Packet 1b whenever a new block of data symbols for the packet that meets the unfavorable outcome of the decoding in each of the cycles 5-8 and can correctly decode the Packet 1b with blocks 1-5 of data characters in a loop 9. The receiver processes each of the other data streams in a similar manner as shown in figure 5.

2. Transfer from ANY of numerous interdependent parallel channels

The receiver can handleNRstreams of received symbols using the method of the SPT, to obtainNDstreams of detected symbols. For the method of the SPT, which is a non-linear detection, the receiver initially performs detection ofNRstreams of received symbols (e.g., using a detector of the OS, for ISCED levels or by forcing zero) and receives one stream of the detected symbols. The receiver additionally handles (e.g., demodulates, performs deteremine and decodes) the flow of the detected symbols to obtain decoded data stream. Then, the receiver estimates the interference that causes the data stream to otherND-1 data streams, and suppresses the estimated interference inNRstreams of received symbols to obtainNRstreams of modified characters. The receiver then repeats the same processing onNRstreams of modified symbols to recover other data stream.

The receiver, therefore, handles theNRstreams of received symbols onNDsequential art is the penalties. For each stage, the receiver performs (1) the detection orNRstreams of received symbols, orNRstreams of modified characters from the previous stage to produce a single stream of detected symbols, (2) decodes the stream of the detected symbols to obtain a corresponding decoded data stream, and (3) evaluates and mitigates interference caused this thread to getNRstreams of modified characters to the next level. If the interference caused by each data stream can be accurately assessed and depressed that requires a restore without errors or with small errors of the data stream, then later recovered data streams experience less interference and can achieve great OSSP after treatment. Method SPT is described in detail in the patent application U.S. transfer of the right to joint use of No. 09/993 087, entitled "Multiple-Access Multiple-Input Multiple-Output (MIMO) Communication System (communication System with many inputs and many outputs (MVPS) and multistation access), filed November 6, 2001

For SPT method of OSSP after processing each data stream depends on (1) OSSP this thread with linear detection and without noise suppression, (2) specific degree to which you are restoring the data stream, and (3) interference caused vosstanavlivaemsya data streams. Thus, even ifNDdata streams can achieve similar OSSP after processing with linear detection (for example, using the detector according to ISCED, with the crossing of the zero or OS), these flows are likely to be different OSSP after processing with nonlinear detection using the method of the SPT. Generally speaking, OSSP after processing is gradually improving for data streams recovered in the later stages, as the suppressed interference from data streams, restored to previous levels. This, therefore, allows the use of higher speeds for later recovered data streams.

Method SPT introduces interdependence between data streams. In particular, the speed forNDdata streams are selected on the basis of OSSP after processing achieved by these data streams, which, in turn, depend on the order in which the recovered data streams. OSSP after processing each data stream assumes that all earlier data streams (i.e. those that are intended to restore to this flow data was successfully decoded and has been suppressed. The receiver is usually necessary to restoreNDdata flows in the designated order, and he normally can't restore the data flow until the eye will not be restored and will not complete suppression of all earlier data streams.

Various transmission schemes can be used for a system with MVPS with the receiver with the SPT. The following describes several exemplary transmission schemes. For simplicity, in the following description assumes that the two data streams (ND=2) is passed through two parallel channels. However, the following principles can be extended to any number of data streams.

A. Diagram of an orderly transfer with the SPT

In the scheme of orderly transfer with the SPTNDdata flows are restored to their appointed order. For example, the receiver can first restore the flow 1 data, then the next thread 2 data, etc., and the last threadNDdata. Assigned to the order may depend on the transmitted data streams. For example, adopted OSSP forNDdata streams are probably similar to the third and fourth transmission schemes described above. In this case, performance in the smallest degree affected by the order in which restoredNDdata streams, and may be selected in any order. Adopted by OSP forNDdata streams are probably different for the first transmission schemes described above. In this case, can be achieved best performance by restoring the first data stream with the largest is inatum of ASSP, then the data stream with the next most accepted of OCSP, etc., In any case, for the scheme orderly transfer with the SPT receiver tries to recover the threadidata only after will be suppressed interference from all the earlier threads from 1 toi-1 of data.

Initially, OSSP after treatment are assessed forNDdata streams based on (1) the adopted OSSP for data streams, for example, with equal capacities of radiation used for data streams, and (2) the appointed order of restoration of data streams. OSSP after processing the data stream recovered in stepl, SINRpd(l), can be expressed as

Ur. (9)

wherewlrepresents the characteristic of the detector for the stream recovered in stepland σ2represents the variance of the noise in the receiver. Descriptionwlthe detector is a single column characteristicsWldetector (e.g., OS, ISCED or forcing zero), derived for stagelbased on the matrixHlthe characteristics of the channel for this stage. MatrixHlobtained through the pressure ( l-1) columns in the original matrixHcorresponding to the data streams, has been restored to (l-1) the previous steps. Calculation of OSSP after processing is described in detail in the patent application U.S. transfer of the right to joint use of No. entitled "Successive Interference Cancellation Receiver Processing with Selection Diversity" (Processing receiver with successive interference with the diversity with the auto), filed on September 23, 2003

The speed is selected for each data stream based on its OCSP after treatment. There is no need to select the speed was accurate, as the data packet can be transmitted with a variable-speed transmission with NEITHER. Selected sizesNDdata packets to be transmitted forNDdata flow when data is selected speeds, so it is expected that all data packets will be recovered by the receiver with the same number of cycles (Nest), whereNestcan be determined, based on conservative estimates of OSSP after treatment. Transmission of each data packet may fail prematurely if the packet is restored to cycleNestand can grow over cycleNestif you want, until then, until it is recovered the package.

Figa-6C illustrate a scheme of ordered transmission with the SPT with three RA is personal options transfer to a premature termination of the packet data in one data stream. On figa-6P two new data package (Packages 1A and 2A) are transmitted in cycle 1 for streams 1 and 2 data on parallel channels 1 and 2 (Channels 1 and 2), respectively. If the Package 1A for stream 1 data is restored in a cyclethat is before the loopNestthen the purpose of this transmission schemes is to synchronize both data streams as quickly as possible without loss of spectral efficiency. Table 1 shows some of the available options, if the Package 1A is restored before the loopNest.

Table 1
OptionDescription
1Nothing to transmit on Channel 1 and use the radiation power for a Package 2A Channel 2 after recovery Package 1A, as shown in figa. This increases the likelihood of recovery Package 2A to cycleNest.
2To pass the new "short" packet data Channel 1, as shown in figv. A short packet has a length ofwhereand. Speed for short packet is selected based on the channel estimates obtained in the cycle.
To pass the new "long" data packet on Channel 1, as shown in figs. Long the package has a length ofwhere. This may delay the recovery Package 2A to cyclethat is a cycle, which is expected to restore long package.

Table 1and(similar toNest) represent the number of cycles during which it is expected the restoration of the short and long data packets, based on conservative estimates of OSSP after processing.

Can be used metric to select one of three options, shown in table 1, whenever it occurs prematurely. This metric may be determined based on the sum of the capacity, and is defined as follows:

Ur. (10)

whereRi(j,n) is the sum of the bandwidth predicted in the loopjfor flowidata afterncycles. The left side of the inequality in equation (10) represents the winning total throughput (ΔR1,longChannel with the new long service, transmitted on Channel 1. The right side of the inequality in equation (10) represents the decrease in total throughput (ΔR2,longChannel 2 due to the transfer of new long packet on Channel 1. A member of theR2(0,Nest) denotes the total throughput for Channel 2, if the Package 2A is restored in a cycleNestas foretold. Memberindicates the total bandwidth for Channel 2, if the transmission for Packet 2A extends to the cyclebecause the transmission of a long packet on Channel 1. The difference between these two States is the reduction of total bandwidth for Channel 2. New long package, thus, can be transmitted on Channel 1, if winning a total bandwidth for Channel 1 is greater decrease in both the total bandwidth for Channel 2 (i.e., Option 3 in table 1 may be chosen if the equation (10)).

Equation (10) assumes that you wantNestcycles to recover Packet 2A, even if the full power of the radiation used for the Package 2A, after the Package 1A was recovered in a cycle. This is a pessimistic assumption, since the probability of recovery of the Package 2A to cycleNestincreases the I, when high power radiation is used for Packet 2A after cycle. Equation (10) can be modified as follows:

Ur. (11)

whererepresents the predicted number of cycles required for recovery Package 2A with the whole power of the radiation used for the Package 2A after cyclewhere.

Figa depicts the transmission with NO zero transmission for premature termination (Option 1 in table 1). On figa two new data block is transmitted for Packages 1A and 2A on Channels 1 and 2 in each of cycles 1 to. For each cycle, the receiver tries to recover the Package 1A, based on all blocks of data symbols are taken to Package 1A, and does not attempt to recover Packet 2A (X2A"). The receiver meets with adverse outcome ("F1a") decoding for Package 1A in each of cycles 1 toand with a favorable outcome (S1a") decoding cyclethat is earlier than a cycleNest. The receiver then estimates and suppresses noise due to P is ketam 1A, attempts to recover Packet 2A and meets with adverse outcome ("F2a") decoding for Packet 2A.

For Option 1, the transmitter uses all of the radiation power for a Package 2A after the Package 1A was recovered. For each of the cycles withthe receiver attempts to recover Packet 2A, based on all blocks of data characters received for the Package 2A, and from blocks taken between cycles 1 towere removed noise from the Package 1A, and blocks taken between cycles withhave a higher radiation power. The receiver meets with adverse outcome ("F2a") decoding for Packet 2A in each of the cycles withand a favorable outcome (S2a") decoding cycle. In this example, the Package 2A is also being prematurely, i.e. before cycleNestbecause of the greater power of the radiation used for the Package 2A with cycleand forward. Two new package (1b and 2b) data subsequently transmitted on Channels 1 and 2, starting in cycle. The decoding process is repeated on these packages.

. For each cycle, the receiver tries to recover the Package 1A, and does not attempt to recover Packet 2A. The receiver meets with a favorable outcome (S1a") decoding for Package 1A in a cycle(which is earlier than a cycleNestevaluates and mitigates interference caused by the Package 1A, attempts to recover Packet 2A and meets with adverse outcome ("F2a") decoding for Packet 2A. New short Package 1b lengththen transmitted over Channel 1, starting in cycle. For each of the cycles withthe receiver attempts to recover Packet 1b, based on all blocks of data symbols are taken to Package 1b, and meets with a favorable outcome (S1b") decoding cycle. In this example, the Package 1b also be restored to a cycleNest. However, no data is transmitted on Channel 1 after cyclefor example, as a package with the smallest length cannot be completely transmitted on Channel 1 until cycleNest. The transmitter then uses all the power is there radiation for a Package 2A after as the Package 1b was restored.

For each of the cycles withthe receiver attempts to recover Packet 2A, based on all blocks of data characters received for the Package 2A, and from blocks taken between cycles 1 towere removed noise from the Package 1A of the blocks taken between cycles withwere removed noise from the Package 1b, and blocks taken after cyclehave a higher radiation power. The receiver meets with a favorable outcome (S2a") decoding for Packet 2A in a cycle, which in this example is before the loopNest. Two new data packet is then transmitted on Channels 1 and 2, starting in cycle.

Figs depicts the transfer or transmission of a long packet for premature termination (Option 3 in table 1). On figs two new data block is transmitted for Packages 1A and 2A on Channels 1 and 2 in each of cycles 1 to. When meeting with a favorable outcome (S1a") decoding for Package 1A in a cyclenew long Package 1b lengthis transmitted on Channel 1, start the th cycle . For each of the cycles withthe receiver attempts to recover Packet 1b, based on all blocks of data symbols are taken to Package 1b, and meets with a favorable outcome (S1b") decoding cyclethat is after cycleNest.

In a cyclethe receiver attempts to recover Packet 2A, based on all blocks of data characters received for the Package 2A, and interference removed from the Package 1A, and meets a poor outcome ("F2a") decoding. In a cyclethe receiver attempts to recover Packet 2A, based on all blocks of data characters received for the Package 2A, and from blocks taken between cycles 1 toremoved noise from the Package 1A, and from blocks taken between cycles withremoved noise from the Package 1b. The receiver meets with a favorable outcome (S2a") decoding for Packet 2A in a cycle. Two new data packet is then transmitted on Channels 1 and 2, starting in cycle.

Send a new long Package 1b Channel 1 can have an impact on the actual speed and the GPS, have achieved the successes for Channel 2. As noted above,Nestrepresents the number of cycles predicted to recover Packet 2A Channel 2 with suppressed interference from package(s) from Channel 1 and the target GPS. If long Package 1b Channel 1 is restored in a cyclethat is later than the cycleNestthen (1) the rate achieved for Channel 2, decreases withR2(0,Nest) toand (2) the GP for a Package 2A is lower than the target GP, as much redundancy was given for the Package 2A. Enhanced performance can be achieved through the transmission is completed for the Package 2A after some predetermined number of cycles (and use all of the radiation power for a Package 1b.

7 depicts a graph 710 GP for a Package 1b and schedule 712 GP for a Package 2A depending on the number of cycles () transmission for Packet 2A. Target UXO is achieved for the Package 2A, if it is passed inNestcycles (i.e.=Nest), as indicated by point 720. GP for Package 2A is gradually reduced below the target GP, when a longer Package 2A is transmitted moreNestcycles, as shown by the graph 712. Target UXO is achieved for a Package 1b, is if he is passed over cycles that occur in a cycleas indicated by the point 722. This implies that the Package 2A is transmitted during this time. GP for Package 1b is gradually reduced below the target GPS when it finishes earlier Package 2A, and all the radiation power is used to Package 1b, as shown by the graph 710. GP for Package 1b and 2A intersect in a cycle. If the transmission for Packet 2A terminates in a loopyou can achieve the same reliability for both Packages 1b and 2A, and also increases the likelihood of recovery Package 1b to cycle.

Alternatively, instead of the complete Packet 2A in a cyclecan use different radiation power for Packages 1b and 2A to achieve similar results. For example,can be selected based on the use of higher radiation power for a Package 1b and lower power radiation for a Package 2A for the duration of the Package 1b (i.e., cycles with), so the GP Package 1b and 2A are similar in a cycle. As another example, the radiation power for a Package 1b may gradually increase, and mo is the ability of radiation to Package 2A may gradually decrease after a cycle Nest. Different radiation power can be used for different data streams, using the third and fourth transmission scheme described above.

Table 2 shows some of the options available with the transmission of a long Packet 1b, which may be renewed per cycleNest.

Table 2
OptionDescription
AndIf the Package 1b is restored to the Package 2A, then we can choose any one of the options shown in table 1.
InTo complete the transfer of the Package 2A, after a predefined number of cycles(for example,=), expect recovery Package 1b, then attempt recovery Package 2A with suppressed Packages 1A and 1b.

Fig depicts an exemplary diagram 800 of States that can be supported by the transmitter and receiver scheme for orderly transfer with the SPT. Chart 800 of conditions includes the condition 810 synchronization state 820 transmission of the new packet and the state 830 zero transmission. In state 810 synchronization of two new package (1A and 2A) of data transmitted over Kamalam and 2, starting in the same cycle. As expected, these two packages will be restored forNestcycles, if the speed is accurate.

The state diagram transitions from state 810 synchronization in state 820 transmission of a new packet, if the Packet 1A Channel 1 is restored earlyNestcycles, and a new short or long package (Package 1b) data is transmitted on Channel 1. In state 820, the receiver attempts to recover Packet 1b Channel 1 and does not attempt to recover Packet 2A Channel 2, until it is restored Package 1b and will not be suppressed interference from the Package 1b. State diagram remains in state 820, if the Package 1b is not restored, or if the Package 1b restored, and a new package (the Package 1C) data is transmitted on Channel 1. The state diagram transitions from state 820 back in state 810, if the packages on both Channels 1 and 2 are restored.

The state diagram transitions from state 810 synchronization in state 830 zero transmission, if the Package 1A Channel 1 is restored earlyNestcycles, and nothing is transmitted on Channel 1. The state diagram also changes from state 820 in state 830, if the current packet on Channel 1 restored and nothing is transmitted on Channel 1. In state 830, the receiver attempts to recover Packet 2A Channel 2, with suppressed interference from all packages restored on Channel 1. State diagram remains in state 830, if the Package 2A Channel 2 not restored, and goes back to state 810, if the Package 2A restored.

Scheme orderly transfer with the SPT can provide good performance if the speed is accurate, so that the recovery later data flow is not delayed unduly.

C. diagram of the transmission with the SPT and cyclic repetition

Transfer scheme with the SPT and cyclic repetitionNDdata streams are recovered by cyclic repetition in data streams, so that the first recovered data stream, which is most likely to be decoded correctly. Initially, you selectNDspeeds forNDdata streams, andNDdata packets are transmitted onNDparallel channels. The speed selection can be rough, and the packet size may be chosen so that it is expected that all data packets will be restored forNestcycles. Whenever recovers the data packet for a data flow, a new packet is transmitted for the data stream, and the receiver tries to decode the data packet to the next data stream, as described below.

Figa depicts the transmission with the transmission scheme with the SPT and cyclic repetition. On figa the VA new block of data is transmitted, starting in cycle 1 for Packages 1A and 2A on Channels 1 and 2. Package 1A, as indicated, is restored first and processed on the basis of a lower speed due to interference from the Package 2A. Package 2A, as indicated, is restored later and processed on the basis of higher speeds, achieved by suppression of the Package 1A. Packages 1A and 2A have a length ofNest(i.e., expected to be restored forNestcycles). For each cycle, the receiver tries to recover the Package 1A, based on all blocks of data characters received for this package, and does not attempt to recover Packet 2A (X2A"). The receiver meets with adverse outcome ("F1a") decoding for Package 1A in each of cycles 1 toand with a favorable outcome (S1a") decoding cycle. New Package 1b is then transmitted over Channel 1, starting in cycle. Package 1b has a length ofNestand processed, based on a higher speed, which is measured in a cycleand assuming that there will be suppressed interference from Channel 2.

In a cyclethe receiver evaluates and mitigates interference caused by the Package 1A, attempts to recover Packet 2A and meets with unfavorable the outcome ("F 2a") decoding for Packet 2A. For each of the cycles withthe receiver attempts to recover Packet 2A, based on all blocks of data characters received for this package, with the units taken in cycles 1 throughremoved noise from the Package 1A, and from the units taken in cycles withremoved noise from the Package 1b. The receiver meets with adverse outcome ("F2a") decoding for Packet 2A in each of the cycles withand with a favorable outcome (S2a") decoding cycle. New Package 2b is then transmitted over Channel 2, starting in cycle. Package 2b has a length ofNestand processed, based on greater speed, which is measured in a cycleand assuming that there will be suppressed interference from Channel 1.

In a cyclethe receiver evaluates and mitigates interference caused by the Package 2A, tries to recover the Package 1b and meets with adverse outcome ("F1b") decoding for the Package 1b. For each of the cycles with the receiver attempts to recover Packet 1b, based on all blocks of data characters received for this package, with the units taken in cycles withremoved noise from the Package 2A, and from the units taken in cycles withremoved noise from the Package 2b. The receiver meets with a favorable outcome (S1b") decoding for the Package 1b in a cycle. The receiver tries to recover subsequent packets on Channels 1 and 2 in the same way.

Figv depicts the procedure for the recovery of data streams for transmission schemes with SPT and cyclic repetition. The receiver tries to recover the Package 1A Channel 1 in cycles 1 through. When the recovery Package 1A in a cyclethe receiver attempts to recover Packet 2A Channel 2 in cycles with. When restoring a Package 2A in a cyclethe receiver attempts to recover Packet 1b Channel 1 in cycles with. The receiver tries to recover subsequent packets on Channels 1 and 2 in the same way.

Generally speaking, the receiver may attempt Voss is the resolution of the packages, sent byNDparallel channels based on the probability of recovery of these packages. The probability of recovering a packet sent for each parallel channel, depends on various factors such as (1) OSP after treatment, achieved for the parallel channel with linear detection, and (2) the number of blocks of data symbols, already adopted for the parallel channel. In each cycle, the receiver may attempt recovery package sent on the parallel channel, restored with the highest probability in this cycle. Alternatively, the receiver may attempt recovery packages for allNDparallel channels, one package at a time, starting with the parallel channel, restored with the highest probability, and completing the parallel channel, restored with the lowest probability. If multiple parallel channels have an equal chance of recovery, then the receiver can choose one parallel channel (for example, at one time, randomly) for recovery.

The receiver can cyclically repeated byNDparallel channels, if (1) these channels reach such OSSP after processing with linear detection, and (2) the packages for these channels have the same length. In the operation example, let us consider the case whereND=4 and four new packet is transmitted in four parallel channels, beginning in cycle 1. In each cycle, the receiver may attempt recovery of packet sent for each parallel channel, based on all blocks of data characters received for this channel. The receiver can recover the first packet, transmitted by, for example, Channel 2, and then will evaluate and to suppress interference caused by this package. After that, in each cycle, the receiver may attempt recovery package sent on each of Channels 1, 3 and 4, based on all blocks of data characters received for this package. The receiver can recover the following packet, transmitted by, for example, channel 3, and then will evaluate and to suppress interference caused by this package. After that, in each cycle, the receiver may attempt recovery package sent on each of Channels 1 and 4, based on all blocks of data characters received for this package. The receiver can recover the following packet, transmitted by, for example, Channel 1, and then will evaluate and to suppress interference caused by this package. After that, in each cycle, the receiver may attempt recovery package sent by Channel 4, based on all blocks symb is the catch data, accepted for this package. After that, the receiver can simply cyclically repeat four parallel channels in a predetermined order, i.e., Channels 2, 3, 1, 4, then back to 2, and so on, This predetermined order is selected based on the order in which packets are restored to four parallel channels. Whenever a data packet is restored to the current parallel channel (the channel for which the first attempt recovery in the cycle), the new data packet is transmitted on this channel, and this package is then reduced to the latter.

Scheme transfer with the SPT and cyclic repetition can provide good performance even with coarse speed selection. This is because the transmission with NO effectively achieved for each data stream, as shown in figa and 9B. Transfer with the SPT and cyclic repetition can provide good performance, even if the channel changes rapidly. In addition, implementation of transmission schemes with the SPT and the cyclic repetition of relatively simple, because (1) the transmitter and receiver is not necessary to save state information for that at the moment is passed, and (2) there is no need to change the size of packages to meet specific time Windows, as in the case of a scheme of ordered transmission with the SPT.

The scheme is porjadochnoi transmission with the SPT and transmission with the SPT and cyclic repetition are two approximate schemes. Other transmission schemes can also be implemented for interdependent parallel channels. As an example, in the diagram of the hybrid transmission with the SPT receiver tries to recover each of the data packets transmitted in the moment, toNDdata streams based on all blocks of data characters received for this packet (i.e., the receiver does not pass decoding any package). Each block of data symbols for each package is (1) suppressed interference from the recovered packets, and (2) interference from packets that have not yet been restored. OSP for each data packet, thus, may change the entire package, depending on the degree of noise reduction, if any, for the package. Diagram of the hybrid transmission with the SPT can also be used in combination with the scheme orderly transfer with the SPT and the transmission scheme with the SPT and cyclic repetition. For example, the receiver may attempt to recover the data packet on Channel 2 in each cycle after the first data packet on Channel 1 was adopted and depressed (for example, for each cycle after cycleon figv and 6C).

3. Transmitter

Figure 10 depicts a block diagram of a variant of implementation of the processor 120 TX data from the transmitter 110. The processor 120 TX data includesNDprocessors a-1010n data channel the TX for NDdata streams. Each processor 1010 data channel TX receives a corresponding data stream, processes each data packet in the data stream, based on the speed selected for the stream, and generates a set of blocks of data symbols for the packet. 11 illustrates the processing of a single packet of data from one processor 1010 data.

Each processor 1010 data channel TX generator 1012 cyclic redundancy code (CEC) receives the data packet in the data stream that is processed by processor 1010 data, generates the CEC value for the data packet and appends the value of the CEC by the end of the data packet for the formation of rich package. The CEC value is used by the receiver to verify that you have correctly decoded packet or error. Instead, the CEC can also use other codes for error detection. Encoder 1014 forward error correction then encodes the formatted packet in accordance with the encoding scheme or encoding speed specified by the selected speed, and generates a coded packet or "code word". Coding improves the reliability of data packet transmission. Encoder 1014 UCO may implement block code, convolutional code, turbo code, some other code, or a combination of both. Figure 11 coded package includes the first part of the systematic bits formatted for Akita, the second part of the control bits from the first constituent encoder the turbo encoder and the third part with the control bits from the second constituent encoder the turbo encoder.

Dividing the node 1016 receives and separates the encoded packet onNBcoded subpackets, whereNBmay depend on the speed selected and specified by the control signal separation from the controller 180. First coded subpacket usually contains all of the systematic bits and zero or more control bits. This allows the receiver to recover the data packet with only the first coded subpackets under favorable channel mode. OtherNB-1 coded subpackets contain other control bits, each subpacket usually contains control bits are taken throughout the data packet.

Interleaver 1020 channel includesNBpremaritally a-1022nb blocks that acceptNBcoded subpackets from separating node 1016. Each interleaver blocks 1022 punctuates (i.e., reorder code bits for your subpacket in accordance with the scheme of alternation and issues subpacket with alternation. Interleaving provides diversity in time, frequency and/or spatial diversity for the coded bits. The multiplexer 1024 is connected to allNB premaritally a-1022nb blocks and generatesNBsubpackets with alternation, one at a time and if controlled by a control signal transmission to or from the controller 180. The multiplexer 1024 first issues subpacket with alternation from the interleaver a blocks, then the following subpacket with alternation from the interleaver units 1022b, etc. and the last subpacket with alternation from the interleaver 1022nb blocks. The multiplexer 1024 gives the following subpacket with alternation, if accepted GMP for package data. AllNBpremaritally a-1022nb blocks can be discharged whenever the accepted PP.

The node 1026 display characters takes subpacket with alternation from the interleaver 1020 channel and displays the data with the alternation in each subpacket on the modulation symbols. The character display is performed in accordance with the modulation scheme specified by the selected speed. The character display can be performed by (1) grouping sets of bits, forming a B-bit binary values, where≥1, and (2) mapping each B-bit binary values at a point in the signal constellation, with 2Inpoints. This constellation corresponds to the selected modulation scheme, which may be binary phase shift keying (FMD), quadrature phase shift keying (FMC), 2In-phase manip is the transmission (2 InFM), 2Inphase-quadrature amplitude modulation (2In-KAM), etc. As used herein, a "data symbol" is a modulation symbol for data, a "pilot symbol" is a modulation symbol for pilot signal. The node 1026 display characters generates a block of data symbols for each encoded subpacket, as shown in figure 11.

For each data packet processor 1010 data channel TX givesNBblocks of data symbols, which together includeNSYMcharacter data and can be denoted as {s}=[s1s2...]. Each charactersidata, wherei=1 ...NSYMis obtained by displaying the code bits as follows:si=map (bi), wherebi=[bi,1bi,2...bi,B].

Fig depicts a block diagram of a variant of implementation of the spatial processor 130 MV and the transmitting node 132. The spatial processor 130 TX receives and processesNDstreams of data symbols from processor 120 TX data and generatesNTstreams of characters transmission to the transmitting node 132. Processing by the spatial processor 130 TX depends on the specific transmission schemes selected for use.

the spatial processor 130 TX node 1220 matrix multiplication takes to NDblocks of data symbols (represented by the vectorsdata) for each interval. Node 1220 performs the matrix multiplication of the vectorsdata on (1) identity matrixVfor the second transmission schemes and (2) the underlying matrixMtransfer to third transmission schemes. Node 1220 simply skips the vectorsdata for other transmission schemes. The multiplexer/demultiplexer (MUX/DEMUX) 1222 receives the symbols from site 1220 and gives these characters at the appropriate transmitting antenna and the sub-bands (if you are using OCRC). The multiplexer/demultiplexer 1222 also multiplexes pilot symbols (e.g., type TDM time division channels (MBP)and givesNTsequence of symbols for transmission ofNTtransmitting antennas in each interval. Each sequence of characters transfer is designed to transfer one transmitting antenna in the same interval.

The transmitting node 132 includesNTmodulators a-1230t OCRC andNTradio frequency (RF) sites a-1236t TXNTtransmitting antennas. For a system with MVPS and one carrier does not require a modulator 1230, OCRC, and a spatial processor 130 TX givesNTsequences transfer directly to RF nodes a-1236t TX. System for OCRC with MBM is a spatial processor 130 TX gives NTsequences of transmission modulators a-1230t OCRC. Each modulator 1230, OCRC includes the node 1232 inverse fast Fourier transform (OBPF) and generator 1234 cyclic prefix. Each modulator 1230, OCRC takes the appropriate sequence of transmission symbols from the spatial processor 130 TX and groups each set ofNFcharacter transfer and zero signal values forNFthe sub-bands. (Sub-bands that are not used for data transmission are filled with zeros.) Node 1232 OBPF converts each set ofNFcharacter transfer and zeros in the time domain, usingNF-point inverse fast Fourier transform, and outputs the corresponding transformed symbol that contains theNFthe chips. Generator 1234 cyclic prefix repeats a portion of each transformed symbol to obtain the corresponding symbol of OCRC that contains theNF+Ncpthe chips. Repeat part referred to as a cyclic prefix, andNcprepresents the number of repeat chips. The cyclic prefix ensures that the symbol of OCRC retains its orthogonal properties in the presence of variation in the delay of multipath propagation caused by frequency-selective fading and (so E. frequency response that is not flat). Generator 1234 cyclic prefix generates a sequence of symbols OCRC for the sequence of transmission symbols.

RF nodes a-1236t TX take and bring into a certain conditionNTsequences of OCRC/transfer to generateNTmodulated signals that are transmitted fromNTtransmitting antennas a-1240t, respectively.

4. Receiver

Fig depicts a block diagram of the receiver 150A, which is one variant of implementation of the receiver 150 of figure 1. In the receiver 150ANRreceiving antennas a-1310r takeNTthe modulated signals transmitted by the transmitter 110, and giveNRthe received signals onNRRF nodes a-1312r RX, respectively, in the receiving node 154. Each RF node 1312 RX leads in a certain state and quantizes its received signal and generates a stream of characters/chips. For a system with MVPS and one carrier does not require demodulators a-1314r OCRC, and each RF node 1312 RX generates a stream of characters directly to the corresponding demuxer 1316. System for OCRC with MVPS each RF node 1312 RX produces a stream of chips to the corresponding demodulator 1314, OCRC. Each demodulator 1314, OCRC performs demodulation of OCRC his flow of chips on what redstem (1) removal of the cyclic prefix in each of the accepted symbol of OCRC to obtain a received transformed symbol and (2) converting each received transformed symbol to the frequency domain using fast Fourier transform (FFT) to obtain aNFthe received symbols forNFthe sub-bands. For both systems demultiplexes a-1316r takeNRstreams of characters from the RF node 1312 RX or demodulators 1314, OCRC, throwNRsequences of received symbols (data) for each interval on the spatial processor 160A RX and issue received pilot symbols to node 172 channel estimation.

The spatial processor 160A RX includes a detector 1320 and the multiplexer/demultiplexer 1322. The detector 1320 performs spatial or spatio-temporal processing (or "detection")NRsequences of received symbols to obtainNTsequences of detected symbols for each interval. Each detektirovanii symbol is an estimate of the data symbols sent by the transmitter. The detector 1320 may implement an OS detector, shown in equation (2), the detector ISCED shown in equation (3), a linear detector with the crossing of zero, shown in equation (4), the linear corrector according to ISCED concealer with decision feedback, or some other detector/corrector. Detection can be performed based on the evaluation matrixHthe characteristics of the channel or matrixHeff=HM effective characteristics of the channel depending on whether or not the data symbols are pre-multiplied by the base matrixMtransmission in the transmitter. System for OCRC with MWMW the receiver performs detection separately for each of the subbands used for data transmission.

For each interval detector 1320 generatesNTsequences of detected symbols, which correspond to theNTthe. The multiplexer/demultiplexer 1322 takesNTsequences of detected symbols and provides detected symbols forNDblocks detected symbols forNDdata streams. Each block of the detected symbol is an estimate of the block of data symbols transmitted by the transmitter.

Node 172 channel estimation estimates the matrixHthe characteristics of the channel for a channel with MVPS and the level of noise in the receiver (e.g., based on received pilot symbols and outputs the channel estimation controller 180. The controller 180 node 176 calculation of the matrix displays the characteristic ofWdetector (which may beWmrc,Wmmse,WzforΣ-1UHbased on the estimated matrix x the characteristics of the channel, as described above, and outputs a feature detector on the detector 1320. The detector 1320 runs the pre-multiplication of a vectorrthe received symbols on the characteristic ofWdetector for receiving vectorthe detected symbols. The selector 174 speed (which is implemented by the controller 180 for a variant implementation, shown in Fig) performs the speed selection based on estimates of the channel. Table 184 compliance (TC) stores the set of bit rates supported by the system with MVPS, and the set of parameter values for each speed (e.g., data rate, packet size, a coding scheme or encoding speed, the modulation scheme, etc. for each speed). The selector 174 speed accesses TC 184 for information that is used to select the speed.

Fig depicts a block diagram of the processor a RX data, which represents one variant of implementation of the processor 170 RX data of figure 1 and 13. The processor a RX data includesNDprocessors a-1410n data channel RXNDdata streams. Each processor 1410 data channel RX receives and processes the corresponding thread of the detected symbols and outputs the decoded stream data.

Each processor 1410 data channel RX node 1430 reverse display characters takes Blo and the detected symbols from the spatial processor 160A RX, one block at a time. For each block of the detected symbol node 1430 reverse display characters demodulates the detected symbols in accordance with the modulation scheme used for this block (as indicated by the control signal demodulation from the controller 180, and generates a block of demodulated data departmental 1440 canal. Departmental 1440 channel comprises a demultiplexer 1442 andNBdetereminately a-1444nb blocks. Before receiving a new packet of data detereminately a-1444nb blocks are initialized using erase. Erasing is the value that replaces the missing code bits (i.e. one that has not yet been adopted), and is given appropriate weight in the decoding process. The multiplexer 1442 receives the demodulated blocks of data from the host 1430 reverse display characters and gives each block of demodulated data to the appropriate departmental 1444 blocks. Each departmental 1444 blocks departmeat demodulated data in its block in a manner that is complementary to the interleaving performed at the transmitter for this block.

For independent parallel channels, whenever a new block of data symbols received from the transmitter for a packet of data on the parallel channel, the decoding may be performed on the SEM units, accepted for this package. Site 1448 reassembly generates a data packet with deteremined for subsequent decoding. The data packet with deteremined contains (1) data blocks with deteremined for all blocks of data symbols adopted for the current packet to be decoded, and (2) erase blocks of character data is not received for the current package. Site 1448 re-Assembly re-Assembly of complementary manner to the separation performed by the transmitter, as indicated by the control signal reassembling from the controller 180. The decoder 1450 UCO decodes the data packet with deteremined complementary to the coding UCO performed on the transmitter, as indicated by the control signal decoded from the controller 180. For example, a turbo decoder or a Viterbi decoder may be used for decoder 1450 UCO, if the transmitter is turbo coding or convolutional coding, respectively. The decoder 1450 UCO outputs the decoded packet to the current packet. Node 1452 check the CEC verifies the decoded packet to determine whether the decoded packet or an error, and outputs the state of the decoded packet.

Fig depicts a block diagram of the receiver 150b, which implements the method of the SPT and is another embodiment of the receiver 150 of figure 1. The receiver 150b in itself spatial processor 160b RX and processor 170b data RX, which together implement theNDsequential (i.e., cascade) handling stages of the receiver. Each of steps 1 throughND-1 includes a detector 1510, the suppressor 1520 interference, the processor 1530 data channel RX and a processor 1540 data channel TX. The last stepNDincludes only the detector 1510n and processor 1530n data channel RX.

For level 1 detector a performs detection byNRthe sequences of received symbols for each interval, and generates a block of the detected symbols for the package (the Packagexdata in the data stream recovered in step 1. The processor a data channel RX demodulates, departmeat and decode all blocks of the detected symbols adopted for the Packagex. If the Packagexis decoded correctly, then the processor a data channel TX encodes, punctuates and modulates the Packagexto obtain the re-modulated sequence of symbols, which is an estimate of the sequence of data symbols for the Packagex. The processor a data channel TX performs the same processing as the processing performed by the transmitter for the Packagex. The suppressor a interference takes and spatial processes a sequence of re-modulated symbols in the same way as performed transmitter is m 110 for the Package xto obtainNTsequence of transmission symbols, which contain only character components for the Packagex. The suppressor a noise addition processing sequence of transmission symbols by using a matrix of characteristics of the channel for receiving the interference components caused by the Packagex. Noise components are then subtracted from theNRsequences of received symbols to obtainNRthe modified sequences of characters that are served at level 2.

Each of steps 2 throughND-1 performs the same processing as step 1, thoughNRthe modified sequences of characters from the previous stage instead ofNRsequences of received symbols. StepNDperforms detection and decoding byNRthe modified sequences of symbols from stepND-1 and does not perform the assessment and suppression.

Each of the detectors a-1510n can implement the OS detector, the detector according to ISCED, the linear detector with a crossing of the zero line corrector according to ISCED concealer with decision feedback, or some other detector/corrector. Each processor 1530 data channel RX can be implemented as shown in Fig, and each processor 1540 data is the anal, TX can be implemented as shown in figure 10. As described above, the receiver may attempt recovery of the data packet to a later stage only after will be the restored data packets to earlier stages. Buffers (not shown in Fig) then will keep the characters with each step, until they are ready for processing in later steps.

As for systems with MVPS and one carrier, and systems OCRC with MVPS receiver and/or transmitter can estimate taken of OCSP or OCSP after treatment (depending on whether or not SAP) forNDparallel channels and to select the appropriate speed for the data transmission on each parallel channel. The speed selection can be performed in different ways. In one design speed selection speed for each parallel channel is selected based on OCSP required for the equivalent system with channel abgs (i.e., flat frequency response) to support the average spectral efficiency calculated for the parallel channel. This scheme speed selection is described in detail in the patent application U.S. transfer of the right to joint use of No. 10/176 567, entitled "Rate Control for Multi-Channel Communication Systems (Management data rates for multi-channel communication systems, filed June 20, 2002, In another scheme of choice is oresti speed for each parallel channel is selected on the basis of a working OSSP, calculated for the parallel channel, based on the average of OSSP after processing for the parallel channel and the offset OSSP. The highest speed required of OSP (channel abgs)that is less than or equal to OSP, is selected for the parallel channel. This scheme speed selection is described in detail in the patent application U.S. transfer of the right to joint use of No. 10/394 529, entitled "Transmission Mode Selection for Data Transmission in a Multi-Channel Communication System" (selecting a transmission mode for transmitting data in a multi-channel communication system, filed on March 20, 2003

Methods of communicating with the SPT, described herein, can be implemented in the system of division duplex frequency (HDR) and in the division duplex time (RTD). For a system with HDR straight channel with MVPS and the feedback channel use different frequency bands and probably find different channel modes. In this case, the receiver can estimateNDparallel channels to choose speed for parallel channels and to send back the selected speed, as shown in Fig.1-3. For a system with RTD direct channel with MVPS and the feedback channel share the same frequency band and probably find a similar channel modes. In this case, the transmitter can estimateNDparallel channels using the on the pilot signal, sent by the receiver, and selects the speed for parallel channels. Assessment of channel and rate selection, therefore, can be performed by a receiver, transmitter, or both.

Methods of communicating with ANY described herein, can be implemented by various means. For example, these methods can be implemented in hardware, software or their combination. For a hardware implementation, the processing units used in the transmitter for transmission with NO, can be implemented in one or several specific integrated circuits (ASIC), digital signal processors (DSPS), digital signal processing (UCOS), programmable logic devices (PLD), programmable gate arrays (MVP), processors, controllers, microcontrollers, microprocessors, other electronic components for performing the functions described herein, or their combinations. The processing units are used in the receiver for receiving the transmission NOR, can also be implemented in one or more ASIC, DSP, UCOS, PLD, MVP, processors, controllers, etc.

For the software implementation methods of transmission NOR can be implemented with modules (e.g., procedures, functions, and so on)that perform the functions described is in this document. Software codes may be stored in the memory node (e.g. nodes 142 and 182 memory figure 1) and executed by a processor (e.g., controllers 140 and 180). The memory node can be implemented within the processor or external to your processor, in this case, it can be connected with the possibility of connection to the processor through a variety of means that are known in the technique.

Titles included in this document for reference and assistance in finding specific topics. These headings are not intended to limit the scope of the principles described in this document, and these principles may have applicability in other sections throughout the description.

The previous description of the disclosed embodiments are presented to a person skilled in the art could make or use the present invention. Various modifications of these embodiments readily obvious to a person skilled in this technical field, and the General principles defined herein may be applied to all variants of implementation without derogating from the spirits or scope of the invention. Thus, the present invention is not intended to limit implementation options shown in this document, but should correspond to the widest extent consistent with paragraph what inciple new and distinctive signs, described in this document.

1. Method of performing transmission with incremental redundancy (NO) in the wireless communication system with many inputs and many outputs (MVPS), containing

processing the first data packet to obtain a first set of blocks of symbols;

processing the second data packet to obtain a second set of blocks of symbols;

the transmission of the first set of blocks of characters, one block of characters at a time, on the first parallel channel on the receiver.

transmitting the second set of blocks of characters, one block of characters at a time, on the second parallel channel on the receiver.

untimely completion of transmission of the first set of blocks of characters, if the first data packet is recovered by the receiver with fewer than all of the first set of blocks of symbols; and premature termination of transmission of the second set of blocks of symbols, if the second data packet is recovered by the receiver with fewer than all of the second set of blocks of characters.

2. The method according to claim 1, additionally containing

processing the third data packet to obtain a third set of blocks of symbols;

transmitting the third set of blocks of characters, one block of characters at a time, on the third parallel channel on primn is to; and premature termination of the transmission of the third set of blocks of symbols, if the third data packet is recovered by the receiver with fewer than all of the third set of blocks of characters.

3. The method according to claim 1, additionally containing

receiving the indication that the first data packet has been recovered;

the estimated bandwidth for the first and second parallel channels with no transmission on the first parallel channel up until the second batch of data will not be restored;

the estimated bandwidth for the first and second parallel channels with transmission of a new data packet on the first parallel channel after the first data packet; and

transmitting the new data packet on the first parallel channel if the bandwidth transfer on the first parallel channel more bandwidth with no transmission on the first parallel channel.

4. The method according to claim 1, additionally containing

receiving the indication that the first data packet has been recovered; and

no transmission of data packets on the first parallel channel until, until you restore the second data packet.

5. The method according to claim 4, in which the blocks of symbols for the second data packet are transmitted with full power of radiation after the conclusion of the Oia transmission of the first set of blocks symbols for the first data packet.

6. The method according to claim 1, additionally containing

receiving the indication that the first data packet has been recovered;

processing the third data packet to obtain a set of at least one block of characters for the third data packet; and transmitting a set of at least one block of characters, one block of characters at a time, on the first parallel channel.

7. The method according to claim 6, in which it is expected that the third data packet is recovered by the receiver in time or in front of him, and it is expected to restore the second data packet.

8. The method according to claim 6, in which it is expected that the third data packet is recovered by the receiver after the time when the expected recovery of the second data packet.

9. The method of claim 8, further containing a completed transfer of the second set of blocks of characters after a predefined number of blocks of characters.

10. The method according to claim 6, further containing increasing the radiation power for the third package and the intensity for the second batch at the time or after it, when the expected recovery of the second data packet.

11. The method according to claim 1, additionally containing a welcome indication that the first data packet has been recovered;

processing the third data packet to obtain a third set of blocks of symbols on the I of the third data packet;

transmitting the third set of blocks of characters, one block of characters at a time, on the first parallel channel after the first data packet;

receiving the indication that the second data packet was restored;

processing the fourth data packet to obtain a fourth set of blocks of symbols; and

transmitting a fourth set of blocks of characters, one block of characters at a time, on the second parallel channel after the second data packet.

12. The method according to claim 1, additionally containing

the reception of the first speed for the first parallel channel and the second speed for the second parallel channel, and in which the first and second data packets are processed in accordance with the first and second speeds, respectively.

13. The method according to item 12, in which the processing of the first data packet includes

encoding the first data packet in accordance with the encoding scheme specified by the first speed, to obtain a coded packet,

the separation of the encoded packet into multiple coded subpackets, and

modulation of multiple coded subpackets in accordance with the modulation scheme indicated by the first speed, to obtain a first set of blocks of characters.

14. The method according to claim 1, in which one block of symbols in the first set of blocks is ingelow includes all systematic bits for the first data packet and is transmitted first for the first data packet.

15. The method according to claim 1, additionally containing receiving at least one block of symbols selected from the first and second sets of blocks of symbols for transmission in one time slot by the first and second parallel channels; and spatial processing at least one block of symbols by basic transfer matrix to obtain multiple sequences of symbols for the multiple transmit antennas.

16. The method according to claim 1, in which the first and second parallel channels are formed so as to reach a similar relationship of signal to total noise and interference (OSSP) after the linear detection in the receiver.

17. The method according to claim 1, in which the first and second parallel channels correspond to the first and second transmitting antennas in the transmitter in the system with MVPS.

18. The method according to claim 1, in which the first and second parallel channels correspond to the first and second spatial channels in the system with MVPS.

19. The method according to claim 1, in which the system with MVPS implements orthogonal frequency division multiplexing (OCRC), and in which each of the first and second parallel channels is formed with multiple bands and multiple transmitting antennas.

20. The method according to claim 19, in which many parallel channels are formed by cyclic repetition diagonally on many paddy is Puzanov multiple transmitting antennas, with many parallel channels include first and second parallel channel.

21. The method according to claim 1, in which the system with MVPS implements multiple access orthogonal frequency division multiplexing (MLOCR), and in which each packet is transmitted over the set of sub-bands that are available for data transfer.

22. The method according to claim 1, wherein a set of data packets are processed and transmitted simultaneously on multiple parallel channels, in which the transfer of blocks of symbols for each data packet is terminated prematurely, if the data packet is recovered by the receiver with fewer than all of the blocks of symbols to be generated for the data packet, and in which the total radiation power is allocated for data packets, which have not yet been completed.

23. The transmitter used to perform transmission with incremental redundancy (NO) in the wireless communication system with many inputs and many outputs (MVPS), containing

a data processor which has a capability of processing the first data packet to obtain a first set of blocks of symbols, and to process the second data packet to obtain a second set of blocks of symbols; and

the controller is made with the possibility

initiating transmission of the first set of blocks of characters, one character block C is once on the first parallel channel on the receiver, initiating transmission of the second set of blocks of characters, one block of characters at a time, on the second parallel channel on the receiver, the premature termination of the transmission of the first set of blocks of characters, if the first data packet is recovered by the receiver with fewer than all of the first set of blocks of symbols, and premature termination of transmission of the second set of blocks of symbols, if the second data packet is recovered by the receiver with fewer than all of the second set of blocks of characters.

24. The transmitter according to item 23, in which the controller is additionally configured to

receiving the indication that the first data packet has been recovered;

bandwidth estimation for the first and second parallel channels with no transmission on the first parallel channel until, until you restore the second data packet;

bandwidth estimation for the first and second parallel channels with transmission of a new data packet on the first parallel channel after the first data packet; and

initiating transmission of a new data packet on the first parallel channel if the bandwidth transfer on the first parallel channel is greater than a bandwidth capable of being settled here with no transmission on the first parallel channel.

25. The transmitter according to item 23, in which the data processor is additionally configured to processing the third data packet to obtain a third set of blocks of symbols, and in which the controller is additionally configured to initiate transmission of the third set of blocks of characters, one block of characters at a time, on the first parallel channel when receiving the indication that the first data packet has been recovered.

26. The transmitter according to item 23, in which the data processor is configured to

encoding the first data packet in accordance with the encoding scheme specified rate selected for the first parallel

channel for receiving the encoded packet,

separation of the encoded packet into multiple coded subpackets, and

modulation of multiple coded subpackets in accordance with the modulation scheme, said rate to obtain a first set of blocks of characters.

27. The transmitter according to item 23, further includes a spatial processor configured to receive at least one block of symbols selected from the first and second sets of blocks of symbols for transmission in one time slot by the first and second parallel channels and spatial processing at least one the first block of characters through the base of the transfer matrix to obtain multiple sequences of symbols for the multiple transmit antennas.

28. A device configured to perform transmission with incremental redundancy (NO) in the wireless communication system with many inputs and many outputs (MVPS), containing

means for processing the first data packet to obtain a first set of blocks of symbols;

means for processing the second data packet to obtain a second set of blocks of symbols;

means for transmitting the first set of blocks of characters, one block of characters at a time, on the first parallel channel on the receiver.

means for transmitting the second set of blocks of characters, one block of characters at a time, on the second parallel channel on the receiver.

remedy for premature termination of the transmission of the first set of blocks of characters, if the first data packet is recovered by the receiver with fewer than all of the first set of blocks of symbols; and

remedy for premature termination of the transmission of the second set of blocks of symbols, if the second data packet is recovered by the receiver with fewer than all of the second set of blocks of characters.

29. The device according to p, optionally containing

means for processing the third data packet to obtain a set of at least one block of characters to trateg the data packet; and

the means for providing a set of at least one block of characters, one block of characters at a time, on the first parallel channel when receiving the indication that the first data packet has been recovered.

30. The device according to p, optionally containing

means for processing the third data packet to obtain a third set of blocks symbols for the third data packet;

means for transmitting the third set of blocks of characters, one block of characters at a time, on the first parallel channel when receiving the indication that the first data packet has been recovered;

means for processing the fourth data packet to obtain a fourth set of blocks of symbols; and

means for transmitting a fourth set of blocks of characters, one block of characters at a time, on the second parallel channel when receiving the indication that the second data packet has been recovered.

31. The way of acceptance with increasing redundancy (NO) first and second parallel channels in a wireless communications system with many inputs and many outputs (MVPS), containing

receiving a block of symbols for the first data packet transmitted by the first parallel channel, in which the first set of blocks of symbols is generated for the first data packet and transmitted one nl the com characters at once on the first parallel channel;

decoding all blocks of characters received for the first data packet to obtain a first decoded packet;

the definition that you have restored the first data packet based on the first decoded packet;

completion of receiving, decoding and definitions for the first data packet if the first data packet is recovered or if you have taken all of the first set of blocks of symbols;

receiving a block of symbols for the second data packet transmitted by the second parallel channel, in which the second set of blocks of symbols is generated for the second data packet and transmitted one block of characters at a time on the second parallel channel;

decoding all blocks of characters received for the second data packet to obtain a second decoded packet;

the definition that you have restored the second data packet based on the second decoded packet; and

completion of receiving, decoding and determining for the second data packet if the second decoded packet is restored, or if it took all of a second set of blocks of characters.

32. The method according to p in which decoding, determination and completion for the first data packet are performed every time when receiving a block of symbols for the first batch Yes the data and in which the decoding, determination and completion for the second data packet are performed every time when receiving a block of symbols for the second data packet.

33. The method according to p, optionally containing execution detection of multiple sequences of received symbols for the multiple receiving antennas for receiving a block of symbols for the first data packet and the block of symbols for the second data packet.

34. The method according to p, in which detection is performed on the basis of the detector on the minimum mean square error (ISCED), the optimal detector, the addition (OS) or a linear detector with a zero crossing of the (TN).

35. The method according to p, in which the receiving, decoding, determination and completion for the first data packet are performed regardless of the reception, decoding, determination and complete for the second data packet.

36. The method according to p, in which the recovery of the first data packet is assigned to the second data packet, and in which the decoding, determination and completion for the second data packet is not performed until, until you restore the first data packet.

37. The method according to p, optionally containing

if the recovered first data packet,

estimate interference due to the first data packet to the second packet data, and

suppression of interference, which is due to the first data packet, in blocks of characters received for the second data packet, and in which all blocks of characters received for the second data packet with suppressed interference from the first data packet are decoded to obtain a second decoded packet.

38. The method according to p in which the first data packet is restored before the second data packet and the new packet data is not transmitted on the first parallel channel until, until you restore the second data packet.

39. The method according to clause 37, further comprising

if the recovered first data packet,

receiving a block of symbols for the third data packet transmitted by the first parallel channel, in which the set of at least one block of symbols is generated for the third data packet and transmitted one block of characters at a time on the first parallel channel after the first data packet,

decoding all blocks of symbols adopted for the third data packet to obtain a third decoded packet,

the definition that you have restored the third data packet based on the second decoded packet, and

completion of receiving, decoding and definitions for the third data packet, if the third data packet is recovered or if they were taken from a set of at least one block of symbols is fishing.

40. The method according to 39, additionally comprising

if the third data packet is restored,

assessment of interference caused by the third data packet on the second data packet, and

suppression of interference due to third data packet, in blocks of characters received for the second data packet, and in which all blocks of characters received for the second data packet with suppressed interference from the first and third data packets are decoded to obtain a second decoded packet.

41. The method according to 39, in which it is expected that the third data packet will be restored in time or in front of him, and it is expected to restore the second data packet.

42. The method according to 39, in which it is expected that the third data packet is restored after a time when the expected recovery of the second data packet.

43. The method according to clause 37, further comprising

if the recovered first data packet,

receiving a block of symbols for the third data packet transmitted by the first parallel channel, in which the third set of blocks of characters generated for the third data packet and transmitted one block of characters at a time on the first parallel channel after the first data packet,

decoding all blocks of symbols adopted for the third batch of data is, to obtain the third decoded packet,

the definition that you have restored the third data packet based on the second decoded packet, and

completion of receiving, decoding and definitions for the third data packet, if the third data packet is recovered or if you have taken all of the third set of blocks of symbols; and

if the recovered second decoded packet,

estimate interference due to the second data packet in the third data packet, and

suppression of interference due to the second packet data, in blocks of characters accepted for the third data packet, and in which all blocks of the symbols adopted for the third data packet with suppressed interference from the second data packet are decoded to obtain the third decoded packet.

44. The method according to p, optionally containing obtaining estimates of the relationship of signal to total noise and interference (ASSP) for the first and second parallel channels; and selecting the first speed for the first parallel channel and the second speed for the second parallel channel, based on the estimates of OSP, and in which the first and second data packets are decoded in accordance with the first and second speeds, respectively.

45. The method according to p, optionally containing the parcel receipt (PP), if the first data packet vos is made of, or inaccurate reception (SPE), if the first data packet has not been restored.

46. The way of acceptance with increasing redundancy (NO) according to the multitude of parallel channels in a wireless communications system with many inputs and many outputs (MVPS), containing

many blocks of symbols for the set of data packets that are transmitted over multiple parallel channels in the current period, one block of characters for each data package, and one package of data for each parallel channel, in which numerous blocks of symbols are generated for each data packet and transmitted one block of characters at a time by their associated parallel channel;

selecting one of the multiple parallel channels to restore;

decoding all blocks of symbols received for the data packet transmitted on the selected parallel channel, for receiving the decoded packet;

the definition that you have restored the data packet transmitted on the selected parallel channel based on the decoded packet;

completion of receiving, decoding and definitions for the data packet transmitted on the selected parallel channel, if the data packet is recovered or if all of the numerous blocks of characters have been received for the data packet; and

ozankoy noise reduction, due to the data packet transmitted on the selected parallel channel, if the data packet is restored.

47. The method according to item 46. in which to restore selected parallel channel with the highest probability of recovery from a multitude of parallel channels.

48. The method according to item 46, in which to restore selected parallel channel, which restored the last, the most recent in time from the current period, many parallel channels.

49. The method according to item 46, in which recovery is chosen parallel to the channel with the highest number of blocks of data symbols in the current period of many parallel channels.

50. The method according to item 46, in which the selection, decoding, determining, completion and evaluation and suppression are performed for each of multiple parallel channels in the current period.

51. The method according to item 46, in which the selection, decoding, determining, completion and evaluation and suppression are performed for a multitude of parallel channels, one parallel channel at a time and in order with cyclic repetition, and order with cyclic repetition is defined so that one or more parallel channels, restored the most recent, are placed last and restored later, the last.

52. The method according to item 46, in which the selection, decoding, determine the pressure, completion and assessment and suppression are performed for a multitude of parallel channels, one parallel channel at a time and in a predetermined order, in the current period.

53. The method according to paragraph 52, in which the predetermined order is selected based on the probability of recovery of the data packet for each of the multiple parallel channels.

54. The method according to paragraph 52, in which the predetermined order is selected based on the order in which the restored data packets, earlier passed by many parallel channels.

55. The method according to item 46, wherein a set of parallel channels have a similar relationship of signal to total noise and interference (OSSP) after the linear detection in the receiver.

56. The method according to item 46, wherein a set of parallel channels are formed by passing diagonally across multiple sub-bands of the multiple transmitting antennas.

57. The receiver used for receiving transmission with incremental redundancy (NO) first and second parallel channels in a wireless communications system with many inputs and many outputs (MVPS), containing

a data processor which has a capability

receiving a block of symbols for the first data packet via the first parallel channel, in which the first set of blocks of symbols is generated for the first data packet is transmitted in one block of characters at a time on the first parallel channel

decoding all blocks of characters received for the first data packet to obtain a first decoded packet,

determine that you have restored the first data packet based on the first decoded packet,

receiving a block of symbols for the second data packet using a second parallel channel, in which the second set of blocks of symbols is generated for the second data packet and transmitted one block of characters at a time on the second parallel channel,

decoding all blocks of characters received for the second data packet to obtain a second decoded packet, and

determine that you have restored the second data packet based on the second decoded packet; and

the controller is made with the possibility

complete the processor data for the first data packet if the first data packet is recovered or if you have taken all of the first set of blocks of symbols, and

complete the processor data for the second data packet,

if the second decoded data packet is recovered or if you have taken all of the second set of blocks of characters.

58. The receiver according to 57, further includes a spatial processor configured to receive multiple serial is Inesta characters for multiple receiving antennas and the ability to perform detection of multiple sequences of received symbols to obtain a block of symbols for the first data packet and the block of characters to the second data packet.

59. The receiver according to 58, in which the spatial processor is configured to, if the first data packet is recovered, estimate interference due to the first data packet to the second packet data, and the suppression of interference due to the first data packet in blocks of characters received for the second data packet, and in which the data processor is arranged to decode all blocks of characters received for the second data packet with suppressed interference from the first data packet to obtain a second decoded packet.

60. The receiver according to 57, optionally containing

the host channel estimation is performed with the possibility of estimating the signal-to-total noise and interference (ASSP) for the first and second parallel channels; and

the speed selector, configured to select the first speed for the first parallel channel and the second speed for the second parallel channel, based on the estimates of OSP, and

in which the data processor is configured to decode the first and second data packets in accordance with the first and second speeds, respectively.

61. Device for receiving transmission with incremental redundancy (NO) first and second parallel channels in a wireless communications system with many inputs and many what yagodami (MVPS), contains

means for receiving a block of symbols for the first data packet via the first parallel channel, in which the first set of blocks of symbols is generated for the first data packet and transmitted one block of characters at a time on the first parallel channel;

means for decoding all blocks of characters received for the first data packet to obtain a first decoded packet;

means for determining that you have restored the first data packet based on the first decoded packet;

means for completion of receiving, decoding and definitions for the first data packet if the first data packet is recovered or if you have taken all of the first set of blocks of symbols;

means for receiving a block of symbols for the second data packet through the second parallel channel, in which the second set of blocks of symbols is generated for the second data packet and transmitted one block of characters at a time on the second parallel channel;

means for decoding all blocks of characters received for the second data packet to obtain a second decoded packet;

means for determining that you have restored the second data packet based on the second decoded packet; and means for the head is Rhenia reception decoding and determining for the second data packet if the second decoded packet is restored, or if it took all of a second set of blocks of characters.

62. The device according to p, optionally containing

means for receiving multiple sequences for multiple receiving antennas; and

means for performing detection of multiple sequences of received symbols to obtain a block of symbols for the first data packet and the block of symbols for the second data packet.

63. The device according to p, further containing a means for estimating interference due to the first data packet to the second data packet if the first data packet is recovered; and means for suppressing the interference due to the first data packet in blocks of characters received for the second data packet, and in which all blocks of characters received for the second data packet with suppressed interference from the first data packet is decoded to obtain a second decoded packet.



 

Same patents:

FIELD: information technologies.

SUBSTANCE: effect is reached due to reservation of double-linked quality of service (SQ) for guidance of network resources and-or services in data processing, by signalling with the information of guidance of a resource in both directions along certain trajectories of a route between these units through grounded on IP dynamic specialised portable network.

EFFECT: optimisation of the mechanism of SQ reservation for adaptive services in a mode of real time, in wireless networks by use of the approach of intrastrip signalling for dynamic double-linked SQ reservation.

20 cl, 9 dwg, 2 tbl

FIELD: information technologies.

SUBSTANCE: method of multilevel planning of the traffic, supporting set of ports and set of services, contains stages on which provide turns of the second level for classes A, B and C of traffic in each port of the leg of the user as a part of the separate device of an adaptive ring of a packet transmission (RPR), and the data frames accepted in port of the leg of the user, are subject to a premise in respective turns of the second level according to their identifiers of classes of the traffic; carry out the two-level planning consisting of primary planning according to a class of the traffic and the subsequent planning according to weight of port, on turns of the second level for port of the leg of the user; enter shots of data after two-level planning into turns of the first level for classes A, B and C of traffic accordingly; also carry out introduction planning in RPR for three classes of the traffic in turns of the first level.

EFFECT: improvement of planning of traffic transmission.

11 cl, 6 dwg

FIELD: physics, communication.

SUBSTANCE: declared invention concerns service to broadcasting/group transmission of multimedia (MBMS). Method and device for the notification of the user equipment (UE) about preferable level of frequency (PFL) services MBMS in the new cell when UE moves from old honeycombs in the new cell in a mode of an establishment of the oozed channel (CELL_DCH) in case convergence of level of frequencies (FLC) is given. Thus serving control mean a network (SRNC) informs UE about PFL services in new cote to which it was connected UE. If the new cell is driven by the drift control mean a network (DRNC) DRNC informs SRNC about PFL UE-connected services MBMS, a SRNC transmits data PFL UE so that UE could move on corresponding PFL.

EFFECT: possibility of the continuous reception of MB MS service.

24 cl, 9 dwg, 2 tbl

FIELD: physics, communication.

SUBSTANCE: invention concerns the method of transmission of the user data in which the mobile station (MS) transmits in an ascending direction the user data by means of the refined oozed physical data link (E-DPDCH). The method contains stages, on which: determine in the radio network controller, that the MS, carrying out transmission on channel E-DPDCH only to the first cell, transfers in a state of the soft transmission of service and will carry out transmission on the E-DPDCH channel to the first cell and to the second cell. After that, from the radio network controller provide the MS with the information for the decoding of the channel of acknowledgement of transmission transmitted from second cells. In the MS, carry out transmission on the E-DPDCH channel to the first cell and to the second cell. Decode the channel of acknowledgement of the transmission on the MS, transmitted from second cells. Exercise administration of recurring transmission transmitted to second cell on the basis of the information of the decoded channel of acknowledgement of transmission.

EFFECT: throughput capacity and communication quality improvement.

3 cl, 16 dwg

FIELD: physics, communication.

SUBSTANCE: devices and procedures are described, which facilitate planning with account of packets. For this purpose if all information of packet may not be planned for single period of transmission, additional resources may be assigned for transmission of packet content based on requirements to delay and/or limitations of packet transmission.

EFFECT: improvement of wireless communication and distribution of frequency resources to users in wireless network medium.

43 cl, 8 dwg

FIELD: physics, computer engineering.

SUBSTANCE: system and method are stated for time-scaled priority-oriented planner. For this purpose algorithm of flexible planning that uses variable durations of planning presents possibility of better utilization of system throughput capacity. Enquiry of transmission speed is sent, if data arrives to buffer, data in buffer goes out of buffer depth limits, and sufficient capacity is available to transmit at requested speed. Assignment of transmission speed sensitive to request of transmission speed indicates planned duration and planned transmission speed used for planned duration. Planned duration is less than or equal to planning period. Planning period is time interval, on the expiry of which planner prepares planning solution. Planning period is variable, as well as planned duration.

EFFECT: creation of flexible planning algorithm that uses variable durations of planning to maximize coefficient of system throughput capacity utilisation.

34 cl, 7 dwg, 1 tbl

FIELD: physics, communication.

SUBSTANCE: invention is related to transmission of information in global distribution network, such as Internet. Method for sending of information to target mobile station in anticipation mode includes definition of whether information should be sent in the form of short data batches (SDB) messages, and information sending in the form of SDB not waiting for reset of traffic channel.

EFFECT: development of mechanism for determination of messages to be transmitted in the form of SDB, so that no time-sensitive messages are delayed.

24 cl, 12 dwg

FIELD: physics, communications.

SUBSTANCE: unit of radio link control in the "no acknowledgement" mode (UM RLC) receives protocol data units (PDU) of the radio link control (RLC) level being transmitted through logical link(s) and rearranges the received protocol data units (PDU) based on their sequence numbers and using the receive window and the timer so that to minimise the unit delivery time lag.

EFFECT: reduction of losses of protocol data units (PDU) being received via each of the channels and provision for processing protocol data units (PDU) without their duplication.

20 cl, 11 dwg

FIELD: physics, communications.

SUBSTANCE: invention deals with mobile communication systems. Proposed are a method and device enabling efficient radio resource utilisation due to reduced size of the protocol data unit (PDU) of the radio link control (RLC) level in a mobile communication system supporting voice services on top the packet network. At RLC level PDU RLC is generated without insertion of information indicative of the beginning and the end of a specific service data unit (SDU) or utilisation/non-utilisation of complement on the size required. At RLC level the length indicator (LI) field is inserted in the header to indicate inclusion of the SDU temporary segment into the PDU RLC data field.

EFFECT: resultant decrease of the amount of redundant data being generated in the course of packet data transmission enables efficient utilisation of the limited radio resource available.

18 cl, 14 dwg

FIELD: physics, communications.

SUBSTANCE: method proposed for a mobile node to have been configured for communication within a wireless communication system envisages the following: connection to the wireless communication system; test for any of the multiple disconnect conditions being satisfied, every disconnect condition out of the array being represented by early indication of the mobile IP network support, the disconnect conditions array containing the requirement of authentification by the wireless network to be carried out within the period of link control protocol matching, the testing providing for diagnostics of necessity of authentification by the wireless network being carried out within the period of link control protocol matching, testing proceeding until a packaged network connection has been established between the mobile node and the wireless network; disconnect from the wireless network in case there is authentification by the wireless network required to be carried out within the period of link control protocol matching or the wireless network connection maintenance if there is no authentification by the wireless network required to be carried out within the period of link control protocol matching.

EFFECT: enhanced efficiency of network resource utilisation.

18 cl, 11 dwg

FIELD: radio communications.

SUBSTANCE: radio network controller sends value of power deviation for controlling power of transfer of high-speed dedicated physical control channel of ascending communication line, when user equipment enters service transfer zone, in cell communication system, containing radio network controller, assembly B, connected to said controller and user equipment, being in one of at least two cell nodes, occupied by assembly B. assembly B sends data to user equipment via high-speed jointly used channel of descending communication line and user equipment transfers data, notifying about data receipt state, to assembly B along ascending communication line. Controller sends to user equipment a value of deviation of power to determine transmission power adjustment for ascending communication line, if it is determined, that user equipment is within limits of service transfer zone. Controller sends to assembly B value of power deviation, to allow assembly B to determine threshold value for data determining, noting data receipt state, dependently on power deviation.

EFFECT: high-speed data delivery to user equipment.

5 cl, 31 dwg, 4 tbl

FIELD: telephone communication systems combined with other electronic systems.

SUBSTANCE: proposed telephone communication system that can be used for voice communications between subscribers of local telephone networks by means of public computer networks has telephone set, local telephone communication line, interface unit, analog-to-digital converter, signal distributor, voice identification device, voice-frequency dialing identification device, pulse dialing signal detector, identified number transmission device, coder, compressor, computer, public computer network, decompressor, decoder, voice recovery device (voice synthesizer), called number information converter, voice and called signal transfer queuing device, and digital-to-analog converter.

EFFECT: enhanced quality of servicing subscriber using public computer network; enlarged functional capabilities of system.

1 cl, 1 dwg

FIELD: data package transmission in mobile communication lines.

SUBSTANCE: device for controlling data package transmission in mobile communication line, which has base receiving-transmitting system (RTS) provided with buffer for storing data packages to be transmitted to mobile station, has base station controller (BSC) for comparing size of RTS buffer with number of non-transmitted data packages after data packages are received from common use data transmission commutated circuit (CUDTCC). Non-transmitted packages have to be packages which have been transmitted from BSC to RTS but still haven't been transmitted from BSC to RTS. Transmission of data packages is performed if size of buffer exceeds number of non-transmitted data packages.

EFFECT: prevention of overflow of internal buffer of base receiving-transmitting system; prevention of efficiency decrease caused by next cycle of data package transmission.

19 cl, 15 dwg

FIELD: data transfer networks, in particular Ethernet-based.

SUBSTANCE: device is made in form of multiple individually programmed single-port communication modules for access to common distributor bus 10, while each single-port communication module has: programmed micro-controller 1, made as access control block for transmitting environment Ethernet (MAC), containing processor with short command list (RISC CPU), and logic device 5 for distribution of data frames, including processing in real time scale and transmission to addresses frame destination ports of Ethernet data, received on said one-port communication module, transfer process is serial and is performed in save-and-send mode.

EFFECT: higher data distribution flexibility control.

2 cl, 7 dwg

FIELD: computer science.

SUBSTANCE: method includes calculation of mathematical expectation value, autocorrelation function of random process, characterizing time of traffic units receipt, weight coefficients of auto-regression filter are calculated and on basis of output data of said filter time of receipt of following traffic units is predicted.

EFFECT: higher precision.

2 cl, 5 dwg, 1 tbl

FIELD: communication networks.

SUBSTANCE: method includes recording all talks of packet commutation systems in data storage, containing operations for transferring output packets of information in forward direction from output port A to input port B, and input information packets in backward direction from input port B to output port A, each packet containing fields of information concerning destination address, number of packet, timestamp, calendar time and actual information, while from the side of output port A each information packet, sent to primary destination address from output port A to input port B and each information packet, sent to primary destination address from input port B to output port A, is sent to secondary destination address - position of database, and content of all talks of communication network subscribers is recorded there, with transfer of packets to secondary address in each packet information about number of packet, actual information and calendar time are stored, while in input packet calendar time is corrected to time of transfer of output packet, to which this input packet is response, while during transfer of packets to secondary address priority of their transfer is decreased.

EFFECT: possible accumulation of information concerning contents of all talks of subscribers in communication network.

2 dwg

FIELD: computer science.

SUBSTANCE: device can be used in multiple access channel. Device has random numbers generator 1, synchronizer 2, counter 4, elements AND 3,6,87, RS trigger 5, comparison block 7, clock pulse generator 15, query analyzer 91-9k, address analysis block 10, multi-input elements OR 11,12, counting block 13, conflict prevention block 14, interconnected by appropriate links.

EFFECT: higher accessible bandwidth of channel.

7 dwg

FIELD: context invocation in first network for telephone call transfer and/or transaction through first and second network.

SUBSTANCE: procedure is started with installation of applied protocol, for instance H.323, H.248, or communication session initiation protocol in first network using transfer of service signals or context specified by default. Applied protocol message conveyed from second network serves as basis for identifying information about functional capabilities which is used for context invocation. In this way functional capabilities can be coordinated in advance and context can be invoked, for instance, in the form of secondary context both for telephone calls and/or transactions coming from mobile device, and for telephone calls and/or transactions terminating in mobile device. So, proposed method and system can dispense with backup protocol for transmitting service signals associated with functional capabilities to second network.

EFFECT: reduced load associated with service signal transfer.

22 cl, 4 dwg

FIELD: digital communications, in particular digital television.

SUBSTANCE: method for transferring digital information in digital communications network, containing multiple transport flows, each of which transports at least one table concerning a group of services, containing information, concerning certain commercial group of services, includes transfer in one of said transport flows of at least two different tables concerning groups of services, each of which contains information, concerning appropriate separate commercial group of services, and also transfer in current transport flow of at least one other table, containing - for at least current transport flow - a list of values identifying groups of services, to make it possible to match said at least two tables concerning groups of services with appropriate transport flow and make possible a loading from current transport flow of appropriate one of tables concerning groups of services.

EFFECT: higher efficiency.

3 cl, 6 dwg

FIELD: mobile communications engineering.

SUBSTANCE: after switching connection between first transmitting station and receiving station to second transmitting station packets (DPm') of data are transmitted to receiving station through new communication channel. Second transmitting station during the process has no information concerning status of transmission of packets (DPm) of data, which were sent prior to switching of connection.

EFFECT: increased signal transmission speed during rigid service transfer.

2 cl, 8 dwg

Up!