SIGNAL SENDING AND RECEIVING METHOD, APPARATUS AND SYSTEM IN WIRELESS COMMUNICATIONS

Description

TECHNICAL FIELD

[0001] This application relates to the field of wireless communications technologies, and in particular, to a signal transmission method, signal reception method, apparatus, and system in a wireless communications system.

BACKGROUND

[0002] Technologies based on orthogonal frequency division multiplexing (Orthogonal Frequency Division Multiplexing, OFDM) have advantages in aspects such as eliminating multi-path interference and being compatible with multiple-input multiple-output (Multiple-Input Multiple-Output, MIMO). Currently, such technologies are employed by most present wireless communications systems, such as long term evolution (Long Term Evolution, LTE) and worldwide interoperability for microwave access (Worldwide Interoperability for Microwave Access, WiMAX) systems.

[0003] A next-generation communications system, such as the 5th generation mobile communication (the 5th Generation mobile communication, 5G), allows a physical uplink control channel (Physical Uplink Control CHannel, PUCCH) to be sent together with a reference signal (Reference Signal, RS) and uplink control information (Uplink Control Information, UCI) on an OFDM symbol. Alternatively, two signals need to be transmitted, and information carried on each signal is modulated to be transmitted on respective sequence elements. If the foregoing two signals are still carried by a sequence in a long term evolution (long term evolution, LTE) system, cubic metric (cubic metric, CM)/peak-to-average ratio is increased. However, CM causes a transmitted signal to be distorted when the signal passes through a power amplifier (Power Amplifier, PA), and extra error vector magnitude (Error Vector Magnitude, EVM) is generated at a transmit end, which finally lowers demodulation performance of a receive end. To reduce the EVM of a transmitted signal, actual transmit power usually needs to be reduced, but reduction of the transmit power also lowers the demodulation performance of the receive end. Alternatively, a high peak-to-average ratio (Peak to Average Power Ratio, PAPR) also decreases the transmit power, and therefore lowers the demodulation performance.

[0004] Therefore, a low-CM/PAPR signal transmission method based on an OFDM system is required to improve link quality.

[0005] ZTE et al, "UL Control Structure", vol. RAN WG1, no. Spokane, USA; 20170116 - 20170120, 3GPP DRAFT; R1-1700261, discloses a sequence-based PUCCH design.

SUMMARY

[0006] This specification describes a signal transmission method according to independent claims 1 or 2, signal reception method according to independent claims 7 or 8, apparatus according to independent claim 12, and system used in wireless communication. Additional features of the invention are provided in the dependent claims. In the following, parts of the description and drawings referring to embodiments which are not covered by the claims are not presented as embodiments of the invention, but as examples useful for understanding the invention. In this application, 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 (Orthogonal Frequency Division Multiplexing, OFDM) manner. This application is intended to decrease cubic metric (cubic metric, CM)/peak-to-average ratio of a transmitted signal of an orthogonal frequency division multiplexing (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.

[0007] In an example, the receiving a signal on 2 x N subcarriers includes:

obtaining, on 2 x N contiguous subcarriers, the signal on the 2 x N subcarriers; or obtaining, on 2 x N noncontiguous and equally gapped subcarriers, the signal on the 2 x N subcarriers; where in a way of mapping {f_n} to contiguous or equally gapped subcarriers, a CM value is relatively satisfactory; or

obtaining the signal on the 2 x N subcarriers of a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N contiguous subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier; or obtaining the signal on the 2 x N subcarriers of a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N noncontiguous and equally gapped subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier.

[0008] Optionally, the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers. If the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers, a lower PAPR/CM can be obtained. In addition, better frequency diversity effect is obtained.

[0009] In an example, A₃ and A₄ fall within a value range of {1, -1, j, -j}.

[0010] In an example, the sequence {x_n} is selected from a sequence set J. Because a plurality of cells coexist in a communications system, neighboring cells need to use different sequences to transmit data. Therefore, the sequence set J is required, so that neighboring cells can use different sequences in the sequence set J to reduce interference between the cells.

[0011] It may be understood that the method described in any of the foregoing first to fourth aspects may be implemented through a communications apparatus. The apparatus may be a communications device, or may be a chip. The communications device may be a terminal device, or may be a network device.

[0012] According to an aspect this application provides a communications apparatus. The apparatus may be a communications device, or may be a chip. The communications device may be a terminal, or may be a base station. The communications apparatus may implement the method described in any of the foregoing first to fourth aspects, and has corresponding function units. The function units may be implemented by hardware, may be implemented by software, or may be implemented by hardware by executing corresponding software. The hardware or software includes one or more modules corresponding to the foregoing functions.

[0013] The communications apparatus includes: a processing unit and a storage unit. The storage unit stores an instruction, where the instruction is used to enable the processing unit to perform the method described in any of the foregoing first to fourth aspects. The processing unit may be implemented by one or more processors. The storage unit may be a memory or any other storage module that possesses a storage function. The storage unit may be disposed separately from the processor, or may be integrated with the processor.

[0014] Optionally, the communications apparatus may further include: a transceiver unit, where the transceiver unit includes a sending unit and a receiving unit. The sending unit is configured to send information to a receive device when the communications apparatus serves as a transmit device. The receiving unit is configured to receive information from a transmit device when the communications apparatus serves as a receive device. For example, the transceiver unit may be implemented by a transceiver.

[0015] For example, the sending unit may be configured to send, on 2 x N subcarriers, a signal that carries a sequence {f_n}.

[0016] For another example, the receiving unit may be configured to receive a signal. The processing unit is configured to obtain the signal on the 2 x N subcarriers based on the received signal.

[0017] According to an aspect this application provide a computer storage medium, configured to store a computer software instruction used by the foregoing communications apparatus, where the computer software instruction includes a program designed for executing the foregoing first aspect or second aspect or third aspect or fourth aspect.

[0018] According to P an aspect this application provides a computer program product, where the computer program product includes an instruction, and when the computer program is executed by a computer, the instruction enables the computer to perform the method described in the foregoing first aspect or second aspect or third aspect or fourth aspect.

[0019] According to an aspect this application provides a system, where the system includes the foregoing communications apparatus.

[0020] According an aspect, this application provides a chip system, where the chip system includes a processor, configured to support the foregoing communications apparatus in implementing functions in the foregoing aspects, for example, generating or processing data and/or information in the foregoing methods. In a possible design, the chip system may further include a memory, where the memory is configured to store a program instruction and data necessary for the data sending device. The chip system may consist of chips, or may include a chip and other discrete devices.

[0021] Compared with the prior art, this application describes a signal transmission method, signal reception method, apparatus, and system, to decrease a CM/PAPR value of a transmitted signal of an OFDM system through sequence design and mapping of data to subcarriers, thereby improving link quality of an entire transmission system.

DESCRIPTION OF DRAWINGS

[0022] The following describes in more details the embodiments of this application with reference to accompanying drawings.

FIG. 1 is a schematic diagram of a possible application scenario according to this application;

FIG. 2 is a schematic flowchart of data sending according to an embodiment of this application;

FIG. 3a is a schematic diagram of generating a sequence {f_n} according to an embodiment of this application;

FIG. 3b is a schematic diagram of mapping a sequence {f_n} to a subcarrier according to an embodiment of this application;

FIG. 3c is another schematic diagram of mapping a sequence {f_n} to a subcarrier according to an embodiment of this application;

FIG. 3d is still another schematic diagram of mapping a sequence {f_n} to a subcarrier according to an embodiment of this application;

FIG. 3e is yet another schematic diagram of mapping a sequence {f_n} to a subcarrier according to an embodiment of this application;

FIG. 4 is a schematic flowchart of data receiving according to an embodiment of this application;

FIG. 4a is a schematic diagram of data detection by a receive end according to an embodiment of this application;

FIG. 4b is another schematic diagram of data detection by a receive end according to an embodiment of this application;

FIG. 4c is still another schematic diagram of data detection by a receive end according to an embodiment of this application;

FIG. 5 is a schematic structural diagram of a data sending device according to an embodiment of this application; and

FIG. 6 is a schematic structural diagram of another data receiving device according to an embodiment of this application.

DESCRIPTION OF EMBODIMENTS

[0023] The following clearly and completely describes the technical solutions in the embodiments of this application with reference to the accompanying drawings in the embodiments of this application.

[0024] A technology described in this application is applicable to an LTE system and a subsequent evolved system such as the 5th generation mobile communication (the 5th Generation mobile communication, 5G), or other wireless communications systems that employ an orthogonal frequency division multiplexing (Orthogonal Frequency Division Multiplexing, OFDM) access technology, especially applicable to a communications system for which a CM value of a transmitted signal needs to be decreased. FIG. 1 is a schematic diagram of a possible application scenario according to this application. For example, a communications system 100 shown in FIG. 1 includes at least one network device 20 (for example, including a base station) and a plurality of terminal devices 10 (10A and 10B). The plurality of terminal devices 10 communicate with the network device 20. In a downlink direction, the network device 20 communicates with the terminal device 10 over a downlink channel. In an uplink direction, the terminal device 10 communicates with the network device 20 over an uplink channel. Downlink is a direction in which the network device 20 sends data to the terminal device 10, whereas uplink is a direction in which the terminal device 10 sends data to the network device 20.

[0025] It should be understood that, a technical solution in the embodiments of the present invention may be applied to communications systems with various access standards, for example, a long term evolution (long term evolution, LTE) system, an LTE frequency division duplex (frequency division duplex, FDD) system, an LTE time division duplex (time division duplex, TDD) communications system, a 5G (fifth generation) LTE system, a 5G NR (new radio, new radio) system and its subsequent evolved system, or a system that integrates a plurality of access standards.

[0026] It should also be understood that in the embodiments of the present invention, the terminal device (terminal equipment) may be referred to as a terminal (terminal), user equipment (user equipment, UE), a mobile station (mobile station, MS), a mobile terminal (mobile terminal), a laptop computer, and the like. The terminal device may communicate with one or more core networks by using a radio access network (radio access network, RAN). For example, the terminal device may be a mobile phone (also referred to as a "cellular" phone) or a computer with a mobile terminal. For example, the terminal device may also be a portable, pocket-sized, handheld, computer built-in, or in-vehicle mobile apparatus, which exchanges voice and/or data with the radio access network.

[0027] In the embodiments of the present invention, the network device may be an evolved NodeB (evolved node B, eNB or e-NodeB for short) in an LTE system, a base station in a 5G LTE system, or a base station in a 5G NR system; may be another base station; or may be a network device such as a relay (relay) node. This is not limited in the present invention.

[0028] The technical solution provided in this application may be applied to uplink data transmission and/or downlink data transmission. For uplink data transmission, a data sending device may be a terminal device, and a data receiving device may be a network side device, such as a base station; for downlink data transmission, a data sending device may be a network side device, such as a base station, and a data receiving device may be a terminal device.

[0029] The following explains general concepts or definitions in the embodiments of this application. It should be noted that, some English abbreviations in this specification are descriptions about the embodiments of this application by using an LTE system as an example, and may change with network evolution. For specific evolution, refer to the description in a corresponding standard.

[0030] Fast Fourier transform (Fast Fourier Transformation, FFT) described in this application is a fast algorithm for performing discrete Fourier transform (Discrete Fourier Transform, DFT). The FFT described in this application may also be replaced with another algorithm that can perform Fourier Transform, which is not limited in this application. Inverse fast Fourier transform (Inverse Fast Fourier Transformation, IFFT) is a fast algorithm for performing inverse discrete Fourier transform (Inverse Discrete Fourier Transform, IDFT). The IFFT described in this application may also be replaced with another algorithm that can perform inverse Fourier transform, which is not limited in this application.

[0031] The "data" described in this application normally means service data, but may also include content such as signaling and a message that needs to be transmitted by a system, for example, a reference signal and an uplink-downlink control message.

[0032] The term "and/or" in this application describes only an association relationship for describing associated objects and represents that three relationships may exist. For example, A and/or B may represent the following three cases: Only A exists, both A and B exist, and only B exists. In addition, the character "/" in this specification generally indicates an "or" relationship between the associated objects.

[0033] In this application, TX represents T x X, where T and X may be any number. For example, 2X represents 2 x X.

[0034] "C mod K" in this application represents a modulo operation of C by K, where a value range is 0 to K-1, K is a positive integer, and C is a real number. For example, "10 mod 8" evaluates to 2. Using "(mod K)" to the right of an equation means that both sides of the equation are equal in the sense of mod K, that is, mod K operation needs to be performed on both sides of the equation. For example, a = b (mod K) indicates that a mod K = b mod K.

[0035] In this application, equivalent sequences of a sequence {p_i} are the sequence itself and the following sequences, where 0 ≤ i ≤ 2 x N - 1, and N is a positive integer:
{q₀,q₁,q₂,...,q_2N-1} meets q_i = p_i + u_i(mod 8), where u_i = v_i, or is a sequence obtained by adding up a plurality of v_i that can be selected repeatedly;

or v_i = (i mod 2) · 2, i = 0,1,2,..,2N - 1

or v_i = -(i mod 2) · 2, i = 0,1,2,..,2N - 1

or v_i = (i mod 4) · 2, i = 0,1,2,..,2N - 1

or v_i = -(i mod 4) · 2, i = 0,1,2,..,2N - 1

or v_i = 2, i = 0,1,2,..,2N - 1,

or v_i = 4, i = 0,1,2,..,2N - 1,

or v_i = 6, i = 0,1,2,..,2N - 1.

[0036] In this application, j indicates an imaginary part of a complex number. That is, j²=-1 or

[0037] The following gives more details about the technical solution in the embodiments of this application with reference to the accompanying drawings.

[0038] In this application, a transmit end is a device that sends a sequence. Optionally, the transmit end is a device that sends UCI. The UCI may be an acknowledgement/negative acknowledgement (Acknowledgement/Negative Acknowledgement, ACK/NACK). Optionally, the UCI may alternatively be channel state information (Channel State Information, CSI). The CSI may include one or more of the following information: channel quality indicator (Channel Quality Indicator, CQI), precoding matrix indicator (Precoding Matrix Indicator, PMI), and rank indication (Rank Indication, RI).

[0039] FIG. 2 is a schematic diagram of a transmit device of a data processing method according to an embodiment of this application.

[0040] In part 301, the transmit device determines a sequence {f_n}.

[0041] The transmit device determines the sequence {f_n} that includes 2 x N elements, where f_n is an element of {f_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1.

[0042] The sequence {f_n} is as follows:

when n is an odd number, f_n = A₁ · x_n · exp(2π · j · α · n) ;

when n is an even number, f_n = A₂ · x_n · exp(2π · j · α · n), where

A₁ and A₂ are non-zero complex numbers, α is a real number,

exp(j×h) represents e^j×h, and h is any real number.

[0043] Optionally, α is k/(2 x N), where 0≤ k ≤ 2 x N - 1. Multiplying x_n by exp (2 · π · j · α · n) is equivalent to phase weighting on x_n. A purpose of phase weighting on each element of a sequence {x_n} is to cyclically shift a signal sequence obtained after {x_n} goes through IFFT. In this way, transmit devices can be distinguished based on different cyclic shifts of the sequence, thereby multiplexing a plurality of transmit devices.

[0044] FIG. 3a provides an example of generating {f_n} in part 301. The transmit device determines {x_n}, A₁, and A₂ . {x_n} may be stored by the transmit device, or may be calculated by the transmit device according to a predefined formula. In FIG. 3a, 0 ≤ n ≤ 11 and α = 0. A₁ is multiplied by each of x₀, x₂, x₄, x₆, x₈, and xio, and A₂ is multiplied by each of x₁, x₃, x₅, x₇, x₉, and x₁₁, to obtain {f_n} = {A₁x₀, A₂x₁, A₁x₂, A₂x₃, A₁x₄, A₂x₅, A₁x₆, A₂x₇, A₁ x₈, A₂x₉, A₁x₁₀, A₂x₁₁}. It may be considered that, an even element of {x_n} carries a modulated symbol A, and an odd element of {x_n} is a reference signal. A₁ and A₂ fall in a value range of {1, -1, j, -j}. Optionally, A₁ and A₂ may fall in a value range of {(1 + j)/r, (1 -j)/r, (-1 +j)/r, (-1 - j)/r}, where r is the square root of 2. Compared with A₁ and A₂ falling in the value range of {(1 + j)/r, (1 - j)/r, (-1 + j)/r, (-1 - j)/r}, a sent signal has a lower CM/PAPR value when A₁ and A₂ fall in the value range of {1, -1, j, -j}.

[0045] For A₁ and A₂, the following optional designs are also provided:
A₁ and A₂ are modulated symbols.

[0046] In this case, A₁ is obtained after a channel of data information bits or control information bits is modulated. A₁ is carried on an even element (where an even element may also be referred to as an even-numbered element) of {f_n} At the same time, A₂ is obtained after the other channel of data information bits or control information bits is modulated. A₂ is carried on an odd element (where an odd element may also be referred to as an odd-numbered element) of {x_n}. For example, one channel of data is a 2-bit ACK/NACK and the other channel of data is a 2-bit CQI.

[0047] A₁ is a modulated symbol and A₂ is a constant.

[0048] For example, A₁ is obtained after data information bits or control information bits are modulated. A₁ is carried on an even element of {f_n}. An odd element of {f_n} or {x_n} is a reference signal. A₂ is a constant. For example, A₂ =1. A₂ being a constant means that A₂ carries no information bits. For example, A₂ may be a symbol known to both a transmit end and a receive end. A₂ may alternatively represent an amplitude. A₂ being a constant does not mean that A₂ is fixed and invariable. At different sending moments, A₂ is different.

[0049] For example, the transmit device is a terminal device, the odd element of {f_n} or {x_n} is a reference signal, and A₂ is an amplitude of the reference signal. In this case, the terminal device sends UCI based on A₂ = 1 when sending the UCI for the first time. The terminal device sends the UCI based on A₂ = 2 when sending the UCI for the second time.

[0050] 3. A₂ is a modulated symbol and A₁ is a constant. This case is similar to a case in which A₁ is a modulated symbol and A₂ is a constant. Details are not described again.

[0051] There may be a plurality of ways of mapping control information bits to {1, j, -1, j}. For example, a state of 2-bit information is mapped to a value in {1, j, -1, -j}. For example, (0,0) is mapped to 1, (1,0) is mapped to -1, (0,1) is mapped to j, (1,0) is mapped to -j, and (1,1) is mapped to -1.

[0052] In an example, {x_n} is a sequence including x_n, 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,

when n is an odd number greater than or equal to 0 and less than or equal to N-1,

where a=1 or -1,

and N is a positive integer and an even number; and condition 2: when N=6,

and

where

c is a non-zero complex number, 0 ≤ n ≤ 2, and

a value of {y₀ y₁ y₂ y₃ y₄ y₅} is a sequence {E_i}, {B_i}, {C_i}, or {D_i}, where 0 ≤ i ≤ 5, i is an integer, B_i = Z_i + 2 (mod 8), C_i = Z_i + 4 (mod 8), D_i = Z_i + 6 (mod 8), E_i = Z_i (mod 8), mod represents an modulo operation, and {Z_i} 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}.

[0053] Table 1 lists an example of {E_i}, {B_i}, {C_i}, or {D_i} obtained according to the foregoing formula. Optionally, the value of {y₀ y₁ y₂ y₃ y₄ y₅} is one of 28 sequences listed in Table 1.

Table 1

{Ei}	{Bi}	{Ci}	{Di}
{2 0 6 2 4 6}	{4 2 0 4 6 0}	{6 4 2 6 0 2}	{0 6 4 0 2 4}
{6 0 2 6 4 2}	{0 2 4 0 6 4}	{2 4 6 2 0 6}	{4 6 0 4 2 0}
{0 6 4 4 2 0}	{2 0 6 6 4 2}	{4 2 0 0 6 4}	{6 4 2 2 0 6}
{2 6 6 4 4 0}	{4 0 0 6 6 2}	{6 2 2 0 0 4}	{0 4 4 2 2 6}
{6 2 2 4 4 0}	{0 4 4 6 6 2}	{2 6 6 0 0 4}	{4 0 0 2 2 6}
{6 6 2 4 0 0}	{0 0 4 6 2 2}	{2 2 6 0 4 4}	{4 4 0 2 6 6}
{2 2 6 4 0 0}	{4 4 0 6 2 2}	{6 6 2 0 4 4}	{0 0 4 2 6 6}

[0054] In another example, N=6, and {x_n} is one of sequences that meet the following conditions. The element x_n in {x_n} meets a condition 3.

[0055] Condition 3:

where 0 ≤ n ≤ 2 x N - 1.{s_n} is a sequence including s_n.

[0056] The sequence {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} 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, 3, -3, 3, 1, -1, -3, -1, -1, 1, -3, -1},

