I/Q DOMAIN MODULATION METHOD, DUAL DOMAIN MODULATION METHOD, AND MULTIPLE ACCESS COMMUNICATION METHOD

Abstract

A spatial position-dependent I/Q domain modulation method, dual domain modulation method and multiple access communication method are provided. The methods eliminate the dependence of physical layer secure communication on channel state information, and realize the function that a receiver at an expected position can communicate normally, while an eavesdropper at other positions cannot receive a signal or can only receive a wrong signal. The security capability of a wireless communication system is improved from the spatial dimension. The multiple access communication method can realize the distinguishing of multiple users according to precise spatial position points. Even if a plurality of users are located in the same sector in an angular domain, as long as the spatial positions of these users are different, the method can be used to perform multiple access communication, thereby further improving the spatial multiplexing rate of the system and increasing the system capacity.

Claims

1. A spatial position-dependent I/Q domain modulation method, based on a transmitter, a receiver and a plurality of channel resources, wherein the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used for the transmitter and the receiver, the channel resources comprise time-domain, frequency-domain, space-domain and code-domain resources, and the method comprises the following steps: S1: performing a time synchronization on the transmitter and the receiver to obtain a synchronization time; S2: performing, by the transmitter, an I/Q domain precoding operation on the original signal to obtain an I/Q domain pre-coded signal, and transmitting, by the transmitter, the I/Q domain pre-coded signal to the receiver by using the plurality of channel resources; wherein in S2, the I/Q domain precoding operation comprises the following steps: S2-1: generating, by the transmitter, an I/Q domain high-dimensional precoding signal (t+) according to the synchronization time t and a transmission delay to the receiver: wherein .sub.i(t+) represents an i.sup.th dimension of the I/Q domain high-dimensional precoding signal, i=1, 2, . . . , M, M represents a number of dimensions of the I/Q domain high-dimensional precoding signal, and M does not exceed a number of the channel resources, wherein j={square root over (1)}, 1mL, L represents a number of I/Q domain precoding layers, L1, k.sub.m represents an index of an m.sup.th layer of I/Q domain precoding branches, 1k.sub.mM.sub.m, M.sub.m represents a number of the m.sup.th layer of I/O domain precoding branches, $M_{1} M_{2} .Math. M_{L} = M and k_{L} + {.Math.}_{m = 1}^{L - 1} [(k_{m} - 1) {.Math.}_{l = m + 1}^{L} M_{l}] = i$ are met, and f.sub.m represents a frequency increment of the m.sup.th layer; S2-2: performing high-dimensional mapping on the original signal s.sub.0(t) to obtain a high-dimensional original signal s(t): wherein a number of dimensions of the high-dimensional original signal is M, and s.sub.i(t) represents an i.sup.th dimension of the high-dimensional original signal; and S2-3: processing the high-dimensional original signal according to a high-dimensional precoding signal to obtain an I/Q domain pre-coded signal x(t): wherein x.sub.i(t) represents an i.sup.th dimension of the I/Q domain pre-coded signal; and S3: receiving, by the receiver, the I/Q domain pre-coded signal to obtain an I/Q domain initial received signal, and performing an I/Q domain matching operation on the I/Q domain initial received signal to obtain an estimate for the original signal.

2. (canceled)

3. The spatial position-dependent I/Q domain modulation method according to claim 1, wherein in S3, a specific process of the I/Q domain matching operation is as follows: ${\hat{s}}_{0} (t) = [\begin{matrix} _{1}^{*} (t) & _{2}^{*} (t) & .Math. & _{M}^{*} (t) \end{matrix}] [\begin{matrix} {\hat{x}}_{1} (t) \\ {\hat{x}}_{2} (t) \\ .Math. \\ {\hat{x}}_{M} (t) \end{matrix}] = {.Math.}_{i = 1}^{M}_{i}^{*} (t) {\hat{x}}_{i} (t)$ wherein {circumflex over (x)}(t)=[{circumflex over (x)}.sub.1(t) {circumflex over (x)}.sub.2(t) . . . {circumflex over (x)}.sub.M(t)].sup.T represents an I/Q domain initial received signal, a superscript T represents transposition, $_{i}^{*} (t) = {.Math.}_{m = 1}^{L} \exp [j 2 (k_{m} - 1) f_{m} t],$ * represents conjugation, and .sub.0(t) represents an estimate for the original signal.

4. The spatial position-dependent I/Q domain modulation method according to claim 1, wherein in S2-2, a high-dimensional mapping method comprises: a first method: $s_{i} (t) = \frac{1}{M} s_{0} (t);$ and a second method: $s_{i} (t) = \frac{1}{M} s_{0} (t) + n_{i} (t),$ wherein n.sub.i(t) is an i.sup.th I/Q domain random offset signal and meets that [n.sub.1(t) n.sub.2(t) . . . n.sub.M(t)].sup.T is located in a solution space of an equation ${.Math.}_{i = 1}^{M} n_{i} (t) = 0.$

