CN101141801A

CN101141801A - Channel resource block mapping method and apparatus

Info

Publication number: CN101141801A
Application number: CNA2007100041764A
Authority: CN
Inventors: 李斌; 阮卫
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2006-09-06
Filing date: 2007-01-05
Publication date: 2008-03-12
Also published as: WO2008040204A1; CN101411153A; CN101411153B

Abstract

The invention relates to the wireless communication field, which discloses a method and device of the mapping method of the signal channel resource block, enables the complexity of the terminal modulation data to the resource block to be reduced, and effectively averages the disturbance between the various layers of the quasi-orthogonal reverse signal channel. According to the Reed-Solomon code sequence or the expanded Reed-Solomon code sequence, the invention maps the logic signal channel node of the quasi-orthogonal reverse chain path to the physical signal channel resource block.

Description

Channel resource block mapping method and equipment

Technical Field

The invention relates to the field of wireless communication, in particular to a channel resource block mapping technology of a quasi-orthogonal reverse link.

Background

In recent years, a multicarrier transmission technique represented by Orthogonal Frequency Division Multiplexing (OFDM) has attracted much attention. Multicarrier transmission breaks down a data stream into several independent sub-streams, each of which will have a much lower bit rate. The low-rate multi-state symbols formed by the low bit rate are used for modulating corresponding subcarriers, and a transmission system with a plurality of low-rate symbols transmitted in parallel is formed.

OFDM is a multiplexing technique that multiplexes multiple signals onto different orthogonal subcarriers. The traditional Frequency Division Multiplexing (FDM) technology divides the bandwidth into several sub-channels, and uses guard bands to reduce interference, and they transmit data at the same time. OFDM systems require much less bandwidth than conventional FDM systems. No guard bands are required between the individual carriers due to the use of interference-free orthogonal carrier techniques. This makes the use of the available spectrum more efficient. In addition, OFDM techniques may dynamically allocate data on subchannels. To achieve maximum data throughput, the multicarrier modulator may intelligently allocate more data to subchannels with good channel conditions.

The OFDM uses the encoded data to be transmitted as frequency domain information, modulates the frequency domain information into a time domain signal, transmits the time domain signal on a channel, and performs inverse demodulation at a receiving end. Modulation and demodulation of the OFDM system may be replaced by Inverse Discrete Fourier Transform (IDFT) and Discrete Fourier Transform (DFT), respectively. And converting the frequency domain data symbols into time domain data symbols through N-point IDFT operation, modulating the time domain data symbols by a carrier wave, and sending the time domain data symbols into a channel. At the receiving end, coherent demodulation is carried out on the received signal, and then N-point DFT operation is carried out on the baseband signal, so that the transmitted data symbol can be obtained. In practical applications, the IDFT/DFT is implemented by using Inverse Fast Fourier Transform (IFFT) and Fast Fourier Transform (FFT). The complexity of the OFDM system is greatly reduced by the FFT technique, and the OFDM system is more easily implemented by the development and application of high performance information processing devices such as Programmable Logic Devices (PLDs), digital Signal Processors (DSPs), microprocessors (mups), and the like, which is a multi-carrier transmission scheme with the widest application.

Multiple access for OFDM, i.e., OFDMA, may be achieved by allocating different subcarriers to different terminals. In an OFDMA system, different terminals are assigned different resources (time, space, frequency resources) to realize sharing of resources by different terminals. The uplink access in the OFDMA mode is beneficial to reducing the interference inside the sector. However, when the number of receiving antennas of the base station increases, the dimension of the access method is limited, which is not favorable for obtaining the maximum system capacity. This limitation can be reduced if a quasi-orthogonal multiplexing approach is employed.

The quasi-orthogonal access is to allocate the same bandwidth (channel resource) to a plurality of terminals in one sector. The base station demodulates the information sent by the terminals by using a spatial processing mode. Thus, the system can obtain the benefits of orthogonal multiplexing when the ratio of the number of receiving antennas is small, and the system capacity increases as the number of receiving antennas increases when the number of antennas is large.

As shown in fig. 1, in the quasi-orthogonal access, the logical channel may be divided into a plurality of subtrees. The logical channel nodes on different subtrees are mapped to the same physical channel resource, that is, several logical channel tree basic nodes are mapped on the same physical channel resource block, which is called a group of logical channel tree basic nodes. And the terminals corresponding to different subtrees are different. In order to average the interference between different subtrees, that is, in order to prevent the basic nodes of the logical channel tree with relatively large mutual interference from being always in the same physical channel resource, the basic nodes of the logical channel tree included in the group of the basic nodes of the logical channel tree mapped on different physical channel resource blocks need to be different.

At present, in the prior art, a random permutation method is adopted to randomize the interference of users between different subtrees, and a random sequence for random permutation is generated by a 20-bit linear feedback shift register. First, the base station and the terminal generate 20-bit shift register initial values, i.e. seeds, according to the physical frame number, the sub-tree number, etc. Each physical frame generates a different seed and each sub-tree number generates a different seed. In each frame, the base station and the terminal use the seeds as initial values of the shift register to generate a group of random sequences, and basic nodes of a logic channel tree in the same subtree and physical resource blocks on the whole frequency band are mapped one by one. The mapping relationship is determined by the permutation sequence, for example, if the random sequence is 345201, P (0) =4,P (1) =5,P (2) =3, P (3) =0,P (4) =1,P (5) =2. That is, node 0 is mapped to physical channel resource block 4 and node 1 is mapped to 5. On the terminal side, if a certain terminal is assigned to the logical channel tree base node 0, the terminal modulates data to be transmitted onto subcarriers of the physical channel resource block 4 in this frame, and transmits the data. After the base station separates different sub-trees by means of spatial processing, the base station demodulates data from the sub-carriers of the physical channel resource block 4 for the whole frequency band of the sub-tree where the terminal is located, and sends the data as a data packet of the user to an upper layer.

In practical applications, there are the following problems: the terminal has a large amount of calculation when modulating data onto the resource block, and it cannot guarantee that the interference between different layers in the quasi-orthogonal reverse channel is optimally equalized.

The main reason for this is that each terminal and base station generate only a few values associated with the terminal in the entire random sequence generated by the shift register, for example, in the above example, the values associated with the terminal corresponding to node 0 are only P (0), P (0) =4 in the random sequence 345201, but the terminal has to calculate the entire random sequence. Moreover, for each physical frame, each terminal and the base station need to regenerate the seed of the shift register according to the frame number, the sub-tree number, the hyper-frame number and the like, and then the shift register regenerates the whole random sequence, thereby greatly increasing the calculated amount when the terminal modulates data onto the physical channel resource block. In addition, the generated random sequence cannot guarantee that the number of times that the terminal and the same other terminals occupy the same physical channel resource block is 1, so that the optimal equalization of interference between different layers in the quasi-orthogonal reverse channel cannot be guaranteed.

Disclosure of Invention

In view of the above, the present invention provides a method and an apparatus for mapping a channel resource block, so that the complexity of a terminal for modulating data onto the resource block is reduced, and the interference between different layers in a quasi-orthogonal reverse channel is averaged more effectively.

In order to achieve the above object, the present invention provides a channel resource block mapping method, comprising the following steps:

and generating a sequence according to the Reed-Solomon code, and mapping the basic node of the logic channel tree of the quasi-orthogonal reverse link of the terminal to a physical channel resource block according to the sequence.

