CN105790917B - A kind of multi-user's up-link access method based on resource pattern - Google Patents

Abstract

The invention discloses a kind of multi-user's up-link access methods based on resource pattern, comprising steps of carrying out quadrature divide to the bandwidth resources of uplink multi-address access channel, the molecular resource block of resource grains is obtained, and the B resource blocks are combined, obtains basic scheduling unit；The basic scheduling unit is divided into N number of resource vector；To each resource vector, K resource pattern composition resource pattern group is selected；Each user of multi-upstream access selects one of them from the resource pattern group, and according to selected resource pattern group, sends data using corresponding resource pattern and preset coded modulation scheme on each resource vector.The present invention has the advantage that the defects of access of conventional orthogonal multiple access can be overcome to be unable to fully using the diversity gain of channel width resource, multi-user's capacity gain and multi-user diversity gain, while the defect that traditional non-orthogonal multiple access technology combined decoding complexity can be overcome high.

Description

A multi-user uplink access method based on resource patterns

technical field

The invention relates to the technical field of uplink multiple access for digital information transmission, in particular to a resource pattern-based multi-user uplink access method.

Background technique

In a typical wireless digital communication system, the receiving end of the base station needs to communicate with multiple uplink users within the coverage area, and it is necessary to solve the transmission problem of large-scale users under the uplink multiple access channel.

Orthogonal multiple access technologies are widely used in traditional multi-user transmission schemes under uplink multiple access channels. Typical orthogonal multiple access technologies include: Time Division Multiple Access (TDMA), Frequency Division Multiple Access Access (Frequency Division Multiple Access, FDMA) and Orthogonal Frequency Division Multiple Access (Orthogonal Frequency Division Multiple Access, OFDMA), etc. In essence, Orthogonal Multiple Access is a method for orthogonally partitioning physical layer channel bandwidth resources at the symbol level of the discrete baseband equivalent channel model. Taking TDMA as an example, TDMA allocates resources for a period of time (that is, symbol resources corresponding to a period of transmission time) for each user to transmit signals of the uplink user. Orthogonal multiple access technology is simple and flexible to implement, but when using orthogonal multiple access technology, the achievable rate domain of multi-user transmission is limited, and its upper bound is far from the upper bound of the capacity domain of the uplink multiple access channel. Large, that is, the multi-user joint attainable rate loss is large, and the capacity gain and diversity gain of multi-user non-orthogonal multiple access cannot be exploited. On the other hand, taking the Orthogonal Frequency Division Multiple Access technology in the fourth generation mobile communication system as an example, it usually divides continuous time domain and frequency domain resources as resource blocks when dividing channel bandwidth resources. Using this channel resource division method cannot fully tap the diversity gain of available channel bandwidth resources, resulting in a significant increase in the packet loss rate and dropout probability of users when multiple users access.

In order to maximize the transmission rate of the system, network information theory can prove that the non-orthogonal multiple access technology based on superposition coding (Superposition Coding, SC) is optimal. In order to achieve optimal transmission performance, the receiving end usually adopts a demodulation and decoding method of superposition coding and serial interference cancellation (Successive Interference Cancellation, SIC) technology. The SIC needs to demodulate and decode the signal of a certain user before it can demodulate and decode the signal of the second user, and so on. SIC makes the complexity of terminal algorithm implementation, pilot design, channel estimation and system scheduling rise sharply with the increase of the number of users; at the same time, using SIC will cause decoding delay and error transmission.

Considering the Superposition Coding (SC) of all users comprehensively, when the number of access users is large, the effect of SC performance improvement gradually decreases, but the complexity of SC decoding increases rapidly. Simultaneous Decoding (SD), also known as Joint Decoding (JD), is another demodulation and decoding method of SC, and can also achieve optimal transmission performance. Compared with the serial interference cancellation (Successive Interference Cancellation, SIC) technology, simultaneous decoding does not need to decode the information of each user in turn, but adopts a joint decoding method, usually through iterations, and can simultaneously demodulate the information of all users . Therefore, SD technology does not have the shortcomings of SIC decoding delay and error transmission, but when the number of superimposed users is large, the implementation complexity of SD is very high. Therefore, the traditional non-orthogonal multiple access technology based on optimal superposition coding is difficult to be used in an uplink multiple access scenario with a large number of users and a high load rate due to complexity.

Contents of the invention

The present invention aims to solve at least one of the above-mentioned technical problems.

