Sequence report method and sequence report device
9 claims: 2 independent, 7 dependent
- 1REIVINDICAÇÕES 1. Aparelho para relatar sequência que correlaciona índices tendo números consecutivos a uma pluralidade de sequências de código diferentes e aloca os índices em células, de modo que os índices são consecutivos, o aparelho para relatar sequência compreendendo:uma seção de armazenamento que armazena relações de correspondência que correlacionam índices tendo números consecutivos com uma pluralidade de sequências de código diferentes;e uma seção de relatório que relata a informação combinando um índice indicando uma das sequências de código alocadas e a informação indicando o número de sequências alocadas como informação de sequência de alocação com base nas relações de correspondência.
- 2Aparelho para relatar sequência de acordo com a reivindicação 1, no qual a seção de relatório, quando a sequência de código é uma sequência Zadoff-Chu ou sequência GCL e a seção de armazenamento armazena relações que correlacionam índices tendo números consecutivos com um conjunto de número de sequência r=a, N-a (1<a<N-1), relata a informação da sequência de alocação combinando um índice indicando um dos conjuntos da sequência de código alocada e a informação indicando um número de sequências alocadas.
- 3Aparelho para relatar sequência de acordo com a reivindicação 1, no qual a seção de armazenamento armazena as relações de correspondência para as quais o número de sequências alocadas é limitado.
- 4Aparelho para relatar sequência de acordo com a reivindicação 3, no qual a seção de relatório, quando a seção de armazenamento armazena as relações de correspondência diferindo para cada sequência alocada, relata a informação da sequência de alocação combinando um tipo de índice indicando um número de sequências alocadas e o índice.
- 5Aparelho para relatar sequência de acordo com a reivindicação 3, no qual a seção de relatório, quando a seção de armazenamento armazena relações de correspondência que correlacionam índices tendo números consecutivos com todos os conjuntos de sequências de código aloca2 das em um número de sequências alocadas, relata um índice indicando uma sequência de código alocada como a informação da sequência de alocação.
- 6Aparelho para relatar sequência de acordo com a reivindicação 1, no qual a informação indicando o número de sequências alocadas é uma quantidade de deslocamento cíclico.
- 7Aparelho para relatar sequência de acordo com a reivindicação 2, no qual a seção de armazenamento armazena relações de correspondência que correlacionam índices tendo números consecutivos com uma pluralidade de sequências de código diferentes de modo que os raios de célula aplicáveis de cada sequência de código para um aparelho da estação móvel de comunicação sem-fio que se move em alta velocidade ficam em ordem ascendente ou ordem descendente.
- 8Aparelho para relatar sequência de acordo com a reivindicação 2, no qual a seção de armazenamento armazena relações de correspondência que correlacionam índices tendo números consecutivos com uma pluralidade de sequências de código diferentes, de modo que quantidades de deslocamento cíclico aplicáveis de cada sequência de código para um aparelho da estação móvel de comunicação sem-fio que se move em alta velocidade ficam em ordem ascendente ou ordem descendente.
- 9Método para relatar sequência que, com base nas relações de correspondência que correlacionam índices tendo números consecutivos com uma pluralidade de sequências de código diferentes, relata, como a informação da sequência de alocação, a informação que combina um índice indicando uma das sequências de código alocadas em uma célula, tal que os índices são consecutivos, e a informação indicando o número de sequências alocadas. 1/21 51 seção de gerenciamento de recursos de rádio e> LL. 2/21 a 105 seção de processamento de transmissão de dados DL CO o X5 Cü “O CO O Ό O »Π3 O Q_ Φ O Φ l_ Φ X3 Φ E ω ω co Φ o O Φ “O o ICO o Φ co tn θ .2 o ω £ ο <φ Σ3 cr £ φ 4C Φ O i«3 O Φ CO CO CU 10 x> o o w ICC Φ OT3 E 2 E ω £ E c o — c 9> o> ο ό
Independent claims9
229 paragraphs, as filed
(54) Title: METHOD FOR REPORTING SEQUENCE AND (57) Summary: DEVICE FOR REPORTING SEQUENCE (30) Unionist Priority: 03/19/2007 jp 2007-071194 (73) Owner (s): Panasonic Corporation (72) Inventor (s) ): Atsushi Matsumoto, Daichi Imamura, Kazunori Inogai, Sadaki Futagi, Takashi Iwai (74) Attorney (s): Dannemann .Siemsen, Bigler & Ipanema Moreira (86) International Request: pct JP2008000637 of 18/03/2008 (87) Publication International: wo 2oos / i29797de 10/30/2008
<img file="BRPI0809404A2_D0001.tif" />
Invention Patent Descriptive Report for METHOD FOR REPORTING SEQUENCE AND DEVICE FOR REPORTING SEQUENCE.
Technical Field
The present invention relates to a method for reporting sequence and apparatus for reporting sequence that reports a ZadoffChu sequence or GCL (Generalized Chirp-Lik) sequence allocated in a cell. Previous Technique
In a mobile communication system typified by a cellular communication system, or a wireless LAN (local area network) system, a random access field is provided in a transmission field. This random access field is provided in an uplink transmission field when a terminal station (hereinafter referred to as UE) initially makes a connection request at a base station (hereinafter referred to as BS), or when a BS or similar makes a new resource allocation request in a centralized management system that allocates the transmission time of the UE and the transmission range. A base station can also be called an access point or Node B.
With a burst of random access (hereinafter referred to as RA burst) transmitted in a field of random access (hereinafter referred to as RA space), unlike the other programmed channels, a reception and retransmission error occurs due to a sequence collision subscription (transmission of an identical signature sequence using the same RA space by a plurality of UEs) or due to interference between signature sequences. When an RA burst collision or reception error occurs, the delay in processing the RA burst uplink transmission regulation synchronization and processing the BS connection request increases. Consequently, there is a demand for a reduction in the signature sequence collision rate and an improvement in the signature sequence detection performance.
In the mobile communication system described in Non-Patent Document 1, as a preamble sequence of the RA burst (hereinafter referred to as RA preamble), a RA preamble sequence (or signature sequence) that uses a Zadoff-Chu sequence (hereinafter referred to as RA) as ZC sequence) or GCL sequence (Non-Patent Document 2) having a low autocorrelation characteristic and cross correlation characteristic between sequences is investigated. Also, the use of a ZC-ZCZ sequence (Zadoff-Chu zero correlation zone) generated by performing a cyclic spacing of a ZC sequence is investigated.
With a ZC sequence and GCL sequence, an autocorrelation characteristic is optimal when its sequence number r and sequence length N satisfy a relatively prime (coprimo) relationship. Also, with respect to a cross-correlation characteristic between two sequences, if sequence numbers are indicated by ner<sub>2</sub>, respectively, the value of the cross correlation is constant in \ N when the absolute value of the difference between η and r<sub>2</sub> and the length of the N sequence satisfy a relatively prime number relationship. Therefore, when the length of sequence N is a prime number, a set of sequences for which an autocorrelation characteristic and cross-correlation characteristic are optimal is obtained for N-1 sequences - that is, all sequences with the sequence number r = 1, 2 ..... N-1.
Also, in the mobile communication system described in Non-Patent Document 1, always allocating 64 ZC-ZCZ sequences in a cell is investigated. These 64 sequences include ZC sequences with different sequence numbers and cyclic shift sequences - that is, ZC-ZCZ sequences - generated from the ZC sequences having the respective sequence numbers.
The number of ZC-ZCZ sequences that can be generated from a ZC sequence depends on the amount of the cyclic shift between sequences. If the amount of cyclic displacement is indicated by Δ and the sequence length is indicated by N, the generated number of ZC-ZCZ sequences is expressed as a minimum (N / A), where minimum (x) represents the largest integer that does not exceeds x. To consider a time (A<sub>you</sub>mpo) corresponding to the amount of cyclic displacement Δ, the amount of cyclic displacement Δ is defined by a time range over which it is possible for a preamble RA transmitted from a UE to arrive. Specifically, the amount of cyclic displacement Á<sub>you</sub>mpo θ adjusted to be greater than the sum of the expected maximum rounding value (TRetardRounding) based on the propagation delay time between a BS and the UE (TRetardRounding) θ the maximum expected value of the multiple trajectory delay time (TExpansãoretardo) (Atempo '<sup>></sup>2xT<sub>R</sub>etardoPropagação TExpansãoRea tardo)
Therefore, since the propagation delay time between a BS and UE increases in proportion to the cell size (cell radius), the larger the cell size of a cell, the smaller the number of ZC-ZCZ sequences that can be generated from a ZC sequence. Consequently, in order to allocate 64 preamble sequences in a cell, it is necessary to allocate many ZC sequences with different sequence numbers in the cell.
A BS generates a broadcast channel with sequence numbers from the sequences used by a cell as allocation sequence information and reports this to the UEs present within the cell. Each UE generates an RA burst using a ZC sequence having a reported sequence number and performs random access. One method for reporting possible allocation sequence information is to report sequence numbers for the sequences used by a cell one at a time. This method allows for flexible sequence allocation as long as arbitrary sequence numbers are allocated in a cell.
Non-Patent Document 1: 3GPP TSG RAN; Physical Channels and Modulation (Version 8), TS36.211V1.0.0
Non-Patent Document 2: Generalized Chirp-Like Polyphase Sequences with Optimum Correlation Properties, Branislav M. Popovic, IEEE Transaction on Information Theory, Vol. 38, No. 4, July 1992. Description of the Invention
Problems to be solved by the invention
However, with the method for reporting allocation sequence information described above, in the case of a cell with a large cell radius, it is necessary to report a maximum of 64 ZC sequences and the amount of signaling from the broadcast channel (number of bits) increases. The allocation sequence information is the information that is required by a UE before the transmission of the RA preamble, and is therefore transmitted robustly (ie, using a modulation method providing low transmission data rate, encoding rate and so on) to enable it to be received correctly even by a UE in an environment of poor reception. Consequently, as the amount of signaling increases, radio resources are consumed proportionately.
It is an object of the present invention to provide a method for reporting sequence and apparatus for reporting sequence that reduce the amount of signaling for reporting a Zadoff-Chu sequence or GCL sequence allocated in a cell.
Problem Resolution Medium
An apparatus for reporting the sequence of the present invention correlates indexes having consecutive numbers to a plurality of different code sequences and allocates the indexes in cells, so that the indexes are consecutive, and uses a configuration having a storage section that stores correspondence relations that correlate indices having consecutive numbers with a plurality of different code strings, and a report section that reports information by combining an index indicating one of the allocated code strings and the information indicating the number of sequences allocated as allocation sequence information based on matching relationships.
A method for reporting sequence of the present invention, based on matching relationships that correlate indexes having consecutive numbers with a plurality of different code sequences, reports, as the allocation sequence information, information that combines an index indicating one of the sequences of code allocated in a cell, such that the indexes are consecutive, and the information indicating the number of code sequences allocated.
Advantageous Effects of the Invention
The present invention allows the amount of signaling to report a Zadoff-Chu sequence or GCL sequence allocated in a cell to be reduced.
Brief Description of Drawings
Figure 1 is a block diagram showing a configuration of a wireless communication system according to modality 1 of the present invention,
Figure 2 is a block diagram showing a BS configuration shown in figure 1,
Figure 3 is a block diagram showing a configuration of a UE according to embodiment 1 of the present invention,
Figure 4 is a drawing showing an internal configuration of the preamble sequence detection section shown in Figure 2,
Figure 5 is a drawing showing correspondence relations between sequence numbers and indexes according to modality 1 of the present invention,
Figure 6 is a drawing showing a configuration of a diffusion channel according to embodiment 1 of the present invention,
Figure 7 is a flow chart showing the operation of the sequence allocation section shown in Figure 1,
Figure 8 is a drawing showing a configuration of the allocation sequence information according to embodiment 1 of the present invention,
Figure 9 is a drawing showing correspondence relations between sequence numbers and indexes according to modality 1 of the present invention,
Figure 10 is a block diagram showing a system configuration of the distributed management type,
Figure 11 is a drawing showing correspondence relations between sequence numbers and indexes according to modality 2 of the present invention,
Figure 12 is a drawing showing a configuration of a diffusion channel according to embodiment 2 of the present invention,
Figure 13 is a drawing showing the correspondence relations between allocated sequence numbers and report bits according to modality 3 of the present invention,
Figure 14 is a drawing showing a configuration of a diffusion channel according to embodiment 3 of the present invention,
Figure 15 is a drawing showing the correspondence relationships between a number of cyclic displacement sequences that can be generated from a sequence and a required number of sequences allocated with respect to the cell size (radius),
Figure 16 is a drawing showing the correspondence relations between sequence numbers and indexes according to modality 4 of the present invention,
Figure 17 is a drawing showing a configuration of a diffusion channel according to embodiment 4 of the present invention,
Figure 18 is a drawing showing correspondence relationships between types of index and preamble sequence tables according to embodiment 4 of the present invention,
Figure 19 is a drawing showing correspondence relations between sequence numbers and indexes according to modality 5 of the present invention,
Figure 20 is a drawing showing a configuration of a diffusion channel according to embodiment 5 of the present invention,
Figure 21 is a drawing showing the relationship between a correlation value of the ZC sequence and the amount of cyclic displacement Δ according to modality 6 of the present invention,
Figure 22 is a drawing showing correspondence relations between sequence numbers and indexes according to modality 6 of the present invention,
Figure 23 is a drawing showing correspondence relations between sequence numbers and indexes according to embodiment 6 of the present invention; and
Figure 24 is a drawing showing correspondence relationships between sequence numbers and indexes according to embodiment 6 of the present invention.
Best Mode for Carrying Out the Invention
Now, embodiments of the present invention will be described in detail with reference to the accompanying drawings.
(Mode 1)
First, a ZC sequence will be shown using equations. A sequence ZC of sequence length N is represented by equation (1) when N is an even number and by equation (2) when N is an odd number.
[1] c<sub>r</sub> (k) - exp
2 / zr
Ίν<sup>-</sup>
... (Equation 1) [2] c<sub>r</sub>(£) = exp <- j + g *)> ... (Equation 2)
Here, k = 0, 1, 2, ..., N-1, q is an arbitrary integer, r is a sequence number (sequence index) and r has a mutually prime relationship with N and is an integer positive less than N.
Next, a GCL sequence will be shown using equations. A GCL sequence of sequence length N is represented by equation (3) when N is an even number and equation (4) when N is an odd number.
[3] c<sub>r</sub>,<sub>m</sub> (Λ) = exp. 2zzr
<img file="BRPI0809404A2_D0002.tif" />
k<sup>2</sup> , Ί
--l · qk ^ (fcmodm) ... (Equation 3) [4] (k) = exp ~ J
2πτ ~ N ~ k (k + V) + qk • ^ (Amodzw) ... (Equation 4)
Here, k = 0, 1, 2 ..... N-1, q is an arbitrary integer, r has a mutually prime relationship with N and is an integer less than N, bj (k mod m) is an arbitrary complex number and i = 0, 1, m-1. Also, when minimizing the cross correlation between GCL sequences, the arbitrary complex number of amplitude 1 is used for b, (k mod m).
A GCL sequence is a sequence resulting from multiplying a ZC sequence by bj (k mod m), and since the calculation of the correlation on the receiving side is similar to that for a ZC sequence, a ZC sequence will be taken as an example in the description Following. A case will be described below in which a sequence ZC for which the length of the sequence N is an odd number and a prime number is used as a preamble sequence of the RA burst.
Figure 1 is a block diagram showing a configuration of a wireless communication system according to embodiment 1 of the present invention. In this figure, the radio resource management section 51 manages radio resources allocated in the plurality of BS's (N ° 1 to N ° M) 100-1 to 100-M, and is equipped with the sequence allocation section 52 and report section 53.
Sequence allocation section 52 allocates the sequence number ZC r in a cell managed by a subordinate BS and releases the allocated sequence number r for report section 53. Report section 53 reports information indicating the sequence number r released from the sequence allocation section 52 for the plurality of BS's 100-1 to 100-M. Details of the sequence allocation section 52 and report section 53 will be provided later here.
Based on information indicating the reported sequence number r from report section 53, BS's 100-1 to 100-M report allocation sequence information to a UE within its own cell using a reporting method described further late here and detects a preamble sequence transmitted from the UE. Since BS's 100-1 to 100-M all have identical functions, they will be collectively treated as BS 100 in the following description.
Figure 2 is a block diagram showing the BS 100 configuration shown in figure 1. In this figure, the processing section of the diffusion channel 101 is equipped with the generation section of the diffusion channel 102, coding section 103 and section of modulation 104. Based on the information indicating the number of the allocated allocation sequence r of the reporting section 53 shown in figure 1, the generation section of the broadcast channel 102 reads the corresponding information from the storage section of the preamble sequence table 113 and generates a diffusion channel which is a downlink control channel including reading information. The generated broadcast channel is released to the coding section 103.
The encoding section 103 encodes the diffusion channel released from the generation section of the diffusion channel 102 and the modulation section 104 modulates the encoded diffusion channel using a modulation method such as BPSK or QPSK. The modulated diffusion channel is released for multiplexing section 108.
The DL 105 transmission processing section is equipped with the coding section 106 and the modulation section 107 and performs the transmission processing of the DL transmission data. The encoding section 106 encodes the DL transmission data and the modulation section 107 modulates the encoded DL transmission data using a modulation method, such as BPSK or QPSK, and releases the modulated DL transmission data for the multiplexing section 108 .
Multiplexing section 108 performs time multiplexing, frequency multiplexing, spatial multiplexing, or code multiplexing of the broadcast channel code released from modulation section 104 and DL transmission data released from modulation section 107 and releases a multiplex signal to the RF transmission section 109.
The RF transmission section 109 performs predetermined radio transmission processing such as D / A conversion, filtering and upward conversion on the multiplex signal released from multiplexing section 108 and transmits a signal that has undergone radio transmission processing from the antenna 110.
The RF reception section 111 performs predetermined radio reception processing such as downward conversion and A / D version 10 on a signal received via antenna 110 and releases a signal that has undergone radio reception processing to the separation section 112.
The separation section 112 separates the signal released from the RF receiving section 111 into an RA space and an UL data space and frees the separate RA space for the sequence detection section of preamble 114 and the separate UL data space for the demodulation section 116 of the UL 115 receiving data processing section.
The preamble sequence table storage section 113 stores a preamble sequence table correlating preamble sequences that can be allocated by the sequence allocation section 52 shown in figure 1, corresponding sequence numbers and indexes indicating those sequence numbers, reads a preamble sequence from the table based on the information indicating the reported allocation sequence number r from report section 53 shown in figure 1 and releases the preamble sequence relevant to the preamble sequence detection section 114.
The preamble sequence detection section 114 performs correlation processing and similar preamble waveform detection processing for an RA space freed from separation section 112 using a preamble sequence stored in the sequence table storage section of preamble 113 and detects whether a preamble sequence was transmitted or not from a UE. The detection result (RA burst detection information) is released to an upper layer not shown in the figure.
The UL 115 receiving data processing section is equipped with demodulation section 116 and decoding section 117 and performs UL data receiving processing. Demodulation section 116 performs channel response distortion correction for UL data released from separation section 112 and performs signal point determination via an inflexible decision or flexible decision corresponding to the modulation method and section decode 117 performs error correction processing for the result of the signal point determination by the demodulation section 116 and releases the received UL data.
Figure 3 is a block diagram showing the configuration of the UE 150 according to embodiment 1 of the present invention. In that figure, the RF reception section 152 receives a signal transmitted from the BS 100 shown in figure 1 via antenna 151, performs predetermined radio reception processing, such as downward conversion and A / D conversion on the received signal and releases a signal that has undergone radio reception processing for separation section 153.
The separation section 153 separates a broadcast channel and DL data included in the received signal from the RF reception section 152 and releases the separate DL data for the demodulation section 155 of the DL data receiving processing section 154 and the transmission channel. separate diffusion for demodulation section 158 of the reception processing section of diffusion channel 157.
The DL data receiving processing section 154 is equipped with the demodulation section 155 and the decoding section 156 and performs the DL data receiving processing. The demodulation section 155 performs the correction of the distortion of the channel response of the DL data released from the separation section 153 and performs the signal point determination by means of an inflexible decision or flexible decision corresponding to the modulation method and the decoding 156 performs error correction processing for the result of the signal point determination by the demodulation section 155 and releases the received DL data.
The reception processing section of the diffusion channel 157 is equipped with the demodulation section 158, decoding section 159 and the processing section of the diffusion channel 160 and performs the reception processing of the diffusion channel. The demodulation section 158 performs the correction of the distortion of the channel response of a diffusion channel released from the separation section 153 and performs the signal point determination by means of an inflexible decision or flexible decision corresponding to the modulation method and the decoding section 159 performs error correction processing for the result of the diffusion channel signal point determination by the demodulation section 158. A broadcast channel that has undergone error correction processing is released into the processing section of broadcast channel 160. The processing section of broadcast channel 160 releases the allocation sequence information included in the output in the broadcast channel released from the decoding section 159 for the storage section of the preamble sequence table 161 and releases another broadcast channel to an upper layer not shown in the figure.
The storage section of the preamble sequence table 161 stores a preamble sequence table owned by the storage section of the preamble sequence table 113 of the BS 100 shown in figure 2 - that is, a preamble sequence table correlating sequences of preamble that can be allocated by the sequence allocation section 52 shown in figure 1, corresponding sequence numbers and indices indicating those sequence numbers. Next, a preamble sequence corresponding to the allocation sequence information released from the processing section of the diffusion channel 160 is released to the RA 162 burst generation section.
When acquiring a directive RA burst transmission from an upper layer not shown in the figure, the RA burst generation section 162 selects a usable preamble sequence from the preamble sequence table storage section 161, generates an RA burst including the selected preamble sequence and releases the generated RA burst for multiplexing section 166.
The UL 163 data transmission processing section is equipped with coding section 164 and modulation section 165 and performs UL data transmission processing. The encoding section 164 encodes the UL transmission data and the modulation section 165 modulates the encoded UL transmission data using a modulation method such as BPSK or QPSK and releases the modulated UL transmission data to the multiplexing section 166.
The multiplexing section 166 multiplexes the RA burst released from the RA burst generation section 162 and the UL transmission data released from the modulation section 165 and releases a multiplex signal to the RF transmission section 167.
The RF transmission section 167 performs predetermined radio transmission processing such as D / A conversion, filtering and upward conversion on the multiplex signal released from multiplexing section 166 and transmits a signal that has undergone radio transmission processing from the antenna 151.
Next, the sequence detection section of preamble 114 shown in figure 2 will be described. Figure 4 is a drawing showing the internal configuration of the sequence detection section of Preamble 114 shown in Figure 2. A case is shown here by way of example in which the sequence length N = 11 and a sequence pair ZC of sequence number r = a and sequence number r = Na are allocated as a sequence of the preamble, where a represents a number arbitrary sequence number that the sequence number r can be.
In figure 4, if an input signal from delay device D is indicated by r (k) = ai <+ jbk, and each coefficient of a sequence number ZC of sequence r = a is indicated by C<sub>r</sub>= a * (k) = c<sub>k</sub>+ jdk, so for the complex multiplication section x, a calculation result for the correlation on the sequence number side r = a is the<sub>k</sub>Ck-b<sub>k</sub>dk + j (bkCk + akdk). On the other hand, each coefficient of a sequence ZC of the sequence number r = Na is c, - = na * (k) = (a<sub>r</sub>= a * (k)) * = Ck-jd<sub>k</sub> and the result of the calculation for the correlation on the sequence number side r = Na is the<sub>k</sub>Ck + bkd<sub>k</sub>+ j (bkCk-akdk).
Therefore, as the result of the multiplication calculation performed to obtain a correlation value on the side of the sequence number r = a, akCk, bkdk, bkC<sub>k</sub>, and the<sub>k</sub>d<sub>k</sub> can be used for the calculation of a correlation value on the side of the sequence number r = Na, the amount of multiplication calculation can be reduced compared to reception processing when the sequence number r = a and the sequence number r = Na they are not allocated as a pair, and the circuit scale (number of multipliers) can be reduced.
Also, as can be seen from figure 4, a ZC sequence has a relationship with an even object sequence (the elements of the sequence being Cr (k) = c<sub>r</sub>(N-1-k)) and therefore the number of multiplications (number of multipliers) can be reduced further by performing multiplication processing by means of which the elements k and Ν-1-k are added before the multiplication calculation by a correlation mechanism.
In the following, a method present for reporting allocation sequence information will be described.
Figure 5 is a drawing showing a preamble sequence table according to embodiment 1 of the present invention. In figure 5, the sequence number r = 1 is correlated with the index 1 and the sequence number r = N-1 with the index 2, and the sequence number r = 2 is correlated with the index 3 and the number of sequence r = N-2 with index 4. The same type of sequence number correlation r also applies from index 5 onwards.
When sequence numbers are allocated to cells by the sequence allocation section 52 shown in figure 1, necessary ZC sequences of number of K sequences are allocated in each cell according to the table shown in figure 5, so that the indices are consecutive . Information indicating the sequence number r of the allocated sequences is reported for report section 53.
Report section 53 reports a ZC sequence allocated by the sequence allocation section 52 in BS 100 which is the allocation object. The generation section of the broadcast channel 102 of BS 100 generates a broadcast channel (BCH) including the allocation sequence information reported from report section 53.
Figure 6 is a drawing showing the configuration of the diffusion channel 300 generated by the generation section of the diffusion channel 102. The generation section of the broadcast channel 102 references the storage section of the preamble 113 sequence table storing the table shown in figure 5 and generates the allocation sequence information 302 by combining the starting index number 3021 indicating a correlated index with the first consecutively allocated ZC sequence index number and the allocated sequences number 3022 indicating the allocated number of ZC sequences. The allocation sequence information 302 is included in the broadcast channel 300 and is reported for each UE.
Here, the number of bits X of the starting index number 3021 is a number of bits required to report a sequence number ZC and when the number of sequences is N-1, X = maximum (log2 (N-1)). Also, the number of Y bits in the number of allocated sequences 3022 is a number of bits needed to report the maximum number of allocations that can be made in a cell, M, where Y = maximum (log2 (M)). Here, maximum (x) represents x when x is an integer and represents the smallest integer among integers greater than x when x is a non-integer value.
An index number and a number of allocated strings decided in this way are reported to the UE 150 of the BS 100 via a broadcast channel. On the UE 150 side, too, a table identical to the table shown in figure 5 is provided in the storage section of the preamble 161 sequence table and usable sequence numbers are identified using the reported unique index number and the number of sequences allocated . The UE 150 selects a sequence number from among the usable sequence numbers identified, generates an RA burst including a preamble sequence and transmits that in an RA space.
Figure 6 shows an example in which an index number at the beginning of the allocated strings is reported, but an index number at the end, or at a specific position decided in advance between the radio resource management section 51, BS 100 and UE 150, can also be used.
Next, the operation of the sequence allocation section 52 shown in figure 1 will be described using figure 7. In step (hereinafter abbreviated as ST) 401 in figure 7, counter a is initialized (a = 1) and the number of allocations in a cell is set to K.
In ST402, it is determined whether or not even one of the consecutive K sequences from index number a to index number a + K-1 has been allocated. If none were allocated (NO) - that is, if all K sequences are available for allocation - the processing flow proceeds to ST404 in order to perform sequence allocation, whereas even one of the consecutive K sequences has been allocated ( YES), counter a is increased (a = a + 1) in ST403 and the processing flow returns to ST402.
In ST404, sequences from index number a through index number a + K-1 are allocated and sequence allocation processing is terminated. In ST401, ST402 and ST404, the sequences allocated are shown as being searched in order of ascending sequence number, but the search order (counter order a) is not limited to this.
Figure 8 shows the configuration of a preamble sequence table and diffusion channel allocation sequence information when the length of the ZC sequence N = 839 and the maximum number of sequences that can be allocated in a cell is 64.
Since the length of the sequence N is the prime number 839, the number of strings that can be allocated is 838 and the number of indexes is also 838. Therefore, the number of bits required for the index number report is 10. Also , since the number of allocations is 1 to 64 (maximum), the number of bits required for a number of allocated strings report is six. Therefore, the number of bits required to report an allocated sequence number and sequence number is always 16.
On the other hand, when arbitrary sequence numbers are allocated in a cell, assuming that 10 bits are required for an index report for each allocated sequence and the maximum number of sequences allocated is 64, a maximum of 640 bits (= 10 bits x 64 sequences) is necessary, and therefore, the application of the mode 1 reporting method allows the number of signaling bits to be reduced from a maximum of 640 to 16, allowing the amount of signaling to be reduced by a maximum of 97.5%.
In this way, according to modality 1, the processing time of signaling the information of the allocation sequence reported by a broadcast channel can be reduced. Also, since a fixed size is used regardless of the number of sequences allocated, the number of bits of information in the allocation sequence can be kept constant regardless of the number of allocated sequences, allowing the size of the broadcast channel to be fixed and transmission / reception processing settings are simplified.
With respect to a method for reporting allocation sequence information for BS's 100-1 to 100-M of report section 53, also, the amount of signaling can be reduced by reporting in the same way as with the BS 100 reporting method for the UE 150.
In this modality, a case has been described in which the length of the sequence N is a prime number (odd number), but the length of the sequence N can also be a non-prime number (or odd or even). If the length of sequence N is a non-prime number, the sequence number r having an optimal autocorrection characteristic that is usable throughout the system must satisfy the condition of being mutually prime with respect to the length of sequence N.
As shown in figure 9, in a table stored in the storage section of the sequence table of preamble 113, (a, Na) pairs can be randomly arranged. The order of a ZC sequence pair (the order a, Na) can be a, Na or Na, a.
Also, in a table stored in the storage section of the sequence table of preamble 113, the order of the sequence number ZC (order of sequence number a) can be arbitrary, it can be a = 1, 2, 3, 4,. .., or it can be a random allocation such as a = 11, (N18
1) / 2, 1, ... and something like that. When such a preamble sequence table is used, as long as BS 100 and UE 150 share the same table, the amount of signaling can be reduced in a similar way by reporting index numbers correlated with sequence numbers shown in the table and the number of sequences allocated.
In that embodiment, the preamble sequence used in random access has been described as an example, but the present invention is not limited to that and can also be applied in a case where a plurality of ZC sequences or GCL sequences are used by a BS as a known sign. Examples of such a known signal include a channel estimation reference signal, a downlink synchronization pilot signal (synchronization channel) or the like.
In this modality, a system configuration of the centralized management type has been described in which there is a sequence allocation section 52 for a plurality of BS's, as shown in figure 1, but a distributed management type system configuration can also be used in which a sequence allocation section is provided for each BS and the exchange of information is performed between a plurality of BS's so that the ZC sequences with sequence numbers r mutually different are allocated, as shown in figure 10.
(Mode 2)
The configurations of a radio, BS and UE resource management section according to mode 2 of the present invention are similar to the settings shown in figure 1, figure 2 and figure 3 in mode 1 and therefore figure 1, figure 2 and figure 3 will be used in the following description.
Figure 11 is a drawing showing a table of the preamble sequence according to embodiment 2 of the present invention. In figure 11, sequence numbers r = 1, N-1 are correlated with index 1 and sequence numbers r = 2, N-2 are correlated with index 2. The same type of sequence number correlation r it also applies from index 3 onwards.
When sequence numbers are allocated to cells by sequence allocation section 52, the necessary ZC sequences from the number of K sequences are allocated to each cell according to the table shown in figure 11, so that the indices are consecutive. The indexes of the allocated strings are reported for report section 53.
Report section 53 reports an index of a sequence allocated by the sequence allocation section 52 in BS 100 which is the allocation object. The generation section of the BS 100 broadcast channel 102 generates allocation sequence information based on a reported index from report section 53. The allocation sequence information is included in a broadcast channel.
Figure 12 is a drawing showing the configuration of the broadcast channel 310 generated by the generation section of the broadcast channel 102. The generation section of broadcast channel 102 references a storage section of the preamble 113 sequence table storing the table shown in figure 11 and generates the allocation sequence information 312 by combining the starting index number 3121 and the number of indexes of the allocated ZC sequence 3122 indicating the indexes of number of allocated ZC sequences. The allocation sequence information 312 is included in broadcast channel 310 and is reported for each UE.
In this modality, two sequence numbers are correlated with an index and, therefore, the number of bits required to report the number of indexes is X-1. Also, when the maximum number of indexes is Μ, the number of indexes for which the allocation is performed is M / 2, and therefore the number of bits required to report the number of indexes allocated is Y-1.
Here, the number of bits X-1 of the starting index number 3121 and the number of bits Y-1 of the number of allocated indexes 3122 are defined in the same way as in mode 1. That is to say, X is a number of bits necessary to represent a sequence number ZC, and when the number of sequences is N-1, X-1 = maximum (log2 (N-1)) - 1. Also, the number of bits Y is a number of bits needed to report the maximum number of allocations that can be made in a cell, M, where Y1 = maximum (log2 (M)) - 1.
An index number and a number of allocated indexes decided in this way are reported to the UE 150 of the BS 100 via a broadcast channel. On the UE 150 side, also, a table identical to the table shown in figure 11 is provided in the storage section of the preamble 161 sequence table and usable sequence numbers are identified using the reported unique index number and the number of sequences allocated . The UE 150 selects a sequence number from among the identified usable sequence numbers, generates an RA burst including a preamble sequence and transmits that in an RA space.
Figure 12 shows an example in which the index number at the beginning of the allocated strings is reported, but an index number at the end or at a specific position decided in advance between the radio resource management section 51, BS 100 and UE 150 , can also be used.
The effect of the method for reporting allocation sequence information when the length of the ZC sequence N = 839, the number of sequences is 838 and the maximum number of sequences that can be allocated in a cell is 64, is described below.
Since the length of the sequence N is the prime number 839, the number of sequences that can be allocated is 838 and the number of indexes is also 838. Since an index number is assigned to a pair of sequence numbers a, N -1, the number of bits required for an index number report is nine. Also, since the number of indexes is 1 to 32 (maximum), the number of bits required for reporting the number of allocated indexes is five. Therefore, the number of bits required to report an allocated sequence number and the number of sequences is always 14.
On the other hand, when arbitrary sequence numbers are allocated in a cell, assuming that 10 bits are required for an index report for each allocated sequence and the maximum number of sequences allocated is 64, a maximum of 640 bits (= 10 bits x 64 sequences) is necessary and, therefore, the application of the modality 2 reporting method allows the number of signaling bits to be reduced from a maximum of 640 to 14, allowing the amount of signaling to be reduced by a maximum of 97.8%.
In this way, according to modality 2, the processing time of signaling the allocation sequence information reported by a broadcast channel can also be reduced while reducing the amount of calculation of the ZC sequence correlation processing.
In this modality, a case has been described in which an index is correlated with a pair of sequence numbers (a, Na), but an index can also be correlated with a set of more than two sequence numbers, such as a set of four sequence numbers (ai, Na-ι, a2, N-a2), a set of eight sequence numbers (at, N-ai, a<sub>2</sub>, N-a2, a3, N-a3, a4, N-azj), and so on.
As in mode 1, in a table stored in the storage section of the sequence table of preamble 113, pairs (a, Na) can be randomly arranged. The order of a ZC sequence pair (the order a, N-1) can be a, Na or Na, a. Also, an index can be correlated with a random set of ZC sequences, such as (1,3), (2, N-4), (a, Nb), instead of using a pair (a, Na).
(Mode 3)
The configurations of a radio, BS and UE resource management section according to modality 3 of the present invention are similar to the configurations shown in figure 1, figure 2 and figure 3 in mode 1 and, therefore, figure 1, figure 2 and figure 3 will be used in the following description.
Also, a preamble sequence table according to mode 3 of the present invention is identical to the preamble sequence table shown in figure 5 in mode 1, but differs from mode 1 in that the number of sequences allocated in a cell is limited .
Figure 13 is a drawing showing correspondence relationships between allocated sequence numbers and report bits according to embodiment 3 of the present invention. Figure 13 shows a case in which the maximum number of sequences allocated is 64 and the number of sequences that can be allocated in a cell is limited to a power of two. The reason why the number of sequences allocated can be limited will be explained later here.
When ZC sequence numbers are allocated to cells by sequence allocation section 52, necessary ZC sequences from the number of K sequences are allocated to each cell according to the table shown in figure 5, so that the indices are consecutive (the same as in figure 8). Here, possible values for the number of K sequences are limited to the values shown in figure 13. The allocated sequence indices are reported for report section 53.
Figure 14 is a drawing showing the configuration of the broadcast channel 320 generated by the generation section of the broadcast channel 102. The generation section of the broadcast channel 102 makes reference to the storage section of the preamble sequence table 113 storing the tables shown in figure 5 and figure 13 and generates the allocation sequence information 322 by combining the starting index number 3021 and the number of allocated sequences 3222 of the allocated ZC sequences. Allocation sequence information 322 is included in broadcast channel 320 and is reported for each UE.
Here, the number of Z bits in the number of allocated sequences 3222 is a number of bits required for reporting bits and when possible numbers of sequences are of P types, Z = maximum (log2 (P)). Also, in the case of the allocated sequence numbers (seven types) shown in figure 13, the number of Z bits is three.
An index number and a number of allocated strings decided in this way are reported to the UE 150 of the BS 100 via a broadcast channel. On the UE 150 side, also, tables identical to the tables shown in figure 5 and figure 13 are provided in the storage section of the sequence table of preamble 161 and usable sequence numbers are identified using the reported unique index number and the number of allocated strings. The UE 150 selects a sequence number from among the identified usable sequence numbers, generates an RA burst including a preamble sequence and transmits it in an RA space.
Figure 14 shows an example in which an index number at the beginning of the allocated strings is reported, but an index number at the end or at a specific position decided in advance between the radio resource management section 51, BS 100 and UE 150 can also be used.
The reason why it is possible to limit the number of sequences allocated will now be explained using figure 15.
Figure 15 is a drawing showing the relationship between a number of cyclic displacement sequences that can be generated from a ZC sequence and a required number of sequences allocated with respect to the cell size (cell radius) in the case of a length of 800 με RA preamble. Here, a required number of sequences allocated is a number of ZC sequences with different sequence numbers.
As an example, in the mobile communication system described in Non-Patent Document 1, 64 random access preamble strings are always used for a cell. At that time, 64 sequences comprise one or a plurality of cyclic displacement sequences generated from a ZC sequence and ZC sequences with different sequence numbers. If it is possible for eight cyclic displacement sequences to be generated from a ZC sequence, a total of 64 sequences are obtained by allocating eight ZC sequences with different sequence numbers and generating eight cyclic displacement sequences from each ZC sequence.
An equation for which q = 0 for a sequence ZC (equation (2)) when the length of the sequence is an odd number and that includes the amount of cyclic displacement Δ is shown in equation (5).
[5] ϋ<sub>Γί</sub>(£) - exp.2xrí (k + l &) (k + wool + l)
... (Equation 5) where 1 represents a cyclic shift sequence number, 1 = 0, 1, ..., L-1 and L represents a cyclic shift sequence number.
The sequence number of the cyclic shift that can be generated from a ZC sequence is defined by the amount of cyclic shift Δ. When Δ is small, the number of cyclic displacement sequences that can be generated from a sequence increases and when Δ is large, the number of cyclic displacement sequences that can be generated from a sequence decreases. The number of cyclic displacement sequences L is obtained from the equation L = minimum (N / A).
In addition, the amount of cyclic displacement Δ must be adjusted to be greater than the propagation delay of rounding (rounding delay) between BS 100 and UE 150, and is therefore proportional to the service radius supported by a cell. Therefore, as shown in figure 15, the number of cyclic shift sequence that can be generated from a sequence decreases, while the required number of allocated sequences increases, in proportion to the cell size (cell radius).
With reference to the number of sequences allocated, configuration in mode 1 allows an arbitrary number from 1 to the maximum number of allocations M to be allocated, but in the case of a large number of sequences allocated (for example, 17 to 31, 33 to 63 or similar), a cell has an extremely large cell radius and such numbers are not really nearly used. On the other hand, most cells have a cell radius of several hundred meters at 10 km or the like, and for such cells, the number of sequences allocated is small.
Therefore, by widening (exponentially increasing) the interval between possible sequence numbers as the cell radius increases, as shown in figure 15, it is possible to reduce the amount of signaling25 while maintaining a certain degree of freedom of sequence allocation.
The effect of the method for reporting information from the above allocation sequence when the length of the ZC sequence N = 839, the number of sequences is 838, the maximum number of sequences that can be allocated in a cell is 64 and the number of sequences allocated is limited as shown in figure 13, is described below.
Since the length of the sequence N is the prime number 839, the number of strings that can be allocated is 838 and the number of indexes is also 838. The number of bits required for the index number report is 10, as in the modality 1. Also, the number of bits required for reporting the number of allocated indexes is three. Therefore, the number of bits required to report an allocated sequence number and the number of sequences is always 13.
When arbitrary sequence numbers are allocated in a cell, assuming that 10 bits are required for an index report for each allocated sequence and the maximum number of allocated sequences is 64, a maximum of 640 report bits (= 10 bits x 64 sequences ) is necessary and, therefore, the application of the modality 3 reporting method allows the number of signaling bits to be reduced from a maximum of 640 to 13, allowing the amount of signaling to be reduced by a maximum of 98.0%.
In this way, according to modality 3, the processing time of the signaling of the information of the allocation sequence reported by a broadcast channel can be further reduced while reducing the amount of calculation of correlation processing of the ZC sequence.
(Mode 4)
The configurations of a radio, BS and UE resource management section according to mode 4 of the present invention are similar to the settings shown in figure 1, figure 2 and figure 3 in mode 1 and therefore figure 1, figure 2 and figure 3 will be used in the following description.
Figure 16 is a drawing showing sequence tables of the preamble according to embodiment 4 of the present invention. In figure 16, correspondence relationships between indexes and sequence numbers are adjusted for each number of sequences allocated. For example, when allocated sequence numbers are indicated by K = 1, 2, 4, 8, 16, 32, 64, seven preamble sequence tables are provided.
Figure 16A shows a preamble sequence table for the number of sequences allocated 1. In figure 16A, a sequence number is allocated to an index. Specifically, the sequence number r = 1 is correlated with the index 1 and the sequence number r = N-1 with the index 2 and the sequence number r = 2 is correlated with the index 3 and the sequence number r = N-2 with index 4. The same type of sequence number correlation r also applies from index 5 onwards.
Figure 16B shows a preamble sequence table for the number of sequences allocated 2. In figure 16B, two sequence numbers are allocated in an index. Specifically, sequence numbers r = 1 and r = N-1 are correlated with index 1 and sequence numbers r = 2 and r = N-2 are correlated with index 2. The same type of sequence number correlation r it also applies from index 3 onwards.
Figure 16C shows a table of the preamble sequence for the number of sequences allocated 4. In figure 16C, four sequence numbers are allocated in an index. Specifically, sequence numbers r = 1, r = 2, r = N-1 and r = N-2 are correlated with the index 1 and sequence numbers r = 3, r = 4, r = N-3 and r = N-4 are correlated with index 2. The same type of sequence number correlation r also applies from index 3 onwards. An index and sequence numbers equivalent to the number of sequences allocated are also correlated in a simulated manner to the number of sequences allocated 8 onwards.
When sequence numbers ZC are allocated to cells by sequence allocation section 52, sequences are allocated to each cell according to the number of sequences allocated K and a table 27
Sequence line of the preamble corresponding to the number of allocations (figure 16) and indexes of allocated sequence are reported for report section 53.
Report section 53 reports a reported index from the sequence allocation section 52 to BS 100 which is the allocation object. The generation section of broadcast channel 102 of BS 100 generates a broadcast channel including a reported index from report section 53.
Figure 17 is a drawing showing the configuration of the broadcast channel 330 generated by the generation section of the broadcast channel 102. The generation section of the broadcast channel 102 makes reference to the table storage section of the preamble sequence 113 storing the tables shown in figure 16 and generates allocation sequence information 332 by combining index type 3321 corresponding to the number of allocations K and the number of allocated index 3322. Allocation sequence information 332 is included in broadcast channel 330 and is reported for each UE.
Here, the number of Z bits of the index type 3321 increases from 1 bit to 2 bits, 3 bits, 4 bits, ..., as the number of K allocations increases from 1 to 2, 4, 8 ... ..as shown in figure 18. Also, as shown in figure 18, when the starting bit of the allocation sequence information is 1, this indicates a number of allocations 1 in the preamble sequence table and indicates that the information bits of the allocation sequence after the start bit 1 is an index number. Also, when the starting bits of the allocation sequence information are 01, this indicates a number of allocations 2 in the preamble sequence table and indicates that the bits of the allocation sequence information after the initial 2 bits are an index number. . Next, in the same way, a position in which a bit 1 appears at the beginning of the allocation sequence information represents an index type and indicates that the subsequent allocation sequence information bits are an index number.
In figure 18, an example was shown in which the position in which a bit 1 appears first represents a type of index, but bits 0 and 1 can be inverted and the position in which a bit 0 appears first can represent the type of index. index.
On the other hand, as the number of K allocations increases from 1 to 2, 4, ..., the number of bits in an index number decreases 1 bit at a time. For example, when the numbers of the ZC sequences are allocated multiplely in the preamble sequence tables as shown in figure 16, if the number of sequences is indicated by N, the number of indices N-ι, N2, N4 ... ..N<sub>6</sub>4, of each table corresponding with K = 1, 2, 4,
8, 16, 32, 64 becomes Ni = N, N2 = minimum (N / 2), N4 = minimum (N / 4), ..., N64 = minimum (N / 64), respectively and, therefore, the number of bits required for index number reporting, if indicated by X bits when K = 1, becomes X-1 bits, X-2 bits, X-3 bits, X-4 bits, X-5 bits, X -6 bits, respectively for K = 2, 4, 8, 16, 32, 64.
Therefore, the number of bits of allocation sequence information 332 combining index type 3321 and index number 3322 can be made a constant (X + 1 bits) regardless of the number of K allocations. An index type and a number index in a preamble sequence table corresponding to the type of index decided in this way are reported to the UE 150 of BS 100 through a broadcast channel. On the UE 150 side, also, tables identical to the tables shown in figure 16 and figure 18 are provided in the storage section of the preamble 161 sequence table and usable sequence numbers can be identified using the reported index type and a number of index in a preamble sequence table corresponding to the type of index. The UE 150 selects a sequence number from among the identified usable sequence numbers, generates an RA burst including a preamble sequence and transmits that in an RA space.
The effect of the method for reporting above allocation sequence information when the length of the ZC sequence N = 839, the number of sequences is 838, the maximum number of sequences that can be allocated in a cell is 64 and the number of sequences allocated is limited as shown in figure 16, is described below.
Since the number of sequences allocated K is limited to 1, 2,
4, 8, 16, 32, 64, the number of tables per number of allocated strings is seven. Since the length of the string is the prime number 839, the number of strings is 838 and the number of bits required for an index number for each table corresponding to the number of allocated strings K = 1, 2, 4, 8, 16 , 32, 64 is 10 bits, 9 bits, 8 bits, 7 bits, 6 bits and 5 bits, respectively. On the other hand, the number of bits required for an index type report (table type) is 1 bit, 2 bits, 3 bits, 4 bits, 5 bits and 6 bits for each table with the number of strings allocated K = 1, 2, 4, 8, 16, 32, 64. Therefore, the number of bits required to report an allocated sequence number and the number of sequences is always 11.
When arbitrary sequence numbers are allocated in a cell, assuming that 10 bits are required for the index report for each allocated sequence and the maximum number of allocated sequences is 64, a maximum of 640 report bits (= 10 bits x 64 sequences ) is necessary and, therefore, the application of the modality 4 reporting method allows the number of signaling bits to be reduced from a maximum of 640 to 11, allowing the amount of signaling to be reduced by a maximum of 98.3%.
In this way, according to modality 4, the processing time of signaling the allocation sequence information reported by a broadcast channel can be further reduced while reducing the amount of calculation of the ZC sequence correlation processing.
In figure 16, a configuration is shown by way of example in which an ascending order of a is used for the order a and Na of the sequence number ZC of each preamble sequence table, but a descending order can be used or a random order can be used. Furthermore, the order of the sequence number may be different for each table in the preamble sequence.
(Mode 5)
The configurations of a radio, BS and UE resource management section according to modality 5 of the present invention are similar to the configurations shown in figure 1, figure 2 and figure 3 in mode 1 and, therefore, figure 1, figure 2 and figure 3 will be used in the following description.
Figure 19 is a drawing showing a table of the preamble sequence according to embodiment 5 of the present invention. In figure 19, an index number is allocated to each combination of the pre-established allocation sequence. For example, when the number of the ZC sequences is N-1, one of the sequence numbers 1 to N-1 is allocated respectively to index numbers 1 to N-1, a pair of sequence numbers is allocated to the index numbers N a i and a set of four sequence numbers is allocated in the index numbers i + 1 to j. Pre-established combinations of allocated sequences are also allocated in a similar manner to the index number i + j onwards. As the number of index numbers N<sub>2 </sub>necessary for a part in which a sequence pair correlates with an index number, N2 = iN = minimum (N / 2). Similarly, as the number of index numbers N<sub>x</sub> needed for a part in which a set of X strings correlates with an index number, N<sub>x</sub>= minimum (N / X).
Sequence allocation section 52 allocates a sequence set corresponding to a number of allocations according to the preamble sequence table shown in figure 19. Report section 53 reports a ZC sequence allocated by sequence allocation section 52 in BS 100 which is the allocation object. The generation section of the BS 100 broadcast channel 102 generates a broadcast channel including the reported allocation sequence information from the report section 53.
Figure 20 is a drawing showing the configuration of the diffusion channel 340 generated by the generation section of the diffusion channel 102. The generation section of the diffusion channel 102 makes reference to the storage section of the preamble 113 sequence table storing the table shown in figure 19, generates broadcast channel 340 including index number 3421 corresponding to a set of allocation sequence numbers reported from report section 53 and reports this for each UE.
Thus, in modality 5, there is a preamble sequence table31 that indicates the correspondence relationships between allocation sequence numbers and indexes and the indexes comprise index numbers correlated with a sequence number and index numbers correlated with a plurality of sequence numbers combining the sequence number r = a and the sequence number r = Na. BS 100 stores the preamble sequence table shown in figure 19.
When the length of the sequence is N, the number of N-ι indexes correlated with a single sequence number is N-1 and for the number of N2 indexes correlated with two sequence numbers, N<sub>2</sub>= minimum (N / 2). Similarly, for the number of indices N<sub>x</sub> correlated with X sequence numbers, N<sub>x</sub>= minimum (N / X). In this way, a part having more allocated strings correlated with an index number in the preamble sequence table shown in figure 19 has fewer index numbers.
BS 100 makes reference to the stored table shown in figure 19 and decides a corresponding index number for an allocation sequence and number of sequences. The decided single index number is reported to the UE 150 of the BS 100 via a broadcast channel. On the UE 150 side, too, a table identical to the table shown in figure 19 is provided in the storage section of the preamble 161 sequence table and usable sequence numbers are identified using the reported unique index number and the number of information. allocations.
In the modality 5 reporting method, only combinations of sequence numbers used by the system are adjusted in advance and therefore, for example, the number of cells having a large cell size - that is, having a large number of allocated sequences is less than the number of cells having a small cell size - that is, having a small number of sequences allocated - making it possible to reduce the number of sequence number sets.
On the other hand, for example, since many sets of sequence numbers having a small number of allocated sequences are obtained (N sets are obtained for the number of sequences allocated
1), it is also possible to reduce the number of sequence number sets to a number of allocated sequences for which a large number of sequence number sets are obtained.
Therefore, since only a really necessary number of sequence number combinations are reported, the number of bits used for an index number report can be used in a non-wasteful way and the processing time of signaling the sequence information allocation reported by a broadcast channel can be reduced.
In this way, according to mode 5, the processing time of signaling the information of the allocation sequence reported by a broadcast channel can be reduced while reducing the amount of calculation of the correlation processing of the ZC sequence.
(Mode 6)
In modality 1, a reporting method was shown whereby a starting index number and a number of allocated strings are reported according to a preamble sequence table, but the organization of the strings in a table was not considered.
Here, when UEs moving at high speed are present and cyclic displacement sequences with different amounts of cyclic displacement are used within the same cell, Doppler expansion related to high-speed movement and frequency displacement are involved in a received signal and therefore , a high correlation value occurs in a separate sequence detection range s of cyclic displacement generated from the same ZC sequence - that is, in the wrong adjustment position. On the other hand, the correlation value in an expected detection range decreases.
When a high correlation value occurs in a detection range of different cyclic displacement sequences, the probability of false detection for different cyclic displacement sequences increases. Also, when the correlation value in an expected detection range decreases, the probability of detecting a transmitted preamble becomes less.
Figure 21 is a drawing showing the relationship between a correlation value and the amount of cyclic displacement Δ of a ZC sequence transmitted from a UE when moving at high speed. As shown in figure 21, with reference to the correlation value for a preamble transmitted from a UE when moving at high speed, the peak of the correlation value occurs in the regulation that is wrong in a + or direction - equivalent to an x regulation corresponding to a sequence number of a ZC sequence described later here with respect to the regulation of a detected correlation value when not there is Doppler expansion or frequency shift transmitted from a stationary UE. In general, with reference to the size of a peak correlation value, the peak of the erroneous correlation value increases while the peak value of the correct regulation decreases as the speed of movement of a UE increases. Therefore, if the value of the amount of cyclic displacement Δ established is greater than χ (Δ> χ), erroneous detection occurs in the processing of peak detection by a base station and, therefore, it is necessary that the amount of cyclic displacement Δ is adjusted to a value less than χ (Δ <χ).
In a conventional reporting method, it is impossible to individually select and report a sequence number and amount of cyclic displacement for which erroneous detection does not occur, so that a separate detection range of the cyclic displacement sequence and a value range of correlation in which a wrong regulation of this separate cyclic shift sequence occurs does not overlap in a correlation value range in which a wrong regulation occurs, but the individual report cannot be performed on a reporting method of the present invention.
In this way, an example of adjustment of the preamble sequence table will be shown that focuses on the fact that the difference between a position of the correlation value in which a used sequence occurs in a wrong regulation and a correct regulation position depends on a number34 ro of sequence, and usable sequence numbers are limited by the radius of the cell since a range in which the correlation value occurs depends on the radius of the cell.
The configurations of the radio, BS and UE resource management section according to mode 6 of the present invention are similar to the settings shown in figure 1, figure 2 and figure 3 in mode 1 and therefore figure 1, figure 2 and figure 3 will be used in the following description.
Figure 22 is a drawing showing a table of the preamble sequence according to embodiment 6 of the present invention. In figure 22, index numbers are allocated one at a time to sequence numbers r in a case where the length of sequence N is 37 (a prime number). The length of the N sequence is not limited to 37.
A preamble sequence table is used in which, when ZC sequences defined in the time domain as in equations (1) to (5) in the above modalities are used, the indices are allocated in an order of sequence number r that satisfies the following equation (6) for u = 1,2, 3 ..... N-1.
[6] (r · u) modjV = N - 1, u —1,2,3, ..., N 1 (Equation 6)
When the length of sequence N in figure 22 is 37, the sequence number r = 1 is correlated with index 1 and the sequence number r = 18 with index 2. A value of r that satisfies equation (6) is also correlated in a similar way with index 3 onwards. The order of the sequence number r can also be an order that satisfies equation (6) for u = N-1, N-2, .... 3, 2, 1.
The sequence allocation section 52 performs the sequence set allocation corresponding to the number of allocations according to the preamble sequence table shown in figure 22. Report section 53 reports a ZC sequence allocated by the sequence allocation section 52 for BS 100 which is the allocation object. The generation section of the broadcast channel 102 of the BS 100 generates a broadcast channel including the information of the allocation sequence reported from the reporting section 53.
The generation section of the broadcast channel 102 references the storage section of the preamble 113 sequence table storing the table shown in figure 22 and generates the allocation sequence information 302 by combining the starting index number 3021 and the number of allocated sequences 3022 of the allocated ZC sequences. The allocation sequence information is included in the broadcast channel 300 and is reported for each UE.
An index number and a number of allocations decided in this way are reported to the UE 150 of the BS 100 through a broadcast channel. On the UE 150 side, also, a table identical to the table shown in figure 22 is provided in the storage section of the preamble 161 sequence table and usable sequence numbers are identified using the reported unique index number and the number of information allocations.
In modality 6 reporting method, BS 100 allocates sequences with consecutive sequence numbers in the same cell based on a preamble sequence table adjusted using equation (6).
If this table is used, the relative differences x between a position of a correlation value that occurs in a wrong regulation and a position of a correlation value that occurs in the correct regulation are arranged in the order +/- 1, +/- 2 , ..., +/- 18, - / + 18, - / + 17, ..., - / + 1.
At base station 100, adjustment is required so that the cyclic displacement quantities Δ for a correlation value that occurs at the correct regulation and the correlation value that occurs at a wrong regulation do not overlap each other in order to prevent the occurrence of the erroneous detection of a preamble. That is to say, it is necessary that the condition quantity of the cyclic displacement Δ <relative difference x be satisfied. Therefore, as shown in figure 23, the applicable cyclic displacement quantity values Δ are also 1, 2,
.... 18, 18, 17, .... 1.
On the other hand, the amount of cyclic displacement Δ required is adjusted to be greater than the sum of the expected value of the maximum rounding propagation delay time (T<sub>Re</sub>tardoPropagação) between BS 100 and UE 150 supported by the relevant cell and the maximum expected value of the delay time of multiple channel paths (T<sub>Exp</sub>ansãoRetardo) - That is to say, the adjustment is performed so that the required amount of cyclic displacement Δ> 2 X TRetardoRoundard * T<sub>AND</sub>xpansionRetard · Therefore, sequence numbers that can be applied to that cell are limited to sequences for which the relative difference x satisfies the condition X> amount of displacement Δ> 2 X TRetardRounding * T<sub>AND</sub>xpansãoRetardo ·
In the preamble sequence table shown in figure 23, the values of the amount of the applicable cyclic displacement Δ (<x) are arranged in ascending and descending order - that is, sequence numbers are arranged in an order proportional to the cell radius - and therefore, even if the N strings are allocated consecutively, it is easy to perform the allocation, so that a sequence that cannot be used due to cell radius restrictions is not included.
Also, since the differences between a position of a correlation value that occurs in a wrong regulation and a position of a correlation value that occurs in the correct regulation are allocated in index numbers in ascending order (index numbers 1 to the minimum ( N / 2)) and in descending order (minimum index numbers (N / 2) to N-1), it is possible that the sequence number r, for which a range in which the correlation value occurs in a close relationship , be allocated; it is possible that the sequence allocation is performed such that the number of cyclic shift sequences that can be generated from a ZC sequence is maximized, and the sequence consumption can be reduced.
Thus, according to modality 6, it is possible to report only usable sequence allocations in a non-wasteful manner even in a cell in which a UE moving at a high speed37 is present, while reducing the processing time of information signaling allocation sequence reported by a broadcast channel.
A preamble sequence table can also use an order r that satisfies equation (7) for u. Fig. 24 shows an example of a preamble sequence table that satisfies equation (7) when sequence length N = 37. That is, the sequence number r = N-1 corresponding to u = 1 is allocated to the index number 1, the sequence number r = 1 corresponding to u = N-1 is allocated to the index number 2 and the number of sequence r corresponding to u satisfying equation (7) is also allocated in a similar manner to index number 3 onwards.
[7] (r · w) mod N = N -1, u = 1, N -1,2, N - 2,3, N - 3, ..., floor (N / 2), N - floor ( 7V / 2) ... (Equation 7)
In this case, for a pair of sequence number r = a and rNa, an applicable cell radius, the position of a correlation value argument in a wrong regulation and so on are identical and therefore it is also possible to report only allocations of sequence usable in a non-wasteful manner even in a cell in which the UE 150 moving at high speed is present. Also, in equation (7), the amount of cyclic displacement Δ usable is the same for an order u = beu = Nb and therefore any order u = b, u = Nb or u = Nb, u = b can be used .
A configuration applying equation (6) and equation (7) to an order for sequence numbers a and Na described in modalities 1 to 5 above can also be used.
Above equation (6) can also be equation (8) below.
[8] (rM) mod7V = l, u = 1,2,3, - l ... (Equation 8)
In the above embodiments, descriptions have been provided using ZC sequences, but the present invention is not limited to that and sequences
GCL can also be used.
With reference to the signal within the exp of a ZC sequence and GCL sequence in equations (1) to (5), -j can be used or + j can be used.
In the above modalities, configurations have been shown in which the number of allocated strings or the number of indexes is reported, but in a system that makes use of combined cyclic displacement sequences, if the number of RA preambles used in a cell is known in advance by a BS and UE, a configuration can be used in which the number of cyclic shift strings is reported instead of reporting the number of allocated strings or the number of indexes. This is because the number of sequences allocated or the number of indexes can be acquired by dividing the number of preambles used in a cell by the number of cyclic displacement sequences.
Also, in a system that makes combined use of cyclic displacement sequences, if the number of RA preambles used in a cell is known in advance by a BS and UE, a configuration can be used in which the amount of cyclic displacement Δ is reported to the rather than reporting the number of sequences allocated or the number of indexes. This is because the number of sequences allocated or the number of indexes can be acquired from a number of cyclic displacement sequences obtained from the length of sequence N and the amount of cyclic displacement Δ.
Furthermore, in a system that makes combined use of cyclic displacement sequences, if the number of RA preambles used in a cell is known in advance by a BS and UE, a configuration can be used in which the cell size (radius) is reported instead of reporting the number of sequences allocated or the number of indexes. This is because the number of sequences allocated or the number of indexes can be acquired by obtaining the amount of cyclic displacement Δ required from the cell size (radius).
In the above embodiments, configurations have been shown in which a table of preamble strings is used for the matching relationships between sequence numbers and indexes, but a configuration can also be used in which the matching relationship between the sequence number and the index it is obtained using an equation, such as sequence number = f (index number).
In the above embodiments, cases have been described by way of example in which the present invention is configured as hardware, but it is also possible that the present invention is implemented by software.
The function blocks used in the mode descriptions above are typically implemented as LSI's, which are integrated circuits. These can be implemented individually as single integrated circuits or a single integrated circuit can incorporate some or all of them. Here, the term LSI was used, but the terms IC, LSI system, super LSI and ultra LSI can also be used according to the differences in the degree of integration.
The method of implementing the integrated circuitry is not limited to LSI and implementation through the dedicated circuitry or a general purpose processor can also be used. An FPGA (field programmable port formation) for which programming is possible after LSI fabrication or a reconfigurable processor allowing the reconfiguration of circuit cell connections and adjustments within an LSI can also be used.
In the event of the introduction of an integrated circuit implementation technology whereby the LSI is replaced by a different technology such as a breakthrough in, or derivation of, semiconductor technology, the integration of function blocks can be performed, of course, using this technology. The application of biotechnology or similar is also a possibility.
The disclosure of Japanese Patent Application No. 2007-071194, filed on March 19, 2007, including the specification, drawings and summary, is hereby incorporated by reference in its entirety.
Industrial Applicability
A method for reporting a sequence and an apparatus for reporting a sequence, according to the present invention, make it possible for an amount of signaling (number of bits) of a broadcast channel that reports different ZC sequences or GCL sequences allocated in a cell of a station base for a terminal is reduced and are suitable for use in a mobile communication system or similar, for example.
23 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19 Sheet 20 Sheet 21 Sheet 22 Sheet 23
51 members in 11 offices
Priority claims9
| Document | Office | Kind | Date |
|---|---|---|---|
| 2007071194 | Japan | – | |
| 2007071194 | Japan | A | |
| 2007071194 | Japan | A | |
| 2008000637 | Japan | W | |
| 2008000637 | Japan | W | |
| 2007071194 | – | – | – |
| 2008000637 | – | – | – |
| JP20070071194 | – | – | – |
| WO2008JP00637 | – | – | – |
Members51
| Document | Office | Kind | |
|---|---|---|---|
| AU2008242031A1 | Australia | A1 | |
| WO2008129797A1 | World Intellectual Property Organization (WIPO) | A1 | |
| EP2124463A1 | European Patent Office (EPO) | A1 | |
| CN101637058A | China | A | |
| KR20100014976A | Republic of Korea | A | |
| US2010113046A1 | United States of America | A1 | |
| JPWO2008129797A1 | Japan | A1 | |
| RU2009135045A | Russian Federation | A | |
| AU2008242031B2 | Australia | B2 | |
| JP4790062B2 | Japan | B2 | |
| AU2008242031C1 | Australia | C1 | |
| JP2011254504A | Japan | A | |
| JP4841704B2 | Japan | B2 | |
| US8085724B2 | United States of America | B2 | |
| JP2012010408A | Japan | A | |
| US2012064837A1 | United States of America | A1 | |
| EP2472759A2 | European Patent Office (EPO) | A2 | |
| CN101637058B | China | B | |
| CN102752856A | China | A | |
| MY147231A | Malaysia | A | |
| EP2472759A3 | European Patent Office (EPO) | A3 | |
| RU2476002C2 | Russian Federation | C2 | |
| US8385843B2 | United States of America | B2 | |
| EP2124463A4 | European Patent Office (EPO) | A4 | |
| US2013100890A1 | United States of America | A1 | |
| JP5367038B2 | Japan | B2 | |
| EP2675088A1 | European Patent Office (EPO) | A1 | |
| EP2124463B1 | European Patent Office (EPO) | B1 | |
| EP2472759B1 | European Patent Office (EPO) | B1 | |
| ES2448597T3 | Spain | T3 | |
| ES2448821T3 | Spain | T3 | |
| EP2124463B8 | European Patent Office (EPO) | B8 | |
| EP2472759B8 | European Patent Office (EPO) | B8 | |
| BRPI0809404A2This record | Brazil | A2 | |
| KR101457726B1 | Republic of Korea | B1 | |
| CN102752856B | China | B | |
| US8977214B2 | United States of America | B2 | |
| US2015171985A1 | United States of America | A1 | |
| EP2675088B1 | European Patent Office (EPO) | B1 | |
| EP2963850A1 | European Patent Office (EPO) | A1 | |
| US9503210B2 | United States of America | B2 | |
| US2017041930A1 | United States of America | A1 | |
| EP3148105A1 | European Patent Office (EPO) | A1 | |
| US9736839B2 | United States of America | B2 | |
| US2017311323A1 | United States of America | A1 | |
| EP2963850B1 | European Patent Office (EPO) | B1 | |
| EP3148105B1 | European Patent Office (EPO) | B1 | |
| EP3301836A1 | European Patent Office (EPO) | A1 | |
| EP3301836B1 | European Patent Office (EPO) | B1 | |
| US10517090B2 | United States of America | B2 | |
| BRPI0809404B1 | Brazil | B1 |
9 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Requested change of headquarter approvedB25G | B25G | |
| Patent or certificate of addition of invention granted [chapter 16.1 patent gazette]GrantedPRAZO DE VALIDADE: 10 (DEZ) ANOS CONTADOS A PARTIR DE 13/10/2020, OBSERVADAS AS CONDICOES LEGAIS.B16A | B16A | |
| Decision: intention to grant [chapter 9.1 patent gazette]B09A | B09A | |
| Application suspended after technical examination (opinion) [chapter 7.1 patent gazette]B07A | B07A | |
| Preliminary requirement: requests with searches performed by other patent offices: procedure suspended [chapter 6.21 patent gazette]B06U | B06U | |
| Others concerning applications: alteration of classificationAS CLASSIFICACOES ANTERIORES ERAM: H04W 72/04 , H04J 13/00 , H04J 13/22 , H04L 5/00 , H04W 72/00B15K | B15K | |
| Objections, documents and/or translations needed after an examination request according [chapter 6.6 patent gazette]B06F | B06F | |
| Others concerning applications: alteration of classificationB15K | B15K | |
| Requested transfer of rights approvedB25A | B25A |
Numbers
- Publication
- PI0809404
- Publication, DOCDB
- PI0809404
- Publication, EPODOC
- BRPI0809404
- Application
- 9404
- Application, DOCDB
- PI0809404
- Application, EPODOC
- BR2008PI09404
Titles2
- Portuguese
- MÉTODO PARA RELATAR SEQUÊNCIA E DISPOSITIVO PARA RELATAR SEQUÊNCIA
- English
- SEQUENCE REPORTING METHOD AND SEQUENCE REPORTING DEVICE
Classification
- CPC, 11
- H04W72/0446
- H04J13/0062
- H04J13/22
- H04L5/0053
- H04W72/0466
- H04J13/0066
- H04J2013/0096
- H04W72/30
- H04W72/21
- H04W72/23
- H04W74/004
- IPC, 9
- H04Q7 30
- H04J13 00
- H04Q7 38
- H04B1 707
- H04J13 16
- H04J13 18
- H04J13 22
- H04W72 04
- H04W74 08