Wherein each value in the sequence represents a physical channel resource block mapped at a different time slot by the logical channel tree base node.

The terminal may generate the sequence by the following formula: f (m) = c × α ^m +c ₀ Wherein α is GF (p) in the finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, c ₀ And m represents a time slot mapped to the physical channel resource block, and the operation in the formula is the operation in a finite field.

The terminal may further generate the sequence by:

wherein alpha is GF (p) in the finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, c ₀ Representing a base node of a logical channel tree corresponding to the terminal,

the expression is a lower bound integer of i, m represents a time slot mapped to the physical channel resource block, and the operation in the expression is an operation in a finite field.

The terminal may also generate the sequence by:

wherein alpha is GF (p) in the finite field ⁿ ) P is prime number, n is integer, c represents channel sub-tree under quasi-orthogonal mode corresponding to the terminalIndex, RLSectorHopSeed as sector hopping seed value, c ₀ Representing the basic node of the logical channel tree corresponding to the terminal,

The terminal may also generate the sequence by:

wherein, B _G Representing the number of protected physical channel resource blocks at both ends of the frequency band in which the carrier is located, alpha being GF (p) in the finite field ⁿ ) The primitive element is that p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Representing a base node of a logical channel tree corresponding to the terminal,

the expression is taken as a lower bound integer of i, and m represents a slot mapped to the physical channel resource block.

The terminal may also generate the sequence by:

wherein, B _G Indicating the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, B _c Indicates the number of physical channel resource blocks contained in one carrier, f ₀ (m) represents the mapping from the logical carrier to the physical carrier, and α is GF (p) in the finite field ⁿ ) The primitive element is that p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Indicating the basic node of the logical channel tree corresponding to the terminal,

Wherein, an iterative method is adopted, and f (m + 1) of the next time slot m +1 is calculated by using the intermediate variable of the previous time slot m.

Wherein f (m + 1) of the next slot m +1 is calculated using the intermediate variable of the previous slot m by:

if f (m) = c × α ^m +c ₀ If I (m) = c × α ^m And calculates I (m + 1) = α × I (m), f (m + 1) = I (m + 1) + c ₀ ；

If it is not

Then let I (m) = c × α ^m And calculates I (m + 1) = α × I (m),

if it is not

Then, let I (m) = (4 XSLRSectorHopSeed + c) × α ^m And calculates I (m + 1) = α × I (m),

if it is notThen, let I (m) = (4 XSLRSectorHopSeed + c) × α ^m And calculates I (m + 1) = α × I (m),

when the number N1 of the basic nodes of the logic channel tree corresponding to the quasi-orthogonal reverse link of each terminal is not prime power, calculating the physical channel resource block mapped to the m time slot by the following method:

taking the nearest prime power N2 greater than N1, and taking different c according to Reed-Solomon code ₀ Generating a sequence of N2 rows;

for each time slot m, if the mapped physical channel resource block number f (m) is greater than N1-1, f (m) is deleted, and each f (m) with the row index in the column where f (m) is greater than the row where f (m) is located is sequentially shifted up.

Wherein, when the number N1 of the logical channel tree basic nodes corresponding to the quasi-orthogonal reverse link of each terminal is not a prime power, the physical channel resource block mapped to at the m-slot is calculated by:

taking the nearest power N2 of a prime number greater than N1, and taking a different c according to Reed-Solomon codes ₀ Generating a sequence of N2 rows, and taking out the sequence of the first N1 rows from the sequence of the N2 rows;

if N2= N1+1, for each slot m, if the mapped physical channel resource block number f (m) is greater than N1-1, changing the f (m) to an integer of 0 to N1-1 in which any one does not appear in the column in which the f (m) is located, or changing the f (m) to a value calculated with N1 as the base node number of the logical channel tree;

if N2 > N1+1, for each time slot m, if the mapped physical channel resource block number f (m) is greater than N1-1, then calculating the number t of the mapped physical channel resource block number f (m) which is greater than N1-1 and the row number is less than the number of the mapped physical channel resource block number f (m) in the time slot, and changing the f (m) greater than N1-1 into the t-th f (m) which is less than N1-1 and has the row number greater than N1-1 in the N2 row sequence.

When the primitive of the Reed-Solomon code is 2, the terminal may further generate the sequence by:

generating a pseudo-random sequence from an m-sequence generator having registers of order n, of which 2 ⁿ More than or equal to N-1,N is the number of basic nodes of the logic channel tree;

each bit of the pseudo-random sequence is respectively modulo-2 added with an identification sequence of a cell where the physical channel resource block is located to obtain a generated value;

the generated values are respectively compared with 0,1,2, 3, 1 ⁿ -1 is bit-XOR to get 2 ⁿ Value of

Sequence a is detected from left to right ₀ 、a ₁ 、a ₂ 、...、a ₂ ⁿ _-1 When a is detected _i When the value is larger than N-1, the last value of the sequence is taken to replace the value, the last value is deleted, and the operation is repeated until all the values in the sequence are less than or equal to N-1, and a sequence b is obtained ₀ 、b ₁ 、b ₂ 、...、b _N-1 ∈{0，1，2，...， N-1}；

Each value in the sequence represents a physical channel resource block mapped by each terminal of the same time slot, the terminal will b _(pc)mod(N) And the number is used as the physical channel resource block number to which the current time slot needs to be mapped, wherein p is a prime number, and c is the basic node number of the logic channel tree allocated to the terminal.

The invention also discloses a terminal device, comprising:

a module for generating a sequence according to a Reed-Solomon code;

and a module for mapping the logical channel tree basic node of the quasi-orthogonal reverse link of the terminal device to the physical channel resource block according to the generated sequence.

The module for generating a sequence according to Reed-Solomon codes may generate the sequence by the formula: f (m) = c × α ^m +c ₀ Wherein α is GF (p) in the finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, c ₀ And m represents a time slot mapped to the physical channel resource block, and the operation in the formula is an operation in a finite field.

The means for generating a sequence according to Reed-Solomon codes may also generate the sequence by the formula:

wherein alpha is GF (p) in the finite field ⁿ ) P is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, c ₀ Representing a base node of a logical channel tree corresponding to the terminal,

the expression takes a lower bound integer of i, m represents a time slot mapped to the physical channel resource block, and the operation in the expression is an operation in a finite field.

The means for generating a sequence according to Reed-Solomon codes may also generate the sequence by the formula:wherein, alpha is GF (p) in a finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Representing a base node of a logical channel tree corresponding to the terminal,

the expression takes the lower bound integer of i, m represents the time slot mapped to the physical channel resource block, and the operation in the expression is the operation in the finite field.

wherein, B _G Denotes the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, and alpha is GF (p) in the finite field ⁿ ) The above primitive, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Representing the logic corresponding to the terminalThe basic node of the channel tree is a basic node,

the expression takes the lower bound integer of i, and m represents the time slot mapped to the physical channel resource block.

wherein, B _G Indicating the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, B _c Indicates the number of physical channel resource blocks contained in one carrier, f ₀ (m) represents the mapping mode from the logic carrier to the physical carrier, and alpha is GF (p) in the finite field ⁿ ) P is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Representing the basic node of the logical channel tree corresponding to the terminal,

When the primitive element of the Reed-Solomon code is 2, the module for generating the sequence according to the Reed-Solomon code generates the sequence by:

