WO2023226854A1

WO2023226854A1 - Data transmission method and apparatus, data processing method and apparatus, and storage medium

Info

Publication number: WO2023226854A1
Application number: PCT/CN2023/094869
Authority: WO
Inventors: 李卫敏; 袁志锋; 李志岗; 马一华
Original assignee: 中兴通讯股份有限公司
Priority date: 2022-05-27
Filing date: 2023-05-17
Publication date: 2023-11-30
Also published as: CN117176516A

Abstract

Provided in the embodiments of the present disclosure are a data transmission method and apparatus, a data processing method and apparatus, and a storage medium. The data transmission method comprises: performing Fourier transform on first data, so as to obtain transformed data; performing cyclic shift on the transformed data according to a cyclic shift value M, so as to obtain shifted data; and sending the shifted data. By using the technical solution, the problem in the prior art of a serious pilot collision occurring in pilot-based grant-free transmission and thus affecting the performance of grant-free transmission is solved.

Description

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

This disclosure requires the priority of the Chinese patent application submitted to the China Patent Office on May 27, 2022, with the application number 202210591038.5 and the invention title "data transmission method and device, data processing method and device, storage medium", and its entire content is approved by This reference is incorporated into this disclosure.

Technical field

The present disclosure relates to the field of communications, and specifically, to a data transmission method and device, a data processing method and device, and a storage medium.

Background technique

Currently, in the Grant-free transmission process, the terminal or User Equipment (UE) can send data independently and no longer needs to send scheduling requests and wait for dynamic scheduling. Therefore, scheduling-free transmission can reduce signaling overhead and transmission delay, and can also reduce terminal power consumption. In addition, it can also be combined with non-orthogonal transmission to increase the number of access users.

Scheduling-free transmission includes two methods, namely semi-persistent scheduling (or configured grant) and contention-based grant-free. For pre-configuration and scheduling-free, the base station pre-configures or semi-statically configures transmission resources (including time-frequency resources, pilots, etc.) for each UE; the base station can ensure that the time-frequency resources and/or pilots used by multiple UEs are different through configuration. , thereby avoiding collisions for user identification and detection; when there are a large number of UEs, the base station can also configure to allow some UEs to use the same time-frequency resources and pilots, that is, allowing collisions, then there will be many The time-frequency resources and pilots used by two UEs are the same and collision occurs. For contention-free scheduling, when a UE has service transmission needs, it can randomly select transmission resources (including time-frequency resources, pilots, etc.) for competitive access and transmission; the time-frequency resources and pilots used by multiple UEs may be the same, that is, Collision.

For scheduling-free transmission based on pilots (or reference signals), due to the limited number of pilots, when there are a large number of access users, pilot collisions will be serious, which will affect the performance of scheduling-free transmission.

In view of the problem in the existing technology that pilot-based scheduling-free transmission suffers from serious pilot collisions, thereby affecting the performance of scheduling-free transmission, no effective solution has yet been proposed.

Therefore, it is necessary to improve the related technology to overcome the defects in the related technology.

Contents of the invention

Embodiments of the present disclosure provide a data transmission method and device, a data processing method and device, and a storage medium to at least solve the problem in related technologies that pilot-based scheduling-free transmission has serious pilot collisions, thereby affecting the scheduling-free transmission performance. question.

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

According to an embodiment of the present disclosure, a data transmission method is provided, including: obtaining a first vector according to a cyclic shift value M; multiplying the first data and the first vector to obtain an operation result; and performing the operation result on the first vector. Perform Fourier transform, Obtain transformed data; send said transformed data.

According to an aspect of an embodiment of the present disclosure, a data processing method is provided, including: performing channel estimation according to second data, and obtaining a channel estimation result; processing the second data according to the channel estimation result, and obtaining a processing result; Perform a cyclic shift on the processing result according to the cyclic shift value Q to obtain shifted data; perform an inverse Fourier transform on the shifted data to obtain transformed data.

According to another embodiment of the present disclosure, a data transmission device is provided, including: a first transformation module configured to perform Fourier transform on the first data to obtain transformed data; a first shift module configured to The transformed data is cyclically shifted according to the cyclic shift value M to obtain the shifted data; the sending module is configured to send the shifted data.

According to another embodiment of the present disclosure, a data processing device is provided, including: a channel estimation module configured to perform channel estimation based on the second data and obtain a channel estimation result; and a processing module configured to perform channel estimation based on the channel estimation result. The second data is processed to obtain the processing result; the second shift module is configured to cyclically shift the processing result according to the cyclic shift value Q to obtain the shifted data; the second transformation module is configured to Perform inverse Fourier transform on the shifted data to obtain transformed data.

According to yet another embodiment of the present disclosure, a computer-readable storage medium is also provided. A computer program is stored in the computer-readable storage medium, wherein the computer program is configured to execute any of the above methods when running. Steps in Examples.

According to yet another embodiment of the present disclosure, an electronic device is also provided, including a memory and a processor. A computer program is stored in the memory, and the processor is configured to run the computer program to perform any of the above. Steps in method embodiments.

Through the present disclosure, Fourier transform is performed on the first data to obtain the transformed data; and the transformed data is cyclically shifted according to the cyclic shift value M to obtain the shifted data; and then the shifted data is sent data. This disclosure performs Fourier transform on the data, and then performs cyclic shift and transmission. Therefore, data with a conjugate relationship can be used for channel estimation to achieve pilot-free (or no pilot, pure data) transmission, thereby avoiding pilot frequency collision to improve the performance of scheduling-free transmission.

Description of the drawings

Figure 1 is a hardware structure block diagram of a computer terminal of an optional data transmission method according to an embodiment of the present disclosure;

Figure 2 is a flow chart (1) of an optional data transmission method according to an embodiment of the present disclosure;

Figure 3 is a flow chart (2) of an optional data transmission method according to an embodiment of the present disclosure;

Figure 4 is a flow chart of an optional data processing method according to an embodiment of the present disclosure;

Figure 5 is a schematic diagram of an optional data transmission method in Embodiment 1;

Figure 6 is another schematic diagram of an optional data transmission method in Embodiment 1;

Figure 7 is another schematic diagram of an optional data transmission method in Embodiment 1;

Figure 8 is yet another flow chart of an optional data transmission method in Embodiment 1;

Figure 9 is a structural block diagram (1) of an optional data transmission device according to an embodiment of the present disclosure;

Figure 10 is a structural block diagram of an optional data processing device according to an embodiment of the present disclosure;

Figure 11 is a structural block diagram (2) of an optional data transmission device according to an embodiment of the present disclosure.

Detailed ways

In order to enable those skilled in the art to better understand the present disclosure, the following will clearly and completely describe the technical solutions in the present disclosure embodiments in conjunction with the accompanying drawings. Obviously, the described embodiments are only These are part of the embodiments of this disclosure, not all of them. Based on the embodiments in this disclosure, all other embodiments obtained by those of ordinary skill in the art without creative efforts should fall within the scope of protection of this disclosure.

It should be noted that the terms "first", "second", etc. in the description and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It is to be understood that the data so used are interchangeable under appropriate circumstances so that the embodiments of the disclosure described herein can be practiced in sequences other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, e.g., a process, method, system, product, or apparatus that encompasses a series of steps or units and need not be limited to those explicitly listed. Those steps or elements may instead include other steps or elements not expressly listed or inherent to the process, method, product or apparatus.

The method embodiments provided in the embodiments of the present disclosure can be executed in a computer terminal or similar computing device. Taking running on a computer terminal as an example, FIG. 1 is a hardware structure block diagram of a computer terminal of an optional data transmission method according to an embodiment of the present disclosure. As shown in Figure 1, the computer terminal may include one or more (only one is shown in Figure 1) processors 102 (the processor 102 may include but is not limited to a microprocessor unit (MPU for short) or programmable logic Device (Programmable logic device, referred to as PLD)) and a memory 104 configured to store data. In an exemplary embodiment, the above-mentioned computer terminal may also include a transmission device 106 configured as a communication function and an input and output device 108. Persons of ordinary skill in the art can understand that the structure shown in Figure 1 is only illustrative, and it does not limit the structure of the above-mentioned computer terminal. For example, the computer terminal may also include more or fewer components than shown in FIG. 1 , or have a different configuration with equivalent functions or more functions than shown in FIG. 1 .

The memory 104 may be configured to store computer programs, for example, software programs and modules of application software, such as the computer programs corresponding to the data transmission methods in the embodiments of the present disclosure. The processor 102 executes various operations by running the computer programs stored in the memory 104. A functional application and data processing, that is, to implement the above method. 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, the memory 104 may further include memory located remotely relative to the processor 102, and these remote memories may be connected to the computer terminal through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.

The transmission device 106 is configured to receive or send data via a network. Specific examples of the above-mentioned network may include a wireless network provided by a communication provider of the computer terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, NIC for short), which can be connected 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 (Radio Frequency, RF for short) module, which is configured to communicate with the Internet wirelessly.

Figure 2 is a flow chart (1) of an optional data transmission method according to an embodiment of the present disclosure. As shown in Figure 2, the steps of the data transmission method include:

Step S202, perform Fourier transform on the first data to obtain transformed data;

Step S204, cyclically shift the transformed data according to the cyclic shift value M to obtain the shifted data;

Step S206: Send the shifted data.

Through the above steps, Fourier transform is performed on the first data to obtain the transformed data; and according to the cyclic shift value M Perform a circular shift on the converted data to obtain the shifted data; then send the shifted data. The above steps perform Fourier transform on the data, then perform cyclic shift and send. Therefore, the data with conjugate relationship can be used for channel estimation to achieve pilot-free (or no pilot, pure data) transmission, thus avoiding pilot. frequency collision to improve the performance of scheduling-free transmission.