5. A spatial position-dependent dual domain modulation method, based on a transmitter, a receiver and a plurality of channel resources, wherein the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used for the transmitter and the receiver, the channel resources comprise time-domain, frequency-domain, space-domain and code-domain resources, and the method comprises the following steps: S1: performing a time synchronization on the transmitter and the receiver to obtain a synchronization time; S2: performing, by the transmitter, an I/Q domain precoding operation on the original signal to obtain an I/Q domain pre-coded signal, performing, by the transmitter, a phase domain precoding operation on the I/Q domain pre-coded signal to obtain a phase domain pre-coded signal, and transmitting, by the transmitter, the phase domain pre-coded signal to the receiver by using the plurality of channel resources; and S3: receiving, by the receiver, the phase domain pre-coded signal to obtain a phase domain initial received signal, performing a phase domain matching operation on the phase domain initial received signal to obtain a phase domain matched signal, and performing, by the receiver, an I/Q domain matching operation on the phase domain matched signal to obtain an estimate for the original signal.

6. The spatial position-dependent dual domain modulation method according to claim 5, wherein in S2, the I/Q domain precoding operation comprises the following steps: S2-1: generating, by the transmitter, an I/Q domain high-dimensional precoding signal (t+) according to the synchronization time t and a transmission delay to the receiver: $(t +) = [\begin{matrix} _{1} (t +) \\ _{2} (t +) \\ .Math. \\ _{M} (t +) \end{matrix}]$ wherein .sub.i(t+) represents an i.sup.th dimension of the high-dimensional precoding signal, i=1, 2, . . . , M, M represents a number of dimensions of the high-dimensional precoding signal, and M does not exceed a number of the channel resources, $_{i} (t +) = {.Math.}_{m = 1}^{L} \exp [- j 2 (k_{m} - 1) f_{m} (t +)]$ wherein j={square root over (1)}, 1mL, L represents a number of I/Q domain precoding layers, L1, k.sub.m represents an index of an m.sup.th layer of I/Q domain precoding branches, 1k.sub.mM.sub.m, M.sub.m represents a number of the m.sup.th layer of I/O domain precoding branches M.sub.1M.sub.2 . . . M.sub.L=M and $k_{L} + {.Math.}_{m = 1}^{L - 1} [(k_{m} - 1) {.Math.}_{l = m + 1}^{L} M_{l}] = i$ are met, and f.sub.m represents a frequency increment of the m.sup.th layer; S2-2: performing high-dimensional mapping on the original signal to obtain a high-dimensional original signal s(t): $s (t) = [\begin{matrix} s_{1} (t) \\ s_{2} (t) \\ .Math. \\ s_{M} (t) \end{matrix}], {.Math.}_{i = 1}^{M} s_{i} (t) = s_{0} (t)$ wherein a number of dimensions of the high-dimensional original signal is M, and s.sub.i(t) represents an i.sup.th dimension of the high-dimensional original signal; and S2-3: processing the high-dimensional original signal according to the I/Q domain high-dimensional precoding signal to obtain an I/Q domain pre-coded signal x(t): $x (t) = [\begin{matrix} x_{1} (t) \\ x_{2} (t) \\ .Math. \\ x_{M} (t) \end{matrix}] = [\begin{matrix} s_{1} (t)_{1} (t +) \\ s_{2} (t)_{2} (t +) \\ .Math. \\ s_{M} (t)_{M} (t +) \end{matrix}]$ wherein x.sub.i(t) represents an i.sup.th dimension of the I/Q domain pre-coded signal; and the phase domain precoding operation comprises the following steps: S2-4: generating, by the transmitter, a phase domain high-dimensional precoding signal (t+) according to the synchronization time t and a transmission delay to the receiver: $(t +) = [\begin{matrix} _{1} (t +) \\ _{2} (t +) \\ .Math. \\ _{N} (t +) \end{matrix}]$ wherein .sub.j(t+) represents a j.sup.th dimension of the high-dimensional precoding signal, j=1, 2, . . . , N, N represents a number of dimensions of the high-dimensional precoding signal, and MN does not exceed the number of the channel resources, $_{j} (t +) = + {.Math.}_{p = 1}^{T} A_{p, n_{p}} \cos [2 (n_{p} - 1) f_{p} (t +)]$ wherein T represents a number of phase domain precoding layers, T1, 1pT, n.sub.p represents an index of a p.sup.th layer of phase domain precoding branches, 1n.sub.pN.sub.p represents a number of the p.sup.th layer of phase domain precoding branches, N.sub.1N.sub.2 . . . N.sub.T=N and $n_{T} + {.Math.}_{p = 1}^{T - 1} [(n_{p} - 1) {.Math.}_{l = p + 1}^{T} N_{l}] = j$ are met, f.sub.p represents a frequency increment of the p.sup.th layer, A.sub.p,n.sub.p represents an amplitude of a precoding signal on a n.sub.p.sup.th branch in the p.sup.th layer of phase domain precoding branches, and is a normal number agreed by the transmitter and the receiver in advance and has a value meeting $+ {.Math.}_{p = 1}^{T} A_{p, n_{p}} \cos [2 (n_{p} - 1) f_{p} (t +)] > 0;$ S2-5: performing phase domain high-dimensional mapping on a phase x.sub.i(t) of the i.sup.th dimension of the I/Q domain pre-coded signal to obtain an i.sup.th high-dimensional phase signal x.sub.i(t): $x_{i} (t) = [\begin{matrix} x_{i, 1} (t) \\ x_{i, 2} (t) \\ .Math. \\ x_{i, N} (t) \end{matrix}], {.Math.}_{k = 1}^{N} x_{i, k} (t) = x_{i} (t) \mod (2)$ wherein a number of dimensions of the high-dimensional phase signal is N, x.sub.i,k(t) represents a k.sup.th dimension of the i.sup.th high-dimensional phase signal, k=1, 2, . . . , N, and mod is a remainder function; and S2-6: processing the i.sup.th high-dimensional phase signal according to the phase domain high-dimensional precoding signal to obtain an i.sup.th phase domain pre-coded signal: $_{i} (t) = [\begin{matrix} _{i, 1} (t) \\ _{i, 2} (t) \\ .Math. \\ _{i, N} (t) \end{matrix}] = [\begin{matrix} \exp [j x_{i, 1} (t)_{1} (t +)] \\ \exp [j x_{i, 2} (t)_{2} (t +)] \\ .Math. \\ \exp [j x_{i, N} (t)_{N} (t +)] \end{matrix}]$ wherein .sub.i,k(t) represents a k.sup.th dimension of the i.sup.th phase domain pre-coded signal, and combining, by the transmitter, the i.sup.th phase domain pre-coded signal into a phase domain pre-coded signal: $(t) = [\begin{matrix} _{1} (t) \\ _{2} (t) \\ .Math. \\ _{M} (t) \end{matrix}] .$

