A sequence determining method for generating a demodulation reference signal, DMRS, of a physical uplink control channel, PUCCH, comprising: determining, based on an index v of a sequence group, a first sequence in a sequence group or an index of the first sequence, wherein the sequence group comprises a sequence { x n} and a sequence { y m}; and generating a second sequence based on the first sequence or generating a second sequence based on the index of the first sequence, wherein if the first sequence is the sequence { x n}, the second sequence is a sequence { f n}, or if the first sequence is the sequence { y m}, the second sequence is a sequence { g m}, wherein f n is an element in the sequence { f n}, g m is an element in the sequence { g m}, a length of the sequence { f n} is N, a length of the sequence { g m} is M, n and m are integers, 0≤ n ≤ N -1, and 0≤ m ≤ M -1; the element f n in the sequence { f n} satisfies f n = A · x n · e j · α · n; the element g m in the sequence { g m} satisfies g m = A · y m · e j · α · m; A is a non-zero complex number, α is a real number, and j = − 1; an element x n in the sequence { x n} satisfies x n = u · e π · j · s n /4, u is a non-zero complex number, and s n is an element in a sequence { s n}; an element y m in the sequence { y m} satisfies y m = k q ( m mod M prime), k q ( i) = e − j ⋅ π ⋅ q ⋅ i ⋅ i + 1 M prime, i is an integer, 0 ≤ i ≤ M prime - 1, M prime is a largest prime number smaller than M, q =└ q +1/2┘, and q = M prime ·( v +1)/31; and characterized in that when N = 12, a combination of the sequence { s n} and v is at least one of a combination set, and the combination set comprises the following combinations: the sequence { s n} is {-1, 1, 1, -1, 1, 3, 3, -1, -1, -3, 1, -3}, and v = 17; the sequence { s n} is {-3, 1, -3, -3, -3, 3, -3, -1, 1, 1, 1, -3}, and v = 0; the sequence { s n} is {-3, -3, -1, 3, 3, 3, -3, 3, -3, 1, -1, -3}, and v = 3; the sequence { s n} is {-3, -1, -1, -3, -3, -1, -3, 3, 1, 3, -1, -3}, and v = 9; the sequence { s n} is {-3, 3, 1, 3, -3, 1, 1, 1, 1, 3, -3, 3}, and v = 21; the sequence { s n} is {-3, 3, -3, 3, 3, -3, -1, -1, 3, 3, 1, -3}, and v = 10; and the sequence { s n} is {3, 1, 3, 1, 3, -3, -1, 1, 3, 1, -1, -3}, and v = 20. determining, based on an index v of a sequence group, a first sequence in a sequence group or an index of the first sequence, wherein the sequence group comprises a sequence { x n} and a sequence { y m}; and generating a second sequence based on the first sequence or generating a second sequence based on the index of the first sequence, wherein if the first sequence is the sequence { x n}, the second sequence is a sequence { f n}, or if the first sequence is the sequence { y m}, the second sequence is a sequence { g m}, wherein f n is an element in the sequence { f n}, g m is an element in the sequence { g m}, a length of the sequence { f n} is N, a length of the sequence { g m} is M, n and m are integers, 0≤ n ≤ N -1, and 0≤ m ≤ M -1; the element f n in the sequence { f n} satisfies f n = A · x n · e j · α · n; the element g m in the sequence { g m} satisfies g m = A · y m · e j · α · m; A is a non-zero complex number, α is a real number, and j = − 1; an element x n in the sequence { x n} satisfies x n = u · e π · j · s n /4, u is a non-zero complex number, and s n is an element in a sequence { s n}; an element y m in the sequence { y m} satisfies y m = k q ( m mod M prime), k q ( i) = e − j ⋅ π ⋅ q ⋅ i ⋅ i + 1 M prime, i is an integer, 0 ≤ i ≤ M prime - 1, M prime is a largest prime number smaller than M, q =└ q +1/2┘, and q = M prime ·( v +1)/31; and characterized in that when N = 12, a combination of the sequence { s n} and v is at least one of a combination set, and the combination set comprises the following combinations: the sequence { s n} is {-1, 1, 1, -1, 1, 3, 3, -1, -1, -3, 1, -3}, and v = 17; the sequence { s n} is {-3, 1, -3, -3, -3, 3, -3, -1, 1, 1, 1, -3}, and v = 0; the sequence { s n} is {-3, -3, -1, 3, 3, 3, -3, 3, -3, 1, -1, -3}, and v = 3; the sequence { s n} is {-3, -1, -1, -3, -3, -1, -3, 3, 1, 3, -1, -3}, and v = 9; the sequence { s n} is {-3, 3, 1, 3, -3, 1, 1, 1, 1, 3, -3, 3}, and v = 21; the sequence { s n} is {-3, 3, -3, 3, 3, -3, -1, -1, 3, 3, 1, -3}, and v = 10; and the sequence { s n} is {3, 1, 3, 1, 3, -3, -1, 1, 3, 1, -1, -3}, and v = 20. the sequence { s n} is {-1, 1, 1, -1, 1, 3, 3, -1, -1, -3, 1, -3}, and v = 17; the sequence { s n} is {-3, 1, -3, -3, -3, 3, -3, -1, 1, 1, 1, -3}, and v = 0; the sequence { s n} is {-3, -3, -1, 3, 3, 3, -3, 3, -3, 1, -1, -3}, and v = 3; the sequence { s n} is {-3, -1, -1, -3, -3, -1, -3, 3, 1, 3, -1, -3}, and v = 9; the sequence { s n} is {-3, 3, 1, 3, -3, 1, 1, 1, 1, 3, -3, 3}, and v = 21; the sequence { s n} is {-3, 3, -3, 3, 3, -3, -1, -1, 3, 3, 1, -3}, and v = 10; and the sequence { s n} is {3, 1, 3, 1, 3, -3, -1, 1, 3, 1, -1, -3}, and v = 20.