The present disclosure provides a data transmission method. This data transmission method has a lower Peak to Average Power Ratio (PAPR), so that the transmitter has better power amplifier utilization efficiency, which is conducive to achieving better Signal quality, coverage levels and transmission performance.

There are various implementations of the embodiments of the present disclosure, including but not limited to the implementations and examples provided below. It should be noted that, as long as there is no conflict, the features in the embodiments, implementation modes and examples of the present disclosure can be arbitrarily combined with each other.

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

In an exemplary embodiment, before Fourier transforming the first data, the method further includes: acquiring or generating the first data.

Optionally, in this embodiment, the first data includes data symbols.

In an exemplary embodiment, the first data includes at least one of the following: a symbol generated by performing specified modulation on the data to be sent; a modulation symbol generated by performing specified modulation on the data to be sent, and using a sequence of length L1 to generate a modulation symbol. Expand is performed to obtain an expanded symbol, and the expanded symbol is used as the first data, where L1 is an integer greater than 1.

It should be noted that the data to be sent includes bits obtained by encoding the bits to be sent; the modulation can be real number modulation, such as binary phase shift keying (BPSK) modulation; it can also be complex number modulation, such as Quadrature Phase-Shift Keying (QPSK) modulation; it can also be high-dimensional modulation or sequence modulation, for example, mapping one or more bit modulations to a specified sequence, which can be a real number sequence, or Complex sequence, or sparse sequence, etc.

It should be noted that the above sequence of 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 the following: identification information, payload, sequence information, and transmission resource information. In another exemplary embodiment, the data to be sent may include at least one of identification information, payload, sequence information, transmission resource information, etc.; or, the bits to be sent may include identification information, valid information, etc. At least one of payload, sequence information, transmission resource information, etc.

It should be noted that the above payload may include business data, designated messages, etc. The above-mentioned identification information refers to the identity identification information of the transmitter, which is used by the receiver to determine which transmitter it is receiving data sent by. The sequence information includes information about the sequence used by the transmitter when spreading or mapping symbols, or information about a specified sequence used when mapping bits into a specified sequence, and may also include information about a sequence set. This information can 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 also include information on the quantity of transmission resources used by the transmitter, and may also include information on available transmission resources. This information can be used by the receiver to determine on which transmission resources the transmitter transmitted in order to perform detection on those transmission resources. Identification information, sequence information, or transmission resource information can be indicated by dedicated bits, or implicitly indicated by designated bits. For example, by specifying bits in the payload and/or identification information to imply Indicate one or more of sequence information and transmission resource information; or, implicitly indicate one or more of identification information, sequence information, and transmission resource information through specified bits in the payload.

In an exemplary embodiment, the first data or the data to be sent includes data of a plurality of data blocks, wherein the data blocks include encoding blocks, code blocks, data packets, bit groups, or symbol groups, etc.

It should be noted that the data contained in multiple data blocks may be different or the same, or part of the data may be the same. Each data block can carry one or more of payload, identification information, sequence information, transmission resource information, etc.; different information can also be carried in different data blocks.

Optionally, in this embodiment, the first data can be generated based on multiple data blocks. In one case, multiple data blocks may be modulated to generate the first data. For example, multiple data blocks are complex-modulated, and the data in the multiple data blocks each occupy one bit; or multiple data blocks are connected in series or cascade for modulation; or multiple data blocks are modulated separately. Modulate to obtain multiple sets of modulation symbols, and use the multiple sets of modulation symbols as first data. In another case, the data to be sent includes data of multiple data blocks. Alternatively, the data to be sent can be obtained according to the multiple data blocks, and then the data to be sent can be modulated to obtain modulation symbols, and the modulation symbols can be used as the first data. . In this case, at least one of payload, identification information, sequence information, transmission resource information, etc. may be carried in the data to be sent or the first data.

In an exemplary embodiment, the first data or data to be sent includes data of multiple communication nodes. The data of each communication node may include at least one of 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.

Optionally, in this embodiment, the first data may be generated based on data from multiple communication nodes. In one case, data of multiple communication nodes may be modulated to generate the first data. For example, the data of multiple communication nodes are complex modulated so that the data of multiple communication nodes each occupy one bit for modulation; or the data of multiple communication nodes are modulated after being connected in series or cascade; or, the data of multiple communication nodes are modulated The data of the communication node is modulated separately to obtain multiple sets of modulation symbols, and the multiple sets of modulation symbols are used as the first data. In another case, the data to be sent can be obtained according to the data of multiple communication nodes, and then the data to be sent can be modulated to obtain modulation symbols, and the modulation symbols can be used as the first data. In this case, the data to be sent or the first data may carry at least one of the payload, identity information of at least one communication node, sequence information, transmission resource information, and the like.

In an exemplary embodiment, the above-mentioned Fourier transform includes discrete Fourier transform (Discrete Fourier Transform, DFT) or fast Fourier transform (Fast Fourier Transform, FFT).

In an exemplary embodiment, before cyclically shifting the transformed data according to the cyclic shift value M, the method further includes: obtaining the cyclic shift value M.

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

In an exemplary embodiment, cyclically shifting the transformed data according to the cyclic shift value M to obtain shifted data includes at least one of the following: performing M bits on the transformed data, Or -M bits, or a*M bits, or -a*M bits cyclic shift to obtain the shifted data, where a is a specified factor or a factor obtained according to a preset method; for the transformed The data is cyclically shifted by a shift amount of M, or -M, or |M|, or a*M, or -a*M, or a*|M| in the first specified direction, and the shifted data is obtained. data, where |M| is the absolute value of M; the transformed data is specified in the second Perform a circular shift of M, or -M, or |M|, or a*M, or -a*M, or a*|M| in the direction to obtain the shifted data; according to the specified parameters Or specify information to obtain the cyclic shift value M, and then perform cyclic shift on the transformed data according to the cyclic shift value M to obtain the shifted data; according to T cyclic shift values M ₁ , M ₂ ,..., M _T respectively perform cyclic shifts on T groups of data included in the transformed data to obtain shifted data, where T is an integer greater than or equal to 2; the T groups of data are repeatedly used Cyclic shift value: perform cyclic shifts on the V groups of data included in the transformed data to obtain the shifted data, where V is an integer greater than T; use a sequence of length L2 to perform a cyclic shift on the transformed data. The expanded data is expanded to obtain expanded data, and then the expanded data is cyclically shifted according to the cyclic shift value M to obtain shifted data, where L2 is an integer greater than 1.

It should be noted that M may be an integer or not an integer. When M is an integer, M may be an integer less than 0, or M may be an integer greater than 0, or M may be equal to 0. For example, M less than 0 means circular shift upward or to the left, M greater than 0 means circular shift downward or right, and M equal to 0 means no circular shift. M here contains the shift direction and shift amount, and the shift amount is the absolute value of M. It can also be defined that M less than 0 means circular shift downward or right, and M greater than 0 means circular shift upward or left. When cyclic shifting is not performed, the shifted data is the transformed data.

It should be noted that when the shift direction is specified, M can be greater than or equal to 0. For example, M can be an integer greater than or equal to 0, in which case M only represents the shift amount. In one example, if the first specified direction includes upward or left, then the transformed data is circularly shifted upward or to the left; if the second specified direction includes downward or right, then the transformed data is shifted downward or to the left. Circular shift to the right; it can also be defined in reverse or in other ways.

Optionally, in this embodiment, the cyclic shift value M can be obtained according to specified parameters or specified information, where the specified parameters can include parameters related to transmission resources, such as symbol index, timeslot index, subframe index. or repeated transmission index, etc.; the specified information may include information related to transmission resources, preconfiguration information, or received configuration information, etc.

In order to help understand the above "Perform cyclic shifts on T groups of data included in the transformed data according to T cyclic shift values M ₁ , M ₂ , ..., _MT to obtain shifted data", give an example As an example, suppose there are two sets of data marked D1 and D2 respectively, and two cyclic shift values marked M1 and M2 respectively. Then, the data group D1 can be cyclically shifted according to the cyclic shift value M1. The bit value M2 performs a circular shift on the data set D2.

Optionally, in this embodiment, there are two ways to reuse the T cyclic shift values. The first way is to reuse the T cyclic shift values as a whole, and the second way is to reuse the T cyclic shift values as a whole. Each of the T shift values is reused separately. For example, suppose there are 4 sets of data recorded as D1, D2, D3, and D4 respectively, and 2 shift values marked as M1 and M2 respectively. Then, according to the first method, the 2 shift values, namely M1, M2, M1, M2, that is, the data group D1 is cyclically shifted according to the shift value M1, the data group D2 is cyclically shifted according to the shift value M2, the data group D3 is cyclically shifted according to the shift value M1, and the data group D3 is cyclically shifted according to the shift value M1. The bit value M2 performs a circular shift on the data group D4; or, according to the second method, two shift values, namely M1, M1, M2, M2, are repeatedly used, that is, the data group D1 is circularly shifted based on the shift value M1. , the data group D2 is cyclically shifted according to the shift value M1, the data group D3 is cyclically shifted according to the shift value M2, and the data group D4 is cyclically shifted according to the shift value M2.

In an exemplary embodiment, cyclically shifting the transformed data to obtain the shifted data includes: using a sequence of length L2 to extend the transformed data to obtain the expanded data, Then perform a circular shift on the expanded data to obtain the shifted data. In one case, a sequence of length L2 can be used to Expand the data to obtain the expanded data of the L2 group, and then perform cyclic shifts on the expanded data of the L2 group. The cyclic shift values used in each group of data can be the same or different.

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

In an exemplary embodiment, sending the shifted data includes: using a sequence of length L3 to extend the shifted data to obtain extended data, and then sending the extended data, Among them, L3 is an integer greater than 1. In one case, a sequence of length L3 can be used to extend a set of shifted data to obtain the extended L3 set of data, and then the extended L3 set of data is sent. For example, after the L3 set is extended The data is mapped to L3 time domain symbols for transmission. Each group of data occupies one time domain symbol. The L3 time domain symbols can be adjacent or non-adjacent.

