# Method of sequence assignment and device for sequence assignment

FIELD: information technologies.

SUBSTANCE: method to assign a sequence and a device to assign a sequence are used in a system, where multiple different Zadoff-Chu sequences or GCL sequences are assigned to one cell, at the same time a number of arithmetic operations and extent of correlation circuit integration at a receiving end may be reduced. According to these method and device, at ST201 a counter (a) and a number (p) of current assignments of a sequence are initialised, and at ST202 it is identified whether the number (p) of current sequence assignments matches the number (K) of assignments to one cell. At ST203 it is identified whether the number (K) of assignments to one cell is odd or even. If K is even, at ST204-ST206, numbers of sequences (r=a and r=N-a), which are currently not assigned, are combined and then assigned. If K is odd, at ST207-ST212, for those sequences, to which a pair may not be selected, one of sequence numbers (r=a and r=N-a) is assigned, which are currently not assigned.

EFFECT: reduced volume of calculations.

8 cl, 17 dwg

**The technical field to which the invention relates**

The present invention relates to a method of assigning sequence and the target sequence to assign sequence Sadova-Chu or GCL sequence sauté.

**Prior art**

System for mobile communications, presents a cellular communication system or a radio LAN (local network), are provided with a range of random access in their transmission ranges. This range random access is provided in the transmission range of upward communication, when the terminal station (hereinafter referred to in this document as "UE") first sends a connection request from the base station (hereinafter referred to in this document as "BS"), or when the UE makes a new request assignment of frequency bands, the system of centralized control, where BS, etc. designate the times of transmission and transmission bandwidth stations UE. The base station may be called the "access point" or "node B."

In addition, in a system using TDMA (i.e. multiple access with time division), for example, 3GPP RAN LTE, which is now under standardization, when I first made the connection request (which occurs not only when UE, but also when not set the timing of the transmission of Vash the coming of the communication line, for example, when handover when no connection has been found within a certain period of time and the loss of synchronization due to conditions on the channel, and so on), random access is used for the first procedure of achieving time synchronization transmission in uplink communication connection request from BS (communication request) or the request destination bandwidth (resource request).

Package random access (hereinafter referred to in this document as "the service of RA"), passed in the range of random access (hereinafter referred to in this document as "the time interval RA"), unlike other scheduled channels, resulting in errors of reception and re-transmission due to collision between the signature sequences (the situation in which the UE transmit an identical signature sequence using identical time interval RA) or mutual interference between the signature sequences. Collision of packets RA or cases of reception errors increase delay processing while achieving time synchronization transmission in uplink communication, including packages RA, and processing the communication request from the BS. Therefore, a decrease in collision frequency of signature sequences and improve the detection characteristics of signature posledovatel the values.

As a way to improve the detection characteristics of signature sequences, the formation of the signature sequence of the GCL sequence (i.e. generalized chirp like - generic same radio pulses with linear frequency modulation)having the characteristic of low autocorrelation, and low cross-correlation between sequences or sequence Sadova-Chu. The signal sequence component of the random access channel and known between the transmission and reception is called the "preamble", and the preamble, as a rule, consists of a signal sequence having high characteristics of the autocorrelation and correlation. In addition, the signature is one pattern of the preamble, and assume that here signature sequence and pattern of the preamble are synonyms.

Generic documents 1-3 use the sequence Sadova-Chu or a GCL sequence, sequence length that N is a Prime number, as a preamble packet RA. Here the choice is a simple number for the sequence length N, you can use N-1 sequences with optimal autocorrelation characteristics and correlation and optimizes (makes the value of the amplitude correlation √N constant) characteristics of the Ross-correlation between any two sequences from the available sequences. Therefore, the system can assign any sequence from the available sequences Sadova-Chu each cell as a preamble. Off-patent document 1: R1-062174, Panasonic, NTT DoCoMo "Random access sequence comparison for E-UTRA" off-patent document 2: R1-061816, Huawei, "Expanded sets of ZCZ-GCL random access preamble" Generic document 3: R1-062066, Motorola, "Preamble Sequence Design for Non-Synchronized Random Access"

**Disclosure of invention**

Issues that will be resolved in accordance with the invention.

However, as the sequence Sadova-Chu or GCL sequence are sequences of complex code, where each element constituting the sequence is a complex number, the correlation scheme (consistent filter)required for detection code at the receiving side, requires a complex multiplication for each element of a sequence that involves a large amount of calculations and also increases the degree of integration schemes. In addition, when the number of different sequences Sadova-Chu or GCL sequences used in a cell increases, the detection of the preamble must perform (volume) correlation calculations, corresponding to the number of sequences, and this results in a volume calculation and integration schemes, proportional to the number of naznacenie.otnositiona.

The purpose of this invention is the provision of a method of assigning sequence and the destination device sequence, which reduce the amount of computation and the degree of integration of the schema for schema correlation at the receiver side in a system in which many different sequences Sadova-Chu or GCL sequences are assigned to one cell.

**The means for solving the aforementioned problems**

The method of assigning sequence of the present invention includes the step of purpose, which is to assign combinations of numbers of sequences from sequences Sadova-Chu or GCL sequences assigned to one cell having such a relationship that the absolute values of the amplitudes of the coefficients of the real part and imaginary part of each element of the sequence are equal.

The target sequence of the present invention has a configuration comprising a partition assignment sequence that assigns combinations of numbers of sequences from sequences Sadova-Chu or generalized sequences, similar to the radio pulses with linear frequency modulation (generalized chirp like sequence), which are assigned to one cell, and combinations of numbers of sequences support this relationship, Thu the absolute values of the amplitudes of the coefficients of the real parts and the imaginary parts of elements in the sequence are equal, and the section of the notice, in which there is correspondence between combinations of numbers, sequences and indexes combinations, and which notifies the index corresponding to the combination of assigned numbers of sequences.

**The beneficial effects of the invention**

The present invention reduces the amount of computation and the degree of integration schemes correlation at the receiver side in a system in which many different sequences Sadova-Chu or GCL sequences are assigned to one cell.

**Brief description of drawings**

Figure 1 - block diagram depicting the configuration of a radio communication system according to a variant implementation 1 of the present invention.

Figure 2 - block diagram depicting the configuration of the BS, depicted in figure 1.

Figure 3 - block diagram depicting the configuration of a UE according to a variant implementation 1 of the present invention.

4 is a block diagram depicting the operation of the destination partition sequence depicted in figure 1.

Figure 5 shows how the assigned sequence number of each cell.

Figure 6 shows the correspondence between the numbers of sequences and indexes.

Figure 7 shows the internal configuration section of the detection sequence of the preamble shown in figure 2.

On Fig depicts another for the e between the numbers of sequences and indexes.

Fig.9 is a block diagram depicting a system configuration of a type of distributed control.

Figure 10 is a block diagram depicting the configuration section of the bundle RA under option exercise 2 of the present invention.

Figure 11 shows an example of formation of a ZC sequence in the frequency domain by the section forming the ZC sequence depicted in figure 10, and assigning subcarriers IDFT section.

Fig is a block diagram depicting the internal configuration section of the detection sequence of the preamble under option exercise 2 of the present invention.

Fig is a block diagram depicting the internal configuration of the partition complex multiplication, shown on Fig.