7. The spatial position-dependent dual domain modulation method according to claim 6, wherein in S3, a specific process of the phase domain matching operation is as follows: $\begin{matrix} {\hat{x}}_{i} (t) = \exp {j [\begin{matrix} _{1} (t) & _{2} (t) & .Math. & _{N} (t) \end{matrix}] [\begin{matrix} {\hat{}}_{i, 1} (t) \\ {\hat{}}_{i, 2} (t) \\ .Math. \\ {\hat{}}_{i, N} (t) \end{matrix}]} \\ = \exp [j {.Math.}_{k = 1}^{N}_{k} (t) {\hat{}}_{i, k} (t)] \end{matrix}$ $\hat{} (t) = [\begin{matrix} {\hat{}}_{1} (t) \\ {\hat{}}_{2} (t) \\ .Math. \\ {\hat{}}_{M} (t) \end{matrix}], {\hat{}}_{i} (t) = [\begin{matrix} {\hat{}}_{i, 1} (t) \\ {\hat{}}_{i, 2} (t) \\ .Math. \\ {\hat{}}_{i, N} (t) \end{matrix}]$ wherein {circumflex over ()}(t) represents a phase domain initial received signal, a superscript T represents transposition, .sub.j(t) represents a matched signal corresponding to .sub.j(t+) and has a value meeting $_{i} (t) {+ {.Math.}_{p = 1}^{T} A_{p, n_{p}} \cos [2 (n_{p} - 1) f_{p} t]} = 1 \mod (2),$ {circumflex over (x)}.sub.i(t) represents an i.sup.th dimension of the phase domain matched signal, and the phase domain matched signal is {circumflex over (x)}(t)=[{circumflex over (x)}.sub.1(t) {circumflex over (x)}.sub.2(t) . . . {circumflex over (x)}.sub.M(t)].sup.T; a specific process of the I/Q domain matching operation is as follows: ${\hat{s}}_{0} (t) = [\begin{matrix} _{1}^{*} (t) & _{2}^{*} (t) & .Math. & _{M}^{*} (t) \end{matrix}] [\begin{matrix} {\hat{x}}_{1} (t) \\ {\hat{x}}_{2} (t) \\ .Math. \\ {\hat{x}}_{M} (t) \end{matrix}] = {.Math.}_{i = 1}^{M}_{i}^{*} (t) {\hat{x}}_{i} (t)$ wherein $_{i}^{*} (t) = {.Math.}_{m = 1}^{L} \exp [j 2 (k_{m} - 1) f_{m} t],$ * represents conjugation, and .sub.0(t) represents an estimate for the original signal; in S2-2, a high-dimensional mapping method comprises: a first method: $s_{i} (t) = \frac{1}{M} s_{0} (t);$ and a second method: $s_{i} (t) = \frac{1}{M} s_{0} (t) + n_{i} (t),$ wherein .sub.k(t) is an i.sup.th I/Q domain random offset signal and meets that [.sub.1(t) .sub.2(t) . . . .sub.N(t)].sup.T is located in a solution space of an equation ${.Math.}_{i = 1}^{M} n_{i} (t) = 0;$ and in S2-5, a phase domain high-dimensional mapping method comprises: a first method: $x_{i, k} (t) = \frac{1}{N} x_{i} (t);$ and a second method: $x_{i, k} (t) = \frac{1}{N} x_{i} (t) +_{k} (t),$ wherein .sub.k(t) is a k.sup.th phase domain random offset signal and meets that [.sub.1(t) .sub.2(t) . . . .sub.N(t)].sup.T is located in a solution space of an equation ${.Math.}_{k = 1}^{N}_{k} (t) = 0.$

