PATENT CLAIM ANALYSIS

Application Number: 15928496
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-08
Patent Classification: ["370", "329000"]

Abstract:
Embodiments of the present application provide a random access sequence generation method, and an apparatus. The method includes: generating, by a base station, notification signaling, where the notification signaling includes indication information, the indication information is used to instruct user equipment UE to select a shift sequence number from a range of 0 to ( n shift RA  n group RA + n _ shift RA + n = shift RA + n ≡ shift RA - 1 ) , the shift sequence number is an integer, n shift RA  is a quantity of UE candidate sequence shifts in a group, n group RA  is a quantity of groups,  n shift RA  is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group,  n shift RA  is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and   is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and sending, by the base station, the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

Claim (Index 4):
The method according to  claim 1 , wherein a range of the shift sequence number v is from 0 to ( n shift RA \ue89e n group RA + n _ shift RA + n = shift RA + n \u2261 shift RA - 1 ) , wherein\n for n shift RA  and d start  satisfy formulas (4) and (5), n group RA ,  n shift RA ,  n shift RA , and   satisfy formulas (6) to (8) and (10); or \n for n shift RA  and d start  satisfy formulas (12) and (13), n group RA ,  n shift RA ,  n shift RA , and   satisfy formulas (14) to (16) and (18); or \n for n shift RA  and d start  satisfy formulas (20) and (21), n group RA ,  n shift RA ,  n shift RA , and   satisfy formulas (22) to (24) and (26); or \n for n shift RA  and d start  satisfy formulas (28) and (29), n group RA ,  n shift RA ,  n shift RA , and   satisfy formulas (30) to (32) and (34); \n wherein \n \ue89e n group RA = \u230a d u d start \u230b ; ( 6 ) \ue89e n _ shift RA = max \ue8a0 ( \u230a N ZC - 3 \ue89e \ue89e d u - n group RA \u00b7 d start N cs \u230b , 0 ) ; ( 7 ) \ue89e n _ _ shift RA = \u230a min \ue8a0 ( d u - n group RA \u00b7 d start , 4 \ue89e \ue89e d u - N ZC - n _ shift RA \ue89e N CS ) / N CS \u230b ; ( 8 ) n _ _ _ shift RA = \u230a ( ( 1 - min \ue8a0 ( 1 , n _ shift RA ) ) \ue89e ( d u - n group RA \u00b7 d start ) + min \ue8a0 ( 1 , n _ shift RA ) \ue89e ( 4 \ue89e \ue89e d u - N ZC - n _ shift RA \ue89e N CS ) ) / N CS \u230b - n _ _ _ shift RA ; ( 10 ) \ue89e n group RA = \u230a d u d start \u230b ; ( 14 ) \ue89e n _ shift RA = max \ue8a0 ( \u230a 4 \ue89e \ue89e d u - N ZC - n group RA \u00b7 d start N CS \u230b , 0 ) ; ( 15 ) \ue89e n _ _ shift RA = \u230a min \ue8a0 ( d u - n group RA \u00b7 d start , N ZC - 3 \ue89e \ue89e d u - n _ shift RA \ue89e N CS ) / N CS \u230b ; ( 16 ) \ue89e n _ _ _ shift RA = 0 ; ( 18 ) \ue89e n group RA = \u230a d u d start \u230b ; ( 22 ) \ue89e n _ shift RA = max \ue8a0 ( \u230a N ZC - 2 \ue89e \ue89e d u - n group RA \u00b7 d start N cs \u230b , 0 ) ; ( 23 ) \ue89e n _ _ shift RA = 0 ; ( 24 ) \ue89e n _ _ _ shift RA = 0 ; ( 26 ) \ue89e n group RA = \u230a N ZC - d u d start \u230b ; ( 30 ) \ue89e n _ shift RA = max \ue8a0 ( \u230a 3 \ue89e \ue89e d u - N ZC - n group RA \u00b7 d start N CS \u230b , 0 ) ; ( 31 ) \ue89e n _ _ shift RA = 0 ; ( 32 ) \ue89e n _ _ _ shift RA = 0. ( 34 )

Metadata:
- Claim Count in Document: 50.0
- Percentile: 90.0
- Lexical Diversity: 2.79452
- Patent Class: 370.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15367545', '14865952', '11969834', '13791730', '14600615']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6266387917722915
- 35 USC 102 Novelty (BERT): 0.5667813775180014
- Combined Prediction Score: 0.6206530503468626
- Mean Citation Score: 359.625638
- Max Citation Score: 501.1253400000001
- Similarity Product: 351.5244607247973

Labels:
- Claim Label 101: 0
- Claim Label 102: 0
- Claim Label 103: 0
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test