[go: up one dir, main page]

WO2023226854A1 - Procédé et appareil de transmission de données, procédé et appareil de traitement de données, et support de stockage - Google Patents

Procédé et appareil de transmission de données, procédé et appareil de traitement de données, et support de stockage Download PDF

Info

Publication number
WO2023226854A1
WO2023226854A1 PCT/CN2023/094869 CN2023094869W WO2023226854A1 WO 2023226854 A1 WO2023226854 A1 WO 2023226854A1 CN 2023094869 W CN2023094869 W CN 2023094869W WO 2023226854 A1 WO2023226854 A1 WO 2023226854A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
shifted
cyclic shift
perform
transformed
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2023/094869
Other languages
English (en)
Chinese (zh)
Inventor
李卫敏
袁志锋
李志岗
马一华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Publication of WO2023226854A1 publication Critical patent/WO2023226854A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes

Definitions

  • 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.
  • scheduling-free transmission can reduce signaling overhead and transmission delay, and can also reduce terminal power consumption.
  • scheduling-free transmission can also reduce signaling overhead and transmission delay, and can also reduce terminal power consumption.
  • 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.
  • 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.
  • a UE 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.
  • transmission resources including time-frequency resources, pilots, etc.
  • pilot collisions will be serious, which will affect the performance of scheduling-free transmission.
  • 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.
  • a data transmission method 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.
  • a data transmission method 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.
  • a data processing method 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.
  • a data transmission device 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.
  • 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; 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.
  • 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.
  • 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 any of the above. Steps in method embodiments.
  • 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.
  • 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.
  • FIG. 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;
  • FIG. 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.
  • 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.
  • 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.
  • processors 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)
  • a memory 104 configured to store data.
  • the above-mentioned computer terminal may also include a transmission device 106 configured as a communication function and an input and output device 108.
  • the structure shown in Figure 1 is only illustrative, and it does not limit the structure of the above-mentioned computer terminal.
  • 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.
  • 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.
  • 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.
  • the transmission device 106 may be a radio frequency (Radio Frequency, RF for short) module, which is configured to communicate with the Internet wirelessly.
  • NIC Network Interface Controller
  • FIG. 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.
  • 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.
  • PAPR Peak to Average Power Ratio
  • 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.
  • the method before Fourier transforming the first data, the method further includes: acquiring or generating the first data.
  • the first data includes data symbols.
  • 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.
  • 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.
  • BPSK binary phase shift keying
  • QPSK Quadrature Phase-Shift Keying
  • sequence of length L1 may be a real sequence, a complex sequence or a sparse sequence.
  • the first data includes at least one of the following: identification information, payload, sequence information, and transmission resource information.
  • 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.
  • 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.
  • 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.
  • 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.
  • the first data can be generated based on multiple data blocks.
  • multiple data blocks may be modulated to generate the first data.
  • 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.
  • 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.
  • 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.
  • the data of each communication node includes its identification information, or the data of at least one communication node includes its identification information.
  • the first data may be generated based on data from multiple communication nodes.
  • data of multiple communication nodes may be modulated to generate the first data.
  • 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.
  • 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.
  • 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.
  • the above-mentioned Fourier transform includes discrete Fourier transform (Discrete Fourier Transform, DFT) or fast Fourier transform (Fast Fourier Transform, FFT).
  • DFT discrete Fourier Transform
  • FFT Fast Fourier Transform
  • the method before cyclically shifting the transformed data according to the cyclic shift value M, the method further includes: obtaining the cyclic shift value M.
  • the cyclic shift value M includes one or more cyclic shift values.
  • 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
  • the transformed data is specified in the second Perform a circular shift of M, or -M, or
  • the expanded data is expanded to obtain expanded data, and then the expanded data is cycl
  • M may be an integer or not 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.
  • M less than 0 means circular shift upward or to the left
  • M greater than 0 means circular shift downward or right
  • 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.
  • the shifted data is the transformed data.
  • M can be greater than or equal to 0.
  • M can be an integer greater than or equal to 0, in which case M only represents the shift amount.
  • the first specified direction includes upward or left
  • the transformed data is circularly shifted upward or to the left
  • the second specified direction includes downward or right
  • 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.
  • 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.
  • 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.
  • the T cyclic shift values 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
  • 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.
  • 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
  • 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
  • the data group D4 is cyclically shifted according to the shift value M2.
  • 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.
  • 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.
  • sending the shifted data includes: mapping the shifted data to a designated transmission resource for sending.
  • 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.
  • 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.
  • multiple time domain symbols may be adjacent or non-adjacent.
  • 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.
  • 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.
  • 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.
  • L1, L2, and L3 may be the same.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • FIG 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.
  • 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
  • the operation result is Fourier transformed to obtain 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.
  • 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.
  • the method before obtaining the first vector according to the cyclic shift value M, the method further includes: obtaining the cyclic shift value M.
  • 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.
  • the cyclic shift value M includes one or more cyclic shift values.
  • the method before multiplying the first data by the first vector, the method further includes: obtaining or generating the first data.
  • 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.
  • the extended symbols include multiple sets of symbols, and different cyclic shift values may be used.
  • 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.
  • the first data or the data to be sent includes data of multiple data blocks or data of multiple communication nodes.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • FIG. 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.
  • 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.
  • 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.
  • the method before performing channel estimation based on the second data and obtaining the channel estimation result, the method further includes: obtaining the second data.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the method before cyclically shifting the processing result according to the cyclic shift value Q, the method further includes: obtaining the cyclic shift value Q.
  • the cyclic shift value Q includes one or more cyclic shift values.
  • 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
  • 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.
  • Q may be an integer or not 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.
  • 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.
  • Q contains the shift direction and shift amount
  • the shift amount is the absolute value of Q.
  • Q can be greater than or equal to 0.
  • Q can be an integer greater than or equal to 0.
  • Q only represents the shift amount.
  • 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.
  • 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.
  • 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.
  • the T cyclic shift values 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.
  • the value of factor b may be the same as or opposite to the value of factor a used by the transmitter.
  • 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.
  • 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.
  • the inverse Fourier transform includes an inverse discrete Fourier transform (IDFT) or an inverse fast Fourier transform (IFFT).
  • IDFT inverse discrete Fourier transform
  • IFFT inverse fast Fourier transform
  • 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.
  • 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.
  • L7 is an integer greater than 1.
  • 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.
  • 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.
  • the method further includes: demodulating and decoding the transformed data to obtain a decoding result.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 are examples of the sequence information and transmission resource information.
  • 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.
  • 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.
  • 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.
  • K transmitters perform data transmission according to the data transmission method provided by this disclosure.
  • each transmitter performs data transmission through the following steps:
  • 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.
  • K transmitters can use different transmission resources.
  • the number of transmission resources can be the same or different.
  • 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.
  • each transmitter uses N resource blocks for data transmission, and N is an integer greater than or equal to 1.
  • 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.
  • 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.
  • 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.
  • FIG. 5 is a schematic diagram of an optional data transmission method in Embodiment 1.
  • the data used to map to a resource element is recorded as s(n1, n2).
  • 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
  • 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.
  • 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.
  • the receiver 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.
  • 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.
  • N1 is an even number.
  • N1 is an odd number
  • 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.
  • 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.
  • FIG. 6 is another schematic diagram of an optional data transmission method in Embodiment 1.
  • N2 is an even number. For the case where N2 is an odd number, similar processing can be performed as described.
  • each transmitter maps the shifted data to the one resource block for transmission.
  • 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.
  • 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.
  • the receiver 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.
  • 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
  • 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.
  • FIG. 7 is another schematic diagram of an optional data transmission method in Embodiment 1.
  • 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.
  • N1 is a multiple of 4
  • N2 is assumed to be an even number.
  • each transmitter maps the shifted data to the one resource block for transmission.
  • 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.
  • 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.
  • 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.
  • 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
  • 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.
  • FIG 8 is another flow chart of an optional data transmission method in Embodiment 1.
  • N1/4 bit circular shift or N1/4 bit circular shift upward to obtain the shifted data
  • the circular shift value M(2) 0
  • 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
  • N1 is a multiple of 4 and 6.
  • these 4 cyclic shift values namely [0, -N1/4, 0, N1/6] can be reused to obtain the shifted data.
  • each transmitter maps the shifted data to the one resource block for transmission.
  • 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
  • the M(i ) represents the cyclic shift value adopted on the time domain symbol with index i.
  • 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
  • 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.
  • 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.
  • the K transmitters adopt the same cyclic shift value. In one implementation, the K transmitters may also use different cyclic shift values.
  • 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.
  • 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.
  • 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.
  • 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.
  • this method can be used for scheduling-free transmission, thereby avoiding pilot collisions and improving the performance of scheduling-free transmission.
  • 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.
  • 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.
  • each transmitter performs data transmission through the following steps:
  • 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.
  • 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.
  • 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.
  • each transmitter performs data transmission through the following steps:
  • 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.
  • 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.
  • 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.
  • using different cyclic shift values includes using at least 2 cyclic shift values.
  • each transmitter performs data transmission through the following steps:
  • 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.
  • 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.
  • the lengths of the spreading sequences used in different examples may also be different.
  • 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.
  • each transmitter performs data transmission through the following steps:
  • 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.
  • 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 .
  • 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.
  • obtaining the first data includes: obtaining a plurality of data blocks, and generating the first data according to the plurality of data blocks.
  • data blocks include coding blocks, code blocks, data packets, bit groups, or symbol groups, etc.
  • 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.
  • multiple data blocks can be complex-modulated, so that the data in the multiple data blocks each occupy one bit for modulation.
  • A1 and A2 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.
  • 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.
  • multiple data blocks can be concatenated or cascaded together for modulation.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the transmitter can be regarded as a forwarding device, relay device, etc., used to forward data of other communication nodes.
  • 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.
  • the data of multiple communication nodes can be complex-modulated, so that the data of multiple communication nodes each occupy one bit for modulation.
  • B1 and B2 are used as real parts and imaginary parts respectively for QPSK modulation to generate the first data.
  • 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.
  • data from multiple communication nodes can be concatenated or cascaded together for modulation.
  • the data of each communication node may include one or more of payload, identification information, sequence information, transmission resource information, etc.
  • the data of each communication node includes its identification information, or the data of at least one communication node includes its identification information.
  • 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.
  • 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.
  • data of multiple communication nodes is sent through the data transmission method, which can improve data transmission capacity and performance, thereby improving system performance.
  • 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.
  • 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.
  • the same cyclic shift value can be used, or different cyclic shift values can be used.
  • the transmitter 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.
  • K transmitters will transmit, where K is an integer greater than or equal to 1.
  • 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.
  • the transmitter can directly map the transformed data to a designated transmission resource for transmission.
  • 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.
  • data with a conjugate relationship in the sent data can be used for channel estimation.
  • 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.
  • K transmitters will transmit, where K is an integer greater than or equal to 1.
  • 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.
  • 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*
  • ), 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 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.
  • 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.
  • 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.
  • 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 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.
  • 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.
  • the first data includes: data of a plurality of data blocks, or data of a plurality of communication nodes.
  • the first data includes at least one of the following: identification information, payload, sequence information, and transmission resource information.
  • 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.
  • the transformed data is shifted in the first specified direction by an amount of M, or -M, or
  • the shifted data is shifted in the second specified direction by M, or - Cyclic shift of M, or
  • 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 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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
  • 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.
  • 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.
  • 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
  • the operation result is Fourier transformed to obtain 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.
  • the first data includes at least one of the following: identification information, payload, sequence information, and transmission resource information.
  • 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.
  • the above-mentioned processor may be configured to perform the following steps through a computer program:
  • the above-mentioned processor may be configured to perform the following steps through a computer program:
  • the above-mentioned processor may be configured to perform the following steps through a computer program:
  • 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.
  • 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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Les modes de réalisation de la présente divulgation concernent un procédé et un appareil de transmission de données, un procédé et un appareil de traitement de données, et un support de stockage. Le procédé de transmission de données comprend les étapes suivantes : mise en œuvre d'une transformée de Fourier sur des premières données, de façon à obtenir des données transformées ; mise en œuvre d'un décalage cyclique sur les données transformées selon une valeur de décalage cyclique M, de façon à obtenir des données décalées ; et envoi des données décalées. Au moyen de la solution technique, le problème dans l'état de la technique d'une collision pilote grave se produisant dans une transmission sans autorisation basée sur un pilote et affectant ainsi les performances de transmission sans autorisation est résolu.
