CN117176516A

CN117176516A - Data transmission method and device, data processing method and device and storage medium

Info

Publication number: CN117176516A
Application number: CN202210591038.5A
Authority: CN
Inventors: 李卫敏; 袁志锋; 李志岗; 马一华
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2022-05-27
Filing date: 2022-05-27
Publication date: 2023-12-05
Also published as: WO2023226854A1

Abstract

The embodiment of the invention provides a data transmission method and device, a data processing method and device and a storage medium, wherein the method comprises the following steps: performing Fourier transform on the first data to obtain transformed data; performing cyclic shift on the transformed data according to a cyclic shift value M to obtain shifted data; and transmitting the shifted data. By adopting the technical scheme, the problem that the pilot collision of the scheduling-free transmission based on the pilot is serious in the prior art, so that the scheduling-free transmission performance is affected is solved.

Description

Data transmission method and device, data processing method and device and storage medium

Technical Field

The present invention relates to the field of communications, and in particular, to a data transmission method and apparatus, a data processing method and apparatus, and a storage medium.

Background

Currently, in the process of scheduling-free transmission (Grant-free transmission), a terminal or User Equipment (UE) can autonomously transmit data, and there is no need to transmit a scheduling request and wait for dynamic scheduling. Therefore, the scheduling-free transmission can reduce signaling overhead and transmission delay, and can also reduce terminal power consumption. In addition, the method can be combined with non-orthogonal transmission to improve the number of access users.

The schedule-free transmission includes two methods, namely, a pre-configured schedule-free (semi-persistent scheduling) and a contention-free (content-based grant-free). For pre-configured non-scheduling, the base station pre-configures or semi-statically configures transmission resources (including time-frequency resources, pilots, etc.) for each UE; the base station can avoid collision by configuring different time-frequency resources and/or pilot frequencies used by a plurality of UE so as to perform user identification and detection; in the case of a large number of UEs, the base station may also allocate the same time-frequency resources and pilots that are allowed to be used by some UEs, i.e. allow collision, so that the situation that the time-frequency resources and pilots used by a plurality of UEs are the same and collide occurs. For contention free scheduling, when the UE has a service transmission requirement, transmission resources (including time-frequency resources, pilot frequency and the like) can be randomly selected for contention access and transmission; the time-frequency resources and pilots used by multiple UEs may be the same, i.e., collide.

For the non-scheduling transmission based on the pilot frequency (or reference signal), due to the limited number of the pilot frequency, when the number of the access users is large, the pilot frequency collision is serious, and the performance of the non-scheduling transmission is affected.

Aiming at the problems that pilot collision of pilot-based scheduling-free transmission is serious and scheduling-free transmission performance is affected in the prior art, no effective solution is proposed at present.

Accordingly, there is a need for improvements in the related art to overcome the drawbacks of the related art.

Disclosure of Invention

The embodiment of the invention provides a data transmission method and device, a data processing method and device and a storage medium, which at least solve the problem that pilot collision of pilot-based scheduling-free transmission is serious and scheduling-free transmission performance is affected in the related technology.

According to an aspect of an embodiment of the present invention, there is provided a data transmission method, including: performing Fourier transform on the first data to obtain transformed data; performing cyclic shift on the transformed data according to a cyclic shift value M to obtain shifted data; and transmitting the shifted data.

In an exemplary embodiment, the first data includes at least one of: a symbol generated by appointed modulation of data to be transmitted; and carrying out appointed modulation on data to be transmitted to generate a modulation symbol, adopting a sequence with the length of L1 to spread the modulation symbol to obtain a spread symbol, and taking the spread symbol as first data, wherein L1 is an integer greater than 1.

In one exemplary embodiment, the first data includes: data of a plurality of data blocks, or data of a plurality of communication nodes.

In an exemplary embodiment, the first data includes at least one of: identification information, payload, sequence information, transmission resource information.

In an exemplary embodiment, the cyclic shift is performed on the transformed data according to a cyclic shift value M, so as to obtain shifted data, which includes at least one of the following: performing cyclic shift on the transformed data by M bits, or-M bits, or a x M bits, or-a x M bits to obtain shifted data, wherein a is a designated factor or a factor obtained according to a preset mode; performing cyclic shift on the transformed data in a first designated direction by an amount of M, or-M, or |m|, or a|m, or-a|m, or a|m| to obtain shifted data, wherein |m| is an absolute value of M; performing cyclic shift on the transformed data in a second specified direction by an amount of M, or-M, or |m|, or a|m, or-a|m, or a|m| to obtain shifted data; acquiring the cyclic shift value M according to specified parameters or specified information, and then performing cyclic shift on the transformed data according to the cyclic shift value M to obtain shifted data; according to T cyclic shift values M ₁ 、M ₂ 、...、M _T Respectively performing cyclic shift on T groups of data included in the transformed data to obtain shifted data, wherein T is an integer greater than or equal to 2; repeatedly using the T cyclic shift values, respectively performing cyclic shift on V groups of data included in the transformed data to obtain shifted data, wherein V is greater than TAn integer; and expanding the transformed data by adopting a sequence with the length of L2 to obtain expanded data, and then circularly shifting the expanded data according to a circular shift value M to obtain shifted data, wherein L2 is an integer greater than 1.

In one exemplary embodiment, the shifted data is transmitted, including at least one of: expanding the shifted data by adopting a sequence with the length of L3 to obtain expanded data, and then sending the expanded data, wherein L3 is an integer greater than 1; and transmitting the shifted data through a designated transmission resource, and transmitting only data symbols and not pilot symbols on the designated transmission resource.

According to an embodiment of the present invention, there is provided a data transmission method including: acquiring a first vector according to the cyclic shift value M; multiplying the first data with the first vector to obtain an operation result; performing Fourier transform on the operation result to obtain transformed data; and transmitting the transformed data.

In an exemplary embodiment, the first vector includes at least one of: exp (1 i x 2 x pi/G x M); exp (-1 i x 2 x pi/G x M); exp (1 i x 2 x pi/G x a x M); exp (-1 i x 2 x pi/G x a x M); where g=0, 1,2,., G-1, G is an integer greater than or equal to 1, a is a specified factor or a factor obtained according to a preset mode.

In one exemplary embodiment, the transformed data is transmitted, including at least one of: expanding the transformed data by adopting a sequence with the length of L3 to obtain expanded data, and then sending the expanded data, wherein L3 is an integer greater than 1; the transformed data is transmitted over a designated transmission resource and only data symbols are transmitted over the designated transmission resource without pilot symbols.

According to an aspect of an embodiment of the present invention, there is provided a data processing method, including: channel estimation is carried out according to the second data, and a channel estimation result is obtained; processing the second data according to the channel estimation result to obtain a processing result; performing cyclic shift on the processing result according to a cyclic shift value Q to obtain shifted data; and carrying out inverse Fourier transform on the shifted data to obtain transformed data.

In an exemplary embodiment, the second data includes one of: the received data or the data after resource demapping are used as second data; combining the multi-antenna received data according to the appointed combining vector to obtain second data; despreading the received data by adopting a sequence with the length of L4 to obtain second data; and combining the multi-antenna received data according to the appointed combining vector to obtain combined data, and then despreading the combined data by adopting a sequence with the length of L4 to obtain second data, wherein L4 is an integer greater than 1.

In an exemplary embodiment, channel estimation is performed according to the second data, and a channel estimation result is obtained, including at least one of the following: performing channel estimation according to the data with the conjugate relation in the second data to obtain a channel estimation result; and carrying out channel estimation according to the real data in the second data to obtain a channel estimation result.

In an exemplary embodiment, the processing result is circularly shifted according to a cyclic shift value Q, so as to obtain shifted data, which includes at least one of the following: performing cyclic shift on the processing result in Q bits, or-Q bits, or b x Q bits, or-b x Q bits to obtain shifted data, wherein b is a designated factor or a factor obtained according to a preset mode; performing cyclic shift on the processing result in a first designated direction, wherein the shift quantity is Q, or-Q, or |Q|, or b|Q, or b|Q| to obtain shifted data, and the|Q| is an absolute value of Q; performing cyclic shift of the processing result in a second specified direction by a shift quantity of Q, or-Q, or |Q|, or b|Q, or-b|Q| to obtain shifted data; performing cyclic shift on the processing result according to the cyclic shift value Q to obtain a shifted result Wherein the cyclic shift value Q is opposite to the cyclic shift value M employed by the transmitter; acquiring the cyclic shift value Q according to specified parameters or specified information, and performing cyclic shift on the processing result according to the cyclic shift value Q to obtain shifted data; according to T cyclic shift values Q ₁ 、Q ₂ 、...、Q _T Respectively performing cyclic shift on T groups of data included in the processing result to obtain shifted data, wherein T is an integer greater than or equal to 2; repeatedly using the T cyclic shift values, and respectively carrying out cyclic shift on the V groups of data included in the processing result to obtain shifted data, wherein V is an integer larger than T; and performing despreading on the processing result by adopting a sequence with the length of L5 to obtain despread data, and performing cyclic shift on the despread data according to a cyclic shift value Q to obtain shifted data, wherein L5 is an integer greater than 1.

In an exemplary embodiment, performing inverse fourier transform on the shifted data to obtain transformed data includes: and performing despreading on the shifted data by adopting a sequence with the length of L6 to obtain despread data, and performing inverse Fourier transform on the despread data to obtain transformed data, wherein L6 is an integer greater than 1.

In an exemplary embodiment, at least one of the following is acquired from the transformed data: identification information, payload, sequence information, transmission resource information.

According to another embodiment of the present invention, there is provided a data transmission apparatus including: the first transformation module is used for carrying out Fourier transformation on the first data to obtain transformed data; the first shift module is used for carrying out cyclic shift on the transformed data according to a cyclic shift value M to obtain shifted data; and the transmitting module is used for transmitting the shifted data.

According to another embodiment of the present invention, there is provided a data processing apparatus including: the channel estimation module is used for carrying out channel estimation according to the second data to obtain a channel estimation result; the processing module is used for processing the second data according to the channel estimation result to obtain a processing result; the second shift module is used for carrying out cyclic shift on the processing result according to a cyclic shift value Q to obtain shifted data; and the second transformation module is used for carrying out inverse Fourier transformation on the shifted data to obtain transformed data.

According to a further embodiment of the invention, there is also provided a computer readable storage medium having stored therein a computer program, wherein the computer program is arranged to perform the steps of any of the method embodiments described above when run.

According to a further embodiment of the invention, there is also provided an electronic device comprising a memory having stored therein a computer program and a processor arranged to run the computer program to perform the steps of any of the method embodiments described above.