Therefore, an object of the present invention is to propose a multi-user uplink access method based on resource patterns.

In order to achieve the above object, the embodiment of the present invention discloses a multi-user uplink access method based on resource patterns, which includes the following steps: S1: Carry out orthogonal segmentation on the bandwidth resources of the uplink multiple access channel to obtain resource particle composition , and combine the B resource blocks together to obtain a basic scheduling unit; divide the basic scheduling unit into N resource vectors, denoted as V ₁ , V ₂ ,..., V _N , where the number of resource particles in each resource vector is S ₁ , S ₂ , ..., S _N ; S2: For each resource vector V _i , select K resource patterns to form a resource pattern group P _{i ,1} ,P _i,2 ,...,P _i,K , where the resource pattern P _i,j is a subset of the set {1,2,...,S _i }, where i∈[1, N], j∈[1,K], the number of elements in P _i,j is L _i,j ; and S3: Each user of uplink access selects one of them from the resource pattern group, and according to The selected resource pattern group uses the corresponding resource pattern and the preset coding and modulation mode to send data on each resource vector.

The multi-user uplink access method based on resource patterns according to the embodiment of the present invention can overcome the defects of traditional orthogonal multiple access that cannot make full use of channel bandwidth resources such as diversity gain, multi-user capacity gain, and multi-user diversity gain, and can simultaneously It overcomes the defect of high joint decoding complexity of traditional non-orthogonal multiple access technology.

In addition, the resource pattern-based multi-user uplink access method according to the above-mentioned embodiments of the present invention may also have the following additional technical features:

Further, in step S1, when dividing resource vectors, each resource vector is composed of resource elements with similar fading conditions.

Further, the process of determining the number K of resource patterns in step S2 and the resource pattern group selected by the user in step S3 includes the following steps: for the scheduling access scenario, M access users are set, S2a: set The number K of resource patterns described in step S2 is set to the number of users M; S3a: each user selects a resource pattern group from the preferred resource pattern group described in step S2 in one-to-one correspondence; for the random access scenario, set Assuming there are M access users, S2b: set the number K of resource patterns in step S2 as K'; S3b: each user randomly selects a resource pattern group from the preferred resource pattern groups in step S2.

Further, in step S3, the process that the uplink access user uses the corresponding resource pattern and the preset coding and modulation mode to send data on each resource vector includes the following steps: S31: The uplink access user transmits data according to the preset The set encoding and modulation mode performs channel encoding on the information bits to be transmitted to obtain encoded bits; S32: the uplink access user performs bit interleaving on the encoded bits according to the preset encoding and modulation mode to obtain interleaved bits; and S33: the uplink The accessing user sequentially maps the interleaved bits to resource vectors V ₁ , V ₂ , ..., V _N according to the preset coding and modulation mode and the selected resource pattern group.

Further, step S33 further includes: S331: the uplink access user maps the corresponding interleaved bits to L _i,j symbols according to the preset coding and modulation mode; and S332: the uplink access user The L _i,j symbols are sequentially loaded onto the resource vector V _i according to the resource pattern P _i,j .

Further, the resource elements with similar fading conditions are resource elements carried by adjacent time, adjacent subcarriers, or adjacent antennas whose correlation coefficient is higher than a preset value.

Additional aspects and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.

Description of drawings

The above and/or additional aspects and advantages of the present invention will become apparent and comprehensible from the description of the embodiments in conjunction with the following drawings, wherein:

FIG. 1 is a flowchart of a resource pattern-based multi-user uplink access method according to an embodiment of the present invention;

Fig. 2 is a schematic diagram of symbol loading based on resource patterns according to an embodiment of the present invention.

Detailed ways

Embodiments of the present invention are described in detail below, examples of which are shown in the drawings, wherein the same or similar reference numerals designate the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the figures are exemplary only for explaining the present invention and should not be construed as limiting the present invention.

In describing the present invention, it should be understood that the terms "center", "longitudinal", "transverse", "upper", "lower", "front", "rear", "left", "right", " The orientations or positional relationships indicated by "vertical", "horizontal", "top", "bottom", "inner" and "outer" are based on the orientations or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and Simplified descriptions, rather than indicating or implying that the device or element referred to must have a particular orientation, be constructed and operate in a particular orientation, and thus should not be construed as limiting the invention. In addition, the terms "first" and "second" are used for descriptive purposes only, and should not be understood as indicating or implying relative importance.