8. A position-based multiple access communication method, based on a transmitter, a receiver and a plurality of channel resources, wherein the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used for the transmitter and the receiver, the channel resources comprise time-domain, frequency-domain, space-domain and code-domain resources, and the method comprises the following steps: S1: performing a time synchronization on the transmitter and several users to obtain a synchronization time t; S2: mapping, by the transmitter, an original signal of a u.sup.th user to a u.sup.th high-dimensional original signal, wherein the u.sup.th high-dimensional original signal is as follows: $s (u, t) = [\begin{matrix} s_{1} (u, t) \\ s_{2} (u, t) \\ .Math. \\ s_{M} (u, t) \end{matrix}],$ $s_{1} (u, t) = s_{2} (u, t) = .Math. = s_{M} (u, t) = \frac{s_{0} (u, t)}{\sqrt{M}}$ wherein s.sub.0(u,t) is the original signal of the u.sup.th user, s.sub.i(u,t) is an i.sup.th dimension of the u.sup.th high-dimensional original signal, i=1, 2, . . . , M, M is a dimension of the u.sup.th high-dimensional original signal and has a value equal to a number of the channel resources; S3: performing, by the transmitter, I/Q domain precoding on the u.sup.th high-dimensional original signal to generate a u.sup.th high-dimensional transmission signal, wherein the I/Q domain precoding process is as follows: $x (u, t) = [\begin{matrix} x_{1} (u, t) \\ x_{2} (u, t) \\ .Math. \\ x_{M} (u, t) \end{matrix}] = [\begin{matrix} s_{1} (u, t)_{1} (u, t +_{u}) \\ s_{2} (u, t)_{2} (u, t +_{u}) \\ .Math. \\ s_{M} (u, t)_{M} (u, t +_{u}) \end{matrix}]$ wherein x(u,t) represents the u.sup.th high-dimensional transmission signal, x.sub.i(u,t) represents an i.sup.th dimension of the u.sup.th high-dimensional transmission signal, .sub.i(t+) represents an i.sup.th dimension of a u.sup.th precoding signal, i=1, 2, . . . , M, M and .sub.u represents a transmission delay from the transmitter to the u.sup.th user; S4: summing, by the transmitter, all the u.sup.th high-dimensional transmission signals to obtain a high-dimensional total transmission signal: $\tilde{x} (t) = {.Math.}_{u = 1}^{U} x (u, t)$ wherein U represents a number of users; broadcasting, by the transmitter, the high-dimensional total transmission signal to a plurality of users by using the channel resources, each of the channel resources transmitting one dimension of the high-dimensional total transmission signal; and S5: receiving, by the u.sup.th user, the high-dimensional total transmission signal to obtain a high-dimensional total receiving signal, and performing an I/Q domain matching operation on the high-dimensional total receiving signal to obtain an estimate .sub.0(u,t) for a u.sup.th original signal.

9. The position-based multiple access communication method according to claim 8, wherein in S3, the u.sup.th precoding signal is as follows: $(u, t +) = [\begin{matrix} _{1} (u, t +_{u}) \\ _{2} (u, t +_{u}) \\ .Math. \\ _{M} (u, t +_{u}) \end{matrix}],$ and the dimension of the u.sup.th precoding signal is as follows: $? (u, t +_{u}) = {.Math.}_{m = 1}^{L} \exp (- j 2 (k_{m} - 1) f_{m} (t +_{u}))$ $? indicates text missing or illegible when filed$ wherein, L represents a number of I/Q domain precoding layers, L1, k.sub.m represents an index of an m.sup.th layer of I/Q domain precoding branches, 1k.sub.mM.sub.m, M.sub.m represents a number of the m.sup.th layer of I/Q domain precoding branches, M.sub.1M.sub.2 . . . M.sub.L=M and $k_{L} + {.Math.}_{m = 1}^{L - 1} [(k_{m} - 1) ?] = i$ $? indicates text missing or illegible when filed$ are met, and f.sub.m represents a frequency increment of the m.sup.th layer.

10. The position-based multiple access communication method according to claim 9, wherein in S5, an I/Q domain matching process is as follows: $\hat{\tilde{x}} (t) = [\begin{matrix} {\tilde{x}}_{1} (t) \\ {\tilde{x}}_{2} (t) \\ .Math. \\ {\tilde{x}}_{M} (t) \end{matrix}]$ ${\hat{s}}_{0} (u, t) = ? (u, t) ? (t)$ $? indicates text missing or illegible when filed$ wherein *.sub.i (u,t) represents an i.sup.th dimension of a u.sup.th matched signal, {circumflex over ({tilde over (x)})}(t) represents the high-dimensional total receiving signal, and {circumflex over ({tilde over (x)})}.sub.i(t) represents an i.sup.th dimension of the high-dimensional total receiving signal; the u.sup.th matched signal is as follows: $^{*} (u, t) = [\begin{matrix} _{1}^{*} (u, t) \\ _{2}^{*} (u, t) \\ .Math. \\ _{M}^{*} (u, t) \end{matrix}],$ and the i.sup.th dimension of the u.sup.th matched signal is as follows: $? (u, t) = {.Math.}_{m = 1}^{L} \exp (j 2 (k_{m} - 1) f_{m} t) .$ $? indicates text missing or illegible when filed$

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0080] FIGS. 1A and 1B are schematic flowcharts of a method according to Embodiment 2 of the present invention.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0081] The present invention is further described with reference to the accompanying drawings and embodiments.

Embodiment 1

[0082] This embodiment provides a spatial position-dependent I/Q domain modulation method, which is based on a transmitter, a receiver and a plurality of channel resources, where the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used for the transmitter and the receiver, and the channel resources include time-domain, frequency-domain, space-domain and code-domain resources.

[0083] The method in this embodiment includes the following steps: [0084] S1: time synchronization is performed on the transmitter and the receiver to obtain a synchronization time; [0085] S2: performing, by the transmitter, an I/Q domain precoding operation on the original signal to obtain an I/Q domain pre-coded signal, and transmitting, by the transmitter, the I/Q domain pre-coded signal to the receiver by using the plurality of channel resources; and [0086] S3: the receiver receives the I/Q domain pre-coded signal to obtain an I/Q domain initial received signal, and an I/Q domain matching operation is performed on the I/Q domain initial received signal to obtain an estimate for the original signal.