According to the invention, fourier transformation is carried out on the first data to obtain transformed data; performing cyclic shift on the transformed data according to the cyclic shift value M to obtain shifted data; and then transmitting the shifted data. The invention carries out Fourier transformation on the data, then carries out cyclic shift and sends, thus carrying out channel estimation by utilizing the data with conjugate relation, realizing pilot-free (or pilot-free and pure data) transmission, avoiding pilot collision and improving the performance of scheduling-free transmission.

Drawings

FIG. 1 is a block diagram showing the hardware structure of a computer terminal according to an alternative data transmission method according to an embodiment of the present invention;

FIG. 2 is a flow chart (one) of an alternative data transmission method according to an embodiment of the invention;

FIG. 3 is a flow chart (II) of an alternative data transmission method according to an embodiment of the invention;

FIG. 4 is a flow chart of an alternative data processing method according to an embodiment of the invention;

FIG. 5 is a schematic diagram of an alternative data transmission method of embodiment 1;

FIG. 6 is a further schematic diagram of an alternative data transmission method of embodiment 1;

FIG. 7 is another schematic diagram of an alternative data transmission method of embodiment 1;

FIG. 8 is a further flowchart of an alternative data transmission method of embodiment 1;

fig. 9 is a block diagram of an alternative data transmission device according to an embodiment of the present invention;

FIG. 10 is a block diagram of an alternative data processing apparatus according to an embodiment of the present invention;

fig. 11 is a block diagram of an alternative data transmission device according to an embodiment of the present invention.

Detailed Description

In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.

It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

The method embodiments provided in the embodiments of the present invention may be executed in a computer terminal or similar computing device. Taking a computer terminal as an example, fig. 1 is a block diagram of a hardware structure of a computer terminal according to an alternative data transmission method according to an embodiment of the present invention. As shown in fig. 1, the computer terminal may include one or more (only one is shown in fig. 1) processors 103 (the processor 103 may include, but is not limited to, a microprocessor (Microprocessor Unit, abbreviated MPU) or a programmable logic device (Programmable logic device, abbreviated PLD)) and a memory 104 for storing data, and in an exemplary embodiment, the computer terminal may further include a transmission device 106 for communication functions and an input-output device 108. It will be appreciated by those skilled in the art that the configuration shown in fig. 1 is merely illustrative and is not intended to limit the configuration of the computer terminal described above. For example, a computer terminal may also include more or fewer components than shown in FIG. 1, or have a different configuration than the equivalent functions shown in FIG. 1 or more than the functions shown in FIG. 1.

The memory 104 may be used to store a computer program, for example, a software program of application software and a module, such as a computer program corresponding to a data transmission method in the embodiment of the present invention, and the processor 103 executes the computer program stored in the memory 104, thereby performing various functional applications and data processing, that is, implementing the method described above. Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, memory 104 may further include memory located remotely from processor 103, which may be connected to the computer terminal via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The transmission device 106 is used to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of a computer terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, simply referred to as NIC) that can connect to other network devices through a base station to communicate with the internet. In one example, the transmission device 106 may be a Radio Frequency (RF) module, which is configured to communicate with the internet wirelessly.

Fig. 2 is a flowchart (a) of an alternative data transmission method according to an embodiment of the present invention, and as shown in fig. 2, the steps of the data transmission method include:

step S202, carrying out Fourier transform on first data to obtain transformed data;

step S204, performing cyclic shift on the transformed data according to a cyclic shift value M to obtain shifted data;

step S206, transmitting the shifted data.

Through the steps, fourier transformation is carried out on the first data, and transformed data are obtained; performing cyclic shift on the transformed data according to the cyclic shift value M to obtain shifted data; and then transmitting the shifted data. The above steps perform fourier transform on the data, and then perform cyclic shift and transmit, so that channel estimation can be performed by using the data with conjugate relation, and pilot-free (or pilot-free and pure data) transmission can be realized, so that pilot collision can be avoided, and the performance of scheduling-free transmission can be improved.

The invention provides a data transmission method, which has lower peak-to-average power ratio (Peak to Average Power Ratio, PAPR), so that a transmitter has better power amplifier utilization efficiency, and is beneficial to realizing better signal quality, coverage level and transmission performance.

Embodiments of the present invention have a variety of implementations, including, but not limited to, the implementations and examples provided below. It should be noted that, without conflict, the features in the embodiments, implementations and examples of the present invention may be arbitrarily combined with each other.

It should be noted that, the method provided by the present invention may be applied to a transmitter, where the transmitter at least includes: transmitter such as transmitting node, terminal, user equipment UE, relay device, relay node, base station, and other applicable communication nodes.

In an exemplary embodiment, before fourier transforming the first data, the method further comprises: first data is acquired or generated.

Optionally, in this embodiment, the first data includes a data symbol.

The data to be transmitted includes bits obtained by performing processing such as encoding on the bits to be transmitted; the modulation may be a real modulation, such as Binary Phase Shift Keying (BPSK) modulation; but also complex modulation such as Quadrature Phase Shift Keying (QPSK) modulation; it may also be a high-dimensional modulation or a sequence modulation, e.g. mapping one or more bit modulations to a specified sequence, which may be a real sequence, or a complex sequence, or a sparse sequence, etc.

The sequence with the length L1 may be a real sequence, a complex sequence, or a sparse sequence.

In an exemplary embodiment, the first data includes at least one of: identification information, payload, sequence information, transmission resource information. In another exemplary embodiment, at least one of identification information, payload, sequence information, transmission resource information, etc. may be included in the data to be transmitted; alternatively, at least one of identification information, payload, sequence information, transmission resource information, and the like may be included in the bits to be transmitted.

The payload may include service data, a specific message, and the like. The identification information refers to identification information of the transmitter, and is used by the receiver to determine which transmitter it receives the data sent by. The sequence information includes information of a sequence used when the transmitter performs spreading or mapping processing on the symbol, or information of a specified sequence used when mapping bits to the specified sequence, and may also include information of a sequence set. This information may be used by the receiver to reconstruct the symbols sent by the transmitter for interference cancellation. The transmission resource information includes location information of at least one transmission resource used by the transmitter, may further include information of the number of transmission resources used by the transmitter, and may further include information of available transmission resources. This information may be used by the receiver to determine on which transmission resources the transmitter transmitted in order to detect on those transmission resources. The identification information, the sequence information, or the transmission resource information may be indicated by dedicated bits or may be implicitly indicated by designated bits. For example, one or more of sequence information, transmission resource information is implicitly indicated by a specified bit in the payload and/or identification information; alternatively, one or more of the identification information, the sequence information, the transmission resource information is implicitly indicated by a specified bit in the payload.

In an exemplary embodiment, the first data or the data to be transmitted comprises data of a plurality of data blocks, wherein the data blocks comprise encoded blocks, code blocks, data packets, groups of bits, or groups of symbols, etc.

It should be noted that the data included in the plurality of data blocks may be different or the same, or some of the data may be the same. One or more of payload, identification information, sequence information, transmission resource information, etc. may be carried in each data block; different information may also be carried in different data blocks.

Alternatively, in this embodiment, the first data may be generated from a plurality of data blocks. In one case, the plurality of data blocks may be modulated to generate the first data. For example, complex modulation is performed on the plurality of data blocks, and data in the plurality of data blocks occupy one bit respectively; or, a plurality of data blocks are connected in series or are modulated after being connected in cascade; or respectively modulating the plurality of data blocks to obtain a plurality of groups of modulation symbols, and taking the plurality of groups of modulation symbols as first data. In another case, the data to be transmitted includes data of a plurality of data blocks, specifically, the data to be transmitted may be obtained according to the plurality of data blocks, and then the data to be transmitted is modulated to obtain a modulation symbol, and the modulation symbol is used as the first data. In this case, at least one of payload, identification information, sequence information, transmission resource information, and the like may be carried in the data to be transmitted or the first data.

In an exemplary embodiment, the first data or the data to be transmitted comprises data of a plurality of communication nodes. Wherein the data of each communication node may comprise at least one of a payload, identification information, sequence information, transmission resource information, etc. For example, the data of each communication node includes its identification information, or the data of at least one communication node includes its identification information.

Alternatively, in the present embodiment, the first data may be generated from data of a plurality of communication nodes. In one case, data of a plurality of communication nodes may be modulated to generate first data. For example, complex modulation is performed on data of a plurality of communication nodes, so that the data of the plurality of communication nodes occupy one bit for modulation respectively; or, the data of a plurality of communication nodes are modulated after being connected in series or cascaded; or respectively modulating the data of the plurality of communication nodes to obtain a plurality of groups of modulation symbols, and taking the plurality of groups of modulation symbols as first data. In another case, the data to be transmitted may be obtained according to the data of the plurality of communication nodes, and then the data to be transmitted is modulated to obtain a modulation symbol, and the modulation symbol is used as the first data. In this case, at least one of the payload, the identification information of the at least one communication node, the sequence information, the transmission resource information, and the like may be carried in the data to be transmitted or the first data.

In one exemplary embodiment, the fourier transform includes a discrete fourier transform (Discrete Fourier Transform, DFT) or a fast fourier transform (Fast Fourier Transform, FFT).

In an exemplary embodiment, before cyclically shifting the transformed data according to a cyclic shift value M, the method further comprises: a cyclic shift value M is acquired.

In an exemplary embodiment, the cyclic shift value M includes one or more cyclic shift values.

In an exemplary embodiment, the cyclic shift is performed on the transformed data according to a cyclic shift value M, so as to obtain shifted data, which includes at least one of the following: performing cyclic shift on the transformed data by M bits, or-M bits, or a x M bits, or-a x M bits to obtain shifted data, wherein a is a designated factor or a factor obtained according to a preset mode; performing cyclic shift on the transformed data in a first designated direction by an amount of M, or-M, or |m|, or a|m, or-a|m, or a|m| to obtain shifted data, wherein |m| is an absolute value of M; performing cyclic shift on the transformed data in a second specified direction by an amount of M, or-M, or |m|, or a|m, or-a|m, or a|m| to obtain shifted data; acquiring the cyclic shift value M according to specified parameters or specified information, and then performing cyclic shift on the transformed data according to the cyclic shift value M to obtain shifted data; according to T cyclic shift values M ₁ 、M ₂ 、...、M _T Respectively performing cyclic shift on T groups of data included in the transformed data to obtain shifted data, wherein T is an integer greater than or equal to 2; repeatedly using the T cyclic shift values, and respectively carrying out cyclic shift on V groups of data included in the transformed data to obtain shifted data, wherein V is an integer larger than T; and expanding the transformed data by adopting a sequence with the length of L2 to obtain expanded data, and then circularly shifting the expanded data according to a circular shift value M to obtain shifted data, wherein L2 is an integer greater than 1.

