Method for calculating index of resource block pair of 4G network physical layer EPDCCH (Enhanced Physical Downlink Control Channel) channel

Abstract

The invention discloses a 4G network physical layer EPDCCH channel resource block pair index calculation method, and belongs to the technical field of information. The method comprises the following steps: firstly, based on monotonicity of binomial coefficients, dividing a complete set of combination numbers related to the number of resource blocks into 2, 4 or 8 parts according to the number of resource block pairs and a combination index value transmitted by a high layer; then, according to the combination number range of each part, the part where each combination number meeting the combination index value is located is screened; and finally, selecting 1, 3 or 7 possible combination numbers in one or more parts based on the part where the screened combination numbers are located, and finding the last combination number in the last part by using a binary search method, thereby obtaining 2, 4 or 8 resource block pair indexes. The calculation method provided by the invention is more efficient and faster, the calculation efficiency can be improved, and the calculation time and resource consumption can be reduced.

Description

Technical Field

[0001] The present invention belongs to the field of information technology, and in particular relates to a method for calculating an index of an EPDCCH channel resource block pair in a physical layer of a 4G network. Background Art

[0002] In the physical layer of the 4G network, EPDCCH (Enhanced Physical Downlink Control Channel) is introduced to achieve frequency domain scheduling and interference coordination that can be used for control signaling, as well as DMRS-based reception for control signals. Unlike PDCCH, which is transmitted in the control area and occupies the entire system bandwidth, EPDCCH is transmitted in the data area and usually only occupies a small part of the total bandwidth. Each terminal using EPDCCH is configured with one or two groups of resource blocks, each group consisting of 2, 4 or 8 resource block pairs, so obtaining the resource block pair index is an important step in decoding EPDCCH. In order to reduce the amount and complexity of terminal calculations, it is necessary to design a fast and efficient method for calculating the EPDCCH resource block pair index.

[0003] The traditional method of calculating the EPDCCH resource block pair index uses a loop traversal method. According to the number of resource block pairs, 2, 4 or 8 values ​​are found in the full set of possible combination numbers, so that the sum of these combination numbers is equal to the combination index value passed to the physical layer by the high-level protocol, thereby obtaining the resource block pair index.

[0004] The time complexity of this method is the 2, 4 or 8th power of the number of resource block pairs, which consumes more terminal computing resources and takes more data processing time. Taking the following example of 20MHz bandwidth, 100 resource blocks and 8 resource block pairs, the full set of indexes for each resource block pair is in More than 1.8×10 11 According to the 3GPP protocol, each resource block has the following possible values: 8 resource blocks have a total of about (800) 8 =6.4×10 17 This requires a huge amount of calculation for the communication terminal and cannot be completed within milliseconds.

[0005] The existing technical solutions do not take into account the limited computing power and computing resources of actual communication equipment. If this method is used, the terminal will not be able to find a suitable PRB (Physical Resource Block) pair index within the time required by the communication system. On the other hand, according to the 3GPP protocol requirements, the PRB pair index shows a monotonically increasing trend with the PRB pair number value, but the traditional method does not take this requirement into account and cannot ensure that the index value of the PRB pair with a larger number is greater than the index value of the PRB pair with a smaller number.

[0006] In summary, the current MU-MIMO space-time data stream allocation and update scheme has the following shortcomings:

[0007] 1. In the process of calculating the index values ​​of different numbers of PRB pairs, the amount of calculation is huge, which not only consumes a huge amount of computing resources but also has low efficiency.

[0008] 2. Due to the limited computing resource capabilities of the actual communication system terminal equipment, this method cannot be used in a large actual communication system, which seriously limits the scope of application of this method.

[0009] 3. The requirement in the 3GPP protocol that the PRB index value increases monotonically with its number value is not taken into account, and it cannot be guaranteed that the calculation result meets the 3GPP protocol requirements. Summary of the invention

[0010] In view of the above-mentioned technical problems existing in the prior art, the present invention proposes a method for calculating the index of the EPDCCH channel resource block pair of the physical layer of the 4G network, which has a reasonable design, overcomes the shortcomings of the prior art, and has good effects.

[0011] In order to achieve the above object, the present invention adopts the following technical solution:

[0012] A method for calculating the index of EPDCCH channel resource block pairs in the physical layer of a 4G network, wherein the combined index value transmitted by a high layer is r, the number of downlink resource blocks is N, the number and serial number of EPDCCH resource block pairs are X and i respectively, and the EPDCCH resource block pair index is k i ,i=0,…,X-1,1≤k i ≤N, and k i <k i+1 ; According to the 3GPP protocol, the resource block pair index increases monotonically, that is, the next resource block pair index is greater than the previous resource block pair index; at the same time, the three parameters of the number of downlink resource blocks, the number of resource block pairs, and the resource block pair index satisfy the combined index value r According to i and k i The value range of X-

[0013] i≤X,0≤Nk i ≤N-1, k i +1≤k i+1 ;

[0014] According to the properties and monotonicity of the extended binomial coefficient, when i changes from 0 to X-1, X non-increasing sequences are formed, and there is no identical value in the monotonically decreasing partial sequence of these X non-increasing sequences;

[0015] The specific steps include:

[0016] Step 1: Based on the monotonicity of the binomial coefficient, according to the number of resource block pairs and the combination index value transmitted by the higher layer, the whole set of combination numbers related to the number of resource blocks is divided into 2, 4 or 8 parts according to the combination number;

[0017] Step 2: According to the range of the number of combinations of each part, filter the parts where the numbers of combinations that meet the combination index value are located;

[0018] Step 3: Based on the parts where the screened combination numbers are located, select 1, 3 or 7 possible combination numbers in one or more of the parts, and use the binary search method to find the last combination number in the last part, so as to obtain 2, 4 or 8 resource block pair indexes.

[0019] Preferably, the index value calculation method when the number of resource block pairs is 2 is as follows:

[0020] Construct two non-increasing sequences; the first sequence contains a monotonically decreasing sequence, 1 1 and 2 0s, and the second sequence contains a monotonically decreasing sequence, 1 1 and 1 0; when the combined index value r is not greater than 2, find 0 or 1 from the two sequences respectively, that is, obtain the index of the resource block pair that meets the conditions; when the combined index value r>2, use r / 2 as the boundary to calculate the number of possible index values ​​in the two sequences respectively; for the sequence containing fewer possible index values, traverse the index values ​​in turn, and use the binary search method for each index value in the other sequence until an index value that meets the conditions is found.

[0021] Preferably, the index value calculation method when the number of resource block pairs is 4 is as follows:

[0022] Construct 4 non-increasing sequences, corresponding to i=0, 1, 2, 3 respectively; in the i-th sequence, is a monotonically decreasing sequence, When the combined index value r≤4, find 0 or 1 from the four sequences respectively, that is, obtain the index of the resource block pair that meets the conditions; when the combined index value r>4, find four coefficients in sequences 0 to 3 respectively that make the extended binomial coefficient greater than r / 4, less than r / 2, less than r / 3, less than r / 4 and whose sum is the combined index value; traverse the index values ​​of sequences 1 to 3 respectively, and for each index value combination, use the binary search method in sequence 0 until the index value that meets the conditions is found.

[0023] Preferably, the index value calculation method when the number of resource block pairs is 8 is as follows:

[0024] Construct 8 non-increasing sequences, corresponding to i=0, 1, ..., 7; in the i-th sequence, is a monotonically decreasing sequence, When the combined index value r≤8, find 0 or 1 from the 8 sequences respectively, that is, obtain the index of the resource block pair that meets the conditions; when the combined index value r>8, find eight coefficients in sequences 0 to 3 that make the extended binomial coefficient greater than r / 8, less than r / 2, less than r / 3, less than r / 4, less than r / 5, less than r / 6, less than r / 7, less than r / 8 and whose sum is the combined index value; traverse the index values ​​of sequences 1 to 7 respectively, and for each index value combination, use the binary search method in sequence 0 until the index value that meets the conditions is found.

[0025] Beneficial technical effects brought by the present invention:

[0026] 1. The calculation method proposed in the present invention makes full use of the monotonicity of the extended binomial coefficient sequence, divides the value range of the extended binomial coefficient according to the combined index value, narrows the search range of the resource block for the index, and reduces the number of traversals of the extended binomial coefficient.

[0027] 2. The calculation method proposed in the present invention uses a binary search method to search for a resource block index that meets the conditions in one of the extended binomial coefficient sequences.

[0028] 3. The calculation method proposed in the present invention is more efficient and faster, which can not only improve the calculation efficiency, but also reduce the calculation time and resource consumption. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 Flow chart of the method of the present invention. DETAILED DESCRIPTION

