US 2020/0007284 A1Published application

Signal transmission method, signal reception method, apparatus, and system in wireless communication

AssigneeHuawei Technologies Co., Ltd.

InventorsBingyu QU, Hao SUN

Life of this patent

Estimating the term…

Loading patent…

Abstract

This application relates to the field of wireless communications technologies, and in particular, to a data processing method, apparatus, and system. This application provides a data processing method. A transmit device uses a sequence to carry data and a reference signal. The transmit device carries the two channels of data on an odd element and an even element of the sequence, respectively. The transmit device successively maps the sequence that carries the two channels of data to allocated subcarriers, and then sends the data in an orthogonal frequency division multiplexing (OFDM) manner. This application is intended to decrease cubic metric (CM)/peak-to-average ratio of a transmitted signal of an orthogonal frequency division multiplexing OFDM system through sequence design and mapping of the two channels of data to subcarriers, thereby improving link quality of an entire transmission system.

Claims12

Dependent claims

A method for signal transmission in wireless communication, the method comprising:

determining a sequence {fn} comprising 2×N elements, wherein fn is an element of {fn}, N is a positive integer and an even number, n is an integer, and 0≤n≤2×N−1;
mapping the sequence {fn} to 2×N subcarriers;
and
sending, on the 2×N subcarriers, a signal that carries the sequence {fn};
wherein the sequence {fn} comprises:
when n is an odd number, fn=A1·xn·exp(2π·j·α·n);
when n is an even number, fn=A2·xn·exp(2π·j·α·n);
A1 and A2 are non-zero complex numbers, a is a real number, j=√{square root over (−1)}, exp(j×h) represents ej×h, and h is any real number;
and {xn} is a sequence composed of xn, and meets at least one of the following conditions:
condition 1:
when n is an even number greater than or equal to 0 and less than or equal to N−1,
xn+N=a×j×xn;
when n is an odd number greater than or equal to 0 and less than or equal to N−1,
xn+N=−a×j×xn;
wherein a=1 or 1, j=√{square root over (−1)}, and N is a positive integer and an even number;
and
condition 2:
when N=6,
x
2

n
+
6
=
a
n
·
x
2

n
,
and
x
2

n
+
1
+
6
=
b
n
·
x
2

n
+
1
,

where


a
n
=
c
·
exp

(
π
·
j
·
y
n
/
4
)
b
n
=
c
·
exp

(
π
·
j
·
y
n
+
3
/
4
)
,
c is a non-zero complex number, 0≤n≤2, and
{y0 y1 y2 y3 y4 y5} is one of the following sequences:
{2 0 6 2 4 6},
{6 0 2 6 4 2},
{0 6 4 4 2 0},
{2 6 6 4 4 0},
{6 2 2 4 4 0},
{6 6 2 4 0 0},
{2 2 6 4 0 0},
{4 2 0 4 6 0},
{0 2 4 0 6 4},
{2 0 6 6 4 2},
{4 0 0 6 6 2},
{0 4 4 6 6 2},
{0 0 4 6 2 2},
{4 4 0 6 2 2},
{6 4 2 6 0 2},
{2 4 6 2 0 6},
{4 2 0 0 6 4},
{6 2 2 0 0 4},
{2 6 6 0 0 4},
{2 2 6 0 4 4},
{6 6 2 0 4 4},
{0 6 4 0 2 4},
{4 6 0 4 2 0},
{6 4 2 2 0 6},
{0 4 4 2 2 6},
{4 0 0 2 2 6},
{4 4 0 2 6 6},
{0 0 4 2 6 6}.

121 more elements

A method for signal transmission in wireless communication, the method comprising:

determining a sequence {fn} comprising 2×N elements, wherein fn is an element of {fn}, N is a positive integer and an even number, n is an integer, and 0<n<2×N−1, wherein N=6;
mapping the sequence {fn} to 2×N subcarriers;
and
sending, on the 2×N subcarriers, a signal that carries the sequence {fn};
wherein the sequence {fn} is as follows:
when n is an odd number, fn=A1·xn·exp(2π·j·α·n);
when n is an even number, fn=A2·xn·exp(2π·j·α·n);
A1 and A2 are non-zero complex numbers, a is a real number, j=√{square root over (−1)}, exp(j×h) represents ej×h, and h is any real number;
and
{xn} is a sequence that meets the following conditions:
an element xn in {xn} meets:
xn=u·exp(π·j·sn/4), wherein u is a non-zero complex number,
{sn} is a sequence composed of sn,
the sequence {sn}={s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, s10, s11} is one of the following sequences or one of equivalent sequences of the following sequences:
{3, 3, −3, −1, 3, −1, 3, −1, −3, 3, 3, 3},
{1, −1, 1, −3, −3, −1, 1, 3, 1, 1, −3, 3},
{−3, −1, 1, 1, 1, −1, −3, 3, 1, −3, 1, 3},
{−3, −1, 3, −1, −3, 3, −3, 3, 3, 3, −3, −1},
{3, 1, 3, 1, −1, −3, 3, −3, −3, −1, 3, −3},
{3, 1, −1, −3, −1, −3, 3, −3, 1, 3, 3, −3},
{1, 3, −1, 1, 1, 3, 1, −1, −3, 3, −3, 3},
{−1, 1, 1, 3, −1, 1, −1, −3, −1, −3, 3, 1},
{1, −3, −3, −1, −3, −3, −1, 3, −3, 3, −1, −1},
{−1, −3, −1, 3, 3, −3, −3, 3, −1, −1, −3, −1},
{3, 1, 3, 3, −1, 1, −1, −3, −3, 1, −1, 1},
{3, 3, −3, −1, 3, −1, 1, 1, 1, −1, −3, 1},
{−3, 3, 1, 3, −3, 3, −3, −1, 1, −1, −3, −1},
{−3, 1, 3, 3, 1, 3, −1, −3, 1, 1, −1, 3},
{−1, −3, 3, −3, −3, 3, −1, 1, −1, −3, −1, 1},
{1, 3, 1, −1−3, −1, −1, −3, −3, −1, 1, −1},
{1, −1, −1, −3, −3, −3, 1, −3, −3, −1, −1, 1},
{−1, 1, −1, −3, −1, 1, 1, −1, 3, −3, −1, −3},
{3, −1, −3, −3, 1, −1, 3, −3, 3, 3, −3, 1},
{−1, 1, −1, −3, 1, 3, −1, −3, −1, 1, 3, 1},
{3, −3, 1, 3, 1, 1, 1, −3, 3, 1, −3, 3},
{3, 3, −1, −1−1, 1, 1, −1, −1, 3, −1, 3},
{1, 3, 1, 3, −1, −1, 1, −3, 1, −1, −3, 3},
{1, −3, 3, 3, 3, 1, −3, −1, 1, 1, 3, −1}, and
{−3, 3, −3, −1, 1, −3, 1, 1, 1, 3, 1, −1};
an equivalent sequence of {sn} is {qn}, wherein qn=sn+un (mod 8), 0<n<11, and
a sequence {ui} is one of the following sequences:
{0, 0, 4, 4, 0, 0, 4, 4, 0, 0, 4, 4},
{0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2},
{0, 2, 4, 6, 0, 2, 4, 6, 0, 2, 4, 6},
{0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4},
{0, 4, 4, 0, 0, 4, 4, 0, 0, 4, 4, 0},
{0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6},
{0, 6, 4, 2, 0, 6, 4, 2, 0, 6, 4, 2},
{2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0},
{2, 0, 6, 4, 2, 0, 6, 4, 2, 0, 6, 4},
{2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2},
{2, 2, 6, 6, 2, 2, 6, 6, 2, 2, 6, 6},
{2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4},
{2, 4, 6, 0, 2, 4, 6, 0, 2, 4, 6, 0},
{2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6},
{2, 6, 6, 2, 2, 6, 6, 2, 2, 6, 6, 2},
{4, 0, 0, 4, 4, 0, 0, 4, 4, 0, 0, 4},
{4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0},
{4, 2, 0, 6, 4, 2, 0, 6, 4, 2, 0, 6},
{4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2},
{4, 4, 0, 0, 4, 4, 0, 0, 4, 4, 0, 0},
{4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4},
{4, 6, 0, 2, 4, 6, 0, 2, 4, 6, 0, 2},
{4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6},
{6, 0, 2, 4, 6, 0, 2, 4, 6, 0, 2, 4},
{6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0},
{6, 2, 2, 6, 6, 2, 2, 6, 6, 2, 2, 6},
{6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2},
{6, 4, 2, 0, 6, 4, 2, 0, 6, 4, 2, 0},
{6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4},
{6, 6, 2, 2, 6, 6, 2, 2, 6, 6, 2, 2}, and
{6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

69 more elements

A communications apparatus comprising:

a processor and a storage unit, wherein the storage unit stores an instruction, and the instruction is used to enable the processor to perform operations comprising:
determining a sequence {fn} comprising 2×N elements, wherein fn is an element of {fn}, N is a positive integer and an even number, n is an integer, and 0<n<2×N−1, wherein N=6;
mapping the sequence {fn} to 2×N subcarriers;
and
sending, on the 2×N subcarriers, a signal that carries the sequence {fn};
wherein the sequence {fn} is as follows:
when n is an odd number, fn=A1·xn·exp(2π·j·α·n);
when n is an even number, fn=A2·xn·exp(2π·j·α·n);
A1 and A2 are non-zero complex numbers, a is a real number, j=√{square root over (−1)}, exp(j×h) represents ej×h, and h is any real number;
and
{xn} is a sequence that meets the following conditions:
an element xn in {xn} meets:
xn=u·exp(π·j·sn/4), wherein u is a non-zero complex number,
{sn} is a sequence composed of sn,
the sequence {sn}={s0, s1, S2, s3, s4, s5, s6, s7, s8, s9, s10, s11} is one of the following sequences or one of equivalent sequences of the following sequences:
{3, 3, −3, −1, 3, −1, 3, −1, −3, 3, 3, 3},
{1, −1, 1, −3, −3, −1, 1, 3, 1, 1, −3, 3},
{−3, −1, 1, 1, 1, −1, −3, 3, 1, −3, 1, 3},
{−3, −1, 3, −1, −3, 3, −3, 3, 3, 3, −3, −1},
{3, 1, 3, 1, −1, −3, 3, −3, −3, −1, 3, −3},
{3, 1, −1, −3, −1, −3, 3, −3, 1, 3, 3, −3},
{1, 3, −1, 1, 1, 3, 1, −1, −3, 3, −3, 3},
{−1, 1, 1, 3, −1, 1, −1, −3, −1, −3, 3, 1},
{1, −3, −3, −1, −3, −3, −1, 3, −3, 3, −1, −1},
{−1, −3, −1, 3, 3, −3, −3, 3, −1, −1, −3, −1},
{3, 1, 3, 3, −1, 1, −1, −3, −3, 1, −1, 1},
{3, 3, −3, −1, 3, −1, 1, 1, 1, −1, −3, 1},
{−3, 3, 1, 3, −3, 3, −3, −1, 1, −1, −3, −1},
{−3, 1, 3, 3, 1, 3, −1, −3, 1, 1, −1, 3},
{−1, −3, 3, −3, −3, 3, −1, 1, −1, −3, −1, 1},
{1, 3, 1, −1−3, −1, −1, −3, −3, −1, 1, −1},
{1, −1, −1, −3, −3, −3, 1, −3, −3, −1, −1, 1},
{−1, 1, −1, −3, −1, 1, 1, −1, 3, −3, −1, −3},
{3, −1, −3, −3, 1, −1, 3, −3, 3, 3, −3, 1},
{−1, 1, −1, −3, 1, 3, −1, −3, −1, 1, 3, 1},
{3, −3, 1, 3, 1, 1, 1, −3, 3, 1, −3, 3},
{3, 3, −1, −1−1, 1, 1, −1, −1, 3, −1, 3},
{1, 3, 1, 3, −1, −1, 1, −3, 1, −1, −3, 3},
{1, −3, 3, 3, 3, 1, −3, −1, 1, 1, 3, −1}, and
{−3, 3, −3, −1, 1, −3, 1, 1, 1, 3, 1, −1};
an equivalent sequence of {sn} is {qn}, wherein qn=sn+un (mod 8), 0<n<11, and
a sequence is one of the following sequences:
{0, 0, 4, 4, 0, 0, 4, 4, 0, 0, 4, 4},
{0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2},
{0, 2, 4, 6, 0, 2, 4, 6, 0, 2, 4, 6},
{0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4},
{0, 4, 4, 0, 0, 4, 4, 0, 0, 4, 4, 0},
{0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6},
{0, 6, 4, 2, 0, 6, 4, 2, 0, 6, 4, 2},
{2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0},
{2, 0, 6, 4, 2, 0, 6, 4, 2, 0, 6, 4},
{2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2},
{2, 2, 6, 6, 2, 2, 6, 6, 2, 2, 6, 6},
{2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4},
{2, 4, 6, 0, 2, 4, 6, 0, 2, 4, 6, 0},
{2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6},
{2, 6, 6, 2, 2, 6, 6, 2, 2, 6, 6, 2},
{4, 0, 0, 4, 4, 0, 0, 4, 4, 0, 0, 4},
{4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0},
{4, 2, 0, 6, 4, 2, 0, 6, 4, 2, 0, 6},
{4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2},
{4, 4, 0, 0, 4, 4, 0, 0, 4, 4, 0, 0},
{4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4},
{4, 6, 0, 2, 4, 6, 0, 2, 4, 6, 0, 2},
{4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6},
{6, 0, 2, 4, 6, 0, 2, 4, 6, 0, 2, 4},
{6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0},
{6, 2, 2, 6, 6, 2, 2, 6, 6, 2, 2, 6},
{6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2},
{6, 4, 2, 0, 6, 4, 2, 0, 6, 4, 2, 0},
{6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4},
{6, 6, 2, 2, 6, 6, 2, 2, 6, 6, 2, 2}, and
{6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

70 more elements

Dependencies are inferred from the claim text.

Facts

Application: 16/563,368Filed 6 Sep 2019
Priority: CN 201710199625.924 Mar 2017
Published: 2 Jan 2020
Term ends: Not estimatedThe source records don’t support an estimate.

Classification7 codes

H04L 27/2621
Peak power aspects: reduction thereof using phase offsets between subcarriers
H04L 5/0007
Time-frequency: the frequencies being orthogonal, e.g. OFDM or DMT
H04L 5/0044
Arrangements for allocating sub-channels of the transmission path: allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH
H04L 27/2607
Symbol extensions, e.g. Zero Tail, Unique Word [UW]: cyclic extensions

Family

Application16/563,368Continuation
US 10,972,236 B2Related patent
US 2020/0007284 A1This patent

From the US filing history. Foreign family members aren’t listed.

Timeline

Citations

Open elsewhere

Building an agent or pulling many patents? Use the API or MCP server instead of scraping pages. Get an API key