M may be an integer or may not be an integer. When M is an integer, M may be an integer less than 0, or M is an integer greater than 0, or M is equal to 0. For example, M smaller than 0 indicates cyclic shift up or to the left, M larger than 0 indicates cyclic shift down or to the right, and M equal to 0 indicates no cyclic shift. Here, M includes a shift direction and a shift number, which is an absolute value of M. It may also be defined that M smaller than 0 means cyclic shifting downward or rightward, and M larger than 0 means cyclic shifting upward or leftward. When the cyclic shift is not performed, the shifted data is the transformed data.

When the shift direction is specified, M may be greater than or equal to 0, for example, M may be an integer greater than or equal to 0, where M represents only the shift number. In one example, the first specified direction includes up or left, then the transformed data is cyclically shifted up or left; the second designated direction comprises downward or rightward, and the transformed data is circularly shifted downward or rightward; other definitions may be reversed or utilized.

Alternatively, in this embodiment, the cyclic shift value M may be obtained according to a specified parameter or specified information, where the specified parameter may include a parameter related to a transmission resource, for example, a symbol index, a slot index, a subframe index, or a retransmission index; the designation information may include information related to transmission resources, pre-configuration information, or received configuration information, etc.

To aid understanding of the above "according to T cyclic shift values M ₁ 、M ₂ 、...、M _T The T sets of data included in the converted data are respectively subjected to cyclic shift to obtain shifted data ", for example, assuming that 2 sets of data are respectively denoted as D1 and D2 and 2 cyclic shift values are respectively denoted as M1 and M2, the data set D1 may be subjected to cyclic shift according to the cyclic shift value M1 and the data set D2 may be subjected to cyclic shift according to the cyclic shift value M2.

Alternatively, in this embodiment, the repeated use of the T cyclic shift values may be two ways, in which the T shift values are reused as a whole, and in which each of the T shift values is reused separately. For example, assuming that 4 sets of data are respectively denoted as D1, D2, D3, and D4, and 2 shift values are respectively denoted as M1 and M2, then 2 shift values, i.e., M1, M2, M1, and M2 are repeatedly used in the first manner, that is, the data set D1 is cyclically shifted according to the shift value M1, the data set D2 is cyclically shifted according to the shift value M2, the data set D3 is cyclically shifted according to the shift value M1, and the data set D4 is cyclically shifted according to the shift value M2; alternatively, 2 shift values, i.e., M1, M2 are reused in the second manner, i.e., the data set D1 is cyclically shifted according to the shift value M1, the data set D2 is cyclically shifted according to the shift value M1, the data set D3 is cyclically shifted according to the shift value M2, and the data set D4 is cyclically shifted according to the shift value M2.

In an exemplary embodiment, performing a cyclic shift on the transformed data to obtain shifted data, including: and expanding the transformed data by adopting a sequence with the length of L2 to obtain expanded data, and then circularly shifting the expanded data to obtain shifted data. In one case, a sequence with a length of L2 may be used to expand a set of transformed data to obtain an L2 set of expanded data, and then the L2 set of expanded data is respectively subjected to cyclic shift, where the cyclic shift values used by each set of data may be the same or different.

In one exemplary embodiment, transmitting the shifted data includes: and mapping the shifted data to a designated transmission resource for transmission. For example, the shifted data is mapped to one or more time domain symbols for transmission, each time domain symbol comprising a plurality of subcarriers or a plurality of resource elements. In one case, assuming that the shifted data includes multiple sets of data, multiple sets of data may be mapped onto multiple time domain symbols for transmission, each set of data occupying one time domain symbol. Wherein the plurality of time domain symbols may be contiguous or non-contiguous.

In one exemplary embodiment, transmitting the shifted data includes: and expanding the shifted data by adopting a sequence with the length of L3 to obtain expanded data, and then transmitting the expanded data, wherein L3 is an integer greater than 1. In one case, a set of shifted data may be extended with a sequence having a length of L3 to obtain an L3 set of extended data, and then the L3 set of extended data is sent, for example, the L3 set of extended data is mapped onto L3 time domain symbols for sending, where each set of data occupies one time domain symbol, and the L3 time domain symbols may be adjacent or non-adjacent.

In one exemplary embodiment, transmitting the shifted data includes: the transformed data is transmitted over a designated transmission resource and only data symbols are transmitted over the designated transmission resource without pilot symbols.

In an exemplary embodiment, the values of L1, L2, and L3 may be the same.

By the data transmission method provided by the embodiment of the invention, the receiver can perform channel estimation according to the data with the conjugate relation in the data sent by the transmitter, and the channel estimation is not needed to be performed by depending on the pilot frequency symbol. Thus, the method may transmit only data symbols and not pilot symbols. Wherein the pilot symbols include pilot sequences, pilot positions, reference signals, preamble sequences, and the like.

The data transmission method provided by the embodiment of the invention can be used for a transmitter to transmit own data or used for a transmitter to transmit data of one or more communication nodes. For example, a relay node receives data sent by two communication nodes, and then sends or forwards the data of the two communication nodes according to the data transmission method; or, a relay node receives data sent by a communication node and then sends the data of the communication node according to the data transmission method, or sends the data of the relay node and the data of the communication node together; or the two communication nodes or the sensing node share one transmitter, the transmitter acquires the data of the two nodes, and then the data of the two nodes are transmitted according to the data transmission method.

The embodiment of the invention provides a data transmission method, which comprises the steps of carrying out Fourier transform on first data to obtain transformed data, carrying out cyclic shift on the transformed data according to a cyclic shift value M to obtain shifted data, and finally sending the shifted data. By the method, the data with conjugate relation can be utilized for channel estimation, so that pilot-free (or pilot-free and pure data) transmission can be realized. The method can be used for scheduling-free transmission, and pilot frequency collision can be avoided, so that the performance of scheduling-free transmission can be improved. In addition, the method has lower peak-to-average power ratio (PAPR), so that the transmitter has better power amplifier utilization efficiency, and is beneficial to realizing better signal quality, coverage level and transmission performance.

Fig. 3 is a flowchart (two) of an alternative data transmission method according to an embodiment of the present invention, and as shown in fig. 3, the steps of the data transmission method include:

step S302, a first vector is obtained according to a cyclic shift value M;

step S304, multiplying the first data with the first vector to obtain an operation result;

step S306, carrying out Fourier transform on the operation result to obtain transformed data;

Step S308, transmitting the transformed data.

Through the steps, the first vector is obtained according to the cyclic shift value M, the first data is multiplied with the first vector to obtain an operation result, then the operation result is subjected to Fourier transform to obtain transformed data, and the transformed data is sent, so that channel estimation can be carried out by using the data with a conjugate relation, pilot-free (or pilot-free and pure data) transmission is realized, pilot collision can be avoided, and the performance of scheduling-free transmission is improved.

Alternatively, in this embodiment, G may be the length of the first data, or the length or the number of points of fourier transform. The multiplication in the above formula may be an element-by-element multiplication or a corresponding element multiplication method.

In an exemplary embodiment, before acquiring the first vector from the cyclic shift value M, the method further comprises: a cyclic shift value M is acquired. For example, the cyclic shift value M is obtained according to a specified parameter or specified information, where the specified parameter may include a parameter related to a transmission resource, such as a symbol index, a slot index, a subframe index, or a retransmission index; the designation information may include information related to transmission resources, pre-configuration information, or received configuration information, etc.

In an exemplary embodiment, before multiplying the first data with the first vector, the method further comprises: first data is acquired or generated.

In an exemplary embodiment, the first data includes at least one of: a symbol generated by appointed modulation of data to be transmitted; and carrying out appointed modulation on data to be transmitted to generate a modulation symbol, adopting a sequence with the length of L1 to spread the modulation symbol to obtain a spread symbol, and taking the spread symbol as first data, wherein L1 is an integer greater than 1. In one case, the spread symbols comprise multiple groups of symbols, and different cyclic shift values may be employed.

In an exemplary embodiment, the first data or the data to be transmitted includes at least one of: identification information, payload, sequence information, transmission resource information.

In an exemplary embodiment, the first data or the data to be transmitted comprises data of a plurality of data blocks or data of a plurality of communication nodes.

In an exemplary embodiment, fourier transforming the operation result to obtain transformed data includes: and expanding the operation result by adopting a sequence with the length of L2 to obtain expanded data, and then performing Fourier transform on the expanded data to obtain transformed data, wherein L2 is an integer greater than 1.

By the data transmission method provided by the embodiment of the invention, the receiver can perform channel estimation according to the data with the conjugate relation in the data sent by the transmitter, and the channel estimation is not needed to be performed by depending on the pilot frequency symbol. Thus, the method may transmit only data symbols and not pilot symbols.

It should be noted that the same effect can be achieved by the embodiment of the present invention as the method of performing the fourier transform and then performing the cyclic shift in advance as shown in fig. 2. Therefore, some technical features in the embodiment shown in fig. 2 are also applicable to the present embodiment, for example, technical features related to the first data, technical features related to the cyclic shift value M, and so on, which are not described herein.

The data transmission method provided by the embodiment of the invention can be also used for a transmitter to transmit the data of the transmitter or used for a transmitter to transmit the data of one or more communication nodes.

The embodiment of the invention provides a data transmission method, which comprises the steps of obtaining a first vector according to a cyclic shift value M, multiplying first data with the first vector to obtain an operation result, carrying out Fourier transform on the operation result to obtain transformed data, and transmitting the transformed data. By the method, the data with conjugate relation can be utilized for channel estimation, so that pilot-free (or pilot-free and pure data) transmission can be realized. The method can be used for scheduling-free transmission, and pilot frequency collision can be avoided, so that the performance of scheduling-free transmission can be improved. In addition, the method has lower peak-to-average power ratio (PAPR), so that the transmitter has better power amplifier utilization efficiency, and is beneficial to realizing better signal quality, coverage level and transmission performance.

FIG. 4 is a flow chart of an alternative data processing method according to an embodiment of the invention, as shown in FIG. 4, comprising the steps of:

Step S402, channel estimation is carried out according to the second data, and a channel estimation result is obtained;

step S404, processing the second data according to the channel estimation result to obtain a processing result;

step S406, performing cyclic shift on the processing result according to the cyclic shift value Q to obtain shifted data;

and step S408, performing inverse Fourier transform on the shifted data to obtain transformed data.

Through the steps, the channel estimation is carried out according to the second data, the channel estimation result is obtained, the second data is processed according to the channel estimation result, the processing result is obtained, the cyclic shift is carried out on the processing result according to the cyclic shift value Q, the shifted data is obtained, the inverse Fourier transform is carried out on the shifted data, and the transformed data is obtained, so that the channel estimation can be carried out by utilizing the data with the conjugation relation, the pilot-free (or pilot-free and pure data) transmission is realized, the pilot collision can be avoided, and the scheduling-free transmission performance is improved.

It should be noted that the method provided in the above steps is applied to a receiver, where the receiver at least includes a receiving node, a base station, a network device, a relay node, and other applicable communication nodes.