[0030] The present invention is further described in detail below with reference to the accompanying drawings and specific embodiments:

[0031] A method for quickly calculating EPDCCH resource block pair indexes, the process is as follows Figure 1 As shown, the following steps are included: first, based on the monotonicity of the binomial coefficient, according to the number of resource block pairs and the combination index value transmitted by the high-level layer, the whole set of combination numbers related to the number of resource blocks is divided into 2, 4 or 8 parts according to the combination number. Then, according to the combination number range of each part, the part where each combination number that meets the combination index value is located is screened. Finally, based on the part where the screened combination number is located, 1, 3 or 7 possible combination numbers are selected from one or more parts, and the last combination number is found in the last part by using the binary search method, so as to obtain 2, 4 or 8 resource block pair indexes.

[0032] Note that the combined index value transmitted by the high layer is r, the number of downlink resource blocks is N, the number of EPDCCH resource block pairs is X, and the EPDCCH resource block pair index is k i ,i=0,…,X-1,1≤k i≤N, and k i <k i+1 According to the 3GPP protocol, the resource block pair index increases monotonically, that is, the next resource block pair index is greater than the previous resource block pair index. At the same time, the three parameters of the number of downlink resource blocks, the number of resource block pairs, and the resource block pair index meet the combined index value.

[0033]

[0034] in is the expanded binomial coefficient. According to i and k i The value range of , we can know that 1≤Xi≤

[0035] X,0≤Nk i ≤N-1, k i +1≤k i+1 .

[0036] According to the properties and monotonicity of the extended binomial coefficient, when i changes from 0 to X-1, X non-increasing sequences can be formed, and the same value does not exist in the monotonically decreasing partial sequence of these X non-increasing sequences.

[0037] 1. Calculation when the number of resource block pairs is 2

[0038] When the number of resource block pairs X is 2, there are 2 non-increasing sequences, corresponding to i=0 and i=1. In the 0th sequence, is a monotonically decreasing sequence, In the first sequence, is a monotonically decreasing sequence,

[0039] When the combined index value r = 0, the resource block pair indexes are k0 = N-1, k1 = N. When r = 1, the resource block pair indexes are k0 = N-2, k1 = N. When r = 2, the resource block pair indexes are k0 = N-2, k1 = N-1.

[0040] When r>2, the resource block pairs in the 0th and 1st sequences whose sum of binomial coefficients is r are indexed as r0 and r1 respectively. According to the properties of binomial coefficients, we know that The indexes of these two resource blocks can be calculated by the following steps:

[0041] 1) Calculate the number of The maximum value k of k0 0,m , in the first sequence The minimum value k of k1 1,m .

[0042] 2) If k 0,m -1 <N-k 1,m , then execute 3); otherwise, execute 10).

[0043] 3) Initialize j0 = 1,

[0044] 4) Determine whether j0 is not greater than k 0,m , if yes, execute 5); otherwise execute 17).

[0045] 5) Initialize j l =k 1,m , j r =N.

[0046] 6) Judge j l Is it not greater than j r , if yes, execute 7); otherwise execute 9).

[0047] 7) Order

[0048] 8) If Then let j r =m0-1, execute 6); otherwise, if Then l =m0+1, execute 6); otherwise, let r0=j0, r1=m0, execute 18).

[0049] 9) Let j0=j0+1, and execute 4).

[0050] 10) Initialize j1 = k 1,m ,

[0051] 11) Determine whether j1 is not greater than N. If so, execute 12); otherwise, execute 17).

[0052] 12) Initialize j s =1,j e =k 0,m .

[0053] 13) Judge j s Is it not greater than j e , if yes, execute 14); otherwise execute 16).

[0054] 14) Order

[0055] 15) If Then let j e =m1-1, execute 13); otherwise, if Then s=m1+1, execute 13); otherwise, let r0=m1, r1=j1, execute 18).

[0056] 16) Let j1=j1+1, and execute 11).

[0057] 17) It is indicated that there is no resource block pair index that meets the conditions.

[0058] 18)End.

[0059] 2. Calculation when the number of resource block pairs is 4

[0060] When the number of resource block pairs X is 4, there are 4 non-increasing sequences, corresponding to i = 0, 1, 2, and 3. In the i-th sequence, is a monotonically decreasing sequence, When the combined index value r≤4, the resource block pair indexes that make the extended binomial coefficient 0 or 1 are found from the 8 sequences respectively, and the resource block pair indexes that meet the conditions can be obtained.

