WO2018171635A1 - 发送数据的方法和装置，以及接收数据的方法和装置 - Google Patents

发送数据的方法和装置，以及接收数据的方法和装置 Download PDF

Info

Publication number
WO2018171635A1
WO2018171635A1 PCT/CN2018/079874 CN2018079874W WO2018171635A1 WO 2018171635 A1 WO2018171635 A1 WO 2018171635A1 CN 2018079874 W CN2018079874 W CN 2018079874W WO 2018171635 A1 WO2018171635 A1 WO 2018171635A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource
data
resources
transmission
information block
Prior art date
Application number
PCT/CN2018/079874
Other languages
English (en)
French (fr)
Inventor
吕永霞
马蕊香
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP18770493.7A priority Critical patent/EP3589048B1/en
Publication of WO2018171635A1 publication Critical patent/WO2018171635A1/zh
Priority to US16/581,555 priority patent/US20200021388A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0015—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy
    • H04L1/0017—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy where the mode-switching is based on Quality of Service requirement
    • H04L1/0018—Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the adaptation strategy where the mode-switching is based on Quality of Service requirement based on latency requirement
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/02—Selection of wireless resources by user or terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA

Definitions

  • the present application relates to the field of wireless communications, and in particular, to a method and apparatus for transmitting data, and a method and apparatus for receiving data.
  • Frequency hopping is a communication method that can improve the anti-interference ability of a communication system.
  • the carrier frequency is hopped according to a certain sequence.
  • the transmitting end modulates the information bits to generate a baseband signal, and then performs carrier modulation.
  • the carrier frequency changes frequency under the control of the frequency hopping sequence, and is then sent to the receiving end through the antenna, and the receiving end is based on the frequency hopping synchronization signal and the frequency hopping sequence.
  • the receiving frequency is determined, and the corresponding frequency hopping signal is received and demodulated.
  • the fifth-generation (5th-generation, 5G) communication system requires the support of ultra-reliable and ultra-low latency (URLLC) services.
  • URLLC ultra-reliable and ultra-low latency
  • the transmission delay of the wireless air interface is generally required.
  • the existing frequency hopping technology cannot meet the reliability requirements of the 5G communication system for data transmission.
  • the present application proposes a method and apparatus for transmitting data, and a method and apparatus for receiving data, which can improve the reliability of frequency hopping transmission.
  • a method for transmitting data comprising: determining, by a transmitting end, a first resource according to a first parameter n, where n represents a number of transmissions of the first information block, and the first resource is used for the first a current transmission of an information block, wherein the n is greater than or equal to 0; the transmitting end transmits the first data by using the first resource, where the first data is obtained by using the first information block after processing The transmitted data; wherein the first resource is included in K pre-configured resources, and the K is an integer greater than one.
  • the method for transmitting data provided by the application determines the first resource from the plurality of resources according to the correspondence between the number of transmissions of the data to be sent and the resource, and sends the to-be-sent data to the receiving end by using the first resource, and the receiving end Detecting data on the first resource, and determining a transmission order of the received data according to the foregoing correspondence.
  • the currently received data may be received previously. The data is combined and decoded, thereby improving the reliability of data transmission.
  • the K pre-configured resources have different resource start locations.
  • the K pre-configured resources are unscheduled resources.
  • the resources used for the unscheduled transmission are different from those used for the scheduled transmission, so that the collision problem when different devices transmit data using the two transmission modes can be avoided.
  • the first resource is a resource that is uniquely corresponding to the n among the K resources.
  • the receiving end may determine that the first data is the data of the first transmission of the first information block according to the first resource used for receiving the first data.
  • the number of transmissions of the first information block is in one-to-one correspondence with at least one of the K resources.
  • the receiving end may determine the number of transmissions of the first information block according to the first resource used to receive the first data.
  • the sending end determines the first resource according to the first parameter n, including:
  • the transmitting end determines the first resource according to the n and at least one of the following parameters,
  • the transmitting end can flexibly select the manner of frequency hopping communication according to actual conditions.
  • the reference location is information preset in the sending end.
  • the reference location may be specified by a communication protocol, so that the sender does not need to perform information interaction with the receiver to determine the reference location, which reduces the delay of data transmission.
  • the sending end determines the first resource according to the first parameter n, where the sending end determines the first resource according to the n and the randomization function; or, the sending end is configured according to the n and The predefined rule determines the first resource; or the transmitting end determines the first resource according to the n, a randomization function, and a predefined rule.
  • the transmitting end can flexibly select the manner of frequency hopping communication according to actual conditions.
  • the method further includes: the sending end determining an initialization function of the randomization function according to the high layer signaling or the identifier information of the sending end.
  • the method further includes: the sending end determines, according to the K, a set of redundancy versions of the first data, where the number of redundancy versions included in the set of redundancy versions is less than or equal to Said K, said M is a positive integer.
  • the sender may determine the number of redundancy versions in the redundancy version set of the first data according to K, so that the redundancy version set may be flexibly determined such that the number of redundancy versions is less than or equal to the number of available resources, and the receiving end receives for each The data needs to be detected using only one redundancy version, which reduces the complexity of blind detection at the receiving end.
  • any one of the redundancy versions of the first data corresponds to at least one transmission of the first information block.
  • the transmitting end does not need to determine the redundancy version set according to the K resources, which reduces the complexity of sending data at the transmitting end.
  • the K is equal to one.
  • a method for receiving data comprising: receiving, by a first end, first data by using a first resource; and determining, by the receiving end, a first parameter n according to the first resource, where n represents a first The number of transmissions of the information block, the first information block is obtained after the first data is processed, and the n is greater than or equal to 0; wherein the first resource is included in K pre-configured resources.
  • K is an integer greater than one.
  • the method for receiving data provided by the application determines, according to the correspondence between the resource used by the received data and the transmission order, that the currently received data is the data transmitted for the first time, and the data received by the receiving end is the data that is not transmitted for the first time.
  • the received data is combined and decoded with the previously received data, the reliability of the data transmission is improved.
  • the K pre-configured resources have different resource start locations.
  • the K pre-configured resources are unscheduled resources.
  • the resources used for the unscheduled transmission are different from those used for the scheduled transmission, so that the collision problem when different devices transmit data using the two transmission modes can be avoided.
  • the first resource is a resource that is uniquely corresponding to the n among the K resources.
  • the receiving end may determine that the first data is the data of the first transmission of the first information block according to the first resource used for receiving the first data.
  • the number of transmissions of the first information block is in one-to-one correspondence with at least one of the K resources.
  • the receiving end may determine the number of transmissions of the first information block according to the first resource used to receive the first data.
  • the receiving end determines the first parameter n according to the first resource, including:
  • the receiving end determines the n according to at least one of the first resource and the following parameters,
  • the reference location is used to indicate a resource used when the first information block is first transmitted, where the first time unit t 1 is a time unit used by the sending end to send the first data, and the j is used to identify The transmitting end.
  • the receiving end determines the correspondence between the first resource and the number of transmissions according to the foregoing parameters, so that the manner of frequency hopping communication can be flexibly selected according to actual conditions.
  • the receiving end determines the first parameter n according to the first resource, where: the receiving end determines the n according to the first resource and a randomization function; or, the receiving end is configured according to the The first resource and the predefined rule determine the n; or the receiving end determines the n according to the first resource, a randomization function, and a predefined rule.
  • the transmitting end and the receiving end can flexibly select the manner of frequency hopping communication according to actual conditions.
  • the method further includes: the receiving end determining an initialization function of the randomization function according to the high layer signaling or the identifier information of the sending end.
  • the method further includes: the receiving end determining, according to the K, a set of redundancy versions of the first data, where the number of redundancy versions included in the set of redundancy versions is less than or equal to Said K, said M is a positive integer.
  • the receiving end may determine the number of redundancy versions in the redundancy version set of the first data according to K, so that the redundancy version set may be flexibly determined such that the number of redundancy versions is less than or equal to the number of available resources, and the receiving end receives each time.
  • the data needs to be detected using only one redundancy version, which reduces the complexity of blind detection at the receiving end.
  • any one of the redundancy versions of the first data corresponds to at least one transmission of the first information block.
  • the receiving end does not need to determine the redundancy version set according to the number of available frequency resources, which reduces the complexity of sending data at the transmitting end.
  • the K is equal to one.
  • the present application provides an apparatus for transmitting data, which may implement the functions performed by the transmitting end in the method related to the foregoing aspect, and the functions may be implemented by hardware or by executing corresponding software by hardware.
  • the hardware or software includes one or more corresponding units or modules of the above functions.
  • the apparatus includes a processor and a transceiver configured to support the apparatus to perform the corresponding functions of the above methods.
  • the transceiver is used to support communication between the device and other network elements.
  • the apparatus can also include a memory for coupling with the processor that retains the program instructions and data necessary for the apparatus.
  • the present application provides an apparatus for receiving data, and the apparatus may implement the functions performed by the receiving end in the method related to the foregoing aspects, and the functions may be implemented by hardware or by executing corresponding software by hardware.
  • the hardware or software includes one or more corresponding units or modules of the above functions.
  • the apparatus includes a processor and a transceiver configured to support the apparatus to perform the corresponding functions of the above methods.
  • the transceiver is used to support communication between the device and other network elements.
  • the apparatus can also include a memory for coupling with the processor that retains the program instructions and data necessary for the apparatus.
  • a network system comprising the apparatus for transmitting data and the apparatus for receiving data as described in the various aspects above.
  • a computer program product comprising: computer program code, when the computer program code is executed by a communication unit, a processing unit or a transceiver of a transmitting end, and a processor, causing the terminal device to execute The method in the above implementation.
  • a computer program product comprising: computer program code, when the computer program code is run by a communication unit, a processing unit or a transceiver of a receiving end, and a processor, causing an access network
  • the device performs the methods in the above implementations.
  • the present application provides a computer storage medium for storing computer software instructions for use by the transmitting end, comprising a program designed to perform the above aspects.
  • the present application provides a computer storage medium for storing computer software instructions for use by the receiving end, including a program designed to perform the above aspects.
  • FIG. 1 is a schematic architectural diagram of a communication system to which the present application is applied;
  • FIG. 2 is a schematic flowchart of a method for transmitting data provided by the present application
  • FIG. 3 is a schematic flowchart of a method for receiving data provided by the present application.
  • FIG. 4 is a schematic structural diagram of a possible transmitting end provided by the present application.
  • FIG. 5 is a schematic structural diagram of another possible transmitting end provided by the present application.
  • FIG. 6 is a schematic structural diagram of a possible receiving end provided by the present application.
  • FIG. 7 is a schematic structural diagram of another possible receiving end provided by the present application.
  • FIG. 1 illustrates a communication system 100 to which the present application is applied.
  • the communication system 100 includes a network device 110 and a terminal device 120.
  • the network device 110 and the terminal device 120 communicate through a wireless network.
  • the wireless communication module can encode the information for transmission.
  • the wireless communication module can acquire a certain number of data bits to be transmitted over the channel to the network device 110, such as data bits generated by the processing module, received from other devices, or saved in the storage module.
  • These data bits may be included in one or more transport blocks (which may also be referred to as information blocks or data blocks) that may be segmented to produce a plurality of coded blocks.
  • a terminal device may be referred to as an access terminal, a user equipment (UE), a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, and a wireless device.
  • Communication device user agent or user device.
  • the access terminal can be a cellular telephone, a handheld device with wireless communication capabilities, a computing device or other processing device connected to the wireless modem, an in-vehicle device, a wearable device, and a user device in a 5G communication system.
  • the network device may be a base transceiver station (BTS) in a code division multiple access (CDMA) system, or may be a base station in a wideband code division multiple access (WCDMA) system (
  • the node B, NB) may also be an evolved base station (eNB) in a long term evolution (LTE) system, or may be a base station (gNB) in a 5G communication system, and the foregoing base station is only an example.
  • the network device can also be a relay station, an access point, an in-vehicle device, a wearable device, and other types of devices.
  • the communication system to which the present application is applied is merely an example.
  • the communication system to which the present application is applied is not limited thereto.
  • the number of network devices and terminal devices included in the communication system may be other numbers.
  • the unscheduled transmission can be understood as any meaning of the following meanings, or multiple meanings, or a combination of some of the various technical features or other similar meanings:
  • the unscheduled transmission may be: the network device pre-allocates and informs the terminal device of multiple transmission resources; when the terminal device has an uplink data transmission requirement, select at least one transmission resource from the plurality of transmission resources pre-allocated by the network device, and use the selected transmission.
  • the resource sends uplink data; the network device detects uplink data sent by the terminal device on one or more of the pre-assigned multiple transmission resources.
  • the detection may be blind detection, or may be performed according to one of the control domains in the uplink data, or may be detected in other manners.
  • the unscheduled transmission may be: the network device pre-allocates and informs the terminal device of multiple transmission resources, so that when the terminal device has an uplink data transmission requirement, at least one transmission resource is selected from a plurality of transmission resources pre-allocated by the network device, and the selected one is used.
  • the transmission resource sends uplink data.
  • the unscheduled transmission may be: acquiring information of a plurality of pre-assigned transmission resources, selecting at least one transmission resource from the plurality of transmission resources when the uplink data transmission request is required, and transmitting the uplink data by using the selected transmission resource.
  • the method of obtaining can be obtained from a network device.
  • the unscheduled transmission may refer to a method for implementing uplink data transmission of the terminal device without dynamic scheduling of the network device, where the dynamic scheduling may refer to that the network device indicates the transmission resource by signaling for each uplink data transmission of the terminal device.
  • implementing uplink data transmission of the terminal device may be understood as allowing data of two or more terminal devices to perform uplink data transmission on the same time-frequency resource.
  • the transmission resource may be a transmission resource of one or more transmission time units after the time when the terminal device receives the signaling.
  • a transmission time unit may refer to a minimum time unit of one transmission, such as a transmission time interval (TTI).
  • the unscheduled transmission may refer to: the terminal device performs uplink data transmission without requiring network device scheduling.
  • the scheduling may be performed by the terminal device sending an uplink scheduling request to the network device, and after receiving the scheduling request, the network device sends an uplink grant to the terminal device, where the uplink grant indicates an uplink transmission resource allocated to the terminal device.
  • the unscheduled transmission may be a competitive transmission mode. Specifically, multiple terminals may simultaneously perform uplink data transmission on the same time-frequency resources allocated in advance without performing scheduling by the base station.
  • the data may be service data or signaling data.
  • the blind detection can be understood as the detection of data that may arrive without predicting whether or not data has arrived.
  • the blind detection can also be understood as detection without explicit signaling indication.
  • the basic time unit of the unscheduled transmission may be a TTI (eg, including a short transmission time interval (sTTI)).
  • TTI eg, including a short transmission time interval (sTTI)
  • the unscheduled transmission may include downlink data channel reception or uplink data channel transmission with a TTI length of 1 millisecond (ms) or a TTI length of less than 1 ms.
  • the time-frequency resource used by the network device and the terminal device to transmit information may be a time-frequency resource used based on a contention mechanism, or may be a time-frequency resource used based on a non-competitive mechanism, where The time-frequency resource, the terminal device can detect whether a certain time-frequency resource is currently in an idle state, or whether the time-frequency resource is used by another device, if the time-frequency resource is in an idle state, or the time-frequency resource is not otherwise When the device is used, the terminal device can use the time-frequency resource for communication, for example, performing uplink transmission, etc.; if the time-frequency resource is not in an idle state, or the time-frequency resource is used by another device, the terminal device cannot use the terminal device.
  • the time-frequency resource may be similar to the prior art. Here, in order to avoid redundancy, detailed description thereof is omitted.
  • the time-frequency resource used by the communication system 100 may be a licensed time-frequency resource or an unlicensed time-frequency resource.
  • each communication device for example, a network device or a terminal device
  • the resources used by the network device and the terminal device to transmit information may be divided into multiple time units in the time domain, and the multiple time units may be continuous or some adjacent time units. There is a preset interval between them, which is not limited in this application.
  • the length of a time unit can be arbitrarily set, which is not limited in this application.
  • one time unit may include one or more subframes.
  • one time unit may include one or more slots or mini-slots.
  • one time unit may include one or more time domain symbols.
  • one time unit may include one or more TTIs or sTTIs.
  • the length of one time unit is 1 ms.
  • the length of one time unit is less than 1 ms.
  • TTI is a time parameter commonly used in existing communication systems, and is a time unit for scheduling data in a communication system.
  • the length of one TTI is 1 ms, which corresponds to the length of time of one sub-frame, that is, the length of time of two slots.
  • the transmission of data may be based on network device scheduling, and the scheduled basic time unit is one or more minimum time scheduling units, wherein the minimum time scheduling unit may be the above TTI, or may be the above sTTI.
  • the specific scheduling procedure is that the base station sends a control channel, for example, a physical downlink control channel (PDCCH) or an enhanced physical downlink control channel (EPDCCH) or a physical downlink control channel for scheduling sTTI transmission.
  • the sTTI physical downlink control channel (sPDCCH) the control channel may be configured to use a downlink control information (DCI) format for scheduling a physical downlink shared channel (PDSCH) or a physical uplink shared channel.
  • DCI downlink control information
  • Scheduling information of a physical uplink shared channel includes control information such as resource allocation information and a modulation and coding scheme.
  • the terminal device detects the control channel, and performs downlink data channel reception or uplink data channel transmission according to the detected scheduling information carried in the control channel.
  • the present application does not limit the spectrum resources used by the communication system 100, and may be an authorized spectrum, or an unlicensed spectrum, or other shared spectrum.
  • FIG. 2 is a schematic flowchart of a method for transmitting data provided by the present application.
  • the method 200 includes:
  • the sending end determines, according to the first parameter n, a first resource, where n represents a number of transmissions of the first information block, and the first resource is used for current transmission of the first information block, where n is greater than or equal to 0. .
  • the sending end transmits the first data by using the first resource, where the first data is data that is obtained after the first information block is processed and used for current transmission.
  • the first resource is included in K pre-configured resources, and the K is an integer greater than 1.
  • the transmitting end may be the terminal device shown in FIG. 1, or may be the network device shown in FIG. 1, and may also be other devices, for example, a terminal device in a Machine to Machine (M2M) communication system.
  • M2M Machine to Machine
  • the first information block is any one of the information blocks to be sent by the sending end, and the first information block may be generated by the sending end, or may be obtained by the sending end from other devices, or may be stored by the sending end.
  • the first data is the current data to be transmitted generated after the first information block is processed (for example, coded modulation and rate matching), and the first information block may be processed by the transmitting end to generate the first data. Part of the first information block may also be processed to generate first data.
  • the first parameter n may indicate that the current transmission is the nth transmission, and the first parameter n may also indicate how many times the current first information block has been transmitted.
  • the current transmission refers to the current nth transmission of the first information block (the value range of n does not include 0) or the current n+1th transmission (the value range of n includes 0), for example, n
  • the value range does not include 0, that is, when n is greater than or equal to 1, when n indicates that the current number of transmissions of the first information block is 1, the first resource is used for the first transmission of the first information block; or, n
  • the value range includes 0, that is, when n is greater than or equal to 0, when n indicates that the number of times the first information block has been transmitted is 1, the first resource is used for the second transmission of the first information block.
  • At least one of the K resources is in one-to-one correspondence with at least one transmission of the first information block.
  • the first resource is used only for the current transmission of the first information block, so that the receiving end can
  • a sequence number of at least one transmission of the first data is determined according to a resource used to receive the first data.
  • the first resource may include one resource or multiple resources.
  • the K pre-configured resources may be frequency domain resources, time-frequency resources, or code domain resources.
  • the pre-configuration may refer to the protocol specification, and may also refer to the access network device configured by signaling.
  • the correspondence between the number of transmissions of the first information block and at least one of the K frequency domain resources includes the following three cases.
  • the K frequency domain resources include a first frequency domain resource and a second frequency domain resource.
  • the first data may be mapped on the first frequency domain resource; when n is equal to 2, the first data may be mapped.
  • the receiving end can determine the transmission order of the first data according to the number or index of the frequency domain resource that receives the first data, and can perform the combined decoding with the previously received data, thereby improving the success rate of the data transmission and reducing the data transmission success rate.
  • the delay of data transmission is a first frequency domain resource and a second frequency domain resource.
  • Case 2 There is a one-to-many correspondence between the number of data transmissions and a plurality of frequency domain resources in the K frequency domain resources.
  • the K frequency domain resources include a first frequency domain resource, a second frequency domain resource, a third frequency domain resource, and a fourth frequency domain resource.
  • n is equal to 1
  • the first data may be mapped on the first frequency domain resource. It may also be mapped on the second frequency domain resource; when n is equal to 2, the first data may be mapped on the third frequency domain resource or may be mapped on the fourth frequency domain resource. Therefore, the transmitting end can select a highly reliable frequency domain resource to send data according to actual conditions, thereby improving the success rate of data transmission and reducing the delay of data transmission.
  • the K frequency domain resources include a first frequency domain resource and a second frequency domain resource.
  • the first data may be mapped on the first frequency domain resource; when n is equal to 3 and 4, the first A data can be mapped on the second frequency domain resource. Therefore, the transmitting end can make full use of the existing frequency domain resource hopping to transmit data.
  • the receiving end cannot identify which transmission corresponds to the first frequency domain resource, and the receiving end can perform data combining according to the principle of small n value. For example, when the receiving end detects data on the first frequency domain resource, the receiving end uniformly decodes the data transmitted for the first time according to the data, thereby avoiding data merge errors.
  • the correspondence between the data transmission order and the K resources may be a collection of the above various situations.
  • the transmitting end and the receiving end stipulate that the first transmission of the first information block uses the first resource, the second transmission of the first information block uses the second resource or the third resource, and the subsequent multiple retransmission uses the fourth resource. If the receiving end receives the first data by using the first resource, determining that the first data is the first transmitted data; if the receiving end receives the first data by using the second resource or the third resource, determining that the first data is the second The data transmitted once; if the receiving end receives the first data through the fourth resource, the first data may be determined as the data transmitted for the third time according to the small n value principle described above.
  • the corresponding relationship may be a corresponding relationship stipulated in the communication protocol, and the transmitting end and the receiving end may perform frequency hopping communication without information interaction; the corresponding relationship may also be a correspondence relationship that the sending end indicates to the receiving end by using the indication information, for example, a network device.
  • the corresponding relationship between the terminal device and the terminal device is indicated by signaling or system information, so that the transmitting end and the receiving end can flexibly perform hopping communication (using different frequency domain resources or code domain resources for different transmission times), and improving the diversity gain of the received data.
  • n when the maximum number of transmissions N of the first information block is less than or equal to K, n ranges from 1 to N; when N is greater than or equal to K, n ranges from 1 to K, where , N is a positive integer.
  • the frequency domain resource transmits the first data.
  • the K frequency domain resources may not overlap at all or may partially overlap, but the starting positions of the K frequency domain resources are different from each other.
  • the method for determining, by the transmitting end, the first frequency domain resource from the K frequency domain resources according to the number of transmissions n is not limited.
  • the sending end may determine the starting position of the first frequency domain resource according to n, and determine according to the bandwidth.
  • the transmitting end may also directly determine the first frequency domain resource or determine the first frequency domain resource by other means.
  • the correspondence between the data transmission order and the K code domain resources is similar to the correspondence between the data transmission order and the K frequency domain resources.
  • the K code domain resources when there is a one-to-one correspondence between the data transmission order and at least one of the K code domain resources, there may be a one-to-many relationship, and a many-to-one relationship may exist. It is a pilot sequence used in the first data transmission, and the K code domain resources are pseudo-orthogonal or orthogonal to each other.
  • the correspondence between the data transmission order and the K resources is related to the time and frequency, the correspondence between the data transmission order and the K time-frequency resources, and the data transmission order and the K frequency-domain resources. Corresponding relationships are similar. For details, refer to the following embodiments of the method 400 and the method 600.
  • the transmitting end determines the first resource from the plurality of resources according to the correspondence between the sending order of the data to be sent and the resource, and sends the to-be-sent data to the receiving end by using the first resource.
  • the receiving end detects data on the first resource, and determines a transmission order of the received data according to the foregoing correspondence.
  • the currently received data may be compared with the previous one. The received data is combined and decoded, thereby improving the reliability of data transmission.
  • the K pre-configured resources have different resource start locations.
  • the K pre-configured resources are unscheduled resources.
  • the resources used for the unscheduled transmission are different from the resources used for the grant-based transmission, so that the collision problem when different devices transmit data using the two transmission modes can be avoided.
  • the first resource is a resource that is uniquely corresponding to the n among the K resources.
  • the receiving end may determine that the first data is the data of the first transmission of the first information block according to the first resource used for receiving the first data.
  • the number of transmissions of the first information block is in one-to-one correspondence with at least one of the K resources.
  • the receiving end may determine the number of transmissions of the first information block according to the first resource used to receive the first data.
  • the sending end determines the first resource according to the first parameter n, including:
  • the sending end determines the first resource according to the n and at least one of the following parameters,
  • the frequency domain reference location is used by the transmitting end to determine the first frequency domain resource, where the frequency domain reference location may be the starting location of the frequency domain resource used when the first data is first sent, and also It can be a frequency domain location that is independent of the number of transmissions.
  • t 1 may be a symbol sequence number, a slot number, a microslot number, or a subframe number of the first time unit.
  • the specific form of the first time unit is not limited in this application.
  • the parameter j is used to identify the sender.
  • the parameter j can be a parameter of a subscriber identity or a high layer signaling configuration.
  • the transmitting end can flexibly select the manner of frequency hopping communication according to actual conditions.
  • the reference location is information preset in the sending end.
  • the reference location may be specified by a communication protocol, so that the sender does not need to perform information interaction with the receiver to determine the reference location, which reduces the delay of data transmission.
  • the sending end determines the first resource according to the first parameter n, including:
  • the sending end determines the first resource according to the n and a randomization function. or,
  • the sending end determines the first resource according to the n and a predefined rule. or,
  • the sending end determines the first resource according to the n, a randomization function, and a predefined rule.
  • the transmitting end can flexibly select the manner of frequency hopping communication according to actual conditions.
  • the method 200 further includes:
  • the sending end determines an initialization function of the randomization function according to the high layer signaling or the identifier information of the sending end.
  • the base station may determine an initialization function of the randomization function according to the identifier of the terminal device, thereby avoiding the situation that the frequency hopping pattern of the frequency hopping user in the same cell is consistent, thereby avoiding Collisions between different frequency hopping users in the same cell.
  • the terminal device may determine an initialization function of the randomization function according to the identifier of the terminal device or high layer signaling, thereby avoiding a frequency hopping pattern of the frequency hopping user in the same cell. Consistent, so that collisions between different frequency hopping users in the same cell can be avoided.
  • the method 200 further includes:
  • the sending end determines, according to the K, a redundancy version set of the first data, where the redundancy version includes a number M of redundancy versions that is less than or equal to the K, where the M is positive. Integer.
  • the sender may determine the number of redundancy versions in the redundancy version set of the first data according to the number of available resources (ie, K), so that the redundancy version set may be flexibly determined such that the number of redundancy versions is less than or equal to the available resources.
  • K the number of available resources
  • any one of the redundancy versions of the first data corresponds to at least one transmission of the first information block.
  • the sender may also directly determine a redundancy version set of the first data, where the redundancy version set may be determined by the sender according to a communication protocol, for example, when the number M of redundancy versions in the redundancy version set is smaller than the number of frequency hopping frequency domain resources.
  • a redundancy version may correspond to one or more transmissions; when M is equal to K, the redundancy version corresponds to the number of transmissions; when M is greater than K, one or more redundancy versions correspond to one transmission.
  • the transmitting end does not need to determine the redundancy version set according to the number of available resources, which reduces the complexity of sending data at the transmitting end.
  • K 1.
  • g(n) can be defined by the following method, but the definition of g(n) in the present application is not limited thereto.
  • m is the unit step size of the frequency hopping, and m can be determined according to the number K of frequency hopping frequency domain resources and the maximum number of transmissions N of the first data, for example, Floor represents a rounding down operation.
  • Pattern is a corresponding table of predefined transmission times and frequency hopping offsets, as shown in Table 1.
  • m in Table 1 may be the frequency hopping step size in definition 310, or may be other values.
  • RandomFunction represents a random function. RandomFunction can directly adopt a random sequence in the LTE system, that is, a Gold sequence of length 31, or other random sequences.
  • the initialization function Cinit of the random function may adopt any one of the following parameters: a cell identifier, a UE identifier, a virtual UE identifier, or a parameter of a high layer signaling configuration, where the virtual UE identifier may also be configured by higher layer signaling.
  • the transmitting end determines g(n) according to the random cumulative hopping step size, C(K) represents a random function associated with K, m represents a frequency hopping unit step size, mod represents a modulo operation, and the rest of the application
  • C(K) represents a random function associated with K
  • m represents a frequency hopping unit step size
  • mod represents a modulo operation
  • the transmitting end determines g(n) based on the random frequency hopping step size.
  • F is the rule that combines the predefined mapping with the random function.
  • the user-specific non-negative integer may also be a non-negative integer configured by the higher layer signaling, or may be a variable related to at least one parameter of time, user identification code, or higher layer signaling.
  • g(n, t) can be defined by the following method, but the definition of g(n, t) in the present application is not limited thereto.
  • Pattern is a corresponding table of predefined transmission times and frequency hopping offsets, as shown in Table 2.
  • n in Table 2 may be a unit step size of frequency hopping, for example, Floor means rounding down, m can be other values.
  • g(n, t) Pattern(n, s(t) mod K
  • Pattern is a predefined number of transmissions
  • Table 3 The corresponding table with the frequency hopping offset is shown in Table 3.
  • j s(t)
  • m can be the unit step size of frequency hopping, for example, Floor means rounding down, m can be other values.
  • RandomFunction represents a random function. RandomFunction can directly adopt a random sequence in the LTE system, that is, a Gold sequence of length 31, or other random sequences.
  • the initialization function Cinit of the random function may adopt any one of the following parameters: a cell identifier, a UE identifier, a virtual UE identifier, or a parameter of a high layer signaling configuration, where the virtual UE identifier may also be configured by higher layer signaling.
  • F is the rule that combines the predefined mapping with the random function.
  • the exclusive non-negative integer may also be a non-negative integer configured by the higher layer signaling, or may be a variable related to at least one of time, user identification code or higher layer signaling.
  • g(n, j) can be defined by the following method, but the definition of g(n, j) in the present application is not limited to this.
  • Pattern is a correspondence table of predefined transmission times and frequency hopping offsets, as shown in Table 4.
  • n in Table 4 may be a unit step size of frequency hopping, for example, Floor means rounding down, m can be other values.
  • g(n,j) Pattern(n,s(j)) mod K
  • C init j
  • Pattern is the predefined number of transmissions and frequency hopping.
  • Table 5 The corresponding table of the shift amount is shown in Table 5.
  • w s(j)
  • m can be the unit step size of frequency hopping, for example, Floor means rounding down, m can be other values.
  • RandomFunction represents a random function. RandomFunction can directly adopt a random sequence in the LTE system, that is, a Gold sequence of length 31, or other random sequences.
  • the initialization function Cinit of the random function may adopt any one of the following parameters: a cell identifier, a UE identifier, a virtual UE identifier, or a parameter of a high layer signaling configuration, where the virtual UE identifier may also be configured by higher layer signaling.
  • J is the value range of j, taking the LTE system as an example.
  • J is the value range of j, taking the LTE system as an example.
  • F is the rule that combines the predefined mapping with the random function.
  • g(n, j) (Pattern(n, j), RandomFunction(n, j)) mod K.
  • the starting position of the resource, t is a time parameter, for example, the time unit currently used for transmitting data, g(n, j, t) is a function related to the number n of transmissions of the first information block, the parameter j, and the time parameter t.
  • G_init is a frequency domain reference position, and g_init may be a user-specific non-negative integer, or may be a non-negative integer configured by high-level signaling, or may be related to at least one parameter of time, user identifier, or higher layer signaling. variable.
  • g(n, j, t) can be defined by the following method, but the definition of g(n, j, t) in the present application is not limited thereto.
  • Pattern is a correspondence table of predefined transmission times and frequency hopping offsets, as shown in Table 6.
  • n in Table 6 may be a unit step size of frequency hopping, for example, Floor means rounding down, m can be other values.
  • g(n, j, t) (Pattern(n, s(j)) + t) mod K
  • C init h(j)
  • Pattern is a corresponding table of predefined transmission times and frequency hopping offsets, as shown in Table 7.
  • w s(j)
  • m can be the unit step size of frequency hopping, for example, Floor means rounding down, m can be other values.
  • RandomFunction represents a random function. RandomFunction can directly adopt a random sequence in the LTE system, that is, a Gold sequence of length 31, or other random sequences.
  • the initialization function Cinit of the random function may adopt any one of the following parameters: a cell identifier, a UE identifier, a virtual UE identifier, or a parameter of a high layer signaling configuration, where the virtual UE identifier may also be configured by higher layer signaling.
  • F denotes a rule combining a predefined mapping and a random function
  • Pattern(n, j, t) is the same as the definition 621
  • RandomFunction(n, j, t) is the same as definition 631, definition 632 or definition 633.
  • the initialization function of C(K) is configured by higher layer signaling or determined according to the terminal device identity.
  • the foregoing method is described as an example in which the first resource is a frequency domain resource or the first resource is a time-frequency resource.
  • the present application is not limited thereto, and the first resource is a code domain resource, and the same applies to the foregoing formula.
  • FIG. 3 is a schematic flowchart of a method for receiving data provided by the present application.
  • Method 700 includes:
  • the receiving end receives the first data by using the first resource.
  • the receiving end determines a first parameter n according to the first resource, where n represents a number of transmissions of the first information block, and the first information block is obtained after the first data is processed, n is greater than or equal to zero.
  • the first resource is included in K pre-configured resources, and the K is an integer greater than 1.
  • the receiving end may be the terminal device shown in FIG. 1, or may be the network device shown in FIG. 1, and may also be other devices, for example, the terminal device in the M2M communication system.
  • the receiving end detects the data by using a blind detection method when receiving the data for the first time, and when the receiving end blindly detects the first data on the first resource, the corresponding end may correspond to the order of sending the data by the sending end.
  • the relationship determines the resources used in the next transmission of the first information block.
  • the receiving end receives the second data on the second frequency domain resource before receiving the first data, and the receiving end may determine the next receiving according to the correspondence between the data sending times of the sending end and the frequency domain resource.
  • the frequency domain resource of the data ie, the first frequency domain resource
  • the receiving end determines the number of transmissions of the first information block according to the first resource as the inverse process of the first resource by the transmitting end according to the number of transmissions of the first information block.
  • the foregoing method 700 For the specific working process of the receiving end, refer to the corresponding process of the sending end in the foregoing method 200, and no further details are provided herein.
  • the receiving end determines, according to the correspondence between the resource used by the received data and the transmission order, that the currently received data is the data transmitted for the first time, and the data received by the receiving end is not the first transmission.
  • the data can be combined and decoded with the previously received data, thereby improving the reliability of data transmission.
  • the K pre-configured resources have different resource start locations.
  • the K pre-configured resources are unscheduled resources.
  • the resources used for the unscheduled transmission are different from those used for the scheduled transmission, so that the collision problem when different devices transmit data using the two transmission modes can be avoided.
  • the first resource is a resource that is uniquely corresponding to the n among the K resources.
  • the receiving end may determine that the first data is the data of the first transmission of the first information block according to the first resource used for receiving the first data.
  • the number of transmissions of the first information block is in one-to-one correspondence with at least one of the K resources.
  • the receiving end may determine the number of transmissions of the first information block according to the first resource used to receive the first data.
  • the receiving end determines the first parameter n according to the first resource, including:
  • the receiving end determines the n according to at least one of the first resource and the following parameters.
  • the reference location is used to indicate a resource used when the first information block is first transmitted, and the first time unit t 1 is a time unit used by the sending end to send the first data, and the parameter j is used for Identify the sender.
  • the frequency domain reference location is used by the transmitting end to determine the first frequency domain resource, where the frequency domain reference location may be the starting location of the frequency domain resource used when the first data is first sent, and also It can be a frequency domain location that is independent of the number of transmissions.
  • t 1 may be a symbol sequence number, a slot number, a microslot number, or a subframe number of the first time unit.
  • the specific form of the first time unit is not limited in this application.
  • the parameter j is used to identify the sender.
  • the parameter j can be a parameter of a subscriber identity or a high layer signaling configuration.
  • the receiving end determines the correspondence between the first resource and the number of transmissions according to the foregoing parameters, so that the manner of frequency hopping communication can be flexibly selected according to actual conditions.
  • the receiving end determines the first parameter n according to the first resource, including:
  • the receiving end determines the n according to the first resource and a randomization function. or,
  • the receiving end determines the n according to the first resource and a predefined rule. or,
  • the receiving end determines the n according to the first resource, a randomization function, and a predefined rule.
  • the transmitting end and the receiving end can flexibly select the manner of frequency hopping communication according to actual conditions.
  • the method 700 further includes:
  • the receiving end determines an initialization function of the randomization function according to the high layer signaling or the identifier information of the sending end.
  • the base station may determine an initialization function of the randomization function according to the identifier of the terminal device, thereby avoiding the situation that the frequency hopping pattern of the frequency hopping user in the same cell is consistent, thereby avoiding Collisions between different frequency hopping users in the same cell.
  • the terminal device may determine an initialization function of the randomization function according to the identifier of the terminal device or high layer signaling, thereby avoiding a frequency hopping pattern of the frequency hopping user in the same cell. Consistent, so that collisions between different frequency hopping users in the same cell can be avoided.
  • the method 700 further includes:
  • the receiving end determines, according to the K, a redundancy version set of the first data, where the redundancy version includes a number M of redundancy versions that is less than or equal to the K, where the M is positive. Integer.
  • the receiving end may determine the number of redundancy versions in the redundancy version set of the first data according to K, so that the redundancy version set may be flexibly determined such that the number of redundancy versions is less than or equal to the number of available resources, and the receiving end is for each transmission.
  • the data needs to be detected using only one redundancy version, which reduces the complexity of blind detection at the receiving end.
  • any one of the redundancy versions of the first data corresponds to at least one transmission.
  • the receiving end may directly determine a redundancy version set of the first data, where the redundancy version set may be determined by the receiving end according to a communication protocol, when the number M of the redundancy versions in the redundancy version set is less than the quantity K of available resources, A redundancy version may correspond to one or more transmissions; when M is equal to K, the redundancy version corresponds to the number of transmissions; when M is greater than K, one or more redundancy versions correspond to one transmission.
  • the receiving end does not need to determine the redundancy version set according to the number of available resources, which reduces the complexity of sending data at the transmitting end.
  • K 1.
  • the transmitting end and the receiving end include corresponding hardware structures and/or software modules for performing respective functions.
  • the present application can be implemented in a combination of hardware or hardware and computer software in combination with the elements and algorithm steps of the various examples described in the embodiments disclosed herein. Whether a function is implemented in hardware or computer software to drive hardware depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods to implement the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present application.
  • the present application may divide a functional unit by a transmitting end or the like according to the above method example.
  • each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit. It should be noted that the division of the unit in the present application is schematic, and is only a logical function division, and the actual implementation may have another division manner.
  • FIG. 4 shows a possible structural diagram of the transmitting end involved in the above embodiment.
  • the transmitting end 400 includes a processing unit 402 and a communication unit 403.
  • the processing unit 402 is configured to control and manage the actions of the transmitting end 400.
  • the processing unit 402 is configured to support the transmitting end 400 to perform S210 of FIG. 2 and/or other processes for the techniques described herein.
  • the communication unit 403 is configured to support communication between the transmitting end 400 and other network entities, such as communication with the receiving end.
  • the transmitting end 400 may further include a storage unit 401 for storing program codes and data of the transmitting end 400.
  • the processing unit 402 may be a processor or a controller, for example, may be a central processing unit (CPU), a general-purpose processor, a digital signal processor (DSP), and an application-specific integrated circuit (application-specific). Integrated circuit (ASIC), field programmable gate array (FPGA) or other programmable logic device, transistor logic device, hardware component, or any combination thereof. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the present disclosure.
  • the processor may also be a combination of computing functions, for example, including one or more microprocessor combinations, a combination of a DSP and a microprocessor, and the like.
  • the communication unit 403 may be a transceiver, a transceiver circuit, or the like.
  • the storage unit 401 can be a memory.
  • the transmitting end 400 of the present application determines the frequency hopping frequency domain resource from the plurality of frequency domain resources according to the correspondence between the sending order of the data to be sent and the frequency domain resource, and sends the data to be sent to the receiving end by using the frequency hopping frequency domain resource.
  • the receiving end detects data on the frequency hopping frequency domain resource, and determines the transmission order of the received data according to the foregoing correspondence relationship.
  • the received data may be compared with the previous The received data is combined and decoded, thereby improving the reliability of data transmission.
  • the processing unit 402 is a processor
  • the communication unit 403 is a transceiver
  • the storage unit 401 is a memory
  • the transmitting end of the present application may be the transmitting end shown in FIG. 5.
  • the transmitting end 500 includes a processor 502, a transceiver 503, and a memory 501.
  • the transceiver 503, the processor 502, and the memory 501 can communicate with each other through an internal connection path to transfer control and/or data signals.
  • the transmitting end 500 of the present application determines the frequency hopping frequency domain resource from the plurality of frequency domain resources according to the correspondence between the sending order of the data to be sent and the frequency domain resource, and sends the data to be sent to the receiving end by using the frequency hopping frequency domain resource.
  • the receiving end detects data on the frequency hopping frequency domain resource, and determines the transmission order of the received data according to the foregoing correspondence relationship.
  • the received data may be compared with the previous The received data is combined and decoded, thereby improving the reliability of data transmission.
  • FIG. 6 shows a possible structural diagram of the receiving end involved in the above embodiment.
  • the receiving end 600 includes a processing unit 602 and a communication unit 603.
  • the processing unit 602 is configured to control and manage the actions of the receiving end 600.
  • the processing unit 602 is configured to support the receiving end 600 to perform S320 of FIG. 3 and/or other processes for the techniques described herein.
  • the communication unit 603 is configured to support communication between the receiving end 600 and other network entities, such as communication with the transmitting end.
  • the receiving end 600 may further include a storage unit 601 for storing program codes and data of the receiving end 600.
  • the processing unit 602 can be a processor or a controller, such as a CPU, a general purpose processor, a DSP, an ASIC, an FPGA or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. It is possible to implement or carry out the various illustrative logical blocks, modules and circuits described in connection with the present disclosure.
  • the processor may also be a combination of computing functions, for example, including one or more microprocessor combinations, a combination of a DSP and a microprocessor, and the like.
  • the communication unit 603 can be a transceiver, a transceiver circuit, or the like.
  • the storage unit 601 can be a memory.
  • the receiving end 600 of the data transmission provided by the present application determines, according to the correspondence between the frequency domain resource used in the received data and the transmission order, that the currently received data is the data transmitted for the first time, and the data received by the receiving end is not the first transmission.
  • the data can be combined and decoded with the previously received data, thereby improving the reliability of data transmission.
  • the processing unit 602 is a processor
  • the communication unit 603 is a transceiver
  • the storage unit 601 is a memory
  • the receiving end of the present application may be the receiving end shown in FIG. 7.
  • the receiving end 700 includes a processor 702, a transceiver 703, and a memory 701.
  • the transceiver 703, the processor 702, and the memory 701 can communicate with each other through an internal connection path to transfer control and/or data signals.
  • the receiving end 700 of the data transmission provided by the present application determines, according to the correspondence between the frequency domain resource used by the received data and the transmission order, that the currently received data is the data transmitted for the first time, and the data received by the receiving end is not the first transmission.
  • the data can be combined and decoded with the previously received data, thereby improving the reliability of data transmission.
  • the size of the sequence number of each process does not mean the order of execution sequence, and the order of execution of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the present application.
  • the steps of a method or algorithm described in connection with the present disclosure may be implemented in a hardware or may be implemented by a processor executing software instructions.
  • the software instructions may be composed of corresponding software modules, which may be stored in a random access memory (RAM), a flash memory, a read only memory (ROM), an erasable programmable read only memory ( Erasable programmable ROM (EPROM), electrically erasable programmable read only memory (EEPROM), registers, hard disk, removable hard disk, compact disk read only (CD-ROM) or any other form of storage medium known in the art.
  • An exemplary storage medium is coupled to the processor to enable the processor to read information from, and write information to, the storage medium.
  • the storage medium can also be an integral part of the processor.
  • the processor and the storage medium can be located in an ASIC. Additionally, the ASIC can be located in the terminal device.
  • the processor and the storage medium can also exist as discrete components in the transmitting end and the receiving end.
  • the computer program product includes one or more computer instructions.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in or transmitted by a computer readable storage medium.
  • the computer instructions can be from a website site, computer, server or data center to another website site by wire (eg, coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (eg, infrared, wireless, microwave, etc.) Transfer from a computer, server, or data center.
  • the computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media.
  • the usable medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (such as a solid state disk (SSD)) or the like.

Abstract

本申请公开了一种发送数据的方法，该方法包括：发送端根据第一参数n确定第一资源，所述n表示第一信息块的传输次数，所述第一资源用于所述第一信息块的当前传输，所述n大于或等于0；所述发送端通过所述第一资源传输第一数据，所述第一数据为所述第一信息块经过处理后得到的用于当前传输的数据；其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数。根据本申请提供的发送数据的方法，接收端可以确定接收到的数据的传输次序，并将当前接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。

Description

发送数据的方法和装置，以及接收数据的方法和装置
本申请要求于2017年03月24日提交中国专利局、申请号为201710184294.1、申请名称为“发送数据的方法和装置，以及接收数据的方法和装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及无线通信领域，尤其涉及一种发送数据的方法和装置，以及一种接收数据的方法和装置。
背景技术
跳频是一种可以提高通信系统的抗干扰能力的通信方式，通信设备在采用跳频方式进行通信时，载波频率按照某种序列进行跳变。例如，发送端对信息比特进行调制后生成基带信号，然后进行载波调制，载波频率在跳频序列的控制下改变频率，进而通过天线发送至接收端，接收端根据跳频同步信号和跳频序列确定接收频率，对相应的跳频信号进行接收解调。
第五代(5th-Generation，5G)通信系统提出了支持超高可靠性与超低时延(ultra reliable&low latency communication，URLLC)业务的要求，在URLLC场景中，一般要求无线空口的传输时延在1ms以内且达到99.999％的传输可靠性，现有的跳频技术不能满足5G通信系统对数据传输的可靠性的要求。
发明内容
本申请提出了一种发送数据的方法和装置，以及一种接收数据的方法和装置，能够提高跳频传输的可靠性。
一方面，提供了一种发送数据的方法，该方法包括：发送端根据第一参数n确定第一资源，所述n表示第一信息块的传输次数，所述第一资源用于所述第一信息块的当前传输，所述n大于或等于0；所述发送端通过所述第一资源传输第一数据，所述第一数据为所述第一信息块经过处理后得到的用于当前传输的数据；其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数。
本申请提供的发送数据的方法，发送端根据待发送数据的传输次数与资源的对应关系从多个资源中确定第一资源，并通过该第一资源向接收端发送该待发送数据，接收端在该第一资源上检测数据，并根据上述对应关系确定接收到的数据的传输次序，当接收端接收到的数据为非首次传输的数据时，可以将当前接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。
可选地，所述K个预先配置的资源具有不同的资源起始位置。
可选地，所述K个预先配置的资源是免调度资源。
根据本申请提供的发送数据的方法，免调度传输使用的资源与基于调度传输使用的资源不同，从而，可以避免不同设备在使用两种传输模式发送数据时的碰撞问题。
可选地，所述第一资源是所述K个资源中与所述n唯一对应的资源。
从而，接收端可以根据接收第一数据使用的第一资源确定第一数据是第一信息块的第几次传输的数据。
可选地，所述第一信息块的传输次数与所述K个资源中的至少一个资源一一对应。
从而，接收端可以根据接收第一数据使用的第一资源确定第一信息块的传输次数。
可选地，所述发送端根据第一参数n确定第一资源，包括：
所述发送端根据所述n以及下列参数中的至少一个参数确定所述第一资源，
参考位置，第一时间单元t 1，第二参数j，
其中，所述参考位置用于指示所述第一信息块首次传输时使用的资源，所述第一时间单元t 1为所述发送端传输所述第一数据使用的时间单元，所述j用于标识所述发送端。
从而，发送端可以根据实际情况灵活选择跳频通信的方式。
可选地，所述参考位置为预设在所述发送端中的信息。
例如，该参考位置可以是通信协议规定的，从而，发送端无需和接收端进行信息交互即可确定参考位置，减小了数据传输的时延。
可选地，所述发送端根据第一参数n确定第一资源，包括：所述发送端根据所述n和随机化函数确定所述第一资源；或者，所述发送端根据所述n和预定义规则确定所述第一资源；或者，所述发送端根据所述n、随机化函数和预定义规则确定所述第一资源。
从而，发送端可以根据实际情况灵活选择跳频通信的方式。
可选地，所述方法还包括：所述发送端根据高层信令或者所述发送端的标识信息确定所述随机化函数的初始化函数。
从而可以避免位于同一个小区的不同跳频用户之间的碰撞。
可选地，所述方法还包括：所述发送端根据所述K确定所述第一数据的冗余版本集合，其中，所述冗余版本集合包括的冗余版本的数量M小于或等于所述K，所述M为正整数。
发送端可以根据K确定第一数据的冗余版本集合中冗余版本的数量，从而可以灵活确定冗余版本集合，使得冗余版本的数量小于或等于可用资源的数量，接收端对于每个接收的数据仅需使用一个冗余版本进行检测，减小了接收端盲检测的复杂度。
可选地，所述第一数据的任意一个冗余版本对应所述第一信息块的至少一次传输。
发送端无需根据K个资源即可确定冗余版本集合，减小了发送端发送数据的复杂度。
可选地，所述K等于1。
另一方面，提供了一种接收数据的方法，该方法包括：接收端通过第一资源接收第一数据；所述接收端根据所述第一资源确定第一参数n，所述n表示第一信息块的传输次数，所述第一信息块是所述第一数据经过处理后得到的，所述n大于或等于0；其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数。
本申请提供的接收数据的方法，接收端根据接收数据使用的资源与传输次序的对应关系确定当前接收到的数据为第几次传输的数据，当接收端接收到的数据为非首次传输的数据时，可以将接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。
可选地，所述K个预先配置的资源具有不同的资源起始位置。
可选地，所述K个预先配置的资源是免调度资源。
根据本申请提供的发送数据的方法，免调度传输使用的资源与基于调度传输使用的资源不同，从而，可以避免不同设备在使用两种传输模式发送数据时的碰撞问题。
可选地，所述第一资源是所述K个资源中与所述n唯一对应的资源。
从而，接收端可以根据接收第一数据使用的第一资源确定第一数据是第一信息块的第几次传输的数据。
可选地，所述第一信息块的传输次数与所述K个资源中的至少一个资源一一对应。
从而，接收端可以根据接收第一数据使用的第一资源确定第一信息块的传输次数。
可选地，所述接收端根据所述第一资源确定第一参数n，包括：
所述接收端根据所述第一资源以及下列参数中的至少一个参数确定所述n，
参考位置，第一时间单元t 1，第二参数j，
其中，所述参考位置用于指示所述第一信息块首次传输时使用的资源，所述第一时间单元t 1为发送端发送所述第一数据使用的时间单元，所述j用于标识所述发送端。
接收端根据上述参数确定第一资源与传输次数之间的对应关系，从而，可以根据实际情况灵活选择跳频通信的方式。
可选地，所述接收端根据所述第一资源确定第一参数n，包括：所述接收端根据所述第一资源和随机化函数确定所述n；或者，所述接收端根据所述第一资源和预定义规则确定所述n；或者，所述接收端根据所述第一资源、随机化函数和预定义规则确定所述n。
从而，发送端和接收端可以根据实际情况灵活选择跳频通信的方式。
可选地，所述方法还包括：所述接收端根据高层信令或者发送端的标识信息确定所述随机化函数的初始化函数。
从而可以避免位于同一个小区的不同跳频用户之间的碰撞。
可选地，所述方法还包括：所述接收端根据所述K确定所述第一数据的冗余版本集合，其中，所述冗余版本集合包括的冗余版本的数量M小于或等于所述K，所述M为正整数。
接收端可以根据K确定第一数据的冗余版本集合中冗余版本的数量，从而可以灵活确定冗余版本集合，使得冗余版本的数量小于或等于可用资源的数量，接收端对于每次接收的数据仅需使用一个冗余版本进行检测，减小了接收端盲检测的复杂度。
可选地，所述第一数据的任意一个冗余版本对应所述第一信息块的至少一次传输。
接收端无需根据可用频资源的数量即可确定冗余版本集合，减小了发送端发送数据的复杂度。
可选地，所述K等于1。
再一方面，本申请提供了一种发送数据的装置，该装置可以实现上述方面所涉及方法中发送端所执行的功能，所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个上述功能相应的单元或模块。
在一种可能的设计中，该装置的结构中包括处理器和收发器，该处理器被配置为支持该装置执行上述方法中相应的功能。该收发器用于支持该装置与其它网元之间的通信。该装置还可以包括存储器，该存储器用于与处理器耦合，其保存该装置必要的程序指令和数据。
再一方面，本申请提供了一种接收数据的装置，该装置可以实现上述方面所涉及方法中接收端所执行的功能，所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个上述功能相应的单元或模块。
在一种可能的设计中，该装置的结构中包括处理器和收发器，该处理器被配置为支持该装置执行上述方法中相应的功能。该收发器用于支持该装置与其它网元之间的通信。该装置还可以包括存储器，该存储器用于与处理器耦合，其保存该装置必要的程序指令和数据。
再一方面，提供了一种网络系统，所述网络系统包括上述各个方面所述的发送数据的装置和接收数据的装置。
再一方面，提供了一种计算机程序产品，所述计算机程序产品包括：计算机程序代码，当所述计算机程序代码被发送端的通信单元、处理单元或收发器、处理器运行时，使得终端设备执行上述实现方式中的方法。
再一方面，提供了一种计算机程序产品，所述计算机程序产品包括：计算机程序代码，当所述计算机程序代码被接收端的通信单元、处理单元或收发器、处理器运行时，使得接入网设备执行上述实现方式中的方法。
再一方面，本申请提供了一种计算机存储介质，用于储存为上述发送端所用的计算机软件指令，其包含用于执行上述方面所设计的程序。
再一方面，本申请提供了一种计算机存储介质，用于储存为上述接收端所用的计算机软件指令，其包含用于执行上述方面所设计的程序。
附图说明
图1是适用本申请的通信系统的示意性架构图；
图2是本申请提供的一种发送数据的方法的示意性流程图；
图3是本申请提供的一种接收数据的方法的示意性流程图；
图4是本申请提供的一种可能的发送端的结构示意图；
图5是本申请提供的另一种可能的发送端的结构示意图；
图6是本申请提供的一种可能的接收端的结构示意图；
图7是本申请提供的另一种可能的接收端的结构示意图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
图1示出了一种适用本申请的通信系统100。该通信系统100包括网络设备110和终端设备120，网络设备110与终端设备120通过无线网络进行通信，当终端设备120发送数据时，无线通信模块可对信息进行编码以用于传输，具体地，无线通信模块可获取要通过信道发送至网络设备110的一定数目的数据比特，这些数据比特例如是处理模块生成的、从其它设备接收的或者在存储模块中保存的数据比特。这些数据比特可包含在一个或多个传输块(也可称为信息块或数据块)中，传输块可被分段以产生多个编码块。
在本申请中，终端设备可称为接入终端、用户设备(user equipment，UE)、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通 信设备、用户代理或用户装置。接入终端可以是蜂窝电话、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备以及5G通信系统中的用户设备。
网络设备可以是码分多址(code division multiple access，CDMA)系统中的基站(base transceiver station，BTS)，也可以是宽带码分多址(wideband code division multiple access，WCDMA)系统中的基站(node B，NB)，还可以是长期演进(long term evolution，LTE)系统中的演进型基站(evolutional node B，eNB)，还可以是5G通信系统中的基站(gNB)，上述基站仅是举例说明，网络设备还可以为中继站、接入点、车载设备、可穿戴设备以及其它类型的设备。
上述适用本申请的通信系统仅是举例说明，适用本申请的通信系统不限于此，例如，通信系统中包括的网络设备和终端设备的数量还可以是其它的数量。
为了方便理解本申请，下面，对本申请可能涉及的概念做详细介绍。
免调度传输可以理解为如下含义的任意一种含义，或，多种含义，或者多种含义中的部分技术特征的组合或其他类似含义：
免调度传输可以指：网络设备预先分配并告知终端设备多个传输资源；终端设备有上行数据传输需求时，从网络设备预先分配的多个传输资源中选择至少一个传输资源，使用所选择的传输资源发送上行数据；网络设备在所述预先分配的多个传输资源中的一个或多个传输资源上检测终端设备发送的上行数据。所述检测可以是盲检测，也可能根据所述上行数据中某一个控制域进行检测，或者是其他方式进行检测。
免调度传输可以指：网络设备预先分配并告知终端设备多个传输资源，以使终端设备有上行数据传输需求时，从网络设备预先分配的多个传输资源中选择至少一个传输资源，使用所选择的传输资源发送上行数据。
免调度传输可以指：获取预先分配的多个传输资源的信息，在有上行数据传输需求时，从所述多个传输资源中选择至少一个传输资源，使用所选择的传输资源发送上行数据。获取的方式可以从网络设备获取。
免调度传输可以指：不需要网络设备动态调度即可实现终端设备的上行数据传输的方法，所述动态调度可以是指网络设备为终端设备的每次上行数据传输通过信令来指示传输资源的一种调度方式。可选地，实现终端设备的上行数据传输可以理解为允许两个或两个以上终端设备的数据在相同的时频资源上进行上行数据传输。可选地，所述传输资源可以是终端设备接收所述的信令的时刻以后的一个或多个传输时间单元的传输资源。一个传输时间单元可以是指一次传输的最小时间单元，比如传输时间间隔(transmission time interval，TTI)。
免调度传输可以指：终端设备在不需要网络设备调度的情况下进行上行数据传输。所述调度可以指终端设备发送上行调度请求给网络设备，网络设备接收调度请求后，向终端设备发送上行许可，其中所述上行许可指示分配给终端设备的上行传输资源。
免调度传输可以指：一种竞争传输方式，具体地可以指多个终端在预先分配的相同的时频资源上同时进行上行数据传输，而无需基站进行调度。
所述的数据可以为业务数据或者信令数据。
所述盲检测可以理解为在不预知是否有数据到达的情况下，对可能到达的数据进行的 检测。所述盲检测也可以理解为没有显式的信令指示下的检测。
在本申请中，免调度传输的基本时间单元可以是一个TTI(例如，包括短传输时间间隔(short transmission time interval，sTTI))。当引入sTTI技术后，免调度传输可以包括在TTI长度为1毫秒(ms)或TTI长度小于1ms的下行数据信道接收或上行数据信道发送。
在本申请中，网络设备和终端设备用于传输信息的时频资源可以是基于竞争机制使用的时频资源，也可以是基于非竞争机制使用的时频资源，其中，对于基于竞争机制使用的时频资源，终端设备可以检测某一时频资源当前是否处于空闲状态，或者说，该时频资源是否被其他设备使用，若该时频资源处于空闲状态，或者说，该时频资源未被其他设备使用，则终端设备可以使用该时频资源进行通信，例如，进行上行传输等；若该时频资源不处于空闲状态，或者说，该时频资源已被其他设备使用，则终端设备无法使用该时频资源。需要说明的是，在本申请中，上述竞争机制的具体方法和过程可以与现有技术相似，这里，为了避免赘述，省略其详细说明。
在本申请中，通信系统100所使用的时频资源(或者说，网络设备和终端设备基于竞争机制使用的时频资源)可以是许可时频资源，也可以是免许可时频资源，本申请对此不做限定。在本申请中，通信系统100中的各通信设备(例如，网络设备或终端设备)可以基于免调度传输方案使用时频资源进行通信，也可以基于调度方式使用时频资源进行通信，本申请对此不做限定。
在本申请中，网络设备和终端设备用于传输信息的资源在时域上可以划分为多个时间单元，并且，该多个时间单元可以是连续的，也可以是某些相邻的时间单元之间设有预设的间隔，本申请对此不做限定。
在本申请中，一个时间单元的长度可以任意设定，本申请对此不做限定。
例如，1个时间单元可以包括一个或多个子帧。
或者，1个时间单元可以包括一个或多个时隙(slot)或微时隙(mini-slot)。
或者，1个时间单元可以包括一个或多个时域符号。
或者，1个时间单元可以包括一个或多个TTI或sTTI。
或者，1个时间单元的长度为1ms。
或者，1个时间单元的长度小于1ms。
其中，TTI是现有通信系统中普遍使用的时间参数，是通信系统中调度数据的时间单位。在LTE系统中，1个TTI的时间长度为1ms，对应一个子帧(sub-frame)的时间长度，也就是两个时隙的时间长度。
在本申请中，数据的传输可以是基于网络设备调度的，调度的基本时间单元是一个或多个最小的时间调度单元，其中，最小的时间调度单元可以是上述的TTI，也可以是上述的sTTI。具体的调度流程是基站发送控制信道，例如，物理下行控制信道(physical downlink control channel，PDCCH)或增强物理下行控制信道(enhanced physical downlink control channel，EPDCCH)或用于调度sTTI传输的物理下行控制信道(sTTI physical downlink control channel，sPDCCH)，该控制信道可以承载使用不同的下行控制信息(downlink control information，DCI)格式的用于调度物理下行共享信道(physical downlink shared channel，PDSCH)或物理上行共享信道(physical uplink shared channel，PUSCH)的调度 信息，该调度信息包括资源分配信息，调制编码方式等控制信息。终端设备检测控制信道，并根据检测出的控制信道中承载的调度信息来进行下行数据信道的接收或上行数据信道的发送。
本申请对通信系统100所使用的频谱资源不做限定，可以是授权频谱，也可以是非授权频谱，或其它共享频谱。
上文详细介绍了本申请可能涉及的概念，下面，将结合附图详细描述本申请提供的数据传输的方法和装置。
图2是本申请提供的一种发送数据的方法的示意性流程图。该方法200包括：
S210，发送端根据第一参数n确定第一资源，所述n表示第一信息块的传输次数，所述第一资源用于所述第一信息块的当前传输，所述n大于或等于0。
S220，所述发送端通过所述第一资源传输第一数据，所述第一数据为所述第一信息块经过处理后得到的用于当前传输的数据。
其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数.
方法200中，发送端可以是图1所示的终端设备，也可以是图1所示的网络设备，还可以其它设备，例如，机器与机器(Machine to Machine，M2M)通信系统中的终端设备。
在本申请中，第一信息块为发送端待发送的任意一个信息块，第一信息块可以是发送端生成的，也可以是发送端从其它设备获取的，还可以是发送端存储的，本申请对此不作限定。第一数据为第一信息块经过处理(例如，编码调制和速率匹配)后生成的当前待传输的数据，发送端发送第一信息块时可以对整个第一信息块进行处理生成第一数据，也可以对部分第一信息块进行处理生成第一数据。此外，第一参数n可以表示当前传输是第n次传输，第一参数n也可以表示当前第一信息块已被传输了多少次。
本申请中，当前传输是指第一信息块的当前第n次传输(n的取值范围不包括0)或者当前第n+1次传输(n的取值范围包括0)，例如，n的取值范围不包括0时，即n大于或等于1时，当n表示第一信息块的当前传输次数为1时，第一资源用于第一信息块的第1次传输；或者，n的取值范围包括0时，即n大于或等于0时，当n表示第一信息块已被传输的次数为1时，第一资源用于第一信息块的第2次传输。
应理解，在本申请中，“当…时”、“若”以及“如果”均指在某种客观情况下设备会做出相应的处理，并非是限定时间，且也不要求设备实现时一定要有该判断的动作，也不意味着存在其它限定。
在S210中，所述K个资源中的至少一个资源与所述第一信息块的至少一次传输一一对应，例如，第一资源仅用于第一信息块的当前传输，从而，接收端能够根据接收第一数据使用的资源确定第一数据的至少一次传输的序号。第一资源可以包括一个资源，也可以包括多个资源。
本申请中，K个预先配置的资源可以是频域资源，也可以是时频资源，也可以是码域资源。预先配置可以指协议规定，也可以指接入网设备通过信令配置。
当K个资源为频域资源时，第一信息块的传输次数与K个频域资源中至少一个频域的对应关系包括以下三种情况。
情况1，数据传输次数与K个频域资源中的频域资源一一对应。
例如，K个频域资源包括第一频域资源和第二频域资源，当n等于1时，第一数据可 以映射在第一频域资源上；当n等于2时，第一数据可以映射在第二频域资源上。从而，接收端可以根据接收到第一数据的频域资源的编号或者索引确定第一数据的传输次序，进而可以与之前接收到的数据进行合并解码，提高了数据传输的成功率并且减小了数据传输的时延。
情况2，数据传输次数与K个频域资源中的多个频域资源之间存在一对多的对应关系。
例如，K个频域资源包括第一频域资源、第二频域资源、第三频域资源和第四频域资源，当n等于1时，第一数据可以映射在第一频域资源上，也可以映射在第二频域资源上；当n等于2时，第一数据可以映射在第三频域资源上，也可以映射在第四频域资源上。从而，发送端可以根据实际情况选择可靠性较高的频域资源发送数据，提高了数据传输的成功率并且减小了数据传输的时延。
情况3，数据传输次数与K个频域资源中的任意一个频域资源存在多对一的对应关系。
例如，K个频域资源包括第一频域资源和第二频域资源，当n等于1和2时，第一数据可以映射在第一频域资源上；当n等于3和4时，第一数据可以映射在第二频域资源上。从而，发送端可以充分利用现有的频域资源跳频发送数据。
对于情况3，接收端无法识别第一频域资源具体对应哪次传输，接收端可以按照小n值原则进行数据合并。例如，当接收端在第一频域资源上检测到数据时，接收端一律按照该数据为第1次传输的数据进行解码，从而避免了数据合并错误。
上述情况仅是举例说明，实际上，数据发送次序与K个资源的对应关系可能是上述多种情况的集合。
例如，发送端和接收端约定第一信息块的首次传输使用第一资源，第一信息块的第2次传输使用第二资源或第三资源，随后的多次重传则使用第四资源，如果接收端接通过第一资源接收到第一数据，则确定第一数据为首次传输的数据；如果接收端通过第二资源或第三资源接收到第一数据，则确定第一数据为第二次传输的数据；如果接收端通过第四资源接收到第一数据，则可以按照上述小n值原则确定第一数据为第三次传输的数据。
上述对应关系可以是通信协议中约定的对应关系，发送端和接收端无需信息交互即可进行跳频通信；上述对应关系也可以发送端通过指示信息向接收端指示的对应关系，例如，网络设备通过信令或者系统信息指示终端设备上述对应关系，从而，发送端和接收端可以灵活进行跳变通信(不同传输次数使用不同的频域资源或者码域资源)，提高接收数据的分集增益。
在本申请中，当第一信息块的最大传输次数N小于或等于K时，n的取值范围为1至N；当N大于或等于K时，n的取值范围为1至K，其中，N为正整数。上述实施例仅是举例说明，本申请不限于此，n也可以从0开始计数，例如，当n＝0时，S210应被理解为：终端设备根据第一信息块的已被传输的次数为0确定使用首次传输对应的频域资源传输第一数据；当n＝1时，S210应被理解为：终端设备根据第一信息块的已被传输的次数为1确定使用第二次传输对应的频域资源传输第一数据。
此外，在本申请中，K个频域资源可以完全不重合，也可以部分重合，但该K个频域资源的起始位置互不相同。
本申请对发送端根据传输次数n从K个频域资源中确定第一频域资源的方法不作限定，例如，发送端可以根据n确定第一频域资源的起始位置，并根据带宽确定第一频域资 源，发送端也可以直接确定第一频域资源或者通过其它方式确定第一频域资源。
当K个资源为码域资源时，数据发送次序与K个码域资源的对应关系与上述数据发送次序与K个频域资源的对应关系类似。
例如，当数据发送次序与K个码域资源中的至少一个码域资源可以存在一一对应关系，也可以存在一对多的关系，还可以存在多对一的关系，其中，码域资源可以是第一数据传输时使用的导频序列，该K个码域资源之间互相伪正交或正交。
当K个资源为时频资源时，数据发送次序与K个资源的对应关系与时间和频率相关，数据发送次序与K个时频资源的对应关系与上述数据发送次序与K个频域资源的对应关系类似，具体可参见下述方法400和方法600对应的实施例。
综上，本申请提供的发送数据的方法，发送端根据待发送数据的发送次序与资源的对应关系从多个资源中确定第一资源，并通过该第一资源向接收端发送该待发送数据，接收端在该第一资源上检测数据，并根据上述对应关系确定接收到的数据的传输次序，当接收端接收到的数据为非首次传输的数据时，可以将当前接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。
可选地，所述K个预先配置的资源具有不同的资源起始位置。
可选地，所述K个预先配置的资源是免调度资源。
根据本申请提供的发送数据的方法，免调度传输使用的资源与基于调度(grant-based)传输使用的资源不同，从而，可以避免不同设备在使用两种传输模式发送数据时的碰撞问题。
可选地，所述第一资源是所述K个资源中与所述n唯一对应的资源。
从而，接收端可以根据接收第一数据使用的第一资源确定第一数据是第一信息块的第几次传输的数据。
可选地，所述第一信息块的传输次数与所述K个资源中的至少一个资源一一对应。
从而，接收端可以根据接收第一数据使用的第一资源确定第一信息块的传输次数。
可选地，所述发送端根据第一参数n确定第一资源，包括：
S211，所述发送端根据所述n以及下列参数中的至少一个参数确定所述第一资源，
参考位置，第一时间单元t 1，第二参数j，
其中，所述参考位置用于指示所述第一信息块首次传输时使用的资源，所述第一时间单元t 1为所述发送端传输所述第一数据使用的时间单元，所述j用于标识所述发送端。
以第一资源为频域资源为例，频域参考位置用于发送端确定第一频域资源，该频域参考位置可以是第一数据首次发送时使用的频域资源的起始位置，也可以是一个与传输次数无关的频域位置。t 1例如可以是第一时间单元的符号序号、时隙序号、微时隙序号或者子帧序号，本申请对第一时间单元的具体形式不作限定。参数j用于标识发送端，例如，参数j可以是用户识别码或者高层信令配置的参数。
从而，发送端可以根据实际情况灵活选择跳频通信的方式。
可选地，所述参考位置为预设在所述发送端中的信息。
例如，该参考位置可以是通信协议规定的，从而，发送端无需和接收端进行信息交互即可确定参考位置，减小了数据传输的时延。
可选地，所述发送端根据第一参数n确定第一资源，包括：
S212，所述发送端根据所述n和随机化函数确定所述第一资源。或者，
S213，所述发送端根据所述n和预定义规则确定所述第一资源。或者，
S214，所述发送端根据所述n、随机化函数和预定义规则确定所述第一资源。
从而，发送端可以根据实际情况灵活选择跳频通信的方式。
可选地，方法200还包括：
S230，所述发送端根据高层信令或者所述发送端的标识信息确定所述随机化函数的初始化函数。
作为一个可选的示例，当发送端为基站时，基站可以根据终端设备的标识确定随机化函数的初始化函数，避免了同一个小区内跳频用户的跳频图样保持一致的情况，从而可以避免位于同一个小区的不同跳频用户之间的碰撞。
作为另一个可选的示例，当发送端为终端设备时，终端设备可以根据该终端设备的标识或者高层信令确定随机化函数的初始化函数，避免了同一个小区内跳频用户的跳频图样保持一致的情况，从而可以避免位于同一个小区的不同跳频用户之间的碰撞。
可选地，方法200还包括：
S240，所述发送端根据所述K确定所述第一数据的冗余版本集合，其中，所述冗余版本集合包括的冗余版本的数量M小于或等于所述K，所述M为正整数。
发送端可以根据可用资源的数量(即，K)确定第一数据的冗余版本集合中冗余版本的数量，从而可以灵活确定冗余版本集合，使得冗余版本的数量小于或等于可用资源的数量，接收端对于每个接收的数据仅需使用一个冗余版本进行检测，减小了接收端盲检测的复杂度。
可选地，所述第一数据的任意一个冗余版本对应所述第一信息块的至少一次传输。
发送端也可以直接确定第一数据的冗余版本集合，该冗余版本集合例如可以是发送端根据通信协议确定的，当冗余版本集合中冗余版本的数量M小于跳频频域资源的数量K时，一个冗余版本可以与一次或多次传输对应；当M等于K时，冗余版本与传输次数一一对应；当M大于K时，一个或者多个冗余版本对应一次传输。
因此，发送端无需根据可用资源的数量即可确定冗余版本集合，减小了发送端发送数据的复杂度。
可选地，方法200中，K＝1。
当K＝1时，发送端仅有一个可用资源，每次传输都会使用相同的资源，发送端可以根据所述n直接确定第一资源，即，每次传输都使用同一个资源，K＝1适用于方法300至方法600中的公式。
下面将基于上文所述的本申请涉及的共性方面，对本申请进一步详细说明。
方法300：终端设备根据f＝g(n)+g_init确定第一频域资源的起始位置，并进一步确定第一频域资源，其中，f为第一频域资源的起始位置，g(n)为与第一信息块的传输次数n相关的函数，g_init为频域参考位置，g_init可以是一个用户专属的非负整数，也可以是高层信令配置的非负整数，还可以是与时间、用户识别码或高层信令中的至少一个参数相关的变量。
其中，g(n)可以采用如下方法定义，但本申请中g(n)的定义不限于此。
定义310：g(n)＝n*m，
其中，m为跳频的单位步长，可以根据跳频频域资源的数量K以及第一数据的最大传输次数N确定m，例如，
Figure PCTCN2018079874-appb-000001
floor表示向下取整运算。
定义320：g(n)＝Pattern(n)，Pattern为预定义的传输次数与跳频偏移量的对应表格，如表1所示。
表1
传输次数 1 2 3 4
跳频偏移量 0 m 2m 3m
表1中的m可以是定义310中的跳频步长，也可以是其它的数值。
定义330：g(n)＝RandomFunction(n)，
其中，RandomFunction表示随机函数。RandomFunction可以直接采用LTE系统中的随机序列，即，长度为31的Gold序列，也可以采用其它的随机序列。随机函数的初始化函数Cinit可以采用以下参数中的任意一种参数：小区标识、UE标识、虚拟UE标识或者高层信令配置的参数，其中，虚拟UE标识也可以是由高层信令配置。
定义331：
Figure PCTCN2018079874-appb-000002
在定义331中，发送端根据随机累计跳频步长确定g(n)，C(K)表示与K相关的随机函数，m表示跳频单位步长，mod表示取模运算，本申请其余的m与mod的含义与定义331中的含义相同，为了简洁，后续不再赘述。
定义332：
Figure PCTCN2018079874-appb-000003
在定义332中，发送端根据随机跳频步长确定g(n)。
定义333：
Figure PCTCN2018079874-appb-000004
在定义333中，发送端根据随机跳频步长和镜像映射确定g(n)，fm(n)＝n mod 2，或者fm(n)＝C(n)。
定义340：g(n)＝F(Pattern(n),RandomFunction(n))，或者，g(n)＝(Pattern(n)+RandomFunction(n))mod K，
其中，F表示预定义映射和随机函数结合的规则。
方法400：终端设备根据f＝g(n,t)+g_init确定第一频域资源的起始位置，并进一步确定第一频域资源，其中，f为第一频域资源的起始位置，t为时间参数，例如，当前发送数据使用的时间单元，g(n,t)为与第一信息块的传输次数n以及时间参数t相关的函数，g_init为频域参考位置，g_init可以是一个用户专属的非负整数，也可以是高层信令配置的非负整数，还可以是与时间、用户识别码或高层信令中的至少一个参数相关的变量。
其中，g(n,t)可以采用如下方法定义，但本申请中g(n,t)的定义不限于此。
定义410：g(n,t)＝(n+t)mod K。
定义421：g(n,t)＝(Pattern(n)+t)mod K，Pattern为预定义的传输次数与跳频偏移量的对应表格，如表2所示。
表2
传输次数 1 2 3 4
跳频偏移量 0 m 2m 3m
表2中的m可以是跳频的单位步长，例如，
Figure PCTCN2018079874-appb-000005
floor表示向下取整运算，m也可以是其它的数值。
定义422：g(n,t)＝Pattern(n,s(t)mod K，s(t)为与时间相关的函数，例如，s(t)＝t mod Column，Pattern为预定义的传输次数与跳频偏移量的对应表格，如表3所示。
表3
Figure PCTCN2018079874-appb-000006
表3中，j＝s(t)，m可以是跳频的单位步长，例如，
Figure PCTCN2018079874-appb-000007
floor表示向下取整运算，m也可以是其它的数值。
定义430：g(n,t)＝RandomFunction(n,t)，
其中，RandomFunction表示随机函数。RandomFunction可以直接采用LTE系统中的随机序列，即，长度为31的Gold序列，也可以采用其它的随机序列。随机函数的初始化函数Cinit可以采用以下参数中的任意一种参数：小区标识、UE标识、虚拟UE标识或者高层信令配置的参数，其中，虚拟UE标识也可以是由高层信令配置。
定义431：
Figure PCTCN2018079874-appb-000008
其中，Q(n,t)＝(n-1)*N+t或Q(n,t)＝(t-1)*T+n，T为时间范围。例如在LTE系统中，当t为时隙序号时，T＝20。
定义432：
Figure PCTCN2018079874-appb-000009
其中，Q(n,t)＝(n-1)*N+t或Q(n,t)＝(t-1)*T+n，T为时间范围。例如在LTE系统中，当t为时隙序号时，T＝20。
定义433：
Figure PCTCN2018079874-appb-000010
在定义433中，发送端根据随机跳频步长和镜像映射确定g(n,t)，fm(n)＝n mod 2，或者fm(n)＝C(n),其中，Q(n,t)＝(n-1)*N+t或Q(n,t)＝(t-1)*T+n，T为时间范围。例如在LTE系统中，当t为时隙序号时，T＝20。
定义440：g(n,t)＝F(Pattern(n,t),RandomFunction(n,t))，
其中，F表示预定义映射和随机函数结合的规则。
定义441：g(n,t)＝(Pattern(n),RandomFunction(t))mod K。
定义442：g(n,t)＝(Pattern(t),RandomFunction(n))mod K。
定义443：g(n,t)＝(Pattern(t,n),RandomFunction(n))mod K。
定义444：g(n,t)＝(Pattern(n),RandomFunction(n,t))mod K。
定义445：g(n,t)＝(Pattern(n,t),RandomFunction(n,t))mod K。
方法500：终端设备根据f＝g(n,j)+g_init确定第一频域资源的起始位置，并进一步确定第一频域资源，其中，f为第一频域资源的起始位置，t为时间参数，例如，当前发送数据使用的时间单元，g(n,j)为与第一信息块的传输次数n以及参数j相关的函数，g_init为频域参考位置，g_init可以是一个用户专属的非负整数，也可以是高层信令配置的非负整数，还可以是与时间、用户识别码或高层信令中的至少一个参数相关的变量。
其中，g(n,j)可以采用如下方法定义，但本申请中g(n,j)的定义不限于此。
定义510：g(n,j)＝(n+j)mod K。
定义521：g(n,j)＝(Pattern(n)+j)mod K，Pattern为预定义的传输次数与跳频偏移量的对应表格，如表4所示。
表4
传输次数 1 2 3 4
跳频偏移量 0 m 2m 3m
表4中的m可以是跳频的单位步长，例如，
Figure PCTCN2018079874-appb-000011
floor表示向下取整运算，m也可以是其它的数值。
定义522：g(n,j)＝Pattern(n,s(j))mod K，s(j)是一个输入量为j的函数，可以定义为s(j)＝j mod Column或者
Figure PCTCN2018079874-appb-000012
C init＝h(j)，其中，h(j)是随机函数C的初始化值C init的计算方法，一种典型的计算方法是C init＝j；Pattern为预定义的传输次数与跳频偏移量的对应表格，如表5所示。
表5
Figure PCTCN2018079874-appb-000013
表5中，w＝s(j)，m可以是跳频的单位步长，例如，
Figure PCTCN2018079874-appb-000014
floor表示向下取整运算，m也可以是其它的数值。
定义530：g(n,j)＝RandomFunction(n,j)，
其中，RandomFunction表示随机函数。RandomFunction可以直接采用LTE系统中的随机序列，即，长度为31的Gold序列，也可以采用其它的随机序列。随机函数的初始化函数Cinit可以采用以下参数中的任意一种参数：小区标识、UE标识、虚拟UE标识或者高层信令配置的参数，其中，虚拟UE标识也可以是由高层信令配置。
定义531：
Figure PCTCN2018079874-appb-000015
其中，Q(n,j)＝(n-1)*N+j或Q(n,j)＝(j-1)*J+n，J为j的取值范围，以LTE系统为例， j为用户识别码，J＝100，即当前系统配置的跳频用户数；或者J＝2^16，即小区内支持的最大用户数。j可以通过高层信令配置，例如J＝50。
定义532：
Figure PCTCN2018079874-appb-000016
其中，Q(n,j)＝(n-1)*N+j或Q(n,j)＝(j-1)*J+n，J为j的取值范围，以LTE系统为例，j为用户识别码，J＝100，即当前系统配置的跳频用户数；或者J＝2^16，即小区内支持的最大用户数。j可以通过高层信令配置，例如J＝50。
定义533：
Figure PCTCN2018079874-appb-000017
在定义533中，发送端根据随机跳频步长和镜像映射确定g(n,j)，fm(n)＝n mod 2，或者fm(n)＝C(n)，Q(n,j)＝(n-1)*N+j或Q(n,j)＝(j-1)*J+n，J为j的取值范围，以LTE系统为例，j为用户识别码，J＝100，即当前系统配置的跳频用户数；或者J＝2^16，即小区内支持的最大用户数。j可以通过高层信令配置，例如J＝50。
定义540：g(n,j)＝F(Pattern(n,j),RandomFunction(n,j))，
其中，F表示预定义映射和随机函数结合的规则。
定义541：g(n,j)＝(Pattern(n),RandomFunction(j))mod K。
定义542：g(n,j)＝(Pattern(j),RandomFunction(n))mod K。
定义543：g(n,j)＝(Pattern(j,n),RandomFunction(n))mod K。
定义544：g(n,j)＝(Pattern(n),RandomFunction(n,j))mod K。
定义545：g(n,j)＝(Pattern(n,j),RandomFunction(n,j))mod K。
方法600：终端设备根据f＝(g(n,j,t)+g_init)mod K确定第一频域资源的起始位置，并进一步确定第一频域资源，其中，f为第一频域资源的起始位置，t为时间参数，例如，当前发送数据使用的时间单元，g(n,j,t)为与第一信息块的传输次数n、参数j以及时间参数t相关的函数，g_init为频域参考位置，g_init可以是一个用户专属的非负整数，也可以是高层信令配置的非负整数，还可以是与时间、用户识别码或高层信令中的至少一个参数相关的变量。
其中，g(n,j,t)可以采用如下方法定义，但本申请中g(n,j,t)的定义不限于此。
定义610：g(n,j,t)＝(n+j+t)mod K。
定义621：g(n,j,t)＝(Pattern(n)+j+t)mod K，Pattern为预定义的传输次数与跳频偏移量的对应表格，如表6所示。
表6
传输次数 1 2 3 4
跳频偏移量 0 m 2m 3m
表6中的m可以是跳频的单位步长，例如，
Figure PCTCN2018079874-appb-000018
floor表示向下取整运算，m也可以是其它的数值。
定义622：g(n,j,t)＝(Pattern(n,s(j))+t)mod K，s(j)是一个输入为j的函数，可以定义为s(j)＝j mod Column或者
Figure PCTCN2018079874-appb-000019
C init＝h(j)；Pattern为预定义的传输次数与跳频偏移量的对应表格，如表7所示。
表7
Figure PCTCN2018079874-appb-000020
表7中，w＝s(j)，m可以是跳频的单位步长，例如，
Figure PCTCN2018079874-appb-000021
floor表示向下取整运算，m也可以是其它的数值。
定义630：g(n,j,t)＝RandomFunction(n,j,t)，
其中，RandomFunction表示随机函数。RandomFunction可以直接采用LTE系统中的随机序列，即，长度为31的Gold序列，也可以采用其它的随机序列。随机函数的初始化函数Cinit可以采用以下参数中的任意一种参数：小区标识、UE标识、虚拟UE标识或者高层信令配置的参数，其中，虚拟UE标识也可以是由高层信令配置。
定义631：
Figure PCTCN2018079874-appb-000022
其中，C init＝h(j)，Q(n,t)＝(n-1)*N+t或Q(n,t)＝(t-1)*T+n，T为时间范围。例如在LTE系统中，当t为时隙序号时，T＝20。
定义632：
Figure PCTCN2018079874-appb-000023
其中，C init＝h(j)，Q(n,t)＝(n-1)*N+t或Q(n,t)＝(t-1)*T+n，T为时间范围。例如在LTE系统中，当t为时隙序号时，T＝20。
定义633：
Figure PCTCN2018079874-appb-000024
在定义633中，发送端根据随机跳频步长和镜像映射确定g(n,t)，fm(n)＝n mod 2，或者fm(n)＝C(n),其中，Q(n,t)＝(n-1)*N+t或Q(n,t)＝(t-1)*T+n，T为时间范围。例如在LTE系统中，当t为时隙序号时，T＝20。
定义640：g(n,j,t)＝F(Pattern(n,j,t),RandomFunction(n,j,t))，
其中，F表示预定义映射和随机函数结合的规则，Pattern(n,j,t)的含义与定义621相同，RandomFunction(n,j,t)的含义与定义631、定义632或定义633相同。
定义641：g(n,j,t)＝(Pattern(n,s(j))+RandomFunction(t))，其中，s(j)＝j mod Column或者
Figure PCTCN2018079874-appb-000025
C(K)的初始化函数由高层信令配置或者根据终端设备标识确定。
定义642：g(n,j,t)＝(Pattern1(n,s(j1))+h(t,j2)，j1和j2为高层配置参数或者用户识别码，其中，s(j1)＝j1mod Column，或者，
Figure PCTCN2018079874-appb-000026
C(K)的初始化函数由高层信令配置或者根据终端设备标识确定，h(t,j2)＝(t+j2)mod K。
定义643：g(n,j,t)＝(y(n)+RandomFunction(t))，其中，y(n)＝n mod K。
定义644：g(n,j,t)＝(n+RandomFunction(t))。
定义645：g(n,j,t)＝(Pattern(n)+RandomFunction(t))。
上述方法均与第一资源为频域资源或者第一资源为时频资源为例进行说明，但本申请不限于此，第一资源为码域资源时同样适用于上述公式。
图3是本申请提供的一种接收数据的方法的示意性流程图。方法700包括：
S710，接收端通过第一资源接收第一数据。
S720，所述接收端根据所述第一资源确定第一参数n，所述n表示第一信息块的传输次数，所述第一信息块是所述第一数据经过处理后得到的，所述n大于或等于0。
其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数。
方法700中，接收端可以是图1所示的终端设备，也可以是图1所示的网络设备，还可以其它设备，例如，M2M通信系统中的终端设备。
在S710中，接收端在首次接收数据时采用盲检测的方式检测数据，当接收端在第一资源上盲检测到第一数据时，即可根据第一资源与发送端发送数据的次序的对应关系确定第一信息块下一次传输时使用的资源。
作为一个可选的示例，接收端在接收第一数据前在第二频域资源上已接收到第二数据，则接收端可以根据发送端的数据发送次数与频域资源的对应关系确定下次接收数据的频域资源(即，第一频域资源)，从而，接收端无需盲检测即可接收第一数据。
所属领域的技术人员可以清楚地了解到，接收端根据第一资源确定第一信息块的传输次数为发送端根据第一信息块的传输次数确定第一资源的逆过程，为了简洁，上述方法700中接收端的具体工作过程，可以参考前述方法200中发送端的对应过程，在此不加赘述。
因此，本申请提供的接收数据的方法，接收端根据接收数据使用的资源与传输次序的对应关系确定当前接收到的数据为第几次传输的数据，当接收端接收到的数据为非首次传输的数据时，可以将接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。
可选地，所述K个预先配置的资源具有不同的资源起始位置。
可选地，所述K个预先配置的资源是免调度资源。
根据本申请提供的发送数据的方法，免调度传输使用的资源与基于调度传输使用的资源不同，从而，可以避免不同设备在使用两种传输模式发送数据时的碰撞问题。
可选地，所述第一资源是所述K个资源中与所述n唯一对应的资源。
从而，接收端可以根据接收第一数据使用的第一资源确定第一数据是第一信息块的第几次传输的数据。
可选地，所述第一信息块的传输次数与所述K个资源中的至少一个资源一一对应。
从而，接收端可以根据接收第一数据使用的第一资源确定第一信息块的传输次数。
可选地，所述接收端根据所述第一资源确定第一参数n，包括：
S721，所述接收端根据所述第一资源以及下列参数中的至少一个参数确定所述n，
参考位置，第一时间单元t 1，参数j，
其中，所述参考位置用于指示所述第一信息块首次传输时使用的资源，所述第一时间单元t 1为发送端发送所述第一数据使用的时间单元，所述参数j用于标识所述发送端。
以第一资源为频域资源为例，频域参考位置用于发送端确定第一频域资源，该频域参考位置可以是第一数据首次发送时使用的频域资源的起始位置，也可以是一个与传输次数 无关的频域位置。t 1例如可以是第一时间单元的符号序号、时隙序号、微时隙序号或者子帧序号，本申请对第一时间单元的具体形式不作限定。参数j用于标识发送端，例如，参数j可以是用户识别码或者高层信令配置的参数。
接收端根据上述参数确定第一资源与传输次数之间的对应关系，从而，可以根据实际情况灵活选择跳频通信的方式。
可选地，所述接收端根据所述第一资源确定第一参数n，包括：
S722，所述接收端根据所述第一资源和随机化函数确定所述n。或者，
S723，所述接收端根据所述第一资源和预定义规则确定所述n。或者，
S724，所述接收端根据所述第一资源、随机化函数和预定义规则确定所述n。
从而，发送端和接收端可以根据实际情况灵活选择跳频通信的方式。
可选地，方法700还包括：
S730，所述接收端根据高层信令或者所述发送端的标识信息确定所述随机化函数的初始化函数。
作为一个可选的示例，当接收端为基站时，基站可以根据终端设备的标识确定随机化函数的初始化函数，避免了同一个小区内跳频用户的跳频图样保持一致的情况，从而可以避免位于同一个小区的不同跳频用户之间的碰撞。
作为另一个可选的示例，当接收端为终端设备时，终端设备可以根据该终端设备的标识或者高层信令确定随机化函数的初始化函数，避免了同一个小区内跳频用户的跳频图样保持一致的情况，从而可以避免位于同一个小区的不同跳频用户之间的碰撞。
可选地，方法700还包括：
S740，所述接收端根据所述K确定所述第一数据的冗余版本集合，其中，所述冗余版本集合包括的冗余版本的数量M小于或等于所述K，所述M为正整数。
接收端可以根据K确定第一数据的冗余版本集合中冗余版本的数量，从而可以灵活确定冗余版本集合，使得冗余版本的数量小于或等于可用资源的数量，接收端对于每次传输的数据仅需使用一个冗余版本进行检测，减小了接收端盲检测的复杂度。
可选地，所述第一数据的任意一个冗余版本对应至少一次传输。
接收端可以直接确定第一数据的冗余版本集合，该冗余版本集合例如可以是接收端根据通信协议确定的，当冗余版本集合中冗余版本的数量M小于可用资源的数量K时，一个冗余版本可以与一次或多次传输对应；当M等于K时，冗余版本与传输次数一一对应；当M大于K时，一个或者多个冗余版本对应一次传输。
因此，接收端无需根据可用资源的数量即可确定冗余版本集合，减小了发送端发送数据的复杂度。
可选地，方法700中，K＝1。
当K＝1时，接收端仅有一个可用资源，每次传输都会使用相同的资源，K＝1适用于方法300至方法600中的公式。
上文详细介绍了本申请提供的数据传输的方法示例。可以理解的是，发送端和接收端为了实现上述功能，其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，本申请能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机 软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
本申请可以根据上述方法示例对发送端等进行功能单元的划分，例如，可以对应各个功能划分各个功能单元，也可以将两个或两个以上的功能集成在一个处理单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。需要说明的是，本申请中对单元的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
在采用集成的单元的情况下，图4示出了上述实施例中所涉及的发送端的一种可能的结构示意图。发送端400包括：处理单元402和通信单元403。处理单元402用于对发送端400的动作进行控制管理，例如，处理单元402用于支持发送端400执行图2的S210和/或用于本文所描述的技术的其它过程。通信单元403用于支持发送端400与其它网络实体的通信，例如与接收端之间的通信。发送端400还可以包括存储单元401，用于存储发送端400的程序代码和数据。
其中，处理单元402可以是处理器或控制器，例如可以是中央处理器(central processing unit，CPU)，通用处理器，数字信号处理器(digital signal processor，DSP)，专用集成电路(application-specific integrated circuit，ASIC)，现场可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。其可以实现或执行结合本申请公开内容所描述的各种示例性的逻辑方框，模块和电路。所述处理器也可以是实现计算功能的组合，例如包含一个或多个微处理器组合，DSP和微处理器的组合等等。通信单元403可以是收发器、收发电路等。存储单元401可以是存储器。
本申请提供的发送端400，根据待发送数据的发送次序与频域资源的对应关系从多个频域资源中确定跳频频域资源，并通过该跳频频域资源向接收端发送该待发送数据，接收端在该跳频频域资源上检测数据，并根据上述对应关系确定接收到的数据的传输次序，当接收端接收到的数据为非首次传输的数据时，可以将接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。
当处理单元402为处理器，通信单元403为收发器，存储单元401为存储器时，本申请所涉及的发送端可以为图5所示的发送端。
参阅图5所示，该发送端500包括：处理器502、收发器503、存储器501。其中，收发器503、处理器502以及存储器501可以通过内部连接通路相互通信，传递控制和/或数据信号。
所属领域的技术人员可以清楚地了解到，为了描述的方便和简洁，上述描述的装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不加赘述。
本申请提供的发送端500，根据待发送数据的发送次序与频域资源的对应关系从多个频域资源中确定跳频频域资源，并通过该跳频频域资源向接收端发送该待发送数据，接收端在该跳频频域资源上检测数据，并根据上述对应关系确定接收到的数据的传输次序，当接收端接收到的数据为非首次传输的数据时，可以将接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。
在采用集成的单元的情况下，图6示出了上述实施例中所涉及的接收端的一种可能的结构示意图。接收端600包括：处理单元602和通信单元603。处理单元602用于对接收端600的动作进行控制管理，例如，处理单元602用于支持接收端600执行图3的S320和/或用于本文所描述的技术的其它过程。通信单元603用于支持接收端600与其它网络实体的通信，例如与发送端之间的通信。接收端600还可以包括存储单元601，用于存储接收端600的程序代码和数据。
其中，处理单元602可以是处理器或控制器，例如可以是CPU，通用处理器，DSP，ASIC，FPGA或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。其可以实现或执行结合本申请公开内容所描述的各种示例性的逻辑方框，模块和电路。所述处理器也可以是实现计算功能的组合，例如包含一个或多个微处理器组合，DSP和微处理器的组合等等。通信单元603可以是收发器、收发电路等。存储单元601可以是存储器。
本申请提供的数据传输的接收端600，根据接收数据使用的频域资源与传输次序的对应关系确定当前接收到的数据为第几次传输的数据，当接收端接收到的数据为非首次传输的数据时，可以将接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。
当处理单元602为处理器，通信单元603为收发器，存储单元601为存储器时，本申请所涉及的接收端可以为图7所示的接收端。
参阅图7所示，该接收端700包括：处理器702、收发器703、存储器701。其中，收发器703、处理器702以及存储器701可以通过内部连接通路相互通信，传递控制和/或数据信号。
所属领域的技术人员可以清楚地了解到，为了描述的方便和简洁，上述描述的装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不加赘述。
本申请提供的数据传输的接收端700，根据接收数据使用的频域资源与传输次序的对应关系确定当前接收到的数据为第几次传输的数据，当接收端接收到的数据为非首次传输的数据时，可以将接收到的数据与之前接收到的数据进行合并解码，从而提高了数据传输的可靠性。
在本申请各个实施例中，各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请的实施过程构成任何限定。
另外，本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
结合本申请公开内容所描述的方法或者算法的步骤可以硬件的方式来实现，也可以是由处理器执行软件指令的方式来实现。软件指令可以由相应的软件模块组成，软件模块可以被存放于随机存取存储器(random access memory，RAM)、闪存、只读存储器(read only memory，ROM)、可擦除可编程只读存储器(erasable programmable ROM，EPROM)、电可擦可编程只读存储器(electrically EPROM，EEPROM)、寄存器、硬盘、移动硬盘、只读光盘(CD-ROM)或者本领域熟知的任何其它形式的存储介质中。一种示例性的存储介质耦合至处理器，从而使处理器能够从该存储介质读取信息，且可向该存储介质写入信息。当然，存储介质也可以是处理器的组成部分。处理器和存储介质可以位于ASIC中。 另外，该ASIC可以位于终端设备中。当然，处理器和存储介质也可以作为分立组件存在于发送端和接收端中。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时，全部或部分地产生按照本申请所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者通过所述计算机可读存储介质进行传输。所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，DVD)、或者半导体介质(例如固态硬盘(solid state disk，SSD))等。
以上所述的具体实施方式，对本申请的目的、技术方案和有益效果进行了进一步详细说明，所应理解的是，以上所述仅为本申请的具体实施方式而已，并不用于限定本申请的保护范围，凡在本申请的技术方案的基础之上，所做的任何修改、等同替换、改进等，均应包括在本申请的保护范围之内。

Claims (44)

  1. 一种发送数据的方法，其特征在于，所述方法包括：
    发送端根据第一参数n确定第一资源，所述n表示第一信息块的传输次数，所述第一资源用于所述第一信息块的当前传输，所述n大于或等于0；
    所述发送端通过所述第一资源传输第一数据，所述第一数据为所述第一信息块经过处理后得到的用于当前传输的数据；
    其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数。
  2. 根据权利要求1所述的方法，其特征在于，所述K个预先配置的资源具有不同的资源起始位置。
  3. 根据权利要求1或2所述的方法，其特征在于，所述K个预先配置的资源是免调度资源。
  4. 根据权利要求1至3中任一项所述的方法，其特征在于，所述第一资源是所述K个资源中与所述n唯一对应的资源。
  5. 根据权利要求1至4中任一项所述的方法，其特征在于，所述第一信息块的传输次数与所述K个资源中的至少一个资源一一对应。
  6. 根据权利要求1至5中任一项所述的方法，其特征在于，所述发送端根据第一参数n确定第一资源，包括：
    所述发送端根据所述n以及下列参数中的至少一个参数确定所述第一资源，
    参考位置，第一时间单元t 1，第二参数j，
    其中，所述参考位置用于指示所述第一信息块首次传输时使用的资源，所述第一时间单元t 1为所述发送端传输所述第一数据使用的时间单元，所述j用于标识所述发送端。
  7. 根据权利要求1至6中任一项所述的方法，其特征在于，所述发送端根据第一参数n确定第一资源，包括：
    所述发送端根据所述n和随机化函数确定所述第一资源；或者，
    所述发送端根据所述n和预定义规则确定所述第一资源；或者，
    所述发送端根据所述n、随机化函数和预定义规则确定所述第一资源。
  8. 根据权利要求7所述的方法，其特征在于，所述方法还包括：
    所述发送端根据高层信令或者所述发送端的标识信息确定所述随机化函数的初始化函数。
  9. 根据权利要求1至8中任一项所述的方法，其特征在于，所述方法还包括：
    所述发送端根据所述K确定所述第一数据的冗余版本集合，其中，所述冗余版本集合包括的冗余版本的数量M小于或等于所述K，所述M为正整数。
  10. 根据权利要求1至9中任一项所述的方法，其特征在于，所述第一数据的任意一个冗余版本对应所述第一信息块的至少一次传输。
  11. 根据权利要求1至10中任一项所述的方法，其特征在于，所述K等于1。
  12. 一种接收数据的方法，其特征在于，所述方法包括：
    接收端通过第一资源接收第一数据；
    所述接收端根据所述第一资源确定第一参数n，所述n表示第一信息块的传输次数，所述第一信息块是所述第一数据经过处理后得到的，所述n大于或等于0；
    其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数。
  13. 根据权利要求12所述的方法，其特征在于，所述K个预先配置的资源具有不同的资源起始位置。
  14. 根据权利要求12或13所述的方法，其特征在于，所述K个预先配置的资源是免调度资源。
  15. 根据权利要求12至14中任一项所述的方法，其特征在于，所述第一资源是所述K个资源中与所述n唯一对应的资源。
  16. 根据权利要求12至15中任一项所述的方法，其特征在于，所述第一信息块的传输次数与所述K个资源中的至少一个资源一一对应。
  17. 根据权利要求12至16中任一项所述的方法，其特征在于，所述接收端根据所述第一资源确定第一参数n，包括：
    所述接收端根据所述第一资源以及下列参数中的至少一个参数确定所述n，
    参考位置，第一时间单元t 1，第二参数j，
    其中，所述参考位置用于指示所述第一信息块首次传输时使用的资源，所述第一时间单元t 1为发送端发送所述第一数据使用的时间单元，所述j用于标识所述发送端。
  18. 根据权利要求12至16中任一项所述的方法，其特征在于，所述接收端根据所述第一资源确定第一参数n，包括：
    所述接收端根据所述第一资源和随机化函数确定所述n；或者，
    所述接收端根据所述第一资源和预定义规则确定所述n；或者，
    所述接收端根据所述第一资源、随机化函数和预定义规则确定所述n。
  19. 根据权利要求18所述的方法，其特征在于，所述方法还包括：
    所述接收端根据高层信令或者发送端的标识信息确定所述随机化函数的初始化函数。
  20. 根据权利要求12至19中任一项所述的方法，其特征在于，所述方法还包括：
    所述接收端根据所述K确定所述第一数据的冗余版本集合，其中，所述冗余版本集合包括的冗余版本的数量M小于或等于所述K，所述M为正整数。
  21. 根据权利要求12至20中任一项所述的方法，其特征在于，所述第一数据的任意一个冗余版本对应所述第一信息块的至少一次传输。
  22. 根据权利要求12至21中任一项所述的方法，其特征在于，所述K等于1。
  23. 一种发送数据的装置，其特征在于，所述装置包括处理单元和通信单元，
    所述处理单元用于根据第一参数n确定第一资源，所述n表示第一信息块的传输次数，所述第一资源用于所述第一信息块的当前传输，所述n大于或等于0；
    所述通信单元用于通过所述处理单元确定的所述第一资源传输第一数据，所述第一数据为所述第一信息块经过处理后得到的用于当前传输的数据；
    其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数。
  24. 根据权利要求23所述的装置，其特征在于，所述K个预先配置的资源具有不同的资源起始位置。
  25. 根据权利要求23或24所述的装置，其特征在于，所述K个预先配置的资源是免 调度资源。
  26. 根据权利要求23至25中任一项所述的装置，其特征在于，所述第一资源是所述K个资源中与所述n唯一对应的资源。
  27. 根据权利要求23至26中任一项所述的装置，其特征在于，所述第一信息块的传输次数与所述K个资源中的至少一个资源一一对应。
  28. 根据权利要求23至27中任一项所述的装置，其特征在于，所述处理单元具体用于：
    根据所述n以及下列参数中的至少一个参数确定所述第一资源，
    参考位置，第一时间单元t 1，第二参数j，
    其中，所述参考位置用于指示所述第一信息块首次传输时使用的资源，所述第一时间单元t 1为所述通信单元传输所述第一数据使用的时间单元，所述j用于标识所述装置。
  29. 根据权利要求23至28中任一项所述的装置，其特征在于，所述处理单元具体用于：
    根据所述n和随机化函数确定所述第一资源；或者，
    根据所述n和预定义规则确定所述第一资源；或者，
    根据所述n、随机化函数和预定义规则确定所述第一资源。
  30. 根据权利要求29所述的装置，其特征在于，所述处理单元还用于：
    根据高层信令或者所述装置的标识信息确定所述随机化函数的初始化函数。
  31. 根据权利要求23至30中任一项所述的装置，其特征在于，所述处理单元还用于：
    根据所述K确定所述第一数据的冗余版本集合，其中，所述冗余版本集合包括的冗余版本的数量M小于或等于所述K，所述M为正整数。
  32. 根据权利要求23至31中任一项所述的装置，其特征在于，所述第一数据的任意一个冗余版本对应所述第一信息块的至少一次传输。
  33. 根据权利要求23至32中任一项所述的装置，其特征在于，所述K等于1。
  34. 一种接收数据的装置，其特征在于，所述装置包括处理单元和通信单元，
    所述通信单元用于通过第一资源接收第一数据；
    所述处理单元用于根据所述通信单元接收所述第一数据使用的所述第一资源确定第一参数n，所述n表示第一信息块的传输次数，所述第一信息块是所述第一数据经过处理后得到的，所述n大于或等于0；
    其中，所述第一资源包含于K个预先配置的资源中，所述K为大于1的整数。
  35. 根据权利要求34所述的装置，其特征在于，所述K个预先配置的资源具有不同的资源起始位置。
  36. 根据权利要求34或35所述的装置，其特征在于，所述K个预先配置的资源是免调度资源。
  37. 根据权利要求34至36中任一项所述的装置，其特征在于，所述第一资源是所述K个资源中与所述n唯一对应的资源。
  38. 根据权利要求34至37中任一项所述的装置，其特征在于，所述第一信息块的传输次数与所述K个资源中的至少一个资源一一对应。
  39. 根据权利要求34至38中任一项所述的装置，其特征在于，所述处理单元具体用 于：
    根据所述第一资源以及下列参数中的至少一个参数确定所述n，
    参考位置，第一时间单元t 1，第二参数j，
    其中，所述参考位置用于指示所述第一信息块首次传输时使用的资源，所述第一时间单元t 1为发送端发送所述第一数据使用的时间单元，所述j用于标识所述发送端。
  40. 根据权利要求34至39中任一项所述的装置，其特征在于，所述处理单元具体用于：
    根据所述第一资源和随机化函数确定所述n；或者，
    根据所述第一资源和预定义规则确定所述n；或者，
    根据所述第一资源、随机化函数和预定义规则确定所述n。
  41. 根据权利要求40所述的装置，其特征在于，所述处理单元还用于：
    根据高层信令或者发送端的标识信息确定所述随机化函数的初始化函数。
  42. 根据权利要求34至41中任一项所述的装置，其特征在于，所述处理单元还用于：
    根据所述K确定所述第一数据的冗余版本集合，其中，所述冗余版本集合包括的冗余版本的数量M小于或等于所述K，所述M为正整数。
  43. 根据权利要求34至42中任一项所述的装置，其特征在于，所述第一数据的任意一个冗余版本对应所述第一信息块的至少一次传输。
  44. 根据权利要求34至43中任一项所述的装置，其特征在于，所述K等于1。
PCT/CN2018/079874 2017-03-24 2018-03-21 发送数据的方法和装置，以及接收数据的方法和装置 WO2018171635A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18770493.7A EP3589048B1 (en) 2017-03-24 2018-03-21 Data sending method and apparatus, and data receiving method and apparatus
US16/581,555 US20200021388A1 (en) 2017-03-24 2019-09-24 Data Sending Method and Apparatus and Data Receiving Method and Apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710184294.1A CN108631816B (zh) 2017-03-24 2017-03-24 发送数据的方法和装置，以及接收数据的方法和装置
CN201710184294.1 2017-03-24

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/581,555 Continuation US20200021388A1 (en) 2017-03-24 2019-09-24 Data Sending Method and Apparatus and Data Receiving Method and Apparatus

Publications (1)

Publication Number Publication Date
WO2018171635A1 true WO2018171635A1 (zh) 2018-09-27

Family

ID=63585040

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/079874 WO2018171635A1 (zh) 2017-03-24 2018-03-21 发送数据的方法和装置，以及接收数据的方法和装置

Country Status (4)

Country Link
US (1) US20200021388A1 (zh)
EP (1) EP3589048B1 (zh)
CN (1) CN108631816B (zh)
WO (1) WO2018171635A1 (zh)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10849124B2 (en) 2017-12-21 2020-11-24 Qualcomm Incorporated Grant-free downlink transmission
US11212051B2 (en) * 2018-03-06 2021-12-28 Qualcomm Incorporated Beam management for autonomous uplink with analog beams
CN111431675B (zh) * 2019-01-10 2022-10-25 华为技术有限公司 数据传输方法及装置
CN110753402B (zh) * 2019-09-30 2023-04-28 中国信息通信研究院 一种上行调度资源多配置数据传送方法和设备
CN113271607A (zh) * 2020-02-14 2021-08-17 大唐移动通信设备有限公司 一种时域重复传输方法、装置及发射机
CN115134864A (zh) * 2021-03-22 2022-09-30 华为技术有限公司 一种数据传输方法、相关装置以及设备
CN114553373A (zh) * 2022-02-23 2022-05-27 深圳市元征科技股份有限公司 一种数据传输方法、装置、设备和存储介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010052620A1 (en) * 2008-11-07 2010-05-14 Koninklijke Philips Electronics N.V. A method for allocating resources
WO2017039374A1 (en) * 2015-09-02 2017-03-09 Lg Electronics Inc. Method and apparatus for performing random access procedure in nb-iot carrier in wireless communication system

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10477538B2 (en) * 2014-03-19 2019-11-12 Qualcomm Incorporated Time hopping in device-to-device transmissions
EP3197060B1 (en) * 2014-08-07 2019-11-13 Huawei Technologies Co. Ltd. Data transmission method, device and system
CN105338637B (zh) * 2014-08-07 2019-11-19 中兴通讯股份有限公司 D2d通信处理方法、装置、d2d通信设备及基站
CN105517159A (zh) * 2014-09-25 2016-04-20 中兴通讯股份有限公司 一种实现d2d处理的方法及装置
CN106455093B (zh) * 2015-08-13 2019-05-24 电信科学技术研究院 一种数据传输方法及装置

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010052620A1 (en) * 2008-11-07 2010-05-14 Koninklijke Philips Electronics N.V. A method for allocating resources
WO2017039374A1 (en) * 2015-09-02 2017-03-09 Lg Electronics Inc. Method and apparatus for performing random access procedure in nb-iot carrier in wireless communication system

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
HTC: "HARQ retransmission in grant-free NOMA", 3GPP TSG RAN WG1 NR AD-HOC MEETING, R1-1701009, 20 January 2017 (2017-01-20), XP051203299 *
HUAWEI: "Support of URLLC in UL", 3GPP TSG RAN WG1 NR AD HOC MEETING, R1-1700024, 20 January 2017 (2017-01-20), XP051207566 *
LENOVO: "HARQ design for UL grant-free URLLC transmission", 3GPP TSG RAN WG1 MEETING #88, R1-1702667, 17 February 2017 (2017-02-17), XP051209814 *
NOKIA: "UL grant-free transmission for URLLC", 3GPP TSG-RAN WG1#88, R1-1703329, 17 February 2017 (2017-02-17), XP051210459 *
See also references of EP3589048A4
ZTE: "Basic Grant-free Transmission for URLLC", 3GPP TSG RAN WG1 MEETING #88, R1-1701594, 17 February 2017 (2017-02-17), XP051208761 *

Also Published As

Publication number Publication date
EP3589048A1 (en) 2020-01-01
EP3589048B1 (en) 2021-07-28
US20200021388A1 (en) 2020-01-16
EP3589048A4 (en) 2020-03-18
CN108631816B (zh) 2021-02-23
CN108631816A (zh) 2018-10-09

Similar Documents

Publication Publication Date Title
WO2018171635A1 (zh) 发送数据的方法和装置，以及接收数据的方法和装置
WO2021062613A1 (zh) 数据传输的方法和设备
US11206054B2 (en) Communication method and device
CN109152050B (zh) 下行控制信道参数的配置方法、网络设备和终端设备
CN111465110B (zh) 传输数据的方法和终端设备
US20060205414A1 (en) Use of supplemental assignments
CN109428680B (zh) 发送或接收上行数据的方法和装置
WO2017000233A1 (zh) 传输导频序列的方法和装置
US10965416B2 (en) Data transmission method and apparatus
JP2020526137A (ja) 繰り返し送信のための方法および端末デバイス
EP3592090A1 (en) Method for sending scheduling information and network device
EP3595220A1 (en) Method and apparatus for sending and receiving feedback information
WO2018081989A1 (zh) 传输上行控制信息的方法、终端设备和网络设备
US20230088374A1 (en) Buffer determining method and apparatus
US11528714B2 (en) Data transmission method and apparatus
CN110730513B (zh) 一种通信方法及装置
WO2018137667A1 (zh) 传输数据的方法和装置以及传输信息的方法和装置
WO2019113897A1 (zh) 确定传输资源的方法、终端设备和网络设备
WO2021000937A1 (zh) 多时间单元传输方法及相关装置
WO2018201344A1 (zh) 无线通信的方法、终端设备和网络设备
WO2019047961A1 (zh) 生成和接收导频信号的方法和装置
CN112583528B (zh) 确定传输块大小的方法和装置
CN112866949B (zh) 用于确定传输块大小的方法和通信装置
WO2021147214A1 (zh) 通信方法和通信装置
CN109644090B (zh) 重传数据的方法、终端设备和网络设备

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: 18770493

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018770493

Country of ref document: EP

Effective date: 20190927