In an exemplary embodiment, before performing channel estimation according to the second data, and acquiring a channel estimation result, the method further includes: second data is acquired.

To aid in understanding the above-mentioned "combining the multi-antenna received data according to the specified combining vector to obtain the second data", for example, the receiver performs blind detection, and may combine the multi-antenna received data to obtain the corresponding second data by using all the combining vectors in the combining vector set or the combining vectors identified by the specified method, where the identified combining vectors include one or more vectors.

In order to help understand the above-mentioned "despreading the received data with a sequence of length L4 to obtain the second data", for example, the receiver performs blind detection, and may despread the received data with all sequences in the set of spreading sequences or sequences identified by a specified method, respectively, to obtain corresponding second data, where the identified sequences include one or more sequences.

In one exemplary embodiment, channel estimation is performed according to the second data, and a channel estimation result is obtained, wherein the channel estimation includes one or more of channel amplitude estimation, channel phase estimation, frequency offset estimation, time offset estimation, and the like.

In an exemplary embodiment, the second data is processed according to the channel estimation result to obtain a processing result, where the processing includes one or more of channel equalization processing, channel compensation processing, frequency offset compensation, time offset compensation, and the like.

In an exemplary embodiment, before cyclically shifting the processing result according to the cyclic shift value Q, the method further includes: a cyclic shift value Q is acquired.

In an exemplary embodiment, the cyclic shift value Q includes one or more cyclic shift values.

In an exemplary embodiment, the processing result is circularly shifted according to a cyclic shift value Q, so as to obtain shifted data, which includes at least one of the following: performing cyclic shift on the processing result in Q bits, or-Q bits, or b x Q bits, or-b x Q bits to obtain shifted data, wherein b is a designated factor or a factor obtained according to a preset mode; performing cyclic shift on the processing result in a first designated direction, wherein the shift quantity is Q, or-Q, or |Q|, or b|Q, or b|Q| to obtain shifted data, and the|Q| is an absolute value of Q; performing cyclic shift of the processing result in a second specified direction by a shift quantity of Q, or-Q, or |Q|, or b|Q, or-b|Q| to obtain shifted data; performing cyclic shift on the processing result according to a cyclic shift value Q to obtain shifted data, wherein the cyclic shift value Q is opposite to a cyclic shift value M adopted by a transmitter; acquiring the cyclic shift value Q according to specified parameters or specified information, and performing cyclic shift on the processing result according to the cyclic shift value Q to obtain shifted data; according to T cyclic shift values Q ₁ 、Q ₂ 、...、Q _T Respectively performing cyclic shift on T groups of data included in the processing result to obtain shifted data, wherein T is an integer greater than or equal to 2; repeatedly using the T cyclic shift values, and respectively carrying out cyclic shift on the V groups of data included in the processing result to obtain shifted data, wherein V is an integer larger than T; despreading the processing result by adopting a sequence with the length of L5 to obtain despread data, and then despreading the despread data according to a cyclic shift value QAnd performing cyclic shift to obtain shifted data, wherein L5 is an integer greater than 1.

Q may or may not be an integer. When Q is an integer, Q may be an integer less than 0, or Q is an integer greater than 0, or Q is equal to 0. For example, Q less than 0 indicates cyclic shifting up or to the left, Q greater than 0 indicates cyclic shifting down or to the right, and Q equal to 0 indicates no cyclic shifting. Here Q includes a shift direction and a shift number, the shift number being an absolute value of Q. And when the cyclic shift is not performed, the shifted data is the processing result.

Note that, when the shift direction is specified, Q may be greater than or equal to 0, for example, Q may be an integer greater than or equal to 0, where Q represents only the shift number. In one example, the first specified direction includes upward or leftward, the second specified direction includes downward or rightward, and vice versa or in other manners.

Alternatively, in this embodiment, the cyclic shift value Q may be obtained according to a specified parameter or specified information, where the specified parameter may include a parameter related to a transmission resource, for example, a symbol index, a slot index, a subframe index, or a retransmission index; the designation information may include information related to transmission resources, pre-configuration information, or received configuration information, etc.

Alternatively, in this embodiment, the "reuse of the T cyclic shift values" may be two ways, in which the T shift values are reused as a whole, and in which each of the T shift values is reused separately.

Alternatively, in this embodiment, the value of the factor b may be the same as or opposite to the value of the factor a employed by the transmitter.

In an exemplary embodiment, the processing result is circularly shifted according to the cyclic shift value Q to obtain shifted data, and then the shifted data is subjected to inverse fourier transform to obtain transformed data, which may be implemented in the following manner: performing inverse fourier transform on the processing result, and multiplying the processing result by a second vector to obtain transformed data, wherein the second vector is obtained according to the cyclic shift value Q, and the second vector includes at least one of exp (-1 i×2 pi/g×g×q), exp (-1 i×2 pi/g×b×q), exp (1 i×2 pi/g×b×q), and the like; where g=0, 1,2,., G-1, G is an integer greater than or equal to 1, b is a specified factor or a factor obtained according to a preset manner. For example, G is the length of the processing result, or G is the length of the inverse fourier transform or the number of points. This implementation can also be seen as a receiver implementation corresponding to the embodiment shown in fig. 3.

In one exemplary embodiment, the inverse fourier transform comprises an inverse discrete fourier transform (Inverse Discrete Fourier Transform, IDFT) or an inverse fast fourier transform (Inverse Fast Fourier Transform, IFFT).

In an exemplary embodiment, the method further comprises: and carrying out despreading on the transformed data by adopting a sequence with the length of L7 to obtain despread data, and carrying out subsequent receiver processing according to the despread data, wherein L7 is an integer greater than 1.

In an exemplary embodiment, the values of L4, L5, L6, and L7 may be the same, or the sequence adopted by the receiver corresponds to the sequence adopted by the transmitter.

In an exemplary embodiment, the method further comprises: acquiring at least one of the following according to the transformed data: identification information, payload, sequence information, transmission resource information.

In an exemplary embodiment, the method further comprises: and demodulating and decoding the transformed data to obtain a decoding result.

In an exemplary embodiment, the method further comprises: the receiver determines whether the obtained decoding result is correct or not according to the decoding result and/or the cyclic redundancy check result. For example, the transmitter adopts a contention-free transmission mode, so that the receiver does not know which UEs have transmitted, and the receiver can determine whether the obtained decoding result is correct according to the decoding result and/or the cyclic redundancy check result and other available information after decoding.

In an exemplary embodiment, the method further comprises: and obtaining at least one of the following according to the decoding result: payload, identification information, sequence information, transmission resource information.

The payload may include, among other things, traffic data, specified messages, etc. The identification information refers to identification information of the transmitter or the communication node for the receiver to determine which transmitter it receives the data transmitted by. The sequence information includes information of a sequence used when the transmitter performs spreading or mapping processing on the symbol, or information of a specified sequence used when mapping bits to the specified sequence, and may also include information of a sequence set. This information may be used by the receiver to reconstruct the symbols sent by the transmitter for interference cancellation. Furthermore, the transmission resource information may include location information of at least one transmission resource used by the transmitter, may further include information of the number of transmission resources used by the transmitter, and may further include information of available transmission resources. This information may be used by the receiver to determine on which transmission resources the transmitter transmitted in order to detect on those transmission resources. The identification information, the sequence information, or the transmission resource information may be indicated by a dedicated bit or may be implicitly indicated by a specific bit. For example, one or more of sequence information, transmission resource information is implicitly indicated by a specified bit in the payload and/or identification information; alternatively, one or more of the identification information, the sequence information, the transmission resource information is implicitly indicated by a specified bit in the payload.

In an exemplary embodiment, the method further comprises: and acquiring data of one or more data blocks or data of one or more communication nodes according to the transformed data or the decoding result.

In an exemplary embodiment, the method further comprises: and reconstructing a symbol sent by the transmitter according to the decoding result, performing interference elimination, and then performing next detection by the receiver according to the interference elimination result. The receiver may perform multiple iterative detections until a specified condition is met, ending the detection process.

In the data transmission method provided in this embodiment, the receiver may perform channel estimation according to the data with the conjugate relationship, and no pilot frequency is needed to perform channel estimation, so that pilot frequency-free (or pilot frequency-free, pure data) transmission may be implemented. The method can be used for scheduling-free transmission, and pilot frequency collision can be avoided, so that the performance of scheduling-free transmission can be improved.

The data transmission method provided by the embodiment of the invention is further described below with reference to the following embodiments.

Example 1

In this embodiment, the K transmitters perform data transmission according to the data transmission method provided by the present invention, specifically, each transmitter performs data transmission by:

Performing Fourier transform on the first data to obtain transformed data;

performing cyclic shift on the transformed data according to a cyclic shift value M to obtain shifted data;

and transmitting the shifted data.

Wherein each transmitter may be a terminal or a user equipment UE, etc.

Each transmitter performs coding and other processing on bits to be transmitted to obtain data to be transmitted, and then performs Binary Phase Shift Keying (BPSK) modulation on the data to be transmitted to obtain a modulation symbol serving as first data.

When K is greater than 1, in one case, K transmitters may use different transmission resources, and the number of transmission resources used by K transmitters may be the same or different. In another case, K transmitters may use the same transmission resources; for example, K transmitters share the same N Resource Blocks (RBs) on which data is transmitted simultaneously; in this case, the signal received by the receiver will be a superposition of the signals transmitted by the K transmitters, and there will be noise and other interference signals.

In the present exemplary embodiment, it is assumed that each transmitter uses N resource blocks for data transmission, N being an integer greater than or equal to 1. Wherein, one resource block includes N1 subcarriers in the frequency domain and N2 time domain symbols in the time domain, the index of the frequency domain subcarriers is written as 0,1,2, & gt, N1-1, and the index of the time domain symbols is written as 0,1,2, & gt, N2-1. One subcarrier and one time domain symbol position constitute one resource element, and the index is denoted by (N1, N2), 0< =n1-1, 0< =n2-1.

Here, taking n=1, that is, taking one resource block as an example, the first data transmitted by each transmitter includes N1×n2 modulation symbols for transmission on N1 subcarriers and N2 time domain symbols mapped to one resource block.

Each transmitter first performs a fourier transform on the modulation symbols mapped to the respective time domain symbols to obtain transformed data. For example, fourier transforming N1 modulation symbols for mapping to a first time domain symbol, fourier transforming N1 modulation symbols for mapping to a second time domain symbol, and so on.