[0061] When r>4, the resource block pairs in the 0th to 3rd sequences whose sum of binomial coefficients is r are indexed as u0 to u3, and these four indexes increase in sequence. According to the properties of binomial coefficients, we know The four resource block pair indexes can be calculated using the following steps:

[0062] 1) Calculate the number of The maximum value of k0 p 0,m , in the first sequence The minimum value p of k1 1,m , in the second sequence The minimum value of k2 p 2,m , in the third sequence

[0063] The minimum value p of k3 3,m .

[0064] 2) Initialize p3 = p 3,m .

[0065] 3) Determine whether p3 is not greater than N. If so, execute 4); otherwise, execute 17).

[0066] 4) Initialize p2 = p 2,m .

[0067] 5) Determine whether p2 is not greater than p3-1. If so, execute 6); otherwise, execute 16).

[0068] 6) Initialize p1 = p1,m .

[0069] 7) Determine whether p1 is not greater than p2-1. If so, execute 8); otherwise, execute 15).

[0070] 8) Initialize p t =p 0,m .

[0071] 9) Determine p t Is it not less than p1? If so, let p t =p1-1.

[0072] 10) Initialize p l =1, p r =p t ,

[0073] 11) Determine p l Is it not greater than p r , if yes, execute 12); otherwise execute 14).

[0074] 12) Order

[0075] 13) If Then let p r =p0-1, execute 11); otherwise, if Then p l =p0+1, execute 11); otherwise let u0=p0, u1=p1, u2=p2, u3=p3, execute 18).

[0076] 14) Let p1=p1+1, and execute 7).

[0077] 15) Let p2=p2+1, and execute 5).

[0078] 16) Let p3=p3+1, and execute 3).

[0079] 17) It is indicated that there is no resource block pair index that meets the conditions.

[0080] 18)End.

[0081] 3 Calculation when the number of resource block pairs is 8

[0082] When the number of resource block pairs X is 8, there are 8 non-increasing sequences, corresponding to i=0, 1, ..., 7. In the i-th sequence, is a monotonically decreasing sequence, When the combined index value r≤8, the resource block pair indexes that make the extended binomial coefficient 0 or 1 are found from the 8 sequences respectively, and the resource block pair indexes that meet the conditions can be obtained.

[0083] When r>8, the resource block pairs in the 0th to 7th sequences whose sum of binomial coefficients is r are indexed as v0 to v7, and these eight indexes increase in sequence. According to the properties of binomial coefficients, we know

[0084] The eight resource block pair indices can be calculated using the following steps:

[0085] 1) Calculate the number of The maximum value of k0 is q 0,m , in the first sequence The minimum value q of k1 1,m , in the second sequence The minimum value q of k2 2,m , in the third sequence The minimum value q of k3 3,m , in the fourth sequence The minimum value q of k4 4,m , in the fifth sequence The minimum value q of k5 5,m , in the sixth sequence The minimum value q of k6 6,m , in the 7th sequence The minimum value q of k7 7,m .

[0086] 2) Initialize q7 = q 7,m .

[0087] 3) Determine whether q7 is not greater than N. If so, execute 4); otherwise, execute 29).

[0088] 4) Initialize q6 = q 6,m .

[0089] 5) Determine whether q6 is not greater than q7-1. If so, execute 6); otherwise, execute 28).

[0090] 6) Initialize q5 = q 5,m .

[0091] 7) Determine whether q5 is not greater than q6-1. If so, execute 8); otherwise, execute 27).

[0092] 8) Initialize q4 = q 4,m .

[0093] 9) Determine whether q4 is not greater than q5-1. If so, execute 10); otherwise, execute 26).

[0094] 10) Initialize q3 = q 3,m .

[0095] 11) Determine whether q3 is not greater than q4-1. If so, execute 12); otherwise, execute 25).

[0096] 12) Initialize q2 = q 2,m .

[0097] 13) Determine whether q2 is not greater than q3-1. If so, execute 14); otherwise, execute 24).

[0098] 14) Initialize q1 = q 1,m .

[0099] 15) Determine whether q1 is not greater than q2-1. If so, execute 16); otherwise, execute 23).

[0100] 16) Initialize q t =q 0,m .

[0101] 17) Determine q t Is it not less than q1? If so, let q t =q1-1.

[0102] 18) Initialize q l =1,q r =q t ,

