A random access sequence generation method, comprising: selecting a shift sequence number v from a range of 0 to n shift RA n group RA + n ̅ shift RA − 1, wherein v is an integer; and obtaining a cyclic shift value C v according to the shift sequence number v according to the following formula: C ν = d start ⌊ ν / n shift RA ⌋ + ν mod n shift RA N CS wherein n shift RA, d start, n group RA and n ̅ shift RA satisfy formulas to, or n shift RA, d start, n group RA and n ̅ shift RA satisfy formulas to, or n shift RA, d start, n group RA and n ̅ shift RA satisfy formulas to, or n shift RA, d start, n group RA and n ̅ shift RA satisfy formulas to, wherein n shift RA = ⌊ 4 d u − N ZC N CS ⌋ d start = 4 d u − N ZC + n shift RA ⋅ N CS n group RA = ⌊ d u d start ⌋ n ̅ shift RA = max ⌊ N ZC − 3 d u − n group RA ⋅ d start N CS ⌋ 0 n shift RA = ⌊ N ZC − 3 d u N CS ⌋ d start = N ZC − 3 d u + n shift RA ⋅ N CS n group RA = ⌊ d u d start ⌋ n ̅ shift RA = max ⌊ 4 d u − N ZC − n group RA ⋅ d start N CS ⌋ 0 n shift RA = ⌊ 3 d u − N ZC N CS ⌋ d start = 3 d u − N ZC + n shift RA ⋅ N CS n group RA = ⌊ d u d start ⌋ n ̅ shift RA = max ⌊ N ZC − 2 d u − n group RA ⋅ d start N CS ⌋ 0 n shift RA = ⌊ N ZC − 2 d u N CS ⌋ d start = 2 N ZC − 2 d u + n shift RA ⋅ N CS n group RA = ⌊ N ZC − d u d start ⌋ n ̅ shift RA = max ⌊ 3 d u − N ZC − n group RA ⋅ d start N CS ⌋ 0 and wherein N CS is a quantity of cyclic shifts for user equipment, UE, N ZC is a length of the random access sequence and a root of the random access sequence is u, d u = { p 0 ≤ p < N ZC / 2 N ZC − p another value, and p is a minimum non-negative integer that satisfies ( pu) mod N ZC = 1; and generating the random access sequence according to the cyclic shift value C v. selecting a shift sequence number v from a range of 0 to n shift RA n group RA + n ̅ shift RA − 1, wherein v is an integer; and obtaining a cyclic shift value C v according to the shift sequence number v according to the following formula: C ν = d start ⌊ ν / n shift RA ⌋ + ν mod n shift RA N CS wherein n shift RA, d start, n group RA and n ̅ shift RA satisfy formulas to, or n shift RA, d start, n group RA and n ̅ shift RA satisfy formulas to, or n shift RA, d start, n group RA and n ̅ shift RA satisfy formulas to, or n shift RA, d start, n group RA and n ̅ shift RA satisfy formulas to, wherein n shift RA = ⌊ 4 d u − N ZC N CS ⌋ d start = 4 d u − N ZC + n shift RA ⋅ N CS n group RA = ⌊ d u d start ⌋ n ̅ shift RA = max ⌊ N ZC − 3 d u − n group RA ⋅ d start N CS ⌋ 0 n shift RA = ⌊ N ZC − 3 d u N CS ⌋ d start = N ZC − 3 d u + n shift RA ⋅ N CS n group RA = ⌊ d u d start ⌋ n ̅ shift RA = max ⌊ 4 d u − N ZC − n group RA ⋅ d start N CS ⌋ 0 n shift RA = ⌊ 3 d u − N ZC N CS ⌋ d start = 3 d u − N ZC + n shift RA ⋅ N CS n group RA = ⌊ d u d start ⌋ n ̅ shift RA = max ⌊ N ZC − 2 d u − n group RA ⋅ d start N CS ⌋ 0 n shift RA = ⌊ N ZC − 2 d u N CS ⌋ d start = 2 N ZC − 2 d u + n shift RA ⋅ N CS n group RA = ⌊ N ZC − d u d start ⌋ n ̅ shift RA = max ⌊ 3 d u − N ZC − n group RA ⋅ d start N CS ⌋ 0 and wherein N CS is a quantity of cyclic shifts for user equipment, UE, N ZC is a length of the random access sequence and a root of the random access sequence is u, d u = { p 0 ≤ p < N ZC / 2 N ZC − p another value, and p is a minimum non-negative integer that satisfies ( pu) mod N ZC = 1; and generating the random access sequence according to the cyclic shift value C v. N CS is a quantity of cyclic shifts for user equipment, UE, N ZC is a length of the random access sequence and a root of the random access sequence is u, d u = { p 0 ≤ p < N ZC / 2 N ZC − p another value, and p is a minimum non-negative integer that satisfies ( pu) mod N ZC = 1; and generating the random access sequence according to the cyclic shift value C v.