In the description of the present invention, it should be noted that unless otherwise specified and limited, the terms "installation", "connection" and "connection" should be understood in a broad sense, for example, it can be a fixed connection or a detachable connection. Connected, or integrally connected; it may be mechanically connected or electrically connected; it may be directly connected or indirectly connected through an intermediary, and it may be the internal communication of two components. Those of ordinary skill in the art can understand the specific meanings of the above terms in the present invention in specific situations.

These and other aspects of embodiments of the invention will become apparent with reference to the following description and drawings. In these descriptions and drawings, some specific implementations of the embodiments of the present invention are specifically disclosed to represent some ways of implementing the principles of the embodiments of the present invention, but it should be understood that the scope of the embodiments of the present invention is not limited by this limit. On the contrary, the embodiments of the present invention include all changes, modifications and equivalents coming within the spirit and scope of the appended claims.

The resource pattern-based multi-user uplink access method according to the embodiment of the present invention will be described below with reference to the accompanying drawings.

Please refer to Figure 1, a multi-user uplink access method based on resource patterns, including the following steps:

S1: Carry out orthogonal partitioning on the bandwidth resources of the uplink multiple access channel to obtain resource blocks composed of resource elements, and combine B resource blocks together to obtain a basic scheduling unit. Divide the basic scheduling unit into N resource vectors, denoted as V ₁ , V ₂ , ..., V _N , where the number of resource particles in each resource vector is S ₁ , S ₂ , . .., S _N , that is, the number of resource particles in the resource vector V _i is S _i , i∈[1,N].

In one embodiment of the present invention, in step S1, when dividing resource vectors, each resource vector is composed of resource elements with similar fading conditions.

In an embodiment of the present invention, resource elements with similar fading conditions are resource elements carried by adjacent time, adjacent subcarriers, or adjacent antennas whose correlation coefficient is higher than a preset value.

S2: For each resource vector V _i , select K resource patterns to form a resource pattern group P _i,1 ,P _i,2 ,...,P _i,K , where resource pattern P _i,j is a set {1 ,2,...,S _i } subset, i∈[1,N], j∈[1,K], the number of elements in P _i,j is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ).

In one embodiment of the present invention, the process of determining the number K of resource patterns described in step S2 and the resource pattern group selected by the user in step S3 includes the following steps:

For the scheduling access scenario, it is assumed that there are M access users,

S2a: Set the number K of resource patterns described in step S2 as the number of users M;

S3a: Each user selects a resource pattern group from the preferred resource pattern groups described in step S2 in a one-to-one correspondence.

For the random access scenario, it is assumed that there are M access users,

S2b: Set the number K of resource patterns described in step S2 as K', where K' may be equal to M or may not be equal to M;

S3b: each user randomly selects a resource pattern group from the preferred resource pattern groups described in step S2.

S3: Each user of the uplink access selects one of the resource pattern groups, and according to the selected resource pattern group, uses the corresponding resource pattern and the preset coding and modulation mode to send data on each resource vector, Wherein, the preset coding and modulation modes include channel coding, bit interleaving, constellation mapping, and the like.

In one embodiment of the present invention, the process of the uplink access user in step S3 using the corresponding resource pattern and the preset coding and modulation mode to send data on each resource vector includes the following steps:

S31: The uplink access user performs channel coding on the information bits to be transmitted according to the preset coding and modulation mode to obtain coded bits;

S32: The uplink access user performs bit interleaving on the encoded bits according to a preset encoding and modulation mode to obtain interleaved bits; and

S33: Uplink access users sequentially map the interleaved bits to resource vectors V ₁ , V ₂ , ..., V _N according to the preset coding and modulation mode and the selected resource pattern group.

In one embodiment of the present invention, step S33 further includes the following steps:

S331: The user maps corresponding interleaved bits to L _i,j symbols according to a preset coding and modulation mode.

S332: The user sequentially loads L _i,j symbols into the resource vector V _i according to the resource pattern P _i,j . That is, select v=1,2,...,S _i sequentially, and if v belongs to P _i,j , perform symbol loading on the vth resource element of V _i .

In order for those skilled in the art to further understand the present invention, the following examples will be used for detailed description.

Embodiment one