Each value in the sequence represents a physical channel resource block mapped by each terminal of the same time slot, and the terminal device converts b _(pc)mod(N) As current time slot needsMapped to physical channel resource block number, where pAnd c is a basic node number of a logic channel tree allocated to the terminal equipment.

The invention also discloses a channel resource block mapping method, which is characterized by comprising the following steps:

and generating a sequence according to the Reed-Solomon code, and mapping the logic subcarrier of the terminal to the physical subcarrier according to the sequence.

Wherein each value in the sequence represents a physical subcarrier to which the logical subcarrier is mapped at a different transmission time interval, TTI; or, the physical channel resource block represents the mapping of each terminal slot of the same TTI;

the TTI is one or more orthogonal frequency division multiplexing, OFDM, symbols, or alternatively, is a physical frame.

The invention also discloses a terminal device, comprising:

a module for generating a sequence according to a Reed-Solomon code;

and a module for mapping the logical sub-carriers of the terminal device to the physical sub-carriers according to the generated sequence.

Each value in the sequence represents a physical subcarrier to which the logical subcarrier is mapped at a different transmission time interval, TTI; or, the physical channel resource block which represents the mapping of each terminal slot of the same TTI;

Through comparison, the technical scheme of the invention is mainly different from the prior art in that a sequence generated according to the Reed-Solomon code is used as a mapping mode from a logical channel tree basic node of a quasi-orthogonal reverse link to a physical channel resource block. And the terminal maps the sending data to the corresponding physical channel resource block according to the generated sequence, and each value in the sequence represents the physical channel resource block mapped at different time slots. The terminal only needs to calculate the sequence related to the terminal, and the generated sequence comprises the mapping of the physical channel resource blocks of a plurality of time slots. For example, the sequence generated by the terminal is 6, 10,7,1,0,9,5,8,3,4, and includes mapping of physical channel resource blocks of 10 slots, so that it is not necessary to generate a new sequence again in the 10 slots, and complexity of modulating data to the resource blocks by the terminal is greatly reduced.

Because the Reed-Solomon code has excellent cross correlation performance and autocorrelation performance and more sequence numbers, the condition that the terminal and other same terminals occupy the same physical channel resource block can be reduced, and the interference among different layers in the quasi-orthogonal reverse channel is more effectively averaged.

By the formula

And generating a sequence which is used as a mapping mode from a logical channel tree basic node to a physical channel resource block, so that the generated sequence comprises the mapping of the physical channel resource block with more time slots, and the period of the terminal for generating the sequence is increased, thereby further reducing the complexity of the terminal for modulating data to the resource block, and enabling the application of the scheme to be more flexible.

By the formula

And generating a sequence serving as a mapping mode from a basic node of a logical channel tree to a physical channel resource block, and controlling the mapping mode between adjacent cells, wherein if the RLSectorHopSeeds are the same, the mapping mode between the cells is the same, and if the RLSectorHopSeeds are different, the mapping mode between the cells is different. The same mapping mode can be adopted for the macro diversity condition, and if different mapping modes are adopted, the interference between different layers in the quasi-orthogonal reverse channel can be further averaged.

By the formula

The sequence which is used as the mapping mode from the logical channel tree basic node to the physical channel resource block is generated, so that the situation that the logical channel tree basic node is mapped to the protection physical channel resource block can be avoided.

By the formula

The sequence which is used as the mapping mode from the basic node of the logic channel tree to the physical channel resource block is generated, so that the scheme of the invention can support various bandwidths and better average the interference between different layers in the quasi-orthogonal reverse channel.

And (3) calculating f (m + 1) of the next time slot m +1 by using the intermediate variable of the previous time slot m by adopting an iterative method. When f (m) of each time slot is calculated, only one multiplication and one addition operation are needed, and the operation amount is further reduced.

When the number N1 of the basic nodes of the logic channel tree of the quasi-orthogonal reverse link corresponding to each terminal is not the prime power, a sequence of N2 rows is generated by selecting the nearest prime power N2 which is larger than the number, and a mapping mode of the basic nodes of the logic channel tree of the N1 rows is obtained by adjusting the generated sequence of the N2 rows, so that the scheme of the invention can be applied even if the number of the basic nodes of the logic channel tree of the quasi-orthogonal reverse link corresponding to each terminal is not the prime power, and the application range of the scheme of the invention is expanded.

When the primitive element of the Reed-Solomon code is 2, the Reed-Solomon code sequence can be obtained by a series of operations such as generating a pseudo-random sequence according to an m sequence generator and the like: b is a mixture of ₀ 、b ₁ 、b ₂ 、...、b _N-1 E.g. {0,1,2.,. N-1}, where each value in the sequence represents a physical channel resource block mapped by each terminal of the same slot, and the terminal will b _(pc)mod(N) And the number is used as a physical channel resource block number to which the current time slot needs to be mapped, wherein p is a prime number, and c is a basic node number of a logic channel tree allocated to the terminal. Provides another possible implementation for the scheme of the inventionIn addition, since the pseudo-random sequence is also generated by a register in the prior art, the scheme can be better compatible with the prior art.

The scheme of the invention can also be applied to the mapping from the logic subcarrier to the physical subcarrier on different Transmission Time Intervals (TTI), thereby further expanding the application range of the scheme of the invention.

Drawings

Fig. 1 is a schematic diagram illustrating a mapping manner of a logical channel tree basic node of a quasi-orthogonal reverse link to a physical channel resource block according to the prior art;

fig. 2 is a flowchart of a channel resource block mapping method according to a first embodiment of the present invention;

fig. 3 is a flowchart of a channel resource block mapping method according to a ninth embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail with reference to the accompanying drawings.

The core of the invention is that the terminal takes the Reed-Solomon code or the expanded Reed-Solomon code as a mapping mode from the logical channel tree basic node of the quasi-orthogonal reverse link to the physical channel resource block. Each terminal only needs to generate a Reed-Solomon code sequence or an expanded Reed-Solomon code sequence related to the terminal, and the sending data is mapped to the corresponding physical channel resource block in each time slot according to each value in the sequence.

The core of the present invention has been briefly described above, and embodiments of the present invention will be described in detail below based on the principle.

The first embodiment of the present invention relates to a channel resource mapping method, as shown in FIG. 2, in step 210And the terminal generates a Reed-Solomon code sequence. Specifically, the Reed-Solomon code is a q-ary domain BCH code of length q-1. Let the number of available subcarriers of the OFDM system be p ⁿ Equal to an element in GF (q) in the finite field, i.e. p ⁿ And = q, wherein p is a prime number and n is an integer. Generated RS code sequence (f) ^k (1)，f ^k (2)，f ^k (3)，...，f ^k (q-1)) means that the k-th logical channel tree basic node is mapped to the physical channel resource block f at different time respectively ^k (1)，f ^k (2)，f ^k (3)，...，f ^k (q-1).

Reed-Solomon codes can be represented by a polynomial:

is generated in which c _k Is the coefficient and alpha is the primitive. Different sectors, logical channel tree base nodes, sub-trees select different coefficient sets. When p is ⁿ And when the number of the basic nodes of the logic channel tree is larger than the number of the basic nodes of the logic channel tree, deleting the numerical values larger than the number of the basic nodes of the logic channel tree in the generated RS sequence.

Since each terminal only needs to generate a Reed-Solomon code sequence relating to the terminal, assuming that p is 11 and n is 1 in the present embodiment, the polynomial expression is f (m) = c × α ^m +c ₀ ，c ₀ E.g. GF (11), wherein m represents the time slot mapped to the physical channel resource block, c represents the channel sub-tree index in the quasi-orthogonal mode corresponding to the terminal, c ₀ And f (m) represents the physical channel resource block number mapped in the time slot m.