Fig. 5 is a schematic diagram of an alternative data transmission method of embodiment 1, as shown in fig. 5, each transmitter performs cyclic shift on the transformed data according to a cyclic shift value M, where, on each time domain symbol, the cyclic shift value m=0 indicates that no cyclic shift is performed, and then each transmitter does not perform cyclic shift on the transformed data, and then each transmitter maps the transformed data onto the one resource block for transmission. The data for mapping onto one resource element is denoted herein as s (n 1, n 2). In fig. 5, the index above the table is the time domain index of the resource element for data mapping, the index at the left side of the table is the frequency domain index of the resource element for data mapping, and M (i) below the table represents the cyclic shift value employed on the time domain symbol with index i. It can be seen that the cyclic shift values employed on each time domain symbol are all 0, i.e. no cyclic shift is performed. The data transmitted by each transmitter is fourier transformed data. And, on each time domain symbol, the data of the frequency domain index of 1,2, with N1/2 as a center, the data of the frequency domain index of 1,2, N1/2-1 has a conjugate symmetry relation with the data of the frequency domain index of N1-1, N1-2, N1/2+2, N1/2+1, respectively. After receiving the data sent by the transmitter, the receiver can perform channel estimation by using the data with conjugate relation to obtain a channel estimation result for data detection. In addition, the data with frequency domain index of 0 and N1/2 on each time domain symbol is real number, and can also be used for channel estimation by a receiver.

Here, N1 is assumed to be an even number. When N1 is an odd number, in the data sent by each transmitter, on each time domain symbol, the frequency domain index is 1, 2..the data of (N1-1)/2 has a conjugate relationship with the data of the frequency domain index of N1-1, N1-2..the data of (N1+1)/2, respectively, and can be used for the receiver to perform channel estimation. In addition, the data with frequency domain index of 0 on each time domain symbol is real number, and can also be used for channel estimation by the receiver. In the subsequent examples of the present invention, description will be made mainly on the case where N1 is an even number.

Fig. 6 is a further schematic diagram of an alternative data transmission method of embodiment 1, as shown in fig. 6, each transmitter performs cyclic shift on the transformed data according to a cyclic shift value M, where, on a time domain symbol with index 0, 2, 4,..and N2-2, the cyclic shift value m=0, each transmitter does not perform cyclic shift on the data mapped onto the symbols in the transformed data, that is, uses the transformed data as shifted data on the symbols; on time domain symbols with indices 1, 3, 5, N2-1, the cyclic shift value m= -1, each transmitter performs a cyclic shift of-1 bit or up to 1 bit on the data for mapping onto these symbols, resulting in shifted data. Here, N2 is assumed to be an even number. For the case where N2 is odd, similar processing can be performed according to the method.

Each transmitter then maps the shifted data onto the one resource block for transmission. In fig. 6, the index above the table is the time domain index of the resource element for data mapping, the index on the left side of the table is used to observe the frequency domain index of the resource element on time domain symbols 0, 2, 4..the right side of the table is used to observe the frequency domain index of the resource element on time domain symbols 1, 3, 5..the right side of the table, and M (i) below the table represents the cyclic shift value employed on the time domain symbol with index i.

Taking the time domain symbols with indices 0 and 1 as an example here, it can be seen from fig. 6: on a time domain symbol with index 0, M (0) =0, i.e. without cyclic shift, mapping the transformed data s (0, 0), s (1, 0), s (2, 0), s (N1-1, 0) as shifted data onto N1 resource elements of the symbol; on a time domain symbol with index 1, M (1) = -1 represents 1-bit cyclic shift upwards, resulting in shifted data s (1, 1), s (2, 1), s (N1-1, 1), s (0, 1) for mapping onto N1 resource elements of the symbol, or may also be described as mapping data s (1, 1), s (2, 1), s (N1-1, 1) onto resource elements with frequency domain indices 0,1, & gt, N1-2, and mapping data s (0, 1) onto resource elements with frequency domain indices N1-1.

For the case shown in fig. 6, among the data transmitted by each transmitter, on the time domain symbol with indexes of 0, 2, 4..and N2-2, the data with frequency domain indexes of 1, 2..and N1/2-2 and N1/2-1 have conjugate relations with the data with frequency domain indexes of N1-1, N1-2..and N1/2+2 and N1/2+1 respectively, with N1/2 as the center; on time domain symbols with indexes of 1, 3, 5 and N2-1, the data with the indexes of N1/2-3 and N1/2-2 and the data with the indexes of N1-2 and N1-3 and the data with the indexes of N1/2+1 and N1/2 are respectively in conjugate relation with each other by taking N1/2-1 as a center. The data with conjugate relation can be used for channel estimation by a receiver, and can be used for frequency offset estimation and time offset estimation by the receiver, so that the method can be used for a scene with large channel variation or can further improve transmission performance. In addition, on time domain symbols with indices 0, 2, 4, N2-2, the data with frequency domain indices 0 and N1/2 are real numbers; on time domain symbols with indexes of 1, 3, 5..and N2-1, data with frequency domain indexes of N1/2-1 and N1-1 are real numbers; these data may also be used for channel estimation and time frequency offset estimation by the receiver.

Fig. 7 is another schematic diagram of an alternative data transmission method of embodiment 1, as shown in fig. 7, each transmitter performs cyclic shift on the transformed data according to a cyclic shift value M, where, on a time domain symbol with index 0, 2, 4,..and N2-2, the cyclic shift value m=0, each transmitter does not perform cyclic shift on the data mapped onto the symbols in the transformed data, that is, uses the transformed data as the shifted data on the symbols; on time domain symbols with indexes 1, 3, 5, and N2-1, the cyclic shift value m= -N1/4, each transmitter performs a cyclic shift of-N1/4 bits on the data mapped onto these symbols, or performs a cyclic shift of N1/4 bits upward, resulting in shifted data. Here, N1 is assumed to be a multiple of 4, and N2 is assumed to be an even number.

Each transmitter then maps the shifted data onto the one resource block for transmission. In fig. 7, the index above the table is the time domain index of the resource element for data mapping, the index on the left side of the table is used to observe the frequency domain index of the resource element on time domain symbols 0, 2, 4..the right side of the table is used to observe the frequency domain index of the resource element on time domain symbols 1, 3, 5..the right side of the table, and M (i) below the table represents the cyclic shift value employed on the time domain symbol with index i.

Taking the time domain symbols with indices 0 and 1 as an example here, it can be seen from fig. 7: on a time domain symbol with index 0, M (0) =0, i.e. without cyclic shift, mapping the transformed data s (0, 0), s (1, 0), s (2, 0), s (N1-1, 0) as shifted data onto N1 resource elements of the symbol; on a time domain symbol with index 1, M (1) = -N1/4, representing N1/4 bit cyclic shift up, resulting in shifted data s (N1/4, 1), s (N1/2-1, 1), s (N1/2, 1), s (N1/2+1, 1), s (3 x N1/4, 1), s (3 x N1/4+1, 1), s (N1-1, 1), s (0, 1), s (1, 1), s (N1/4-1, 1) for mapping onto N1 resource elements of the symbol.

For the case shown in fig. 7, among the data transmitted by each transmitter, on the time domain symbol with indexes of 0, 2, 4..and N2-2, the data with frequency domain indexes of 1, 2..and N1/2-2 and N1/2-1 have conjugate relations with the data with frequency domain indexes of N1-1, N1-2..and N1/2+2 and N1/2+1 respectively, with N1/2 as the center; on time domain symbols with indexes of 1, 3, 5 and N2-1, taking N1/4 as a center, and taking a frequency domain index of 0, wherein data of N1/4-1 respectively have a conjugation relation with data with a frequency domain index of N1/2, N1/4+1, and taking 3 x N1/4 as a center, and data with a frequency domain index of N1/2+1, 3 x N1/4-1 respectively have a conjugation relation with data with a frequency domain index of N1-1, 3 x N1/4+1. The data with conjugate relation can be used for channel estimation by a receiver, and can be used for frequency offset estimation and time offset estimation by the receiver, so that the method can be used for a scene with large channel variation or can further improve transmission performance. In addition, on time domain symbols with indices 0, 2, 4, N2-2, the data with frequency domain indices 0 and N1/2 are real numbers; on time domain symbols with indexes of 1, 3, 5..and N2-1, data with frequency domain indexes of N1/4 and 3 x N1/4 are real numbers; these data may also be used for channel estimation and time frequency offset estimation by the receiver.

Fig. 8 is a further flowchart of an alternative data transmission method of embodiment 1, as shown in fig. 8, each transmitter performs cyclic shift on the transformed data according to a cyclic shift value M, where, on a time domain symbol with an index of 0, the cyclic shift value M (0) =0, each transmitter does not perform cyclic shift on the data mapped to the symbol in the transformed data, and the transformed data is regarded as shifted data on the symbol; on a time domain symbol with index of 1, a cyclic shift value M (1) = -N1/4, each transmitter performs cyclic shift of-N1/4 bits on data for mapping to the symbol, or performs cyclic shift of N1/4 bits upwards, to obtain shifted data; on a time domain symbol with index of 2, the cyclic shift value M (2) =0, each transmitter does not perform cyclic shift on the data for mapping to the symbol, and the transformed data is regarded as shifted data on the symbol; on a time domain symbol with index 3, the cyclic shift value M (3) =n1/6, each transmitter performs a cyclic shift of N1/6 bits on the data for mapping to the symbol, or performs a cyclic shift of N1/6 bits down, resulting in shifted data. Here it is assumed that N1 is a multiple of 4 and 6. For subsequent time domain symbols, the 4 cyclic shift values, i.e., [0, -N1/4,0, N1/6], may be reused to obtain shifted data.

Each transmitter then maps the shifted data onto the one resource block for transmission. In fig. 8, the index above the table is the time domain index of the resource element for data mapping, the index on the left side of the table is used to observe the frequency domain index of the resource element on time domain symbols 0, 2, and M (i) below the table represents the cyclic shift value employed on the time domain symbol with index i.

For the case shown in fig. 8, among the data transmitted by each transmitter, on the time domain symbol with index 0, 2, the data with frequency domain index 1,2 is centered on N1/2, and the data with frequency domain index N1-1, N1-2, N1/2-1 has a conjugate relationship with the data with frequency domain index N1-1, N1-2, N1/2+2, N1/2+1, respectively; on a time domain symbol with an index of 1, taking N1/4 as a center, and taking a frequency domain index as 0, wherein data of N1/4-1 has a conjugation relation with data with a frequency domain index of N1/2, respectively; on a time domain symbol with an index of 3, data with a frequency domain index of 0 and an N1/6 is centered on an N1/6, and data with an N1/3 and an N1/6+1 is conjugated respectively, and data with an N1/3+1 and an N1/3 is centered on a 2 x N1/3, and data with an N1/3-1 is conjugated respectively with data with an N1-1 and an N2 x N1/3+1. The data with conjugate relation can be used for channel estimation by a receiver, and can be used for frequency offset estimation and time offset estimation by the receiver, so that the method can be used for a scene with large channel variation or can further improve transmission performance. In addition, on the time domain symbols with indexes of 0 and 2, the data with the frequency domain indexes of 0 and N1/2 are real numbers; on a time domain symbol with an index of 1, data with a frequency domain index of N1/4 and 3 x N1/4 are real numbers; on a time domain symbol with an index of 3, data with a frequency domain index of N1/6 and 2 x N1/3 are real numbers; these data may also be used for channel estimation and time frequency offset estimation by the receiver.