This embodiment describes a process of determining the number K of resource patterns in step S2 and selecting a resource pattern by the user in step S3 in a scheduling access scenario in combination with specific parameters. Assume that after step S1, channel resources are divided into N=8 resource vectors, and the number of resource elements in each resource vector is 6, that is, S ₁ =S ₂ =...=S ₈ =6.

Case 1: Assume that there are 2 uplink access users to transmit data. At this point, the process of determining the number K of resource patterns in step S2 and the resource pattern group selected by the user in step S3 includes the following steps:

S2a: Set the number K of the resource patterns in step S2 as the number of users 2. Then step S2 is adjusted accordingly: for each resource vector V _i , preferably K resource patterns, P _i,1 , P _i,2 , . . . , P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,S _i }, 1<=i<=N, 1<=j<=K, the number of elements in P _i,j The number is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ). For this embodiment, P ₁ =(P _1,1 ,P _2,1 ,...,P _8,1 ), P ₂ =(P _1,2 ,P _2,2 ,...,P _{8, 2} ). Where P _i,j ={1,2,3,4,5,6}, 1<=i<=8, 1<=j<=2.

S3a: Each user selects a resource pattern group from the preferred resource pattern groups described in step S2 in a one-to-one correspondence.

Case 2: Suppose there are 3 users to transmit data. At this time, the process of determining the number K of resource patterns described in step S2 and the resource pattern group selected by the user in step S3 includes the following steps:

S2a: Set the number K of the resource patterns in step S2 as the number of users to be 3. Then step S2 is adjusted accordingly: for each resource vector V _i , preferably K resource patterns, P _i,1 , P _i,2 , . . . , P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,S _i }, 1<=i<=N, 1<=j<=K, the number of elements in P _i,j The number is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ). For this embodiment, P ₁ =(P _1,1 ,P _2,1 ,...,P _8,1 ), P ₂ =(P _1,2 ,P ₂₂ ,...,P _8,2 ) , P ₃ =(P _1,3 ,P _2,3 ,...,P _8,3 ). Wherein, P _i,1 ={1,2,3,4}, 1<=i<=8; P _i,2 ={1,2,5,6}, 1<=i<=8; P _{i ,3} ={3,4,5,6}, 1<=i<=8.

S3a: Each user selects a resource pattern group from the preferred resource pattern groups described in step S2 in a one-to-one correspondence.

Case 3: Suppose there are 4 users to transmit data. At this time, the process of determining the number K of resource patterns described in step S2 and the resource pattern group selected by the user in step S3 includes the following steps:

S2a: Set the number K of the resource patterns in step S2 as the number of users to be 3. Then step S2 is adjusted accordingly: for each resource vector V _i , preferably K resource patterns, P _i,1 , P _i,2 , . . . , P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,S _i }, 1<=i<=N, 1<=j<=K, the number of elements in P _i,j The number is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ). For this embodiment, P ₁ =(P _1,1 ,P _2,1 ,...,P _8,1 ), P ₂ =(P _1,2 ,P _2,2 ,...,P _{8, 2} ), . . . , P ₄ =(P _1,4 , P _2,4 , . . . , P _8,4 ). Among them, P _i,1 ={1,2,3}, 1<=i<=8; P _i,2 ={1,4,5}, 1<=i<=8; P _i,3 ={ 2,4,6}, 1<=i<=8; P _i,4 ={3,5,6}, 1<=i<=8.

S3a: Each user selects a resource pattern group from the preferred resource pattern groups described in step S2 in a one-to-one correspondence.

Case 4: Suppose there are 6 users to transmit data. At this time, the process of determining the number K of resource patterns described in step S2 and the resource pattern group selected by the user in step S3 includes the following steps:

S2a: Set the number K of the resource patterns in step S2 as the number of users to be 3. Then step S2 is adjusted accordingly: for each resource vector V _i , preferably K resource patterns, P _i,1 , P _i,2 , . . . , P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,S _i }, 1<=i<=N, 1<=j<=K, the number of elements in P _i,j The number is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ). For this embodiment, P ₁ =(P _1,1 ,P _2,1 ,...,P _8,1 ), P ₂ =(P _1,2 ,P _2,2 ,...,P _{8, 2} ), . . . , P ₆ =(P _1,6 , P _2,6 , . . . , P _8,6 ). Wherein, P _i,1 ={1,2}, 1<=i<=8; P _i,2 ={2,3}, 1<=i<=8; P _i,3 ={3,4} , 1<=i<=8; P _i,4 ={4,5}, 1<=i<=8; P _i,5 ={5,6}, 1<=i<=8; P _{i, 6} ={6,1}, 1<=i<=8.