The addition in the polynomial is an addition in a finite field. For example, the mold 11, c is taken out of the above formula ₀ The value range of (d) is 0,1. And setting two antennas at the receiving end, wherein the corresponding c is 2 or 3. Then, when primitive α is 2, m is 1,2 if c is 2, 10 generates a logical channel corresponding to each terminalThe manner in which the tree base nodes are mapped to the physical channel resource blocks is shown in table 1; in the case where c is 3Table 2 shows how the basic node of the logical channel tree corresponding to each terminal generated by the method 10 is mapped to the physical channel resource block, where m is 1,2. Wherein different logical channel tree base nodes are represented by rows and different physical frames are represented by columns.

4	8	5	10	9	7	3	6	1	2
4	8	5	10	9	7	3	6	1	2	5	9	6	0	10	8	4	7	2	3
6	10	7	1	0	9	5	8	3	4	5	9	6	0	10	8	4	7	2	3
6	10	7	1	0	9	5	8	3	4	7	0	8	2	1	10	6	9	4	5
8	1	9	3	2	0	7	10	5	6	7	0	8	2	1	10	6	9	4	5
8	1	9	3	2	0	7	10	5	6	9	2	10	4	3	1	8	0	6	7
10	3	0	5	4	2	9	1	7	8	9	2	10	4	3	1	8	0	6	7
10	3	0	5	4	2	9	1	7	8	0	4	1	6	5	3	10	2	8	9
1	5	2	7	6	4	0	3	9	10	0	4	1	6	5	3	10	2	8	9
1	5	2	7	6	4	0	3	9	10	2	6	3	8	7	5	1	4	10	0
3	7	4	9	8	6	2	5	0	1	2	6	3	8	7	5	1	4	10	0

Table 1 (c = 2)

As shown in table 1, when c is 2, the sequence of the mapping representing the 1 st frame to the 10 th frame calculated by the terminal corresponding to the basic node 0 of the logical channel tree according to the Reed-Solomon code is 4,8,5, 10,9,7,3,6,1,2; the sequence of mapping from the 1 st frame to the 10 th frame calculated by the terminal corresponding to the logical channel tree basic node 1 according to the Reed-Solomon code is 5,9,6,0, 10,8,4,7,2, 3; and so on.

6	1	2	4	8	5	10	9	7	3
6	1	2	4	8	5	10	9	7	3	7	2	3	5	9	6	0	10	8	4

8	3	4	6	10	7	1	0	9	5
8	3	4	6	10	7	1	0	9	5	9	4	5	7	0	8	2	1	10	6
10	5	6	8	1	9	3	2	0	7	9	4	5	7	0	8	2	1	10	6
10	5	6	8	1	9	3	2	0	7	0	6	7	9	2	10	4	3	1	8
1	7	8	10	3	0	5	4	2	9	0	6	7	9	2	10	4	3	1	8
1	7	8	10	3	0	5	4	2	9	2	8	9	0	4	1	6	5	3	10
3	9	10	1	5	2	7	6	4	0	2	8	9	0	4	1	6	5	3	10
3	9	10	1	5	2	7	6	4	0	4	10	0	2	6	3	8	7	5	1
5	0	1	3	7	4	9	8	6	2	4	10	0	2	6	3	8	7	5	1

Table 2 (c = 3)

Similarly, as shown in table 2, when c is 3, the sequence indicating the mapping from the 1 st frame to the 10 th frame calculated by the terminal corresponding to the basic node 0 of the logical channel tree based on the Reed-Solomon code is 6,1,2,4,8,5, 10,9,7,3; the sequence of mapping from the 1 st frame to the 10 th frame calculated by the terminal corresponding to the logical channel tree basic node 1 according to the Reed-Solomon code is 7,2,3,5,9,6,0, 10,8, 4; and so on.

Next, step 220 is performed, in which the terminal uses the generated sequence as a mapping method from the basic node of the logical channel tree of the quasi-orthogonal reverse link to the physical channel resource block. That is, the terminal modulates transmission data into a corresponding physical resource block according to the generated sequence. Taking the terminal corresponding to the basic node 0 of the logical channel tree in table 1 as an example, the terminal modulates data onto the physical channel resource block 4 in the 1 st frame, modulates data onto the physical channel resource block 8 in the 2 nd frame, modulates data onto the physical channel resource block 5 in the 3 rd frame, and so on.

Each terminal only needs to generate a Reed-Solomon code sequence related to the terminal, and the sequence contains the mapping of the physical channel resource blocks of the 10 time slots, that is, the terminal does not need to calculate a new sequence again in the 10 time slots. Therefore, the calculation amount of mapping the basic node of the logic channel tree of the quasi-orthogonal reverse link corresponding to the terminal calculation to the physical channel resource block is greatly reduced.

In addition, the Reed-Solomon code has excellent cross correlation performance and autocorrelation performance and has a larger sequence number. Therefore, the situation that the terminal and other terminals occupy the same physical channel resource block can be reduced, and the interference between different layers in the quasi-orthogonal reverse channel is averaged more effectively. For the above case, in table 1, the physical channel resource blocks mapped by the basic node 2 of the logical channel tree in frames 1 to 10 are respectively 6, 10,7,1,0,9,5,8,3,4. In table 2, the physical channel resource blocks mapped by the logical channel tree base node 0 in frames 1 to 10 are 6,1,2,4,8,5, 10,9,7,3, respectively. The number of times that the basic node of the two logical channel trees respectively belonging to the channel sub-trees under different quasi-orthogonal modes is mapped to the same physical channel resource block is only once, namely the basic node is mapped to the physical channel resource block 6 in the 1 st frame. Moreover, by comparing table 1 with table 2, it can be easily found that the number of times that any one logical channel tree basic node and the same another logical channel tree basic node occupy the same physical channel resource block is less than or equal to 1. Thus, interference between different layers in the quasi-orthogonal backchannel can be effectively averaged.

A second embodiment of the present invention relates to a channel resource block mapping method, and is substantially the same as the first embodiment except that in the first embodiment, a terminal uses a Reed-Solomon code sequence as a mapping scheme from a logical channel tree basic node of a quasi-orthogonal reverse link corresponding to the terminal to a physical channel resource block, whereas in the present embodiment, a terminal uses an extended Reed-Solomon code sequence as a mapping scheme from a logical channel tree basic node of a quasi-orthogonal reverse link corresponding to the terminal to a physical channel resource block.

In particular, the terminal employs a modified RS code such that the period of the sequence increases to the square of q-1, i.e., by a polynomial

And generating a sequence. Wherein alpha is GF (p) in the finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to terminal, c ₀ Indicating the base node of the logical channel tree corresponding to the terminal,

denotes a lower bound integer taking i, m denotes time when mapping to a physical channel resource blockSlot, f (m) denotes the physical channel resource block number mapped at slot m.

Because the period of the sequence generated by the terminal is increased to the square of q-1, the mapping of the physical channel resource block containing more time slots is included, that is, the terminal needs to generate the expanded Reed-Solomon code sequence again as the mapping mode from the basic node of the logic channel tree of the quasi-orthogonal reverse link corresponding to the terminal to the physical channel resource block every other square time slot of q-1, thereby further reducing the complexity of the terminal for modulating data to the resource block and enabling the application of the scheme to be more flexible.