{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, 1, 1, 3, -3, -3, 3, 1, -3, 1, 3},

{3, 1, 3, 3, -1, 1, -1, -3, -3, 1, -1, 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},

{-3, 3, -3, -1, 1, -3, 1, 1, 1, 3, 1, -1},

{1, -3, -3, 3, -1, 3, 3, -3, -1, -1, -3, -1},

{-1, 3, -3, 1, -3, -3, -3, -1, -1, 1, -1, -3},

{-3, 3, 1, 1, 3, 1, 3, 3, -1, 1, -1, 3},

{1, 3, -1, -1, 1, -1, -1, 3, 3, 1, -3, 1},

{-1, -3, 3, -3, -3, -1, -1, -1, 3, -1, 1, -3}, and

{-1, 3, 3, -3, 1, -3, -1, -3, 3, 3, -3, 3}.

[0057] The foregoing sequence set is defined as P31.

[0058] Alternatively, the sequence {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of sequences in a set P33 or one of equivalent sequences of the sequences in the set P33; or one of sequences in a set P25 or one of equivalent sequences of the sequences in the set P25; or one of sequences in a set P30 or one of equivalent sequences of the sequences in the set P30.

[0059] The set P33 is a set 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};

{-3, 3, -3, -1, 1, -3, 1, 1, 1, 3, 1, -1};

{-3, -1, -1, 1, -1, -3, 3, 3, -1, 3, -3, 1};

{-3, 1, -3, -3, -1, -1, -1, 1, -1, -3, -3, 3};

{1, 3, -1, -1, -1, 1, -1, 3, -3, 3, 1, -3};

{-1, 1, -3, -1, 1, -1, 3, -1, -3, 1, 1, 1};

{-1, 3, -3, 1, -3, -3, -3, -1, -1, 1, -1, -3};

{-3, 3, -3, -1, 3, -3, 1, 1, 1, -3, 3, -1};

{3, -3, -3, -1, 1, -1, 3, -1, 3, 3, 1, 1};

{3, -3, -3, 1, -3, -1, -1, -1, 1, -1, -3, -3}.

[0060] The set P25 is a set 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};

{-3, 3, -3, -1, 1, -3, 1, 1, 1, 3, 1, -1};

[0061] The set P30 is a set 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};

{-3, 3, -3, -1, 1, -3, 1, 1, 1, 3, 1, -1};

{-1, 1, -3, -1, 1, -1, -1, -3, 1, -3, 3, -1};

{-1, -1, -3, -3, -3, 1, 3, -1, 3, 1, -3, 3};

{3, -1, -3, 3, -1, -1, -3, -3, -3, 1, 3, 1};

{3, 3, -3, -1, -1, -1, -3, -3, 1, -3, -1, -3};

{1, 3, 3, 1, -1, 1, -3, -1, 1, 1, -1, 3}.

[0062] P33, P25, and P30 all include 25 common sequences. Other sequences of P33 lower sequence cross-correlation to obtain more sequences, and therefore the sequences of P33 have a relatively low CM/PAPR feature. P30 lowers CM/PAPR of the sequences to obtain more sequences, and therefore the sequences of P30 have relatively low cross-correlation.

[0063] In an example, N=6, and the element x_n of {x_n}, where 0 ≤ n ≤ 11, meets
x_n = g · exp(π · j · s_n / 4), where g is a non-zero complex number, {s_n} is a sequence including s_n, and
when {x_n} meets the condition 1, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, 3, 3, 1, -3, -1, 3, 1, -3, -1, -1, -3};

{-3, 1, 3, 1, -3, -3, -1, -1, -3, -1, -1, 3};

{-1, 3, -1, 1, 3, 3, 1, 1, 1, -1, -3, 1};

{1, -1, -3, 1, -3, -1, 3, -3, -1, -1, -1, -3};

{3, 1, -3, -3, 3, -3, -3, -1, -1, 3, -3, 3}.

[0064] When the sequence {x_n} meets the condition 2 and {Z_i} is {2 0 6 2 4 6}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, 3, -3, 1, -3, 3, 3, -3, -3, -3, 3, 1},

{1, -3, 1, -1, -3, -3, 3, -1, 1, 3, 3, 3},

{3, -3, -3, 1, 3, 1, -1, 1, -1, -1, 3, 1},

{3, 1, 1, 1,3, -3, -1, -3,3, -1,3, -3},