In the above exemplary embodiment, the K transmitters employ the same cyclic shift value. In one embodiment, K transmitters may also employ different cyclic shift values.

In the above-described exemplary embodiments, each transmitter may carry at least one of payload, identification information, sequence information, transmission resource information, and the like in its first data or data to be transmitted. The information is carried in the data so that the receiver can acquire the corresponding information and the corresponding information is applied to the detection process, especially in the case that the data transmission method provided by the invention is applied to the scheduling-free transmission.

In the above-described exemplary embodiment, the data transmission is realized by performing fourier transform on the first data to obtain transformed data, then performing cyclic shift on the transformed data according to the cyclic shift value M to obtain shifted data, and transmitting the shifted data. The data having a conjugate relationship among the transmitted data may be used for channel estimation, and then the transmitter may transmit only the data symbols, not transmit the pilot symbols, and no longer need to perform channel estimation through the pilot symbols. Therefore, the data transmission method can realize pilot-free (or pilot-free and pure data) transmission. In addition, the method can be used for scheduling-free transmission, so that pilot frequency collision is avoided, and the performance of scheduling-free transmission is improved. In addition, the method can still keep a lower peak-to-average power ratio, so that the transmitter has better power amplifier utilization efficiency, and is beneficial to realizing better signal quality, coverage level and transmission performance.

Example 2

In this embodiment, K transmitters perform data transmission according to the data transmission method provided by the present invention, where K is an integer greater than or equal to 1.

In one exemplary embodiment, each transmitter transmits data by:

performing Fourier transform on the first data to obtain transformed data;

expanding the shifted data by adopting a sequence with the length of L to obtain expanded data, wherein L is an integer greater than 1;

and sending the expanded data.

In this exemplary embodiment, each transmitter may spread a set of shifted data using a sequence of length L to obtain L sets of spread data, and then transmit the L sets of spread data. When transmitting the L groups of extended data, the L groups of extended data may be mapped to L time domain symbols for transmission, where each group of data occupies one time domain symbol, and the L time domain symbols may or may not be adjacent. For example, assuming that the shifted data includes N1×1 data, the shifted data is spread with a sequence with a length of L to obtain N1×l spread data, and then the N1×l spread data is mapped to N1 subcarriers of 1 resource block and L time domain symbols for transmission. N1 x L expanded data may be considered as L sets of data, each set of data comprising N1 x 1 data for mapping onto N1 resource elements of one time domain symbol.

In another exemplary embodiment, each transmitter transmits data by:

performing Fourier transform on the first data to obtain transformed data;

expanding the transformed data by adopting a sequence with the length of L to obtain expanded data, wherein L is an integer greater than 1;

performing cyclic shift on the expanded data according to a cyclic shift value M to obtain shifted data;

and transmitting the shifted data.

In this exemplary embodiment, each transmitter may use a sequence with a length of L to expand a set of transformed data to obtain L sets of expanded data, and then respectively perform cyclic shift on the L sets of expanded data to obtain L sets of shifted data, and send the L sets of shifted data. Wherein the cyclic shift value M may comprise one or more cyclic shift values. The same cyclic shift value or different cyclic shift values may be used when performing cyclic shift on the L groups of extended data. Accordingly, the receiver may employ different processes, that is, one process for the case of employing the same cyclic shift value and another process for the case of employing a different cyclic shift value. Wherein employing different cyclic shift values comprises employing at least 2 cyclic shift values. When transmitting the L groups of shifted data, the L groups of shifted data can be mapped to L time domain symbols for transmission, and each group of data occupies one time domain symbol.

In yet another exemplary embodiment, each transmitter transmits data by:

expanding the first data by adopting a sequence with the length of L to obtain expanded data, wherein L is an integer greater than 1;

performing Fourier transform on the expanded data to obtain transformed data;

and transmitting the shifted data.

In this exemplary embodiment, in one case, each transmitter may use a sequence with a length of L to spread a set of first data, obtain L sets of spread data, then perform fourier transform on the L sets of spread data to obtain L sets of transformed data, and then perform cyclic shift on the L sets of transformed data to obtain L sets of shifted data, and send the L sets of shifted data. Wherein the cyclic shift value M may comprise one or more cyclic shift values. The same cyclic shift value or different cyclic shift values may be used when the L-group transformed data is cyclic shifted. Accordingly, the receiver may employ different processes, similar to those described above. When transmitting the L groups of shifted data, the L groups of shifted data can be mapped to L time domain symbols for transmission, and each group of data occupies one time domain symbol.

In another case, each transmitter may use a sequence with a length L to spread a set of first data to obtain a set of spread data, then perform fourier transform on the set of spread data to obtain a set of transformed data, then perform cyclic shift on the set of transformed data to obtain a set of shifted data, and send the set of shifted data.

In the above-described exemplary embodiments, the length of the spreading sequence employed by the different examples may also be different.

In the above exemplary embodiments, specific processes of some steps are described in the foregoing embodiments, implementations and examples of the present invention.

In the above exemplary embodiment, by introducing the extension processing in the transmission method, the data transmission performance can be improved, and the number of supported users can be also improved, so that the system capacity and performance can be improved.

Example 3

In this embodiment, K transmitters perform data transmission according to the data transmission method provided by the present invention, where K is an integer greater than or equal to 1. Specifically, each transmitter performs data transmission by:

acquiring first data;

performing Fourier transform on the first data to obtain transformed data;

and transmitting the shifted data.

In one exemplary embodiment, acquiring the first data includes: modulating data to be transmitted to generate a modulation symbol, and taking the modulation symbol as first data. The data to be transmitted comprises bits obtained by encoding the bits to be transmitted and the like. The modulation may be a real modulation, such as Binary Phase Shift Keying (BPSK) modulation; but also complex modulation such as Quadrature Phase Shift Keying (QPSK) modulation; it may also be a high-dimensional modulation or a sequence modulation, e.g. mapping one or more bit modulations to a specified sequence, which may be a real sequence, or a complex sequence, or a sparse sequence, etc. The bits to be transmitted or data to be transmitted may contain one or more of a payload, identification information, information specifying a sequence, transmission resource information, and the like.

In one exemplary embodiment, acquiring the first data includes: modulating data to be transmitted to generate a modulation symbol, then expanding the modulation symbol by adopting a sequence with the length of L to obtain an expanded symbol, and taking the expanded symbol as first data. And (3) expanding the X modulation symbols by adopting a sequence with the length of L to obtain X X L expanded symbols, wherein L is an integer greater than 1, and X is an integer greater than or equal to 1. The length L sequences may be real sequences, complex sequences, or sparse sequences. The data to be transmitted may include one or more of a payload, identification information, information of a spreading sequence, transmission resource information, and the like.

In one exemplary embodiment, acquiring the first data includes: a plurality of data blocks are acquired, and first data is generated according to the plurality of data blocks. Wherein the data block comprises a coding block, a code block, a data packet, a bit group, a symbol group, or the like. For example, one data block includes bits obtained by encoding a set of bits to be transmitted, or one data block includes a set of bits to be transmitted. A plurality of data blocks is acquired, including at least 2 data blocks.

Generating the first data from the plurality of data blocks includes modulating the plurality of data blocks to generate the first data. In one case, the plurality of data blocks may be complex modulated such that data in the plurality of data blocks occupies one bit for modulation, respectively. For example, assuming that there are two data blocks, denoted as A1 and A2, respectively, and A1 and A2 are QPSK modulated as real and imaginary parts, respectively, to generate first data, then the first data is a complex QPSK symbol. This corresponds to A1 and A2 each occupying one bit and then modulating every two bits into one QPSK symbol. In another case, multiple data blocks may be modulated in series or concatenated together. In yet another case, the plurality of data blocks may be modulated respectively to obtain a plurality of sets of modulation symbols, and the plurality of sets of modulation symbols are used as the first data. The multiple sets of modulation symbols may be transmitted on the same transmission resource or on different transmission resources. When transmitting on the same transmission resource, multiple groups of shifted data obtained according to multiple groups of modulation symbols can be overlapped to obtain overlapped symbols, and then the overlapped symbols are transmitted on the transmission resource.

The data contained in the plurality of data blocks may be different, that is, the transmitter may carry different information in the plurality of data blocks, respectively; alternatively, the multiple data blocks may contain some of the same data, i.e., the transmitter may carry some of the same information in the multiple data blocks; alternatively, the data contained in the plurality of data blocks may be identical, that is, the transmitter may carry the same information in all of the plurality of data blocks.

The transmitter may carry one or more of a payload, identification information, sequence information, transmission resource information, etc. in each data block. For example, the transmitter may carry a payload in each data block, and the payloads carried in different data blocks may be different or the same; the transmitter may carry its identification information in each data block so that the receiver determines which transmitter it receives the data block transmitted; the transmitter may also carry sequence information or transmission resource information in each data block, for the receiver to acquire corresponding information and apply in the detection process. The transmitter may also carry different information in different data blocks, e.g. the transmitter may carry a payload in at least one data block, or identity information in at least one data block, or sequence information in at least one data block, or transmission resource information in at least one data block; or the transmitter carries the identification information and the effective load in one data block, and only carries the effective load in other data blocks; alternatively, the transmitter may carry its identification information, etc. in one data block and the payload in the other data block.

The first data generated according to the plurality of data blocks may further obtain data to be transmitted according to the plurality of data blocks, and then modulate the data to be transmitted to obtain a modulation symbol, where the modulation symbol is used as the first data. The transmitter may carry at least one of a payload, identification information, sequence information, transmission resource information, etc. in the transmission data or the first data.

According to the data transmission method, data of a plurality of data blocks are transmitted, so that the data transmission capacity and performance can be improved, and the system performance can be improved.

In one exemplary embodiment, acquiring the first data includes: data of a plurality of communication nodes is acquired, and first data is generated according to the data of the plurality of communication nodes.

In one case, the communication node includes a sensing node, and the transmitter acquires or receives data of a plurality of sensing nodes and generates first data based on the data of the plurality of sensing nodes. In another case, the communication node includes a transmitting node, and the transmitter acquires or receives data of a plurality of transmitting nodes, and generates first data based on the data of the plurality of transmitting nodes. In this case, the transmitter may be regarded as a forwarding device, a relay device, or the like for forwarding data of other communication nodes. In yet another case, the transmitter acquires data of the Z communication nodes and data of itself, generates first data from the data of the Z communication nodes and the data of itself, and Z is an integer greater than or equal to 1. In this case, the transmitter has both the function of transmitting its own data and forwarding data of other communication nodes.

