Transmission method and apparatus

A communication apparatus, comprising:

• at least one processor;
• and
• a non-transitory memory coupled to the at least one processor and having program instructions stored thereon which, when executed by the at least one processor, cause the apparatus to:
• scramble data based on a first sequence, wherein the first sequence is a portion of a second sequence and the first sequence starts from a location in the second sequence, wherein the first sequence and the second sequence satisfy:
• c(n)=c1(n+x), c(n) represents the first sequence, c1(n1) represents the second sequence, x represents the location in the second sequence and is determined based on an index of a beam, n and n1 are integers, 0≤n≤M−1, 0≤n1≤L−1, L>M, M is a length of the first sequence, and L is a length of the second sequence;
• and
• send the scrambled data to a terminal device.

A communication system, comprising:

• a base station and a terminal device;
• wherein the base station is configured to:
• scramble data based on a first sequence, wherein the first sequence is a portion of a second sequence and the first sequence starts from a location in the second sequence, wherein the first sequence and the second sequence satisfy:
• c(n)=c1(n+x), c(n) represents the first sequence, c1(n1) represents the second sequence, x represents the location in the second sequence and is determined based on an index of a beam, n and n1 are integers, 0≤n≤M−1, 0≤n1≤L−1, L>M, M is a length of the first sequence, and L is a length of the second sequence;
• and
• send the scrambled data to the terminal device;
• and
• wherein the terminal device is configured to:
• receive the scrambled data from the base station;
• and
• descramble the scrambled data based on the first sequence.

A method for wireless communication, comprising:

• receiving data from an access device;
• and
• descrambling the data based on a first sequence, wherein the first sequence is a portion of a second sequence and the first sequence starts from a location in the second sequence, wherein the first sequence and the second sequence satisfy:
• c(n)=c1(n+x), c(n) represents the first sequence, c1(n1) represents the second sequence, x represents the location in the second sequence and is determined based on an index of a beam, n and n1 are integers, 0≤n≤M−1,0≤n1≤L−1, L>M, M is a length of the first sequence, and L is a length of the second sequence.

A communication apparatus, comprising:

• at least one processor;
• and
• a non-transitory memory coupled to the at least one processor and having program instructions stored thereon which, when executed by the at least one processor, cause the apparatus to:
• receive data from an access device;
• and
• descramble the data based on a first sequence, wherein the first sequence is a portion of a second sequence and the first sequence starts from a location in the second sequence, wherein the first sequence and the second sequence satisfy:
• c(n)=c1(n+x), c(n) represents the first sequence, c1(n1) represents the second sequence, x represents the location in the second sequence and is determined based on an index of a beam, n and n1 are integers, 0≤n≤M−1,0≤n1≤L−1, L>M, M is a length of the first sequence, and L is a length of the second sequence.

A non-transitory computer readable medium, comprising computer program instructions which, when executed by one or more processors, cause an apparatus to:

• receive data from an access device;
• and
• descramble the data based on a first sequence, wherein the first sequence is a portion of a second sequence and the first sequence starts from a location in the second sequence, wherein the first sequence and the second sequence satisfy:
• c(n)=c1(n+x), c(n) represents the first sequence, c1(n1) represents the second sequence, x represents the location in the second sequence and is determined based on an index of a beam, n and n1 are integers, 0≤n≤M−1,0≤n1≤L−1, L>M, M is a length of the first sequence, and L is a length of the second sequence.