In an exemplary embodiment, sending the shifted data includes: sending the transformed data through a designated transmission resource, and only sending data symbols on the designated transmission resource without transmitting the leading data. frequency symbol.

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

Through the data transmission method provided by the embodiments of the present disclosure, the receiver can perform channel estimation based on the data with a conjugate relationship in the data sent by the transmitter, and no longer needs to rely on pilot symbols for channel estimation. Therefore, this method can only send data symbols and not pilot symbols. Among them, the pilot symbols include pilot sequences, pilot positions, reference signals, preamble sequences, etc.

The data transmission method provided by the embodiment of the present disclosure can be used for a transmitter to send its own data, or for a transmitter to send 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 above data transmission method; or, a relay node receives data sent by a communication node, Then the data of the communication node is sent according to the above data transmission method, or the data of the relay node and the data of the communication node are sent together; or two communication nodes or sensing nodes share a transmitter, and the transmitter obtains to the data of the two nodes, and then send the data of the two nodes according to the above data transmission method.

Embodiments of the present disclosure provide a data transmission method. The method performs Fourier transform on the first data to obtain transformed data, and then performs cyclic shift on the transformed data according to the cyclic shift value M to obtain the shifted data. data, and finally send the shifted data. Through this method, data with conjugate relationships can be used for channel estimation, so that pilot-free (or no pilot, pure data) transmission can be achieved. This method can be used for scheduling-free transmission and can avoid pilot collisions, thereby improving the performance of scheduling-free transmission. In addition, this method has a lower peak-to-average power ratio PAPR, which enables the transmitter to have better power amplifier utilization efficiency, which is conducive to achieving better signal quality, coverage level and transmission performance.

Figure 3 is a flow chart (2) of an optional data transmission method according to an embodiment of the present disclosure. As shown in Figure 3, the steps of the data transmission method include:

Step S302, obtain the first vector according to the cyclic shift value M;

Step S304, multiply the first data and the first vector to obtain an operation result;

Step S306: Perform Fourier transform on the operation result to obtain transformed data;

Step S308: Send the converted data.

Through the above steps, the first vector is obtained according to the cyclic shift value M, the first data is multiplied by the first vector to obtain the operation result, and then the operation result is Fourier transformed to obtain the transformed data, and By sending the transformed data, data with a conjugate relationship can be used for channel estimation to achieve pilot-free (or no pilot, pure data) transmission, thereby avoiding pilot collisions and improving the performance of scheduling-free transmission.

In an exemplary embodiment, the first vector includes at least one of the following: 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); 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 method.

Optionally, in this embodiment, G may be the length of the first data, or the length or number of points of Fourier transform. The multiplication in the above formula can be carried out element by element or corresponding element multiplication.

In an exemplary embodiment, before obtaining the first vector according to the cyclic shift value M, the method further includes: obtaining the cyclic shift value M. For example, the cyclic shift value M is obtained according to specified parameters or specified information, where the specified parameters may include parameters related to transmission resources, such as symbol index, time slot index, subframe index or repeated transmission index, etc.; the specified information may Including information related to transmission resources, preconfiguration information, or received configuration information, etc.

In an exemplary embodiment, before multiplying the first data by the first vector, the method further includes: obtaining or generating the first data.

In an exemplary embodiment, the first data includes at least one of the following: a symbol generated by performing specified modulation on the data to be sent; a modulation symbol generated by performing specified modulation on the data to be sent, and using a sequence of length L1 to generate a modulation symbol. Expand is performed to obtain an expanded symbol, and the expanded symbol is used as the first data, where L1 is an integer greater than 1. In one case, the extended symbols include multiple sets of symbols, and different cyclic shift values may be used.

In an exemplary embodiment, the first data or the data to be sent includes at least one of the following: identity information, payload, sequence information, and transmission resource information.

In an exemplary embodiment, the first data or the data to be sent includes data of multiple data blocks or data of multiple communication nodes.

In an exemplary embodiment, performing Fourier transform on the operation result to obtain the transformed data includes: using a sequence of length L2 to expand the operation result to obtain the expanded data, and then applying the The expanded data is Fourier transformed to obtain transformed data, where L2 is an integer greater than 1.

In an exemplary embodiment, sending the transformed data includes at least one of the following: using a sequence of length L3 to extend the transformed data to obtain the extended data, and then sending the extended data. data, where L3 is an integer greater than 1; the transformed data is sent through designated transmission resources, and only data symbols are sent on the designated transmission resources, and pilot symbols are not sent.

Through the data transmission method provided by the embodiments of the present disclosure, the receiver can perform channel estimation based on the data with a conjugate relationship in the data sent by the transmitter, and no longer needs to rely on pilot symbols for channel estimation. Therefore, this method can only send data symbols and not pilot symbols.

It should be noted that the embodiment of the present disclosure can achieve the same effect as the method of first performing Fourier transform and then performing cyclic shift shown in FIG. 2 . Therefore, some technical features in the embodiment shown in FIG. 2 are also applicable to this embodiment, for example, technical features related to the first data, technical features related to the cyclic shift value M, etc., which are not mentioned here. Again.

The data transmission method provided by the embodiment of the present disclosure can also be used for a transmitter to send its own data, or for a transmitter to send data of one or more communication nodes.

Embodiments of the present disclosure provide a data transmission method. The method obtains a first vector based on the cyclic shift value M, then multiplies the first data and the first vector to obtain an operation result, and then performs Fourier transform on the operation result. Get the transformed data and send the transformed data. Through this method, data with conjugate relationships can be used for channel estimation, so that pilot-free (or no pilot, pure data) transmission can be achieved. This method can be used for scheduling-free transmission and can avoid pilot collisions, thereby improving the performance of scheduling-free transmission. In addition, this method has a lower peak-to-average power ratio PAPR, which enables the transmitter to have better power amplifier utilization efficiency, which is conducive to achieving better signal quality, coverage level and transmission performance.

Figure 4 is a flow chart of an optional data processing method according to an embodiment of the present disclosure. As shown in Figure 4, the steps of the data processing method include:

Step S402, perform channel estimation based on the second data and obtain the channel estimation result;

Step S404: Process the second data according to the channel estimation result and obtain the processing result;

Step S406, cyclically shift the processing result according to the cyclic shift value Q to obtain the shifted data;

Step S408: Perform inverse Fourier transform on the shifted data to obtain transformed data.

Through the above steps, the channel estimation is performed based on the second data, the channel estimation result is obtained, and the second data is processed according to the channel estimation result to obtain the processing result, and then the processing result is cyclically shifted according to the cyclic shift value Q. , obtain the shifted data, and perform inverse Fourier transform on the shifted data to obtain the transformed data. Therefore, data with conjugate relationships can be used for channel estimation to achieve pilot-free (or pilot-free , pure data) transmission, thereby avoiding pilot collisions and improving the performance of scheduling-free transmission.

It should be noted that the method provided by the above steps is applied to a receiver, where the receiver at least includes receivers such as receiving nodes, base stations, network equipment, relay equipment, relay nodes, and other applicable communication nodes.

In an exemplary embodiment, before performing channel estimation based on the second data and obtaining the channel estimation result, the method further includes: obtaining the second data.

In an exemplary embodiment, the second data includes one of the following: receiving data or data after resource demapping as the second data; merging multiple antenna received data according to a specified merging vector to obtain the second data; using Despread the received data with a sequence of length L4 to obtain the second data; combine the received data of multiple antennas according to the specified merging vector to obtain the merged data, and then use a sequence of length L4 to despread the merged data. The second data is obtained, in which L4 is an integer greater than 1.

In order to help understand the above "combine multiple antenna reception data according to the specified merging vector to obtain the second data", for example, the receiver can perform blind detection by using all the merging vectors in the merging vector set or the merging identified by the specified method. The vectors combine the data received by multiple antennas to obtain the corresponding second data. This process may be called blind combining or blind reception beamforming, where the identified combined vector includes one or more vectors.

To help understand the above "use a sequence of length L4 to despread the received data to obtain the second data", for example, when the receiver performs blind detection, it can use all sequences in the extended sequence set or sequences identified by a specified method. The received data are respectively despread to obtain corresponding second data, where the identified sequence includes one or more sequences.

In an exemplary embodiment, performing channel estimation based on the second data and obtaining the channel estimation result includes at least one of the following: performing channel estimation based on data with a conjugate relationship in the second data and obtaining the channel estimation result; Channel estimation is performed on the real number data in the second data, and a channel estimation result is obtained.

In an exemplary embodiment, channel estimation is performed according to the second data to obtain a channel estimation result, where 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 the processing result, wherein the processing includes one or more of channel equalization processing, channel compensation processing, frequency offset compensation, time offset compensation, etc. indivual.

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

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

In an exemplary embodiment, the processing result is cyclically shifted according to the cyclic shift value Q to obtain shifted data, including at least one of the following: performing Q bits or -Q bits on the processing result , or a circular shift of b*Q bits, or -b*Q bits, to obtain the shifted data, where b is a specified factor or a factor obtained according to a preset method; the processing result is processed in the first specified direction Perform a circular shift of Q, or -Q, or |Q|, or b*Q, or -b*Q, or b*|Q| to obtain the shifted data, where |Q | is the absolute value of Q; the processing result is shifted in the second specified direction by Q, or -Q, or |Q|, or b*Q, or -b*Q, or b*|Q | cyclic shift to obtain the shifted data; perform cyclic shift on the processing result according to the cyclic shift value Q to obtain the shifted data, where the cyclic shift value Q is the same as the The cyclic shift value M is the opposite; the cyclic shift value Q is obtained according to the specified parameter or specified information, and then the processing result is cyclically shifted according to the cyclic shift value Q to obtain the shifted data; The T groups of data included in the processing results are cyclically shifted according to T cyclic shift values Q ₁ , Q ₂ , ..., Q _T to obtain the shifted data, where T is greater than or equal to 2. Integer; reuse the T cyclic shift values to perform cyclic shifts on the V groups of data included in the processing results to obtain the shifted data, where V is an integer greater than T; the length is L5 Despread the processing result with a sequence to obtain the despread data, and then perform a cyclic shift on the despread data according to the cyclic shift value Q to obtain the shifted data, where L5 is greater than 1 integer.