Fig is a block diagram depicting the configuration section of the bundle RA under option exercise 3 of the present invention.

On Fig shows the correspondence between m and q according to a variant implementation 3 of the present invention.

On Fig shows the correspondence between the numbers of sequences and indexes.

**Preferred embodiments of the invention**

Next will be described embodiments of the present invention according to the appended drawings.

__An implementation option 1__

First, using equations will be presented after outermost Sadova-Chu. The sequence Sadova-Chu length N is expressed by equation 1, when N is an even number, and is expressed by equation 2, when N is an odd number.

where k=0, 1, 2,..., N-1, q is an arbitrary integer and r is the sequence number (the index of the sequence); r - mutually-easy to N and a positive integer less than N.

Next, using the equations will be presented to the GCL sequence. The GCL sequence of length N is expressed by equation 3, when N is an even number, and is expressed by equation 4, when N is an odd number.

where k=0, 1, 2,..., N-1, q is an arbitrary integer, r is a one-to-easy-to-N and a positive integer less than N, "b_{i}(k mod m)" is an arbitrary complex number and i=0, 1..., m-1. In addition, while minimizing the cross-correlation between sequences GCL, b_{i}(mod m) is an arbitrary complex number amplitudes 1.

The GCL sequence is a sequence resulting from multiplication of the sequence Sadova-Chu b_{i}(k mod m), and since the calculation of the correlation at the receiver side is similar to the calculation of the correlation sequence Sadova-Chu, as the example below will be described the sequence Sadova-Chu. In addition, below is described the case where the placentas is required Sadova-Chu,
the length of the sequence, where N is odd and Prime number will be used as the sequence of the preamble packet RA.