[0087] In S2, the I/Q domain precoding operation includes the following steps: [0088] S2-1: the transmitter generates an I/Q domain high-dimensional precoding signal (t+) according to the synchronization time t and a transmission delay to the receiver:

[00041] $(t +) = [\begin{matrix} _{1} (t +) \\ _{2} (t +) \\ .Math. \\ _{M} (t +) \end{matrix}]$ [0089] where .sub.i(t+) represents the i.sup.th dimension of the I/Q domain high-dimensional precoding signal, i=1, 2, . . . , M, M represents the number of dimensions of the I/Q domain high-dimensional precoding signal, and M does not exceed the number of the channel resources,

[00042] $_{1} (t +) = {.Math.}_{m = 1}^{L} \exp [- j 2 (k_{m} - 1) f_{m} (t +)] .$ [0090] where j={square root over (1)}, 1mL, L represents the number of I/Q domain precoding layers, L1, k.sub.m represents an index of the m.sup.th layer of I/Q domain precoding branches, 1k.sub.mM.sub.m, M.sub.m represents the number of the m.sup.th layer of I/Q domain precoding branches, M.sub.1M.sub.2 . . . M.sub.L=M and

[00043] $k_{L} + {.Math.}_{m = 1}^{L - 1} [(k_{m} - 1) {.Math.}_{l = m + 1}^{L} M_{l}] = i$ are met, and f.sub.m represents a frequency increment of the m.sup.th layer determined in advance; [0091] S2-2: high-dimensional mapping is performed on the original signal s.sub.0(t) to obtain a high-dimensional original signal s(t):

[00044] $s (t) = [\begin{matrix} s_{1} (t) \\ s_{2} (t) \\ .Math. \\ s_{M} (t) \end{matrix}], {.Math.}_{i = 1}^{M} {s_{i}}_{} (t) = s_{0} (t)$ [0092] where the number of dimensions of the high-dimensional original signal is M, and s.sub.i(t) represents the i.sup.th dimension of the high-dimensional original signal; and [0093] S2-3: the high-dimensional original signal is processed according to the high-dimensional precoding signal to obtain an I/Q domain pre-coded signal x(t):

[00045] $x (t) = [\begin{matrix} x_{1} (t) \\ x_{2} (t) \\ .Math. \\ x_{M} (t) \end{matrix}] = [\begin{matrix} s_{1} (t)_{1} (t +) \\ s_{2} (t)_{2} (t +) \\ .Math. \\ s_{M} (t)_{M} (t +) \end{matrix}]$ [0094] where x.sub.i(t) represents the dimension of the I/Q domain pre-coded signal.

[0095] In S3, ta specific process of the I/Q domain matching operation is as follows:

[00046] ${\hat{s}}_{0} (t) = [\begin{matrix} _{1}^{*} (t) & _{2}^{*} (t) & .Math. & _{M}^{*} (t) \end{matrix}] [\begin{matrix} {\hat{x}}_{1} (t) \\ {\hat{x}}_{2} (t) \\ .Math. \\ {\hat{x}}_{M} (t) \end{matrix}] = {.Math.}_{i = 1}^{M}_{i}^{*} (t) {\hat{x}}_{i} (t)$ [0096] where {circumflex over (x)}(t)=[{circumflex over (x)}.sub.1(t) {circumflex over (x)}.sub.2(t) . . . {circumflex over (x)}.sub.M(t)].sup.T represents an I/Q domain initial received signal, a superscript T represents transposition,

[00047] $_{i}^{*} (t) = {.Math.}_{m = 1}^{L} \exp [j 2 (k_{m} - 1) f_{m} t],$ [0097] * represents conjugation, and .sub.0(t) represents an estimate for the original signal.

[0098] In S2-2, the high-dimensional mapping method comprises: [0099] a first method:

[00048] $s_{i} (t) = \frac{1}{M} s_{0} (t);$ and [0100] a second method:

[00049] $s_{i} (t) = \frac{1}{M} s_{0} (t) + n_{i} (t),$ where n.sub.i(t) is an i.sup.th I/Q domain random offset signal and meets that [n.sub.1(t) n.sub.2(t) . . . n.sub.M(t)].sup.T is located in a solution space of an equation

[00050] ${.Math.}_{i = 1}^{M} n_{i} (t) = 0.$

[0101] Further, the transmitter adopts a narrow-beam antenna to be pointed at the receiver.

Embodiment 2

[0102] This embodiment provides a spatial position-dependent dual domain modulation method, which is based on a transmitter, a receiver and a plurality of channel resources, where the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used for the transmitter and the receiver, and the channel resources include time-domain, frequency-domain, space-domain and code-domain resources.

[0103] The schematic flowcharts of the method in this embodiment are shown in FIGS. 1A and 1B, including the following steps: [0104] S1: time synchronization is performed on the transmitter and the receiver to obtain a synchronization time; [0105] S2: the transmitter performs an I/Q domain precoding operation on the original signal to obtain an I/Q domain pre-coded signal, the transmitter performs a phase domain precoding operation on the I/Q domain pre-coded signal to obtain a phase domain pre-coded signal, and the transmitter transmits the phase domain pre-coded signal to the receiver by using the plurality of channel resources; and [0106] S3: the receiver receives the phase domain pre-coded signal to obtain a phase domain initial received signal, a phase domain matching operation is performed on the phase domain initial received signal to obtain a phase domain matched signal, and the receiver performs an I/Q domain matching operation on the phase domain matched signal to obtain an estimate for the original signal.

