Communication method and apparatus
AssigneeHuawei Technologies Co., Ltd.
InventorsXinqian Xie, Zhonglong Wang
Life of this patent
Estimating the term…
Abstract
A communication method and apparatus are disclosed. The method includes: determining {c(n)(m)} based on {b(n)} and {a(n)(m)}, where an element c(n)(m) in {c(n)(m)} satisfies c(n)(m)=a(n)(m)×b(n) or c(n)(m)=a(n)(m)×B(n), and {B(n)} is obtained by performing a Fourier transform on {b(n)}; determining {e(n)(m)} based on {d(m)} and {c(n)(m)}, where an element e(n)(m) in {e(n)(m)} satisfies e(n)(m)=c(n)(m)×d(m) or e(n)(m)=c(n)(m)×D(m), and {D(m)} is obtained by performing a Fourier transform on {d(m)}; and sending M first signals in M time units, wherein the M first signals are generated based on {e(n)(m)}, an ith first signal among the M first signals is located in an ith time unit among the M time units.
Claims20
A communication method, comprising:
- determining {c(n)(m)} based on {b(n)} and {a(n)(m)}, wherein {b(n)} comprises N elements, and {a(n)(m)} and {c(n)(m)} each comprises N×M elements, n belongs to {1, . . . , N}, m belongs to {1, . . . , M}, and N and M are positive integers;
- determining {e(n)(m)} based on {d(m)} and {c(n)(m)}, wherein {d(m)} comprises M elements, and {e(n)(m)} comprises N×M elements;
- and
- sending M first signals, wherein the M first signals are located in M time units, the M first signals are generated based on {e(n)(m)}, an ith first signal among the M first signals is located in an ith time unit among the M time units, and i is a positive integer less than or equal to M, wherein
- an element c(n)(m) in {c(n)(m)} satisfies c(n)(m)=a(n)(m)×b(n) or c(n)(m)=a(n)(m)×B(n), B(n) belongs to {B(n)}, and {B(n)} is obtained by performing a Fourier transform on {b(n)};
- and an element e(n)(m) in {e(n)(m)} satisfies e(n)(m)=c(n)(m)×d(m) or e(n)(m)=c(n)(m)×D(m), D(m) belongs to {D(m)}, and {D(m)} is obtained by performing a Fourier transform on {d(m)}.
A communication method, comprising:
- receiving M first signals, wherein the M first signals are located in M time units, an ith first signal among the M first signals is located in an ith time unit among the M time units, M is a positive integer, and i is a positive integer less than or equal to M;
- and
- processing the M first signals, wherein
- the M first signals are generated based on {e(n)(m)}, {e(n)(m)} is determined based on {d(m)} and {c(n)(m)}, {c(n)(m)} is determined based on {b(n)} and {a(n)(m)}, {e(n)(m)}, {c(n)(m)}, and {a(n)(m)} each comprises N×M elements, {d(m)} comprises M elements, {b(n)} comprises N elements, n belongs to {1, . . . , N}, m belongs to {1, . . . , M}, and N is a positive integer;
- and
- an element c(n)(m) in {c(n)(m)} satisfies c(n)(m)=a(n)(m)×b(n) or c(n)(m)=a(n)(m)×B(n), B(n) belongs to {B(n)}, and {B(n)} is obtained by performing a Fourier transform on {b(n)};
- and an element e(n)(m) in {e(n)(m)} satisfies e(n)(m)=c(n)(m)×d(m) or e(n)(m)=c(n)(m)×D(m), D(m) belongs to {D(m)}, and {D(m)} is obtained by performing a Fourier transform on {d(m)}.
A communication apparatus, comprising at least one processor;
- and a memory configured to store computer readable instructions that, when executed by the at least one processor, cause the apparatus to:
- determine {c(n)(m)} based on {b(n)} and {a(n)(m)}, wherein {b(n)} comprises N elements, and {a(n)(m)} and {c(n)(m)} each comprises N×M elements, n belongs to {1, . . . , N}, m belongs to {1, . . . , M}, and N and M are positive integers;
- determine {e(n)(m)} based on {d(m)} and {c(n)(m)}, wherein {d(m)} comprises M elements, and {e(n)(m)} comprises N×M elements;
- and
- send M first signals, wherein the M first signals are located in M time units, the M first signals are generated based on {e(n)(m)}, an ith first signal among the M first signals is located in an ith time unit among the M time units, and i is a positive integer less than or equal to M, wherein
- an element c(n)(m) in {c(n)(m)} satisfies c(n)(m)=a(n)(m)×b(n) or c(n)(m)=a(n)(m)×B(n), B(n) belongs to {B(n)}, and {B(n)} is obtained by performing a Fourier transform on {b(n)};
- and an element e(n)(m) in {e(n)(m)} satisfies e(n)(m)=c(n)(m)×d(m) or e(n)(m)=c(n)(m)×D(m), D(m) belongs to {D(m)}, and {D(m)} is obtained by performing a Fourier transform on {d(m)}.
Dependencies are inferred from the claim text.