It should be noted that Q may be an integer or not an integer. When Q is an integer, Q can be an integer less than 0, or Q can be an integer greater than 0, or Q can be equal to 0. For example, Q less than 0 means circular shift upward or left, Q greater than 0 means circular shift downward or right, Q equal to 0 means no circular shift. Here Q contains the shift direction and shift amount, and the shift amount is the absolute value of Q. When circular shifting is not performed, the shifted data is the processing results.

It should be noted that when the shift direction is specified, Q can be greater than or equal to 0. For example, Q can be an integer greater than or equal to 0. In this case, Q only represents the shift amount. In one example, the first specified direction includes upward or leftward, and the second specified direction includes downward or rightward. It may also be defined in reverse or in other ways.

Optionally, in this embodiment, the cyclic shift value Q can be obtained according to specified parameters or specified information, where the specified parameters can include parameters related to transmission resources, such as symbol index, timeslot index, subframe index. or repeated transmission index, etc.; the specified information may include information related to transmission resources, preconfiguration information, or received configuration information, etc.

Optionally, in this embodiment, there are two ways to "reuse the T cyclic shift values" mentioned above. The first way is to reuse the T cyclic shift values as a whole, and the second way is to reuse the T cyclic shift values as a whole. The method is to reuse each of the T shift values separately.

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

In an exemplary embodiment, the processing result is cyclically shifted according to the cyclic shift value Q to obtain the shifted data, and then the shifted data is subjected to an inverse Fourier transform to obtain the transformed data. The data of , and the second vector includes exp(-1i*2*pi/G*g*Q), exp(1i*2*pi/G*g*Q), exp(-1i*2*pi/G*g *b*Q), exp(1i*2*pi/G*g*b*Q), etc.; among them, g=0, 1, 2, ..., G-1, G is greater than or equal to 1 is an integer, b is the specified factor or the factor obtained according to the preset method. For example, G is the length of the processing result, or G is the length or number of points of the inverse Fourier transform. This implementation can also be viewed as a receiver implementation corresponding to the embodiment shown in Figure 3.

In an exemplary embodiment, the inverse Fourier transform includes an inverse discrete Fourier transform (IDFT) or an inverse fast Fourier transform (IFFT).

In an exemplary embodiment, performing an inverse Fourier transform on the shifted data to obtain the transformed data includes: using a sequence of length L6 to deextend the shifted data to obtain a solution The expanded data is subjected to an inverse Fourier transform on the de-expanded data to obtain the transformed data, where L6 is an integer greater than 1.

In an exemplary embodiment, the method further includes: despreading the transformed data using a sequence of length L7 to obtain despread data, and performing subsequent receiver processing according to the despread data. , where L7 is an integer greater than 1.

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

In an exemplary embodiment, the method further includes: obtaining at least one of the following according to the transformed data: identity information, payload, sequence information, and transmission resource information.

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

In an exemplary embodiment, the method further includes: the receiver determines whether the obtained decoding result is correct according to the decoding result and/or the cyclic redundancy check result. For example, if the transmitter adopts competition-scheduling-free transmission mode, then the receiver It does not know which UEs have transmitted. After decoding, the receiver can determine whether the obtained decoding result is correct based on the decoding result and/or the cyclic redundancy check result and other available information.

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

Among them, the payload can include business data, designated messages, etc. Identification information refers to the identity identification information of the transmitter or communication node, which is used by the receiver to determine which transmitter it is receiving data sent by. The sequence information includes information about the sequence used by the transmitter when spreading or mapping symbols, or information about a specified sequence used when mapping bits into a specified sequence, and may also include information about a sequence set. This information can be used by the receiver to reconstruct the symbols sent by the transmitter for interference cancellation. Furthermore, the transmission resource information includes location information of at least one transmission resource used by the transmitter, may also include information on the quantity of transmission resources used by the transmitter, and may also include information on available transmission resources. This information can be used by the receiver to determine on which transmission resources the transmitter transmitted in order to perform detection on those transmission resources. In addition, identification information, sequence information, or transmission resource information can be indicated by dedicated bits, or implicitly indicated by designated bits. For example, one or more of the sequence information and transmission resource information may be implicitly indicated through designated bits in the payload and/or identification information; or, identification information, sequence may be implicitly indicated through designated bits in the payload. One or more of information and transmission resource information.

In an exemplary embodiment, the method further includes: obtaining 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 includes: reconstructing the symbols sent by the transmitter according to the decoding results, and performing interference cancellation, and then, the receiver performs the next detection according to the interference cancellation results. The receiver can perform multiple iterations of detection until the detection process is completed when the specified conditions are met.

In the data transmission method provided by this embodiment, the receiver can perform channel estimation based on data with a conjugate relationship, and no longer needs to rely on pilots for channel estimation, thereby enabling pilot-free (or no pilot, pure data) transmission. . This method can be used for scheduling-free transmission and can avoid pilot collisions, thereby improving the performance of scheduling-free transmission.

Next, the data transmission method provided by the embodiments of the present disclosure will be further described with reference to the following embodiments.

Example 1

In this embodiment, K transmitters perform data transmission according to the data transmission method provided by this disclosure. Optionally, each transmitter performs data transmission through the following steps:

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

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

Send the shifted data.

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

Each transmitter obtains the data to be sent after encoding the bits to be sent, and then performs BPSK modulation on the data to be sent to obtain modulation symbols as the first data.

When K is greater than 1, in one case, K transmitters can use different transmission resources. The number of transmission resources can be the same or different. In another case, K transmitters can use the same transmission resources; for example, K transmitters share and use the same N resource blocks (RB), and K transmitters simultaneously use these N resource blocks. data transmission; in this case, the signal received by the receiver will be the superposition of signals sent by K transmitters, in addition to noise and other interference signals.

In this exemplary embodiment, it is assumed that each transmitter uses N resource blocks for data transmission, and N is an integer greater than or equal to 1. Among them, a resource block includes N1 subcarriers in the frequency domain and N2 time domain symbols in the time domain. The indexes of the frequency domain subcarriers are recorded as 0, 1, 2,..., n1,..., N1-1, and the time domain symbols The index is recorded as 0, 1, 2,..., n2,..., N2-1. One subcarrier and one time domain symbol position constitute a resource element, and the index is recorded as (n1, n2), 0＜=n1＜=N1-1, 0＜=n2＜=N2-1.

Here, N=1, that is, taking a resource block as an example, the first data sent by each transmitter includes N1*N2 modulation symbols, which are used to map to N1 subcarriers and N2 time domain symbols of a resource block. transmission.

Each transmitter first performs a Fourier transform on the modulation symbols used to map to each time domain symbol to obtain transformed data. For example, the N1 modulation symbols used for mapping to the first time domain symbol are Fourier transformed, the N1 modulation symbols used for mapping to the second time domain symbol are Fourier transformed, and so on.

Figure 5 is a schematic diagram of an optional data transmission method in Embodiment 1. As shown in Figure 5, each transmitter cyclically shifts the transformed data according to the cyclic shift value M, where in each time domain Symbolically, the cyclic shift value M = 0, which means no cyclic shift is performed. Then each transmitter does not perform cyclic shift on the transformed data. Then, each transmitter maps the transformed data to the one Send on the resource block. Here, the data used to map to a resource element is recorded as s(n1, n2). In Figure 5, the index above the table is the time domain index of the resource element used for data mapping, the index on the left side of the table is the frequency domain index of the resource element used for data mapping, and M(i) below the table indicates that the index is The cyclic shift value used on the time domain symbol of i. It can be seen that the cyclic shift values used on each time domain symbol are all 0, that is, no cyclic shift is performed. The data sent by each transmitter is Fourier transformed data. Moreover, on each time domain symbol, with N1/2 as the center, the data with frequency domain indexes 1, 2,..., N1/2-2, N1/2-1 are respectively the same as the data with frequency domain index N1-1, The data of N1-2,..., N1/2+2, N1/2+1 have a conjugate symmetry relationship. After receiving the data sent by the transmitter, the receiver can use the data with the conjugate relationship to perform channel estimation and obtain the channel estimation results for data detection. In addition, the data with frequency domain index 0 and N1/2 on each time domain symbol are real numbers and can also be used for channel estimation by the receiver.

It is assumed here that N1 is an even number. When N1 is an odd number, in the data sent by each transmitter, on each time domain symbol, the data with frequency domain index 1, 2,..., (N1-1)/2 are different from the data with frequency domain index N1- The data of 1, N1-2,..., (N1+1)/2 has a conjugate relationship and can be used for channel estimation by the receiver. In addition, the data with frequency domain index 0 on each time domain symbol is a real number and can also be used for channel estimation by the receiver. In subsequent examples of this disclosure, the case where N1 is an even number will be mainly described.

Figure 6 is another schematic diagram of an optional data transmission method in Embodiment 1. As shown in Figure 6, each transmitter cyclically shifts the transformed data according to the cyclic shift value M, where at the index On the time domain symbols of 0, 2, 4,..., N2-2, the cyclic shift value M=0, then each transmitter does not perform cyclic shift on the data used to map to these symbols in the transformed data. bit, that is, the transformed data is used as shifted data on these symbols; on the time domain symbols with indexes 1, 3, 5,..., N2-1, the cyclic shift value M=-1, then each A transmitter performs a -1-bit cyclic shift on the data mapped to these symbols, or performs a 1-bit cyclic shift upward to obtain the shifted data. It is assumed here that N2 is an even number. For the case where N2 is an odd number, similar processing can be performed as described.