PCT/CN2023/094869 2022-05-27 2023-05-17 Procédé et appareil de transmission de données, procédé et appareil de traitement de données, et support de stockage Ceased WO2023226854A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210591038.5A CN117176516A (zh) 2022-05-27 2022-05-27 数据传输方法及装置、数据处理方法及装置、存储介质
CN202210591038.5 2022-05-27

Publications (1)

Publication Number Publication Date
WO2023226854A1 true WO2023226854A1 (fr) 2023-11-30

Family

ID=88918471

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/094869 Ceased WO2023226854A1 (fr) 2022-05-27 2023-05-17 Procédé et appareil de transmission de données, procédé et appareil de traitement de données, et support de stockage

Country Status (2)

Country Link
CN (1) CN117176516A (fr)
WO (1) WO2023226854A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105580302A (zh) * 2014-08-30 2016-05-11 华为技术有限公司 一种发送数据的方法、信道估计方法及装置
CN110011948A (zh) * 2018-01-05 2019-07-12 中兴通讯股份有限公司 数据传输方法及装置、存储介质、电子装置
US20190379567A1 (en) * 2017-01-20 2019-12-12 Wisig Networks Private Limited System and method for generating spreaded sequence with low peak-to-average power ratio (papr) waveform
US20200145272A1 (en) * 2018-11-01 2020-05-07 Research Cooperation Foundation Of Yeungnam University Method for eliminating interference between resource blocks for filterbank multicarrier scheme and apparatus using thereof

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105580302A (zh) * 2014-08-30 2016-05-11 华为技术有限公司 一种发送数据的方法、信道估计方法及装置
US20190379567A1 (en) * 2017-01-20 2019-12-12 Wisig Networks Private Limited System and method for generating spreaded sequence with low peak-to-average power ratio (papr) waveform
CN110011948A (zh) * 2018-01-05 2019-07-12 中兴通讯股份有限公司 数据传输方法及装置、存储介质、电子装置
US20200145272A1 (en) * 2018-11-01 2020-05-07 Research Cooperation Foundation Of Yeungnam University Method for eliminating interference between resource blocks for filterbank multicarrier scheme and apparatus using thereof