[0107] In S2, the I/Q domain precoding operation includes the following steps: [0108] S2-1: the transmitter generates an I/Q domain high-dimensional precoding signal (t+) according to the synchronization time t and a transmission delay to the receiver.

[00051] $(t +) = [\begin{matrix} _{1} (t +) \\ _{2} (t +) \\ .Math. \\ _{M} (t +) \end{matrix}]$ [0109] where .sub.i(t+) represents the i.sup.th dimension of the high-dimensional precoding signal, i=1, 2, . . . , M, M represents the number of dimensions of the high-dimensional precoding signal, and M does not exceed the number of the channel resources,

[00052] $_{i} (t +) = {.Math.}_{m = 1}^{L} \exp [- j 2 (k_{m} - 1) f_{m} (t +)] .$ [0110] where j={square root over (1)}, 1mL, L represents the number of I/Q domain precoding layers, L1, k.sub.m represents an index of the m.sup.th layer of I/Q domain precoding branches, 1k.sub.mM.sub.m, M.sub.m represents the number of the m.sup.th layer of I/Q domain precoding branches, M.sub.1M.sub.2 . . . M.sub.L=M and

[00053] $k_{L} + {.Math.}_{m = 1}^{L - 1} [(k_{m} - 1) {.Math.}_{l = m + 1}^{L} M_{l}] = i$ are met, and f.sub.m represents a frequency increment of the m.sup.th layer determined in advance; [0111] S2-2: high-dimensional mapping is performed on the original signal s.sub.0(t) to obtain a high-dimensional original signal s(t):

[00054] $s (t) = [\begin{matrix} s_{1} (t) \\ s_{2} (t) \\ .Math. \\ s_{M} (t) \end{matrix}], {.Math.}_{i = 1}^{M} {s_{i}}_{} (t) = s_{0} (t)$ [0112] where the number of dimensions of the high-dimensional original signal is M, and s.sub.i(t) represents the i.sup.th dimension of the high-dimensional original signal; and [0113] S2-3: the high-dimensional original signal is processed according to the I/Q domain high-dimensional precoding signal to obtain an I/Q domain pre-coded signal x(t):

[00055] $x (t) = [\begin{matrix} x_{1} (t) \\ x_{2} (t) \\ .Math. \\ x_{M} (t) \end{matrix}] = [\begin{matrix} s_{1} (t)_{1} (t +) \\ s_{2} (t)_{2} (t +) \\ .Math. \\ s_{M} (t)_{M} (t +) \end{matrix}]$ [0114] where x.sub.i(t) represents the i.sup.th dimension of the I/Q domain pre-coded signal.

[0115] The phase domain precoding operation includes the following steps: [0116] S2-4: the transmitter generates a phase domain high-dimensional precoding signal (t+) according to the synchronization time t and a transmission delay to the receiver:

[00056] $(t +) = [\begin{matrix} _{1} (t +) \\ _{2} (t +) \\ .Math. \\ _{N} (t +) \end{matrix}]$ [0117] where .sub.j(t+) represents the j.sup.th dimension of the high-dimensional precoding signal, j=1, 2, . . . , N, N represents the number of dimensions of the high-dimensional precoding signal, and MN does not exceed the number of the channel resources,

[00057] $_{j} (t +) = + {.Math.}_{p = 1}^{T} A_{p, n_{p}} \cos [2 (n_{p} - 1) f_{p} (t +)]$ [0118] where T represents the number of phase domain precoding layers, T1, 1pT, n.sub.p represents an index of the p.sup.th layer of phase domain precoding branches, 1n.sub.pN.sub.p N.sub.p represents the number of the p.sup.th layer of phase domain precoding branches,

[00058] $N_{1} N_{2} .Math. N_{T} = N and n_{T} + {.Math.}_{p = 1}^{T - 1} [(n_{p} - 1) \overset{T}{\underset{l = p + 1}{.Math.}} N_{l}] = j$ are met, f.sub.p represents a frequency increment of the p.sup.th layer determined in advance, A.sub.p,n.sub.p represents an amplitude of a precoding signal on the n.sub.p.sup.th branch in the p.sup.th layer of phase domain precoding branch and has a value determined in advance, and is a normal number agreed by the transmitter and the receiver in advance and has a value meeting

[00059] $+ \overset{T}{\underset{p = 1}{.Math.}} A_{p, n_{p}} \cos [2 (n_{p} - 1) f_{p} (t +)] > 0;$ [0119] S2-5: phase domain high-dimensional mapping is performed on a phase, x.sub.i(t) of the i.sup.th dimension of the I/Q domain pre-coded signal to obtain an i.sup.th high-dimensional phase signal x.sub.i(t):