Then, each transmitter maps the shifted data to the one resource block for transmission. In Figure 6, the index above the table is the time domain index of the resource element used for data mapping, and the index on the left side of the table is used to observe the frequency domain of the resource element on time domain symbols 0, 2, 4,..., N2-2 Index. The index on the right side of the table is used to observe the frequency domain index of resource elements on time domain symbols 1, 3, 5,..., N2-1. M(i) at the bottom of the table is expressed on the time domain symbol with index i The circular shift value to use.

Here we take the time domain symbols with indexes 0 and 1 as an example. As can be seen from Figure 6: On the time domain symbol with index 0, M(0)=0 means no cyclic shift is performed, and the transformed data s (0,0), s(1,0), s(2,0), ..., s(N1-1,0) are used as shifted data and are used to map to the N1 resource elements of the symbol; On the time domain symbol with index 1, M(1)=-1, which means performing a 1-bit circular shift upward to obtain the shifted data s(1,1), s(2,1),...,s (N1-1,1), s(0,1), used to map to the N1 resource elements of the symbol, or it can also be described as data s(1,1), s(2,1), ..., s(N1-1, 1) is mapped to the resource element with frequency domain index 0, 1, ..., N1-2, and the data s(0, 1) is mapped to the resource element with frequency domain index N1-1 superior.

For the situation shown in Figure 6, in the data sent by each transmitter, on the time domain symbols with indexes 0, 2, 4,..., N2-2, centered on N1/2, the frequency domain index is 1, 2,..., N1/2-2, N1/2-1 data have a conjugate relationship with the data with frequency domain indexes N1-1, N1-2,..., N1/2+2, N1/2+1 respectively. ; On the time domain symbols with indexes 1, 3, 5,..., N2-1, centered on N1/2-1, the frequency domain indexes are 0, 1,..., N1/2-3, N1/2- The data of 2 have a conjugate relationship with the data with frequency domain indexes N1-2, N1-3,..., N1/2+1, N1/2 respectively. These data with conjugate relationships can be used for the receiver to perform channel estimation. In addition, it can also be used for the receiver to perform frequency offset estimation and time offset estimation, so that this method can be used in scenarios with large channel changes, or Transmission performance can be further improved. In addition, on the time domain symbols with indexes 0, 2, 4,..., N2-2, the data with frequency domain indexes 0 and N1/2 are real numbers; on the time domain symbols with indexes 1, 3, 5,..., N2-1 On the time domain symbols, the data with frequency domain indexes N1/2-1 and N1-1 are real numbers; these data can also be used for channel estimation and time-frequency offset estimation by the receiver.

Figure 7 is another schematic diagram of an optional data transmission method in Embodiment 1. As shown in Figure 7, each transmitter cyclically shifts the transformed data according to the cyclic shift value M, where at the index On the time domain symbols of 0, 2, 4,..., N2-2, the cyclic shift value M=0, then each transmitter does not perform cyclic shift on the data used to map to these symbols in the transformed data. bit, that is, the transformed data is used as shifted data on these symbols; on the time domain symbols with indexes 1, 3, 5,..., N2-1, the cyclic shift value M=-N1/4, Then each transmitter performs a -N1/4-bit cyclic shift on the data mapped to these symbols, or performs an upward N1/4-bit cyclic shift to obtain the shifted data. It is assumed here that N1 is a multiple of 4, and N2 is assumed to be an even number.

Then, each transmitter maps the shifted data to the one resource block for transmission. In Figure 7, the index above the table is the time domain index of the resource element used for data mapping, and the index on the left side of the table is used to observe the frequency domain of the resource element on the time domain symbols 0, 2, 4,..., N2-2 Index. The index on the right side of the table is used to observe the frequency domain index of resource elements on time domain symbols 1, 3, 5,..., N2-1. M(i) at the bottom of the table is expressed on the time domain symbol with index i The circular shift value to use.

Here we take the time domain symbols with indexes 0 and 1 as an example. As can be seen from Figure 7: On the time domain symbol with index 0, M (0) = 0, that is, no cyclic shift is performed, and the transformed data s (0,0), s(1,0), s(2,0),..., s(N1-1,0) is the shifted data, used to map to the N1 resource elements of the symbol; on the time domain symbol with index 1, M(1)=-N1/4, indicating upward N1/4-bit circular shift , get the shifted data s(N1/4,1),...,s(N1/2-1,1),s(N1/2,1),s(N1/2+1,1),... , s(3*N1/4, 1), s(3*N1/4+1, 1),..., s(N1-1, 1), s(0, 1), s(1, 1), ..., s(N1/4-1, 1), used to map to N1 resource elements of this symbol.

For the situation shown in Figure 7, in the data sent by each transmitter, on the time domain symbols with indexes 0, 2, 4,..., N2-2, centered on N1/2, the frequency domain index is 1, 2,..., N1/2-2, N1/2-1 data have a conjugate relationship with the data with frequency domain indexes N1-1, N1-2,..., N1/2+2, N1/2+1 respectively. ; On the time domain symbols with indexes 1, 3, 5,..., N2-1, centered on N1/4, the data with frequency domain indexes 0,..., N1/4-1 are respectively the same as the data with frequency domain index N1 /2,...,N1/4+1 data have a conjugate relationship, and, with 3*N1/4 as the center, the frequency domain index is N1/2+1,...,3*N1/4-1 data respectively It has a conjugate relationship with the data with frequency domain index N1-1,...,3*N1/4+1. These data with conjugate relationships can be used for the receiver to perform channel estimation. In addition, it can also be used for the receiver to perform frequency offset estimation and time offset estimation, so that this method can be used in scenarios with large channel changes, or Transmission performance can be further improved. In addition, on the time domain symbols with indexes 0, 2, 4,..., N2-2, the data with frequency domain indexes 0 and N1/2 are real numbers; on the time domain symbols with indexes 1, 3, 5,..., N2-1 On the time domain symbols, the data with frequency domain indexes N1/4 and 3*N1/4 are real numbers; these data can also be used for channel estimation and time-frequency offset estimation by the receiver.

Figure 8 is another flow chart of an optional data transmission method in Embodiment 1. As shown in Figure 8, each transmitter cyclically shifts the transformed data according to the cyclic shift value M, where, On the time domain symbol with index 0, the cyclic shift value M(0)=0, then each transmitter does not perform cyclic shift on the data mapped to the symbol in the transformed data, and will The transformed data is used as shifted data; on the time domain symbol with index 1, the cyclic shift value M(1)=-N1/4, then each transmitter performs a cyclic shift on the data mapped to the symbol. - N1/4 bit circular shift, or N1/4 bit circular shift upward to obtain the shifted data; on the time domain symbol with index 2, the circular shift value M(2)=0, Then each transmitter does not perform cyclic shift on the data mapped to this symbol, and uses the transformed data on this symbol as shifted data; on the time domain symbol with index 3, the cyclic shift value M(3)=N1/6, then each transmitter performs a N1/6-bit cyclic shift on the data used to map to the symbol, or performs a N1/6-bit cyclic shift downward, and obtains the shifted The data. It is assumed here that N1 is a multiple of 4 and 6. For subsequent time domain symbols, these 4 cyclic shift values, namely [0, -N1/4, 0, N1/6], can be reused to obtain the shifted data.

Then, each transmitter maps the shifted data to the one resource block for transmission. In Figure 8, the index above the table is the time domain index of the resource element used 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 and 2, and the M(i ) represents the cyclic shift value adopted on the time domain symbol with index i.

For the situation shown in Figure 8, in the data sent by each transmitter, on the time domain symbols with indexes 0 and 2, centered on N1/2, the frequency domain indexes are 1, 2,..., N1/2- 2. The data of N1/2-1 have a conjugate relationship with the data with frequency domain indexes N1-1, N1-2,..., N1/2+2, N1/2+1 respectively; in the time domain with index 1 Symbolically, with N1/4 as the center, the data with frequency domain indexes 0,...,N1/4-1 have a conjugate relationship with the data with frequency domain indexes N1/2,...,N1/4+1 respectively, and , with 3*N1/4 as the center, the frequency domain index is N1/2+1,..., 3*N1/4-1 data respectively and the frequency domain index is N1-1,..., 3*N1/4+1 The data has a conjugate relationship; on the time domain symbol with index 3, centered on N1/6, the data with frequency domain indexes 0,..., N1/6-1 are respectively related to the data with frequency domain indexes N1/3,... , the data of N1/6+1 has a conjugate relationship, and, with 2*N1/3 as the center, the frequency domain index is N1/3+1,..., the data of 2*N1/3-1 are respectively related to the frequency domain index The data for N1-1,...,2*N1/3+1 have a conjugate relationship. These data with conjugate relationships can be used for channel estimation by the receiver. In addition, It can be used for the receiver to perform frequency offset estimation and time offset estimation, so that this method can be used in scenarios with large channel changes, or can further improve transmission performance. In addition, on the time domain symbols with index 0 and 2, the data with frequency domain indexes 0 and N1/2 are real numbers; on the time domain symbol with index 1, the frequency domain indexes are N1/4 and 3*N1/ The data of 4 are real numbers; on the time domain symbol with index 3, the data with frequency domain indexes N1/6 and 2*N1/3 are real numbers; these data can also be used for channel estimation and time-frequency offset by the receiver. estimate.

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

In the above exemplary embodiment, each transmitter may carry at least one of payload, identification information, sequence information, transmission resource information, etc. in its first data or data to be sent. By carrying this information in the data, the receiver can obtain the corresponding information and apply it in the detection process, especially when the data transmission method provided by the present disclosure is applied to scheduling-free transmission.

