Information transmission method and device, base station and storage medium
A technology of information transmission and transmission blocks, which is applied in the field of information transmission methods, base stations and storage media, and devices, and can solve the problems of increased information transmission delay and achieve the effect of reducing transmission delay
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0095] Example 1: Indicates that the combination number index is And satisfy M=3, s 0 1 ≤s 2 ,1≤s i ≤N, is the number of downlink resource units, where is the extended binomial coefficient, and The total number of states is Need to indicate that the overhead is bit. It should be noted, It is only the total number of resources represented when the downlink uses PRB as the granularity, but the embodiments of the present invention are not limited thereto, and are also applicable to other resource granularities. For example, when the granularity of PRB is used for uplink, the total number of resources is expressed as For another example, when using CCE as the granularity, the total number of resources is N CCE . In this embodiment, x, y, n, k, etc. are just code names, which can be replaced arbitrarily, and the emphasis is on clarifying the operations therein.
example 2
[0096] Example 2: Indicates that the combination number index is And satisfy M=3, s 0 1 ≤s 2 ,0≤s i ≤N, in is the extended binomial coefficient, and The total number of states is Need to indicate that the overhead is bit.
example 3
[0097] Example 3: Indicates that the combination number index is And satisfy M=3, s' 1 2 ≤s' 3 ,1≤s′ i ≤N′, N'=N+1,s i =s i '-1, where is the extended binomial coefficient, and The total number of states is Need to indicate that the overhead is bit.
[0098] After the receiving side receives the combination number index, for example 1 and example 2, the receiving side engraves the inverse solution s according to r i (The same reasoning is also applicable to the receiving side in Example 3 and reversely solves s according to r i ' and then get s i ), taking M=3 as an example: first select the The value of n corresponding to the maximum number of combinations in is used as the decoding s 0 The value of the number of combinations, that is, at this time s 0 =N-n 0 , and calculate the difference Next, choose to satisfy The value of n corresponding to the maximum number of combinations is used as the decoding s 1 The value of the number of combinations...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


