IP Library Granted Patent US 11,533,120
Granted Patent B2
US 11,533,120 · App. 16/872,252 · Granted Dec 20, 2022

Grouping and use of short sequence signals

Inventors: Chunli Liang (Guangdong, CN); Shuqiang Xia (Guangdong, CN); Zhisong Zuo (Guangdong, CN); Peng Hao (Guangdong, CN); Xianghui Han (Guangdong, CN)
Assignee: ZTE Corporation
H04J13/0062H04L25/03178H04L27/2613H04L27/2692H04W72/0413
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,533,120
App. No.
16/872,252
Granted
Dec 20, 2022
Kind
B2
Abstract

New sequences have been proposed and/or adopted for short Physical Uplink Control Channel communications between base stations and UEs. In an exemplary embodiment, a UE communicates with a base station based on sequence groups that include the new sequences, where the new sequences are allocated to different sequence groups based, at least in part, on correlations with other existing sequences included in individual sequence groups.

Claims (41)

1. A method for wireless communication, comprising:

transmitting information to a wireless communication node based on a target sequence, wherein the target sequence is a member of a target sequence set, wherein each target sequence of the target sequence set corresponds to a sequence of an individual sequence group, and wherein the target sequence and the sequence of the individual sequence group have a degree of correlation with each other,

wherein each target sequence of the target sequence set is a lengh-12 sequence,

wherein a group index of the individual sequence group is denoted as u, and wherein the length-12 sequence corresponds to a mathematical form of e jπφ(n)/4 , n= 0,1,2, . . . ,11 that comprises at least one of:

φ(n)=[3 −1 −3 3 −3 −1 3 3 3 −3 −1 −3] for u=23,

φ(n)=[1 −1 3 −1 −1 −1 −3 −1 1 1 1 −3] for u=6,

φ(n)=[−1 −1 −1 −1 1 −3 −1 3 3 −1 −3 1] for u=16,

φ(n)=[−3 −3 3 3 3 −3 −1 1 −3 3 1 −3] for u=27,

φ(n)=[−3 3 1 −3 1 3 −1 −1 1 3 3 3] for u=1,

φ(n)=[−3 3 3 1 −3 3 −1 1 3 −3 3 −3] for u=2,

φ(n)=[−3 1 3 −1 −1 −3 −3 −1 −1 3 1 −3] for u=15, or

φ(n)=[1 3 −3 1 3 3 3 1 −1 1 −1 3] for u=14.

2. The method of claim 1 , wherein the individual sequence group includes at least two sequences of different lengths.

3. The method of claim 1 , wherein the sequence of the individual sequence group is based on a length of the sequence.

4. An apparatus for wireless communication, comprising a memory and a processor, wherein the processor is configured to read code from the memory and transmit information to a wireless communication node based on a target sequence, wherein the target sequence is a member of a target sequence set, wherein each target sequence of the target sequence set corresponds to a sequence of an individual sequence group, and wherein the target sequence and the sequence of the individual sequence group have a degree of correlation with each other,

wherein each target sequence of the target sequence set is a lengh-12 sequence, and

wherein a group index of the individual sequence group is denoted as u, and wherein the length-12 sequence corresponds to a mathematical form of e jπφ(n)/4 , n= 0,1,2, . . . ,11 that comprises at least one of:

φ(n)=[3 −1 −3 3 −3 −1 3 3 3 −3 −1 −3] for u=23,

φ(n)=[1 −1 3 −1 −1 −1 −3 −1 1 1 1 −3] for u=6,

φ(n)=[−1 −1 −1 −1 1 −3 −1 3 3 −1 −3 1] for u=16,

φ(n)=[−3 −3 3 3 3 −3 −1 1 −3 3 1 −3] for u=27,

φ(n)=[−3 3 1 −3 1 3 −1 −1 1 3 3 3] for u=1,

φ(n)=[−3 3 3 1 −3 3 −1 1 3 −3 3 −3] for u=2,

φ(n)=[−3 1 3 −1 −1 −3 −3 −1 −1 3 1 −3] for u=15, or

φ(n)=[1 3 −3 1 3 3 3 1 −1 1 −1 3] for u=14.

5. The apparatus of claim 4 , wherein the individual sequence group includes at least two sequences of different lengths.

6. The apparatus of claim 4 , wherein the sequence of the individual sequence group is based on a length of the sequence.

7. A non-transitory computer readable program storage medium having code stored thereon, the code, when executed by a processor, causing the processor to implement a method that comprises:

transmitting information to a wireless communication node based on a target sequence, wherein the target sequence is a member of a target sequence set, wherein each target sequence of the target sequence set corresponds to a sequence of an individual sequence group, and wherein the target sequence and the sequence of the individual sequence group have a degree of correlation with each other,

wherein each target sequence of the target sequence set is a lengh- 12 sequence,

wherein a group index of the individual sequence group is denoted as u, and wherein the length- 12 sequence corresponds to a mathematical form of e jπφ(n)/4 , n= 0,1,2, . . . ,11 that comprises at least one of:

φ(n)=[3 −1 −3 3 −3 −1 3 3 3 −3 −1 −3] for u=23,

φ(n)=[1 −1 3 −1 −1 −1 −3 −1 1 1 1 −3] for u=6,

φ(n)=[−1 −1 −1 −1 1 −3 −1 3 3 −1 −3 1] for u=16,

φ(n)=[−3 −3 3 3 3 −3 −1 1 −3 3 1 −3] for u=27,

φ(n)=[−3 3 1 −3 1 3 −1 −1 1 3 3 3] for u=1,

φ(n)=[−3 3 3 1 −3 3 −1 1 3 −3 3 −3] for u=2,

φ(n)=[−3 1 3 −1 −1 −3 −3 −1 −1 3 1 −3] for u=15, or

φ(n)=[1 3 −3 1 3 3 3 1 −1 1 −1 3] for u=14.

8. The non-transitory computer readable program storage medium of claim 7 , wherein the individual sequence group includes at least two sequences of different lengths.

9. The non-transitory computer readable program storage medium of claim 7 , wherein the sequence of the individual sequence group is based on a length of the sequence.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 10, 2020
From: LIANG, CHUNLI; XIA, SHUQIANG; ZUO, ZHISONG; HAO, PENG; HAN, XIANGHUI
To: ZTE CORPORATION
Reel/Frame 054328/0691 →
Continuity (2)
Continuation PCTCN2017110525 · Nov 10, 2017
Related Publication 20200274630A1 · Aug 27, 2020
Cited By (1)
US 12,294,545