The third embodiment of the present invention relates to a channel resource block mapping method, and is further improved on the basis of the second embodiment. In the second embodiment, the terminal adopts a modified Reed-Solomon code sequence, so that the period of the sequence is increased to the square of q-1, while in the present embodiment, the terminal further introduces a parameter RLSectorHopSeed to set the mapping mode in different cells. Specifically, the terminal passes the polynomial

A sequence is generated. Wherein alpha is GF (p) in the finite field ⁿ ) The primitive elements are p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Indicating the base node of the logical channel tree corresponding to the terminal,

the expression takes the lower bound integer of i, m represents the time slot mapped to the physical channel resource block, and f (m) represents the physical channel resource block number mapped in the time slot m. Each cell supports a maximum of 4 receive antennas. Selecting different rlsectorhospeeds can make the mapping patterns of different cells different.

In a cellular communication system with a plurality of base stations, the mapping mode between adjacent cells can be controlled by a parameter rlsectorhopspeed in consideration of averaging interference between different cells. If the RLSectorHopSeed is the same, the mapping mode between the cells is the same, and if the RLSectorHopSeed is different, the mapping mode between the cells is different. The same mapping method can be used for the macro diversity case, and if different mapping methods are used, the interference between different layers in the quasi-orthogonal reverse channel can be further averaged.

A fourth embodiment of the present invention relates to a channel resource block mapping method, and is further improved on the basis of the third embodiment. In a third embodiment, the terminal adopts a modified Reed-Solomon code sequence, so that the period of the sequence is increased to the square of q-1, and a parameter RLSectorHopSeed is introduced to set the mapping mode in different cells. However, since in OFDM systemsThere are usually guard sub-carriers or guard physical channel resource blocks, so in this embodiment, the terminal needs to further introduce parameter B _G The guard resource blocks are taken into account.

Specifically, the terminal passes the polynomial

And generating a sequence. Wherein, B _G Denotes the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, and alpha is GF (p) in the finite field ⁿ ) The above primitive, p is prime number, n is integer, c represents channel sub-tree index in quasi-orthogonal mode corresponding to terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Indicating the base node of the logical channel tree corresponding to the terminal,

the expression takes the lower bound integer of i, m represents the time slot mapped to the physical channel resource block, and f (m) represents the physical channel resource block number mapped in the time slot m. Each cell supports a maximum of 4 receive antennas. Selecting different RLSectorHopSeeds can make different cells mapped differently.

For example, the full frequency band is divided into reference numerals0-28 physical channel resource blocks, there are 2 guard physical channel resource blocks. Since usually the guard physical channel resource blocks are placed on both sides of the frequency band, the physical channel resource blocks numbered 0 and 28 are the guard physical channel resource blocks. By mixing B _G Setting to be 2, so that the physical channel resource block originally mapped to the label number 0 is changed into the physical channel resource block mapped to the label number 1; and limiting the number of the mapped physical channel resource block to be 0-26 by setting a limit area, so that the physical channel resource block originally mapped to the number 26 is changed into the physical channel resource block mapped to the number 27. The situation that the basic node of the logic channel tree is mapped to the resource block of the protection physical channel is avoided.

The channel resource block mapping method according to the fifth embodiment of the present invention is further improved based on the fourth embodiment. In a fourth embodiment, the terminal adopts a modified Reed-Solomon code sequence, so that the period of the sequence is increased to be the square of q-1, and a parameter RLSectorHopSeed and a parameter B are introduced _G And setting a mapping mode in different cells and avoiding mapping to a protection physical channel resource block. In the embodiment, the terminal further expands the Reed-Solomon code to support various bandwidths and better average the interference between different layers in the orthogonal reverse channel.

Specifically, the terminal passes the polynomial

And generating a sequence. Wherein, B _G Indicating the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, B _c Indicates the number of physical channel resource blocks contained in one carrier, f ₀ (m) represents a mapping method from a logical carrier to a physical carrier, and α is GF (p) in a finite field ⁿ ) The primitive elements are p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Indicating the base node of the logical channel tree corresponding to the terminal,

By the formula

The sequence is generated as a mapping manner from the logical channel tree basic node to the physical channel resource block, so that the present embodiment can support a plurality of bandwidths, for example, a bandwidth of 5 million including one carrier, a bandwidth of 20 million including 4 carriers, and the like. Moreover, by modulating data on physical channel resource blocks of different carriers in different frames, for example, modulating data on physical channel resource block numbered 5 of the 1 st carrier in the 1 st frame and modulating data on physical channel resource block numbered 8 of the 3 rd carrier in the 2 nd frame, it is possible to further reduce the situation that a terminal and the same other terminal occupy the same physical channel resource block, and better equalize interference between different layers in the quasi-orthogonal backchannel.

A sixth embodiment of the present invention relates to a channel resource block mapping method, and is a further improvement of the first embodiment. And adopting an iterative method when calculating f (m) of the time slot m, and calculating f (m + 1) of the next time slot m +1 by using the intermediate variable of the previous time slot m.

For example, set at m time slots, set f ₀ (m)＝c×2 ^m Then calculated f (m) = c × 2 ^m +c ₀ Can be converted into f (m) = f ₀ (m)+c ₀ ，c ₀ Is epsilon GF (p). Then, at the time m +1, calculated f (m + 1) = f ₀ (m+1)+c ₀ ＝f ₀ (m)×2+c ₀ ，c ₀ Is epsilon GF (p). Therefore, when f (m) of each time slot is calculated, only one multiplication and one addition operation are needed, and the reduction is further realizedThe amount of computation is calculated.

Likewise, forAssuming that I (m) = c × α ^m Then I (m + 1) can be iteratively calculated as: i (m + 1) = α × I (m), f (m + 1) may be calculated as:

for

Assuming that I (m) = (4X RLSectorHopSeed + c) × alpha ^m Then I (m + 1) can be iteratively calculated as: i (m + 1) = α × I (m), f (m + 1) may be calculated as:

for the

Assuming that I (m) = (4. Times. RLSectorHopSeed + c) × α ^m Then I (m + 1) can be iteratively calculated as: i (m + 1) = α × I (m), f (m + 1) may be calculated as:

a seventh embodiment of the present invention relates to a channel resource block mapping method, which is substantially the same as the first embodiment except that in the first embodiment, the number of logical channel tree base nodes corresponding to the quasi-orthogonal reverse link of each terminal is a prime power, whereas in the present embodiment, the number N1 of logical channel tree base nodes corresponding to the quasi-orthogonal reverse link of each terminal is not a prime power, and therefore, f (m) of a calculated slot m is adjusted accordingly.

Specifically, when corresponding to the alignment of each terminalWhen the number N1 of the logical channel tree basic nodes of the reverse link is not prime number power, a nearest prime number power N2 larger than the number can be selected, N2 is larger than N1, and different c is selected according to Reed-Solomon codes ₀ A sequence of N2 rows is generated. In order to obtain the mapping mode of the basic nodes of the N1 logical channel trees, deletion operation needs to be performed on the number exceeding Nl-1 in each column generation sequence, and in the column where the number is located, elements with row indexes larger than that of the row where the number is located are sequentially moved upwards to fill in the vacancy after the number is deleted. That is, for each slot m, if the mapped physical channel resource block number f (m) is largeAt N1-1, f (m) is deleted, and each f (m) in the row with the row index larger than that of the row with f (m) is sequentially shifted up.