In the above exemplary embodiment, the transformed data is obtained by Fourier transforming the first data, and then the transformed data is cyclically shifted according to the cyclic shift value M to obtain the shifted data, and the shifted data is sent The final data is transferred. Data with a conjugate relationship in the sent data can be used for channel estimation. Then, the transmitter can only send data symbols and not pilot symbols, and there is no need to use pilot symbols for channel estimation. Therefore, this data transmission method can realize pilot-free (or no pilot, pure data) transmission. Moreover, this method can be used for scheduling-free transmission, thereby avoiding pilot collisions and improving the performance of scheduling-free transmission. In addition, this method can still maintain a low peak-to-average power ratio, allowing the transmitter to have better power amplifier utilization efficiency, which is conducive to achieving 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 this disclosure, and K is an integer greater than or equal to 1.

In an exemplary embodiment, each transmitter performs data transmission through the following steps:

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

Expand the shifted data using a sequence of length L to obtain expanded data, where L is an integer greater than 1;

Send the expanded data.

In this exemplary embodiment, each transmitter can use a sequence of length L to expand a group of shifted data to obtain L groups of expanded data, and then send L groups of expanded data. When sending L groups of extended data, the L groups of extended data can be mapped to L time domain symbols for transmission. Each group of data occupies one time domain symbol, where the L time domain symbols can be adjacent, or They may not be adjacent. For example, assuming that the shifted data includes N1*1 pieces of data, a sequence of length L is used to expand the shifted data to obtain N1*L pieces of expanded data, and then the N1*L pieces of expanded data are It is mapped to N1 subcarriers and L time domain symbols of 1 resource block for transmission. The N1*L expanded data can be regarded as L groups of data. Each group of data includes N1*1 data and is used to map to N1 resource elements of a time domain symbol.

In another exemplary embodiment, each transmitter performs data transmission through the following steps:

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

Expand the transformed data using a sequence of length L to obtain expanded data, where L is an integer greater than 1;

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

Send the shifted data.

In this exemplary embodiment, each transmitter can use a sequence of length L to expand a set of transformed data to obtain L sets of extended data, and then perform cyclic shifts on the L sets of extended data respectively. Obtain L groups of shifted data and send L groups of shifted data. The cyclic shift value M may include one or more cyclic shift values. The same cyclic shift value or different cyclic shift values can be used when cyclically shifting the L group of expanded data. Correspondingly, the receiver can adopt different processing procedures. That is to say, for the case of using the same cyclic shift value, the receiver can adopt one processing procedure, and for the case of using different cyclic shift values, the receiver can adopt another processing procedure. A process. Wherein, using different cyclic shift values includes using at least 2 cyclic shift values. When sending 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 performs data transmission through the following steps:

Expand the first data using a sequence of length L to obtain expanded data, where L is an integer greater than 1;

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

Send the shifted data.

In this exemplary embodiment, in one case, each transmitter can use a sequence of length L to extend a set of first data to obtain L sets of extended data, and then separately Perform Fourier transform to obtain L groups of transformed data, then perform cyclic shifts on the L groups of transformed data to obtain L groups of shifted data, and send the L groups of shifted data. The cyclic shift value M may include one or more cyclic shift values. The same cyclic shift value or different cyclic shift values can be used when cyclically shifting the L groups of transformed data. Accordingly, the receiver can adopt different processing procedures, similar to those described above. When sending 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 can use a sequence of length L to expand a set of first data to obtain a set of expanded data, and then perform Fourier transform on this set of expanded data, Obtain a set of transformed data, then perform circular shift on this set of transformed data, obtain a set of shifted data, and send this set of shifted data.

In the above exemplary embodiments, the lengths of the spreading sequences used in different examples may also be different.

In the above exemplary embodiments, the specific processing procedures of some steps are as described in the previous embodiments, implementation modes and examples of this disclosure.

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

Example 3

In this embodiment, K transmitters perform data transmission according to the data transmission method provided by this disclosure, and K is an integer greater than or equal to 1. Optionally, each transmitter performs data transmission through the following steps:

Get the first data;

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

Send the shifted data.

In an exemplary embodiment, obtaining the first data includes: modulating the data to be sent to generate modulation symbols, and using the modulation symbols as the first data. The data to be sent includes bits obtained by encoding the bits to be sent. The modulation can be real number modulation, such as binary phase shift keying (BPSK) modulation; it can also be complex number modulation, such as quadrature phase shift keying (QPSK) modulation; it can also be high-dimensional modulation or sequence modulation, for example, one or Multiple bit modulations are mapped to a specified sequence, and the specified sequence may be a real sequence, a complex sequence, a sparse sequence, etc. The bits to be sent or the data to be sent may include one or more of payload, identification information, designated sequence information, transmission resource information, etc.

In an exemplary embodiment, obtaining the first data includes: modulating the data to be sent to generate a modulation symbol, then using a sequence of length L to spread the modulation symbol to obtain an extended symbol, and using the extended symbol as the first data . Among them, X modulation symbols are expanded using a sequence of length L to obtain X*L expanded symbols, L is an integer greater than 1, and X is an integer greater than or equal to 1. A sequence of length L can be a real sequence, a complex sequence or a sparse sequence. The data to be sent may contain one or more of the payload, identification information, extension sequence information, transmission resource information, etc.

In an exemplary embodiment, obtaining the first data includes: obtaining a plurality of data blocks, and generating the first data according to the plurality of data blocks. Among them, data blocks include coding blocks, code blocks, data packets, bit groups, or symbol groups, etc. For example, a data block includes bits obtained by encoding a group of bits to be sent, or a data block includes a group of bits to be sent. Get multiple data blocks, including getting at least 2 data blocks.

Generating the first data according to the plurality of data blocks includes modulating the plurality of data blocks to generate the first data. In one case, multiple data blocks can be complex-modulated, so that the data in the multiple data blocks each occupy one bit for modulation. For example, assume that there are two data blocks, denoted A1 and A2 respectively, and A1 and A2 are used as real parts and imaginary parts respectively for QPSK modulation to generate the first data. Then, the first data is a complex QPSK symbol. This is equivalent to A1 and A2 occupying one bit each, and then every two bits are modulated into a QPSK symbol. In another case, multiple data blocks can be concatenated or cascaded together for modulation. In another case, multiple data blocks may be modulated separately to obtain multiple sets of modulation symbols, and the multiple sets of modulation symbols may be used as the first data. Multiple sets of modulation symbols can be sent on the same transmission resource or on different transmission resources. When transmitting on the same transmission resource, multiple groups of shifted data obtained based on multiple groups of modulation symbols can be superimposed to obtain superimposed symbols, and then the superimposed symbols can be sent on the transmission resource.

The data contained in multiple data blocks can be different, that is, the transmitter can carry it in multiple data blocks respectively. Different information; or, part of the data contained in multiple data blocks is the same, that is, the transmitter can carry some of the same information in multiple data blocks; or, the data contained in multiple data blocks is the same , that is, the transmitter can carry the same information in multiple data blocks.

The transmitter may carry one or more of payload, identification information, sequence information, transmission resource information, etc. in each data block. For example, the transmitter can carry a payload in each data block, and the payloads carried in different data blocks can be different or the same; the transmitter can carry its identification information in each data block so that the receiver can determine that it has received The data block is sent by which transmitter; the transmitter can also carry sequence information or transmission resource information in each data block for the receiver to obtain the corresponding information and apply it in the detection process. The transmitter can also carry different information in different data blocks. For example, the transmitter can carry payload in at least one data block, or carry identification information in at least one data block, or carry sequence in at least one data block. information, or carry transmission resource information in at least one data block; alternatively, the transmitter carries its identification information and payload in one data block, and only carries the payload in other data blocks; or, the transmitter carries its identification information and payload in one data block It carries its identification information, etc., and the payload is carried in other data blocks.

To generate the first data based on multiple data blocks, you can also obtain the data to be sent based on the multiple data blocks, and then modulate the data to be sent to obtain modulation symbols, and use the modulation symbols as the first data. The transmitter may carry at least one of payload, identification information, sequence information, transmission resource information, etc. in the data to be sent or the first data.

In this exemplary embodiment, by sending data of multiple data blocks through the data transmission method, data transmission capacity and performance can be improved, thereby improving system performance.

In an exemplary embodiment, obtaining the first data includes: obtaining data of a plurality of communication nodes, and generating the first data according to the data of the plurality of communication nodes.

In one case, the communication node includes a sensing node, the transmitter acquires or receives data from multiple sensing nodes, and generates the first data based on the data from the multiple sensing nodes. In another case, the communication node includes a sending node, the transmitter acquires or receives data from a plurality of sending nodes, and generates the first data according to the data of the plurality of sending nodes. In this case, the transmitter can be regarded as a forwarding device, relay device, etc., used to forward data of other communication nodes. In another case, the transmitter obtains the data of Z communication nodes and its own data, and generates the first data based on the data of Z communication nodes and its own data, where Z is an integer greater than or equal to 1. In this case, the transmitter has the function of sending its own data and forwarding the data of other communication nodes at the same time.

Generating the first data according to 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 multiple communication nodes can be complex-modulated, so that the data of multiple communication nodes each occupy one bit for modulation. For example, assume that there are data from two communication nodes, denoted as B1 and B2 respectively. B1 and B2 are used as real parts and imaginary parts respectively for QPSK modulation to generate the first data. Then, the first data is a complex QPSK symbol. This is equivalent to B1 and B2 occupying one bit each, and then every two bits are modulated into a QPSK symbol. In another case, data from multiple communication nodes can be concatenated or cascaded together for modulation.

In this exemplary embodiment, the data of each communication node may include one or more of 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.