{3, 1, 3, 3, -1, 1, -1, -3, -3, 1, -1, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3}.

[0065] When the sequence {x_n} meets the condition 2 and {Z_i} is {6 0 2 6 4 2}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, -3, -3, -1, -3, -3, -1, 3, -3, 3, -1, -1},

{-1, -3, -1, 3, 3, -3, -3, 3, -1, -1, -3, -1},

{-1, 1, 3, 3, 3, 1, -1, 1, -3, 1, -1, -3},

{1, 3, 1, 1, -3, 3, 1, 3, 3, -1, 1, -1}.

[0066] When the sequence {x_n} meets the condition 2 and {Z_i} is {0 6 4 4 2 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{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, -1, 1, 1, 3, 3, 1, 1},

{-3, 3, -3, 3, 1, -1, -1, 1, -3, -1, -1, 1}.

[0067] When the sequence {x_n} meets the condition 2 and {Z_i} is {2 6 6 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{3, -3, -3, -3, 1, 3, -3, 1, 3, 1, -1, 3},

{-3, -3, -1, -3, 3, 3, 1, 3, -1, 3, 3, -3}.

[0068] When the sequence {x_n} meets the condition 2 and {Z_i} is {6 2 2 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-3, 1, 3, 1, -1, 3, 3, -3, -3, -3, 1, 3},

{3, 1, -3, -3, -3, 3, 3, -1, 1, 3, 1, -3}.

[0069] When the sequence {x_n} meets the condition 2 and {Z_i} is {6 6 2 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-3, -3, 3, -3, -1, -1, 3, 1, 1, -3, 1, -1},

{-3, 3, 3, 3, -1, -3, -3, 1, 3, -3, 3, -1}.

[0070] When the sequence {x_n} meets the condition 2 and {Z_i} is {2 2 6 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-1, 3, 1, 3, -3, 1, 1, -1, 3, 3, 3, 1},

{-3, 3, 3, -1, 3, 1, 1, 1, -1, 1, 3, 3}.

[0071] In this application, an equivalent sequence of {s_n} that includes 12 elements is {q_n}, where q_n = s_n + u_n(mod8), 0 ≤ n ≤ 11. and
a sequence {u_i} 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}.

[0072] In an example, before step 301, the method further includes: selecting, by the transmit device, the sequence {x_n} from a sequence set J. The set J is a set of a preset available sequence {x_n} in a communications system, the set J includes a plurality of sequences, and the plurality of sequences include at least one sequence that meets the condition 1 or the condition 2 or the condition 3; or the set J includes a plurality of sequences that meet the condition 1 or the condition 2 or the condition 3. For any sequence in the set J, the set J does not include any equivalent sequence of the sequence.

[0073] Because a plurality of cells coexist in the communications system, neighboring cells need to use different sequences to transmit data. Therefore, the sequence set J is required, so that neighboring cells can use different sequences in the sequence set J to reduce interference between the cells. For example, the transmit device selects the sequence {x_n} according to a predefined rule by using a cell ID as an input parameter, or when the transmit device is UE, the transmit device obtains, based on signaling configured on a base station, the sequence {x_n} used for sending. Optionally, any equivalent sequence of {x_n} does not belong to the sequence set J. Because a sequence is highly cross-correlated with its own equivalent sequence, if the set J includes both a sequence and its equivalent sequence, and neighboring cells respectively use a sequence and one of its equivalent sequences, interference between two cells is severe when the two cells use the two sequences to send data on a same resource.

[0074] In part 302, the transmit device maps the sequence {f_n} to 2 x N subcarriers.

[0075] In an example, the transmit device sequentially maps 2N elements of {f_n} to 2N subcarriers in descending order of subcarrier indexes, where one element of {f_n} is mapped to one frequency domain subcarrier, and the frequency domain subcarrier is a smallest unit of frequency domain resources and used to carry data information. Optionally, the transmit device maps 2N elements of {f_n} to 2N subcarriers in ascending order of subcarrier indexes. Mapping one element in {f_n} to one subcarrier is carrying the element on the subcarrier. After the mapping, the transmit device sends data through radio frequency, which is equivalent to sending the element on the subcarrier. A communications system usually includes 2M subcarriers, where M > N. Different transmit devices may occupy different subcarriers to send data. The 2N subcarriers is a part of the 2M subcarriers, and locations of the 2N subcarriers in the 2M subcarriers may be predefined or configured through signaling by a base station.

[0076] In an example, FIG. 3b to FIG. 3e show four ways of mapping {f_n} to subcarriers in part 302. In an example of FIG. 3b to FIG. 3e, 2N = 12.

[0077] As shown in FIG. 3b, the transmit device maps {f_n} to 2 x N contiguous subcarriers. f₀ to f₁₁ are respectively mapped to 12 contiguous subcarriers s+0, s+1, s+2, s+3, s+4, s+5, s+6, s+7, s+8, s+9, s+10, and s+11. Specifically, f₀ is mapped to the subcarrier s+0, f₁ is mapped to the subcarrier s+1, ..., and f₁₁ is mapped to the subcarrier s+11. In FIG. 3b to FIG. 3e, s indicates that the first subcarrier in the 2 x N subcarriers to which {f_n} is mapped is indexed in the 2M subcarriers in the system.

[0078] Optionally, the transmit device maps {f_n} to a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N contiguous subcarriers. As shown in FIG. 3c, 2N = 12. f₀ to f₅ are mapped to six contiguous subcarriers s+0, s+1, s+2, s+3, s+4, s+5 (subcarriers of the subcarrier group 1), and f₆ to f₁₁ are mapped to another six contiguous subcarriers s+12, s+13, s+14, s+15, s+16, s+17 (subcarriers of the subcarrier group 2). In addition, the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier. For example, in FIG. 3c, if f₅ is mapped to the subcarrier s+5, f₆ cannot be mapped to a subcarrier s+6. In other words, the subcarrier group 1 cannot be adjacent to the subcarrier group 2, and they are separated by at least one subcarrier that belongs to neither the subcarrier group 1 nor the subcarrier group 2. Optionally, when the subcarrier group 1 and the subcarrier group 2 each have N subcarriers, the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers, where N is an integer greater than 1. In this way, lower PAPR/CM can be obtained. In addition, better frequency diversity effect is obtained.

[0079] Optionally, the transmit device maps {f_n} to 2 x N noncontiguous and equally gapped subcarriers. Optionally, a gap is one subcarrier. As shown in FIG. 3d, the 2N subcarriers are distributed at equal gaps in frequency domain. For example, in FIG. 3c, a subcarrier to which f_n is mapped and a subcarrier to which f_n+1 is mapped are separated by one subcarrier. f₀ to f₁₁ are respectively mapped to 12 equally gapped subcarriers s+0, s+2, s+4, s+6, s+8, s+10, s+12, s+14, s+16, s+18, s+20, and s+22.

[0080] Optionally, the transmit device maps {f_n} to a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N noncontiguous and equally gapped subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier. Optionally, neighboring subcarriers in a subcarrier group (the group 1 or the group 2) are separated by one subcarrier. As shown in FIG. 3e, f₀ to f₅ are mapped to six equally gapped subcarriers s+0, s+2, s+4, s+6, s+8, s+10 in the subcarrier group 1, and f₆ to f₁₁ are mapped to s+18, s+20, s+22, s+24, s+26, s+28 in the subcarrier group 2. Optionally, when the subcarrier group 1 and the subcarrier group 2 each have N subcarriers, the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers, where N is an integer greater than 1. In this way, lower PAPR/CM can be obtained. In addition, better frequency diversity effect is obtained.

[0081] That the subcarrier group 1 and the subcarrier group 2 are separated by X subcarriers refer to a minimum quantity of subcarriers between two subcarriers that respectively belong to the subcarrier group 1 and the subcarrier group 2. As shown in FIG. 3c, the subcarrier group 1 and the subcarrier group 2 are separated by six subcarriers.

[0082] FIG. 3b and FIG. 3d show a way of mapping {f_n} to contiguous or equally gapped subcarriers, where a CM value is more satisfactory. FIG. 3c and FIG. 3e show a way of mapping {f_n} to two subcarrier groups, where the CM value is higher than that in the way shown in FIG. 3b and FIG. 3d but frequency diversity effect is better.

[0083] Optionally, when 2N = 12, and {f_n} is mapped to two subcarrier groups (as shown in FIG. 3c and FIG. 3e), {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} in {f_n} is one of sequences in a set P12 or one of equivalent sequences of the sequences in the set P12.

[0084] The set P12 is a set 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}.

[0085] When {f_n} is mapped to two subcarrier groups in the foregoing way, the CM/PAPR value is quite satisfactory.

[0086] Because a frequency domain bandwidth of the transmit end includes 2M subcarriers, all subcarriers except 2N subcarriers, namely (2M-2N) frequency domain subcarriers, need to be filled with 0 or other data to generate 2M point signals.

[0087] In part 303, the transmit device converts the generated 2M point signals (2M point frequency domain signals) into time domain signals through IFFT, and adds cyclic prefixes to the time domain signals to generate sending signals. In part 303, the time domain signals obtained by performing IFFT on the generated 2M point frequency domain signals are sent on one OFDM symbol. In part 304, the transmit device sends the sending signal out through radio frequency. To be specific, the terminal device sends, on the 2 x N subcarriers, a signal that carries the sequence {f_n}.

[0088] In an example, the transmit device sends, on one OFDM symbol, a signal that carries {f_n}. The transmit device may alternatively send, on a plurality of OFDM symbols, the signal that carries {f_n}.

[0089] In an example, the transmit device is a terminal device. The sending signal is sent over a PUCCH.

[0090] In an example, FIG. 4 is a schematic flowchart of a data processing method at a receive end according to an embodiment of this application.

[0091] In part 401, a receive device obtains a time domain signal and deletes a cyclic prefix.

[0092] In part 402, the receive device performs 2×M-point FFT on the signal with the cyclic prefix deleted, to obtain 2×M point frequency domain signals.

[0093] In part 403, the receive device receives a signal on 2 x N subcarriers, where the signal is a sequence {w_n} that includes 2 x N elements, and 0 ≤ n ≤ 2 x N - 1. For example, the receive device receives the signal on the 2 x N subcarriers based on locations of the 2 x N subcarriers in 2×M subcarriers, where the locations are predefined or are configured by a base station.

[0094] In part 404, the receive device processes the obtained signal on the 2 x N subcarriers.