For example, if the number N1 of the basic nodes of the logical channel tree corresponding to the quasi-orthogonal reverse link of each terminal is 9, then the nearest prime power 11 greater than 9 is selected, and different c is selected according to the Reed-Solomon code ₀ A sequence of N2 rows is generated. Taking the first column in table 1 as an example (that is, time slot 1), in order to obtain the mapping manner from the logical channel tree basic node 0 to the logical channel tree basic node 8, it is necessary to delete the number greater than 8 in the column, and sequentially shift up the elements in the row of the column whose row index is greater than the deleted element, so as to obtain the mapping manner from the logical channel tree basic node 0 to the logical channel tree basic node 8 in time slot 1: 4. 5, 6, 7, 0,1,2 and 3.

It can be seen that the scheme of the present invention can be applied even if the number of basic nodes of the logical channel tree corresponding to the quasi-orthogonal reverse links of each terminal is not a prime power.

An eighth embodiment of the present invention relates to a channel resource block mapping method, and is substantially the same as the seventh embodiment except that the adjustment method for f (m) of a calculated slot m is different.

Specifically, when the number N1 of logical channel tree basic nodes corresponding to the quasi-orthogonal reverse links of the terminals is not a prime power, the nearest one greater than the number may be selectedPower N2, N2 > N1, different c's are selected according to Reed-Solomon code ₀ A sequence of N2 rows is generated. To obtain the mapping mode of the basic nodes of the N1 logical channel trees, the first N1 rows are taken, i.e. f (m) = c × 2 ^m +c ₀ ，c ₀ Take 0,1, N1-1.

If N2= N1+1, for each slot m, i.e. in the mth frame, if there is a c' ₀ Basic nodes of the logical channel tree, corresponding to f (m) = c × 2 ^m +c′ ₀ If the logical channel tree is more than N1-1, the logical channel tree basic node c 'is formed' ₀ The corresponding f (m) is changed into an integer of 0 to N1-1 without any one appearing in the column of the f (m), or the logical channel tree basic node c' ₀ The corresponding f (m) is changed to f (m) = c × 2 ^m +N1。

If N2 > N1+1, for each slot m, i.e. m frame, if there is c' ₀ Basic nodes of a logic channel tree, corresponding to f (m) = c multiplied by 2 ^m +c′ ₀ N1-1, then c is calculated at this time slot, i.e. in the m-th frame ₀ ＜c′ ₀ Several of the elements of (A) correspond to f (m) > N1-1. Assuming that t elements correspondf (m) > N1-1, then the logical channel tree basic node c' ₀ The corresponding f (m) is changed to f (m) = c × 2 ^m +N1+t。

A ninth embodiment of the present invention relates to a channel resource block mapping method, in this embodiment, the primitive of the Reed-Solomon code is 2, the terminal obtains the Reed-Solomon code sequence through a series of operations such as generating a pseudo-random sequence according to an m-sequence generator, and each value in the generated sequence represents a physical channel resource block mapped by each terminal of the current time slot, and the specific flow is shown in fig. 3.

In step 310, a pseudo-random sequence is generated from the m-sequence. Specifically, the m-sequence generator is composed of a linear feedback shift register, and the initialization value of the register is determined by a hopping seed, a layer number Q, timing information, and the like. The number of frequency points (namely the number of basic nodes of a logic channel tree) of the frequency hopping which needs to be generated is set as N, the register of the m sequence generator is takenThe register is of n-order, of which 2 ⁿ ≥N-1。

Then, step 320 is performed to add the value output from each register modulo 2 with the cell id sequence to obtain the generated value. Specifically, each bit of the value output by the n-order register is modulo-2 added to the identification sequence of the cell in which the physical channel resource block is located, to obtain a generated value.

Next, step 330 is entered, and the generated values are compared with 0,1,2, 3,. And 2, respectively ⁿ -1 is bit-XOR to get 2 ⁿ Value a ₀ 、a ₁ 、a ₂ 、...、a ₂ ⁿ _-1 Sequence of

。

Next, in step 340, the sequence a is detected ₀ 、a ₁ 、a ₂ 、...、a ₂ ⁿ _-1 After executing the corresponding operation, obtain the sequence b ₀ 、b ₁ 、b ₂ 、...、b _N-1 . Specifically, the sequence a is sequentially detected from left to right ₀ 、a ₁ 、a ₂ 、...、 a ₂ ⁿ _-1 When a is detected _i When the value is larger than N-1, the last value of the sequence is taken to replace the value, the last value is deleted, and the operation is repeated until all the values in the sequence are less than or equal to N-1, so that a sequence b is obtained ₀ 、b ₁ 、 b ₂ 、...、b _N-1 Sequence b ₀ 、b ₁ 、b ₂ 、...、b _N-1 E.g. {0,1,2.., N-1}. Since the value of the register changes every TTI as the number of clocks increases, and the output value at different time is generated, the sequence b is finally generated from step 310 to step 340 ₀ 、b ₁ 、b ₂ 、...、b _N-1 The Reed-Solomon code sequence at the current time.

Then, in step 350, the terminal sets the block number as b _(pc)mod(N) The physical resource block of (2) is used as the physical resource block mapped at the current time. WhereinP is prime number, c is basic node number of logic channel tree allocated to the terminal. That is, for a basic node C of a logic channel tree, the subscript b is selected to be (P × C) mod (N), that is, the block number b _(pc)mod(N) The physical channel resource block of (2) is used as the physical channel resource block mapped by the basic node C of the logical channel tree. That is, for that moment, the terminal assigned logical channel tree base node C modulates the data to be transmitted to block number b _(pc)mod(N) Is sent out on the physical channel resource.

Due to the sequence b ₀ 、b ₁ 、b ₂ 、...、b _N-1 Each value in (1) represents a physical channel resource block mapped by each terminal at the current time, therefore, at the next time (TTI), the clock of the m-sequence generator is incremented, the register outputs a new value, and the above operations are repeated to realize the mapping from the logical base node to the physical channel resource block at different times. Since the pseudo-random sequence is also generated by the m-sequence generator in the prior art, the embodiment is better compatible with the prior art.

A tenth embodiment of the present invention relates to a channel resource block mapping method, in which a terminal generates a sequence according to a Reed-Solomon code and maps logical subcarriers of the terminal to physical subcarriers according to the sequence. That is, the users allocated to a certain logical subcarrier group, determine the allocated physical subcarrier group by the mapping method of the present embodiment, modulate the data to be transmitted onto the physical subcarrier group, and transmit the data.

For example, by using any one of the first to eighth embodiments of the present invention to generate a sequence according to a Reed-Solomon code, a generated sequence is obtained, and each value in the sequence represents a physical subcarrier to which a logical subcarrier is mapped in different TTIs; alternatively, with the sequence generation method according to the ninth embodiment of the present invention, each value in the generated sequence represents a physical channel resource block to which each terminal slot of the same TTI is mapped. The specific mapping method is substantially the same as the corresponding embodiment, and the difference is that in the above embodiment, the basic node of the logical channel tree of the quasi-orthogonal reverse link of the terminal is mapped to the physical channel resource block, while in the present embodiment, the logical subcarriers of the terminal are mapped to the physical subcarriers, and the number of the mapped frequency points is determined by the number of the effective subcarriers participating in frequency hopping, which is not described herein again.