Generating the first data from the data of the plurality of communication nodes includes modulating the data of the plurality of communication nodes to generate the first data. In one case, the data of the plurality of communication nodes may be complex modulated, so that the data of the plurality of communication nodes occupy one bit for modulation, respectively. For example, assuming that there are two communication nodes of data, denoted B1 and B2, respectively, and B1 and B2 are QPSK modulated as real and imaginary parts, respectively, to generate first data, then the first data is a complex QPSK symbol. This corresponds to B1 and B2 each occupying one bit and then modulating every two bits into one QPSK symbol. In another case, data of multiple communication nodes may be modulated in series or cascaded together.

In this exemplary embodiment, the data of each communication node may include one or more of a payload, identification information, sequence information, transmission resource information, and the like. For example, the data of each communication node includes its identification information, or the data of at least one communication node includes its identification information.

The first data generated according to the data of the plurality of communication nodes may further obtain data to be transmitted according to the data of the plurality of communication nodes, and then modulate the data to be transmitted to obtain a modulation symbol, where the modulation symbol is used as the first data. The transmitter may carry at least one of a payload, identification information of at least one communication node, sequence information, transmission resource information, etc. in the data to be transmitted or the first data. For example, the data to be transmitted or the first data carries identification information of the plurality of communication nodes or identification information of at least one communication node of the plurality of communication nodes.

According to the data transmission method, data of a plurality of communication nodes are transmitted, so that the data transmission capacity and performance can be improved, and the system performance can be improved.

Example 4

In this embodiment, K transmitters perform data transmission according to the data transmission method provided by the present invention, where K is an integer greater than or equal to 1. Specifically, each transmitter performs data transmission by: acquiring W groups of first data; performing Fourier transform on the W groups of first data respectively to obtain W groups of transformed data; respectively performing cyclic shift on the data after the W group transformation according to the cyclic shift value M to obtain data after the W group transformation; and transmitting the data after the W groups of shift.

Wherein the cyclic shift value M may comprise one or more cyclic shift values. The transmitter may use the same cyclic shift value or different cyclic shift values when performing cyclic shift on the W-group transformed data, respectively.

When the transmitter transmits the data after the shift of the W groups, the data after the shift of the W groups can be respectively mapped to different transmission resources for transmission; or, overlapping the data after the shift of the W groups to obtain overlapped symbols, and mapping the overlapped symbols to the designated transmission resources for transmission.

According to the data transmission method, the W groups of data are transmitted, so that the data transmission capacity and performance can be improved, and the system performance can be improved.

In one exemplary embodiment, K transmitters will transmit, K being an integer greater than or equal to 1. Specifically, each transmitter performs data transmission by: performing Fourier transform on the first data to obtain transformed data; performing resource mapping on the transformed data according to a specified rule to obtain mapped data; and sending the mapped data.

In one case, the transmitter may map the transformed data directly onto the designated transmission resources for transmission.

In another case, the transmitter performs resource mapping on the data with the conjugate relationship in the transformed data according to the first specified rule, performs resource mapping on other data in the transformed data according to the second specified rule, obtains mapped data, and transmits the mapped data. For example, the transmitter maps the data with conjugate relation in the transformed data to adjacent or similar resources, including adjacent or similar subcarriers, or adjacent or similar symbols; other data in the transformed data is mapped to a given location.

In the above exemplary embodiments, the data having the conjugate relationship among the transmitted data may be used for channel estimation, and when the data having the conjugate relationship is located on adjacent or similar resources, a better channel estimation effect may be obtained, so that transmission performance may be improved.

In one exemplary embodiment, K transmitters will transmit, K being an integer greater than or equal to 1. Specifically, each transmitter performs data transmission by: acquiring a first vector according to the cyclic shift value M; multiplying the first data with a first vector to obtain an operation result; carrying out Fourier transform on the operation result to obtain a transformed result; and sending the converted result.

Wherein obtaining the first vector according to the cyclic shift value M includes: the first vector is at least one of exp (1 i 2 pi/G) M, exp (-1 i 2 pi/G) M), exp (1 i 2 pi/G) a M, exp (-1 i 2 pi/G) G a M), exp (1 i 2 pi/G M i), exp (1 i 2 pi/G i M i), x p (1 i 2 pi/G a i M i) M i, where g=0, 1,2, G-1, G is an integer greater than or equal to 1, e.g., g., G is the length of the first data, or G is the length of the fourier transform or the number of points.

The first data and the first vector are multiplied to obtain an operation result, and the multiplication can be performed by adopting a method of element-by-element multiplication or corresponding element multiplication.

The exemplary embodiment can achieve the same effect as the method of performing the cyclic shift after the fourier transform is performed in the embodiment of the present invention. Then, without conflict, the various methods described in the above-described embodiments, implementations, or examples of the present invention may also be applied in the present exemplary embodiment.

From the description of the above embodiments, it will be clear to a person skilled in the art that the method according to the above embodiments may be implemented by means of software plus the necessary general hardware platform, but of course also by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising several instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the method of the various embodiments of the present invention.

Fig. 9 is a block diagram of an alternative data transmission device according to an embodiment of the present invention; as shown in fig. 9, the data transmission apparatus includes:

A first transforming module 902, configured to perform fourier transform on the first data to obtain transformed data;

a first shift module 904, configured to perform cyclic shift on the transformed data according to a cyclic shift value M, to obtain shifted data;

a transmitting module 906, configured to transmit the shifted data.

By the device, the first data is subjected to Fourier transformation to obtain transformed data, the transformed data is subjected to cyclic shift according to the cyclic shift value M to obtain shifted data, the shifted data is transmitted again, channel estimation can be carried out by utilizing the data with conjugate relation, pilot-free (or pilot-free and pure data) transmission is realized, pilot collision can be avoided, and scheduling-free transmission performance is improved.

In an exemplary embodiment, the first shift module 904 is further configured to cyclically shift the transformed data according to a cyclic shift value M by at least one ofBits, resulting in shifted data: performing cyclic shift on the transformed data by M bits, or-M bits, or a x M bits, or-a x M bits to obtain shifted data, wherein a is a designated factor or a factor obtained according to a preset mode; performing cyclic shift on the transformed data in a first designated direction by an amount of M, or-M, or |m|, or a|m, or-a|m, or a|m| to obtain shifted data, wherein |m| is an absolute value of M; performing cyclic shift on the transformed data in a second specified direction by an amount of M, or-M, or |m|, or a|m, or-a|m, or a|m| to obtain shifted data; acquiring the cyclic shift value M according to specified parameters or specified information, and then performing cyclic shift on the transformed data according to the cyclic shift value M to obtain shifted data; according to T cyclic shift values M ₁ 、M ₂ 、...、M _T Respectively performing cyclic shift on T groups of data included in the transformed data to obtain shifted data, wherein T is an integer greater than or equal to 2; repeatedly using the T cyclic shift values, and respectively carrying out cyclic shift on V groups of data included in the transformed data to obtain shifted data, wherein V is an integer larger than T; and expanding the transformed data by adopting a sequence with the length of L2 to obtain expanded data, and then circularly shifting the expanded data according to a circular shift value M to obtain shifted data, wherein L2 is an integer greater than 1.

In an exemplary embodiment, the transmitting module 906 is further configured to transmit the shifted data by at least one of: expanding the shifted data by adopting a sequence with the length of L3 to obtain expanded data, and then sending the expanded data, wherein L3 is an integer greater than 1; and transmitting the shifted data through a designated transmission resource, and transmitting only data symbols and not pilot symbols on the designated transmission resource.

Specific examples in this embodiment may refer to the examples described in the foregoing embodiments and the exemplary implementation, and this embodiment is not described herein.

FIG. 10 is a block diagram of an alternative data processing apparatus according to an embodiment of the present invention; as shown in fig. 10, the data processing apparatus includes:

a channel estimation module 1002, configured to perform channel estimation according to the second data, and obtain a channel estimation result;

a processing module 1004, configured to process the second data according to the channel estimation result, and obtain a processing result;

a second shift module 1006, configured to perform cyclic shift on the processing result according to a cyclic shift value Q, to obtain shifted data;

and a second transform module 1008, configured to perform inverse fourier transform on the shifted data, to obtain transformed data.

By the device, the channel estimation result is obtained according to the second data, the second data is processed according to the channel estimation result to obtain the processing result, the processing result is circularly shifted according to the cyclic shift value Q to obtain the shifted data, and the inverse Fourier transform is performed on the shifted data to obtain the transformed data, so that the channel estimation can be performed by using the data with the conjugate relation to realize pilot-free (or pilot-free and pure data) transmission, thereby avoiding pilot collision and improving the scheduling-free transmission performance.

In an exemplary embodiment, the channel estimation module 1002 is further configured to perform channel estimation according to the second data by at least one of the following ways to obtain a channel estimation result: performing channel estimation according to the data with the conjugate relation in the second data to obtain a channel estimation result; and carrying out channel estimation according to the real data in the second data to obtain a channel estimation result.

In an exemplary embodiment, the second shift module 1006 is further configured to perform cyclic shift on the processing result according to a cyclic shift value Q by at least one of the following ways to obtain shifted data: performing cyclic shift on the processing result in Q bits, or-Q bits, or b x Q bits, or-b x Q bits to obtain shifted data, wherein b is a designated factor or a factor obtained according to a preset mode; performing cyclic shift on the processing result in a first designated direction, wherein the shift quantity is Q, or-Q, or |Q|, or b|Q, or b|Q| to obtain shifted data, and the|Q| is an absolute value of Q; performing cyclic shift of the processing result in a second specified direction by a shift quantity of Q, or-Q, or |Q|, or b|Q, or-b|Q| to obtain shifted data; performing cyclic shift on the processing result according to a cyclic shift value Q to obtain shifted data, wherein the cyclic shift value Q is opposite to a cyclic shift value M adopted by a transmitter; acquiring the cyclic shift value Q according to specified parameters or specified information, and performing cyclic shift on the processing result according to the cyclic shift value Q to obtain shifted data; according to T cyclic shift values Q ₁ 、Q ₂ 、...、Q _T Respectively performing cyclic shift on T groups of data included in the processing result to obtain shifted data, wherein T is an integer greater than or equal to 2; repeatedly using the T cyclic shift values, and respectively carrying out cyclic shift on the V groups of data included in the processing result to obtain shifted data, wherein V is an integer larger than T; and performing despreading on the processing result by adopting a sequence with the length of L5 to obtain despread data, and performing cyclic shift on the despread data according to a cyclic shift value Q to obtain shifted data, wherein L5 is an integer greater than 1.