[00060] $x_{i} (t) = [\begin{matrix} x_{i, 1} (t) \\ x_{i, 2} (t) \\ .Math. \\ x_{i, N} (t) \end{matrix}], {.Math.}_{k = 1}^{N} x_{i, k} (t) = x_{i} (t) \mod (2)$ [0120] where the number of dimensions of the high-dimensional phase signal is N, x.sub.i,k(t) represents the k.sup.th dimension of the i.sup.th II high-dimensional phase signal, k=1, 2, . . . , N, and mod is a remainder function; and [0121] S2-6: the i.sup.th high-dimensional phase signal is processed according to the phase domain high-dimensional precoding signal to obtain an i.sup.th phase domain pre-coded signal .sub.i(t):

[00061] $_{i} (t) = [\begin{matrix} _{i, 1} (t) \\ _{i, 2} (t) \\ .Math. \\ _{i, N} (t) \end{matrix}] = [\begin{matrix} \exp [j x_{i, 1} (t)_{1} (t +)] \\ \exp [j x_{i, 2} (t)_{2} (t +)] \\ .Math. \\ \exp [j x_{i, N} (t)_{N} (t +)] \end{matrix}]$ [0122] where .sub.i,k(t) represents the k.sup.th dimension of the i.sup.th phase domain pre-coded signal, and [0123] the transmitter combines the i.sup.th phase domain pre-coded signal into a phase domain pre-coded signal:

[00062] $(t) = [\begin{matrix} _{1} (t) \\ _{2} (t) \\ .Math. \\ _{M} (t) \end{matrix}]$

[0124] In S3, a specific process of the phase domain matching operation is as follows:

[00063] ${\hat{x}}_{i} (t) = \exp {j \begin{matrix} [_{1} (t) & _{2} (t) & .Math. & _{N} (t)] \end{matrix} [\begin{matrix} {\hat{}}_{i, 1} (t) \\ {\hat{}}_{i, 2} (t) \\ .Math. \\ {\hat{}}_{i, N} (t) \end{matrix}]} = \exp [j {.Math.}_{k = 1}^{N}_{k} (t) {\hat{}}_{i, k} (t)]$ $\hat{} (t) = [\begin{matrix} {\hat{}}_{1} (t) \\ {\hat{}}_{2} (t) \\ .Math. \\ {\hat{}}_{M} (t) \end{matrix}], {\hat{}}_{i} (t) = [\begin{matrix} {\hat{}}_{i, 1} (t) \\ {\hat{}}_{i, 2} (t) \\ .Math. \\ {\hat{}}_{i, N} (t) \end{matrix}]$ [0125] where {circumflex over ()}(t) represents a phase domain initial received signal, a superscript T represents transposition, .sub.j(t) represents a matched signal corresponding to .sub.j(t+) and has a value meeting

[00064] $_{i} (t) {+ \overset{T}{\underset{p = 1}{.Math.}} A_{p, n_{p}} \cos [2 (n_{p} - 1) f_{p} t]} = 1 \mod (2), {\hat{x}}_{i} (t)$ represents the i.sup.th dimension of the phase domain matched signal, and the phase domain matched signal is {circumflex over (x)}(t)=[{circumflex over (x)}.sub.1(t) {circumflex over (x)}.sub.2(t) . . . {circumflex over (x)}.sub.M(t)].sup.T.

[0126] A specific process of the I/Q domain matching operation is as follows:

[00065] ${\hat{s}}_{0} (t) = [\begin{matrix} _{1}^{*} (t) & _{2}^{*} (t) & .Math. & _{M}^{*} (t) \end{matrix}] [\begin{matrix} {\hat{x}}_{1} (t) \\ {\hat{x}}_{2} (t) \\ .Math. \\ {\hat{x}}_{M} (t) \end{matrix}] = {.Math.}_{i = 1}^{M}_{i}^{*} (t) {\hat{x}}_{i} (t)$ [0127] where

[00066] $_{i}^{*} (t) = \overset{L}{\underset{m = 1}{.Math.}} \exp [j 2 (k_{m} - 1) f_{m} t],$ * represents conjugation, and represents an estimate for the original signal.

[0128] In S2-2, the high-dimensional mapping method comprises: [0129] a first method:

[00067] $s_{i} (t) = \frac{1}{M} s_{0} (t);$ and [0130] a second method:

[00068] $s_{i} (t) = \frac{1}{M} s_{0} (t) + n_{i} (t),$ [0131] where n.sub.i(t) is an i.sup.th I/Q domain random offset signal and meets that [n.sub.1(t) n.sub.2(t) . . . n.sub.M(t)].sup.T is located in a solution space of an equation

[00069] ${.Math.}_{i = 1}^{M} n_{i} (t) = 0.$

[0132] In S2-5, the phase domain high-dimensional mapping method comprises: [0133] a first method:

[00070] $x_{i, k} (t) = \frac{1}{N} x_{i} (t);$ and [0134] a second method:

[00071] $x_{i, k} (t) = \frac{1}{N} x_{i} (t) +_{k} (t),$ where .sub.k(t) is a k.sup.th phase domain random offset signal and meets that [.sub.1(t) .sub.2(t) . . . .sub.N(t)].sup.T is located in a solution space of an equation

[00072] ${.Math.}_{k = 1}^{N}_{k} (t) = 0.$

[0135] Further, the transmitter adopts a narrow-beam antenna to be pointed at the receiver.

Embodiment 3

[0136] This embodiment provides a position-based multiple access communication method, which is based on a transmitter, a receiver and a plurality of channel resources, where the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used for the transmitter and the receiver, and the channel resources include time-domain, frequency-domain, space-domain and code-domain resources.