[0095] In an example, the receive device obtains 2 x N elements of a sequence {f'_n}, where f'_n is an element of {f'_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1. The receive device processes the signal on the 2 x N subcarriers based on 2 x N elements of a sequence {x_n}.

[0096] {f'_n} is as follows:

when n is an odd number, f'_n = A₃ · x_n · exp(2π · j · α' · n);

when n is an even number, f'_n = A₄ · x_n · exp(2π · j · α' · n), where A₃ and A₄ are non-zero complex numbers, α' is a real number,

exp(j × h) represents e^j×h, and h is any real number.

[0097] A value of A₃ may be a value in a value range of A₁, or A₃ may be equal to 1. A value of A₄ may be a value in a value range of A₂, or A₄ may be equal to 1. α' may be equal to α, or may be equal to 0.

[0098] For part 404, optional designs shown in FIG. 4a, FIG. 4b, and FIG. 4c are provided.

[0099] As shown in part 405 of FIG. 4a, when an odd element of {f_n} at the transmit end is a reference signal, the receive end device obtains {f'_n} based on A₃ = 1. The receive device performs joint processing on an odd element of {f_'n} and an odd element of {w_n}, and obtains a channel status corresponding to the received sequence. For example, an odd element pair of x_n is correlated by using an odd element of a received sequence, and then a channel status is obtained. In this case, an even element of {f_n} at the transmit end carries data information. The data information may be service data information, or may be control information.

[0100] In part 406 of FIG. 4a, the receive device performs joint processing on an even element of {f_'n} and the obtained channel status, and obtains data information. For example, frequency domain equalization is performed on an even element of a received sequence based on a channel status, to obtain data transmitted by a transmit device.

[0101] In FIG. 4a, channel estimation is performed by using an odd element of {f_n} as an example. When an even element of {f_n} is a reference signal, channel estimation and subsequent processing are similar to those in FIG. 4a. Details are not described again.

[0102] Optionally, FIG. 4b shows another example of processing the obtained signal on the 2 x N subcarriers by the receive device. In part 407, the receive device traverses all possible sequences of {f'_n} with respect to all possible values of A₁ and all possible values of A₂. {w_n} is separately correlated with all possible sequences of {f_n}, and maximum likelihood comparison is performed, to obtain data transmitted by the transmit device.

[0103] For example, a value range corresponding to A₁ is {-1, +1}, and a value range corresponding to A₂ is {-1, +1}, and a value combination of (A₁, A₂) is {(-1, -1), (-1, 1), (1, -1), (1, 1)}. According to FIG. 3a, when (A₃, A₄) is (-1, -1), an obtained {f'_n} is a sequence {f'_{1, n}}; when (A₃, A₄) is (-1, 1), the obtained {f_n} is a sequence {f'_{2, n}}; when (A₃, A₄) is (1, -1), the obtained {f'_n} is a sequence {f'_{3, n}}; and when (A₃, A₄) is (1, 1), the obtained {f'_n} is a sequence {f'_{4, n}}. After {w_n} is separately correlated with {f'_{1, n}}, {f'_{2, n}}, {f'₃, _n}, and {f'_{4, n}}, four correlation values are obtained. A value of (A₃, A₄) corresponding to a largest correlation value is the data obtained by the receive device. For example, if the largest correlation value is obtained by correlating {w_n} with {f'_{1, n}}, (A₁, A₂) is (-1, -1).

[0104] Optionally, FIG. 4c shows another example of processing the obtained signal on the 2 x N subcarriers by the receive device. A₁ and A₂ are modulated symbols obtained after data information bits or control information bits are modulated. In part 408, the receive device correlates all elements of {f'_n} with all elements of {w_n} by using an obtained channel estimation value, to obtain the foregoing data information bits or control information bits. Alternatively, the receive device performs joint processing on the odd-/even-numbered element of {f'_n} and the odd-/even-numbered element of {w_n} to directly obtain data transmitted by the transmit device. For example, correlation detection is performed by using {f'_n}, to obtain the data transmitted by the transmit device. The foregoing channel estimation value may be obtained based on a reference signal in another OFDM symbol.

[0105] Table 2 lists a result of CM value comparison between a sequence in this application and an LTE sequence (where each sequence includes 12 elements). As listed in Table 2, a maximum CM value of the sequence in this application is far less than a CM value of the LTE sequence, and 77% of CM values of the LTE sequence are greater than 2 dB. CM values of the sequence in this application are better than those of the LTE sequence.

Table 2 CM value comparison between a sequence in this application and an LTE sequence

CM value	Sequence of a set P25 in this application	LTE sequence
Maximum value	1.1 dB	3.78 dB
Minimum value	0.83 dB	0.92 dB

[0106] A formula for calculating a CM value is as follows:

[0107] K=1.54, ref_dB=1.52. x' x represents conjugate transpose of a column vector x times a sequence x, and N is a sequence length. v(t) is a signal used to calculate CM. For each sample of t, a column vector x of the sample is obtained.

[0108] Therefore, the data processing method in wireless communication provided in the embodiments of this application can decrease a CM/PAPR value of a transmitted signal of an OFDM system, thereby improving link quality of an entire transmission system.

[0109] As shown in FIG. 5, an embodiment of the present invention provides a communications apparatus. The communications apparatus can be applied in the communications system shown in FIG. 1 to implement the method in the corresponding embodiment shown in FIG. 2, FIG. 3a, FIG. 3b, FIG. 3c, FIG. 3d, FIG. 3e, FIG. 4, FIG. 4a, FIG. 4b, or FIG. 4c. The communications apparatus may be the network device 20 in FIG. 1, or may be the terminal device 10 in FIG. 1. The communications apparatus may be a transmit device, or may be a receive device.

[0110] When the communications apparatus is a transmit device, the communications apparatus includes:
a processor unit 501, configured to determine a sequence {f_n} that includes 2 x N elements, where f_n is an element of {f_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1.

[0111] The processing unit 501 is further configured to map the sequence {f_n} to 2 x N subcarriers,
where the sequence {f_n} is as follows:
when n is an odd number, f_n = A₁ · x_n · exp(2π · j · α · n);
when n is an even number, f_n = A₂ · x_n · exp(2π · j · α · n); where
A₁ and A₂ are non-zero complex numbers, α is a real number,

exp(j×h) represents e^j×h, and h is any real number.

[0112] {x_n} is a sequence including x_n, and meets at least one of the condition 1 and the condition 2 in the foregoing embodiment.

[0113] The communications apparatus further includes a sending unit 502, configured to send, on the 2 x N subcarriers, a signal that carries the sequence {f_n}.

[0114] In an example, the processing unit 501 is further configured to map {f_n} to 2 x N contiguous subcarriers. Optionally, the processing unit 501 is further configured to map {f_n} to 2 x N equally gapped subcarriers. Optionally, the processing unit 501 is further configured to map {f_n} to a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N contiguous subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier. Optionally, the processing unit 501 is further configured to map {f_n} to a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N equally gapped subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier.

[0115] In an example, the communications apparatus further includes a storage unit 504, where the memory is configured to couple with the processor 501, and store a program instruction and data necessary for the communications apparatus.

[0116] Alternatively, when the communications apparatus is a transmit device, the communications apparatus includes:
a processor unit 501, configured to determine a sequence {f_n} that includes 2 x N elements, where f_n is an element of {f_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1, where N=6.

[0117] The processing unit 501 is further configured to map the sequence {f_n} to 2 x N subcarriers,
where the sequence {f_n} is as follows:

when n is an odd number, f_n = A₁ · x_n · exp(2π · j · α · n);

when n is an even number, f_n = A₂ · x_n · exp(2π · j · α · n), where

A₁ and A₂ are non-zero complex numbers, α is a real number,

exp(j × h) represents e^j×h, and h is any real number; and

{x_n} is a sequence that meets the following conditions: an element x_n in {x_n} meets:

x_n = u · exp(π · j · s_n / 4), where u is a non-zero complex number,

{s_n} is a sequence including s_n, and

the sequence {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of sequences of a set P25 in the foregoing embodiment or one of equivalent sequences of the sequences of the set P25.

[0118] The communications apparatus further includes a sending unit 502, configured to send, on the 2 x N subcarriers, a signal that carries the sequence {f_n}.

[0119] In an example, the processing unit 501 is further configured to map {f_n} to 2 x N contiguous subcarriers.

[0120] Optionally, the processing unit 501 is further configured to map {f_n} to 2 x N noncontiguous and equally gapped subcarriers.

[0121] Optionally, the processing unit 501 is further configured to map {f_n} to a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N contiguous subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier.

[0122] Optionally, the processing unit 501 is further configured to map {f_n} to a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N noncontiguous and equally gapped subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier.

[0123] Optionally, the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers.

[0124] In an example, the communications apparatus further includes a storage unit 504, where the memory is configured to couple with the processor 501, and store a program instruction and data necessary for the communications apparatus.

[0125] When the communications apparatus is a receive device, the communications apparatus includes:
a receiving unit 503, configured to receive a signal on 2 x N subcarriers.

[0126] The processing unit 501 is configured to: obtain 2 x N elements of a sequence {f'_n}, where f'_n is an element of {f_'n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1; and process the signal on the 2 x N subcarriers based on the 2 x N elements of the sequence {f'_n};
where {f'_n} is as follows:

when n is an odd number, f'_n = A₃ · x_n · exp(2π · j · α · n);

when n is an even number, f'_n = A₄ · x_n · exp(2π · j ·α' · n), where

A₃ and A₄ are non-zero complex numbers, α' is a real number,

exp(j×h) represents e^j×h, and h is any real number; and

{x_n} is a sequence including x_n, and meets at least one of the condition 1 and the condition 2 in the foregoing embodiment.

[0127] In an example, the receiving unit 503 is further configured to receive, on 2 x N contiguous subcarriers, the signal on the 2 x N subcarriers. Alternatively, the receiving unit 503 is further configured to receive, on 2 x N noncontiguous and equally gapped subcarriers, the signal on the 2 x N subcarriers. Alternatively, the receiving unit 503 is further configured to obtain the signal from a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N contiguous subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier. Alternatively, the receiving unit 503 is further configured to obtain the signal from a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N equally gapped subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier.

[0128] In an example, the communications apparatus further includes a storage unit 504, where the memory is configured to couple with the processor 501, and store a program instruction and data necessary for the communications apparatus.

[0129] Alternatively, when the communications apparatus is a receive device, the communications apparatus includes:
a processing unit 501, configured to obtain a signal on 2 x N subcarriers.

[0130] The processing unit 501 is configured to: obtain 2 x N elements of a sequence {f'n}, where f'_n is an element of {f'_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1; and process the signal on the 2 x N subcarriers based on the 2 x N elements of the sequence {f'_n};
where {f'_n} is as follows:

when n is an odd number, f'_n = A₃ · x_n · exp(2π · j · α' · n);

when n is an even number, f'_n = A₄ · x_n · exp(2π · j · α' · n), where

A₃ and A₄ are non-zero complex numbers, α' is a real number,

exp(j × h) represents e^j×h, and h is any real number.

[0131] {x_n} is a sequence that meets the following conditions: an element x_n in {x_n} meets:

{s_n} is a sequence including s_n, and
the sequence {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of sequences of a set P25 in the foregoing embodiment or one of equivalent sequences of the sequences of the set P25.

[0132] The communications apparatus further includes a receiving unit 503, configured to receive a signal. The processing unit 501 is further configured to obtain the signal on the 2 x N subcarriers based on the received signal.

[0133] In an example, the receiving unit 503 is further configured to receive the signal on 2 x N contiguous subcarriers. Alternatively, the receiving unit 503 is further configured to receive the signal on 2 x N equally gapped subcarriers.

[0134] Alternatively, the receiving unit 503 is further configured to receive the signal from a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N contiguous subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier. Optionally, the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers.

[0135] Alternatively, the receiving unit 503 is further configured to receive the signal from a subcarrier group 1 and a subcarrier group 2, where the subcarrier group 1 and the subcarrier group 2 each include N equally gapped subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier. Optionally, the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers.

[0136] In an example, the communications apparatus further includes a storage unit 504, where the memory is configured to couple with the processor 501, and store a program instruction and data necessary for the communications apparatus.

[0137] For other features of sequences {x_n} and {f_n}, A₁, A₂, and the like, refer to description about the foregoing embodiments. Details are not described again.

[0138] Therefore, the communications apparatus for wireless communications provided in this embodiment of this application decreases a CM value of a transmitted signal of an OFDM system, thereby improving link quality of an entire transmission system.

[0139] FIG. 6 is a possible schematic structural diagram of a communications apparatus in the foregoing embodiment.

[0140] The communications apparatus includes a processor 601 and a memory 604, where the storage unit 604 stores an instruction and the instruction is used to make the processor 601 execute the method involved in the foregoing embodiment.

[0141] The communications apparatus further includes a transmitter 602 and a receiver 603. When the communications apparatus sends a signal, the to-be-sent signal is transmitted by 602 through an antenna. When the communications apparatus receives a signal, the receiver 603 receives the signal from an antenna.

[0142] The communications apparatus can be applied in the communications system shown in FIG. 1 to implement the method in the corresponding embodiment shown in FIG. 2, FIG. 3a, FIG. 3b, FIG. 3c, FIG. 3d, FIG. 4, FIG. 4a, FIG. 4b, or FIG. 4c. The communications device may be the network device 20 in FIG. 1, or may be the terminal device 10 in FIG. 1. The communications apparatus may be a transmit device, or may be a receive device.

[0143] A function of the processing unit 501 in FIG. 5 may be implemented by the processor 601 in FIG. 6, or the processing unit 501 in FIG. 5 may be the processor 601 in FIG. 6. A function of the sending unit 502 in FIG. 5 may be implemented by the transmitter 602 in FIG. 6, or the sending unit 502 in FIG. 5 may be the transmitter 602 in FIG. 6. A function of the receiving unit 503 in FIG. 5 may be implemented by the receiver 603 in FIG. 6, or the receiving unit 603 in FIG. 5 may be the receiver 603 in FIG. 6. A function of the storage unit 504 in FIG. 5 may be implemented by the memory 604 in FIG. 6, or the storage unit 504 in FIG. 5 may be the memory 604 in FIG. 6.

[0144] It can be understood that FIG. 6 shows only a simplified design of the communications apparatus. In actual application, the communications apparatus may include any quantity of transmitters, receivers, processors, memories, and the like, and all data receiving devices that can implement this application fall within the protection scope of this application.

[0145] An embodiment of this application further provides a chip, where the chip may perform parts 301, 302, and 303 in FIG. 2, or parts 401, 402, 403, and 404 in FIG. 4, and designs in FIG. 3a, FIG. 3b, FIG. 3c, FIG. 3d, FIG. 4a, FIG. 4b, and FIG. 4c. The chip may include corresponding function units in the figures and perform corresponding functions.

[0146] The processor configured to perform functions of the communications apparatus in this application may be a central processing unit (CPU), a general purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or another programmable logic device, a transistor logic device, a hardware component, or any combination thereof. The processor may implement or execute various example logical blocks, modules, and circuits described with reference to content disclosed in this application. Alternatively, the processor may be a combination of processors implementing a computing function, for example, a combination of one or more microprocessors, or a combination of the DSP and a microprocessor. The processor 601 and the memory 604 in FIG. 6 may be alternatively combined into one unit to serve as a processor to implement functions of the processor 601 and the memory 604 in FIG. 6.

[0147] Method or algorithm steps described in combination with the content disclosed in the this application may be implemented by hardware, or may be implemented by a processor by executing a software instruction. The software instruction may be formed by a corresponding software module. The software module may be stored in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable hard disk, a CD-ROM, or a storage medium of any other form known in the art. For example, a storage medium is coupled to a processor, so that the processor can read information from the storage medium or write information into the storage medium. Certainly, the storage medium may be a component of the processor. The processor and the storage medium may be located in the ASIC. In addition, the ASIC may be located in a data receiving device and/or a data sending device. Certainly, the processor and the storage medium may exist in the data receiving device and/or the data sending device as discrete components.

[0148] It may be clearly understood by a person skilled in the art that, for the purpose of convenient and brief description, division of the foregoing function modules is used as an example for illustration. In actual application, the foregoing functions can be allocated to and implemented by different function modules according to a requirement, that is, an internal structure of an apparatus is divided into different function modules to implement all or some of the functions described above. For a detailed working process of the foregoing apparatus, refer to a corresponding process in the foregoing method embodiments. Details are not described herein again.

[0149] A person of ordinary skill in the art may understand that sequence numbers of the foregoing processes do not mean execution sequences in various embodiments of this application. The execution sequences of the processes should be determined according to functions and internal logic of the processes, and should not be construed as any limitation on the implementation processes of the embodiments of this application.

[0150] All or some of the foregoing embodiments may be implemented by software, hardware, firmware, or any combination thereof. When software is used to implement the embodiments, the embodiments may be implemented completely or partially in a form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the procedure or functions according to the embodiments of the present invention are all or partially generated. The computer may be a general-purpose computer, a dedicated computer, a computer network, or another programmable apparatus. The computer instructions may be stored in a computer-readable storage medium or may be transmitted from a computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website, computer, server, or data center to another website, computer, server, or data center in a wired (for example, a coaxial cable, an optical fiber, or a digital subscriber line (DSL)) or wireless (for example, infrared, radio, or microwave) manner. The computer-readable storage medium may be any usable medium accessible by a computer, or a data storage device, such as a server or a data center, integrating one or more usable media. The usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, or a magnetic tape), an optical medium (for example, a DVD), a semiconductor medium (for example, a solid-state drive Solid State Disk (SSD)), or the like.

Claims

1. A signal transmission method in wireless communication, comprising:

determining a sequence {f_n} that comprises 2 x N elements, wherein f_n is an element of {f_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1;

mapping the sequence {f_n} to 2 x N subcarriers; and

sending, on the 2 x N subcarriers, a signal that carries the sequence {f_n};

wherein the sequence {f_n} is as follows:

when n is an odd number, f_n = A₁ · x_n · exp(2π · j · α · n);

when n is an even number, f_n = A₂ · x_n · exp(2π · j · α · n);

A₁ and A₂ are non-zero complex numbers, α is a real number,

exp(j×h) represents e^j×h, and h is any real number; and {x_n} is a sequence composed of x_n, 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,

when n is an odd number greater than or equal to 0 and less than or equal to N-1,

wherein a=1 or -1,

and N is a positive integer and an even number; and

condition 2: when N=6,

and

wherein

c is a non-zero complex number, 0 ≤ n ≤ 2, and {y₀ y₁ y₂ y₃ y₄ y₅} 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};

wherein

when N=6, an element x_n of {x_n}, wherein 0 ≤ n ≤ 11, meets

x_n = g · exp(π · j · s_n / 4), wherein g is a non-zero complex number, {s_n} is a sequence composed of s_n, and

When {x_n} meets the condition 1, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, 3, 3, 1, -3, -1, 3, 1, -3, -1, -1, -3},

{-3, 1, 3, 1, -3, -3, -1, -1, -3, -1, -1, 3},

{-1, 3, -1, 1, 3, 3, 1, 1, 1, -1, -3, 1},

{1, -1, -3, 1, -3, -1, 3, -3, -1, -1, -1, -3},

{3, 1, -3, -3, 3, -3, -3, -1, -1, 3, -3, 3}; and/or

when the sequence {x_n} meets the condition 2, {s_n} meets the following conditions:

when {Z_i} is {2 0 6 2 4 6}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, 3, -3, 1, -3, 3, 3, -3, -3, -3, 3, 1},

{1, -3, 1, -1, -3, -3, 3, -1, 1, 3, 3, 3},

{3, -3, -3, 1, 3, 1, -1, 1, -1, -1, 3, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3},

{3, 1, 3, 3, -1, 1, -1, -3, -3, 1, -1, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3}; or

when {Z_i} is {6 0 2 6 4 2}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, -3, -3, -1, -3, -3, -1, 3, -3, 3, -1, -1},

{-1, -3, -1, 3, 3, -3, -3, 3, -1, -1, -3, -1},

{-1, 1, 3, 3, 3, 1,-1, 1, -3, 1, -1, -3},

{1, 3, 1, 1, -3, 3, 1, 3, 3, -1, 1, -1}; or

when {Z_i} is {0 6 4 4 2 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{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, -1, 1, 1, 3, 3, 1, 1},

{-3, 3, -3, 3, 1, -1, -1, 1, -3, -1, -1, 1}; or

when {Z_i} is {2 6 6 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{3, -3, -3, -3, 1, 3, -3, 1, 3, 1, -1, 3},

{-3, -3, -1, -3, 3, 3, 1, 3,-1, 3, 3, -3}; or

when {Z_i} is {6 2 2 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-3, 1, 3, 1, -1, 3, 3, -3, -3, -3, 1, 3},

{3, 1, -3, -3, -3, 3, 3, -1, 1, 3, 1, -3}; or

when {Z_i} is {6 6 2 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-3, -3, 3, -3, -1, -1, 3, 1, 1, -3, 1, -1},

{-3, 3, 3, 3, -1, -3, -3, 1, 3, -3, 3, -1}; or

when {Z_i} is {2 2 6 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-1, 3, 1, 3, -3, 1, 1, -1, 3, 3, 3, 1},

{-3, 3, 3, -1, 3, 1, 1, 1, -1, 1, 3, 3};

wherein an equivalent sequence of {s_n} is {q_n}, wherein q_n = s_n + u_n (mod8), 0 ≤ n ≤ 11, and

a sequence {u_i} 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}.

2. A signal transmission method in wireless communication, comprising:

determining a sequence {f_n} that comprises 2 x N elements, wherein f_n is an element of {f_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1, wherein N=6;

mapping the sequence {f_n} to 2 x N subcarriers; and

sending, on the 2 x N subcarriers, a signal that carries the sequence {f_n};

wherein the sequence {f_n} is as follows:

when n is an odd number, f_n = A₁ · x_n · exp(2π · j · α · n);

when n is an even number, f_n = A₂ · x_n · exp(2π · j · α · n);

A₁ and A₂ are non-zero complex numbers, α is a real number,

exp(j×h) represents e^j×h, and h is any real number; and

{x_n} is a sequence that meets the following conditions: an element x_n in {x_n} meets:

x_n = u · exp(π · j · s_n / 4), wherein u is a non-zero complex number,

{s_n} is a sequence composed of s_n,

the sequence {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} 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 {s_n} is {q_n}, wherein q_n = s_n + u_n (mod8), 0 ≤ n ≤ 11, and

a sequence {u_i} 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}.

3. The method according to claim 1 or 2, wherein the mapping the sequence {f_n} to 2 x N subcarriers comprises:

mapping {f_n} to 2 x N contiguous subcarriers; or

mapping {f_n} to 2 x N noncontiguous and equally gapped subcarriers; or

mapping {f_n} to a subcarrier group 1 and a subcarrier group 2, wherein the subcarrier group 1 and the subcarrier group 2 each comprise N contiguous subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier; or

mapping {f_n} to a subcarrier group 1 and a subcarrier group 2, wherein the subcarrier group 1 and the subcarrier group 2 each comprise N noncontiguous and equally gapped subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier.

4. The method according to claim 3, wherein
that the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier comprises:
the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers.

5. The method according to any one of claims 1 to 4, wherein value ranges of A₁ and A₂ are {1, -1, j, -j}.

6. The method according to any one of claims 1 to 4, wherein
A₁ and A₂ are modulated symbols; or
A₁ is a modulated symbol and A₂ is a constant; or
A₂ is a modulated symbol and A₁ is a constant.

7. A signal reception method in wireless communication, comprising:

receiving a signal on 2 x N subcarriers;

obtaining 2 x N elements of a sequence {f'_n}, wherein f'_n is an element of {f'_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1; and processing the signal on the 2 x N subcarriers based on the 2 x N elements of {f'_n};

wherein {f'_n} is as follows:

when n is an odd number, f'_n = A₃ · x_n · exp(2π · j · α' · n);

when n is an even number, f'_n = A₄ · x_n · exp(2π · j · α' · n);

A₃ and A₄ are non-zero complex numbers, α' is a real number,

exp(j×h) represents e^j×h, and h is any real number; and

{x_n} is a sequence composed of x_n, 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,

when n is an odd number greater than or equal to 0 and less than or equal to N-1,

wherein a=1 or -1,

and N is a positive integer and an even number; and

condition 2: when N=6,

and

wherein

c is a non-zero complex number, 0 ≤ n ≤ 2, and {y₀ y₁ y₂ y₃ y₄ y₅} 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}, and
{0 0 4 2 6 6};

wherein

when N=6, an element x_n of {x_n}, wherein 0 ≤ n ≤ 11, meets

x_n = g · exp(π · j · s_n / 4), wherein g is a non-zero complex number, {s_n} is a sequence composed of s_n, and

when {x_n} meets the condition 1, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, 3, 3, 1, -3, -1, 3, 1, -3, -1, -1, -3},

{-3, 1, 3, 1, -3, -3, -1, -1, -3, -1, -1, 3},

{-1, 3, -1, 1, 3, 3, 1, 1, 1, -1, -3, 1},

{1, -1, -3, 1, -3, -1, 3, -3, -1, -1, -1, -3},

{3, 1, -3, -3, 3, -3, -3, -1, -1, 3, -3, 3}; and/or

when the sequence {x_n} meets the condition 2, {s_n} meets the following conditions:

when {Z_i} is {2 0 6 2 4 6}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, 3, -3, 1, -3, 3, 3, -3, -3, -3, 3, 1},

{1, -3, 1, -1, -3, -3, 3, -1, 1, 3, 3, 3},

{3, -3, -3, 1, 3, 1, -1, 1, -1, -1, 3, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3},

{3, 1, 3, 3, -1, 1, -1, -3, -3, 1, -1, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3}; or

when {Z_i} is {6 0 2 6 4 2}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{1, -3, -3, -1, -3, -3, -1, 3, -3, 3, -1, -1},

{-1, -3, -1, 3, 3, -3, -3, 3, -1, -1, -3, -1},

{-1, 1, 3, 3, 3, 1,-1, 1, -3, 1, -1,-3},

{1, 3, 1, 1, -3, 3, 1, 3, 3, -1, 1, -1}; or

when {Z_i} is {0 6 4 4 2 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{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, -1, 1, 1, 3, 3, 1, 1},

{-3, 3, -3, 3, 1, -1, -1, 1, -3, -1, -1, 1}; or

when {Z_i} is {2 6 6 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{3, -3, -3, -3, 1, 3, -3, 1, 3, 1, -1, 3},

{-3, -3, -1, -3, 3, 3, 1, 3, -1, 3, 3, -3}; or

when {Z_i} is {6 2 2 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-3, 1, 3, 1, -1, 3, 3, -3, -3, -3, 1, 3},

{3, 1, -3, -3, -3, 3, 3, -1, 1, 3, 1, -3}; or

when {Z_i} is {6 6 2 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-3, -3, 3, -3, -1, -1, 3, 1, 1, -3, 1,-1},

{-3, 3, 3, 3, -1, -3, -3, 1, 3, -3, 3, -1}; or

when {Z_i} is {2 2 6 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} is one of the following sequences or one of equivalent sequences of the following sequences:

{-1, 3, 1, 3, -3, 1, 1, -1, 3, 3, 3, 1},

{-3, 3, 3,-1, 3, 1, 1, 1,-1, 1, 3, 3};

wherein an equivalent sequence of {s_n} is {q_n}, wherein q_n = s_n + u_n (mod8), 0 ≤ n ≤ 11, and

a sequence {u_i} 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}.

8. A signal reception method in wireless communication, comprising:

receiving a signal on 2 x N subcarriers;

obtaining 2 x N elements of a sequence {f'_n}, wherein f'_n is an element of {f'_n}, N is a positive integer and an even number, n is an integer, and 0 ≤ n ≤ 2 x N - 1; and processing the signal on the 2 x N subcarriers based on the 2 x N elements of {f'_n};

wherein {f'_n} is as follows:

when n is an odd number, f'_n = A₃ · x_n · exp(2π · j · α' · n);

when n is an even number, f'_n = A₄ · x_n · exp(2π · j · α' ·n); wherein

wherein A₃ and A₄ are non-zero complex numbers, α' is a real number,

exp(j×h) represents e^j×h, and h is any real number; and{x_n} is a sequence that meets the following conditions: an element xnin {x_n} meets: x_n = u · exp(π · j · s_n / 4), wherein u is a non-zero complex number, {s_n} is a sequence composed of s_n, and

the sequence {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} 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 {s_n} is {q_n}, wherein q_n = s_n + u_n(mod 8), 0 ≤ n ≤ 11, and

a sequence {u_i} 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}.

9. The method according to claim 7 or 8, wherein the receiving a signal on 2 x N subcarriers comprising:

obtaining, on 2 x N contiguous subcarriers, the signal on the 2 x N subcarriers; or

obtaining, on 2 x N noncontiguous and equally gapped subcarriers, the signal on the 2 x N subcarriers; or

obtaining the signal on the 2 x N subcarriers of a subcarrier group 1 and a subcarrier group 2, wherein the subcarrier group 1 and the subcarrier group 2 each comprise N contiguous subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier; or

obtaining the signal on the 2 x N subcarriers of a subcarrier group 1 and a subcarrier group 2, wherein the subcarrier group 1 and the subcarrier group 2 each comprise N noncontiguous and equally gapped subcarriers, and the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier.

10. The method according to claim 9, wherein
that the subcarrier group 1 and the subcarrier group 2 are separated by at least one subcarrier comprises:
the subcarrier group 1 and the subcarrier group 2 are separated by at least N-1 subcarriers.

11. The method according to any one of claims 7 to 10, wherein value ranges of A₃ and A₄ are {1, -1,j, -j}.

12. A communications apparatus, comprising:
a processor and a memory, wherein the storage unit stores an instruction, and the instruction is used to enable the processor to perform the method according to any one of claims 1 to 11.

13. The communications apparatus according to claim 12, comprising: a transceiver, wherein the transceiver is configured to send, on the 2 x N subcarriers, a signal that carries the sequence {f_n}, or the transceiver is configured to receive a signal; and
the processor is further configured to obtain the signal on the 2 x N subcarriers based on the received signal.

Ansprüche

1. Signalübermittlungsverfahren in der drahtlosen Kommunikation, umfassend:

Bestimmen einer Sequenz {f_n}, die 2 x N Elemente umfasst, wobei f_n ein Element von {f_n} ist, N eine positive ganze Zahl und eine gerade Zahl ist, n eine ganze Zahl ist und 0 ≤ n ≤ 2 x N - 1 gilt;

Zuordnen der Sequenz {f_n} zu 2 x N Hilfsträgern; und

Senden eines Signals, das die Sequenz {f_n} trägt, auf den 2 x N Hilfsträgern;

wobei die Sequenz {f_n} wie folgt lautet:

wenn n eine ungerade Zahl ist, f_n = A₁ · x_n · exp(2π · j · α · n);

wenn n eine gerade Zahl ist, f_n = A₂ · x_n ·exp(2π · j · α · n);

wobei A₁ und A₂ komplexe Zahlen ungleich null sind, α eine reelle Zahl ist,

exp(j×h) e^jxh darstellt und h eine beliebige reelle Zahl ist; und {x_n} eine Sequenz ist, die sich aus x_n zusammensetzt und zumindest einer der folgenden Bedingungen entspricht:

Bedingung 1: wenn n eine gerade Zahl größer oder gleich 0 und kleiner oder gleich N-1 ist,

wenn n eine ungerade Zahl größer oder gleich 0 und kleiner oder gleich N-1 ist,

wobei a=1 oder -1,

und N eine positive ganze Zahl und eine gerade Zahl ist; und

Bedingung 2: wenn N=6,


und



wobei b_n = c·exp(π·j·y_n+3/4), c eine komplexe Zahl ungleich null ist, 0 ≤ n ≤ 2 gilt und
{y₀y₁y₂y₃y₄y₅} eine der folgenden Sequenzen ist:

{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 0},

wobei

wenn N=6, ein Element x_n von {x_n}, wobei 0 ≤ n ≤ 11 gilt, Folgendem entspricht:

x_n = g x exp(π x j x s_n/4), wobei g eine komplexe Zahl ungleich null ist, {s_n} eine Sequenz ist, die sich aus s_n, zusammensetzt, und

wenn {x_n} der Bedingung 1 entspricht, ist {s_n} = {s₀, s₁, S2, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der folgenden Sequenzen:

{1, 3, 3, 1, -3, -1, 3, 1, -3, -1, -1, -3},

{-3, 1, 3, 1, -3, -3, -1, -1, -3, -1, -1, 3},

{-1, 3, -1, 1, 3, 3, 1, 1, 1, -1, -3, 1},

{1, -1, -3, 1, -3, -1, 3, -3, -1, -1, -1, -3},

{3, 1, -3, -3, 3, -3, -3, -1, -1, 3, -3, 3}; und/oder

wenn die Sequenz {x_n} der Bedingung 2 entspricht, entspricht {s_n} den folgenden Bedingungen:

wenn {Z_i} {2 0 6 2 4 6} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{1, 3, -3, 1, 3, 3, -3, -3, -3, 3, 1},

{1, -3, 1, -1, -3, -3, 3, -1, 1, 3, 3, 3},

{3, -3, -3, 1, 3, 1, -1, 1, -1, -1, 3, 1},

(3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3},

{3, 1, 3, 3, -1, 1, -1, -3, -3, 1, -1, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3}, oder

wenn {Z_i} {6 0 2 6 4 2} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{1, -3, -3, -1, -3, -3, -1, 3, -3, 3, -1, -1},

{-1, -3, -1, 3, 3, -3, -3, 3, -1, -1, -3, -1},

{-1, 1, 3, 3, 3, 1, -1, 1, -3, 1, -1}, -3},

{1, 3, 1, 1, -3, 3, 1, 3, 3, -1, 1, -1}; oder

wenn {Z_i} {0 6 4 4 2 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{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, -1, 1, 1, 3, 3, 1, 1},

-3, 3, -3, 3, 1, -1, -1, 1, -3, -1, -1, 1}; oder

wenn {Z_i} {2 6 6 4 4 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{3, -3, -3, -3, 1, 3, -3, 1, 3, 1, -1, 3},

{-3, -3, -1, -3, 3, 3, 1, 3, -1, 3, 3, -3},
oder

wenn {Z_i} {6 2 2 4 4 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{-3, 1, 3, 1, -1, 3, 3, -3, -3, -3, 1, 3},

{3, 1, -3, -3, -3, 3, 3, -1}, 1, 3, 1, -3}; oder

wenn {Z_i} {6 6 2 4 0 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{-3, -3, 3, -3, -1, -1, 3, 1, 1, -3, 1, -1},

{-3, 3, 3, 3, -1, -3, -3, 1, 3, -3, 3, -1}; oder

wenn {Z_i} {2 2 6 4 0 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{-1, 3, 1, 3, -3, 1, 1, -1, 3, 3, 3, 1},

{-3, 3, 3, -1, 3, 1, 1, 1, -1, 1, 3, 3};

wobei eine äquivalente Sequenz von {s_n} {q_n} ist, wobei q_n = s_n + u_n(mod8) sowie 0 ≤ n ≤ 11 gilt und

eine Sequenz {u_i} eine der folgenden Sequenzen ist:

{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} und

{6,6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

2. Signalübermittlungsverfahren in der drahtlosen Kommunikation, umfassend:

Bestimmen einer Sequenz {f_n}, die 2 x N Elemente umfasst, wobei f_n ein Element von {f_n} ist, N eine positive ganze Zahl und eine gerade Zahl ist, n eine ganze Zahl ist und 0 ≤ n ≤ 2 x N - 1 gilt, wobei N=6;

Zuordnen der Sequenz {f_n} zu 2 x N Hilfsträgern; und

Senden eines Signals, das die Sequenz {f_n} trägt, auf den 2 x N Hilfsträgern;

wobei die Sequenz {f_n} wie folgt lautet:

wenn n eine ungerade Zahl ist, f_n = A₁ x x_n x exp(2π x j x α x n)

wenn n eine gerade Zahl ist, f_n = A₂ x x_n x exp(2π x j x α x n)

wobei A₁ und A₂ komplexe Zahlen ungleich null sind, α eine reelle Zahl ist,

exp(j x h) e^jxh darstellt und h eine beliebige reelle Zahl ist; und

{x_n} eine Sequenz ist, die den folgenden Bedingungen entspricht: ein Element x_n in {x_n} entspricht Folgendem:

x_n = u x exp(π x j x s_n/4), wobei u eine komplexe Zahl ungleich null ist,

wobei {s_n} eine Sequenz ist, die sich aus s_n zusammensetzt,

wobei die Sequenz {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen ist:

{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} und

{-3, 3, -3, -1, 1, -3, 1, 1, 1, 3, 1,-1};

wobei eine äquivalente Sequenz von {s_n} {q_n} ist, wobei q_n = s_n + u_n(mod8) sowie 0 ≤ n ≤ 11 gilt und
eine Sequenz {u_i} eine der folgenden Sequenzen ist:

{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} und

{6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}

3. Verfahren nach Anspruch 1 oder 2, wobei das Zuordnen der Sequenz {f_n} zu 2 x N Hilfsträgern Folgendes umfasst:

Zuordnen von {f_n} zu 2 x N kontinuierlichen Hilfsträgern; oder

Zuordnen von {f_n} zu 2 x N nicht-kontinuierlichen und gleichmäßig beabstandeten Hilfsträgern; oder

Zuordnen von {f_n} zu einer Hilfsträgergruppe 1 und einer Hilfsträgergruppe 2, wobei die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 jeweils N kontinuierliche Hilfsträger umfassen und die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 durch zumindest einen Hilfsträger getrennt sind; oder

Zuordnen von {f_n} zu einer Hilfsträgergruppe 1 und einer Hilfsträgergruppe 2, wobei die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 jeweils N nicht-kontinuierliche und gleichmäßig beabstandete Hilfsträger umfassen und die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 durch zumindest einen Hilfsträger getrennt sind.

4. Verfahren nach Anspruch 3, wobei,
dass die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 durch zumindest einen Hilfsträger getrennt sind, Folgendes umfasst:
dass die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 durch zumindest N-1 Hilfsträger getrennt sind.

5. Verfahren nach einem der Ansprüche 1 bis 4, wobei die Wertebereiche von A₁ und A₂ {1,-1, j, -j} sind.

6. Verfahren nach einem der Ansprüche 1 bis 4, wobei
A₁ und A₂ modulierte Symbole sind; oder
A₁ ein moduliertes Symbol ist und A₂ eine Konstante ist; oder
A₂ ein moduliertes Symbol ist und A₁ eine Konstante ist.

7. Signalempfangsverfahren in der drahtlosen Kommunikation, umfassend:

Empfangen eines Signals auf 2 x N Hilfsträgern;

Erhalten von 2 x N Elementen einer Sequenz {f'_n}, wobei f'_n ein Element von f'_n}, ist, N eine positive ganze Zahl und eine gerade Zahl ist, n eine ganze Zahl ist und 0 ≤ n ≤ 2 x N - 1 gilt; und Verarbeiten des Signals auf den 2 x N Hilfsträgern auf Grundlage der 2 x N Elemente von {f'_n};

wobei {f'_n} wie folgt lautet:

wenn n eine ungerade Zahl ist, f'_n = A₃·x_n·exp(2π·j·α'·n);

wenn n eine gerade Zahl ist, f'_n = A₄·x_n·exp(2π·j·α'·n);

wobei A₃ und A₄ komplexe Zahlen ungleich null sind, α' eine reelle Zahl ist,

exp(j x h) e^jxh darstellt und h eine beliebige reelle Zahl ist; und wobei {x_n} eine Sequenz ist, die sich aus x_n zusammensetzt und zumindest eine der folgenden Bedingungen erfüllt:

Bedingung 1: wenn n eine ungerade Zahl größer oder gleich 0 und kleiner oder gleich N-1 ist,

wenn n eine ungerade Zahl größer oder gleich 0 und kleiner oder gleich N-1 ist,

wobei a=1 oder -1,

und N eine positive ganze Zahl und eine gerade Zahl ist; und

Bedingung 2: wenn N=6,
X_2n+6 = a_n x j X x_2n und
X_2n+1+6 = b_n X x_2n+1

wobei b_n = c·exp(π·j·y_n+3/4), c eine komplexe Zahl ungleich null ist, 0 ≤ n ≤ 2 gilt und
{y₀ y₁ y₂ y₃ y₄ y₅} eine der folgenden Sequenzen ist: {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 6 2 2},
{6 4 2 6 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} und
{0 0 4 2 6 6}; wobei

wenn N=6, ein Element x_n von {x_n}, wobei 0 ≤ n ≤ 11 gilt, Folgendem entspricht:

x_n = g x exp(π x j x s_n/4), wobei g eine komplexe Zahl ungleich null ist, {s_n} eine Sequenz ist, die sich aus s_n, zusammensetzt, und

wenn {x_n} der Bedingung 1 entspricht, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der folgenden Sequenzen:

{1, 3, 3, 1, -3, -1, 3, 1, -3, -1, -1, -3},

{-3, 1, 3, 1, -3, -3, -1, -1, -3, -1, -1, 3},

{-1, 3, -1, 1, 3, 3, 1, 1, 1, -1, -3, 1},

{1, -1, -3, 1, -3, -1, 3, -3, -1, -1, -1, -3},

{3, 1, -3, -3, 3, -3, -3, -1, -1, 3, -3, 3}; und/oder

wenn die Sequenz {x_n} der BedingungAblauf2 entspricht, entspricht {s_n} den folgenden Bedingungen:

wenn {Z_i} {2 0 6 2 4 6} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{1, 3, -3, 1, -3, 3, 3, -3, -3, -3, 3, 1},

{1, -3, 1, -1, -3, -3, 3, -1, 1, 3, 3, 3},

{3, -3, -3, 1, 3, 1, -1, 1, -1, -1, 3, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3},

{3, 1, 3, 3, -1, 1, -1, -3, -3, 1, -1, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3},
oder

wenn {Z_i} {6 0 2 6 4 2} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{1, -3, -3, -1, -3, -3, -1, 3, -3, 3, -1, -1},

{-1, -3, -1, 3, 3, -3, -3, 3, -1, -1, -3, -1},

{-1, 1, 3, 3, 3, 1, -1, 1, -3, 1, -1, -3},

{1, 3, 1, 1, 3, 3, 1, 3, 3, -1, 1, -1}; oder

wenn {Z_i} {0 6 4 4 2 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{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, -1, 1, 1, 3, 3, 1, 1},

{-3, 3, -3, 3, 1, -1, -1, 1, -3, -1, -1, 1};
oder

wenn {Z_i} {2 6 6 4 4 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{3, -3, -3, -3, 1, 3, -3, 1, 3, 1, -1, 3},

{-3, -3, -1, -3, 3, 3, 1, 3, -1, 3, 3, -3}; oder

wenn {Z_i} {6 2 2 4 4 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{-3, 1, 3, 1, -1, 3, 3, -3, -3, -3, 1, 3},

{3, 1, -3, -3, -3, 3, 3, -1, 1, 3, 1, -3}; oder

wenn {Z_i} {6 6 2 4 0 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{-3, -3, 3, -3, -1, -1, 3, 1, 1, -3, 1, -1},

{-3, 3, 3, 3, -1, -3, -3, 1, 3, -3, 3, -1}; oder

wenn {Z_i} {2 2 6 4 0 0} ist, ist {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen:

{-1, 3, 1, 3, -3, 1, 1, -1, 3, 3, 3, 1},

{-3, 3, 3, -1, 3, 1, 1, 1, -1, 1, 3, 3};

wobei eine äquivalente Sequenz von {s_n} {q_n} ist, wobei q_n = s_n + u_n(mod8) sowie 0 ≤ n ≤ 11 gilt und

eine Sequenz {u_i} eine der folgenden Sequenzen ist:

{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}
und

{6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

8. Signalempfangsverfahren in der drahtlosen Kommunikation, umfassend:

Empfangen eines Signals auf 2 x N Hilfsträgern;

Erhalten von 2 x N Elementen einer Sequenz {f'_n}, wobei f'_n ein Element von {f'_n} ist, N eine positive ganze Zahl und eine gerade Zahl ist, n eine ganze Zahl ist und 0 ≤ n ≤ 2 x N - 1 gilt; und Verarbeiten des Signals auf den 2 x N Hilfsträgern auf Grundlage der 2 x N Elemente von {f'_n};

wobei {f'_n} wie folgt lautet:

wenn n eine ungerade Zahl ist, f'_n = A₃·x_n·exp(2π·j·α'·n);

wenn n eine gerade Zahl ist, f'_n = A₄·x_n·exp(2π·j·α'·n); wobei

wobei A₃ und A₄ komplexe Zahlen ungleich null sind, α' eine reelle Zahl ist,

exp(j x h) e^jxh darstellt und h eine beliebige reelle Zahl ist; und {x_n} eine Sequenz ist, die den folgenden Bedingungen entspricht: ein Element x_n in {x_n} entspricht Folgendem: x_n = u exp(π x j x s_n/4), wobei u eine komplexe Zahl ungleich null ist, {s_n} eine Sequenz ist, die sich aus s_n zusammensetzt, und

wobei {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} eine der folgenden Sequenzen oder eine von äquivalenten Sequenzen der Folgenden Sequenzen ist:

{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} und

{-3, 3, -3, -1, 1, -3, 1, 1, 1, 3, 1, -1};

wobei eine äquivalente Sequenz von {s_n} {q_n} ist, wobei q_n = s_n + u_n(mod8) sowie 0 ≤ n ≤ 11 gilt und

eine Sequenz {u_i} eine der folgenden Sequenzen ist:

{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} und

{6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

9. Verfahren nach Anspruch 7 oder 8, wobei das Empfangen eines Signals auf 2 x N Hilfsträgern Folgendes umfasst:

Erhalten des Signals auf den 2 x N Hilfsträgern auf 2 X N kontinuierlichen Hilfsträgern; oder

Erhalten des Signals auf den 2 x N Hilfsträgern auf 2 X N nicht-kontinuierlichen und gleichmäßig beabstandeten Hilfsträgern; oder

Erhalten des Signals auf den 2 x N Hilfsträgern einer Hilfsträgergruppe 1 und einer Hilfsträgergruppe 2, wobei die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 jeweils N kontinuierliche Hilfsträger umfassen und die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 durch zumindest einen Hilfsträger getrennt sind; oder

Erhalten des Signals auf den 2 x N Hilfsträgern einer Hilfsträgergruppe 1 und einer Hilfsträgergruppe 2, wobei die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 jeweils N nichtkontinuierliche und gleichmäßig beabstandete Hilfsträger umfassen und die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 durch zumindest einen Hilfsträger getrennt sind.

10. Verfahren nach Anspruch 9, wobei,
dass die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 durch zumindest einen Hilfsträger getrennt sind, Folgendes umfasst:
dass die Hilfsträgergruppe 1 und die Hilfsträgergruppe 2 durch zumindest N-1 Hilfsträger getrennt sind.

11. Verfahren nach einem der Ansprüche 7 bis 10, wobei die Wertebereiche von A₃ und A₄ {1, -1, j, -j} sind.

12. Kommunikationsvorrichtung, umfassend:
einen Prozessor und einen Speicher, wobei auf der Speichereinheit eine Anweisung gespeichert ist und die Anweisung verwendet wird, um zu ermöglichen, dass der Prozessor das Verfahren nach einem der Ansprüche 1 bis 11 durchführt.

13. Kommunikationsvorrichtung nach Anspruch 12, umfassend: einen Sendeempfänger, wobei der Sendeempfänger konfiguriert ist, um ein Signal, das die Frequenz {f_n} trägt, auf den 2 x N Hilfsträgern zu senden, oder der Sendeempfänger konfiguriert ist, um ein Signal zu empfangen; und
der Prozessor ferner konfiguriert ist, um das Signal auf Grundlage des empfangene Signals auf den 2 x N Hilfsträgern zu erhalten.

Revendications

1. Procédé de transmission de signal dans une communication sans fil, comprenant :

la détermination d'une séquence {f_n} qui comprend 2 x N éléments, dans lequel f_n est un élément de {f_n}, N est un entier positif et un nombre pair, n est un entier, et 0 ≤ n ≤ 2 x N - 1 ;

le mappage de la séquence {f_n} à 2 x N sous-porteuses ; et

l'envoi, sur les 2 x N sous-porteuses, d'un signal qui porte la séquence {f_n} ;

dans lequel la séquence {f_n} est comme suit :

quand n est un nombre impair,f_n = A₁·x_n·exp(2π·j·α·n);

quand n est un nombre pair, f_n = A₂·x_n·exp(2π·j·α·n);

A₁ et A₂ sont des nombres complexes non nuls, α est un nombre réel,

représente e^jxh, et h est un quelconque nombre réel, et {x_n} est une séquence composée de x_n et satisfait à au moins une des conditions suivantes :

condition 1 : quand n est un nombre pair supérieur ou égal à 0 et inférieur ou égal à N-1,

quand n est un nombre impair supérieur ou égal à 0 et inférieur ou égal à N-1,

dans lequel a=1 ou -1,

et N est un entier positif et un nombre pair ; et

condition 2 : quand N=6,

et



dans lequel b_n = c·exp(π·j·y_n+3/4), c est un nombre complexe non nul, 0 ≤ n ≤ 2, et
{y₀ y₁ y₂ y₃ y₄ y₅} est une des séquences suivantes :

{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};

dans lequel

quand N=6, un élément x_n de {x_n}, dans lequel 0 ≤ n ≤ 11, satisfait à

x_n = g·exp(π·j·s_n/4), dans lequel g est un nombre complexe non nul, {s_n} est une séquence composée de s_n, et

quand {x_n} satisfait à la condition 1, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{1, 3, 3, 1, -3, -1, 3, 1, -3, -1, -1, -3},

{-3, 1, 3, 1, -3, -3, -1, -1, -3, -1, -1, 3},

{-1, 3, -1, 1, 3 3, 1, 1, 1, -1, -3, 1},

{1, -1, -3, 1, -3, -1, 3, -3, -1, -1, -1, -3},

{3, 1, -3, -3, 3, -3, -3, -1, -1, 3, -3, 3}; et/ou

quand la séquence {x_n} satisfait à la condition 2, {s_n} satisfait aux conditions suivantes :

quand {Z_i} est {2 0 6 2 4 6}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{1, 3, -3, 1, -3, 3, 3, -3, -3, -3, 3, 1},

{1, -3, 1, -1, -3, -3, 3, -1, 1, 3, 3, 3},

{3, -3, -3, 1, 3, 1, -1, 1, -1, -1, 3, 1},

{3, 1, 1, 1, 3, -3, -1, 3, 3, -1, 3, -3},

{3, 1, 3, 3, -1, 1, -1, -3, -3, 1, -1, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3};
ou

quand {Z_i} est {6 0 2 6 4 2}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{1, -3, -3, -1, -3, -3, -1, 3, -3, 3, -1, -1},

{-1, -3, -1, 3, 3, -3, -3, 3, -1, -1, -3, -1},

{-1, 1, 3, 3, 3, 1, -1, 1, -3, 1, -1, -3},

{1, 3, 1, 1, -3, 3, 1, 3, 3, -1, 1, -1};
ou

quand {Z_i} est {0 6 4 4 2 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{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, -1, 1, 1, 3, 3, 1, 1},

{-3, 3, -3, 3, 1, -1, -1, 1, -3, -1, -1, 1};
ou

quand {Z_i} est {2 6 6 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{3, -3, -3, -3, 1, 3, -3, 1, 3, 1, -1, 3},

{-3, -3, -1, -3, 3, 3, 1, 3, -1, 3, 3, -3};
ou

quand {Z_i} est {6 2 2 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{-3, 1, 3, 1, -1, 3, 3, -3, -3, -3, 1, 3},

{3, 1, -3, -3, -3, 3, 3, -1, 1, 3, 1, -3}; ou

quand {Z_i} est {6 6 2 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{-3, -3, 3, -3, -1, -1, 3, 1, 1, -3, 1, -1},

{-3, 3, 3, 3, -1, -3, -3, 1, 3, -3, 3, -1}; ou

quand {Z_i} est {2 2 6 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{-1, 3, 1, 3, -3, 1, 1, -1, 3, 3, 3, 1},

{-3, 3, 3, -1, 3, 1, 1, 1, 1, 1, 3, 3},

dans lequel une séquence équivalente de {s_n} est {q_n}, dans lequel q_n = s_n + u_n(mod8), 0 ≤ n ≤ 11, et

une séquence {u_i} est une des séquences suivantes :

{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,

{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}, et

{6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

2. Procédé de transmission de signal dans une communication sans fil, comprenant :

la détermination d'une séquence {f_n} qui comprend 2 x N éléments, dans lequel f_n est un élément de {f_n}, N est un entier positif et un nombre pair, n est un entier, et 0 ≤ n ≤ 2 x N - 1, dans lequel N=6 ;

le mappage de la séquence {f_n} à 2 x N sous-porteuses ; et

l'envoi, sur les 2 x N sous-porteuses, d'un signal qui porte la séquence {f_n} ;

dans lequel la séquence {f_n} est comme suit :

quand n est un nombre impair, f_n = A₁·X_n·exp(2π·j·α·n) ;

quand n est un nombre pair, f_n = A₂·x_n·exp(2π·j·α·n) ;

A₁ et A₂ sont des nombres complexes non nuls, α est un nombre réel,

exp(jxh) représente e^jxh, et h est un quelconque nombre réel ; et

{x_n} est une séquence qui satisfait aux conditions suivantes : un élément x_n dans {x_n} satisfait à :

x_n = u·exp(π·j·s_n/4), dans lequel u est un nombre complexe non nul,

{s_n} est une séquence composée de s_n,

la séquence {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{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}, et

{-3, 3, -3, -1, 1, -3, 1, 1, 1, 3, 1, -1};

une séquence équivalente de {s_n} est {q_n}, dans lequel q_n = s_n + u_n(mod8), 0 ≤ n ≤ 11, et

une séquence {u_i} est une des séquences suivantes :

{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, 6},

{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},
et

{6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

3. Procédé selon la revendication 1 ou 2, dans lequel le mappage de la séquence {f_n} à 2 x N sous-porteuses comprend :

le mappage de {f_n} à 2 x N sous-porteuses contiguës ; ou

le mappage de {f_n} à 2 x N sous-porteuses non contiguës et écartées de manière égale ; ou

le mappage de {f_n} à un groupe de sous-porteuses 1 et un groupe de sous-porteuses 2, dans lequel le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 comprennent chacun N sous-porteuses contiguës et le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 sont séparés d'au moins une sous-porteuse ; ou

le mappage de {f_n} à un groupe de sous-porteuses 1 et un groupe de sous-porteuses 2, dans lequel le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 comprennent chacun N sous-porteuses non contiguës et écartées de manière égale, et le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 sont séparés d'au moins une sous-porteuse.

4. Procédé selon la revendication 3, dans lequel
le fait que le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 sont séparés d'au moins une sous-porteuse comprend :
le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 sont séparés d'au moins N-1 sous-porteuses.

5. Procédé selon l'une quelconque des revendications 1 à 4, dans lequel des plages de valeurs de A₁ et A₂ sont {1, -1, j, -j}.

6. Procédé selon l'une quelconque des revendications 1 à 4, dans lequel
A₁ et A₂ sont des symboles modulés ; ou
A₁ est un symbole modulé et A₂ est une constante ; ou
A₂ est un symbole modulé et A₁ est une constante.

7. Procédé de réception de signal dans une communication sans fil, comprenant :

la réception d'un signal sur 2 x N sous-porteuses ;

l'obtention de 2 x N éléments d'une séquence {f'_n}, dans lequel f'_n est un élément de {f'_n}, N est un entier positif et un nombre pair, n est un entier, et 0 ≤ n ≤ 2 x N - 1 ; et le traitement du signal sur les 2 x N sous-porteuses sur la base des 2 x N éléments de {f'_n};

dans lequel {f'_n} est comme suit :

quand n est un nombre impair, f'_n = A₃ · x_n ·exp(2π · j·α'·n);

quand n est un nombre pair, f'_n = A₄ · x_n ·exp(2π · j·α'·n);

A₃ et A₄ sont des nombres complexes non nuls, α' est un nombre réel,

exp(jxh) représente e^jxh, et h est un quelconque nombre réel ; et

{x_n} est une séquence composée de x_n et satisfait à au moins une des conditions suivantes :

condition 1 : quand n est un nombre pair supérieur ou égal à 0 et inférieur ou égal à N-1,

quand n est un nombre impair supérieur ou égal à 0 et inférieur ou égal à N-1,

dans lequel a=1 ou -1,

et N est un entier positif et un nombre pair ; et

condition 2 : quand N=6,
X_2n+6 = a_n · x_2n, et
x_2n+1+6 = b_n · x_2n+1,

dans lequel b_n = c·exp(π · j·y_n+3/4), c est un nombre complexe non nul, 0 ≤ n ≤ 2 , et
{Y₀ y₁ y₂ y₃ y₄ y₅} est une des séquences suivantes :

{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}, et

{0 0 4 2 6 6} ;

dans lequel quand N=6, un élément x_n de {x_n}, dans lequel 0 ≤ n ≤ 11, satisfait à

x_n = g·exp(π·j·s_n/4), dans lequel g est un nombre complexe non nul, {s_n} est une séquence composée de s_n, et

quand {x_n} satisfait à la condition 1, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{1, 3, 3, 1, -3, -1, 3, 1, -3, -1, -1, -3},

{-3, 1, 3, 1, -3, -3, -1, -1, -3, -1, -1, 3},

{-1, 3, -1, 3, -1, -3, 1},

{1, -1, -3, 1, -3, -1, 3, -3, -1, -1, -1, -3},

{3, 1, -3, -3, 3, -3, -3, -1, -1, 3, -3, 3}; et/ou

quand la séquence {x_n} satisfait à la condition 2, {s_n} satisfait aux conditions suivantes :

quand {Z_i} est {2 0 6 2 4 6}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{1, 3, -3, 1, -3, 3, 3, -3, -3, -3, 3, 1},

{1, -3, 1, -1, -3, -3, 3, -1, 1, 3, 3, 3},

{3, -3, -3, 1, 3, 1, -1, 1, -1, -1, 3, 1},

{3, 1, 1, 1, 3, -3, -1, -3, 3, -1, 3, -3},

{3, 1, 3, 3, -1, 1, -1, -3, -3, 1, -,1, 1},

{3, 1, 1, 1, 3, -1, -3, 3, -1, 3, -3};
ou

quand {Z_i} est {6 0 2 6 4 2}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{1, -3, -3, -1, 3, -3, -1, 3, -3, 3, -1, -1},

{-1, -3, -1, 3, 3, -3, -3, 3, -1, -1, -3, -1},

{-1, 1, 3, 3, 3, 1, -1, 1, -3, 1, -1, -3},

{1, 3, 1, 1, -3, 3, 1, 3, 3, -1, 1, -1};
ou

quand {Z_i} est {0 6 4 4 2 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{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, -1, 1, 1, 3, 3, 1, 1},

{-3, 3, -3, 3, 1, -1, -1, 1, -3, - 1, - 1, 1};
ou

quand {Z_i} est {2 6 6 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{3, -3, -3, -3, 1, 3, -3, 1, 3, 1, -1, 3},

{-3, -3, -1, -3, 3, 3, 1, 3, -1, 3, 3, -3}; ou

quand {Z_i} est {6 2 2 4 4 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{-3, 1, 3, 1, -1, 3, 3, -3, -3, -3, 1, 3},

{3, 1, -3, -3, -3, 3, 3, -1, 1, 3, 1, -3};
ou

quand {Z_i} est {6 6 2 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{-3, -3, 3, -3, -1, -1, 3, 1, 1, -3, 1, -1},

{-3, 3, 3, 3, -1, -3, -3, 1, 3, -3, 3, -1}; ou
ou

quand {Z_i} est {2 2 6 4 0 0}, {s_n} = {s₀, s₁, s₂, s₃, s₄, s₅, s₆, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{-1, 3, 1, 3, -3, 1, 1, -1, 3, 3, 3, 1},

{-3, 3, 3, -1, 3, 1, 1, 1, -1, 1, 3, 3};

dans lequel une séquence équivalente de {s_n} est {q_n}, dans lequel q_n = s_n + u_n(mod8), 0 ≤ n ≤ 11, et

une séquence {u_i} est une des séquences suivantes :

{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}, et

{6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

8. Procédé de réception de signal dans une communication sans fil, comprenant :

la réception d'un signal sur 2 x N sous-porteuses ;

l'obtention de 2 x N éléments d'une séquence {f'_n}, dans lequel f'_n est un élément de {f'_n}, N est un entier positif et un nombre pair, n est un entier, et 0 ≤ n ≤ 2 x N - 1 ; et le traitement du signal sur les 2 x N sous-porteuses sur la base des 2 x N éléments de {f'_n};

dans lequel {f'_n} est comme suit :

quand n est un nombre impair, f'_n = A₃ · x_n ·exp(2π· j·α'·n);

quand n est un nombre pair, f'_n = A₄ · x_n ·exp(2π· j·α'·n); dans lequel

dans lequel A₃ et A₄ sont des nombres complexes non nuls, α' est un nombre réel,

exp(jxh) représente e^jxh, et h est un quelconque nombre réel ; et {x_n} est une séquence qui satisfait aux conditions suivantes : un élément x_n dans {x_n} satisfait à : x_n = u·exp(π·j·s_n/4), dans lequel u est un nombre complexe non nul, {s_n} est une séquence composée de s_n, et

la séquence {s_n} = {s₀, s₁, s₂, s₃, S4, s₅, S6, s₇, s₈, s₉, s₁₀, s₁₁} est une des séquences suivantes ou une de séquences équivalentes des séquences suivantes :

{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}, et

{-3, 3, -3, -1, 1, -3, 1, 1, 1, 3, 1, -1};

une séquence équivalente de {s_n} est {q_n}, dans lequel q_n = s_n + u_n(mod8), 0 ≤ n ≤ 11, et

une séquence {u_i} est une des séquences suivantes :

{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} et

{6, 6,6, 6, 6, 6, 6, 6, 6, 6, 6, 6}.

9. Procédé selon la revendication 7 ou 8, dans lequel la réception d'un signal sur 2 x N sous-porteuses comprend :

l'obtention, sur 2 x N sous-porteuses contiguës, du signal sur les 2 x N sous-porteuses ; ou

l'obtention, sur 2 x N sous-porteuses non contiguës et écartées de manière égale, du signal sur les 2 x N sous-porteuses ; ou

l'obtention du signal sur 2 x N sous-porteuses d'un groupe de sous-porteuses 1 et d'un groupe de sous-porteuses 2, dans lequel le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 comprennent chacun N sous-porteuses contiguës et le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 sont séparés d'au moins une sous-porteuse ; ou

l'obtention du signal sur 2 x N sous-porteuses d'un groupe de sous-porteuses 1 et d'un groupe de sous-porteuses 2, dans lequel le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 comprennent chacun N sous-porteuses non contiguës et écartées de manière égale, et le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 sont séparés d'au moins une sous-porteuse.

10. Procédé selon la revendication 9, dans lequel
le fait que le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 sont séparés d'au moins une sous-porteuse comprend :
le groupe de sous-porteuses 1 et le groupe de sous-porteuses 2 sont séparés d'au moins N-1 sous-porteuses.

11. Procédé selon l'une quelconque des revendications 7 à 10, dans lequel des plages de valeurs de A₃ et A₄ sont {1, -1, j, -j}.

12. Dispositif de communication comprenant :
un processeur et une mémoire, dans lequel l'unité de stockage stocke une instruction et l'instruction est utilisée pour permettre au processeur d'effectuer le procédé selon l'une quelconque des revendications 1 à 11.

13. Dispositif de communication selon la revendication 12, comprenant : un émetteur-récepteur, dans lequel l'émetteur-récepteur est configuré pour envoyer, sur les 2 x N sous-porteuses, un signal qui porte la séquence {f_n} ou l'émetteur-récepteur est configuré pour recevoir un signal ; et
le processeur est configuré en outre pour obtenir le signal sur les 2 x N sous-porteuses sur la base du signal reçu.

Drawing