To generate the first data based on the data of multiple communication nodes, you can also obtain the data to be sent based on the data of the multiple communication nodes, and then modulate the data to be sent to obtain modulation symbols, and use the modulation symbols as the first data. The transmitter may carry at least one of payload, identity information of at least one communication node, sequence information, transmission resource information, etc. in the data to be sent or the first data. For example, the data to be sent or the first data carries the identification information of the plurality of communication nodes or the identification information of at least one communication node among the plurality of communication nodes.

In this exemplary embodiment, data of multiple communication nodes is sent through the data transmission method, which can improve data transmission capacity and performance, thereby improving system performance.

Example 4

In this embodiment, K transmitters perform data transmission according to the data transmission method provided by this disclosure, and K is an integer greater than or equal to 1. Optionally, each transmitter performs data transmission through the following steps: obtains W groups of first data; performs Fourier transform on W groups of first data respectively to obtain W groups of transformed data; W groups of transformed data are respectively cyclically shifted to obtain W groups of shifted data; W groups of shifted data are sent.

The cyclic shift value M may include one or more cyclic shift values. When the transmitter performs cyclic shifts on the W groups of converted data respectively, the same cyclic shift value can be used, or different cyclic shift values can be used.

When the transmitter sends W groups of shifted data, it can map the W groups of shifted data to different transmission resources for transmission; or it can superimpose the W groups of shifted data to obtain the superimposed symbols, and then map the superimposed symbols to the specified transmission resources for transmission.

This exemplary embodiment sends W groups of data through the data transmission method, which can improve data transmission capacity and performance, thereby improving system performance.

In an exemplary embodiment, K transmitters will transmit, where K is an integer greater than or equal to 1. Optionally, each transmitter performs data transmission through the following steps: Fourier transform is performed on the first data to obtain the transformed data; the transformed data is resource mapped according to the specified rules to obtain the mapped data; Send mapped data.

In one case, the transmitter can directly map the transformed data to a designated transmission resource for transmission.

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

In the above exemplary embodiment, data with a conjugate relationship in the sent data can be used for channel estimation. When the data with a conjugate relationship is located on adjacent or similar resources, better channel estimation results can be obtained. This can improve transmission performance.

In an exemplary embodiment, K transmitters will transmit, where K is an integer greater than or equal to 1. Optionally, each transmitter performs data transmission through the following steps: obtaining the first vector according to the cyclic shift value M; multiplying the first data and the first vector to obtain the operation result; performing Fourier transform on the operation result to obtain Transformed result; send the transformed result.

Among them, the first vector is obtained according to the cyclic shift value M, including: the first vector is 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), exp(1i*2*pi/G*g*|M| ), exp(1i*2*pi/G*g*a*|M|), etc., at least one of them, where g=0, 1, 2,..., G-1, G is an integer greater than or equal to 1, For example, G is the length of the first data, or G is the length or the number of points of the Fourier transform.

Multiply the first data and the first vector to obtain an operation result, and the multiplication here may adopt a method of element-by-element multiplication or multiplication of corresponding elements.

This exemplary embodiment can achieve the same effect as the method of first performing Fourier transform and then performing cyclic shift in the embodiment of the present disclosure. Then, without conflict, various methods described in the above-mentioned embodiments, implementations or examples of the present disclosure may also be applied in this exemplary embodiment.

Through the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by means of software plus the necessary general hardware platform. Of course, it can also be implemented by hardware, but in many cases the former is Better implementation. Based on this understanding, the technical solution of the present disclosure can be embodied in the form of a software product in essence or that contributes to the existing technology. The computer software product is stored in a storage medium (such as ROM/RAM, disk, CD), including several instructions to cause a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods of various embodiments of the present disclosure.

Figure 9 is a structural block diagram (1) of an optional data transmission device according to an embodiment of the present disclosure; as shown in Figure 9, the data transmission device includes:

The first transformation module 902 is configured to perform Fourier transformation on the first data to obtain transformed data;

The first shift module 904 is configured to cyclically shift the transformed data according to the cyclic shift value M to obtain the shifted data;

The sending module 906 is configured to send the shifted data.

Through the above device, the first data is Fourier transformed to obtain the transformed data, and the transformed data is cyclically shifted according to the cyclic shift value M to obtain the shifted data, and then the shifted data is sent Data, data with conjugate relationships can be used for channel estimation to achieve pilot-free (or no pilot, pure data) transmission, thereby avoiding pilot collisions and improving the performance of scheduling-free transmission.

In an 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 the following: identification information, payload, sequence information, and transmission resource information.

In an exemplary embodiment, the first shift module 904 is further configured to cyclically shift the transformed data according to the cyclic shift value M in at least one of the following ways to obtain the shifted data: The transformed data undergoes a circular shift of M bits, or -M bits, or a*M bits, or -a*M bits, to obtain the shifted data, where a is a specified factor. Or a factor obtained according to a preset method; the transformed data is shifted in the first specified direction by an amount of M, or -M, or |M|, or a*M, or -a*M, or Cyclic shift of a*|M| to obtain shifted data, where |M| is the absolute value of M; the shifted data is shifted in the second specified direction by M, or - Cyclic shift of M, or |M|, or a*M, or -a*M, or a*|M|, to obtain the shifted data; obtain the cyclic shift value M according to the specified parameters or specified information , and then cyclically shift the transformed data according to the cyclic shift value M to obtain the shifted data; perform the transformed data according to T cyclic shift values M ₁ , M ₂ ,..., M _T The T groups of data included in the final data are cyclically shifted respectively to obtain the shifted data, where T is an integer greater than or equal to 2; the T cyclic shift values are reused, and the transformed data are The V groups of data included in the data are respectively cyclically shifted to obtain the shifted data, where V is an integer greater than T; the transformed data is expanded using a sequence of length L2 to obtain the expanded data, Then, the expanded data is cyclically shifted according to the cyclic shift value M to obtain the shifted data, where L2 is an integer greater than 1.

In an exemplary embodiment, the sending module 906 is further configured to send the shifted data in at least one of the following ways: using a sequence of length L3 to expand the shifted data to obtain the expanded data, and then send the extended data, where L3 is an integer greater than 1; send the shifted data through the designated transmission resource, and only send data symbols on the designated transmission resource, not Send pilot symbols.

For specific examples in this embodiment, reference may be made to the examples described in the above-mentioned embodiments and exemplary implementations, and details will not be described again in this embodiment.

Figure 10 is a structural block diagram of an optional data processing device according to an embodiment of the present disclosure; as shown in Figure 10, the data processing device includes:

The channel estimation module 1002 is configured to perform channel estimation based on the second data and obtain the channel estimation result;

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

The second shift module 1006 is configured to cyclically shift the processing result according to the cyclic shift value Q to obtain the shifted data;

The second transformation module 1008 is configured to perform an inverse Fourier transform on the shifted data to obtain transformed data.

Through the above device, the channel estimation is performed based on 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, and the processing result is cyclically shifted according to the cyclic shift value Q. , obtain the shifted data, and perform inverse Fourier transform on the shifted data to obtain the transformed data. Therefore, data with conjugate relationships can be used for channel estimation to achieve pilot-free (or pilot-free , pure data) transmission, thereby avoiding pilot collisions and improving the performance of scheduling-free transmission.

In an exemplary embodiment, the channel estimation module 1002 is further configured to perform channel estimation based on the second data in at least one of the following ways to obtain the channel estimation result: perform channel estimation based on data with a conjugate relationship in the second data. estimate, and obtain a channel estimation result; perform channel estimation according to the real data in the second data, and obtain a channel estimation result.

In an exemplary embodiment, the second shift module 1006 is further configured to cyclically shift the processing result according to the cyclic shift value Q in at least one of the following ways to obtain the shifted data: The processing result is circularly shifted by Q bits, or -Q bits, or b*Q bits, or -b*Q bits, to obtain the shifted data, where b is a specified factor or a factor obtained according to a preset method; Perform a cyclic shift of Q, or -Q, or |Q|, or b*Q, or -b*Q, or b*|Q| on the processing result in the first specified direction to obtain The shifted data, where |Q| is the absolute value of Q; the processing result is shifted in the second specified direction by Q, or -Q, or |Q|, or b*Q, or - Cyclic shift of b*Q or b*|Q| to obtain the shifted data; perform a cyclic shift on the processing result according to the cyclic shift value Q to obtain the shifted data, wherein, the The cyclic shift value Q is opposite to the cyclic shift value M used by the transmitter; the cyclic shift value Q is obtained according to the specified parameters or specified information, and then the processing result is cyclically processed according to the cyclic shift value Q Shift to obtain the shifted data; perform cyclic shifts on the T groups of data included in the processing results according to T cyclic shift values Q ₁ , Q ₂ , ..., Q _T to obtain the shifted data , where T is an integer greater than or equal to 2; the T cyclic shift values are repeatedly used to perform cyclic shifts on the V groups of data included in the processing results to obtain the shifted data, where V is an integer greater than T; use a sequence of length L5 to de-extend the processing result to obtain the de-expanded data, and then perform a cyclic shift on the de-expanded data according to the cyclic shift value Q to obtain the shift The following data, where L5 is an integer greater than 1.

In an exemplary embodiment, the second transformation module 1008 is also configured to perform an inverse Fourier transform on the shifted data in the following manner to obtain the transformed data: using a sequence of length L6 to The shifted data is despread to obtain despread data, and then the despread data is subjected to inverse Fourier transform to obtain transformed data, where L6 is an integer greater than 1.

In an exemplary embodiment, the device obtains at least one of the following according to the transformed data: identity information, payload, sequence information, and transmission resource information.

Figure 11 is a structural block diagram (2) of an optional data transmission device according to an embodiment of the present disclosure; as shown in Figure 11, the data transmission device includes:

The acquisition module 1102 is configured to acquire the first vector according to the cyclic shift value M;

The multiplication module 1104 is configured to multiply the first data and the first vector to obtain an operation result;

The third transformation module 1106 is configured to perform Fourier transformation on the operation result to obtain transformed data;