S3a: Each user selects a resource pattern group from the preferred resource pattern groups described in step S2 in a one-to-one correspondence.

Embodiment two

This embodiment describes a process of the number K of resource patterns in step S2 and the resource pattern group selected by the user in step S3 in a random access scenario in combination with specific parameters. Assume that after step S1, channel resources are divided into N=8 resource vectors, and the number of resource elements in each resource vector is 6, that is, S ₁ =S ₂ =...=S ₈ =6.

Case 1: Suppose there are 10 users to transmit data. At this time, the process of determining the number K of resource patterns described in step S2 and the resource pattern group selected by the user in step S3 includes the following steps:

S2b: Set the number K of resource patterns in step S2 to 2. Then step S2 is adjusted accordingly: for each resource vector V _i , preferably K resource patterns, P _i,1 , P _i,2 , . . . , P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,Si}, 1<=i<=N, 1<=j<=K, the number of elements in P _i,j is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ). For this embodiment, P ₁ =(P _1,1 ,P _2,1 ,...,P _8,1 ), P ₂ =(P _1,2 ,P _2,2 ,...,P _{8, 2} ). Wherein, P _i,j ={1,2,3,4,5,6}, 1<=i<=8, 1<=j<=2.

S3b: each user randomly selects a resource pattern group from the preferred resource pattern groups described in step S2.

Case 2: Suppose there are 15 users to transmit data. At this time, the process of determining the number K of resource patterns described in step S2 and the resource pattern group selected by the user in step S3 includes the following steps:

S2b: Set the number K of the resource patterns in step S2 to 3. Then step S2 is adjusted accordingly: for each resource vector V _i , preferably K resource patterns, P _i,1 , P _i,2 , . . . , P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,S _i }, 1<=i<=N, 1<=j<=K, the number of elements in P _i,j The number is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ). For this embodiment, P ₁ =(P _1,1 ,P _2,1 ,...,P _8,1 ), P ₂ =(P _1,2 ,P _2,2 ,...,P _{8, 2} ), P ₃ =(P _1,3 ,P _2,3 ,...,P _8,3 ). Wherein, P _i,1 ={1,2,3,4}, 1<=i<=8; P _i,2 ={1,2,5,6}, 1<=i<=8; P _{i ,3} ={3,4,5,6}, 1<=i<=8.

S3b: each user randomly selects a resource pattern group from the preferred resource pattern groups described in step S2.

Embodiment three

This embodiment describes the process of mapping the corresponding interleaved bits to the resource vector V _i according to the preset coding and modulation mode and the selected resource pattern group described in step S33 in the general embodiment in conjunction with specific parameters. Without loss of generality, the specific parameters are that the number of resource particles in the resource vector V _i is S _i =6, the resource pattern P _i,j ={3,5}, L _i,j =2, and are mapped to the resource vector V _i The corresponding number of interleaving bits on is m=m ₁ +m ₂ . Specifically, it includes the following two steps:

Step 1: The user maps the corresponding m interleaved bits into L _i,j =2 symbols x ₁ and x ₂ according to the preset encoding and modulation mode. Wherein, the mapping according to the preset coding and modulation mode includes but not limited to the following three ways, one of which can be selected:

A. Map m ₁ bits in the corresponding m interleaving bits to symbol x ₁ in the preset 2 ^m1 order set, and map the other m ₂ bits to symbol x ₂ in the preset 2 ^m2 order set, A total of two symbols x ₁ and x ₂ are obtained.

B. Map the corresponding m interleaving bits to a symbol x in the preset 2 ^m -order set, and then spread x to obtain two symbols x ₁ =f(x), x ₂ =g(x).

C. Map the corresponding m interleaving bits to L _i,j =2-dimensional symbol vector (x ₁ , x ₂ ) in the preset 2 ^m -order set, and the two dimensions of the vector are the two obtained symbols x ₁ and x respectively ₂ . Load user symbols x ₁

Step 2: The user loads the two symbols x ₁ and x ₂ obtained in step 1 to the resource vector V _i in sequence according to the resource pattern P _i,j ={3,5}. That is, v=1, 2,...,6 are selected in sequence, and if v belongs to P _i,j , symbol loading is performed on the vth resource element of V _i . The loading results in this embodiment are shown in Figure 2.