[0103] 19) Determine p l Is it not greater than p r , if yes, execute 20); otherwise, execute 22).

[0104] 20) Order

[0105] 21) If Then let q r =q0-1, execute 19); otherwise, if Then q l =q0+1, execute 19); otherwise, let v j =q j ,j=0,…,7, execute 30).

[0106] 22) Let q1=q1+1, and execute 15).

[0107] 23) Let q2=q2+1, execute 13).

[0108] 24) Let q3=q3+1, and execute 11).

[0109] 25) Let q4=q4+1, and execute 9).

[0110] 26) Let q5=q5+1, and execute 7).

[0111] 27) Let q6=q6+1, and execute 5).

[0112] 28) Let q7=q7+1, and execute 3).

[0113] 29) It is indicated that there is no resource block pair index that meets the conditions.

[0114] 30)End.

[0115] Index value calculation method when the number of key point and protection point 1 resource block pairs is 2

[0116] When the number of resource block pairs is 2, the resource block pair index calculation method proposed in this patent constructs two non-increasing sequences. The first sequence contains a monotonically decreasing sequence, 1 1 and 2 0s, and the second sequence contains a monotonically decreasing sequence, 1 1 and 1 0. When the combined index value is not greater than 2, find 0 or 1 from the two sequences respectively to obtain the resource block pair index that meets the conditions. When the combined index value r>2, use r / 2 as the boundary to calculate the number of possible index values ​​in the two sequences respectively. For sequences with fewer possible index values, traverse the index values ​​one by one, and use binary search for each index value in another sequence until an index value that meets the conditions is found.

[0117] Index value calculation method when the number of key point and protection point 2 resource block pairs is 4

[0118] When the number of resource block pairs is 4, the resource block pair index calculation method proposed in this patent constructs 4 non-increasing sequences, corresponding to i=0, 1, 2, and 3 respectively. In the i-th sequence, is a monotonically decreasing sequence, When the combined index value r≤4, find 0 or 1 from the four sequences to obtain the index of the resource block pair that meets the conditions. When the combined index value r>4, find four coefficients in sequences 0 to 3 that make the extended binomial coefficient greater than r / 4, less than r / 2, less than r / 3, less than r / 4, and the sum is the combined index value. Traverse the index values ​​of sequences 1 to 3 respectively, and for each index value combination, use the binary search method in sequence 0 until an index value that meets the conditions is found.

[0119] Index value calculation method when the number of key point and protection point 3 resource block pairs is 8

[0120] When the number of resource block pairs is 8, the resource block pair index calculation method proposed in this patent constructs 8 non-increasing sequences, corresponding to i=0, 1, ..., 7. In the i-th sequence, is a monotonically decreasing sequence, When the combined index value r≤8, find 0 or 1 from the 8 sequences respectively to obtain the index of the resource block pair that meets the conditions. When the combined index value r>8, find eight coefficients in sequences 0 to 3 that make the extended binomial coefficient greater than r / 8, less than r / 2, less than r / 3, less than r / 4, less than r / 5, less than r / 6, less than r / 7, less than r / 8 and sum to the combined index value. Traverse the index values ​​of sequences 1 to 7 respectively, and for each index value combination, use the binary search method in sequence 0 until an index value that meets the conditions is found.

[0121] Key point and protection point 4: Narrow the range of searching for index values ​​in a non-increasing sequence based on the properties of the extended binomial coefficient

[0122] The PRB pair index calculation method proposed in this patent can narrow the search range of index values ​​when the number of PRB pairs is 2, 4, and 8 based on the properties of the extended binomial coefficient. Specifically, when the number of PRB pairs is 2, the search range of sequences 0 and 1 is narrowed to and When the number of PRB pairs is 4, the search range of sequences 0, 1, 2, and 3 is narrowed to When the number of PRB pairs is 8, the search range of sequences 0, 1, 2, 3, 4, 5, 6, and 7 is narrowed to

[0123]

[0124] Key point and protection point 5 use binary search to find the index value that meets the conditions in the extended binomial coefficient sequence containing the PRB pair index value

[0125] The PRB pair index calculation method proposed in this patent selects the sequence with the most possible index values ​​according to the properties of the extended binomial coefficient, and traverses the possible index values ​​in other sequences in turn, and uses the binary search method to find the PRB pair index that satisfies the combined index value in the sequence with the most possible index values. The use of the binary search method significantly improves the calculation efficiency of the PRB pair index and reduces the amount of calculation and complexity.