In an exemplary embodiment, the second transformation module 1008 is further configured to perform inverse fourier transformation on the shifted data to obtain transformed data by: and performing despreading on the shifted data by adopting a sequence with the length of L6 to obtain despread data, and performing inverse Fourier transform on the despread data to obtain transformed data, wherein L6 is an integer greater than 1.

In an exemplary embodiment, the apparatus obtains at least one of the following from the transformed data: identification information, payload, sequence information, transmission resource information.

Fig. 11 is a block diagram (ii) of an alternative data transmission device according to an embodiment of the present invention; as shown in fig. 11, the data transmission apparatus includes:

an obtaining module 1102, configured to obtain a first vector according to the cyclic shift value M;

a multiplication module 1104, configured to multiply the first data with the first vector to obtain an operation result;

a third transformation module 1106, configured to perform fourier transformation on the operation result to obtain transformed data;

and a transmission module 1108, configured to send the transformed data.

By the device, the first vector is obtained according to the cyclic shift value M, the first data is multiplied with the first vector to obtain an operation result, the operation result is subjected to Fourier transform to obtain transformed data, and the transformed data is transmitted, so that channel estimation can be performed by using data with a conjugate relation, pilot-free (or pilot-free and pure data) transmission is realized, pilot collision can be avoided, and scheduling-free transmission performance is improved.

In an exemplary embodiment, the transmitting module 1108 is further configured to transmit the transformed data by at least one of: expanding the transformed data by adopting a sequence with the length of L3 to obtain expanded data, and then sending the expanded data, wherein L3 is an integer greater than 1; the transformed data is transmitted over a designated transmission resource and only data symbols are transmitted over the designated transmission resource without pilot symbols.

An embodiment of the invention also provides an electronic device comprising a memory having stored therein a computer program and a processor arranged to run the computer program to perform the steps of any of the method embodiments described above.

Alternatively, in the present embodiment, the above-described processor may be configured to execute the following steps by a computer program:

s1, carrying out Fourier transform on first data to obtain transformed data;

s2, performing cyclic shift on the transformed data according to a cyclic shift value M to obtain shifted data;

And S3, transmitting the shifted data.

Alternatively, in another embodiment, the above-mentioned processor may be arranged to perform the following steps by means of a computer program:

s1, acquiring a first vector according to a cyclic shift value M;

s2, multiplying the first data with the first vector to obtain an operation result;

s3, carrying out Fourier transform on the operation result to obtain transformed data;

and S4, transmitting the converted data.

Optionally, in a further embodiment, the above processor may be arranged to perform the following steps by a computer program:

s1, carrying out channel estimation according to second data to obtain a channel estimation result;

s2, processing the second data according to the channel estimation result to obtain a processing result;

s3, performing cyclic shift on the processing result according to a cyclic shift value Q to obtain shifted data;

s4, performing inverse Fourier transform on the shifted data to obtain transformed data.

In an exemplary embodiment, the electronic apparatus may further include a transmission device connected to the processor, and an input/output device connected to the processor.

It will be appreciated by those skilled in the art that the modules or steps of the invention described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may be implemented in program code executable by computing devices, so that they may be stored in a storage device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than that shown or described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple modules or steps of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.

The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A data transmission method, comprising:

performing Fourier transform on the first data to obtain transformed data;

and transmitting the shifted data.

2. The method of claim 1, wherein the first data comprises at least one of:

a symbol generated by appointed modulation of data to be transmitted;

and carrying out appointed modulation on data to be transmitted to generate a modulation symbol, adopting a sequence with the length of L1 to spread the modulation symbol to obtain a spread symbol, and taking the spread symbol as the first data, wherein L1 is an integer greater than 1.

3. The method of claim 1, wherein the first data comprises: data of a plurality of data blocks, or data of a plurality of communication nodes.

4. The method of claim 1, wherein the first data comprises at least one of: identification information, payload, sequence information, transmission resource information.

5. The method of claim 1, wherein the cyclically shifting the transformed data according to a cyclic shift value M results in shifted data, comprising at least one of:

Performing cyclic shift on the transformed data by M bits, or-M bits, or a x M bits, or-a x M bits to obtain shifted data, wherein a is a designated factor or a factor obtained according to a preset mode;

performing cyclic shift on the transformed data in a first designated direction by an amount of M, or-M, or |m|, or a|m, or-a|m, or a|m| to obtain shifted data, wherein |m| is an absolute value of M;

performing cyclic shift on the transformed data in a second specified direction by an amount of M, or-M, or |m|, or a|m, or-a|m, or a|m| to obtain shifted data;

acquiring the cyclic shift value M according to specified parameters or specified information, and then performing cyclic shift on the transformed data according to the cyclic shift value M to obtain shifted data;

according to T cyclic shift values M ₁ 、M ₂ 、...、M _T Respectively performing cyclic shift on T groups of data included in the transformed data to obtain shifted data, wherein T is an integer greater than or equal to 2;

repeatedly using the T cyclic shift values, and respectively carrying out cyclic shift on V groups of data included in the transformed data to obtain shifted data, wherein V is an integer larger than T;

And expanding the transformed data by adopting a sequence with the length of L2 to obtain expanded data, and then circularly shifting the expanded data according to a circular shift value M to obtain shifted data, wherein L2 is an integer greater than 1.

6. The method of claim 1, wherein transmitting the shifted data comprises at least one of:

expanding the shifted data by adopting a sequence with the length of L3 to obtain expanded data, and then sending the expanded data, wherein L3 is an integer greater than 1;

and transmitting the shifted data through a designated transmission resource, and transmitting only data symbols and not pilot symbols on the designated transmission resource.

7. A data transmission method, comprising:

acquiring a first vector according to the cyclic shift value M;

multiplying the first data with the first vector to obtain an operation result;

performing Fourier transform on the operation result to obtain transformed data;

and transmitting the transformed data.

8. The method of claim 7, wherein the first vector comprises at least one of:

exp(1i*2*pi/G*g*M)；

exp(-1i*2*pi/G*g*M)；

exp(1i*2*pi/G*g*a*M)；

exp(-1i*2*pi/G*g*a*M)；

Wherein, the g=0, 1,2, G-1, G is an integer greater than or equal to 1, the a is a designated factor or a factor obtained according to a preset mode.

9. The method of claim 7, wherein the first data comprises at least one of: identification information, payload, sequence information, transmission resource information.

10. The method of claim 7, wherein transmitting the transformed data comprises at least one of:

expanding the transformed data by adopting a sequence with the length of L3 to obtain expanded data, and then sending the expanded data, wherein L3 is an integer greater than 1;

the transformed data is transmitted over a designated transmission resource and only data symbols are transmitted over the designated transmission resource without pilot symbols.

11. A method of data processing, comprising:

channel estimation is carried out according to the second data, and a channel estimation result is obtained;

processing the second data according to the channel estimation result to obtain a processing result;

performing cyclic shift on the processing result according to a cyclic shift value Q to obtain shifted data;

And carrying out inverse Fourier transform on the shifted data to obtain transformed data.

12. The method of claim 11, wherein the second data comprises one of:

the received data or the data after resource demapping are used as the second data;

combining the multi-antenna received data according to the appointed combining vector to obtain the second data;

despreading the received data by adopting a sequence with the length of L4 to obtain the second data;

and combining the multi-antenna received data according to the appointed combining vector to obtain combined data, and then despreading the combined data by adopting a sequence with the length of L4 to obtain the second data, wherein L4 is an integer greater than 1.

13. The method of claim 11, wherein performing channel estimation based on the second data to obtain a channel estimation result comprises at least one of:

performing channel estimation according to the data with the conjugate relation in the second data, and obtaining the channel estimation result;

and carrying out channel estimation according to the real data in the second data to obtain the channel estimation result.

14. The method of claim 11, wherein the processing result is cyclically shifted according to a cyclic shift value Q to obtain shifted data, comprising at least one of:

Performing cyclic shift on the processing result in Q bits, or-Q bits, or b x Q bits, or-b x Q bits to obtain shifted data, wherein b is a designated factor or a factor obtained according to a preset mode;

performing cyclic shift on the processing result in a first designated direction, wherein the shift quantity is Q, or-Q, or |Q|, or b|Q, or b|Q| to obtain shifted data, and the|Q| is an absolute value of Q;

performing cyclic shift of the processing result in a second specified direction by a shift quantity of Q, or-Q, or |Q|, or b|Q, or-b|Q| to obtain shifted data;

performing cyclic shift on the processing result according to a cyclic shift value Q to obtain shifted data, wherein the cyclic shift value Q is opposite to a cyclic shift value M adopted by a transmitter;

acquiring the cyclic shift value Q according to specified parameters or specified information, and performing cyclic shift on the processing result according to the cyclic shift value Q to obtain shifted data;

according to T cyclic shift values Q ₁ 、Q ₂ 、...、Q _T Respectively performing cyclic shift on T groups of data included in the processing result to obtain shifted data, wherein T is an integer greater than or equal to 2;

Repeatedly using the T cyclic shift values, and respectively carrying out cyclic shift on V groups of data included in the processing result to obtain shifted data, wherein V is an integer larger than T;

and performing despreading on the processing result by adopting a sequence with the length of L5 to obtain despread data, and performing cyclic shift on the despread data according to a cyclic shift value Q to obtain shifted data, wherein L5 is an integer greater than 1.

15. The method of claim 11, wherein performing an inverse fourier transform on the shifted data results in transformed data, comprising:

and performing despreading on the shifted data by adopting a sequence with the length of L6 to obtain despread data, and performing inverse Fourier transform on the despread data to obtain transformed data, wherein L6 is an integer greater than 1.

16. The method of claim 11, wherein at least one of the following is obtained from the transformed data: identification information, payload, sequence information, transmission resource information.

17. A data transmission apparatus, comprising:

The first transformation module is used for carrying out Fourier transformation on the first data to obtain transformed data;

the first shift module is used for carrying out cyclic shift on the transformed data according to a cyclic shift value M to obtain shifted data;

and the transmitting module is used for transmitting the shifted data.

18. A data processing apparatus, comprising:

the channel estimation module is used for carrying out channel estimation according to the second data to obtain a channel estimation result;

the processing module is used for processing the second data according to the channel estimation result to obtain a processing result;

the second shift module is used for carrying out cyclic shift on the processing result according to a cyclic shift value Q to obtain shifted data;

and the second transformation module is used for carrying out inverse Fourier transformation on the shifted data to obtain transformed data.

19. A computer-readable storage medium, characterized in that the storage medium has stored therein a computer program, wherein the computer program is arranged to perform the method of any of the claims 1 to 10 or the method of any of the claims 11 to 16 when run.

20. An electronic device comprising a memory and a processor, wherein the memory has stored therein a computer program, the processor being arranged to run the computer program to perform the method of any of claims 1 to 10 or the method of any of claims 11 to 16.