Also Published As

Publication number Publication date
CN117176516A (zh) 2023-12-05

Similar Documents

Publication Publication Date Title
US20230171057A1 (en) Method for transmitting demodulation reference signal for uplink data in wireless communication system, and device for same
JP7371162B2 (ja) 無線通信システムにおけるアップリンク制御信号に対する復調参照信号を送信するための方法、及びこのための装置
CN107888531B (zh) 一种参考信号传输方法和装置
US20250106085A1 (en) Method for generating low papr sequence in wireless communication system, and apparatus for same
CN107949991A (zh) 一种信号发送或接收方法和设备
JP2020503791A (ja) 情報送信方法、情報受信方法、装置及びシステム
JP2020503791A5 (fr)
CN115053497A (zh) 用于无线通信系统中传输上行链路信道的方法和设备
CN116584059A (zh) 一种参考信号的通信方法、装置及系统
CN108886442A (zh) 发送设备、接收设备及其方法
US10999108B2 (en) Wireless communication method, apparatus, and system
CN111934832A (zh) 基于多信道传输信号的方法和装置
CN111726311B (zh) 数据信道的传输方法及装置
US20240106616A1 (en) Multi-user communication method and related communication apparatus
CN111835669A (zh) 参考信号发送方法和装置
EP4120645A1 (fr) Procédé et dispositif basés sur un ofdm et permettant d'étaler et de transmettre des données compressées
WO2023226854A1 (fr) Procédé et appareil de transmission de données, procédé et appareil de traitement de données, et support de stockage
CN113892249A (zh) 用于数据调制中的伪序列插入的方法及装置
US12425272B2 (en) Channel estimation method and apparatus, communication device, and storage medium
CN113630222A (zh) 一种被用于无线通信的节点中的方法和装置
WO2025241668A1 (fr) Procédé et appareil de communication
WO2025185728A9 (fr) Procédé d'émission de signal de référence, procédé de réception de signal de référence et appareil
CN104052705B (zh) 数据发送和接收方法及设备
WO2024082926A1 (fr) Procédé de transmission de signal, système de communication et appareil de communication
WO2025092661A1 (fr) Procédé et dispositif de transmission pilote

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23810927

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 23810927

Country of ref document: EP

Kind code of ref document: A1