It should be noted that the TTI may be one or more orthogonal frequency division multiplexing OFDM symbols, or may also be one physical frame.

An eleventh embodiment of the present invention is directed to a terminal device comprising means for generating a sequence from a Reed-Solomon code and means for mapping the generated sequence as a logical channel tree base node to a physical channel resource block corresponding to a quasi-orthogonal reverse link of the terminal device. Wherein the module for generating the sequence according to the Reed-Solomon code can be represented by the formula f (m) = c × α ^m +c ₀ Generating the sequence, wherein alpha is GF (p) in the finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to terminal, c ₀ The logical channel tree basic node corresponding to the terminal is shown, m represents a time slot mapped to a physical channel resource block, and the operation in the formula is an operation in a finite field. Operations in the finite field use expressions in the real number domain: f (m) = (c × α) ^m +c ₀ )mod(p ⁿ )。

For example, the sequences generated according to the Reed-Solomon code corresponding to the first to tenth slots are 4,8,5 and 10,9,7,3,6,1,2, and then the module for mapping the generated sequences as the logical channel tree basic node of the quasi-orthogonal reverse link corresponding to the terminal device to the physical channel resource block modulates the data onto the physical channel resource block 4 in the 1 st frame, modulates the data onto the physical channel resource block 8 in the 2 nd frame, modulates the data onto the physical channel resource block 5 in the 3 rd frame, and so on.

The terminal equipment only needs to calculate the sequence related to the terminal, and the generated sequence comprises the mapping of the physical channel resource blocks of a plurality of time slots. For example, the sequence generated by the terminal is 6, 10,7,1,0,9,5,8,3,4, and includes mapping of physical channel resource blocks of 10 slots, so that it is not necessary to generate a new sequence again in the 10 slots, and complexity of modulating data to the resource blocks by the terminal device is greatly reduced.

Moreover, because the Reed-Solomon code has excellent cross-correlation performance and autocorrelation performance and more sequence numbers, the situation that the terminal equipment and other same terminal equipment occupy the same physical channel resource block can be reduced, and the interference between different layers in the quasi-orthogonal reverse channel is more effectively averaged.

It should be noted that the module for generating the sequence according to the Reed-Solomon code can also generate the sequence according to a formula

Generating the sequence, wherein alpha is GF (p) in finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to terminal, c ₀ Indicating the basic node of the logical channel tree corresponding to the terminal,

the expression takes the lower bound integer of i, and m represents the slot mapped to the physical channel resource block. The generated sequence comprises the mapping of the physical channel resource block with more time slots, and the period of the terminal for generating the sequence is increased, so that the complexity of the terminal for modulating data to the resource block is further reduced, and the scheme is more flexible to apply.

The module for generating the sequence from the Reed-Solomon code may also be formulated

Generating the sequence, wherein alpha is GF (p) in finite field ⁿ ) P is prime number, n is integer,c represents the channel sub-tree index under the quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is the sector frequency hopping seed value, c ₀ Representing the logical channel tree base node corresponding to the terminal,

the expression takes the lower bound integer of i, and m represents the slot mapped to the physical channel resource block. The mapping modes between adjacent cells can be same or different, if the RLSectorHopSeeds are the same, the mapping modes between the cells are the same, and if the RLSectorHopSeeds are different, the mapping modes between the cells are different. The same mapping mode can be adopted for the macro diversity condition, and if different mapping modes are adopted, the interference between different layers in the quasi-orthogonal reverse channel can be further averaged.

Generating the sequence, wherein B _G Denotes the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, and alpha is GF (p) in the finite field ⁿ ) The primitive elements are p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Indicating the base node of the logical channel tree corresponding to the terminal,

the expression i is taken as a lower bound integer, and m is taken as a slot mapped to a physical channel resource block. The situation that the basic node of the logic channel tree is mapped to the resource block of the protection physical channel is avoided.

Generating the sequence, wherein B _G Indicating guarantees at both ends of the frequency band in which the carrier is locatedNumber of physical channel resource blocks, B _c Indicates the number of physical channel resource blocks contained in one carrier, f ₀ (m) denotes the mapping of logical carriers to physical carriers, α being GF (p) in the finite field ⁿ ) The primitive element is that p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ The base nodes of the logic channel tree corresponding to the terminal are shown,

the expression i is taken as a lower bound integer, and m is taken as a slot mapped to a physical channel resource block. The scheme of the invention supports various bandwidths and better averages the interference between different layers in the quasi-orthogonal reverse channel.

When the primitive of the Reed-Solomon code is 2, the module for generating a sequence according to the Reed-Solomon code may further generate the sequence by:

generating a pseudo-random sequence from an m-sequence generator whose registers are n-order registers, of which 2 ⁿ More than or equal to N-1,N is the number of basic nodes of the logic channel tree;

each bit of the generated pseudo-random sequence is added with an identification sequence of a cell where a physical channel resource block is located in a modulo 2 mode to obtain a generated value;

Sequence a is detected from left to right ₀ 、a ₁ 、a ₂ 、...、a ₂ ⁿ _-1 ' when a is detected _i When N-1, the last value of the sequence is substituted for the value and deleted, and the operation is repeated until all values in the sequence are less than or equal to N-1, giving the sequence b ₀ 、b ₁ 、b ₂ 、...、b _N-1 ∈{0，1，2，...，N-1}；

Each value in the sequence represents a physical channel resource block mapped by each terminal of the same time slot, and the terminal device will b _(pc)mod(N) And the number is used as the physical channel resource block number to which the current time slot needs to be mapped, wherein p is a prime number, and c is the basic node number of the logic channel tree allocated to the terminal equipment.

A twelfth embodiment of the present invention relates to a terminal device, and is substantially the same as the eleventh embodiment except that in the eleventh embodiment, logical channel tree basic nodes of a quasi-orthogonal reverse link of a terminal are mapped to physical channel resource blocks, and in the present embodiment, logical subcarriers of the terminal are mapped to physical subcarriers, and the number of frequency points to be mapped is determined by the number of effective subcarriers participating in frequency hopping.

The terminal represents physical subcarriers mapped by the logical subcarriers in different TTIs according to each value in a sequence generated by the Reed-Solomon code; or, the physical channel resource block to which each terminal slot of the same TTI is mapped is represented. The TTI may be one or more orthogonal frequency division multiplexing OFDM symbols, or may also be one physical frame.

While the invention has been shown and described with reference to certain preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention.

Claims

1. A channel resource block mapping method is characterized by comprising the following steps:

2. The channel resource block mapping method of claim 1, wherein each value in the sequence represents a physical channel resource block mapped at a different time slot by the logical channel tree base node.

3. The channel resource block mapping method of claim 1, wherein the terminal generates the sequence according to the following formula: f (m) = c × α ^m +c ₀ Wherein α is GF (p) in the finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, c ₀ And m represents a time slot mapped to the physical channel resource block, and the operation in the formula is the operation in a finite field.

4. The channel resource block mapping method of claim 1, wherein the terminal generates the sequence according to the following formula:

wherein, alpha is GF (p) in a finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, c ₀ Representing a base node of a logical channel tree corresponding to the terminal,

5. The channel resource block mapping method of claim 1, wherein the terminal generates the sequence according to the following formula:

wherein alpha is GF (p) in the finite field ⁿ ) The primitive element is that p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Representing the basic node of the logical channel tree corresponding to the terminal,

m is a lower bound integer representing iThe time slot mapped to the physical channel resource block is shown, and the operation in the formula is an operation in a finite field.