Embodiment Four

This embodiment describes a multi-user uplink access method based on resource patterns in combination with specific parameters. Assuming that the uplink multiple access is based on the uplink of the LTE system, taking a single cell as an example, assuming that the channel resources available for uplink access are 6 PRBs (one PRB includes 12 subcarriers of 6 consecutive OFDM symbols), that is, 432 OFDM subcarrier symbols. The multi-user uplink access method described in this embodiment includes the following steps:

S1: Carry out orthogonal partitioning on the bandwidth resources of the uplink multiple access channel to obtain resource blocks composed of resource elements, and combine B resource blocks together to obtain a basic scheduling unit. The basic scheduling unit is divided into N resource vectors, denoted as V ₁ , V ₂ , . . . , V _N . Wherein, the numbers of resource particles in each resource vector are respectively S ₁ , S ₂ , . . . , S _N . That is, the number of resource particles in the resource vector Vi is S _i , where 1<=i<=N. For this embodiment, a resource element is a single OFDM subcarrier symbol, a resource block is a PRB, and B=6. Combine 6 PRBs together to obtain a basic transmission unit. The basic transmission unit is divided into 72 resource vectors, and the number of resource elements in each resource vector is 6.

S2: For each resource vector V _i , preferably K resource patterns, P _i,1 , P _i,2 ,...,P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,6}, 1<=i<=72, 1<=j<=K, the number of elements in P _i,j is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ).

S3: Each user of uplink access selects one of the K resource pattern groups mentioned in step S2, and uses the corresponding resource pattern and preset coding modulation on each resource vector according to the selected resource pattern group mode to send data. Wherein, the preset coding and modulation modes in step S3 include channel coding, bit interleaving, constellation mapping, and the like.

The process of the number K of resource patterns described in step S2 and the resource pattern group selected by the user in step S3 includes the following steps:

For the scheduling access scenario, it is assumed that there are 3 accessing users:

S2a: Set the number K of the resource patterns in step S2 as the number of users to be 3. Then step S2 is adjusted accordingly: for each resource vector V _i , preferably K resource patterns, P _i,1 , P _i,2 , . . . , P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,S _i }, 1<=i<=72, 1<=j<=K, the number of elements in P _i,j The number is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ), P ₂ =(P ₁₂ ,P _2,2 ,...,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ). For this embodiment, P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ), P ₂ =(P _1,2 ,P _2,2 ,...,P _{N, 2} ), P ₃ =(P _1,3 ,P _2,3 ,...,P _N,3 ). Wherein, P _i,1 ={1,2,3,4}, 1<=i<=72; P _i,2 ={1,2,5,6}, 1<=i<=72; P _{i ,3} ={3,4,5,6}, 1<=i<=72.

S3a: Each user selects a resource pattern group from the preferred resource pattern groups described in step S2 in a one-to-one correspondence.

For the random access scenario, assume that there are 15 accessing users:

S2b: Set the number K of the resource patterns in step S2 to 3. Then step S2 is correspondingly adjusted as: for each resource vector V _i , preferably K resource patterns, P _i,1 , P _i2 , . . . , P _i,K . Among them, the resource pattern P _i,j is a subset of the set {1,2,...,S _i }, 1<=i<=N, 1<=j<=K, the number of elements in P _i,j The number is L _i,j . Thus, K groups of optimal resource pattern groups P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ),P ₂ =(P _1,2 ,P _2,2 ,... ,P _N,2 ),...,P _K =(P _1,K ,P _2,K ,...,P _N,K ). For this embodiment, P ₁ =(P _1,1 ,P _2,1 ,...,P _N,1 ), P ₂ =(P _1,2 ,P _2,2 ,...,P _{N, 2} ), P ₃ =(P _1,3 ,P _2,3 ,...,P _N,3 ). Among them, P _i1 ={1,2,3,4}, 1<=i<=8; P _i2 ={1,2,5,6}, 1<=i<=8; P _i3 ={3, 4,5,6}, 1<=i<=8.

S3b: each user randomly selects a resource pattern group from the preferred resource pattern groups described in step S2.

In step S3, it is assumed that the user selects the resource pattern group P _j . The process for an uplink access user to use a corresponding resource pattern and a preset coding and modulation mode to send data on each resource vector includes the following steps:

S31: The user performs channel coding on the information bits to be transmitted according to a preset coding and modulation mode to obtain coded bits.