[0137] The method in this embodiment includes the following steps: [0138] S1: time synchronization is performed on the transmitter and several users to obtain a synchronization time t; [0139] S2: mapping, by the transmitter, an original signal of a u.sup.th user to a u.sup.th high-dimensional original signal, where the u.sup.th high-dimensional original signal is as follows:

[00073] $s (u, t) = [\begin{matrix} s_{1} (u, t) \\ s_{2} (u, t) \\ .Math. \\ s_{M} (u, t) \end{matrix}], s_{1} (u, t) = s_{2} (u, t) = .Math. = s_{M} (u, t) = \frac{s_{0} (u, t)}{\sqrt{M}}$ [0140] where s.sub.0(u,t) is the original signal of the u.sup.th user, s.sub.i(u,t) is the i.sup.th dimension of the u.sup.th high-dimensional original signal, i=1, 2, . . . , M, and M is the dimension of the u.sup.th high-dimensional original signal and has a value equal to the number of the channel resources; [0141] S3: the transmitter performs I/Q domain precoding on the u.sup.th high-dimensional original signal to generate a u.sup.th high-dimensional transmission signal, where the I/Q domain precoding process is as follows:

[00074] $x (u, t) = [\begin{matrix} x_{1} (u, t) \\ x_{2} (u, t) \\ .Math. \\ x_{M} (u, t) \end{matrix}] = [\begin{matrix} s_{1} (u, t)_{1} (u, t +_{u}) \\ s_{2} (u, t)_{2} (u, t +_{u}) \\ .Math. \\ s_{M} (u, t)_{M} (u, t +_{u}) \end{matrix}]$ [0142] where, x(u,t) represents the u.sup.th high-dimensional transmission signal, x.sub.i(u,t) represents the i.sup.th dimension of the u.sup.th high-dimensional transmission signal, .sub.i(t+) represents the i.sup.th dimension of the u.sup.th precoding signal, i=1, 2, . . . , M, and .sub.u represents a transmission delay from the transmitter to the u.sup.th user; [0143] S4: the transmitter sums all the u.sup.th high-dimensional transmission signals to obtain a high-dimensional total transmission signal:

[00075] $\tilde{x} (t) = {.Math.}_{u = 1}^{U} x (u, t)$ [0144] where U represents the number of users; broadcasting, by the transmitter, the high-dimensional total transmission signal to a plurality of users by using the channel resources, where each of the channel resources transmits one dimension of the high-dimensional total transmission signal; and [0145] S5: a u.sup.th user receives the high-dimensional total transmission signal to obtain a high-dimensional total receiving signal, and an I/Q domain matching operation is performed on the high-dimensional total receiving signal to obtain an estimate .sub.0(u,t) for the u.sup.th original signal.

[0146] In S3, the u.sup.th precoding signal is as follows:

[00076] $(u, t +) = [\begin{matrix} _{1} (u, t) +_{u}) \\ _{2} (u, t +_{u}) \\ .Math. \\ _{M} (u, t +_{u}) \end{matrix}]$ [0147] the i.sup.th dimension of the u.sup.th precoding signal is as follows:

[00077] $_{i} (u, t +_{u}) = {.Math.}_{m = 1}^{L} \exp (- j 2 (k_{m} - 1) f_{m} (t +_{u})) .$

[0148] In S5, an I/Q domain matching process is as follows:

[00078] $\hat{\tilde{x}} (t) = [\begin{matrix} {\tilde{x}}_{1} (t) \\ {\tilde{x}}_{2} (t) \\ .Math. \\ {\tilde{x}}_{M} (t) \end{matrix}] {\hat{s}}_{0} (u, t) = {.Math.}_{i = 1}^{M}_{i}^{*} (u, t) {\hat{\tilde{x}}}_{i} (t)$ [0149] where *.sub.i (u,t) represents the i.sup.th dimension of the u.sup.th matched signal, {circumflex over ({tilde over (x)})}(t) represents the high-dimensional total receiving signal, and {circumflex over ({tilde over (x)})}.sub.i(t) represents the i.sup.th dimension of the high-dimensional total receiving signal.

[0150] In S5, the u.sup.th matched signal is as follows:

[00079] $^{*} (u, t) = [\begin{matrix} _{1}^{*} (u, t) \\ _{2}^{*} (u, t) \\ .Math. \\ _{M}^{*} (u, t) \end{matrix}],$

and [0151] the i.sup.th dimension of the u.sup.th matched signal is as follows:

[00080] $_{i}^{*} (u, t) = {.Math.}_{m = 1}^{L} \exp (j 2 (k_{m} - 1) f_{m} t) .$

I/Q DOMAIN MODULATION METHOD, DUAL DOMAIN MODULATION METHOD, AND MULTIPLE ACCESS COMMUNICATION METHOD

Assignee

Inventors

Cpc classification

Classification Explorer

H04J3/0682

ELECTRICITY

Classification Explorer

H04J3/0638

ELECTRICITY

Classification Explorer

H04L27/0014

ELECTRICITY

Classification Explorer

H04L2027/0018

ELECTRICITY

Classification Explorer

H04L2027/0024

ELECTRICITY

Classification Explorer

H04W56/004

ELECTRICITY

International classification

Classification Explorer

H04J3/06

ELECTRICITY

Classification Explorer

H04W56/00

ELECTRICITY

Classification Explorer

H04L27/00

ELECTRICITY

Abstract

Claims

Description