6. The channel resource block mapping method of claim 1, wherein the terminal generates the sequence according to the following formula:wherein, B _G Denotes the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, and alpha is GF (p) in the finite field ⁿ ) The primitive element is that p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Representing the basic node of the logical channel tree corresponding to the terminal,

7. The channel resource block mapping method of claim 1, wherein the terminal generates the sequence according to the following formula:

wherein, B _G Indicating the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, B _c Representing physical channel resources contained in one carrierNumber of blocks, f ₀ (m) represents the mapping from the logical carrier to the physical carrier, and α is GF (p) in the finite field ⁿ ) P is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Indicating the basic node of the logical channel tree corresponding to the terminal,

8. The channel resource block mapping method according to any of claims 3-7, wherein f (m + 1) of the next slot m +1 is calculated using the intermediate variable of the previous slot m in an iterative method.

9. The channel resource block mapping method of claim 8, wherein f (m + 1) of the next slot m +1 is calculated by using the intermediate variable of the previous slot m in the following manner:

If it is used

Then, let I (m) = c × α ^m And calculates I (m + 1) = α × I (m),

if it is not

Let I (m) = (4 × rlsectorhosseed + c) × α ^m And calculates I (m + 1) = α × I (m),

if it is used

10. the channel resource block mapping method according to any of claims 3 to 7, wherein when the number N1 of logical channel tree base nodes corresponding to the quasi-orthogonal reverse links of each terminal is not a prime power, the physical channel resource block mapped to at m slots is calculated by:

11. The channel resource block mapping method according to any of claims 3 to 7, wherein when the number N1 of logical channel tree base nodes corresponding to the quasi-orthogonal reverse links of each terminal is not a prime power, the physical channel resource block mapped to at m slots is calculated by:

if N2 > N1+1, for each time slot m, if the mapped physical channel resource block number f (m) is greater than N1-1, then calculating the number t of the mapped physical channel resource block number f (m) which is greater than N1-1 and the number of the row number which is less than the number of the mapped physical channel resource block number f (m) in the time slot, and changing the f (m) which is greater than N1-1 into the t-th f (m) which is less than N1-1 and has the row number which is greater than N1-1 in the N2 row sequence.

12. The channel resource block mapping method of claim 1, wherein when the primitive of the Reed-Solomon code is 2, the sequence is generated by:

the generated values are respectively compared with 0,1,2, 3, 1 ⁿ -1 is bit-XOR to get 2 ⁿ Value a ₀ 、a ₁ 、a ₂ 、 ...、

Sequence a is detected from left to right ₀ 、a ₁ 、a ₂ 、...、a _2n-1 When a is detected _i When the sequence is more than N-1, the last value of the sequence is taken to replace the value, the last value is deleted, and the operation is repeated until all the values in the sequence are less than or equal to N-1, and a sequence b is obtained ₀ 、b ₁ 、b ₂ 、...、b _N-1 ∈{0，1，2，...， N-1}；

Respective values in the sequencePhysical channel resource block mapped by each terminal representing the same time slot, the terminal b _(pc)mod(N) And the number is used as the physical channel resource block number to which the current time slot needs to be mapped, wherein p is a prime number, and c is the basic node number of the logic channel tree allocated to the terminal.

13. A terminal device, comprising:

a module for generating a sequence according to a Reed-Solomon code;

and a module for mapping the logical channel tree base node of the quasi-orthogonal reverse link of the terminal device to the physical channel resource block according to the generated sequence.

14. The terminal device of claim 13, wherein the means for generating the sequence according to Reed-Solomon codes generates the sequence by: f (m) = c × α ^m +c ₀ Wherein α is GF (p) in the finite field ⁿ ) The primitive element above, p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, c ₀ And m represents a time slot mapped to the physical channel resource block, and the operation in the formula is the operation in a finite field.

15. The terminal device of claim 13, wherein the means for generating the sequence according to Reed-Solomon codes generates the sequence by:

the expression i is a lower bound integer, m is a time slot mapped to the physical channel resource block, and the operation in the expression is an operation in a finite field.

16. The terminal device of claim 13, wherein the means for generating the sequence according to Reed-Solomon codes generates the sequence by:

wherein alpha is GF (p) in the finite field ⁿ ) P is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c is ₀ Representing the basic node of the logical channel tree corresponding to the terminal,

17. The terminal device of claim 13, wherein the means for generating the sequence according to Reed-Solomon codes generates the sequence by:

wherein, B _G Denotes the number of guard physical channel resource blocks at both ends of the frequency band in which the carrier is located, and alpha is GF (p) in the finite field ⁿ ) The primitive element is that p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Representing a base node of a logical channel tree corresponding to the terminal,

18. The terminal device of claim 13, wherein the means for generating the sequence according to Reed-Solomon codes generates the sequence by:

wherein, B _G Indicating the number of guard physical channel resource blocks at both ends of the band in which the carrier is located, B _c Indicates the number of physical channel resource blocks contained in one carrier, f ₀ (m) represents the mapping from the logical carrier to the physical carrier, and α is GF (p) in the finite field ⁿ ) The primitive element is that p is prime number, n is integer, c represents channel sub-tree index under quasi-orthogonal mode corresponding to the terminal, RLSectorHopSeed is sector frequency hopping seed value, c ₀ Indicating the basic node of the logical channel tree corresponding to the terminal,

19. The terminal device of claim 13, wherein when the primitive of the Reed-Solomon code is 2, the means for generating the sequence according to the Reed-Solomon code generates the sequence by:

generating a pseudo-random sequence by an m-sequence generator having registers of order n, of which 2 ⁿ More than or equal to N-1,N is the number of basic nodes of the logic channel tree;

the generated values are respectively compared with 0,1,2, 3, 1 ⁿ -1 is bit-XOR to get 2 ⁿ Value a ₀ 、a ₁ 、a ₂ 、...、

Sequence a is detected from left to right ₀ 、a ₁ 、a ₂ 、...、a _2n-1 When a is detected ₁ When the value is larger than N-1, the last value of the sequence is taken to replace the value, the last value is deleted, and the operation is repeated until all the values in the sequence are less than or equal to N-1, and a sequence b is obtained ₀ 、b ₁ 、b ₂ 、...、b _N-1 ∈{0，1，2，...， N-1}；

Each value in the sequence represents a physical channel resource block mapped by each terminal of the same time slot, and the terminal device converts b _(pc)mod(N) And the number is used as a physical channel resource block number to which the current time slot needs to be mapped, wherein p is a prime number, and c is a basic node number of a logic channel tree allocated to the terminal equipment.

20. A channel resource block mapping method is characterized by comprising the following steps:

21. The channel resource block mapping method of claim 20,

each value in the sequence represents a physical subcarrier mapped by the logical subcarrier at a different Transmission Time Interval (TTI); or, the physical channel resource block which represents the mapping of each terminal slot of the same TTI;

the TTI is one or more orthogonal frequency division multiplexing OFDM symbols, or one physical frame.

22. A terminal device, comprising:

a module for generating a sequence according to a Reed-Solomon code;

and a module for mapping the logical sub-carriers of the terminal device to physical sub-carriers according to the generated sequence.

23. The terminal device of claim 23,

each value in the sequence represents a physical subcarrier to which the logical subcarrier maps at a different transmission time interval, TTI; or, the physical channel resource block which represents the mapping of each terminal slot of the same TTI;