S32: The user performs bit interleaving on the encoded bits according to a preset encoding and modulation mode to obtain interleaved bits.

S33: The user sequentially maps the interleaved bits to resource vectors V ₁ , V ₂ , ..., V ₇₂ according to the preset coding and modulation mode and the selected resource pattern group. Wherein, in step S33, the user maps the corresponding interleaved bits to the resource vector V _i according to the preset coding and modulation mode and the selected resource pattern group, including the following steps:

S331: The user maps the corresponding interleaved bits into L _i,j symbols according to a preset coding modulation mode.

S332: The user sequentially loads L _i,j symbols into the resource vector V _i according to the resource pattern P _i,j . That is, select v=1,2,...,S _i sequentially, and if v belongs to P _i,j , perform symbol loading on the vth resource element of V _i .

In addition, other configurations and functions of the resource pattern-based multi-user uplink access method in the embodiment of the present invention are known to those skilled in the art, and will not be repeated in order to reduce redundancy.

In the description of this specification, descriptions with reference to the terms "one embodiment", "some embodiments", "example", "specific examples", or "some examples" mean that specific features described in connection with the embodiment or example , structure, material or characteristic is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.

Although the embodiments of the present invention have been shown and described, those skilled in the art can understand that various changes, modifications, substitutions and modifications can be made to these embodiments without departing from the principle and spirit of the present invention. The scope of the invention is defined by the claims and their equivalents.

Claims (6)

1. A multi-user uplink access method based on resource patterns, characterized in that, comprising the following steps: S1: Carry out orthogonal partitioning on the bandwidth resources of the uplink multiple access channel to obtain resource blocks composed of resource elements, and combine B resource blocks together to obtain a basic scheduling unit; divide the basic scheduling unit into N resource vectors, denoted as V ₁ , V ₂ , ..., V _N , where the number of resource particles in each resource vector is S ₁ , S ₂ , ..., S _N ; S2: For each resource vector V _i , select K resource patterns to form a resource pattern group P _i,1 ,P _i,2 ,...,P _i,K , where resource pattern P _i,j is a set {1 ,2,...,S _i }, where i∈[1,N], j∈[1,K], the number of elements in P _i,j is L _i,j ; and S3: Each user of uplink access selects one of the resource pattern groups, and according to the selected resource pattern group, uses the corresponding resource pattern and the preset coding and modulation mode to send data on each resource vector. 2. The resource pattern-based multi-user uplink access method according to claim 1, characterized in that, in step S1, when dividing resource vectors, each resource vector is composed of resource elements with similar fading conditions. 3. The multi-user uplink access method based on resource patterns according to claim 1, wherein the process of determining the number K of resource patterns in step S2 and the resource pattern group selected by the user in step S3 includes The following steps: For the scheduling access scenario, it is assumed that there are M access users, S2a: Set the number K of resource patterns described in step S2 as the number of users M; S3a: Each user selects a resource pattern group from the resource pattern group described in step S2 in one-to-one correspondence; For the random access scenario, it is assumed that there are M access users, S2b: Set the number K of resource patterns described in step S2 as K'; S3b: Each user randomly selects a resource pattern group from the resource pattern groups described in step S2. 4. The multi-user uplink access method based on resource patterns according to claim 1, wherein the uplink access users in step S3 use corresponding resource patterns and preset codes on each resource vector The process of sending data in modulation mode includes the following steps: S31: The uplink access user performs channel coding on the information bits to be transmitted according to a preset coding and modulation mode to obtain coded bits; S32: The uplink access user performs bit interleaving on the encoded bits according to a preset encoding and modulation mode to obtain interleaved bits; and S33: The uplink access user sequentially maps the interleaved bits to resource vectors V ₁ , V ₂ , ..., V _N according to the preset coding and modulation mode and the selected resource pattern group. 5. The resource pattern-based multi-user uplink access method according to claim 4, characterized in that step S33 further comprises: S331: The uplink access user maps the corresponding interleaved bits to L _i,j symbols according to the preset coding and modulation mode; and S332: The uplink access user sequentially loads L _i,j symbols into the resource vector V _i according to the resource pattern P _i,j . 6. The resource pattern-based multi-user uplink access method according to claim 2, wherein the resource elements with similar fading conditions are adjacent time, adjacent subcarriers, or those with a correlation coefficient higher than a preset value Resource elements carried by adjacent antennas.