[0126] Of course, the above description is not a limitation of the present invention, and the present invention is not limited to the above examples. Changes, modifications, additions or substitutions made by technicians in this technical field within the essential scope of the present invention should also fall within the protection scope of the present invention.

Claims

1. A method for calculating an index of an EPDCCH channel resource block pair in a 4G network physical layer, characterized in that: Note that the combined index value transmitted by the high layer is r, the number of downlink resource blocks is N, the number and number of EPDCCH resource block pairs are X and i respectively, and the EPDCCH resource block pair index is k i ,i=0,…,X-1,1≤k i ≤N, and k i <k i+1 According to the 3GPP protocol, the resource block pair index increases monotonically, that is, the next resource block pair index is greater than the previous resource block pair index; at the same time, the three parameters of the number of downlink resource blocks, the number of resource block pairs, and the resource block pair index satisfy the combined index value r According to i and k i The value range is 1≤Xi≤X,0≤Nk i ≤N-1, k i +1≤k i+1 ; According to the properties and monotonicity of the extended binomial coefficient, when i changes from 0 to X-1, X non-increasing sequences are formed, and there is no identical value in the monotonically decreasing partial sequence of these X non-increasing sequences; The specific steps include: Step 1: Based on the monotonicity of the binomial coefficient, according to the number of resource block pairs and the combination index value transmitted by the higher layer, the whole set of combination numbers related to the number of resource blocks is divided into 2, 4 or 8 parts according to the combination number; Step 2: According to the range of the number of combinations of each part, filter the parts where the numbers of combinations that meet the combination index value are located; Step 3: Based on the parts where the screened combination numbers are located, select 1, 3 or 7 possible combination numbers in one or more of the parts, and use the binary search method to find the last combination number in the last part, so as to obtain 2, 4 or 8 resource block pair indexes.

2. The method for calculating the 4G network physical layer EPDCCH channel resource block pair index according to claim 1, characterized in that: The index value calculation method when the number of resource block pairs is 2 is as follows: Construct two non-increasing sequences; the first sequence contains a monotonically decreasing sequence, 1 1 and 2 0s, and the second sequence contains a monotonically decreasing sequence, 1 1 and 1 0; when the combined index value r is not greater than 2, find 0 or 1 from the two sequences respectively, that is, obtain the index of the resource block pair that meets the conditions; when the combined index value r>2, use r / 2 as the boundary to calculate the number of possible index values ​​in the two sequences respectively; for the sequence containing fewer possible index values, traverse the index values ​​in turn, and use the binary search method for each index value in the other sequence until an index value that meets the conditions is found.

3. The method for calculating the 4G network physical layer EPDCCH channel resource block pair index according to claim 1, characterized in that: The index value calculation method when the number of resource block pairs is 4 is as follows: Construct 4 non-increasing sequences, corresponding to i=0, 1, 2, 3 respectively; in the i-th sequence, is a monotonically decreasing sequence, When the combined index value r≤4, find 0 or 1 from the four sequences respectively, that is, obtain the index of the resource block pair that meets the conditions; when the combined index value r>4, find four coefficients in sequences 0 to 3 respectively that make the extended binomial coefficient greater than r / 4, less than r / 2, less than r / 3, less than r / 4 and whose sum is the combined index value; traverse the index values ​​of sequences 1 to 3 respectively, and for each index value combination, use the binary search method in sequence 0 until the index value that meets the conditions is found.

4. The method for calculating the 4G network physical layer EPDCCH channel resource block pair index according to claim 1, characterized in that: The index value calculation method when the number of resource block pairs is 8 is as follows: Construct 8 non-increasing sequences, corresponding to i=0, 1, ..., 7; in the i-th sequence, is a monotonically decreasing sequence, When the combined index value r≤8, find 0 or 1 from the 8 sequences respectively, that is, obtain the resource block pair index that meets the conditions; when the combined index value r>8, find the sequence 0 to 3 that makes the extended binomial coefficient greater than r / 8, less than r / 2, less than r / 3, less than Eight coefficients that are r / 4, less than r / 5, less than r / 6, less than r / 7, less than r / 8 and whose sum is a combined index value; Traverse the index values ​​of sequence 1 to sequence 7 respectively, and use binary search in sequence 0 for each index value combination until an index value that meets the conditions is found.

Images