Figure 1 is a block diagram depicting the configuration of a radio communication system according to a variant implementation 1 of the present invention. In this drawing section 51 resource control radio controls radio resource assigned to a lot of BS (#1 to #M) 100-1 to 100-M, and is provided by section 52 of the destination sequence and section 53 of the notification.

Section 52 of the destination sequence assigns a sequence number r sequence Sadova-Chu cell managed by the BS, running, and displays the assigned number sequence r in section 53 notice. Section 53 of the notification notifies the index denoting the sequence number r drawn from section 52 of the destination sequence, station BS 100-1 through 100-m Section 52 of the destination sequence and the notification section 53 will be described in detail later.

Station BS 100-1 through 100-M relay indexes provided by section 52 of the destination sequence, station UE, in their own cells, and detect the preamble sequence transmitted from stations UE. Since all stations BS 100-1 through 100-M have the same function, we will assume that all mentioned called BS BS 100.

Phi is .2 is a block diagram, depicting the configuration of the BS 100, depicted in figure 1. In this drawing, the processing section 101 radio channel provided by section 102 of the formation of the broadcasting channel, section 103 encoding section 104 modulation. Section 102 of the formation of the broadcasting channel forms a broadcasting channel, which is the control channel downlink, including the index, reported by section 53 notice, depicted in figure 1. Formed by the broadcasting channel is displayed in section 103 encoding.

Section 103 encoding encodes the broadcasting channel, derived from section 102 of the formation of the broadcasting channel, and section 104 of modulating modulates the encoded broadcasting channel according to the modulation scheme, for example, BPSK and QPSK. The modulated broadcasting channel is displayed in the multiplexing section 108.

Section 105 of processing data DL are secured by a section 106 encoding section 107 of modulation, and performs processing of transmission data transmitted DL. Section 106 encoding encodes data to be transmitted DL, and section 107 of modulating modulates the encoded transmitted DL data according to the modulation scheme such as BPSK and QPSK, and outputs the modulated transmitted DL data to the multiplexing section 108.

Section 108 performs multiplexing temporary is multiplexion, frequency multiplexing, spatial multiplexing or code multiplexing the broadcasting channel, the output of section 104 of modulation, and transmitted DL data drawn from section 107 of modulation, and outputs the multiplexed signal to RF transmitting section 109.

RF transmitting section 109 applies predetermined processing to the radio, for example conversion D/A, filter and transform with increasing frequency multiplexed to the signal derived from section 108 multiplexing, and transmits the signal subjected to processing the radio from the antenna 110.

RF reception section 111 applies a predetermined radio reception processing such as conversion with decreasing frequency and converting the A/D to the signal received by the antenna 110, and outputs a signal subjected to radio reception processing section 112 demuxing.

Section 112 of the demux separates the signal derived from the RF receiving section 111, on the time interval RA and the time interval data UL and outputs the selected time interval RA to section 114 of the detection of the preamble sequence and the time interval data UL in section 116 of the demodulation section 115 of the processing of the reception data UL, respectively.

Section 113 table storage pic is of egovernance preamble stores a table of sequences of the preamble, linking sequence of the preamble, which can be assigned to section 52 of the destination sequence depicted in figure 1, these sequence numbers and indices, indicating that these combinations, reads the preamble sequence corresponding to the index reported from section 53 notice, depicted in figure 1, from a table and displays the corresponding sequence of the preamble in section 114 of the detection sequence of the preamble.

Section 114 of the detection sequence of the preamble performs the processing of the detection signal of the preamble, such as the processing of the correlation time interval RA, derived from section 112 demuxing using signatures stored in section 113 table storage sequences of the preamble, and determines whether there was or was not the sequence of the preamble transmitted from the UE. The result of the detection (detection package RA) is displayed on a higher level (not illustrated).

Section 115 of the handle receiving UL data provided by section 116 of the demodulation and section 117 decoding, and performs processing of receiving data UL. Section 116 of the demodulation corrects the distortion of the response signal propagation path UL data outputted from the section 112 demuxing, decide on the point of signal through ill is whom decisions or soft decisions depending on the modulation scheme, and section 117 performs decoding processing for error correction of the solution relative to the point of signal section 116 of the demodulation, and outputs the received UL data.

Figure 3 is a block diagram depicting the configuration of the UE 150 according to a variant implementation 1 of the present invention. In this drawing, the RF receiving section 152 receives the signal transmitted from the BS depicted in fig.l, via the antenna 151, and applies a predetermined radio reception processing such as conversion with decreasing frequency and converting the A/D to navigate to the received signal, and outputs a signal subjected to radio reception processing section 153 demuxing.

Section 153 demux separates the broadcasting channel and the DL data included in the signal outputted from RF receiving section 152, and outputs the selected data DL in section 155 of the demodulation section 154 processing receive data DL and the broadcasting channel in section 158 of the demodulation section 157 processing of receiving the broadcasting channel.

Section 154 of the handle receiving DL data provided by section 155 of the demodulation and section 156 decoding, and performs processing of receiving data DL. Section 155 of the demodulation corrects the distortion of the response signal propagation path data DL, the output of section 153 dealt is plexitube, decide on the point of a signal through the hard decisions or soft decisions, depending on the modulation scheme, and section 156 performs decoding processing for error correction of the solution relative to the point of signal from section 155 of the demodulation and outputs the received data DL.

Section 157 processing of receiving the broadcasting channel provided by section 158 of the demodulation, section 159 decoding and section 160 of the processing of the broadcasting channel, and performs processing of receiving the broadcasting channel. Section 158 of the demodulation corrects the distortion of the response signal propagation path radio channel, the output of section 153 demuxing, decide points of the signal through the hard decisions or soft decisions, depending on the modulation scheme, and section 159 performs decoding processing for error correction of the solution relative to the point of broadcasting signal of the channel section 158 of the demodulation. The broadcasting channel, processed with error correction, is shown in section 160 of processing a broadcasting channel. Section 160 of processing a broadcasting channel displays the index included in the broadcasting channel, derived from section 159 decoding section 161 table storage follower of the spines of the preamble and other broadcasting channels at a higher level (not illustrated).

Section 161 of the sequence of the preamble stores a table of sequences of the preamble section 113 table storage sequences of the preamble BS 100, depicted in figure 2. Accordingly, section 161 of the sequence of the preamble stores a table of sequences of the preamble, which binds the sequence of the preamble, which can be assigned to section 52 of the destination sequence depicted in figure 1, with these numbers, sequences and indexes pointing to these combinations. Next section 161 of the sequence of the preamble displays the sequence of the preamble associated with the index derived from section 160 of processing a broadcasting channel, in section 162 bundle RA.

After receiving the command packet RA from a higher level (not illustrated), section 162 bundle RA selects one of the available sequences of the preamble of section 161 table storage sequences of the preamble, forming the RA with the inclusion of the selected sequence of the preamble, and outputs the generated package RA in section 166 multiplexing.

Section 163 processing data UL provided by section 164 coding and section 165 of the modulation, and performs processing of transmission data transmitted UL. Section 164 coding before encodes the data by UL, and section 165 of modulating modulates the encoded UL data to be transmitted according to the modulation scheme such as BPSK and QPSK, and outputs the modulated data to be transmitted UL in section 166 multiplexing.

Section 166 multiplexing multiplexes package RA inferred from the section 162 bundle RA, and UL data to be transmitted, the output of section 165 of the modulation, and outputs the multiplexed signal to RF transmitting section 167.

RF transmitting section 167 applies predetermined processing to the radio, for example conversion D/A, filter and transform with increasing frequency multiplexed to the signal derived from section 166 multiplexing, and transmits the signal subjected to processing radio from antenna 151.

Next will be described the operation of section 52 of the destination sequence depicted in figure 1, with the use of figure 4. In figure 4, at step (hereinafter abbreviated as "ST") 201 initializes the counter a and the current number of assigned sequences p (a=1, p=0). Furthermore, assume that the number of sequences assigned to one cell, is equal to K.

In ST202, the decision matches or does not match the current number of assigned sequences p with the number of sequences assigned to one cell of K. If these live in the VA match as the current number of assigned sequences p has become equal to the number of sequences assigned to one cell, K, the assignment processing sequence ends, and if these quantities do not match, the destination sequence still to be done and, therefore, the process proceeds to ST203.

In ST203, the decision is or is not equal to 1, the value resulting from subtracting the current number of assigned sequences p of the number of sequences assigned to one cell, because the Process goes to ST207, if this value is 1, or goes to ST204, if this value is not equal to 1.

In ST204, the decision already were or were not assigned sequence numbers r=a and r=N-a, and the process proceeds to ST205, if at least one of the number of sequences r=a or r=N-a has already been assigned, or transferred to ST206, if has not yet been assigned.

In ST205, as decided in ST204, namely, that one or both r=a and r=N-a has already been/have been assigned, the counter a is incremented (updated to a=a+l) and the process returns to ST204.

On ST206 are assigned sequence numbers r=a and r=N-a, relative to which ST204 decided not to assign them any cell, the current number of assigned sequences p is updated to p=p+2, counter a led is ensured (updated to a=a+1) and the process returns to ST202.

In ST207, the counter on a ST203 initialized to a=1, and ST208, the decision had already been or has not been assigned a sequence number r=a. The process continues to ST210, if the sequence number r=a has already been assigned, or transferred to ST209, if it has not yet been assigned.

On ST209 is assigned a sequence number r=a, relative to which the ST208 decided not to appoint him, and assignment processing sequence ends.

In ST210, as ST208, the decision was made, namely, that the sequence number r=a has been appointed, the decision was or was not already assigned a sequence number r=N-a. The process continues to ST211, if you have already been assigned, or transferred to ST212, if has not yet been assigned.

On ST211, as ST210, the decision was made, namely, that the sequence number r=N-a has already been assigned, the counter a is incremented (updated to a=a+1), and the process returns to ST208.

On ST212 is assigned a sequence number r=N-a, relative to which ST210 decided not to appoint him, and assignment processing sequence ends.

Of sequences, which are impossible to pick up a couple when the number of assigned sequences is an odd number, the search procedure among the sequences that will be assigned in ascending order but the ' sequences, presented in ST208 on ST211, but the sequence that have not yet been assigned, can also be selected and assigned at random.

Performing such processing destination sequence allows for the assignment of the sequence as shown in figure 5. On figa shows a case where each cell is assigned four sequences (an even number) (BS#1 and BS#2). Accordingly, the sequence numbers r=1, 2, N-1 and N-2 are assigned to the BS#1, and sequence numbers r=3, 4, N-3 and N-4 are assigned to the BS#2. When the number of assigned sequences of 2 or more, and_{1}, a_{2}... each pair (a_{1}N-a_{1}), (a_{2}N-a_{2})...that should be assigned, can be chosen randomly from the available sequences.

On the other hand, figv shows a case where each cell is assigned three sequences (an odd number). Accordingly, the sequence numbers r=1, 2 and N-1 are assigned to the BS#1, and sequence numbers r=3, N-3 and N-2 are assigned to the BS#2. When the number of assigned sequences is an odd number, r=a and r=N-a are assigned in pairs and sequences are selected based on predetermined selection rules and are assigned to sequences, which are impossible to pick up a pair.

Next will be described the process of notifying the b index section 53 notice. The indices are determined according to the table presented on Fig.6, for numbers of sequences assigned to each cell of section 52 of the destination sequence. Figure 6, a pair of rooms sequences r=1 and N-1 is associated with an index of 1, and a pair of sequence numbers r=2 and N-2 is associated with index 2. Couple of rooms sequences are associated with indexes from index 3 and then a similar way. "floor (lower limit) (N/2)in the drawing denotes an integer not exceeding N/2.

Indexes that are defined thus transmitted from the BS in the station UE through broadcasting channels. On the UE side is also provided with an identical table for 6, and there it is possible to identify pairs of available rooms sequences using reported indexes.

Therefore, with the appointment of one index pair numbers of sequences r=a and r=N-a, you can reduce the number of bits of the signaling required for the notification.

By the way, you can also select a different notification method, for example, assigning index numbers of the sequences one by one and notice of these indexes.

In addition, the number of bits of the signaling necessary to notice, also can be reduced by increasing the sequence number assigned to a single index, such as 4, 8...

Next will be described the clubs is 114 detection sequence of the preamble, shown in figure 2. Figure 7 shows the internal configuration section 114 of the detection sequence of the preamble shown in figure 2. Here is illustrated the case where the sequence length is N=11.

7, assuming that the input signal of the delay device D is r(k)=a_{k}+jb_{k}and each coefficient sequence Sadova-Chu with sequence number r=a is equal to a_{r=a}*(K)=c_{k}+jd_{k}section x is a complex multiplication implies the result of the calculation in respect of correlation on the side of the sequence r=a, as a_{k}c_{k}-b_{k}d_{k}+j(b_{k}c_{k}+a_{k}d_{k}). On the other hand, each coefficient sequence Sadova-Chu with sequence number r=N-a is a_{r=N-a}*(K)=(a_{r=a}*(k))*=c_{k}-jd_{k}and the result of the calculation in respect of correlation on the side of the sequence r=N-a is a_{k}c_{k}+b_{k}d_{k}+j(b_{k}c_{k}-a_{k}d_{k}).

Therefore, a_{k}c_{k}b_{k}d_{k}b_{k}c_{k}and a_{k}d_{k}the result of the multiplication is performed to obtain the correlation values on the side of the sequence r=a, can be used to calculate the correlation values on the side of the sequence r=N-a, and, consequently, it is possible to reduce the amount of operations of multiplication and manisfesting integration scheme (the number of multipliers).

As is evident from Fig.7, as one sequence Sadova-Chu is in communication with an even-symmetric sequence (each element of a sequence is equal to a_{r}(K)=a_{r}(N-1-K)), then the correlator performs the processing of the multiplication with the summation of the elements of K and N-1-k to perform a multiplication operation, and can, thereby, also to halve the number of multiplications (the number of multipliers).

Therefore, when one cell is assigned to many different sequences Sadova-Chu, in the present embodiment, the sequences are assigned in such combinations that the link supports the fact that the elements of the sequences are complex conjugate to each other, and can thereby reduce the amount of calculation and the level of integration schemes correlation at the receiver side without performance degradation detection sequences.

In the present embodiment, was considered the case where the sequence length N is a Prime number (odd number), but the sequence length N may also not be a Prime number (or odd or even number). When the sequence length N is not a Prime number, sequence number r with optimal autocorrelation characteristics that can be used throughout the system, must be mutually question is to nd the sequence length N.

When the sequence length N is an even number, let's assume that the assignment rule of the sequence of the preamble is r=a -> r=N-a-> r=N/2-a -> r=N/2+a (where 1≤a≤N/2-1, in addition, the order of assignment can be arbitrary) and, thereby, it is possible to calculate the correlation of four different sequences of operation of multiplication (number of multipliers)corresponding to one sequence. As liaison, in which the sequence r=a and r=N/2-a are complex conjugate to each other, and communication support between r=a and r=N/2-a that the values of the real part and imaginary part are swapped, and their signs are different, then the result of the operation of multiplication can be used as is. Therefore, the amount of operation of multiplication and the number of multipliers of one sequence can be reduced to about 1/4. In addition, when the sequence length N is an even number, with the appointment of a single index for the combination of the four sequences r=(a, N-a, N/2, N/2+a), as shown in Fig, as a way of notice of assignment of the sequence, the number of bits required for notification of the assignment sequence, can also be reduced.

In addition, the preamble sequence used in random access, was the description of the as in the present embodiment, as an example, but the present invention is not limited to this and is also applicable for the case where one BS is used multiple sequence Sadova-Chu or GCL sequences as known signals. Such known signals include the reference signal, the channel estimation and pilot signal for synchronization downlink (sync channel).

In addition, in the present embodiment describes a configuration system with centralized control type, in which there is one section 52 of the destination sequence for many of the BS, as shown in figure 1, but the system can also be used to configure systems with distributed control type, as shown in Fig.9, in which each BS provided by section assignment sequence, and information is exchanged so that among the many BS assigned mutually different sequence number r of sequences Sadova-Chu.

In addition, although the present embodiment describes a complex conjugate value, the present invention is not limited to this as long as long as such a relationship that the absolute values of the amplitudes of the coefficients of the real part and imaginary part are equal.

__An implementation option 2__

In the embodiment 1 has been described the case where the sequence PR is ambuli are formed and detected in the time domain, in the embodiment 2 of the present invention will be described the case where the sequence of the preamble are formed and detected in the frequency domain.

The configuration of the UE according to a variant implementation 2 of the present invention is similar to the configuration of the UE case for 1, is shown in figure 3, and is therefore described using Fig 3.

Figure 10 is a block diagram depicting the configuration section 162 bundle RA under option exercise 2 of the present invention. In this drawing, the section 162 bundle RA provided by section 171 of the formation of the ZC sequence, section 172 and IDFT section 173 adding CP.

Section 171 of the formation of the ZC sequence generates a sequence of Sadova-Chu in the frequency domain, and outputs the corresponding coefficients (symbols) generated sequence Sadova Chu in predetermined subcarriers section 172 IDFT.

Section 172 applies IDFT inverse discrete Fourier transform (IDFT) to the input signal sequence comprising the sequence Sadova-Chu, derived from section 171 of the formation of the ZC sequence in predetermined subcarriers and NULL (value: 0)that are transferred to the remaining subcarriers, and outputs the signal to the time domain in section 173 adding CP.

Section 173 adding CP Pris is Edinet cyclic prefix (CP) to signal the time domain, derived from section 172 IDFT, and outputs the signal to the time domain in section 166 multiplexing. Here, "CP" refers to parts of the sequence that duplicates the predetermined length of the signal sequence from the end of the signal time domain, extracted from section 172 IDFT added to the header signal time domain. By the way, section 173 adding CP may not be included.

Next, we 11 will be described formation sequence Sadova-Chu in the frequency domain by section 171 of the formation of the ZC sequence, depicted in figure 10, and examples of assigning subcarriers section 172 IDFT.

First, using equations will be presented sequence Sadova-Chu generated in the frequency domain by section 171 of the formation of the ZC sequence. The sequence Sadova-Chu length N is expressed by equation 5, when N is an even number, and is expressed by equation 6, when N is an odd number.

Here, although the above equations are identical to equations sequence Sadova-Chu in the embodiment 1, since the sequence Sadova-Chu will be determined in the frequency domain, the above equation will be overridden using different symbols to distinguish them from the definition in the time domain variant implementation 1.

where n=0, 1, 2, ..., N-1, q is an arbitrary integer, u is the sequence number (the index of the sequence) and N - mutually-easy to N and an integer less than N. the Sequence Sadova-Chu, formed in the frequency domain, expressed by equation 5 and equation 6 can use the Fourier transform to be converted into a sequence Sadova-Chu, formed in the time domain. Accordingly, the sequence Sadova-Chu, formed in the frequency domain, also corresponds to the sequence Sadova-Chu in the time domain.

As shown in figure 11, the corresponding coefficients C_{u}(n) sequence Sadova-Chu, formed on the basis of equation 5 or equation 6 in section 171 of the formation of the ZC sequence, are arranged on subcarriers section 172 of the IFFT in the order C_{u}(0), C_{u}(1), C_{u}(2), ..., C_{u}(N-1). On the remaining subcarriers section 172 IFFT is usually set to NULL (no input signal is present or is 0).

The operation section 52 of the destination sequence of this variant implementation (see figure 1) are identical to the operations of a variant of implementation 1 through 4, except that the symbol denoting the sequence number is changed from r to u. Furthermore, the method of notification about the indexes section 53 notice also identical to the method of option 1, and when one is OTE is always assigned an even number of sequences, it is possible to reduce the required number of bits, when the destination sequence notify by setting one index pair of sequences u=a and u=N-a.

You can also further reduce the required number of bits, when the destination sequence notify through the installation of 4, 8, ... as pairs of numbers of the sequences assigned to the same index.

Since the configuration of the BS according to a variant implementation 2 of the present invention similar to the configuration options implement 1 shown in figure 2, its description will be used 2.

Fig is a block diagram depicting the internal configuration of section 114 of the detection sequence of the preamble under option exercise 2 of the present invention. In this drawing section 114 of the detection sequence of the preamble provided by section 181 DFT, sections 182-1 through 182-N-1 complex multiplication and sections 183-1 and 183-2 IDFT. Here as example illustrates the case where the sequence length is N=11.

Section 181 DFT applies discrete Fourier transform (DFT) to navigate to the received signal, derived from section 112 demuxing, and outputs the signal to the frequency domain in section 182-1 through 182-N-1 complex multiplication and section 183-1 and 183-2 IDFT.

Incidentally, the processing of the DFT and IDFT processing can be replaced obrabotka the FFT (fast Fourier transform) and IFFT processing (inverse fast Fourier transform), respectively.

Here, under the assumption that the signal of the frequency domain outputted from the section 181 DFT is X(n)=Re{X(n)}+jIm{X(n)}, if each coefficient sequence Sadova-Chu with the sequence number u=a is equal to C_{u=a}*(n)=Re{C_{u=a}*(n)}+jIm{C_{u=a}*(n)}, then the result of evaluating Y_{u=a}(n) in terms of correlation on the side of the sequence u=a sections 182-1 through 182-N-l complex multiplication is the result presented in the following equation 7.

On the other hand, each coefficient sequence Sadova-Chu with the sequence number u=N-a is equal to C_{u=N-a}*(n)=(C_{u=a}*(n))*=Re{C_{u=a}*(n)}-jIm{C_{u=a}*(n)}, and the result of evaluating Y_{u=N-a}(n) in terms of correlation on the side of the sequence u=N-a is the result presented in the following equation 8.

Fig is a block diagram depicting the internal configuration section 182-n complex multiplication (1≤n≤N-1), depicted in Fig. On this drawing in section 191-1 multiplication Re{X(n)} is multiplied by Re{C_{u=a}*(n)}, and the result of the multiplication is shown in section 192-1 and 192-3 summation.

In section 191-2 multiplying Im{X(n)} is multiplied by Im{C_{u=a}*(n)}, and the result of the multiplication is shown in section 192-1 and 192-3 summation.

In addition, in section 191-3 multiplying Im{X(n)} is multiplied by Re{C_{u=a}*(n)}, and the result is at multiplication is shown in section 192-2 and 192-4 summation.

In addition, in section 191-4 multiplication Re{X(n)} is multiplied by Im{C_{u=a}*(n)}, and the result of the multiplication is shown in section 192-2 and 192-4 summation.

In section 192-1 summation sums up the multiplication results derived from sections 191-1 and 191-2 multiplication, and outputs the result of the summation Re{Y_{u=a}(n)}. On the other hand, in section 192-3 summation sums up the multiplication results derived from sections 191-1 and 192-2 multiplication, and outputs the result of the summation Re{Y_{u=N-a}(n)}.

In addition, in section 192-2 summation sums up the multiplication results derived from sections 191-3 and 191-4 multiplication, and outputs the result of the summation Im{Y_{u=a}(n)}. In addition, in section 192-4 summation sums up the multiplication results derived from sections 191-3 and 192-4 multiplication, and outputs the result of the summation Im{Y_{u=N-a}(n)}.

The internal configuration section 182-n complex multiplication, shown on Fig identical to the configuration section of the complex multiplication case for 1, is depicted in Fig.7.

Consequently, the results of multiplication operations performed to obtain the correlation values on the side of the sequence r=a, Re{X(n)}•Re{C_{u=a}*(n)}, Im{X(n)}•Im{C_{u=a}*(n)}, Im{X(n)}•Re{C_{u=a}*(n)} and Re{X(n)}•Im{C_{u=a}*(n)} can be used to calculate the correlation values on the side of the sequence r=N-a, and, thus, can the mind is nishit volume multiply and reduce the degree of integration schemes (the number of multipliers).

When N is an odd number and q=0, as one sequence Sadova-Chu is in respect of an even-symmetric sequence (each element of a sequence is equal to C_{u}(n)=C_{u}(N-l-k)), then the correlator performs the processing summation of elements of k and N-1-k to multiply, and thus, it is also possible to halve the number of multiplications (the number of multipliers).

Consequently, when the purpose of many different sequences Sadova-Chu one cell, in the embodiment 2 are combined and assigned sequence numbers that have such a relationship that the absolute value of the amplitude coefficients of the real part and the imaginary part of the sequence, each element of which is equal to C_{u}(n), equal (or complex conjugate to each other), and can thereby reduce the amount of calculation and the level of integration schemes correlation in the frequency domain at the receiver side without performance degradation detection sequence.

In the present embodiment, was considered the case where the sequence length N is a Prime number (odd number), but the sequence length N may also not be a Prime number (or odd or even number). However, when the sequence length N is an even number, let's assume that the assignment rule for which sledovatelnot preamble is u=a-> u=N-a-> u=N/2-a-> u=N/2+a (where 1≤a≤N/2-1, in addition, the order of assignment can be arbitrary), and thereby, it is possible to calculate the correlation of four different sequences of operation of multiplication (number of multipliers) for one sequence. Therefore, the amount of operation of multiplication and the number of multipliers of one sequence can be reduced to approximately 1/4. In addition, when the sequence length N is an even number, you can also reduce the number of bits required for notification of the appointment of the sequence by assigning the same index of the four combinations of sequences u=(a, N-a, N/2, N/2+a) as a way of notice of assignment sequences, as in the case Fig.

__An implementation option 3__

In the embodiment 3 of the present invention will be described the case where the preamble sequence generated in the time domain, and the sequence of the preamble is detected in the frequency domain.

Since the configuration of the UE according to a variant implementation 3 of the present invention similar to the configuration options exercise 1, is shown in figure 3, for its description will be used 3.

Fig is a block diagram depicting the configuration section 162 bundle RA under option ASU is estline 3 of the present invention. Fig differs from figure 10 that added section 202 N-point DFT, and section 171 of the formation of the ZC sequence is replaced by section 201 of the formation of the ZC sequence.

Section 201 of the formation of the ZC sequence generates a sequence of Sadova-Chu in the time domain, and outputs each coefficient (symbol) generated sequence Sadova Chu in section 202 of the N-point DFT.

Section 202 of the N-point DFT is the number of points is identical to the sequence length N of the sequence Sadova-Chu, converts the sequence Sadova-Chu N points, derived from sections 201 forming the ZC sequence to frequency components and outputs the frequency components in predetermined subcarriers section 172 IDFT.

By the way, Fig an example configuration is illustrated DFT-S-OFDM (discrete Fourier transform-expand-multiplexing orthogonal frequency division), and the signal of the time domain sequence Sadova-Chu, which is derived from sections 201 sequencing ZC in section 173 to add, CP, can be formed directly without the use of section 202 of the N-point DFT and section 172 of the IDFT.

52 the destination partition sequence (see figure 1). in accordance with this variant implementation is identical to the operations in embodiment 1, when the numbers of th the sequences of r=a and r=N-a, assigned in pairs, and differ in equation sequence Sadova-Chu, formed in section 201 of the formation of the ZC sequence.

For greater certainty, consistency Sadova-Chu generated in the time domain by section 201 of the formation of the ZC sequence is assigned to the sequence r=a, and the sequence of the resulting cyclic shift of r=N-a m" or "sequence, the resulting cyclic shift of r=a in m and a sequence r=N-a" formed a pair.

Here, m is changed depending on the values of q in equations 1 through 4. On Fig shows the relationship between m and q, when the sequence length N is an odd number. For example, m=N-1 (=-1), when q=0 and m=N-3=-3), when q=1.

When the sequence length N is a Prime number and q=0, the sequence Sadova-Chu generated in the time domain by section 201 of the formation of the ZC sequence is determined by the following equation 9 from equation 2, when the sequence r=a paired sequence, the resulting cyclic shift of r=N-a m.

Here, because the new games available at can be omitted, equation 9 can be expressed by the following equation 10.

Similarly, the case where the sequence of poluchasa a result of cyclic shift of r=a to m, forms a pair with the sequence r=N-a, can be expressed by the following equation 11.

where, k=0, 1, 2, N-1 and r - sequence number (the index of the sequence). In addition, r - mutually-simple, with N and an integer less than N.

Next will be described the method of notification about the index section 53 of the notice under option 3 implementation of the present invention. Indexes are defined for numbers of sequences assigned to each cell of section 52 of the destination sequence according to the table presented on Fig. On Fig, sequence number r=1, N-1 and the value of the initial shear m associated with index 1, and sequence number r=2, N-2 and the value of the initial shear m associated with index 2. Similar links are also made with indexes from index 3 and later. In the drawing, floor(N/2)" denotes an integer not exceeding N/2.

Indexes that are defined thus transmitted to the station UE from the BS through broadcasting channels. On the UE side may also be provided with an identical table on Fig, and there is identified a couple of available rooms sequences using reported indexes.

Consequently, when the purpose of many different sequences Sadova-Chu one cell, in the embodiment 3 are assigned numbers the sequence is in such combinations,
that supports the fact that the absolute values of the amplitudes of the coefficients of the real part and the imaginary part of the sequence Sadova-Chu, which is defined in the time domain, and in which each element is equal to C_{r}(k)that is equal to or are complex conjugate to each other, and also set the predetermined value of the initial cyclic shift of one or both sequences are assigned in pairs, and can thereby reduce the amount of calculation and the level of integration schemes correlation in the frequency domain at the receiver side without performance degradation detection sequence.

Through this option has been described the case as an example where the sequence Sadova-Chu defined in the time domain, and the detection of the preamble is performed in the frequency domain (the calculation of the correlation in the frequency domain), but in the case where the sequence Sadova-Chu defined in the frequency domain, and the detection of the preamble is performed in the time domain (the calculation of the correlation in the time domain), as in the case of option exercise 3, you can also keep that relationship that the absolute values of the amplitudes of the coefficients of the real part and the imaginary part is equal to the ratio of the coefficients of the two sequences Sadova-Chu in the time domain, through all the th sequences Sadova-Chu so, to sequence u=a, and the sequence of the resulting cyclic shift of u=N-a +a" or "the sequence of the resulting cyclic shift of u=a-a and a sequence u=N-a" formed a couple. Through this you can reduce the amount of calculation and the level of integration schemes correlation in the time domain at the receiver side.

In addition, in the above embodiments, the implementation was considered the case where sequences are used Sadova-Chu, but the present invention is not limited to this and can also be used GCL sequence.

Through the above-described embodiments, the configuration where the section 52 of the destination sequence and section 53 of the notice is included in section 51 resource control radio and BS, were considered as examples, but the present invention is not limited to this, and the present invention is also applicable to any other devices, for example, a relay station and a UE, which includes a section 52 of the destination sequence and section 53 notice and may notify about the indexes indicating the sequence number r.

In addition, the above-described embodiments of have been examined using a base station (BS) and the terminal station (UE) as an example, and base the station may also be called an access point (AP), relay station, the relay terminal, a node B, an enhanced node B (eNode B), etc. in Addition, the terminal station can also be called a mobile station (MS), station UE (subscriber equipment), subscriber end (TE), relay station, the relay terminal, etc.

In the above embodiments, the exercise was considered a case where the present invention is configured by hardware as an example, but the present invention may also be implemented by means of software.

In addition, each functional block used for explanation of the above embodiments, typically implemented as an LSI (LSI, a large integrated circuit), which is an integral scheme. They can be integrated in one-chip IC separately or can be integrated in one-chip IC, and may include some or all of the functional blocks. Here we use the term BIS, but this term can also be "IC" ("IP"), "system LSI", "super LSI or ultra LSI"depending on differences in the degree of integration.

Furthermore, the method of implementation of the integrated circuit is not limited to LSI, it can also be implemented through a dedicated circuit or a generic processor. You can also use the FPGA (programmiruemoi user-gate matrix), which may be programmable or reconfigurable processor, connections or settings schema fragments in BIS which can be reconfigured after manufacturing LSI.

In addition, if with the advancement of semiconductor technologies and other similar technologies to appear the implementation technology of the integrated circuit which may be substituted BIS, then, of course, possible to integrate the functional blocks with the use of this technology. You may want to consider biotechnology etc.

The disclosure of Japanese patent application No. 2006-269327, filed September 29, 2006, and Japanese patent application No. 2006-352897, filed December 27, 2006, which includes the description of the invention, drawings and summary, are fully incorporated in this document by reference.

**Industrial applicability**

The method of assigning sequence and the target sequence according to the present invention can reduce the amount of calculation and the level of integration schemes correlation at the receiver side in a system in which one cell is assigned to many different sequences Sadova-Chu or GCL sequences, and applicable to, for example, the mobile communications system.

1. Mobile station, comprising:

a receiving unit configured to receive information about consistently the threads,
available in a cell, and the broadcast information is transmitted from the base station;

selection block configured to select a sequence of sequences available in the cell;

the transmitting unit, configured to send the selected sequence as a preamble random access;

when this sequence is available in a cell, defined by the formula:

,

where k=0, 1, 2, ... N-1; q is an integer, and include the sequence with r=a and the sequence with r=N-a.

2. Mobile station according to claim 1, in which the sequence is available in a cell, optionally include a sequence with r=R' and the sequence with r=N-a', and a' not equal.

3. Mobile station according to claim 1, in which N is a Prime number.

4. Mobile station according to claim 1, in which the block selection randomly selects a sequence of sequences available in the cell.

5. The mode of transmission of the random access preamble containing phases in which:

take information on the sequences available in the cell, and the broadcast information is transmitted from the base station;

choose a sequence of sequences available in the cell;

pass the selected sequence as a preamble random access;

PR is this sequence,
available in a cell, defined by the formula:

,

where k=0, 1, 2, ... N-1; q is an integer, and include the sequence with r=a and the sequence with r=N-a.

6. The method according to claim 5, in which the sequence is available in a cell, optionally include a sequence with r=R' and the sequence with r=N-a', and a' not equal.

7. The method according to claim 5, in which N is a Prime number.

8. The method according to claim 5, in which the selection stage is the stage at which selects an arbitrary way, a sequence of sequences available in the cell.

**Same patents:**

FIELD: information technology.

SUBSTANCE: first and second sequences can be generated via circular shift a base sequence to a first and a second value, respectively. The base sequence can be a CAZAC (constant amplitude zero auto-correlation), PN (pseudorandom noise) sequence or some other sequence with good correlation properties. Circular shift of the first and second sequences can be defined based on a switching pattern. A first modulated sequence can be generated based on the first sequence and a first modulation symbol, and can then be sent over a first time interval. A second modulated sequence can be generated based on the second sequence and a second modulation symbol, and can then be sent over a second time interval. Each modulated sequence can be sent at K successive subcarriers using a localised frequency division multiplex (LFDM) scheme.

EFFECT: high throughput of the system with transmission of control information.

44 cl, 14 dwg

FIELD: information technology.

SUBSTANCE: method of transmitting control signal involves steps for multiplexing a plurality of 1-bit control signals within a given time-frequency domain via code division multiple access (CDMA) and transmitting the multiplexed control signals, wherein the plurality of the 1-bit control signals includes a plurality of 1-bit control signals for a specific transmitting side.

EFFECT: high efficiency and reliability of multiplexing.

10 cl, 9 dwg

FIELD: information technology.

SUBSTANCE: disclosed is a mobile station having: a module for correcting the transmission time interval which is configured to determine the transmission time interval in the mobile station - base station direction in units of the length of transmission time intervals in the base station - mobile station direction, such that the transmission time interval in the mobile station - base station direction is longer than that in the base station - mobile station direction; a transmission module configured to transmit a signal in the mobile station - base station direction in a transmission time interval defined by the module for correcting the transmission interval.

EFFECT: increase in the information transmission unit element on the time axis or frequency axis depending on conditions of the communication environment, which enables to lower the frequency of introducing the control channel and increase data transmission efficiency.

2 cl, 11 dwg

FIELD: information technology.

SUBSTANCE: base station communicates with a mobile station using OFDM via a downlink. The base station includes a clock signal generating module which generates an additional clock channel, a multiplication module which multiplies the scrambling code with the additional clock channel, and a transmitting module which transmits the additional clock channel which has been multiplied with the scrambling code. Cell-unique information is detected using the additional clock channel.

EFFECT: faster cell search.

17 cl, 13 dwg

FIELD: information technology.

SUBSTANCE: transmitting device has a frequency scheduling unit which is configured to allocate each user with either frequency blocks, which are serial carrier frequency blocks obtained by dividing the frequency band of the system, or distributed frequency blocks which are carrier frequency blocks which are discretely distributed in the frequency band of the system; and a conversion unit which is configured to associate transmitted data to frequency blocks or distributed frequency blocks in accordance with the allocation result. The frequency scheduling unit is configured to allocate distributed frequency blocks using frequency blocks as structural units and allocating sub-blocks obtained by dividing corresponding distributed frequency blocks.

EFFECT: high transmission capacity which enables the system to support localised and distributed data transmission.

23 cl, 41 dwg

FIELD: information technology.

SUBSTANCE: during transmission of a cell-specific pilot signal by a base station which can mix and then transmit unicast data and broadcast/multicast data as downstream data, the difference between the initial phase of a cell-specific pilot signal transmitted in a subframe in which the base station transmits the unicast data and the initial phase of a cell-specific pilot signal transmitted in the next subframe is equal to the difference between the initial phase of a cell-specific pilot signal transmitted in a subframe in which the base station transmits the broadcast/multicast data and the initial phase of a cell-specific pilot signal transmitted in the next subframe.

EFFECT: cell searching without increasing the scale or complicating the structure of the mobile station.

8 cl, 11 dwg

FIELD: information technology.

SUBSTANCE: transmitting device has a unit which provides a single-address channel; a unit which provides an MBMS channel; a unit which provides a unique pilot channel which is unique for a given cell; a unit which provides one or more common pilot channels which are common for several cells; a multiplexing unit which multiplexes the single-address channel, the MBMS channel, the unique pilot channel and one or more common pilot channels and generates a transmission symbol. The multiplexing unit performs time-division multiplexing on the same frequency band of the single-address frame containing the single-address channel, and the MBMS frame which contains the MBMS channel, wherein the input density of the common pilot channel contained in the MBMS frame is greater than the input density of the unique pilot channel contained in the single-address frame.

EFFECT: improved reception quality of an MBMS channel.

16 cl, 20 dwg

FIELD: information technology.

SUBSTANCE: transmitting device and receiving device in a mobile communication system which employs a scheme with one carrier in an uplink channel, has multiplexing apparatus configured to multiplex a pilot channel, a control channel and a data channel; and transmitting apparatus configured to transmit a transmitted symbol, comprising at least a pilot channel and a control channel, using an uplink channel. The first pilot channel used by the receiving device to determine channel status in an uplink channel, is transmitted using a frequency band with several resource blocks. The second pilot channel, used for channel compensation, transmitted in the uplink channel, is transmitted using a resource block allocated to the transmitting device. Control channels of the transmitting device and the device which is different from the said transmitting device are orthogonalised relative each other through an FDM scheme.

EFFECT: achieving frequency division effect, high transmission capacity.

7 cl, 9 dwg

FIELD: information technology.

SUBSTANCE: apparatus for detecting an OFDM symbol encoded with a transmitted sequence including a filter having coefficients based on a simplified version of the transmitted sequence is disclosed. A computer readable recording medium having a code and a wireless communication apparatus for realising the method are also described.

EFFECT: high efficiency and transmission capacity in a wireless communication system.

30 cl, 19 dwg

FIELD: information technologies.

SUBSTANCE: device comprises a module of single-address transfer channel generation arranged with the possibility to generate a single-address transfer channel; a module of MBMS channel generation arranged with the possibility to generate a MBMS channel; a module of multiplexing arranged with the possibility of multiplexing with time division of a single-address transfer channel and MBMS channel in a single frequency band; and a transmitting module arranged with the possibility of transmitted symbols transfer multiplexed with time division. In the proposed transmitting device, duration of a protective interval for a MBMS channel is set as larger than duration of a protective interval for a single-address channel.

EFFECT: reduced number of executed operations.

4 cl, 13 dwg

FIELD: communications engineering.

SUBSTANCE: proposed band selection method for mobile orthogonal frequency division multiple access communication system includes following steps to classify procedures of band selection between sending end and receiving ends with respect to original band selection process, passband width selection process, and periodic band selection process: determination of source band selection code (SC)number for source band selection process; SC number to request passband width for passband width request selection process and periodic SC number for periodic band selection process; determination of periodic SC deferment value in compliance with periodic SC number, and transmission of source SCs, passband width request SC, periodic SCs, and periodic SC deferment values on receiving ends.

EFFECT: minimized time for band selection access.

22 cl, 3 dwg, 4 tbl

FIELD: communications engineering.

SUBSTANCE: stationary wireless access system has, as a rule, user's room equipment unit connected through Ethernet interface to personal computer or to local network and base station unit connected through Ethernet interface to network. User's room equipment unit as such is easily installed by user while base station unit is usually mounted on mast at distance of 1 to 5 miles (1/6 to 8 km) from user's room equipment unit. Both the latter and base station unit usually incorporate integrated transceiver/data switch that provides for radio-frequency communications in the range of 2.5 to 2.686 GHz. Multiplexing with orthogonal frequency division of signals is used during transmission between user's room equipment units and base station ones over ascending and descending lines.

EFFECT: provision for using outwardly accessible antenna affording transmission within line-of-sight range.

70 cl, 19 dwg

FIELD: electrical and radio communications; underwater, radio, radio-relaying, and meteorological communication lines.

SUBSTANCE: start-stop communication system that has on sending end signal shaping and transfer unit 1 and on receiving end, receiver 2, amplitude detector 3, low-pass filter 4, first comparator 6, memory device 7, shift register 8, first decoder 9, switch 10, synchronizing unit 11, pulse shaper 12, pulse burst shaper 13, binary counters 14, 17, signal retrieval and storage device 19, and threshold device 5 is provided in addition with newly introduced second comparator 15, RS flip-flop 16, and second decoder 18.

EFFECT: reduced malfunction probability of proposed communication system.

1 cl, 3 dwg

FIELD: mobile telecommunication systems.

SUBSTANCE: device for decreasing relation of pike power to average power signal, sent along N(=2^{r}) sub-bearing lines in transmitting device, having encoders for block encoding of w input data, where r - real number > 2, and output of N code symbols, has: serial-parallel converter for transforming data flow to w-(r-2) parallel data flows, where w - length of information word, first coder for receipt of w/2 parallel data flows from w-(r-2) parallel data flows from serial/parallel converter, block encoding of w/2 parallel data flows and output of N/2 first code symbols, generator of input operators for generation of r-2 data flows of input operators, in accordance to w-(r-2) parallel data flows, and second coder for receiving parallel data flows from serial/parallel converter, which were not received at first coder and (r-2) data flows from input operators, block encoding of received data flows and output of N/2 second code symbols, while r-2 data flows of input operators provide for complementarity of N code symbols.

EFFECT: higher efficiency, higher reliability.

6 cl, 22 dwg

FIELD: engineering of devices and methods for receipt and synchronization in direct digital satellite broadcast system.

SUBSTANCE: satellite system uses modulation with temporal signals separation and single-frequency network of ground-based re-emitting stations, each of which introduces a delay to ground signal. Delay allows to provide for coincidence of time of receipt of early modulated signal in the center of ground broadcasting zone with time of receipt of appropriate late modulated signal, thus improving switching between ground and satellite signals in receiver. Delay also compensates processing delay, occurring during conversion of satellite modulated stream under direct visibility conditions to multi-frequency modulated stream for transmission of satellite modulated stream under direct visibility conditions to user receivers. Delay is also adjusted in accordance to distance difference between each ground-based re-emitting station and satellite and between each station and center of ground-based broadcasting zone. Adjustment as described above optimizes receipt of temporal signals separation modulated and multi-frequency modulated signals by means of synchronization in the center of single-frequency system of phase of multi-frequency modulated signals, re-emitted from re-emitting stations of single-frequency system.

EFFECT: increased quality of radio-signal receipt.

8 cl, 12 dwg

FIELD: engineering of devices for generating series of preamble with low ratio of pike to average power in communications system with orthogonal multiplexing and frequency separation of channels.

SUBSTANCE: in accordance to method, first series of preamble is generated, wherein odd data of input series of preamble are transformed to zero data, and even data of aforementioned series are transformed to nonzero data, first series of preamble is transmitted through one of two antennas, second preamble series is generated, wherein even data of input series of preamble are transformed to zero data, and odd data of aforementioned series are transformed to nonzero data, second series of preamble is transmitted through another antenna.

EFFECT: increased efficiency.

6 cl, 10 dwg

FIELD: electric communications engineering, in particular, engineering of multichannel communication systems.

SUBSTANCE: system for transmitting discontinuous information contains at transmitting side information sources, multipliers, adder, clock generator, Walsh functions generator, 2^{n} keys (where 2^{n} - number of outputs of Walsh functions generator) and frequency splitter, two elements of one-sided conductivity and 2^{n} additional multipliers, and on receiving side - clock generator, Walsh functions generator, multipliers, integrators, information receivers, 2^{n} keys and frequency splitter, two elements of one-sided conductivity and 2^{n} additional multipliers. As a new addition, on transmitting side two one-sided conductivity elements are inserted and 2^{n} additional multipliers, and on receiving side - two one-sided conductivity elements and 2^{n} additional multipliers.

EFFECT: decreased frequency band due to decreased effective width of channel carriers spectrum.

6 dwg, 1 tbl

FIELD: engineering of communication systems, using multi-access layout based on orthogonal multiplexing circuit with frequency division.

SUBSTANCE: communication system divides whole range of frequencies onto a set of sub-frequency ranges. Receiver of information about quality of channels receives information about quality of channels for each one of a set of frame cells, occupied during first time span by a set of frequency-time cells, occupied by second time span and a given number of sub-frequency ranges, transferred via check communication channel from receiver. Module for sorting frame cells analyzes information about quality of check communication channels and sorts frame cells in accordance to information about quality of channels. Module for assigning sub-channels, if transfer data exist, transfers data through a frame cell with best channel quality among other frame cells.

EFFECT: increased data transfer speed.

5 cl, 6 dwg

FIELD: electric radio engineering, possible use for increasing quality of electric communication, especially in multi-frequency wireless communication systems.

SUBSTANCE: method for decreasing ratio of peak signal power to its average ratio PAPR in multi-frequency communication systems, in which information symbol is formed by a set of signals, each one of which is centered on one of multiple bearing frequencies, is characterized by the fact that in transmitter a set of bearing frequencies is divided on several sections - subsets of bearing frequencies, information symbol, PAPR value of which does not exceed required threshold PAPR_{0}, is transferred via all carriers, information symbol, value PAPR of which exceeds required threshold PAPR_{0} is divided on several sub-symbol sections, while number of these sections equals number of sub-carrier subsets, each section of symbol is transferred same as full symbol, wherein data are only transferred on one group of carriers, while other carriers are not modulated, in receiver, arrival of incomplete symbol is identified by analysis of amplitudes of carrier signals, which are not modulated in case of symbol division. Multi-frequency communication system is characterized by construction of receiver and transmitter, adapted for execution of operations, included in proposed method.

EFFECT: preservation of high channel capacity with simplified correction procedure.

2 cl, 12 dwg

FIELD: the invention refers to the field of radio technique and may be used for transmission of information with the aid of signals with orthogonal frequency multiplexing.

SUBSTANCE: the technical result is in increasing accuracy of synchronization of signals with orthogonal frequency multiplexing and that in its turn provides reduction of error possibility at reception of these signals even in such complex propagation conditions as shot-wave range channels. For this in the receiving set of the known equipment two memory blocks, two commutators, a maximum choice selection block, a meter and a time intervals calculation block are introduced.

EFFECT: increases accuracy of signals.

6 dwg