Sequence determining method and apparatus
AssigneeHuawei Technologies Co., Ltd.
InventorsMingxin Gong, Hao Sun, Bingyu Qu
Life of this patent
Estimating the term…
Abstract
Embodiments of the present disclosure provide, among other implementations, sequence determining methods. One example method provides a sequence group, and one sequence group number is corresponding to at least two sequences, where one sequence is used for mapping to consecutive subcarriers, and at least one other sequence is used for mapping to equally-spaced subcarriers. In some embodiments of the present disclosure, as high as possible cross-correlation between a sending signal obtained after equally-spaced mapping is performed on a sequence in a sequence group can be determined, and a sending signal obtained after continuous mapping is performed on another sequence in the group.
Claims20
A method, comprising:
- determining a second sequence based on an index v of a sequence group, wherein the sequence group comprises a sequence {xn} and a sequence {ym}, and wherein the second sequence is at least one of a second sequence {fn} or a second sequence {gm};
- and
- receiving uplink control information or a reference signal based on the second sequence, wherein:
- the sequence {xn} corresponds to a second sequence {fn}, and the second sequence {ym} corresponds to the second sequence {gm}, wherein fn is an element in the second sequence {fn}, gm is an element in the second sequence {gm}, a length of the second sequence {fn} is N, a length of the second sequence {gm} is M, n and m are integers, 0≤n≤N−1, and 0≤m≤M−1;
- the element fn satisfies fn=xn·ej·α·n;
- the element gm satisfies gm=ym·ej·α·m;
- A is a non-zero complex number, α is a real number, and j=√{square root over (−1)};
- an element xn in the sequence {xn} satisfies xn=u·eπ·zn/4, u is a non-zero complex number, and sn is an element in a sequence {sn};
- an element ym in the second sequence {ym} satisfies ym=kq(m mod Mprime),
- k
- q
- (
- i
- )
- =
- e
- -
- j
-
- π
- ·
- u
- ·
- i
- ·
- (
- i
- +
- 1
- )
- M
- prime
- ,
- i is an integer, 0≤i≤Mprime−1, Mprime, is a largest prime number smaller than M;
- and
- when N=18 and M=36, a combination of the sequence {sn} and q is one of following combinations, wherein the following combinations belong to a combination set, and the following combinations comprise:
- the sequence {sn} is {−1, 3, −1, −3, 3, 1, −3, −1, 3, −3, −1, −1, 1, 1, 1, −1, −1, −1}, and q=1;
- the sequence {sn} is {3, −3, 3, −1, 1, 3, −3, −1, −3, −3, −1, −3, 3, 1, −1, 3, −3, 3}, and q=2;
- the sequence {sn} is {−3, 3, 1, −1, −1, 3, −3, −1, 1, 1, 1, 1, 1, −1, 3, −1, −3, −1}, and q=3;
- the sequence {sn} is {1, 1, −1, −1, −3, −1, 1, −3, −3, −3, 1, −3, −1, −1, 1, −1, 3, 1}, and q=5;
- the sequence {sn} is {−3, 3, −1, 1, 3, 1, −3, −1, 1, 1, −3, 1, 3, 3, −1, −3, −3, −3}, and q=7;
- the sequence {sn} is {3, −1, 3, 1, −3, −3, −1, 1, −3, −3, 3, 3, 3, 1, 3, −3, 3, −3}, and q=10;
- the sequence {sn} is {−3, −3, −3, 1, −3, 3, 1, 1, 3, −3, −3, 1, 3, −1, 3, −3, −3, 3}, and q=11;
- the sequence {sn} is {−3, −3, 3, 3, 3, −1, −1, −3, −1, −1, −1, 3, 1, −3, −3, −1, 3, −1}, and q=12;
- the sequence {sn} is {−3, −1, −3, −3, 1, 1, −1, −3, −1, −3, −1, −1, 3, 3, −1, 3, 1, 3}, and q=13;
- the sequence {sn} is {−3, 3, −1, −3, −1, −3, 1, 1, −3, −3, −1, −1, 3, −3, 1, 3, 1, 1}, and q=15;
- the sequence {sn} is {−3, 1, −3, −1, −1, 3, 1, −3, −3, −3, −1, −3, −3, 1, 1, 1, −1, −1}, and q=19;
- the sequence {sn} is {3, 3, 3, −3, −1, −3, −1, 3, −1, 1, −1, −3, 1, −3, −3, −1, 3, 3}, and q=20;
- and
- the sequence {sn} is {−3, 3, 1, −1, −1, −1, −1, 1, −1, 3, 3, −3, −1, 1, 3, −1, 3, −1}, and q=30.
An apparatus, comprising:
- a storage medium including executable instructions;
- and
- at least one processor;
- wherein the executable instructions, when executed by the at least one processor, cause the apparatus to:
- determine a second sequence based on an index v of a sequence group, wherein the sequence group comprises a sequence {xn} and a sequence {ym}, and wherein the second sequence is at least one of a second sequence {fn} or a second sequence {gm};
- and
- receive uplink control information or a reference signal based on the second sequence, wherein:
- the sequence {xn} corresponds to a second sequence {fn}, and the second sequence {ym} corresponds to the second sequence {gm}, wherein fn is an element in the second sequence {fn}, gm is an element in the second sequence {gm}, a length of the second sequence {fn} is N, a length of the second sequence {gm} is M, n and m are integers, 0≤n≤N−1, and 0≤m≤M−1;
- the element fn satisfies fn=xn·ej·α·n;
- the element gn satisfies gm=ym·ej·α·m;
- A is a non-zero complex number, a is a real number, and j=√{square root over (−1)};
- an element xn in the sequence {xn} satisfies xn=u·eπ·j·sn/4, u is a non-zero complex number, and sn is an element in a sequence {sn};
- an element ym in the sequence {ym} satisfies ym=kq(m mod Mprime),
- k
- q
- (
- i
- )
- =
- e
- -
- j
-
- π
- ·
- q
- ·
- i
- ·
- (
- i
- +
- 1
- )
- M
- prime
- ,
- i is an integer, 0≤i≤Mprime−1, Mprime is a largest prime number smaller than M;
- and
- when N=18 and M=36, a combination of the sequence {sn} and q is one of following combinations, wherein the following combinations belong to a combination set, and the following combinations comprise:
- the sequence {sn} is {−1, 3, −1, −3, 3, 1, −3, −1, 3, −3, −1, −1, 1, 1, 1, −1, −1, −1}, and q=1;
- the sequence {sn} is {3, −3, 3, −1, 1, 3, −3, −1, −3, −3, −1, −3, 3, 1, −1, 3, −3, 3}, and q=2;
- the sequence {sn} is {−3, 3, 1, −1, −1, 3, −3, −1, 1, 1, 1, 1, 1, −1, 3, −1, −3, −1}, and q=3;
- the sequence {sn} is {1, 1, −1, −1, −3, −1, 1, −3, −3, −3, 1, −3, −1, −1, 1, −1, 3, 1}, and q=5;
- the sequence {sn} is {−3, 3, −1, 1, 3, 1, −3, −1, 1, 1, −3, 1, 3, 3, −1, −3, −3, −3}, and q=7;
- the sequence {sn} is {3, −1, 3, 1, −3, −3, −1, 1, −3, −3, 3, 3, 3, 1, 3, −3, 3, −3}, and q=10;
- the sequence {sn} is {−3, −3, −3, 1, −3, 3, 1, 1, 3, −3, −3, 1, 3, −1, 3, −3, −3, 3}, and q=11;
- the sequence {sn} is {−3, −3, 3, 3, 3, −1, −1, −3, −1, −1, −1, 3, 1, −3, −3, −1, 3, −1}, and q=12;
- the sequence {sn} is {−3, −1, −3, −3, 1, 1, −1, −3, −1, −3, −1, −1, 3, 3, −1, 3, 1, 3}, and q=13;
- the sequence {sn} is {−3, 3, −1, −3, −1, −3, 1, 1, −3, −3, −1, −1, 3, −3, 1, 3, 1, 1}, and q=15;
- the sequence {sn} is {−3, 1, −3, −1, −1, 3, 1, −3, −3, −3, −1, −3, −3, 1, 1, 1, −1, −1}, and q=19;
- the sequence {sn} is {3, 3, 3, −3, −1, −3, −1, 3, −1, 1, −1, −3, 1, −3, −3, −1, 3, 3}, and q=20;
- and
- the sequence {sn} is {−3, 3, 1, −1, −1, −1, −1, 1, −1, 3, 3, −3, −1, 1, 3, −1, 3, −1}, and q=30.
A non-transitory computer-readable storage medium comprising instructions which, when executed by a computer, cause the computer to carry out the following:
- determining a second sequence based on an index v of a sequence group, wherein the sequence group comprises a sequence {xn} and a sequence {ym}, and wherein the second sequence is at least one of a second sequence {fn} or a second sequence {gm};
- and
- receiving uplink control information or a reference signal based on the second sequence, wherein:
- the sequence {xn} corresponds to a second sequence {fn}, and the second sequence {ym} corresponds to the second sequence {gm}, wherein fn is an element in the second sequence {fn}, gm is an element in the second sequence {gm}, a length of the second sequence {fn} is N, a length of the second sequence {gm} is M, in and m are integers, 0≤n≤N−1, and 0≤m≤M−1;
- the element fn satisfies fn=xm·ej·α·n;
- the element gm satisfies gm=ym·ej·α·m;
- A is a non-zero complex number, a is a real number, and j=√{square root over (−1)};
- an element xn in the sequence {xn} satisfies xn=u·eπ·j·sn/4, u is a non-zero complex number, and sn is an element in a sequence {sn};
- an element ym in the second sequence {ym} satisfies ym=kq(m mod Mprime),
- k
- q
- (
- i
- )
- =
- e
- -
- j
-
- π
- ·
- q
- ·
- i
- ·
- (
- i
- +
- 1
- )
- M
- prime
- ,
- i is an integer, 0≤i≤Mprime−1, Mprime is a largest prime number smaller than M;
- and
- when N=18 and M=36, a combination of the sequence {sn} and q is one of following combinations, wherein the following combinations belong to a combination set, and the following combinations comprise:
- the sequence {sn} is {−1, 3, −1, −3, 3, 1, −3, −1, 3, −3, −1, −1, 1, 1, 1, −1, −1, −1}, and q=1;
- the sequence {sn} is {3, −3, 3, −1, 1, 3, −3, −1, −3, −3, −1, −3, 3, 1, −1, 3, −3, 3}, and q=2;
- the sequence {sn} is {−3, 3, 1, −1, −1, 3, −3, −1, 1, 1, 1, 1, 1, −1, 3, −1, −3, −1}, and q=3;
- the sequence {sn} is {1, 1, −1, −1, −3, −1, 1, −3, −3, −3, 1, −3, −1, −1, 1, −1, 3, 1}, and q=5;
- the sequence {sn} is {−3, 3, −1, 1, 3, 1, −3, −1, 1, 1, −3, 1, 3, 3, −1, −3, −3, −3}, and q=7;
- the sequence {sn} is {3, −1, 3, 1, −3, −3, −1, 1, −3, −3, 3, 3, 3, 1, 3, −3, 3, −3}, and q=10;
- the sequence {sn} is {−3, −3, −3, 1, −3, 3, 1, 1, 3, −3, −3, 1, 3, −1, 3, −3, −3, 3}, and q=11;
- the sequence {sn} is {−3, −3, 3, 3, 3, −1, −1, −3, −1, −1, −1, 3, 1, −3, −3, −1, 3, −1}, and q=12;
- the sequence {sn} is {−3, −1, −3, −3, 1, 1, −1, −3, −1, −3, −1, −1, 3, 3, −1, 3, 1, 3}, and q=13;
- the sequence {sn} is {−3, 3, −1, −3, −1, −3, 1, 1, −3, −3, −1, −1, 3, −3, 1, 3, 1, 1}, and q=15;
- the sequence {sn} is {−3, 1, −3, −1, −1, 3, 1, −3, −3, −3, −1, −3, −3, 1, 1, 1, −1, −1} and q=19;
- the sequence {sn} is {3, 3, 3, −3, −1, −3, −1, 3, −1, 1, −1, −3, 1, −3, −3, −1, 3, 3}, and q=20;
- and
- the sequence {sn} is {−3, 3, 1, −1, −1, −1, −1, 1, −1, 3, 3, −3, −1, 1, 3, −1, 3, −1}, and q=30.
Dependencies are inferred from the claim text.