The transmission module 1108 is configured to send the transformed data.

Through the above device, the first vector is obtained according to the cyclic shift value M, the first data is multiplied by the first vector to obtain the operation result, and then the operation result is Fourier transformed to obtain the transformed data, and By sending the transformed data, data with a conjugate relationship can be used for channel estimation to achieve pilot-free (or no pilot, pure data) transmission, thereby avoiding pilot collisions and improving the performance of scheduling-free transmission.

In an exemplary embodiment, the transmission module 1108 is further configured to send the transformed data by at least one of the following: using a sequence of length L3 to extend the transformed data to obtain the extended data, and then Send the extended data, where L3 is an integer greater than 1; send the transformed data through designated transmission resources, and only send data symbols and no pilot symbols on the designated transmission resources. .

Embodiments of the present disclosure also provide an electronic device, including a memory and a processor. A computer program is stored in the memory, and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.

Optionally, in this embodiment, the above-mentioned processor may be configured to perform the following steps through a computer program:

S1, perform Fourier transform on the first data to obtain the transformed data;

S2, cyclically shift the transformed data according to the cyclic shift value M to obtain the shifted data;

S3: Send the shifted data.

Optionally, in another embodiment, the above-mentioned processor may be configured to perform the following steps through a computer program:

S1, obtain the first vector according to the cyclic shift value M;

S2, multiply the first data and the first vector to obtain the operation result;

S3: Perform Fourier transform on the operation result to obtain the transformed data;

S4: Send the converted data.

Optionally, in yet another embodiment, the above-mentioned processor may be configured to perform the following steps through a computer program:

S1, perform channel estimation based on the second data and obtain the channel estimation result;

S2, process the second data according to the channel estimation result and obtain the processing result;

S3, perform a circular shift on the processing result according to the circular shift value Q to obtain the shifted data;

S4: Perform inverse Fourier transform on the shifted data to obtain transformed data.

In an exemplary embodiment, the above-mentioned electronic device may further include a transmission device and an input-output device, wherein the transmission device is connected to the above-mentioned processor, and the input-output device is connected to the above-mentioned processor.

Obviously, those skilled in the art should understand that the above-mentioned modules or steps of the present disclosure can be implemented using general-purpose computing devices, and they can be concentrated on a single computing device, or distributed across a network composed of multiple computing devices. They may be implemented in program code executable by a computing device, such that they may be stored in a storage device for execution by the computing device, and in some cases may be executed in a sequence different from that shown herein. Or the described steps can be implemented by making them into individual integrated circuit modules respectively, or by making multiple modules or steps among them into a single integrated circuit module. As such, the present disclosure is not limited to any specific combination of hardware and software.

The above descriptions are only preferred embodiments of the present disclosure and are not intended to limit the present disclosure. For those skilled in the art, the present disclosure may have various modifications and changes. Any modifications, equivalent substitutions, improvements, etc. made within the principles of this disclosure shall be included in the protection scope of this disclosure.

Claims

A data transmission method including:

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

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

Send the shifted data.
The method of claim 1, wherein the first data includes at least one of the following:

Symbols generated by performing specified modulation on the data to be sent;

Perform specified modulation on the data to be sent to generate a modulation symbol, use a sequence of length L1 to expand the modulation symbol to obtain an expanded symbol, and use the expanded symbol as the first data, where L1 is greater than 1 integer.
The method according to claim 1, wherein the first data includes: data of a plurality of data blocks, or data of a plurality of communication nodes.
The method according to claim 1, wherein the first data includes at least one of the following: identification information, payload, sequence information, and transmission resource information.
The method according to claim 1, wherein the transformed data is cyclically shifted according to the cyclic shift value M to obtain shifted data, including at least one of the following:

Perform a cyclic shift of M bits, or -M bits, or a*M bits, or -a*M bits on the transformed data to obtain the shifted data, where a is a specified factor or a preset factor. Factors obtained by way of;

The transformed data is subjected to a circular shift with a shift amount of M, or -M, or |M|, or a*M, or -a*M, or a*|M| in the first specified direction. , get the shifted data, where |M| is the absolute value of M;

Perform a circular shift of M, or -M, or |M|, or a*M, or -a*M, or a*|M| on the transformed data in the second specified direction. , get the shifted data;

Obtain the cyclic shift value M according to the specified parameter or specified information, and then perform cyclic shift on the transformed data according to the cyclic shift value M to obtain the shifted data;

Perform cyclic shifts on T groups of data included in the transformed data according to T cyclic shift values M 1 , M 2 , ..., M T to obtain shifted data, where the T is an integer greater than or equal to 2;

Reuse the T cyclic shift values to perform cyclic shifts on the V groups of data included in the transformed data, respectively, to obtain shifted data, where the V is an integer greater than T;

The transformed data is expanded using a sequence of length L2 to obtain the expanded data, and then the expanded data is cyclically shifted according to the cyclic shift value M to obtain the shifted data, where, Let L2 be an integer greater than 1.
The method according to claim 1, wherein sending the shifted data includes at least one of the following:

The shifted data is expanded using a sequence of length L3 to obtain the expanded data, and then the expanded data is sent The expanded data, wherein the L3 is an integer greater than 1;

The shifted data is sent through designated transmission resources, and only data symbols and no pilot symbols are sent on the designated transmission resources.
A data transmission method including:

Obtain the first vector according to the cyclic shift value M;

Multiply the first data and the first vector to obtain an operation result;

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

Send the transformed data.
The method of claim 7, wherein the first vector includes 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, and the a is a specified factor or a factor obtained according to a preset method.
The method according to claim 7, wherein the first data includes at least one of the following: identification information, payload, sequence information, and transmission resource information.
The method according to claim 7, wherein sending the transformed data includes at least one of the following:

Expand the transformed data using a sequence of length L3 to obtain expanded data, and then send the expanded data, wherein L3 is an integer greater than 1;

The transformed data is sent through designated transmission resources, and only data symbols are sent on the designated transmission resources, and pilot symbols are not sent.
A data processing method including:

Perform channel estimation based on the second data and obtain a channel estimation result;

Process the second data according to the channel estimation result and obtain the processing result;

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

Perform inverse Fourier transform on the shifted data to obtain transformed data.
The method of claim 11, wherein the second data includes one of the following:

Use the received data or resource demapped data as the second data;

Merge the data received by multiple antennas according to the specified merging vector to obtain the second data;

Despread the received data using a sequence of length L4 to obtain the second data;

Combine the data received by multiple antennas according to the specified merging vector to obtain the combined data, and then use a sequence of length L4 to despread the combined data to obtain the second data, where the L4 is greater than 1 integer.
The method according to claim 11, wherein performing channel estimation according to the second data and obtaining the channel estimation result includes at least one of the following:

Perform channel estimation based on the data with a conjugate relationship in the second data, and obtain the channel estimation result;

Perform channel estimation according to the real number data in the second data, and obtain the channel estimation result.
The method according to claim 11, wherein the processing result is cyclically shifted according to the cyclic shift value Q to obtain shifted data, including at least one of the following:

Perform a circular shift of Q bits, or -Q bits, or b*Q bits, or -b*Q bits on the processing result to obtain the shifted data, where b is a specified factor or obtained according to a preset method factor;

Perform a cyclic shift of Q, or -Q, or |Q|, or b*Q, or -b*Q, or b*|Q| on the processing result in the first specified direction to obtain Shifted data, where |Q| is the absolute value of Q;

Perform a cyclic shift of Q, or -Q, or |Q|, or b*Q, or -b*Q, or b*|Q| on the processing result in the second specified direction to obtain shifted data;

Perform a cyclic shift on the processing result according to a cyclic shift value Q to obtain the shifted data, where the cyclic shift value Q is opposite to the cyclic shift value M used by the transmitter;

Obtain the cyclic shift value Q according to the specified parameter or specified information, and then perform cyclic shift on the processing result according to the cyclic shift value Q to obtain the shifted data;

The T groups of data included in the processing result are cyclically shifted according to T cyclic shift values Q 1 , Q 2 , ..., Q T to obtain shifted data, where T is greater than or an integer equal to 2;

Reuse the T cyclic shift values to perform cyclic shifts on the V groups of data included in the processing results, respectively, to obtain shifted data, where the V is an integer greater than T;

The processing result is despread using a sequence of length L5 to obtain the despread data, and then the despread data is cyclically shifted according to the cyclic shift value Q to obtain the shifted data, where, The L5 is an integer greater than 1.
The method according to claim 11, wherein the shifted data is subjected to an inverse Fourier transform to obtain the transformed data, including:

Despread the shifted data using a sequence of length L6 to obtain the despread data, and then perform an inverse Fourier transform on the despread data to obtain the transformed data, wherein: L6 is an integer greater than 1.
The method according to claim 11, wherein at least one of the following is obtained according to the transformed data: identity identification information, payload, sequence information, and transmission resource information.
A data transmission device including:

The first transformation module is configured to perform Fourier transformation on the first data to obtain transformed data;

The first shift module is configured to cyclically shift the transformed data according to the cyclic shift value M to obtain the shifted data;

A sending module configured to send the shifted data.
A data processing device including:

A channel estimation module, configured to perform channel estimation based on the second data and obtain a channel estimation result;

A processing module configured to process the second data according to the channel estimation result and obtain the processing result;

The second shift module is configured to cyclically shift the processing result according to the cyclic shift value Q to obtain the shifted data;

The second transformation module is configured to perform an inverse Fourier transform on the shifted data to obtain transformed data.
A computer-readable storage medium having a computer program stored in the storage medium, wherein the computer program is configured to execute the method described in any one of claims 1 to 10 when running, or the claim The method described in any one of 11 to 16.
An electronic device comprising a memory and a processor, a computer program stored in the memory, the processor being configured to run the computer program to perform the method described in any one of claims 1 to 10, Or the method described in any one of claims 11 to 16.