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 1):
A method for generating a random access sequence in a communication system, comprising:\n obtaining a cyclic shift value C v  according to a shift sequence number v, wherein\n C v =d offset +d\u2514v/n shift RA \u2518+( v  mod  n shift RA ) N CS \u2003\u2003(1); \n v is an integer, d offset  is a constant integer or d offset  is zero, N CS  is a quantity of cyclic shifts that are occupied by a user, wherein n shift RA  and d start  satisfy formulas (4) and (5), respectively; or n shift RA  and d start  satisfy formulas (12) and (13), respectively; or n shift RA  and d start  satisfy formulas (20) and (21), respectively; or n shift RA  and d start  satisfy formulas (28) and (29), respectively, wherein n shift RA = \u230a 4 \ue89e \ue89e d u - N ZC N CS \u230b , ( 4 ) d start = 4 \ue89e \ue89e d u - N ZC + n shift RA \u00b7 N CS , ( 5 ) n shift RA = \u230a N ZC - 3 \ue89e \ue89e d u N CS \u230b , ( 12 ) d start = N ZC - 3 \ue89e \ue89e d u + n shift RA \u00b7 N CS , ( 13 ) n shift RA = \u230a 3 \ue89e \ue89e d u - N ZC N CS \u230b , ( 20 ) d start = 3 \ue89e \ue89e d u - N ZC + n shift RA \u00b7 N CS , ( 21 ) n shift RA = \u230a N ZC - 2 \ue89e \ue89e d u N CS \u230b , ( 28 ) d start = 2 \ue89e ( N ZC - 2 \ue89e \ue89e d u ) + n shift RA \u00b7 N CS , ( 29 ) wherein N ZC  is a length of the random access sequence, and a root of the random access sequence is u, d u = 1 u , 1 u is a minimum non-negative integer that satisfies ((1/u)\u00d7u)mod N ZC =1; and\n generating the random access sequence according to the cyclic shift value C v .

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5947598371449087
- 35 USC 102 Novelty (BERT): 0.5733840453120428
- Combined Prediction Score: 0.5926222579616222
- Mean Citation Score: 359.625638
- Max Citation Score: 501.1253400000001
- Similarity Product: 396.6170361874794

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