WO2021249481A1 - 数据传输方法、装置、发射机、接收机及存储介质 - Google Patents

数据传输方法、装置、发射机、接收机及存储介质 Download PDF

Info

Publication number
WO2021249481A1
WO2021249481A1 PCT/CN2021/099385 CN2021099385W WO2021249481A1 WO 2021249481 A1 WO2021249481 A1 WO 2021249481A1 CN 2021099385 W CN2021099385 W CN 2021099385W WO 2021249481 A1 WO2021249481 A1 WO 2021249481A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource units
resource
data
resource unit
information
Prior art date
Application number
PCT/CN2021/099385
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 EP21821006.0A priority Critical patent/EP4167676A1/en
Priority to CA3182416A priority patent/CA3182416A1/en
Priority to KR1020237001041A priority patent/KR20230024974A/ko
Priority to US18/009,892 priority patent/US20230224110A1/en
Publication of WO2021249481A1 publication Critical patent/WO2021249481A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload
    • H04L5/0046—Determination of how many bits are transmitted on different sub-channels
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0091—Signaling for the administration of the divided path
    • H04L5/0094—Indication of how sub-channels of the path are allocated
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202—Channel estimation
    • H04L25/0224—Channel estimation using sounding signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0036—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
    • H04L1/0038—Blind format detection
    • 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/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202—Channel estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1893—Physical mapping arrangements
    • 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1896—ARQ related signaling

Definitions

  • This application relates to wireless communication technology, such as a data transmission method, device, transmitter, receiver, and storage medium.
  • the transmitter can randomly select resources for transmitting data, such as selecting time-frequency resources and pilots, for competitive access and transmission. Resources selected by different transmitters may collide, resulting in unstable data transmission or transmission failure, affecting the reliability and capacity of data transmission.
  • This application provides a data transmission method, device, transmitter, receiver, and storage medium.
  • the data transmission is performed on one or more resource units, and the number and location information of the resource units are carried in the transmitted data block.
  • the receiver performs comprehensive reception and processing to improve the reliability and capacity of data transmission.
  • the embodiment of the present application provides a data transmission method, which is applied to a transmitter, and includes:
  • N is an integer greater than or equal to 1;
  • the embodiment of the present application also provides a data transmission method, which is applied to a receiver, and includes:
  • the first detection result includes at least one data block among M data blocks
  • the first detection result includes instructions for transmitting The number N of resource units used by the M data blocks and the location information of at least one resource unit in the N resource units, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 1.
  • An embodiment of the present application also provides a data transmission device, including:
  • the resource determination module is configured to determine the number N of resource units and the corresponding N resource units, where N is an integer greater than or equal to 1;
  • the data block acquisition module is configured to acquire M data blocks to be transmitted, where M is an integer greater than or equal to 1, wherein each data block contains the number N for indicating the number of resource units and the number of N resource units Information about the location of at least one resource unit;
  • the transmission module is configured to transmit the M data blocks on the N resource units.
  • An embodiment of the present application also provides a data transmission device, including:
  • the resource determination module to be detected is set to determine the resource unit to be detected
  • the detection module is configured to perform detection on the resource unit to be detected and obtain a first detection result, wherein the first detection result includes at least one data block among M data blocks, and the first detection result Contains information indicating the number N of resource units used to transmit the M data blocks and the location of at least one resource unit in the N resource units, where M is an integer greater than or equal to 1, and N is greater than or equal to An integer of 1.
  • An embodiment of the present application also provides a transmitter, including:
  • One or more processors are One or more processors;
  • Storage device for storing one or more programs
  • the one or more processors When the one or more programs are executed by the one or more processors, the one or more processors implement the above-mentioned data transmission method applied to the transmitter.
  • the embodiment of the present application also provides a receiver, including:
  • One or more processors are One or more processors;
  • Storage device for storing one or more programs
  • the one or more processors When the one or more programs are executed by the one or more processors, the one or more processors implement the above-mentioned data transmission method applied to the receiver.
  • the embodiment of the present application also provides a computer-readable storage medium, and a computer program is stored on the computer-readable storage medium, and when the program is executed by a processor, the above-mentioned data transmission method is realized.
  • FIG. 1 is a flowchart of a data transmission method provided by an embodiment
  • FIG. 2A is a schematic diagram of a designated bit according to an embodiment
  • FIG. 2B is a schematic diagram of a designated bit according to another embodiment
  • FIG. 2C is a schematic diagram of a designated bit according to still another embodiment
  • FIG. 2D is a schematic diagram of a designated bit according to another embodiment
  • FIG. 2E is a schematic diagram of a designated bit according to another embodiment
  • FIG. 2F is a schematic diagram of a designated bit according to another embodiment
  • FIG. 3A is a schematic diagram of a designated bit according to another embodiment
  • FIG. 3B is a schematic diagram of a designated bit according to another embodiment
  • FIG. 3C is a schematic diagram of a designated bit according to another embodiment
  • FIG. 3D is a schematic diagram of a designated bit according to another embodiment
  • FIG. 3E is a schematic diagram of a designated bit according to another embodiment
  • FIG. 3F is a schematic diagram of a designated bit according to another embodiment
  • FIG. 4A is a schematic diagram of a designated bit according to another embodiment
  • FIG. 4B is a schematic diagram of a designated bit according to another embodiment
  • FIG. 4C is a schematic diagram of a designated bit according to another embodiment
  • FIG. 4D is a schematic diagram of a designated bit according to another embodiment
  • FIG. 4E is a schematic diagram of a designated bit according to another embodiment.
  • 4F is a schematic diagram of a designated bit provided by another embodiment
  • FIG. 5A is a schematic diagram of a designated bit according to another embodiment
  • FIG. 5B is a schematic diagram of a designated bit according to another embodiment
  • FIG. 5C is a schematic diagram of a designated bit according to another embodiment
  • FIG. 5D is a schematic diagram of a designated bit according to another embodiment
  • FIG. 5E is a schematic diagram of a designated bit according to another embodiment.
  • FIG. 5F is a schematic diagram of a designated bit according to another embodiment.
  • FIG. 6 is a flowchart of a data transmission method provided by another embodiment
  • FIG. 7 is a schematic structural diagram of a data transmission device provided by an embodiment
  • FIG. 8 is a schematic structural diagram of a data transmission device provided by another embodiment.
  • FIG. 9 is a schematic diagram of the hardware structure of a transmitter provided by an embodiment.
  • FIG. 10 is a schematic diagram of the hardware structure of a receiver provided by an embodiment.
  • transmitters For grant-free transmission (Grant-free transmission), transmitters (such as user terminals) can independently send data without sending scheduling requests or waiting for dynamic scheduling. Scheduling-free transmission can reduce signaling overhead and transmission delay, and can also reduce The power consumption of the transmitter. In addition, the combination of scheduling-free transmission and non-orthogonal transmission can also increase the number of transmitters connected to the wireless network.
  • Scheduling-free transmission includes two schemes, namely semi-persistent scheduling (or Configured Grant) scheduling-free and contention-based scheduling-free.
  • the receiver such as a base station
  • the receiver can pre-configure or semi-statically configure time-frequency resources and pilot sequences for each transmitter, by allowing multiple transmitters to use different time-frequency resources and/or The pilot frequency sequence avoids collisions, so that the transmitter can be identified and detected by the user.
  • the available time-frequency resources are periodic, which is more suitable for periodic services. For random burst services, the transmission efficiency is lower and the delay is longer.
  • contention-free scheduling when a transmitter has service transmission requirements, time-frequency resources and pilot sequences can be randomly selected for competitive access and transmission.
  • the time-frequency resources and pilot sequences used by multiple transmitters may be affected.
  • the receiver needs to use a more complex blind detection algorithm to realize the user identification and detection of the transmitter.
  • the competition-free scheduling is more suitable for random burst services, with better transmission efficiency and lower delay.
  • This application provides a data transmission method, by performing data transmission on one or more resource units, and carrying the number and location information of the resource units in the transmitted data block for the receiver to receive and process comprehensively, thereby It can improve the reliability of data transmission, improve the transmission performance under collision conditions, and further improve the performance and capacity of competition-free scheduling transmission.
  • Fig. 1 is a flowchart of a data transmission method provided in an embodiment. As shown in Fig. 1, the method provided in this embodiment includes steps 110-130.
  • step 110 the number N of resource units and the corresponding N resource units are determined, where N is an integer greater than or equal to 1.
  • step 120 M data blocks to be transmitted are acquired, where M is an integer greater than or equal to 1, wherein each data block contains the number of resource units N and at least one of the N resource units. Information about the location of a resource unit.
  • step 130 the M data blocks are transmitted on the N resource units.
  • the transmitter uses N resource units to transmit M data blocks, and each data block carries information about the number of resource units N and the location of at least one resource unit in the N resource units to provide the receiver for processing Reliable basis.
  • the data sent by the transmitter has a high probability (except for other unstable factors in the network, such as poor signal quality, (Under the influence of interference or noise) can be received and decoded by the receiver, and the receiver can obtain information such as the resource unit used by the transmitter from the decoded data, and use this information to comprehensively perform the data on these resource units. Therefore, the reliability of data transmission can be improved, the transmission performance in collision situations can be improved, and the performance and capacity of competition-free scheduling transmission can be improved.
  • this embodiment does not limit the execution order of step 110 and step 120, that is, the transmitter may first determine N resource units, and then obtain M data blocks based on these N resource units; it may also obtain M data blocks first. Data blocks, and then determine N resource units based on these M data blocks; it is also possible to obtain M data blocks first, perform a part of processing in the execution process, and then determine N resource units, and then continue to analyze the M data blocks Other processing of the block.
  • step 110 includes: determining the number of resource units N and the information used to indicate the number of resource units N and the location of at least one of the N resource units contained in each data block. The corresponding N resource units.
  • the transmitter may first obtain M data blocks that need to be transmitted, and each data block may contain designated bits for indicating the number of resource units N and the location of at least one resource unit among the N resource units. According to the information contained in the M data blocks, the transmitter can determine the number N of resource units used to transmit the M data blocks and the positions of the N resource units. For example, the bit value of some bits in each data block can be used to indicate the number of resource units N and the position of N resource units, or the position of the start resource unit or the position of the last resource unit in the N resource units. ; For another example, some bits in each data block can be used to indicate which resource units are used to transmit the data block in the form of a bitmap. The transmitter can determine all the positions of the N resource units according to the bit values in each data block, and then use the N resource units to transmit M data blocks.
  • step 110 includes one of the following: randomly determining the number of resource units N and randomly selecting N resource units; determining the number of resource units N according to the number M of data blocks to be transmitted, and randomly selecting N resource units.
  • M is less than N, the resource unit is sufficient, then one data block can be repeatedly sent on multiple resource units; if M is greater than N, there are relatively few resource units, and multiple data blocks can be superimposed and sent on one resource unit Or alternatively, these M data blocks can be sent successively in the time domain.
  • step 120 includes: acquiring M data groups, and adding information indicating the number N of resource units and the position of at least one resource unit among the N resource units in each data group respectively. Information, generate M data blocks to be transmitted.
  • the transmitter may first determine N resource units, and then obtain M data groups to be sent, and add some bits on the basis of each data group to be sent to indicate the number of resource units N and N Information on the location of at least one resource unit in the resource units, thereby generating M data blocks.
  • some bits can be added to each data group to indicate the number (N-1) of other resource units used in addition to the resource unit used by the current data block, and indicate at least one of the N-1 resource units The location of a resource unit.
  • each data block includes designated bits, and the designated bits are used to indicate the number N of resource units and the information of the location of at least one resource unit among the N resource units.
  • each data block contains designated bits, and each data block carries information indicating the number N of resource units and the location of at least one resource unit among the N resource units.
  • the designated bit is an implicit indicator bit or an explicit indicator bit.
  • the designated bit can be an implicit indicator bit, that is, using data bits with existing meanings in the M data blocks to be transmitted, while carrying existing information, it implicitly indicates the number of resource units N and N Information about the location of at least one resource unit in the resource unit; it may also be an explicit indication bit, that is, an additional data bit added on the basis of the data group to be sent.
  • the designated bit is a data bit in common data, where the common data is data contained in all M data blocks.
  • the designated bits may be data bits in common data contained in M data blocks, that is, each data block contains the common data, and some data bits in the common data are used as designated bits. It is used to indicate the number of resource units N and the location of at least one resource unit in the N resource units.
  • the designated bit includes one of the following: a first bit used to indicate the number of resource units N, and a second bit used to indicate the position of at least one resource unit among the N resource units ; A third bit used to indicate the number of bit groups X, and X bit groups used to indicate the position of at least one of the N resource units, where X is an integer greater than or equal to 1; A first bitmap indicating the position of at least one resource unit in the N resource units; the fourth bit used to indicate the position of the first resource unit in the N resource units and the position of the last resource unit The fifth bit of the position.
  • the designated bit may include a first bit and a second bit, where the first bit is used to indicate the number of resource units N, and the second bit is used to indicate the position of at least one resource unit among the N resource units; or ,
  • the designated bit includes a third bit and at least one bit group, where the third bit is used to indicate the number of bit groups X, and the X bit groups are used to indicate the position of at least one resource unit among the N resource units; or, specify
  • the bits include the first bitmap, and the first bitmap is used to indicate the position of at least one resource unit among the N resource units; or, the designated bit includes the fourth bit and the fifth bit, and the fourth bit is used to indicate The position of the first resource unit among the N resource units, and the fifth bit is used to indicate the position of the last resource unit among the N resource units.
  • step 110 includes: the designated bit includes a first bitmap for indicating the position of at least one resource unit among the N resource units, and the value of the first bitmap is In the case where the value is all 0 or the number of the value 1 exceeds the specified value, the number of resource units N and the corresponding N resource units are determined according to a specified rule.
  • the designated bit includes the first bitmap, for example, the first bitmap is "01010101", where a value of 0 means that the resource unit at the corresponding position is not used, and a value of 1 means the resource unit at the corresponding position is used.
  • the first bitmap it can be determined that the number of resource units is 4, which are the second, fourth, sixth, and eighth resource units, respectively.
  • the bitmap method the number of resource units and the location of each resource unit can be indicated at the same time, that is, the number of resource units is implicitly indicated while indicating the location of the resource unit.
  • the specified rule can also be used to determine the number of resource units N and the corresponding N resource units. For example, when the values in the first bitmap are all 0, all resource units may be used to transmit data blocks, or a specified number of resource units at a specified location may be used to transmit data blocks, etc.
  • each data block also contains at least one of the following information: starting position information of available resource units; information about the number of available resource units.
  • each data block can indicate the number N of resource units used to transmit M data blocks and the position of at least one resource unit among the N resource units, and can also indicate the starting position information of the available resource units and / Or information on the number of available resource units.
  • the transmitter is not pre-configured with any available resource units, the transmitter determines the available resource units according to the indication information in the data block, or the transmitter determines the available resource units and adds the indication information to the data block.
  • a resource unit pool also called overall available resource unit
  • the available resource unit also called locally available resource unit
  • Resource unit or currently available resource unit determines the available resource unit from the resource unit pool and adds the indication information to the data block.
  • the transmitter determines N resource units for transmitting M data blocks from the available resource units, and the number of available resource units is greater than or equal to N.
  • the N resource units satisfy at least one of the following: the N resource units are located within the relevant bandwidth range; the N resource units are located within the relevant time range; the channels on the N resource units are related.
  • the N resource units used to transmit M data blocks are within a certain bandwidth range, or within a certain time range, or the channels on the N resource units are related, so that the N resource units The above channels have strong correlation, which simplifies receiver processing and implementation.
  • each data block further includes at least one of the following information: pilot information used on at least one of the N resource units; and at least one of the N resource units Sequence information used on the resource unit.
  • each data block also contains pilot information used on at least one resource unit among the N resource units, and/or sequence information used on at least one resource unit among the N resource units.
  • each data block may contain one of the following: pilot information used on N resource units; sequence information used on N resource units; pilot information and sequence information used on N resource units ; Pilot information used on the resource unit for transmitting the current data block; sequence information used on the resource unit for transmitting the current data block; pilot information and sequence information used on the resource unit for transmitting the current data block .
  • At least one of the M data blocks further includes identification information.
  • At least one data block also contains identification information for the receiver to identify the transmitter.
  • At least one of the M data blocks further contains valid data.
  • At least one data block also contains valid data, such as designated messages, service data, etc., for the receiver to obtain corresponding information after decoding and processing.
  • step 130 includes: separately processing the M data blocks, and then mapping them to corresponding resource units among the N resource units for transmission, wherein the processing includes at least one of the following : Coding, scrambling (including partial scrambling), modulation, extension, interleaving, precoding, superposition, etc.
  • the transmitter sends data blocks on one or more resource units, and the M data blocks sent on each resource unit are the same, that is, the transmitter sends the same data block D on each resource unit Send separately, thereby improving the transmission reliability in the case of contention-free scheduling transmission.
  • the transmitter may be a terminal.
  • the transmitter determines the number N of resource units used to transmit data blocks and the corresponding N resource units, and obtains the data block D to be transmitted on each resource unit, and then sends the data on each resource unit respectively Block D.
  • the transmitter may determine the number of resource units N and the corresponding N resource units according to designated bits in the data block D.
  • FIG. 2A is a schematic diagram of a designated bit according to an embodiment.
  • the transmitter can determine the number of resource units N according to the designated bit group 0 in the data block D (that is, the first bit in the designated bits), and N is greater than or equal to 1.
  • the designated bit group 0 may include A bits, and A is an integer greater than or equal to 1.
  • the value of A is related to the number of available resource units.
  • the transmitter may also determine the corresponding N resource units according to the designated bit groups 1 to N in the data block D (that is, the second bit in the designated bits).
  • the designated bit groups 1 to N may also include A bits respectively, and each bit group indicates the location information of a resource unit, and the location information may be an index of a resource unit.
  • the designated bit groups 1 to N may be consecutive N bit groups or discontinuous.
  • the bits in consecutive N bit groups are all different and can be used to indicate different position information, then these N bit groups can be used as designated bits to indicate N resource units respectively Location information.
  • the bit group may not be used to indicate a resource
  • the location information of the unit can be extended to determine whether the next bit group can be used to indicate the location information of the resource unit. If the bits in the next bit group and the previous bit group are not the same, it can be used to indicate The location information of a resource unit until N bit groups are used to indicate or determine the location of N resource units.
  • the resource unit of the position can be used to transmit data. In this case, the postponement may not be carried out.
  • the transmitter By indicating the number N of resource units and the location information of at least one resource unit among the N resource units in the data block D transmitted on each resource unit, a reliable basis is provided for the receiver to decode the data transmitted by each resource unit.
  • Fig. 2B is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter can determine the number of bit groups X according to the specified bit group 0 in the data block D (that is, the third bit in the specified bits), where X is greater than or equal to 1; and according to the data block D
  • the designated bit group 1 to X in the bit group determines the N resource units used to transmit the data block, where each bit group in the bit group 1 to X indicates the location information of a resource unit, and the location information can be the location information of a resource unit. index.
  • the designated bit group 0 indicates that the number of bit groups used to indicate the location of the resource unit is X, and the resource unit used to transmit the data block can be determined according to the X designated bit groups.
  • the resource unit used to transmit the data block can be determined according to the X designated bit groups.
  • FIG. 2B it is equivalent to jointly determining the number of resource units and the resource units used to transmit the data block according to the specified bit group 0 and the specified bit group 1 to X, that is, the resources used to transmit the data block are jointly determined
  • the number of units is N, and the positions of these N resource units.
  • the designated bit groups 1 to X may be consecutive X bit groups or discontinuous, for example, there is a designated interval between each bit group.
  • FIG. 2C is a schematic diagram of a designated bit according to still another embodiment.
  • the transmitter can determine the number of resource units N for transmitting the data block according to the designated bit group 0 in the data block D (that is, the first bit in the designated bit), where N is greater than or equal to 1;
  • the position of the first resource unit used to transmit the data block can be determined according to the designated bit group 1 in the data block D (that is, the second bit in the designated bits).
  • the transmitter can use N consecutive resource units. After determining the number N of resource units and the location of the first resource unit, the transmitter will determine from the N consecutive resource units starting from the first resource unit It is N resource units used to transmit data blocks. If N consecutive resource units cannot be obtained until the last available resource unit, the resource unit is obtained from the first resource unit, which is equivalent to obtaining N resource units cyclically, or the obtained N resource units are cyclic continuously.
  • the transmitter can also use N resource units with a specified interval. After determining the number of resource units N and the position of the first resource unit, the transmitter will start with the first resource unit with the specified interval.
  • the N resource units of are determined as N resource units for transmitting data blocks.
  • N resource units can be obtained cyclically among the available resource units. If the cyclically acquired resource unit is the same as the previously determined resource unit, the resource unit can be reused, or it can be postponed to the next resource unit that is different from the previously determined resource unit, and the resource unit is used as the reference to obtain the specified interval The next resource unit.
  • the specified interval may be preset or indicated by the specified bit group 2 in the data block D.
  • the designated bit group 1 can indicate the location of a resource unit designated by any one of the N resource units.
  • the location of the first resource unit is used for exemplary description.
  • the randomness of the positions of the N resource units will be worse, but the correlation of the channels on the N resource units will be better.
  • Fig. 2D is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter may determine the number of resource units used to transmit the data block and the corresponding resource units according to the first bitmap (BitMap).
  • the bitmap is composed of designated T bits in the data block D.
  • An example of this bitmap is "01010101", and a position with a value of 0 means that the resource at the corresponding position is not used Unit, a position with a value of 1 indicates that the resource unit at the corresponding position is used.
  • the number of resource units used to transmit data blocks is 4, which are the second, fourth, sixth, and eighth resource units, respectively. It can also be seen here that the number of resource units and the location of each resource unit can be indicated at the same time by using a bitmap method, or that the location of the resource unit is indicated while the number of resource units is implicitly indicated.
  • the first bitmap may come from data bits with existing meanings in the data, and is used to implicitly indicate the number and location information of resource units.
  • the number of resource units used to transmit the data block and the corresponding resource units can be determined according to a specified rule.
  • all resource units can be used, which is equivalent to bit inversion, and the obtained bits are all 1; or, use a specified number of resource units at a specified location, for example, use 1 resource unit at a specified location, use 2 resource units located at designated positions, use resource units at odd positions, use resource units at even positions, or use designated number of resource units at the front, back, or middle, etc.
  • the bits in the first bitmap are all 1 (or the number of 1 bits exceeds a certain number)
  • you can also follow the specified rules To determine the number of resource units used to transmit data blocks and the corresponding resource units. For example, use a specified number of resource units at a specified location.
  • the number N of resource units used to transmit data blocks may be limited, for example, let N be less than or equal to V, where V may be 1/2, 1/3, etc. of the number of available resource units.
  • bit group 0 containing 2 bits can be used to indicate the number of resource units, and each bit group indicating the location of the resource unit can still contain 3 bits, that is, bit group 0 and other bit groups contain The number of bits can be different.
  • the number of resource units N determined according to the bitmap composed of T bits is greater than V
  • the number of resource units can be determined according to the bitmap composed of bits at designated positions.
  • the bitmap composed of bits at designated positions For example, when the first bit is 0, a bitmap composed of V bits in an even position is used; when the first bit is 1, a bitmap composed of V bits in an odd position is used; Or, in the case where the first two bits are 00, 01, 10, or 11, use the bit positions consisting of V bits in odd positions, V bits in even positions, first V bits, or last V bits, respectively Figures, etc., that is, the designated bits in the first bitmap are used to indicate that a new bitmap is composed of bits at the designated positions, which is used to indicate the number and positions of resource units actually used.
  • Fig. 2E is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter can determine the position of the first resource unit among the N resource units used to transmit the data block according to the designated bit group 0 in the data block D (that is, the fourth bit in the designated bits);
  • the position of the last resource unit among the N resource units used to transmit the data block is determined according to the designated bit group 1 in the data block D (that is, the fifth bit in the designated bits).
  • the N resource units may be all consecutive resource units between the first resource unit and the last resource unit or resource units with a specified interval.
  • Fig. 2F is a schematic diagram of a designated bit according to another embodiment.
  • the designated bit group 0 (equivalent to the first bit in the designated bits) can indicate the starting position of the currently available resource unit (or locally available resource unit), and a bitmap composed of V bits (equivalent to The first bitmap in the designated bits) may correspond to the currently available resource unit. That is to say, the bitmap can correspond to V resource units located at designated positions starting from the resource unit indicated by bit group 0, and the bitmap is used to indicate the number and positions of resource units used to transmit data blocks.
  • the position of the first resource unit in the resource unit corresponding to the bitmap can be determined according to bit group 0, and the number of resource units used to transmit the data block and the size of each resource unit can be determined from the corresponding resource unit according to the bitmap.
  • Location the currently available resource units may be obtained cyclically among the available resource units (which may be the overall available resource units configured for the transmitter), or the bitmap may correspond to the available resource units cyclically. This embodiment helps to ensure that the channels on the N resource units used to transmit the data block are correlated.
  • this embodiment is also applicable to the situation where the overall available resource unit is unknown.
  • the starting position of the overall available resource unit can be determined according to the specified bit group 0, and the N for transmitting the data block can be determined from the corresponding resource unit according to the bitmap. Resource units.
  • the designated bit group 0, the designated bit group 1,..., etc. start from the head of the data block D, and may also start from the end or a designated position of the data block D, and are distributed according to a designated rule. For example, starting from the end of the data block D, the direction from the end to the head can be designated bit group 0, designated bit group 1, ..., etc., respectively.
  • the designated bit group 1 and the designated bit group 0 can be adjacent or non-adjacent.
  • the designated bit group 1 can start from the designated position, or between the designated bit group 1 and the designated bit group 0 There are specified intervals.
  • the first bitmap can also start from a specified position and be distributed according to a specified rule.
  • the T bits at the tail of the data block D indicate the usage of each available resource unit from the tail to the head, or indicate the usage of each available resource unit from the head to the tail.
  • the number of resource units N-1 can be indicated by the designated bit of the data block, which means that in addition to the resource unit used by the current data block, other N-1 resource units are also used.
  • the number of resource units may not be indicated, and only the location information of at least one resource unit among the N resource units may be indicated.
  • the bitmap can also be used to indicate a resource pattern, where the resource pattern can be pre-configured or semi-statically configured, or it can be obtained according to a specified rule, for example, the available resource units are combined to obtain a specified Combination.
  • the data block D may contain valid data (Payload), such as business data, designated messages, and so on.
  • Payment such as business data, designated messages, and so on.
  • the data block D may also contain the identification information of the transmitter, so that the receiver can know which transmitter sent the data after decoding the data.
  • the data block D can be uncoded, pre-coded or post-coded data block.
  • the designated bits in the above embodiment can be from at least one of the valid data data bits in the data block D, the data bits carrying the transmitter's identification information, etc. Although these data bits have existing meanings, they can be used It implicitly indicates or carries the number of resource units N and the location information of at least one resource unit among the N resource units.
  • the data block D may also carry pilot (for example, preamble, pilot, reference signal, etc.) information and sequences (for example, spreading sequence, interleaving sequence, scrambling sequence, sequence) used on N resource units. Collection, etc.) At least one of information, etc. Carrying this information can provide a reliable basis for the receiver to process. After the receiver correctly decodes the data on a resource unit, it can reconstruct the transmitted symbols and eliminate interference based on this information to assist in other resource units. The data on the decoding.
  • pilot for example, preamble, pilot, reference signal, etc.
  • sequences for example, spreading sequence, interleaving sequence, scrambling sequence, sequence
  • the data block D may only carry the pilot information or the sequence information.
  • the bits carrying pilot information, sequence information, etc. may be in the form of a bit group similar to any of the foregoing embodiments, or may be in the form of a bitmap similar to any of the foregoing embodiments.
  • the bits carrying pilot information, sequence information, etc. may come from data bits with existing meanings in the data, and the pilot information, sequence information, etc. are indicated in an implicit manner.
  • the bits carrying pilot information, sequence information, etc. may also be additional bits.
  • the transmitter first determines the pilot information, sequence information, etc. it uses on each resource unit. For example, it can be determined by random generation or random selection. Then, the transmitter adds additional information to the data to be sent. The corresponding bits indicate pilot information, sequence information, etc. in an explicit manner.
  • bit multiplexing may be further considered, that is, several bits are used to indicate or carry multiple types of information at the same time.
  • the available resource units may include multiple resource units in the frequency domain, multiple resource units in the time domain, or multiple resource units in the time-frequency domain.
  • the channels on the available resource units are related, or the available resource units are located within the relevant bandwidth and/or relevant time range. In an embodiment, the channels on the multiple resource units used to transmit the data block are related, or located within the relevant bandwidth and/or the relevant time range.
  • the available resource unit may be pre-configured or determined according to a preset rule.
  • the available resource unit can be determined autonomously by the transmitter, and the starting position, number, or range of the available resource unit is unknown to the receiver.
  • the available resource unit can be sent by the transmitter.
  • the data block carries the starting position information of the available resource unit, for example, the offset of the first resource unit or the specified position relative to the entire bandwidth, or the index of the starting resource unit, etc.; the same as that shown in FIG. 2F can be used.
  • the example is similar; the number of available resource units can also be carried in the data block; the starting position, number, or range of the available resource units can be indicated implicitly or explicitly.
  • the transmitter sends the data block D on N resource units respectively, which can form N transmissions.
  • N resource units are N resource units in the time domain (the positions in the frequency domain are the same or different)
  • the N transmissions can be composed of first transmission and retransmission, and the transmitter can determine whether to perform retransmission, for example, according to the time domain interval of N resource units or other designated bits to determine whether a certain retransmission is performed.
  • the transmitter may transmit the data block D after performing low bit rate encoding on N resource units.
  • the indication overhead can be saved.
  • the transmitter will send data on one or more resource units.
  • the M data blocks sent by the transmitter on each resource unit are the same, that is, the transmitter sends the same data block D on each resource unit separately. Thereby improving the transmission reliability in the case of contention-free scheduling transmission.
  • the transmitter first determines the number of resource units used to transmit the data block and the corresponding resource units.
  • the transmitter may randomly select the number and location of resource units for transmitting data blocks. For example, suppose there are 8 available resource units, the number of resource units randomly selected by the transmitter is 3, and the positions or indexes of 3 resource units are randomly selected from the 8 available resource units, such as resource units 1, 3, and 6, respectively. . Then, the transmitter obtains the data block D to be transmitted on each resource unit, and sends the data block D on each resource unit respectively.
  • Fig. 3A is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter first obtains the data group to be sent, and adds bit group 0 (that is, the first bit in the designated bit) to the data group, which is used to indicate the number of resource units N, and in the data group Bit groups 1 to N (that is, the second bit in the designated bits) are added to the bits, which are respectively used to indicate the location information of each resource unit.
  • the location information may be an index of a resource unit, thereby forming a data block D.
  • the number of bits contained in bit group 0 and bit group 1 to N may be different.
  • the number of resource units used by multiple transmitters may be different. Then, the size of the data block finally formed by multiple transmitters may be different. In this case, you can Consider performing bit stuffing so that the size of the data block of each transmitter is the same.
  • the number and location of resource units used by the transmitter are unknown. In addition, it is also uncertain which resource unit the data block transmitted on which can be decoded correctly. An indication is given in the data block D transmitted on each resource unit, so that the receiver can decode the data transmitted on each resource unit.
  • FIG. 3B is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter first obtains the data group to be sent, and adds bit group 0 (that is, the third bit in the specified bit) to the data group to indicate the number of bit groups X, and in the data group Bit groups 1 to X are added to indicate the number of resource units N and the location information of at least one resource unit.
  • bit group 0 that is, the third bit in the specified bit
  • Bit groups 1 to X are added to indicate the number of resource units N and the location information of at least one resource unit.
  • FIG. 3C is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter acquires a data group to be sent, and adds a first bitmap to the data group to indicate the number of resource units and the location of each resource unit, thereby forming a data block D.
  • the first bitmap is composed of T bits.
  • the number of resource units and the location of each resource unit can be indicated at the same time, or the location of the resource unit is indicated while the number of resource units is implicitly indicated.
  • the bitmap to indicate N resource units, there is a smaller and more fixed indication overhead.
  • the first resource unit used is resource unit 2, and resource units 2, 3, and 4 are determined as 3 resource units for transmitting data blocks. Then, the transmitter obtains the data block D to be transmitted on each resource unit, and sends the data block D on each resource unit respectively.
  • Fig. 3D is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter obtains the data group to be sent, and adds bit group 0 (that is, the first bit in the designated bit) to the data group, which is used to indicate the number of resource units N, and the data group is still in the data group.
  • Add bit group 1 (that is, the second bit in the designated bits) to indicate the location information of the first resource unit used to transmit the data block.
  • the location information can be an index of a resource unit to form a data block D .
  • N resource units with a specified interval starting from the determined first resource unit may also be determined as the N resource units used to transmit the data block.
  • the specified interval may be preset, or a bit group 2 is added to the data group to be sent for indication.
  • N resource units can be acquired cyclically among the available resource units.
  • the location of a specified resource unit among the N resource units can also be determined and indicated by bit group 1.
  • the location of the first resource unit is determined and an indication is given for exemplary explanation.
  • FIG. 3E is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter can add a designated bit group 0 (that is, the fourth bit in the designated bits) to the data group to be sent, which is used to indicate the first of the N resource units used to transmit the data block.
  • the position of the resource unit; the designated bit group 1 (that is, the fifth bit in the designated bit) is added to indicate the position of the last resource unit among the N resource units used to transmit the data block.
  • the N resource units used by the transmitter may be all consecutive resource units between the first resource unit and the last resource unit or resource units with a specified interval.
  • the number N of resource units used to transmit data blocks may be limited, for example, let N be less than or equal to V, where V may be 1/2, 1/3, etc. of the available resource units.
  • Fig. 3F is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter acquires the data group to be sent, and adds bit group 0 (that is, the first bit in the designated bit) to the data group, which is used to indicate the starting position information of the currently available resource unit (that is, the first bit).
  • the location information of a resource unit and add a bitmap (that is, the first bitmap in the specified bit) to the data group, which is used to indicate the number of resource units used to transmit data blocks in the currently available resource units And the location of each resource unit to form a data block D.
  • This embodiment also has a smaller and relatively fixed indication overhead, which helps to ensure that the channels of multiple resource units used to transmit data blocks are related, and the location of the resource units has better randomness.
  • the number of resource units N-1 may be carried in the data block, which means that in addition to the current resource unit, other N-1 resource units are used.
  • the number of resource units used by the transmitter to transmit data blocks may be fixed. Then, it is not necessary to add additional bits in the data group to be sent to indicate the number of resource units N, but only need to increase bits to indicate at least one The location of the resource unit is sufficient.
  • the transmitter uses all available resource units for transmission, so it is not necessary to add additional bits in the data to be sent to indicate the number and positions of resource units.
  • the added bits can be added to the head of the data block D, or can be added to the end of the data block D or at a designated position, and are distributed according to a designated rule. For example, it is added at the end of the data block D, from the tail to the head, it can be bit group 0, bit group 1, ... etc. respectively.
  • the bitmap can also be added at a specified position and distributed according to a specified rule. For example, adding T bits to the tail of the data group to be sent, indicating the usage of each available resource unit from the tail to the head, or indicating the usage of each available resource unit from the head to the tail.
  • the data group to be sent may contain valid data, such as service data, designated messages, and so on.
  • the to-be-sent data group may also contain the identity information of the transmitter, so that the receiver can know which transmitter sent the data after decoding the data.
  • the data group to be sent can be uncoded, pre-coded or post-coded data blocks.
  • the data block D may also carry pilot (for example, preamble, pilot, reference signal, etc.) information and sequences (for example, spreading sequence, interleaving sequence, scrambling sequence, sequence) used on N resource units. Collection, etc.) At least one of information, etc. Carrying this information is helpful for the receiver to correctly decode the data on one resource unit and then use it for transmission symbol reconstruction and interference cancellation, and for assisting the decoding of data on other resource units.
  • the data block can carry pilot information, sequence information, etc. used on N resource units, or the data block sent on the nth resource unit can only carry pilot information, sequence information, etc.
  • the data block D may only carry the pilot information or the sequence information.
  • the bits carrying pilot information, sequence information, etc. may be in the form of a bit group in any of the foregoing embodiments, or may be in the form of a bitmap in any embodiment.
  • the bits carrying pilot information, sequence information, etc. may come from data bits with existing meanings in the data, and the pilot information, sequence information, etc. are indicated in an implicit manner.
  • the bits carrying pilot information, sequence information, etc. may also be additional bits.
  • the transmitter first determines the pilot information, sequence information, etc. it uses on each resource unit. For example, it can be determined by random generation or random selection. Then, the transmitter adds additional information to the data to be sent. The corresponding bits indicate pilot information, sequence information, etc. in an explicit manner.
  • bit multiplexing may be further considered, that is, several bits are used to indicate or carry multiple types of information at the same time.
  • the channels of the multiple resource units used to transmit the data block determined by the transmitter are related, or are located within a related bandwidth and/or a related time range.
  • the transmitter can achieve this by imposing certain controls or implementing it in accordance with specified rules.
  • the transmitter transmits data on one or more resource units.
  • the transmitter will send M different data blocks on the multiple resource units, thereby increasing the transmission capacity in the case of contention-free scheduling transmission.
  • the transmitter determines the number N of resource units used to transmit M data blocks and the corresponding N resource units, obtains the M data blocks to be transmitted on each resource unit, and then performs the operation on each resource unit respectively. send.
  • the transmitter will respectively send data blocks D_1, D_2,..., D_M on N resource units. Part of the data in these M data blocks may be the same, which is called common data.
  • the public data in the M data blocks can be used to carry information about the number of resource units N and the position of at least one resource unit in the N resource units, and can also be used to carry pilot information, sequence information, and the like.
  • Fig. 4A is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter can determine the number of resource units N according to the specified bit group 0 in the public data (that is, the first bit in the specified bits), where N is greater than or equal to 1, and can also be based on the specified bit group in the public data.
  • Specify bit groups 1 to N that is, the second bit of the specified bits to determine the positions of the corresponding N resource units, and then the transmitter can place the data blocks D_1, D_2,..., D_M in the N resource units respectively Send on.
  • Fig. 4B is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter can determine the number of bit groups X according to the specified bit group 0 (that is, the third bit in the specified bits) in the public data, and X is greater than or equal to 1, and can also be based on the specified bit group in the public data.
  • Bit groups 1 to X determine N resource units used to transmit data blocks. If the bits in a bit group and a bit group before it are the same, then the two will indicate the same position. This bit group will not be used to indicate the position information of a resource unit, and no bit will be performed. Postponement of the group.
  • the transmitter transmits the data blocks D_1, D_2,..., D_M on N resource units respectively.
  • Fig. 4C is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter can determine the number of resource units N for transmitting the data block according to the specified bit group 0 in the public data (that is, the first bit in the specified bits), where N is greater than or equal to 1;
  • the designated bit group 1 in the public data (that is, the second bit in the designated bits) determines the position of the first resource unit used to transmit the data block.
  • the transmitter uses N consecutive resource units starting from the resource unit, or uses N consecutive resource units starting from the resource unit with a specified interval. Wherein, the specified interval may be preset or indicated by the specified bit group 2 in the common data.
  • N resource units can be obtained cyclically among the available resource units.
  • the transmitter transmits the data blocks D_1, D_2,..., D_M on N resource units respectively.
  • the receiver After decoding a certain data block on a certain resource unit, the number N of resource units used by the transmitter and the position of the first resource unit can be obtained, so that it can be based on this information and the current resource The unit derives other resource units used by the transmitter, and then can further decode the data blocks transmitted on these resource units.
  • Fig. 4D is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter may determine the number of resource units N and the corresponding N resource units for transmitting the data block according to the first bitmap in the common data.
  • the bitmap is composed of designated T bits in the common data. Then, the transmitter transmits the data blocks D_1, D_2,..., D_M on N resource units respectively.
  • the number of resource units N and the corresponding N resource units for transmitting the data block can be determined according to a specified rule.
  • the bits in the bitmap are all 1 (or the number of 1 bits exceeds a certain number), if you do not want to use all resource units (or do not want to use more than a certain number of resource units), you can also determine according to the specified rules The number of resource units used to transmit data blocks N and the corresponding N resource units.
  • Fig. 4E is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter can determine the position of the first resource unit used to transmit the data block according to the specified bit group 0 in the public data (that is, the fourth bit in the specified bit); according to the specified bit in the public data Group 1 (that is, the fifth bit in the designated bits) determines the position of the last resource unit used to transmit the data block.
  • the N resource units used by the transmitter may be all consecutive resource units between the first resource unit and the last resource unit or resource units with a specified interval.
  • the number N of resource units used to transmit data blocks may be limited, for example, let N be less than or equal to V, where V may be 1/2, 1/3, etc. of the available resource units.
  • Fig. 4F is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter can determine the starting position of the currently available resource unit corresponding to the bitmap according to the specified bit group 0 in the public data (that is, the first bit in the specified bit), or according to the public data
  • a bitmap composed of V bits determines the number of resource units N used for transmitting the data block and the location of each resource unit from the corresponding currently available resource units. Then, the transmitter transmits the data blocks D_1, D_2,..., D_M on N resource units respectively.
  • the data blocks D_1, D_2,..., D_M may respectively contain valid data, such as service data, designated messages, and so on.
  • the valid data contained in the M data blocks may be different.
  • the M data blocks may also contain the identification information of the transmitter, so that the receiver can know which transmitter sent the data after decoding the data.
  • the public data in the M data blocks is composed of data that all these data blocks need to carry, for example, it may include the identification information of the transmitter, a certain designated message, and the like.
  • the M data blocks may be uncoded, pre-coded, or post-coded data blocks.
  • M is equal to N
  • the transmitter may send data blocks D_1, D_2,..., D_N on N resource units respectively, and send one data block on each resource unit.
  • M is less than N, and the transmitter can send at least one data block on multiple resource units, which is beneficial to improve transmission reliability.
  • M is greater than N, and the transmitter may use superimposed transmission to send multiple data blocks on at least one resource unit.
  • the transmitter may first transmit part of the data blocks of the M data blocks on the N resource units, and the remaining data blocks may be transmitted at the subsequent transmission time.
  • the data blocks D_1, D_2,..., D_M may also carry at least one of N resource units or pilot information and sequence information used on the current transmission resource unit. It can be implicitly indicated through public data or other data bits with existing meanings, or additional bits can be added to each data block to explicitly indicate pilot information, sequence information, etc.
  • only one of the data blocks may carry the identity identification information of the transmitter, and the other data blocks may not carry the identification information or carry the identification Part of the information, or carry a small amount of identity verification information.
  • the receiver can consider blind decoding and try to decode the two data block sizes separately.
  • valid data may not be carried in the data block carrying the transmitter identification information, and valid data may be carried in other data blocks. In an embodiment, it can be guaranteed that the sizes of different data blocks are consistent.
  • the transmitter will send data on one or more resource units.
  • the transmitter will send M different data blocks on the multiple resource units, thereby increasing the transmission capacity in the case of contention-free scheduling transmission.
  • the transmitter first determines the number N of resource units used to transmit M data blocks and the corresponding N resource units. Then, the transmitter obtains the M data blocks to be transmitted on the N resource units, and transmits them on the N resource units respectively.
  • the transmitter may randomly select the number N of resource units for transmitting M data blocks from the available resource units, and randomly select the positions or indexes of the N resource units.
  • the number of data blocks that the transmitter needs to transmit is N
  • the number of resource units used to transmit the data block is determined to be N according to the number N
  • the positions or indexes of the N resource units are randomly selected.
  • Fig. 5A is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter first obtains the data groups E_1, E_2,..., E_M to be sent. These data groups will be transmitted on N resource units respectively, and then the transmitter will add data groups to these data groups.
  • Bit group 0 that is, the first bit in the designated bits
  • bit groups 1 to N that is, the second bit in the designated bits
  • the added bits in each data block are the same.
  • FIG. 5B is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter obtains the data groups E_1, E_2,..., E_M to be sent, and adds bit group 0 (that is, the third bit of the designated bits) to these data groups, respectively, to indicate the bit group
  • bit groups 1 to X are respectively added to these data groups to indicate the number of resource units and the location information of at least one resource unit, thereby forming data blocks D_1, D_2,...,D_M.
  • FIG. 5C is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter obtains the data groups E_1, E_2,..., E_M to be sent, and adds the first bitmap to these data groups respectively, which is used to indicate the number of resource units N and the corresponding N resources The location of the unit, thereby forming data blocks D_1, D_2,...,D_M.
  • the transmitter may randomly select the number N of resource units from the available resource units, and randomly select the position or index of the first resource unit for transmission, and combine N consecutive resources from the resource unit A unit or N resource units with a specified interval are determined as N resource units for transmission.
  • Fig. 5D is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter obtains the data groups E_1, E_2,..., E_M to be sent, and adds bit group 0 (that is, the first bit of the designated bits) to these data groups, respectively, to indicate the resource unit
  • bit group 0 that is, the first bit of the designated bits
  • the number N, and bit group 1 that is, the second bit in the designated bits
  • D_1, D_2, ...,D_M is added to these data groups respectively, which is used to indicate the position information of the first resource unit used for transmission, thereby forming data blocks D_1, D_2, ...,D_M.
  • the designated interval may be preset, or a bit group 2 is added to these data groups to indicate the designated interval.
  • the receiver After decoding a certain data block on a certain resource unit, the number N of resource units used by the transmitter and the position of the first resource unit can be obtained, so that it can be based on this information and the current resource
  • the unit derives other resource units used by the transmitter, and then can further decode the data blocks transmitted on these resource units.
  • the number N of resource units used for transmission may be limited, for example, N is less than or equal to V, where V may be 1/2, 1/3, etc. of the available resource units.
  • the transmitter may randomly select a resource unit from the available resource units as the starting resource unit, and use the V resource units at the specified position starting from the resource unit as the currently available resource unit. Then, the transmitter determines the number of resource units used for transmission N and the corresponding resource units from these currently available resource units.
  • Fig. 5E is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter obtains the data groups E_1, E_2,..., E_M to be sent, and adds bit group 0 (that is, the first bit of the designated bits) to these data groups respectively to indicate the current available
  • bit group 0 that is, the first bit of the designated bits
  • the starting position information of the resource unit that is, the position information of the first resource unit
  • bitmaps that is, the first bitmap in the designated bits
  • the number of resource units used for transmission and the location of each resource unit in the data block form data blocks D_1, D_2,...,D_M.
  • FIG. 5F is a schematic diagram of a designated bit according to another embodiment.
  • the transmitter obtains data groups E_1, E_2,..., E_M to be sent, and adds bit group 0 (that is, the fourth bit of the designated bits) to these data groups, respectively, to indicate N
  • bit group 0 that is, the fourth bit of the designated bits
  • bit group 1 that is, the fifth bit in the designated bits
  • the N resource units used by the transmitter may be all consecutive resource units between the first resource unit and the last resource unit or resource units with a specified interval.
  • the transmitter obtains the data groups E_1, E_2,..., E_M to be sent, and adds bit group 0 to these data groups respectively to indicate the number of resource units N or N-1 (the two can be considered equivalent ), adding N-1 bit groups to these data groups respectively, which are respectively used to indicate the location information of other resource units other than the current resource unit, thereby forming data blocks D_1, D_2,...,D_M.
  • the added bits in each data block are different.
  • the number of resource units used by the transmitter for transmission may be fixed. Then, there is no need to add additional bits in the data to be sent to indicate the number of resource units, but only need to add bits to indicate the location of the resource unit.
  • the transmitter uses all available resource units for transmission, so it is not necessary to add additional bits in the data to be sent to indicate the number and positions of resource units.
  • the data blocks D_1, D_2,..., D_M may respectively contain valid data, such as service data, designated messages, and so on.
  • the valid data contained in the M data blocks may be different.
  • the M data blocks may also contain the identification information of the transmitter, so that the receiver can know which transmitter sent the data after decoding the data.
  • the M data blocks may be uncoded, pre-coded, or post-coded data blocks.
  • M is equal to N
  • the transmitter obtains the data groups E_1, E_2,..., E_N to be sent, and adds the above-mentioned indicator bits to these data groups respectively to form data blocks D_1, D_2,..., D_N, and then send these N data blocks on N resource units respectively, and send one data block on each resource unit.
  • M is less than N, and the transmitter can send at least one data block on multiple resource units, which is beneficial to improve transmission reliability.
  • M is greater than N, and the transmitter may use superimposed transmission to send multiple data blocks on at least one resource unit.
  • the transmitter may first transmit part of the data blocks of the M data blocks on the N resource units, and the remaining data blocks may be transmitted at the subsequent transmission time.
  • different indicator bits may be added on the basis of a data group to form multiple data blocks, which are respectively transmitted on different resource units.
  • the data blocks D_1, D_2,..., D_M may also carry at least one of N resource units or pilot information and sequence information used on the current transmission resource unit.
  • the pilot information, sequence information, etc. can be indicated implicitly or explicitly.
  • only one of the data blocks may carry the identity identification information of the transmitter, and the other data blocks may not carry the identification information or carry the identification Part of the information, or carry a small amount of identity verification information.
  • the receiver may consider blind decoding, and try to decode the two data block sizes separately.
  • valid data may not be carried in the data block carrying the transmitter identification information, and valid data may be carried in other data blocks. In an embodiment, it can be guaranteed that the sizes of different data blocks are consistent.
  • the transmission capacity can be improved. , Which is conducive to controlling the resource units used and giving effective instructions, but it will increase the instruction overhead.
  • the K transmitters T_1, T_2,..., T_K respectively transmit data according to the method in any of the foregoing embodiments, where K is an integer greater than or equal to 1.
  • Each transmitter determines the number N of resource units used for transmission and the corresponding N resource units.
  • the k-th transmitter T_k determines that the number of resource units used for transmission is N_k, and accordingly determines the positions or indexes of N_k resource units, where k is an integer greater than or equal to 1 and less than or equal to K.
  • the number of resource units determined by the K transmitters may be the same or different, and the positions of the resource units determined correspondingly may be the same, or partially the same, or different.
  • Each transmitter also obtains the data to be transmitted on the determined resource unit, and transmits the data on the determined resource unit.
  • the data sent by each transmitter includes the following information: information used to indicate the number N of resource units and the location of at least one resource unit among the N resource units.
  • each transmitter also determines at least one of its pilot information, sequence information, etc. on each resource unit used for transmission.
  • the data sent by each transmitter also includes the following information: valid data, such as service data, designated messages, and so on.
  • the data sent by each transmitter further includes the following information: the identity information of the transmitter.
  • the data sent by each transmitter further includes at least one of the following information: pilot information; sequence information, etc.
  • the information contained in the data sent by each transmitter is the information used by the transmitter.
  • K transmitters respectively perform data transmission on one or more resource units determined respectively.
  • the data sent by the transmitter is With a high probability, it can be successfully decoded by the receiver, and then the receiver can obtain information such as other resource units used by the transmitter from the decoded data, and use this information to process the data on these resource units (such as detection, decoding, etc.) , Channel estimation, interference cancellation, etc.), so as to improve the reliability of data transmission, improve the transmission performance in collision situations, and improve the performance and capacity of competition-free scheduling transmission.
  • the embodiment of the present application also provides a data transmission method, which is applied to a receiver.
  • the transmitter uses N resource units to transmit M data blocks, and each data block carries information about the number of resource units N and the location of at least one resource unit in the N resource units, so as to provide a reliable basis for receiver processing.
  • the receiver can obtain information such as the resource unit used by the transmitter from the decoded data, and use this information to comprehensively process the data on these resource units, thereby improving the reliability of data transmission. Improve the transmission performance in the presence of collisions, and improve the performance and capacity of competition-free scheduling transmission.
  • FIG. 6 is a flowchart of a data transmission method provided in another embodiment. As shown in FIG. 6, the method provided in this embodiment includes step 210 and step 220.
  • step 210 the resource unit to be detected is determined.
  • step 220 a detection is performed on the resource unit to be detected to obtain a first detection result, where the first detection result includes at least one data block among M data blocks, and the first detection result includes Contains information indicating the number N of resource units used to transmit the M data blocks and the location of at least one resource unit in the N resource units, where M is an integer greater than or equal to 1, and N is greater than or equal to An integer of 1.
  • the receiver can determine the resource units to be detected among all available resource units configured, and detect the received symbols on these resource units. If at least one of the M data blocks can be obtained through the detection, And the indication information (indicating the number N of resource units used for transmitting M data blocks and the position of at least one resource unit among the N resource units) is obtained, and the N resource units can be detected and processed continuously according to this.
  • the first detection result further includes at least one of the following information: starting position information of available resource units; information about the number of available resource units; pilots on at least one of the N resource units Information; sequence information on at least one of the N resource units; identification information; valid data.
  • the first detection result in addition to indicating the number of resource units N and the location of at least one of the resource units, the first detection result can also include the starting position information of the available resource units, the number of available resource units, etc., based on which the receiver can Determine the scope of the resource unit to be detected; it can also include the pilot information and sequence information used by a certain transmitter on at least one resource unit, so that the receiver can accurately obtain the corresponding information used by the transmitter; it can also include Based on the identification information, the receiver can determine which transmitter sent the data it is receiving; it can also include valid data, and the receiver can realize the corresponding service processing through decoding and processing.
  • step 220 includes:
  • it further includes:
  • Step 230 According to the information indicating the number of resource units N used for transmitting the M data blocks and the position of at least one resource unit among the N resource units contained in the first detection result, determine the to-be-processed Resource unit, or update the resource unit to be detected.
  • the receiver can determine the next resource unit to be detected or the resource to be further processed according to the number N of resource units indicated by the first detection result and the position of at least one resource unit among the N resource units. unit.
  • the following processing may be performed: detection, reconstruction, channel estimation, and interference cancellation.
  • it further includes:
  • Step 240 Perform reconstruction according to the first detection result to obtain a reconstructed symbol.
  • Step 250 Perform channel estimation on the channel on at least one of the N resource units according to the reconstructed symbols to obtain a channel estimation result.
  • it further includes:
  • Step 260 Perform interference cancellation on the received symbol on the at least one resource unit according to the reconstructed symbol and the channel estimation result to obtain a received symbol after interference cancellation.
  • Step 270 Detect the received symbols after the interference cancellation, and obtain a second detection result.
  • the received symbol may be the first received symbol on at least one resource unit, or the received symbol without interference cancellation.
  • interference cancellation can be performed on the received symbol, and further detection can be performed to obtain the second detection result, so that better detection performance can be obtained, and comprehensive and reliable reception processing can be achieved.
  • it further includes:
  • Step 280 According to the channel estimation result, detect the received symbol on the at least one resource unit to obtain a third detection result.
  • the received symbol may be a received symbol without interference cancellation, or a symbol after interference cancellation (for example, a symbol after interference cancellation last time or a symbol after interference cancellation this time).
  • the received symbols on at least one resource unit can be further detected to obtain the third detection result, so that better detection performance can be obtained and comprehensive and reliable reception processing can be achieved.
  • the K transmitters respectively transmit on one or more resource units determined respectively, and after channel transmission, arrive at the receiving end, and the receiver detects and decodes the received signal.
  • K is an integer greater than or equal to 1.
  • the transmitter may be a terminal device or a user equipment
  • the receiver may be a base station device.
  • the receiver determines P available resource units as resource units to be detected, and performs detection on the P available resource units respectively to obtain Q detection results.
  • P is an integer greater than or equal to 1
  • Q is an integer greater than or equal to 0.
  • Q is related to factors such as the number of transmitters and the resources used by each transmitter.
  • the receiver may obtain the following information: the number of resource units N and the location information of at least one resource unit among the N resource units. The information is information about the number N of resource units used for transmission by a transmitter and the location of at least one resource unit among the N resource units.
  • the receiver can determine the number of resource units N used by the transmitter and the positions of the N resource units according to the acquired information, so that it can determine other resource units that need to be processed for the transmitter, where ,
  • the processing includes at least one of detection, decoding, channel estimation, interference cancellation, and the like.
  • the receiver may also obtain the following information from the detection result: valid data, such as service data, designated messages, and so on.
  • the receiver may also obtain the following information from the detection result: the identity information of the transmitter.
  • the receiver may also obtain at least one of the following information from the detection result: pilot information; sequence information, etc.
  • the receiver may perform blind decoding on the received data, and try to decode various data block sizes separately. For example, among the multiple data blocks sent by the transmitter, some of the data blocks carry identification information, and some do not carry identification information or carry part of the identification information, so that the multiple data blocks have different sizes.
  • the receiver may also reconstruct the symbols sent by the transmitter to obtain reconstructed symbols.
  • the receiver may also use the reconstructed symbols to perform channel estimation, and obtain the channel estimation result on at least one resource unit among the N resource units. This process can at least be used to obtain the channel estimation result of the resource unit corresponding to the current detection result, and can also be used to obtain the channel estimation result on other resource units.
  • the receiver may also perform interference cancellation on received symbols on at least one resource unit among the N resource units according to the reconstructed symbols and the channel estimation result to obtain updated received symbols.
  • This process can at least be used for interference cancellation on the received symbols on the resource unit corresponding to the current detection result, and can also be used for interference cancellation on the received symbols on other resource units.
  • the above-mentioned updated received symbols are used for the receiver to perform a new round of detection on the corresponding resource unit to obtain a new detection result.
  • the above-mentioned channel estimation result is used for the receiver to detect the above-mentioned other resource units that need to be detected to obtain a new detection result.
  • the receiver does not know the starting position, number, or range of the available resource units, and the receiver may determine at least one possible available resource unit as the resource unit to be detected, and perform the detection. After obtaining the detection result on a certain resource unit, the receiver can obtain the following information from the detection result: the number of resource units N and the location of at least one resource unit among the N resource units; and the following information: available resource unit The starting position information. In an embodiment, the receiver may also obtain the following information from the detection result: information about the number of available resource units.
  • the receiver iteratively executes at least a part of the above-mentioned processing procedures.
  • detection results can be represented by the same parameter or variable in implementation.
  • FIG. 7 is a schematic structural diagram of a data transmission device provided by an embodiment. As shown in FIG. 7, the data transmission device includes: a resource determination module 310, a data block acquisition module 320, and a transmission module 330.
  • the resource determining module 310 is configured to determine the number N of resource units and the corresponding N resource units, where N is an integer greater than or equal to 1;
  • the data block acquisition module 320 is configured to acquire M data blocks to be transmitted, where M is an integer greater than or equal to 1, wherein each data block contains the number N and the N resource units indicating the number of resource units. Information about the location of at least one resource unit in;
  • the transmission module 330 is configured to transmit the M data blocks on the N resource units.
  • the data transmission device of this embodiment transmits M data blocks by using N resource units, and each data block carries information about the number of resource units N and the location of at least one resource unit in the N resource units, and is a receiver Processing provides a reliable basis. On this basis, the receiver can obtain information such as the resource units used by the transmitter from the decoded data, and use this information to comprehensively process the data on these resource units, thereby improving the reliability of data transmission and improving The transmission performance in the presence of collisions improves the performance and capacity of competition-free scheduling transmission.
  • the resource determining module 310 is configured to:
  • the resource determining module 310 is set to one of the following:
  • the number N of resource units is determined according to the number M of data blocks to be transmitted, and N resource units are randomly selected.
  • the data block acquisition module 320 is configured to:
  • Acquire M data groups respectively add information indicating the number N of resource units and the location of at least one resource unit among the N resource units in each data group, and generate M data blocks to be transmitted.
  • each data block includes designated bits, and the designated bits are used to indicate the number N of resource units and the information of the location of at least one resource unit among the N resource units.
  • the designated bit is an implicit indicator bit or an explicit indicator bit.
  • the designated bit is a data bit in common data, where the common data is data contained in all M data blocks.
  • the designated bit includes one of the following:
  • a first bitmap used to indicate the location of at least one resource unit in the N resource units
  • the fourth bit is used to indicate the position of the first resource unit among the N resource units and the fifth bit is the position of the last resource unit.
  • the resource determining module 310 is configured to:
  • the designated bit includes a first bitmap for indicating the position of at least one resource unit in the N resource units, and the value of the first bitmap is all 0 or the number of values 1 exceeds In the case of a specified value, the number of resource units N and the corresponding N resource units are determined according to the specified rule.
  • each data block also contains at least one of the following information:
  • the starting position information of the available resource unit
  • the N resource units satisfy at least one of the following:
  • the N resource units are located within the relevant bandwidth range
  • the N resource units are located in a relevant time range
  • the channels on the N resource units are related.
  • each data block also contains at least one of the following information:
  • Sequence information used on at least one resource unit among the N resource units is used on at least one resource unit among the N resource units.
  • At least one of the M data blocks further includes identification information.
  • At least one of the M data blocks further includes valid data.
  • the data transmission device proposed in this embodiment and the data transmission method applied to the transmitter proposed in the above embodiment belong to the same concept.
  • this embodiment has the same concept as Perform the same beneficial effects as the data transmission method applied to the transmitter.
  • FIG. 8 is a schematic structural diagram of a data transmission device provided by another embodiment. As shown in FIG. 8, the data transmission device includes: a resource determination module 410 to be detected and a detection module 420.
  • the resource determination module 410 to be detected is configured to determine the resource unit to be detected
  • the detection module 420 is configured to perform detection on the resource unit to be detected and obtain a first detection result, where the first detection result includes at least one data block among M data blocks, and the first detection result Contains information indicating the number of resource units N used to transmit the M data blocks and the location of at least one resource unit in the N resource units, where M is an integer greater than or equal to 1, and N is greater than or An integer equal to 1.
  • the receiver can obtain information from Information such as the resource unit used by the transmitter can be obtained from the decoded data, and the data on these resource units can be processed comprehensively by using this information, thereby improving the reliability of data transmission, improving the transmission performance in the presence of collisions, and improving competition The performance and capacity of dispatch-free transmission.
  • the first detection result further includes at least one of the following information: starting position information of available resource units; information about the number of available resource units; pilots on at least one of the N resource units Information; sequence information on at least one of the N resource units; identification information; valid data.
  • the detection module 420 is configured to: obtain the received symbol on the resource unit to be detected; detect the received symbol, and obtain the first detection result.
  • it further includes:
  • the to-be-detected resource determining module 410 is further configured to indicate the number of resource units N used for transmitting the M data blocks and the position of at least one resource unit among the N resource units included in the first detection result To determine the resource unit to be processed, or update the resource unit to be detected.
  • it further includes:
  • a reconstruction module configured to perform reconstruction according to the first detection result to obtain a reconstructed symbol
  • the channel estimation module is configured to perform channel estimation on the channel on at least one resource unit among the N resource units according to the reconstructed symbol to obtain a channel estimation result.
  • it further includes:
  • An interference cancellation module configured to perform interference cancellation on a received symbol on the at least one resource unit according to the reconstructed symbol and the channel estimation result, to obtain a received symbol after interference cancellation
  • the detection module 420 is further configured to detect the received symbols after the interference cancellation, and obtain a second detection result.
  • the detection module 420 is further configured to:
  • the received symbol on the at least one resource unit is detected to obtain a third detection result.
  • the data transmission device proposed in this embodiment and the data transmission method applied to the receiver proposed in the above embodiment belong to the same concept.
  • this embodiment has the same concept as Perform the same beneficial effects as the data transmission method applied to the receiver.
  • the embodiment of the present application also provides a transmitter.
  • the data transmission method applied to the transmitter in the foregoing embodiment may be executed by a data transmission device, which may be implemented by software and/or hardware, and integrated in the transmitter.
  • the transmitter may be a terminal.
  • Fig. 9 is a schematic diagram of the hardware structure of a transmitter provided by an embodiment.
  • a transmitter provided in this embodiment includes a processor 510 and a storage device 520.
  • One processor 510 is taken as an example in FIG. 9.
  • the processor 510 and the storage device 520 in the transmitter may be connected by a bus or other means. Take the bus connection as an example.
  • the one or more programs are executed by the one or more processors 510, so that the one or more processors 510 implement the data transmission method applied to the transmitter described in any of the foregoing embodiments.
  • the storage device 520 in the transmitter is used as a computer-readable storage medium and can be used to store one or more programs.
  • the programs can be software programs, computer-executable programs, and modules, such as the data transmission method in the embodiment of the present invention.
  • Corresponding program instructions/modules (for example, the modules in the data transmission device shown in FIG. 7 include: a resource determination module 310, a data block acquisition module 320, and a transmission module 330).
  • the processor 510 executes various functional applications and data processing of the transmitter by running the software programs, instructions, and modules stored in the storage device 520, that is, implements the data transmission method applied to the transmitter in the foregoing method embodiment.
  • the storage device 520 mainly includes a storage program area and a storage data area.
  • the storage program area can store an operating system and an application program required by at least one function; the storage data area can store data created according to the use of the device, etc.
  • the data block in the example, the information used to indicate the number of resource units N and the location of at least one resource unit among the N resource units, etc.).
  • the storage device 520 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices.
  • the storage device 520 may further include a memory remotely provided with respect to the processor 510, and these remote memories may be connected to the transmitter through a network.
  • Examples of the foregoing network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
  • the following operations are implemented: determine the number of resource units N and the corresponding N resource units, where N is greater than or equal to 1.
  • Get the M data blocks to be transmitted, M is an integer greater than or equal to 1, where each data block contains at least one resource used to indicate the number of resource units N and the N resource units Information about the location of the unit; the M data blocks are transmitted on the N resource units.
  • the transmitter proposed in this embodiment and the data transmission method applied to the transmitter proposed in the above embodiment belong to the same concept.
  • For technical details not described in detail in this embodiment please refer to any of the above embodiments, and this embodiment is equipped and implemented The same beneficial effect is applied to the data transmission method of the transmitter.
  • the embodiment of the present application also provides a receiver.
  • the data transmission method applied to the receiver in the foregoing embodiment may be executed by a data transmission device, which may be implemented in software and/or hardware, and integrated in the receiver.
  • the receiver may be a base station.
  • FIG. 10 is a schematic diagram of the hardware structure of a receiver provided by an embodiment.
  • a receiver provided in this embodiment includes: a processor 610 and a storage device 620.
  • one processor 610 is taken as an example.
  • the processor 610 and the storage device 620 in the receiver may be connected by a bus or other means. Take the bus connection as an example.
  • the one or more programs are executed by the one or more processors 610, so that the one or more processors 610 implement the data transmission method applied to the receiver described in any of the foregoing embodiments.
  • the storage device 620 in the receiver is used as a computer-readable storage medium and can be used to store one or more programs.
  • the programs can be software programs, computer-executable programs, and modules, such as the data transmission method in the embodiment of the present invention.
  • Corresponding program instructions/modules (for example, the modules in the data transmission device shown in FIG. 8 include: a resource determination module 410 and a detection module 420 to be detected).
  • the processor 610 executes various functional applications and data processing of the receiver by running the software programs, instructions, and modules stored in the storage device 620, that is, implements the data transmission method applied to the receiver in the foregoing method embodiment.
  • the storage device 620 mainly includes a storage program area and a storage data area.
  • the storage program area can store an operating system and an application program required by at least one function; the storage data area can store data created according to the use of the device, etc.
  • the storage device 620 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices.
  • the storage device 620 may further include a memory provided remotely with respect to the processor 610, and these remote memories may be connected to the receiver through a network. Examples of the foregoing network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
  • the following operations are implemented: determine the resource unit to be detected; perform detection on the resource unit to be detected, Acquire a first detection result, where the first detection result includes at least one data block in the M data blocks, and the first detection result includes the number of resource units used to indicate the transmission of the M data blocks Information about the location of at least one of the N and N resource units, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 1.
  • the receiver proposed in this embodiment belongs to the same concept as the data transmission method applied to the receiver proposed in the above embodiment.
  • the data transmission method applied to the receiver has the same beneficial effect.
  • the embodiment of the present application also provides a storage medium containing computer-executable instructions, and the computer-executable instructions are used to execute a data transmission method when executed by a computer processor.
  • the method includes: determining the number of resource units N and corresponding N resource units, where N is an integer greater than or equal to 1, and obtaining M data blocks to be transmitted, where M is an integer greater than or equal to 1, where each data block Contains information indicating the number N of resource units and the location of at least one resource unit in the N resource units; the M data blocks are transmitted on the N resource units.
  • the method includes: determining a resource unit to be detected; performing detection on the resource unit to be detected to obtain a first detection result, wherein the first detection result includes at least one data block among M data blocks,
  • the first detection result includes information indicating the number of resource units N used for transmitting the M data blocks and the location of at least one resource unit among the N resource units, where M is greater than or equal to 1.
  • An integer, N is an integer greater than or equal to 1.
  • this application can be implemented by software and general-purpose hardware, and can also be implemented by hardware.
  • the technical solution of the present application can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, Read-Only Memory (ROM), Random Access Memory (RAM), flash memory (FLASH), hard disk or optical disk, etc., including multiple instructions to make a computer device (which can be a personal computer, server, or network device, etc.) execute any of this application The method described in the embodiment.
  • the block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions.
  • the computer program can be stored on the memory.
  • the memory can be of any type suitable for the local technical environment and can be implemented using any suitable data storage technology, such as but not limited to read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), optical Memory devices and systems (Digital Video Disk (DVD) or Portable Compact Disc (CD)), etc.
  • Computer-readable media may include non-transitory storage media.
  • the data processor can be any type suitable for the local technical environment, such as but not limited to general-purpose computers, special-purpose computers, microprocessors, digital signal processors (Digital Signal Processors, DSP), application specific integrated circuits (ASICs) ), programmable logic devices (Field Programmable Gate Array, FPGA), and processors based on multi-core processor architecture.
  • DSP Digital Signal Processors
  • ASICs application specific integrated circuits
  • FPGA Field Programmable Gate Array
  • processors based on multi-core processor architecture such as but not limited to general-purpose computers, special-purpose computers, microprocessors, digital signal processors (Digital Signal Processors, DSP), application specific integrated circuits (ASICs) ), programmable logic devices (Field Programmable Gate Array, FPGA), and processors based on multi-core processor architecture.

Landscapes

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

Abstract

本申请提供一种数据传输方法、装置、发射机、接收机及存储介质。该方法包括：确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数；获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息；在所述N个资源单元上传输所述M个数据块。

Description

数据传输方法、装置、发射机、接收机及存储介质
本申请要求在2020年06月12日提交中国专利局、申请号为202010538212.0的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本申请涉及无线通信技术，例如涉及一种数据传输方法、装置、发射机、接收机及存储介质。
背景技术
对于竞争免调度传输，在有业务传输需求的情况下，发射机可以随机选择用于传输数据的资源，例如选择时频资源和导频等，进行竞争接入和传输。不同发射机选择的资源可能会发生碰撞，导致数据传输不稳定或者传输失败，影响数据传输的可靠性和容量。
发明内容
本申请提供一种数据传输方法、装置、发射机、接收机及存储介质，通过在一个或多个资源单元上进行数据传输，并在发送的数据块中携带资源单元的数量和位置信息，供接收机进行全面的接收和处理，以提高数据传输的可靠性和容量。
本申请实施例提供一种数据传输方法，应用于发射机，包括：
确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数；
获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息；
在所述N个资源单元上传输所述M个数据块。
本申请实施例还提供一种数据传输方法，应用于接收机，包括：
确定待检测的资源单元；
在所述待检测的资源单元上进行检测，获取第一检测结果，其中，所述第一检测结果包括M个数据块中的至少一个数据块，所述第一检测结果中包含用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，其中，M为大于或等于1的整数，N为大于或 等于1的整数。
本申请实施例还提供了一种数据传输装置，包括：
资源确定模块，设置为确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数；
数据块获取模块，设置为获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息；
传输模块，设置为在所述N个资源单元上传输所述M个数据块。
本申请实施例还提供了一种数据传输装置，包括：
待检测资源确定模块，设置为确定待检测的资源单元；
检测模块，设置为在所述待检测的资源单元上进行检测，获取第一检测结果，其中，所述第一检测结果包括M个数据块中的至少一个数据块，所述第一检测结果中包含用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，其中，M为大于或等于1的整数，N为大于或等于1的整数。
本申请实施例还提供了一种发射机，包括：
一个或多个处理器；
存储装置，用于存储一个或多个程序；
当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现上述应用于发射机的数据传输方法。
本申请实施例还提供了一种接收机，包括：
一个或多个处理器；
存储装置，用于存储一个或多个程序；
当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现上述应用于接收机的数据传输方法。
本申请实施例还提供了一种计算机可读存储介质，计算机可读存储介质上存储有计算机程序，该程序被处理器执行时实现上述的数据传输方法。
附图说明
图1为一实施例提供的一种数据传输方法的流程图；
图2A为一实施例提供的一种指定比特的示意图；
图2B为另一实施例提供的一种指定比特的示意图；
图2C为再一实施例提供的一种指定比特的示意图；
图2D为又一实施例提供的一种指定比特的示意图；
图2E为又一实施例提供的一种指定比特的示意图；
图2F为又一实施例提供的一种指定比特的示意图；
图3A为又一实施例提供的一种指定比特的示意图；
图3B为又一实施例提供的一种指定比特的示意图；
图3C为又一实施例提供的一种指定比特的示意图；
图3D为又一实施例提供的一种指定比特的示意图；
图3E为又一实施例提供的一种指定比特的示意图；
图3F为又一实施例提供的一种指定比特的示意图；
图4A为又一实施例提供的一种指定比特的示意图；
图4B为又一实施例提供的一种指定比特的示意图；
图4C为又一实施例提供的一种指定比特的示意图；
图4D为又一实施例提供的一种指定比特的示意图；
图4E为又一实施例提供的一种指定比特的示意图；
图4F为又一实施例提供的一种指定比特的示意图；
图5A为又一实施例提供的一种指定比特的示意图；
图5B为又一实施例提供的一种指定比特的示意图；
图5C为又一实施例提供的一种指定比特的示意图；
图5D为又一实施例提供的一种指定比特的示意图；
图5E为又一实施例提供的一种指定比特的示意图；
图5F为又一实施例提供的一种指定比特的示意图；
图6为另一实施例提供的一种数据传输方法的流程图；
图7为一实施例提供的一种数据传输装置的结构示意图；
图8为另一实施例提供的一种数据传输装置的结构示意图；
图9为一实施例提供的一种发射机的硬件结构示意图；
图10为一实施例提供的一种接收机的硬件结构示意图。
具体实施方式
下面结合附图和实施例对本申请进行说明。可以理解的是，此处所描述的具体实施例仅仅用于解释本申请，而非对本申请的限定。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互任意组合。另外还需要说明的是，为了便于描述，附图中仅示出了与本申请相关的部分而非全部结构。
对于免调度传输(Grant-free transmission)，发射机(例如用户终端)可以自主发送数据，而不需要发送调度请求或者等待动态调度，免调度传输可以降低信令开销和传输时延，还可以降低发射机的功耗。此外，将免调度传输与非正交传输结合，还可提升接入无线网络的发射机数量。
免调度传输包括两种方案，分别为预配置(Semi-persistent Scheduling，或者Configured Grant)免调度和竞争(Contention-based)免调度。其中，对于预配置免调度，接收机(例如基站)可以为每个发射机预配置或半静态配置时频资源和导频序列等，通过使多个发射机使用不同的时频资源和/或导频序列，避免发生碰撞，以便对发射机进行用户识别与检测。可用时频资源是周期的，比较适合周期性业务，用于随机突发业务则传输效率较低、时延较大。然而，对于竞争免调度，当发射机有业务传输需求时，可以随机选择时频资源和导频序列等进行竞争接入和传输，多个发射机使用的时频资源、导频序列等可能会发生碰撞，接收机需要通过更复杂的盲检测算法才能实现对发射机的用户识别与检测，竞争免调度更适合随机突发业务，具有更好的传输效率和更低的时延。
对于竞争免调度传输，如果多个发射机使用的资源发生碰撞，会严重影响这些发射机的数据传输性能。本申请提供了一种数据传输方法，通过在一个或多个资源单元上进行数据传输，并在发送的数据块中携带资源单元的数量和位置信息，供接收机进行全面的接收和处理，从而可以提高数据传输的可靠性，改善碰撞情况下的传输性能，进而提高竞争免调度传输的性能和容量。
图1为一实施例提供的一种数据传输方法的流程图，如图1所示，本实施 例提供的方法包括步骤110-130。
在步骤110中，确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数。
在步骤120中，获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息。
在步骤130中，在所述N个资源单元上传输所述M个数据块。
本实施例中，发射机使用N个资源单元传输M个数据块，并在每个数据块中携带资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息，为接收机处理提供可靠的依据。在此基础上，只要发射机在某个资源单元上没有与其他发射机发生碰撞，则该发射机发送的数据在很大概率上(网络中其他因素不稳定的情况除外，例如信号质量差、受到干扰或噪声影响等情况)可以被接收机接收和解码，进而接收机可以从解码数据中获取到该发射机所使用的资源单元等信息，利用这些信息可以对这些资源单元上的数据进行全面地处理，从而可以提高数据传输的可靠性，改善存在碰撞情况的传输性能，改善竞争免调度传输的性能和容量。
需要说明的是，本实施例不限定步骤110和步骤120的执行顺序，即，发射机可以先确定N个资源单元，再根据这N个资源单元获取到M个数据块；也可以先获取M个数据块，再根据这M个数据块确定N个资源单元；也可以是先获取M个数据块，在执行过程中进行一部分处理之后，再确定N个资源单元，然后再继续对M个数据块的其他处理。
在一实施例中，步骤110，包括：根据每个数据块中包含的用于指示资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息，确定资源单元数量N以及相应的N个资源单元。
本实施例中，发射机可以首先获取需要传输的M个数据块，每个数据块中都可以包含指定比特，用于指示资源单元数量N以及N个资源单元中至少一个资源单元的位置。发射机根据M个数据块中包含的信息，可以确定用于传输M个数据块的资源单元数量N以及N个资源单元的位置。例如，可以通过每个数据块中一些比特的比特值，指示资源单元数量N，并指示N个资源单元的位置，或者指示N个资源单元中的起始资源单元的位置或者末尾资源单元的位置；又 如，可以通过每个数据块中的一些比特，利用比特位图的形式指示使用哪些资源单元传输数据块等。发射机根据每个数据块中的这些比特值，可以确定N个资源单元的全部位置，然后使用N个资源单元传输M个数据块。
在一实施例中，步骤110，包括以下之一：随机确定所述资源单元数量N并随机选择N个资源单元；根据待传输的数据块的数量M确定所述资源单元数量N，并随机选择N个资源单元。
本实施例中，发射机可以先确定N个资源单元，例如，随机确定资源单元数量N，并在配置的可用资源单元中随机选择N个资源单元，用于传输数据块；也可以先获取M个数据块，然后根据数据块的数量M确定N个资源单元，例如，数据块的数量M＝2，则可以采用N＝2个资源单元传输这2个数据块。其中，M和N可以相等，也可以不相等。例如，可以根据具体的传输方案来确定N。如果M小于N，则资源单元较为充足，那么，一个数据块可以在多个资源单元上重复发送；如果M大于N，则资源单元相对较少，可以在一个资源单元上叠加发送多个数据块，或者，可以在时域上先后发送这M个数据块。
在一实施例中，步骤120，包括：获取M个数据组，分别在每个数据组中增加用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息，生成待传输的M个数据块。
本实施例中，发射机可以首先确定N个资源单元，然后获取待发送的M个数据组，在每个待发送的数据组的基础上，增加一些比特，用于指示资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息，从而生成M个数据块。或者，可以在每个数据组中增加一些比特，指示除当前数据块所使用的资源单元以外还使用的其他资源单元的数量(N-1)，并指示这N-1个资源单元中的至少一个资源单元的位置。这两种方式可以认为是等价的，后者的开销略小一些。
在一实施例中，每个数据块中包含指定比特，所述指定比特用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息。
本实施例中，每个数据块中都包含指定比特，每个数据块都携带用于指示资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息。
在一实施例中，所述指定比特为隐式指示比特或者显式指示比特。
本实施例中，指定比特可以为隐式指示比特，即利用待传输的M个数据块 中具备已有含义的数据比特，在携带已有信息的同时，隐含指示资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息；也可以为显式指示比特，即在待发送的数据组的基础上额外增加的数据比特。
在一实施例中，指定比特为公共数据中的数据比特，其中，所述公共数据为M个数据块中均包含的数据。
本实施例中，指定比特可以为M个数据块中均包含的公共数据中的数据比特，即，每个数据块中都包含该公共数据，且该公共数据中的一些数据比特作为指定比特，用于指示资源单元数量N以及N个资源单元中至少一个资源单元的位置。
在一实施例中，指定比特，包括以下之一：用于指示所述资源单元数量N的第一比特，以及用于指示所述N个资源单元中的至少一个资源单元的位置的第二比特；用于指示比特组数量X的第三比特，以及用于指示所述N个资源单元中的至少一个资源单元的位置的X个比特组，其中，X为大于或等于1的整数；用于指示所述N个资源单元中的至少一个资源单元的位置的第一比特位图；用于指示所述N个资源单元中的第一个资源单元的位置的第四比特和最后一个资源单元的位置的第五比特。
本实施例中，指定比特可以包括第一比特和第二比特，其中，第一比特用于指示资源单元数量N，第二比特用于指示N个资源单元中的至少一个资源单元的位置；或者，指定比特包括第三比特和至少一个比特组，其中，第三比特用于指示比特组的数量X，X个比特组用于指示N个资源单元中的至少一个资源单元的位置；或者，指定比特包括第一比特位图，第一比特位图用于指示N个资源单元中的至少一个资源单元的位置；或者，指定比特包括第四比特和第五比特，其中，第四比特用于指示N个资源单元中的第一个资源单元的位置，第五比特用于指示N个资源单元中的最后一个资源单元的位置。
在一实施例中，步骤110，包括：在所述指定比特包括用于指示所述N个资源单元中的至少一个资源单元的位置的第一比特位图，且所述第一比特位图的值全为0或者值为1的数量超过指定值的情况下，按照指定规则确定所述资源单元数量N以及相应的N个资源单元。
本实施例中，指定比特包括第一比特位图，例如第一比特位图为“01010101”，其中，值为0表示不使用对应位置的资源单元，值为1表示使 用对应位置的资源单元，根据该第一比特位图，可以确定资源单元数量为4，分别是第2、4、6、8个资源单元。采用比特位图的方式，可以同时指示资源单元数量和各个资源单元的位置，即，在指示资源单元的位置的同时隐含指示了资源单元数量。如果第一比特位图中的值全为0，或者值为1的数量超过指定值，也可以采用指定规则确定资源单元数量N以及相应的N个资源单元。例如，在第一比特位图中的值全部为0的情况下，可以使用所有的资源单元传输数据块，或者使用指定数量和指定位置的资源单元传输数据块等。
在一实施例中，每个数据块中还包含以下信息至少之一：可用资源单元的起始位置信息；可用资源单元的数量信息。
本实施例中，每个数据块除了可以指示用于传输M个数据块的资源单元数量N以及N个资源单元中的至少一个资源单元的位置，还可以指示可用资源单元的起始位置信息和/或可用资源单元的数量信息。在一示例中，没有为发射机预先配置任何可用资源单元，发射机根据数据块中的指示信息确定可用资源单元，或者发射机确定可用资源单元并将指示信息添加到数据块中。在一示例中，可以为发射机预先配置一个资源单元池(也可以称为整体可用资源单元)，根据数据块中的指示信息从该资源单元池中确定可用资源单元(也可以称为局部可用资源单元或当前可用资源单元)，或者发射机从该资源单元池中确定可用资源单元并将指示信息添加到数据块中。发射机从可用资源单元中确定用于传输M个数据块的N个资源单元，可用资源单元的数量大于或等于N。
在一实施例中，N个资源单元满足以下至少之一：所述N个资源单元位于相关带宽范围内；所述N个资源单元位于相关时间范围内；所述N个资源单元上的信道是相关的。
本实施例中，用于传输M个数据块的N个资源单元处于一定的带宽范围内，或者处于一定的时间范围内，或者N个资源单元上的信道是相关的，从而使得N个资源单元上的信道具有较强的相关性，从而简化接收机处理和实现。
在一实施例中，每个数据块中还包含以下信息至少之一：在所述N个资源单元中的至少一个资源单元上使用的导频信息；在所述N个资源单元中的至少一个资源单元上使用的序列信息。
本实施例中，每个数据块中还包含N个资源单元中的至少一个资源单元上使用的导频信息，和/或N个资源单元中的至少一个资源单元上使用的序列信息。 例如，每个数据块中可以包含以下之一：在N个资源单元上使用的导频信息；在N个资源单元上使用的序列信息；在N个资源单元上使用的导频信息和序列信息；在传输当前的数据块的资源单元上使用的导频信息；在传输当前的数据块的资源单元上使用的序列信息；在传输当前的数据块的资源单元上使用的导频信息和序列信息。
在一实施例中，M个数据块中的至少一个数据块中还包含身份识别信息。
本实施例中，M个数据块中，至少有一个数据块中还包含了身份识别信息，供接收机对发射机进行身份识别。
在一实施例中，M个数据块中的至少一个数据块中还包含有效数据。
本实施例中，M个数据块中，至少有一个数据块中还包含了有效数据，例如指定消息、业务数据等，供接收机进行解码和处理后获取相应信息。
在一实施例中，步骤130，包括：将所述M个数据块分别进行处理，然后映射到所述N个资源单元中的对应资源单元上进行传输，其中，所述处理包括以下至少之一：编码、加扰(含部分加扰)、调制、扩展、交织、预编码、叠加等。
在一实施例中，发射机在一个或多个资源单元上发送数据块，在各个资源单元上发送的M个数据块是相同的，即，发射机将同一个数据块D在各个资源单元上分别进行发送，从而提升竞争免调度传输情况下的传输可靠性。其中，发射机可以为终端。本实施例中，发射机确定用于传输数据块的资源单元数量N以及相应的N个资源单元，并获取将要在各个资源单元上传输的数据块D，然后在各个资源单元上分别发送该数据块D。
在一实施例中，发射机可以根据数据块D中的指定比特来确定资源单元数量N以及相应的N个资源单元。
图2A为一实施例提供的一种指定比特的示意图。如图2A所示，发射机可以根据数据块D中的指定比特组0(即指定比特中的第一比特)确定资源单元数量N，N大于或等于1。其中，指定比特组0可以包含A个比特，A为大于或等于1的整数。A的取值与可用资源单元数量有关，例如，假设有4个可用资源单元，则可以使用A＝2个比特指示资源单元数量N(“00”、“01”、“10”、“11”分别用来指示资源单元数量N＝1、N＝2、N＝3、N＝4)；假设有8个可用资源单元，则可以使用A＝3个比特来指示资源单元数量。此外，发射机还可以根据数据块D中的指定比特组1～N(即指定比特中的第二比特)来确定相应的 N个资源单元。其中，指定比特组1～N也可以分别包含A个比特，每个比特组指示一个资源单元的位置信息，该位置信息可以为一个资源单元的索引。
其中，指定比特组1～N可以是连续的N个比特组，也可以是不连续的。一种情况下，例如，连续的N个比特组中的比特均是不同的，可以分别用于指示不同的位置信息，则这N个比特组可以作为指定比特，分别用来指示N个资源单元的位置信息。
另一种情况下，例如，如果一个比特组和其之前的某个比特组中的比特是相同的，则二者会指示相同的位置，这种情况下，可以不使用该比特组指示一个资源单元的位置信息，而是可以进行顺延，确定下一个比特组是否可以用来指示资源单元的位置信息，如果下一个比特组和其之前的比特组中的比特均不相同，则可以用来指示一个资源单元的位置信息，直到使用N个比特组来指示或确定N个资源单元的位置。
在一实施例中，即使一个比特组和其之前的某个比特组中的比特是相同的，即二者会指示相同的位置，也可以使用该位置的资源单元来传输数据。这种情况下，也可以不再进行顺延。
在竞争免调度传输情况下，对于接收机而言，发射机使用的资源单元数量和位置是未知的，另外，也不确定哪一个资源单元上传输的数据块可以被正确解码，因此，发射机通过在每个资源单元上传输的数据块D中指示资源单元数量N以及N个资源单元中至少一个资源单元的位置信息，为接收机对各个资源单元传输的数据进行解码提供了可靠的依据。
图2B为另一实施例提供的一种指定比特的示意图。如图2B所示，发射机可以根据数据块D中的指定比特组0(即指定比特中的第三比特)来确定比特组的数量X，其中，X大于或等于1；并根据数据块D中的指定比特组1～X确定用于传输数据块的N个资源单元，其中，比特组1～X中的每个比特组指示一个资源单元的位置信息，该位置信息可以为一个资源单元的索引。
如果指定比特组1～X中的比特均是不同的，均可以直接使用，可以分别用来指示X个资源单元的位置信息。但指定比特组1～X中的某些比特组中的比特可能是相同的。如果一个比特组和其之前的某个比特组中的比特是相同的，则二者会指示相同的位置，这种情况下，将不使用这一个比特组来指示一个资源单元的位置信息。如果不使用其中某个或某些比特组，则实际确定的用于传输数据块的资源单元数量将小于X。因此，如图2B所示，比特组X指示的是第N 个资源单元的位置，1<＝N<＝X。
本实施例中，指定比特组0指示了用于指示资源单元位置的比特组的数量为X，可以根据这X个指定比特组来确定用于传输数据块的资源单元。图2B所示的示例中，相当于根据指定比特组0和指定比特组1～X来联合确定资源单元数量以及用于传输数据块的资源单元，即，联合确定了用于传输数据块的资源单元数量为N，以及这N个资源单元的位置。
其中，指定比特组1～X可以是连续的X个比特组，也可以是不连续的，例如，各个比特组之间具有指定间隔。
需要说明的是，如果在图2A所示的示例中，当一直顺延到数据块D的末尾或指定位置，也无法找到满足条件(不同)的N个比特组来指示或确定N个资源单元的位置，那么，实际使用的资源单元的数量可以小于N。
图2C为再一实施例提供的一种指定比特的示意图。如图2C所示，发射机可以根据数据块D中的指定比特组0(即指定比特中的第一比特)确定用于传输数据块的资源单元数量N，其中，N大于或等于1；还可以根据数据块D中的指定比特组1(即指定比特中的第二比特)来确定用于传输数据块的第一个资源单元的位置。
本实施例中，发射机可以使用N个连续的资源单元，在确定了资源单元数量N和第一个资源单元的位置后，发射机将从第一个资源单元开始的连续N个资源单元确定为用于传输数据块的N个资源单元。如果直到最后一个可用资源单元，也无法获取到连续的N个资源单元，则从第一个资源单元开始获取资源单元，这相当于循环获取N个资源单元，或者获取的N个资源单元是循环连续的。
本实施例中，发射机还可以使用N个具有指定间隔的资源单元，在确定了资源单元数量N和第一个资源单元的位置后，发射机将从第一个资源单元开始的具有指定间隔的N个资源单元确定为用于传输数据块的N个资源单元。类似的，可以在可用资源单元中循环获取N个资源单元。如果循环获取的资源单元与之前确定的资源单元相同，则可以重复使用该资源单元，或者，顺延到下一个与之前确定的资源单元不同的资源单元，并以该资源单元为基准获取满足指定间隔的下一个资源单元。其中，指定间隔可以是预设的，或者，是由数据块D中的指定比特组2指示的。
本实施例中，指定比特组1可以指示N个资源单元中任意一个指定的资源 单元的位置，这里仅以指示第一个资源单元的位置进行示例性的说明。
本实施例中，N个资源单元的位置的随机性会变差，但N个资源单元上的信道的相关性更好。
图2D为又一实施例提供的一种指定比特的示意图。如图2D所示，发射机可以根据第一比特位图(BitMap)来确定用于传输数据块的资源单元数量以及相应的资源单元。该比特位图由数据块D中的指定的T个比特构成。T的取值与可用资源单元数量有关，例如，假设有8个可用资源单元，则T＝8，该比特位图的一个示例为“01010101”，值为0的位置表示不使用对应位置的资源单元，值为1的位置表示使用对应位置的资源单元，因此，可以看到，用于传输数据块的资源单元数量为4，分别是第2、4、6、8个资源单元。这里还可以看到，采用比特位图的方式，可以同时指示资源单元的数量和各个资源单元的位置，或者说在指示资源单元的位置的同时隐含指示了资源单元的数量。
本实施例中，第一比特位图可以来自于数据中具备已有含义的数据比特，用于隐含指示资源单元的数量和位置信息。
在第一比特位图中的比特全部为0的情况下，可以按照指定规则来确定用于传输数据块的资源单元数量以及相应的资源单元。例如，可以使用所有的资源单元，这相当于进行了比特取反，得到的比特全部为1；或者，使用指定数量和指定位置的资源单元，比如，使用1个位于指定位置的资源单元，使用2个位于指定位置的资源单元，使用奇数位置上的资源单元，使用偶数位置的资源单元，或者，使用位于前面、后面或中间的指定数量的资源单元，等。
在第一比特位图中的比特全部为1的情况下(或为1的比特超过一定数量)，如果不想使用全部的资源单元(或者不想使用超过一定数量的资源单元)，也可以按照指定规则来确定用于传输数据块的资源单元数量以及相应的资源单元。例如，使用指定数量和指定位置的资源单元。
在一实施例中，可以对用于传输数据块的资源单元的数量N进行限制，例如，令N小于或等于V，其中，V可以为可用资源单元数量的1/2、1/3等。在发射机确定的资源单元数量N大于V的情况下，可以令N＝V，然后根据上述任意实施例来确定用于传输数据块的资源单元的位置。或者，也可以通过限制比特组0(即指定比特中的第一比特)的比特数量，从而限制N的取值范围，例如，假设有8个可用资源单元，限制用于传输数据块的资源单元数量最多为4，则可以仅使用包含2比特的比特组0来指示资源单元数量，而指示资源单元位 置的每个比特组可以仍然包含3比特，也就是说，比特组0和其他比特组包含的比特数量可以是不同的。
对于图2D的示例，在根据T个比特组成的比特位图确定的资源单元数量N大于V的情况下，可以根据指定位置的比特组成的比特位图来确定资源单元数量。例如，在第一个比特为0的情况下，使用偶数位置的V个比特组成的比特位图；在第一个比特为1的情况下，使用奇数位置的V个比特组成的比特位图；或者，在前两个比特为00、01、10、或11的情况下，分别使用奇数位置的V个比特、偶数位置的V个比特、前V个比特、或后V个比特组成的比特位图等，即，利用第一比特位图中的指定比特来指示由指定位置的比特组成新的比特位图，用于指示实际使用的资源单元数量和位置。
图2E为又一实施例提供的一种指定比特的示意图。如图2E所示，发射机可以根据数据块D中的指定比特组0(即指定比特中的第四比特)确定用于传输数据块的N个资源单元中第一个资源单元的位置；可以根据数据块D中的指定比特组1(即指定比特中的第五比特)确定用于传输数据块的N个资源单元中最后一个资源单元的位置。N个资源单元可以是该第一个资源单元和该最后一个资源单元之间的所有连续资源单元或具有指定间隔的资源单元。
图2F为又一实施例提供的一种指定比特的示意图。如图2F所示，指定比特组0(相当于指定比特中的第一比特)可以指示当前可用资源单元(或局部可用资源单元)的起始位置，由V个比特组成的比特位图(相当于指定比特中的第一比特位图)可以与当前可用资源单元对应。也就是说，该比特位图可以对应从比特组0指示的资源单元开始的位于指定位置的V个资源单元，并且，该比特位图用于指示用于传输数据块的资源单元数量和位置，即，可以根据比特组0来确定比特位图对应的资源单元中第一个资源单元的位置，根据比特位图从对应的资源单元中确定用于传输数据块的资源单元数量以及各个资源单元的位置。此外，可以在可用资源单元(可以是为发射机配置的整体可用资源单元)中循环获取当前可用资源单元，或者，比特位图可以和可用资源单元循环对应。本实施例有利于保证用于传输数据块的N个资源单元上的信道是相关的。
另外，本实施例也适用于整体可用资源单元未知的情况，可以根据指定比特组0确定整体可用资源单元的起始位置，根据比特位图从对应的资源单元中确定用于传输数据块的N个资源单元。
上述实施例中，指定比特组0、指定比特组1、...等从数据块D的头部开始， 也可以从数据块D的尾部或指定位置开始，并按照指定规则分布。例如，从数据块D的尾部开始，从尾部往头部方向分别可以是指定比特组0、指定比特组1、...等。指定比特组1与指定比特组0可以是相邻的，也可以是不相邻的，例如，指定比特组1可以是从指定位置开始的，或者，指定比特组1与指定比特组0之间有指定间隔。
上述实施例中，对于第一比特位图，也可以从指定位置开始并按照指定规则分布。例如，数据块D的尾部的T个比特，从尾部往头部方向分别指示各个可用资源单元的使用情况，或者，从头部往尾部方向分别指示各个可用资源单元的使用情况。
在一实施例中，可以通过数据块的指定比特指示资源单元数量N-1，表示除了当前的数据块所使用的资源单元外，还使用了其他的N-1个资源单元。
在一实施例中，在N为固定值的情况下，可以不指示资源单元数量，可以仅指示N个资源单元中至少一个资源单元的位置信息。
在一实施例中，比特位图还可以用于指示资源图样，其中，资源图样可以是预配置的或半静态配置的，也可以是按照指定规则获取的，例如将可用资源单元进行组合获取指定组合形式。
在一实施例中，数据块D中可以包含有效数据(Payload)，例如业务数据、指定消息等。数据块D中还可以包含发射机的身份识别信息，从而可以使得接收机对数据进行解码后知道数据是由哪个发射机发送的。数据块D可以是无编码的、编码前的或编码后的数据块。
上述实施例中的指定比特，可以来自于数据块D中的有效数据的数据比特、携带发射机的身份识别信息的数据比特等至少之一，这些数据比特虽然具备已有的含义，但是可以用于隐含指示或携带资源单元数量N以及N个资源单元中至少一个资源单元的位置信息。
在一实施例中，在数据块D中还可以携带N个资源单元上使用的导频(例如前导、导频、参考信号等)信息、序列(例如扩展序列、交织序列、扰码序列、序列集合等)信息等至少之一。携带这些信息，可以为接收机处理提供可靠的依据，接收机在对一个资源单元上的数据进行正确解码后，可根据这些信息对传输符号进行重构和干扰消除等，以协助在其他资源单元上的数据解码。该实施例中，可以在数据块中携带N个资源单元上使用的导频信息、序列信息等，也可以在第n个资源单元上发送的数据块中仅携带当前资源单元上使用的 导频信息、序列信息等，其中，1<＝n<＝N，这种情况下，当第n个资源单元上完成解码后，也可以用于协助其他资源单元的数据解码。在一实施例中，如果导频信息和序列信息之间存在指定的关联关系，可以仅在数据块D中携带导频信息或序列信息。
在一实施例中，携带导频信息、序列信息等的比特可以是类似上述任意实施例的比特组的形式，也可以是类似上述任意实施例的比特位图的形式。
在一实施例中，携带导频信息、序列信息等的比特可以来自于数据中具备已有含义的数据比特，通过隐含的方式来指示导频信息、序列信息等。
在一实施例中，携带导频信息、序列信息等的比特也可以是额外增加的比特。该实施例中，发射机首先确定其在各个资源单元上使用的导频信息、序列信息等，例如，可以采用随机生成或随机选择的方式来确定，然后，发射机在待发送数据中额外增加相应的比特，通过显式的方式来指示导频信息、序列信息等。
在一实施例中，可以进一步考虑比特复用，即通过一些比特来同时指示或携带多种信息。
在一实施例中，可用资源单元可以包括频域上的多个资源单元、时域上的多个资源单元、或者时频域上的多个资源单元。
在一实施例中，可用资源单元上的信道是相关的，或者，可用资源单元位于相关带宽和/或相关时间范围内。在一实施例中，用于传输数据块的多个资源单元上的信道是相关的，或者位于相关带宽和/或相关时间范围内。
在一实施例中，可用资源单元可以是预配置的或者根据预设规则确定的。
在一实施例中，可用资源单元可以是发射机自主确定的，则对于接收机而言，可用资源单元的起始位置、数量或范围是未知的，这种情况下，可以在发射机发送的数据块中携带可用资源单元的起始位置信息，例如，相对于整个带宽的第一个资源单元或指定位置的偏移量，或起始资源单元的索引等；可以采用与图2F所示的示例类似的方式；还可以在数据块中携带可用资源单元的数量信息；可以通过隐含的方式或显式的方式来指示可用资源单元的起始位置、数量或范围。
在一实施例中，发射机将数据块D在N个资源单元上分别发送，可以形成N次传输，当N个资源单元为时域上的N个资源单元时(频域位置相同或不同)，这N次传输可以由首传和重传构成，并且，发射机可以确定重传是否执行，例 如，根据N个资源单元的时域间隔或者根据其他指定比特确定某次重传是否执行。
在一实施例中，发射机可以将数据块D在N个资源单元上进行低码率编码后进行发送。
本实施例中，通过利用数据块D中的比特来隐含的指示资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息等，可以节省指示开销。
在一实施例中，发射机将在一个或多个资源单元上发送数据。发射机在各个资源单元上发送的M个数据块是相同的，即，发射机将同一个数据块D在各个资源单元上分别进行发送。从而提升竞争免调度传输情况下的传输可靠性。本实施例中，发射机首先确定用于传输数据块的资源单元数量以及相应的资源单元。
在一实施例中，发射机可以随机选择用于传输数据块的资源单元的数量和位置。例如，假设有8个可用资源单元，发射机随机选择的资源单元数量为3，并从8个可用资源单元中随机选择3个资源单元的位置或索引，比如分别为资源单元1、3、6。然后，发射机获取将要在各个资源单元上传输的数据块D，并在各个资源单元上分别发送数据块D。
图3A为又一实施例提供的一种指定比特的示意图。如图3A所示，发射机先获取待发送的数据组，在该数据组中增加比特组0(即指定比特中的第一比特)，用于指示资源单元的数量N，并在该数据组中增加比特组1～N(即指定比特中的第二比特)，分别用于指示各个资源单元的位置信息，该位置信息可以为一个资源单元的索引，从而形成数据块D。其中，比特组0和比特组1～N包含的比特数量可以是不同的。
对于多个发射机进行竞争免调度传输的情况，多个发射机使用的资源单元数量可能是不同的，那么，多个发射机最终形成的数据块的大小可能是不同的，这种情况下可以考虑进行比特填充，使得各个发射机的数据块的大小相同。
在竞争免调度传输情况下，对于接收机而言，发射机使用的资源单元数量和位置是未知的，另外，也不确定哪一个资源单元上传输的数据块可以被正确解码，因此，可以在每个资源单元上传输的数据块D中进行指示，以便接收机对各个资源单元上传输的数据进行解码。
图3B为又一实施例提供的一种指定比特的示意图。如图3B所示，发射机先获取待发送的数据组，在该数据组中增加比特组0(即指定比特中的第三比 特)，用于指示比特组的数量X，并在该数据组中增加比特组1～X，用于指示资源单元数量N及至少一个资源单元的位置信息。
图3C为又一实施例提供的一种指定比特的示意图。如图3C所示，发射机获取待发送的数据组，在该数据组中增加第一比特位图，用于指示资源单元的数量和各个资源单元的位置，从而形成数据块D。该第一比特位图由T个比特构成。T的取值与可用资源单元数量有关，例如，根据上述示例，使用8个可用资源单元中的第1、3、6个资源单元，那么，T＝8，该比特位图可以为“10100100”，值为0的位置表示不使用对应位置的资源单元，值为1的位置表示使用对应位置的资源单元。采用比特位图的方式，可以同时指示资源单元的数量和各个资源单元的位置，或者说在指示资源单元的位置的同时隐含指示了资源单元的数量。该示例中，通过使用比特位图指示N个资源单元，具有较小的且较为固定的指示开销。
在一实施例中，例如，假设有8个可用资源单元，发射机随机确定或选择的资源单元数量为N＝3，并随机确定或选择用于传输数据块的第一个资源单元的位置或索引，将从该资源单元开始的连续3个资源单元确定为用于传输数据块的3个资源单元。比如使用的第一个资源单元为资源单元2，则将资源单元2、3、4确定为用于传输数据块的3个资源单元。然后，发射机获取将要在各个资源单元上传输的数据块D，并在各个资源单元上分别发送数据块D。
图3D为又一实施例提供的一种指定比特的示意图。如图3D所示，发射机获取待发送的数据组，并在该数据组中增加比特组0(即指定比特中的第一比特)，用于指示资源单元的数量N，还在该数据组中增加比特组1(即指定比特中的第二比特)，用于指示用于传输数据块的第一个资源单元的位置信息，该位置信息可以为一个资源单元的索引，从而形成数据块D。
该实施例中，也可以将从所确定的第一个资源单元开始的具有指定间隔的N个资源单元确定为用于传输数据块的N个资源单元。其中，指定间隔可以是预设的，或者，在待发送数据组中增加比特组2进行指示。
该实施例中，可以在可用资源单元中循环获取N个资源单元。
该实施例中，还可以确定N个资源单元中任意一个指定的资源单元的位置，并通过比特组1进行指示，这里仅以确定第一个资源单元的位置并进行指示进行示例性的说明。
该实施例中，总体上具有较小的并且较为固定的指示开销，更容易保证N 个资源单元的信道是相关的，缺点是资源单元的位置的随机性变差。
图3E为又一实施例提供的一种指定比特的示意图。如图3E所示，发射机可以在待发送的数据组的基础上增加指定比特组0(即指定比特中的第四比特)，用于指示用于传输数据块的N个资源单元中第一个资源单元的位置；增加指定比特组1(即指定比特中的第五比特)，用于指示用于传输数据块的N个资源单元中最后一个资源单元的位置。发射机使用的N个资源单元可以是该第一个资源单元和该最后一个资源单元之间的所有连续资源单元或具有指定间隔的资源单元。
在一实施例中，可以对用于传输数据块的资源单元的数量N进行限制，例如，令N小于或等于V，其中，V可以为可用资源单元的1/2、1/3等。
在一实施例中，假设有8个可用资源单元，发射机从其中随机选择一个资源单元作为起始资源单元，并将从该资源单元开始的位于指定位置的V个资源单元作为当前可用资源单元(或局部可用资源单元)，例如，将资源单元3作为起始资源单元，将从资源单元3开始的连续4个资源单元(即资源单元3、4、5、6)作为当前可用资源单元。然后，发射机从这些当前可用资源单元中确定用于传输数据块的资源单元数量、以及相应的资源单元。例如，发射机可以随机选择用于传输数据块的资源单元数量为N＝2，并从当前可用资源单元中随机选择2个资源单元作为用于传输数据块的资源单元，例如资源单元3、5。类似的，可以在可用资源单元中循环获取当前可用资源单元。然后，发射机获取将要在各个资源单元上传输的数据块D，并在各个资源单元上分别发送数据块D。
图3F为又一实施例提供的一种指定比特的示意图。如图3F所示，发射机获取待发送的数据组，在该数据组中增加比特组0(即指定比特中的第一比特)，用于指示当前可用资源单元的起始位置信息(即第一个资源单元的位置信息)，并在该数据组中增加比特位图(即指定比特中的第一比特位图)，用于指示当前可用资源单元中用于传输数据块的资源单元的数量和各个资源单元的位置，从而形成数据块D。该实施例也具有较小的和较为固定的指示开销，有利于保证用于传输数据块的多个资源单元的信道是相关的，而且资源单元位置具有更好的随机性。
在一实施例中，可以在数据块中携带资源单元数量N-1，表示除了当前资源单元外还使用了其他N-1个资源单元。
在一实施例中，发射机用于传输数据块的资源单元数量可以是固定的，那 么，可以不在待发送的数据组中额外增加比特来指示资源单元数量N，仅需要增加比特来指示至少一个资源单元的位置即可。
在一实施例中，发射机使用全部的可用资源单元进行传输，那么，可以不在待发送的数据中额外增加比特来指示资源单元的数量和位置。
上述实施例中，增加的比特可以添加在数据块D的头部，也可以添加在数据块D的尾部或指定位置，并按照指定规则分布。例如，添加在数据块D的尾部，从尾部往头部方向分别可以是比特组0、比特组1、...等。
类似的，对于比特位图的方式，也可以将比特位图添加在指定位置并按照指定规则分布。例如，在待发送数据组的尾部添加T个比特，从尾部往头部方向分别指示各个可用资源单元的使用情况，或者，从头部往尾部方向分别指示各个可用资源单元的使用情况。
在一实施例中，待发送的数据组中可以包含有效数据，例如业务数据、指定消息等。待发送数据组中还可以包含发射机的身份识别信息，从而可以使得接收机对数据进行解码后知道数据是哪个发射机发送的。待发送的数据组可以是无编码的、编码前的或编码后的数据块。
在一实施例中，还可以在数据块D中携带N个资源单元上使用的导频(例如前导、导频、参考信号等)信息、序列(例如扩展序列、交织序列、扰码序列、序列集合等)信息等至少之一。携带这些信息，有利于接收机对一个资源单元上的数据进行正确解码后用于传输符号重构和干扰消除，以及用于协助其他资源单元上的数据解码。可以在数据块中携带N个资源单元上使用的导频信息、序列信息等，也可以在第n个资源单元上发送的数据块中仅携带当前资源单元上使用的导频信息、序列信息等，其中，1<＝n<＝N，即使如此，当第n个资源单元上完成解码后，也可以用于协助其他资源单元的数据解码。在一实施例中，如果导频信息和序列信息之间存在指定的关联关系，可以仅在数据块D中携带导频信息或序列信息。
在一实施例中，携带导频信息、序列信息等的比特可以是上述任意实施例中的比特组的形式，也可以是任意实施例中的比特位图的形式。
在一实施例中，携带导频信息、序列信息等的比特可以来自于数据中具备已有含义的数据比特，通过隐含的方式来指示导频信息、序列信息等。
在一实施例中，携带导频信息、序列信息等的比特也可以是额外增加的比特。该实施例中，发射机首先确定其在各个资源单元上使用的导频信息、序列 信息等，例如，可以采用随机生成或随机选择的方式来确定，然后，发射机在待发送数据中额外增加相应的比特，通过显式的方式来指示导频信息、序列信息等。
在一实施例中，可以进一步考虑比特复用，即通过一些比特来同时指示或携带多种信息。
在一实施例中，发射机确定的用于传输数据块的多个资源单元的信道是相关的，或者位于相关带宽和/或相关时间范围内。发射机可以通过施加一定的控制或者按照指定规则来实施，从而实现这一点。
本实施例中，通过在待发送的数据中额外增加比特来显式的指示资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息等，有利于控制使用的资源单元，并进行有效的指示，不过会增加指示开销。
在一实施例中，发射机在一个或多个资源单元上发送数据。在多个资源单元上进行数据传输的情况下，发射机将在多个资源单元上发送M个不同的数据块，从而提升竞争免调度传输情况下的传输容量。未在本实施例中详尽描述的技术细节，可参见上述任意实施例。本实施例中，发射机确定用于传输M个数据块的资源单元数量N以及相应的N个资源单元，获取将要在各个资源单元上传输的M个数据块，然后分别在各个资源单元上进行发送。
在一实施例中，发射机将在N个资源单元上分别发送数据块D_1,D_2,...,D_M，这M个数据块中的部分数据可以是相同的，称为公共数据。可以通过这M个数据块中的公共数据来携带资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息，进一步还可以用来携带导频信息、序列信息等。
图4A为又一实施例提供的一种指定比特的示意图。如图4A所示，发射机可以根据公共数据中的指定比特组0(即指定比特中的第一比特)来确定资源单元数量N，其中，N大于或等于1，还可以根据公共数据中的指定比特组1～N(即指定比特中的第二比特)来确定相应的N个资源单元的位置，然后，发射机可以将数据块D_1,D_2,...,D_M分别在N个资源单元上进行发送。
图4B为又一实施例提供的一种指定比特的示意图。如图4B所示，发射机可以根据公共数据中的指定比特组0(即指定比特中的第三比特)来确定比特组的数量X，X大于或等于1，还可以根据公共数据中的指定比特组1～X确定用于传输数据块的N个资源单元。如果一个比特组和其之前的某个比特组中的比特是相同的，那么，二者会指示相同的位置，将不使用这一个比特组来指示一 个资源单元的位置信息，也不会进行比特组的顺延。指定比特组X指示的是第N个资源单元的位置，1<＝N<＝X。
本实施例中，相当于根据指定比特组0和指定比特组1～X来联合确定资源单元数量以及用于传输数据块的N个资源单元，即联合确定了用于传输数据块的资源单元数量为N，以及这N个资源单元的位置。然后，发射机将数据块D_1,D_2,...,D_M分别在N个资源单元上进行发送。
图4C为又一实施例提供的一种指定比特的示意图。如图4C所示，发射机可以根据公共数据中的指定比特组0(即指定比特中的第一比特)来确定用于传输数据块的资源单元数量N，其中，N大于或等于1；根据公共数据中的指定比特组1(即指定比特中的第二比特)来确定用于传输数据块的第一个资源单元的位置。并且，发射机使用从该资源单元开始的连续N个资源单元，或者，使用从该资源单元开始的连续N个具有指定间隔的资源单元。其中，指定间隔可以是预设的，或者，是由公共数据中的指定比特组2指示的。可以在可用资源单元中循环获取N个资源单元。然后，发射机将数据块D_1,D_2,...,D_M分别在N个资源单元上进行发送。对于接收机而言，当在某个资源单元上完成对某个数据块的解码后，可以得到发射机使用的资源单元数量N以及第一个资源单元的位置，从而可以根据这些信息以及当前资源单元推导出发射机使用的其他资源单元，然后可以进一步对这些资源单元上传输的数据块进行解码。
图4D为又一实施例提供的一种指定比特的示意图。如图4D所示，发射机可以根据公共数据中的第一比特位图来确定用于传输数据块的资源单元数量N以及相应的N个资源单元。该比特位图由公共数据中的指定的T个比特构成。然后，发射机将数据块D_1,D_2,...,D_M分别在N个资源单元上进行发送。
在一实施例中，在比特位图中的比特全部为0的情况下，可以按照指定规则来确定用于传输数据块的资源单元数量N以及相应的N个资源单元。在比特位图中的比特全部为1(或为1的比特超过一定数量)的情况下，如果不想使用全部的资源单元(或不想使用超过一定数量的资源单元)，也可以按照指定规则来确定用于传输数据块的资源单元数量N以及相应的N个资源单元。
图4E为又一实施例提供的一种指定比特的示意图。如图4E所示，发射机可以根据公共数据中的指定比特组0(即指定比特中的第四比特)确定用于传输数据块的第一个资源单元的位置；根据公共数据中的指定比特组1(即指定比特中的第五比特)确定用于传输数据块的最后一个资源单元的位置。发射机使用 的N个资源单元可以是该第一个资源单元和该最后一个资源单元之间的所有连续资源单元或具有指定间隔的资源单元。
在一实施例中，可以对用于传输数据块的资源单元的数量N进行限制，例如，令N小于或等于V，其中，V可以为可用资源单元的1/2、1/3等。
图4F为又一实施例提供的一种指定比特的示意图。如图4F所示，发射机可以根据公共数据中的指定比特组0(即指定比特中的第一比特)来确定比特位图对应的当前可用资源单元的起始位置，还可以根据公共数据中的V个比特组成的比特位图(即指定比特中的第一比特位图)从对应的当前可用资源单元中确定用于传输数据块的资源单元数量N以及各个资源单元的位置。然后，发射机将数据块D_1,D_2,...,D_M分别在N个资源单元上进行发送。
在一实施例中，数据块D_1,D_2,...,D_M中可以分别包含有效数据，例如业务数据、指定消息等。M个数据块中包含的有效数据可以是不同的。M个数据块中还可以均包含发射机的身份识别信息，从而可以使得接收机对数据进行解码后知道数据是哪个发射机发送的。M个数据块中的公共数据由这些数据块均需要携带的数据构成，例如可以包含发射机的身份识别信息、某种指定消息等。M个数据块可以是无编码的、编码前的或编码后的数据块。
在一实施例中，M等于N，发射机可以将数据块D_1,D_2,...,D_N分别在N个资源单元上进行发送，在每个资源单元上发送一个数据块。
在一实施例中，M小于N，发射机可以将至少一个数据块在多个资源单元上进行发送，这有利于提升传输可靠性。
在一实施例中，M大于N，发射机可以在至少一个资源单元上采用叠加传输的方式发送多个数据块。
在一实施例中，发射机可以在N个资源单元上先发送M个数据块中的部分数据块，剩余的数据块可以在后续传输时刻进行传输。
在一实施例中，还可以在数据块D_1,D_2,...,D_M中携带N个资源单元或当前传输资源单元上使用的导频信息、序列信息等至少之一。可以通过公共数据或其他具备已有含义的数据比特隐含指示，也可以在各个数据块中分别增加额外的比特来显式的指示导频信息、序列信息等。
在一实施例中，对于数据块D_1,D_2,...,D_M，可以仅在其中一个数据块中携带发射机的身份识别信息，在其他数据块中不携带身份识别信息、或者携带身份识别信息的部分信息、或者携带少量的身份校验信息。接收机可以考虑 进行盲解码，对两种数据块大小分别尝试解码。
在一实施例中，可以在携带发射机身份识别信息的数据块中不携带有效数据，在其他数据块中携带有效数据。在一实施例中，可以保证不同数据块的大小是一致的。
本实施例中，通过发送不同的数据并利用多个数据块中的公共数据部分的比特来隐含的指示资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息等，能够提升传输容量，并且可以节省指示开销。
在一实施例中，发射机将在一个或多个资源单元上发送数据。在多个资源单元上进行数据传输的情况下，发射机将在多个资源单元上发送M个不同的数据块，从而提升竞争免调度传输情况下的传输容量。本实施例中，发射机首先确定用于传输M个数据块的资源单元数量N以及相应的N个资源单元。然后，发射机获取将要在N个资源单元上传输的M个数据块，并分别在N个资源单元上进行发送。
在一实施例中，发射机可以从可用资源单元中随机选择用于传输M个数据块的资源单元数量N，以及随机选择N个资源单元的位置或索引。
在一实施例中，假设发射机需要传输的数据块数量为N，根据该数量N确定用于传输数据块的资源单元数量为N，并随机选择N个资源单元的位置或索引。
图5A为又一实施例提供的一种指定比特的示意图。如图5A所示，发射机先获取待发送的数据组E_1,E_2,...,E_M，这些数据组将分别在N个资源单元上进行传输，然后，发射机分别在这些数据组中增加比特组0(即指定比特中的第一比特)，用于指示资源单元的数量N，并分别在这些数据组中增加比特组1～N(即指定比特中的第二比特)，分别用于指示各个资源单元的位置信息，从而形成数据块D_1,D_2,...,D_M。其中，各个数据块中增加的比特是相同的。
图5B为又一实施例提供的一种指定比特的示意图。如图5B所示，发射机获取待发送的数据组E_1,E_2,...,E_M，分别在这些数据组中增加比特组0(即指定比特中的第三比特)，用于指示比特组的数量X，并分别在这些数据组中增加比特组1～X，用于指示资源单元数量以及至少一个资源单元的位置信息，从而形成数据块D_1,D_2,...,D_M。
图5C为又一实施例提供的一种指定比特的示意图。如图5C所示，发射机获取待发送的数据组E_1,E_2,...,E_M，分别在这些数据组中增加第一比特位 图，用于指示资源单元数量N和相应的N个资源单元的位置，从而形成数据块D_1,D_2,...,D_M。
在一实施例中，发射机可以从可用资源单元中随机选择资源单元数量N，以及随机选择用于传输的第一个资源单元的位置或索引，并将从该资源单元开始的连续N个资源单元或具有指定间隔的N个资源单元确定为用于传输的N个资源单元。
图5D为又一实施例提供的一种指定比特的示意图。如图5D所示，发射机获取待发送的数据组E_1,E_2,...,E_M，分别在这些数据组中增加比特组0(即指定比特中的第一比特)，用于指示资源单元的数量N，还分别在这些数据组中增加比特组1(即指定比特中的第二比特)，用于指示用于传输的第一个资源单元的位置信息，从而形成数据块D_1,D_2,...,D_M。
该实施例中，指定间隔可以是预设的，或者，分别在这些数据组中增加比特组2，用于指示该指定间隔。
对于接收机而言，当在某个资源单元上完成对某个数据块的解码后，可以得到发射机使用的资源单元数量N以及第一个资源单元的位置，从而可以根据这些信息以及当前资源单元推导出发射机使用的其他资源单元，然后可以进一步对这些资源单元上传输的数据块进行解码。
在一实施例中，可以对用于传输的资源单元的数量N进行限制，例如，令N小于或等于V，其中，V可以为可用资源单元的1/2、1/3等。
在一实施例中，发射机可以从可用资源单元中随机选择一个资源单元作为起始资源单元，并将从该资源单元开始的位于指定位置的V个资源单元作为当前可用资源单元。然后，发射机从这些当前可用资源单元中确定用于传输的资源单元数量N、以及相应的资源单元。
图5E为又一实施例提供的一种指定比特的示意图。如图5E所示，发射机获取待发送的数据组E_1,E_2,...,E_M，分别在这些数据组中增加比特组0(即指定比特中的第一比特)，用于指示当前可用资源单元的起始位置信息(即第一个资源单元的位置信息)，还分别在这些数据组中增加比特位图(即指定比特中的第一比特位图)，用于指示当前可用资源单元中用于传输的资源单元数量和各个资源单元的位置，从而形成数据块D_1,D_2,...,D_M。
图5F为又一实施例提供的一种指定比特的示意图。如图5F所示，发射机获取待发送的数据组E_1,E_2,...,E_M，分别在这些数据组中增加比特组0(即 指定比特中的第四比特)，用于指示N个资源单元中第一个资源单元的位置信息，还分别在这些数据组中增加比特组1(即指定比特中的第五比特)，用于指示N个资源单元中最后一个资源单元的位置信息，从而形成数据块D_1,D_2,...,D_M。发射机使用的N个资源单元可以是该第一个资源单元和该最后一个资源单元之间的所有连续资源单元或具有指定间隔的资源单元。
在一实施例中，发射机在第n个资源单元上发送数据块D_m，那么，发射机可以在数据块D_m中仅携带第n个资源单元之外的其他资源单元的位置信息，不再携带当前第n个资源单元的位置，从而可以节省开销，其中，1<＝n<＝N，1<＝m<＝M。具体地，发射机获取待发送的数据组E_1,E_2,...,E_M，分别在这些数据组中增加比特组0，用于指示资源单元数量N或N-1(可以认为二者等价)，分别在这些数据组中增加N-1个比特组，分别用于指示当前资源单元之外的其他资源单元的位置信息，从而形成数据块D_1,D_2,...,D_M。该实施例中，各个数据块中增加的比特是不同的。
在一实施例中，发射机用于传输的资源单元数量可以是固定的，那么，可以不在待发送的数据中额外增加比特来指示资源单元数量，仅需要增加比特来指示资源单元的位置。
在一实施例中，发射机使用全部的可用资源单元进行传输，那么，可以不在待发送的数据中额外增加比特来指示资源单元的数量和位置。
在一实施例中，数据块D_1,D_2,...,D_M中可以分别包含有效数据，例如业务数据、指定消息等。M个数据块中包含的有效数据可以是不同的。M个数据块中还可以均包含发射机的身份识别信息，从而可以使得接收机对数据进行解码后知道数据是哪个发射机发送的。M个数据块可以是无编码的、编码前的或编码后的数据块。
在一实施例中，M等于N，发射机获取待发送的数据组E_1,E_2,...,E_N，分别在这些数据组中增加上述指示比特，形成数据块D_1,D_2,...,D_N，然后将这N个数据块分别在N个资源单元上进行发送，在每个资源单元上发送一个数据块。
在一实施例中，M小于N，发射机可以将至少一个数据块在多个资源单元上进行发送，这有利于提升传输可靠性。
在一实施例中，M大于N，发射机可以在至少一个资源单元上采用叠加传输的方式发送多个数据块。
在一实施例中，发射机可以在N个资源单元上先发送M个数据块中的部分数据块，剩余的数据块可以在后续传输时刻进行传输。
在一实施例中，可以在一个数据组基础上增加不同的指示比特，形成多个数据块，分别在不同的资源单元上进行传输。
在一实施例中，还可以在数据块D_1,D_2,...,D_M中携带N个资源单元或当前传输资源单元上使用的导频信息、序列信息等至少之一。可以通过隐含或显式的方式来指示导频信息、序列信息等。
在一实施例中，对于数据块D_1,D_2,...,D_M，可以仅在其中一个数据块中携带发射机的身份识别信息，在其他数据块中不携带身份识别信息、或者携带身份识别信息的部分信息、或者携带少量的身份校验信息。接收机可以考虑进行盲解码，对两种数据块大小分别尝试解码。
在一实施例中，可以在携带发射机身份识别信息的数据块中不携带有效数据，在其他数据块中携带有效数据。在一实施例中，可以保证不同数据块的大小是一致的。
本实施例中，通过发送不同的数据并在不同的待发送数据中额外增加比特来显式的指示资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息等，能够提升传输容量，有利于控制使用的资源单元，并进行有效的指示，不过会增加指示开销。
在一实施例中，K个发射机T_1,T_2,...,T_K分别按照上述任意实施例中的方法传输数据，其中，K为大于或等于1的整数。
每个发射机确定其用于传输的资源单元数量N以及相应的N个资源单元。例如，第k个发射机T_k确定其用于传输的资源单元数量为N_k，并相应的确定N_k个资源单元的位置或索引，其中，k为大于或等于1并且小于或等于K的整数。K个发射机确定的资源单元数量可能是相同或不同的，相应确定的资源单元的位置可能是相同的、或部分相同的、或不同的。
每个发射机还获取其将要在所确定的资源单元上传输的数据，并在所确定的资源单元上发送所述数据。其中，每个发射机发送的数据中包含以下信息：用于指示资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息。
在一实施例中，每个发射机还确定其在用于传输的每个资源单元上的导频信息、序列信息等至少之一。
在一实施例中，每个发射机发送的数据中还包含以下信息：有效数据，例如业务数据、指定消息等。
在一实施例中，每个发射机发送的数据中还包含以下信息：该发射机的身份识别信息。
在一实施例中，每个发射机发送的数据中还包含以下信息至少之一：导频信息；序列信息等。
在一实施例中，每个发射机发送的数据中包含的信息为该发射机使用的信息。
本实施例中，K个发射机分别在各自确定的一个或多个资源单元上进行数据传输，当一个发射机在某个资源单元上没有与其他发射机发生碰撞时，该发射机发送的数据在很大概率上可以被接收机成功解码，进而接收机可以从解码数据中获取该发射机使用的其他资源单元等信息，并利用这些信息对这些资源单元上的数据进行处理(例如检测、解码、信道估计、干扰消除等至少之一)，从而可以提高数据传输的可靠性，改善存在碰撞情况的传输性能，改善竞争免调度传输的性能和容量。
本申请实施例中还提供了一种数据传输方法，应用于接收机。发射机使用N个资源单元传输M个数据块，并在每个数据块中携带资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息，为接收机处理提供可靠的依据。在此基础上，接收机可以从解码数据中获取到该发射机所使用的资源单元等信息，利用这些信息可以对这些资源单元上的数据进行全面地处理，从而可以提高数据传输的可靠性，改善存在碰撞情况的传输性能，改善竞争免调度传输的性能和容量。
图6为另一实施例提供的一种数据传输方法的流程图，如图6所示，本实施例提供的方法包括步骤210和步骤220。
在步骤210中，确定待检测的资源单元。
在步骤220中，在所述待检测的资源单元上进行检测，获取第一检测结果，其中，所述第一检测结果包括M个数据块中的至少一个数据块，所述第一检测结果中包含用于指示传输所述M个数据块所使用的资源单元数量N以及N个资 源单元中的至少一个资源单元的位置的信息，其中，M为大于或等于1的整数，N为大于或等于1的整数。
本实施例中，接收机可以在配置的全部可用资源单元中确定待检测的资源单元，对这些资源单元上的接收符号进行检测，如果通过检测可以得到M个数据块中的至少一个数据块，并且得到指示信息(指示传输M个数据块所使用的资源单元数量N以及N个资源单元中至少一个资源单元的位置)，据此可以对N个资源单元继续进行检测和处理。
需要说明的是，接收机执行的操作与上述任意实施例中发射机执行的操作相对应，未在本实施例中详尽描述的技术细节可参见上述任意实施例。
在一实施例中，所述第一检测结果还包括以下信息至少之一：可用资源单元的起始位置信息；可用资源单元的数量信息；N个资源单元中的至少一个资源单元上的导频信息；N个资源单元中的至少一个资源单元上的序列信息；身份识别信息；有效数据。
本实施例中，第一检测结果除了可以指示资源单元数量N以及其中至少一个资源单元的位置，还可以包括可用资源单元的起始位置信息、可用资源单元的数量信息等，接收机据此可以确定待检测的资源单元的范围；还可以包括某个发射机在至少一个资源单元上使用的导频信息、序列信息等，接收机据此可以准确获取该发射机使用的相应信息；还可以包括身份识别信息，接收机据此可以确定接收的是哪一个发射机发送的数据；还可以包括有效数据，接收机通过解码和处理，实现对应的业务处理。
在一实施例中，步骤220，包括：
获取所述待检测的资源单元上的接收符号；对所述接收符号进行检测，获取所述第一检测结果。
在一实施例中，还包括：
步骤230：根据所述第一检测结果中包含的用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，确定待处理的资源单元，或者，更新所述待检测的资源单元。
本实施例中，接收机根据第一检测结果所指示的资源单元数量N以及N个资源单元中至少一个资源单元的位置，可以确定下一个需要检测的资源单元， 或者确定需要进一步进行处理的资源单元。对于待处理的资源单元，可能进行以下处理：检测、重构、信道估计、干扰消除。
在一实施例中，还包括：
步骤240：根据所述第一检测结果进行重构，得到重构后的符号。
步骤250：根据重构后的符号对所述N个资源单元中的至少一个资源单元上的信道进行信道估计，得到信道估计结果。
在一实施例中，还包括：
步骤260：根据所述重构后的符号和所述信道估计结果，对所述至少一个资源单元上的接收符号进行干扰消除，得到干扰消除后的接收符号。
步骤270：对所述干扰消除后的接收符号进行检测，获取第二检测结果。
本实施例中，接收符号可以是至少一个资源单元上的最初的接收符号，或者是没有经过干扰消除的接收符号。根据重构后的符号和信道估计结果，可以对接收符号进行干扰消除，并进行进一步的检测，得到第二检测结果，从而可以获得更好的检测性能，实现全面可靠地接收处理。
在一实施例中，还包括：
步骤280：根据所述信道估计结果，对所述至少一个资源单元上的接收符号进行检测，获取第三检测结果。
本实施例中，接收符号可以是没有经过干扰消除的接收符号，也可以是经过干扰消除后的符号(例如上一次干扰消除后的符号或本次干扰消除后的符号)。根据信道估计结果，可以对至少一个资源单元上的接收符号进行进一步检测，得到第三检测结果，从而可以获得更好的检测性能，实现全面可靠地接收处理。
在一实施例中，K个发射机分别在各自确定的一个或多个资源单元上进行传输，经过信道传输后，到达接收端，接收机对接收信号进行检测解码。其中，K为大于或等于1的整数。
在一实施例中，发射机可以为终端设备或用户设备，接收机可以为基站设备。
在一实施例中，接收机将P个可用资源单元确定为将要进行检测的资源单 元，并在P个可用资源单元上分别进行检测，获取Q个检测结果。其中，P为大于或等于1的整数，Q为大于或等于0的整数。在一实施例中，Q与发射机数量、每个发射机使用的资源等因素有关。从Q个检测结果的至少一个检测结果中，接收机可以获取以下信息：资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息。该信息为一个发射机使用的用于传输的资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息。
在一实施例中，接收机根据所获取的信息，可以确定该发射机使用的资源单元数量N以及N个资源单元的位置，从而可以确定对于该发射机而言其他需要处理的资源单元，其中，所述处理包括检测、解码、信道估计、干扰消除等至少之一。
在一实施例中，接收机还可以从检测结果中获取以下信息：有效数据，例如业务数据、指定消息等。在一实施例中，接收机还可以从检测结果中获取以下信息：发射机的身份识别信息。在一实施例中，接收机还可以从检测结果中获取以下信息至少之一：导频信息；序列信息等。一些具体细节与上述实施例类似，不再赘述。
在一实施例中，接收机可以对接收数据进行盲解码，对多种数据块大小分别尝试解码。例如，发射机发送的多个数据块中，有的数据块携带了身份识别信息，有的没有携带身份识别信息或者携带了身份识别信息的部分信息，从而使得多个数据块具有不同的大小。
在一实施例中，接收机还可以对该发射机发送的符号进行重构，得到重构后的符号。
在一实施例中，接收机还可以利用重构后的符号进行信道估计，获取N个资源单元中至少一个资源单元上的信道估计结果。该过程至少可以用于获取当前检测结果对应的资源单元的信道估计结果，也可以用于获取其他资源单元上的信道估计结果。
在一实施例中，接收机还可以根据所述重构后的符号和所述信道估计结果，对N个资源单元中至少一个资源单元上的接收符号进行干扰消除，获取更新的接收符号。该过程至少可以用于对当前检测结果对应的资源单元上的接收符号进行干扰消除，也可以用于对其他资源单元上的接收符号进行干扰消除。
在一实施例中，上述更新的接收符号用于供接收机在相应资源单元上进行新一轮检测，获取新的检测结果。
在一实施例中，上述信道估计结果用于供接收机对上述其他需要检测的资源单元进行检测，获取新的检测结果。
在一实施例中，接收机不知道可用资源单元的起始位置、数量或范围，接收机可以将至少一个可能的可用资源单元确定为将要进行检测的资源单元，并进行检测。当在某个资源单元上获取到检测结果后，接收机可以从检测结果中获取以下信息：资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息；以及以下信息：可用资源单元的起始位置信息。在一实施例中，接收机还可以从检测结果中获取到以下信息：可用资源单元的数量信息。
在一实施例中，接收机迭代执行上述处理过程中的至少一部分。
需要说明的是，上述实施例中的“第一”、“第二”、“第三”等仅用于描述上的区分，并不强调先后顺序，在一种情况下，例如迭代检测时，可以统称为检测结果，在实现上可以由同一个参数或变量表示。
本申请实施例还提供一种数据传输装置。图7为一实施例提供的一种数据传输装置的结构示意图。如图7所示，所述数据传输装置包括：资源确定模块310、数据块获取模块320和传输模块330。
资源确定模块310，设置为确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数；
数据块获取模块320，设置为获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息；
传输模块330，设置为在所述N个资源单元上传输所述M个数据块。
本实施例的数据传输装置，通过使用N个资源单元传输M个数据块，并在每个数据块中携带资源单元数量N以及N个资源单元中至少一个资源单元的位置的信息，为接收机处理提供可靠的依据。在此基础上，接收机可以从解码数据中获取到发射机所使用的资源单元等信息，利用这些信息可以对这些资源单 元上的数据进行全面地处理，从而可以提高数据传输的可靠性，改善存在碰撞情况的传输性能，改善竞争免调度传输的性能和容量。
在一实施例中，资源确定模块310设置为：
根据所述每个数据块中包含的用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息，确定所述资源单元数量N以及相应的N个资源单元。
在一实施例中，资源确定模块310，设置为以下之一：
随机确定所述资源单元数量N并随机选择N个资源单元；
根据待传输的数据块的数量M确定所述资源单元数量N，并随机选择N个资源单元。
在一实施例中，数据块获取模块320，设置为：
获取M个数据组，分别在每个数据组中增加用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息，生成待传输的M个数据块。
在一实施例中，每个数据块中包含指定比特，所述指定比特用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息。
在一实施例中，所述指定比特为隐式指示比特或者显式指示比特。
在一实施例中，所述指定比特为公共数据中的数据比特，其中，所述公共数据为M个数据块中均包含的数据。
在一实施例中，所述指定比特，包括以下之一：
用于指示所述资源单元数量N的第一比特，以及用于指示所述N个资源单元中的至少一个资源单元的位置的第二比特；
用于指示比特组数量X的第三比特，以及用于指示所述N个资源单元中的至少一个资源单元的位置的X个比特组，其中，X为大于或等于1的整数；
用于指示所述N个资源单元中的至少一个资源单元的位置的第一比特位图；
用于指示所述N个资源单元中的第一个资源单元的位置的第四比特和最后 一个资源单元的位置的第五比特。
在一实施例中，资源确定模块310，设置为：
在所述指定比特包括用于指示所述N个资源单元中的至少一个资源单元的位置的第一比特位图，且所述第一比特位图的值全为0或者值为1的数量超过指定值的情况下，按照指定规则确定所述资源单元数量N以及相应的N个资源单元。
在一实施例中，每个数据块中还包含以下信息至少之一：
可用资源单元的起始位置信息；
可用资源单元的数量信息。
在一实施例中，所述N个资源单元满足以下至少之一：
所述N个资源单元位于相关带宽范围内；
所述N个资源单元位于相关时间范围内；
所述N个资源单元上的信道是相关的。
在一实施例中，每个数据块中还包含以下信息至少之一：
在所述N个资源单元中的至少一个资源单元上使用的导频信息；
在所述N个资源单元中的至少一个资源单元上使用的序列信息。
在一实施例中，所述M个数据块中的至少一个数据块中还包含身份识别信息。
在一实施例中，所述M个数据块中的至少一个数据块中还包含有效数据。
本实施例提出的数据传输装置与上述实施例提出的应用于发射机的数据传输方法属于同一构思，未在本实施例中详尽描述的技术细节可参见上述任意实施例，并且本实施例具备与执行应用于发射机的数据传输方法相同的有益效果。
本申请实施例还提供一种数据传输装置。图8为另一实施例提供的一种数据传输装置的结构示意图。如图8所示，所述数据传输装置包括：待检测资源确定模块410和检测模块420。
待检测资源确定模块410，设置为确定待检测的资源单元；
检测模块420，设置为在所述待检测的资源单元上进行检测，获取第一检测结果，其中，所述第一检测结果包括M个数据块中的至少一个数据块，所述第一检测结果中包含用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，其中，M为大于或等于1的整数，N为大于或等于1的整数。
本实施例的数据传输装置，通过使用N个资源单元传输M个数据块，并在每个数据块中携带资源单元数量N以及N个资源单元中至少一个资源单元的位置信息，接收机可以从解码数据中获取到发射机所使用的资源单元等信息，利用这些信息可以对这些资源单元上的数据进行全面地处理，从而可以提高数据传输的可靠性，改善存在碰撞情况的传输性能，改善竞争免调度传输的性能和容量。
在一实施例中，所述第一检测结果还包括以下信息至少之一：可用资源单元的起始位置信息；可用资源单元的数量信息；N个资源单元中的至少一个资源单元上的导频信息；N个资源单元中的至少一个资源单元上的序列信息；身份识别信息；有效数据。
在一实施例中，检测模块420，设置为：获取所述待检测的资源单元上的接收符号；对所述接收符号进行检测，获取所述第一检测结果。
在一实施例中，还包括：
待检测资源确定模块410，还设置为根据所述第一检测结果中包含的用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，确定待处理的资源单元，或者，更新所述待检测的资源单元。
在一实施例中，还包括：
重构模块，设置为根据所述第一检测结果进行重构，得到重构后的符号；
信道估计模块，设置为根据重构后的符号对所述N个资源单元中的至少一个资源单元上的信道进行信道估计，得到信道估计结果。
在一实施例中，还包括：
干扰消除模块，设置为根据所述重构后的符号和所述信道估计结果，对所述至少一个资源单元上的接收符号进行干扰消除，得到干扰消除后的接收符号；
检测模块420还设置为：对所述干扰消除后的接收符号进行检测，获取第二检测结果。
在一实施例中，检测模块420还设置为：
根据所述信道估计结果，对所述至少一个资源单元上的接收符号进行检测，获取第三检测结果。
本实施例提出的数据传输装置与上述实施例提出的应用于接收机的数据传输方法属于同一构思，未在本实施例中详尽描述的技术细节可参见上述任意实施例，并且本实施例具备与执行应用于接收机的数据传输方法相同的有益效果。
本申请实施例还提供一种发射机。上述实施例中应用于发射机的数据传输方法可以由数据传输装置执行，该数据传输装置可以通过软件和/或硬件的方式实现，并集成在所述发射机中。所述发射机可以为终端。
图9为一实施例提供的一种发射机的硬件结构示意图。如图9所示，本实施例提供的一种发射机，包括：处理器510和存储装置520。该发射机中的处理器510可以是一个或多个，图9中以一个处理器510为例，所述发射机中的处理器510和存储装置520可以通过总线或其他方式连接，图9中以通过总线连接为例。
所述一个或多个程序被所述一个或多个处理器510执行，使得所述一个或多个处理器510实现上述任一实施例所述的应用于发射机的数据传输方法。
该发射机中的存储装置520作为一种计算机可读存储介质，可用于存储一个或多个程序，所述程序可以是软件程序、计算机可执行程序以及模块，如本发明实施例中数据传输方法对应的程序指令/模块(例如，附图7所示的数据传输装置中的模块，包括：资源确定模块310、数据块获取模块320和传输模块330)。处理器510通过运行存储在存储装置520中的软件程序、指令以及模块，从而执行发射机的各种功能应用以及数据处理，即实现上述方法实施例中应用于发射机的数据传输方法。
存储装置520主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据设备的使用所创建的数据等(如上述实施例中的数据块、用于指示资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息等)。此外，存储装置520可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些示例中，存储装置520可进一步包括相对于处理器510远程设置的存储器，这些远程存储器可以通过网络连接至发射机。上述网络的示例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
并且，当上述发射机中所包括一个或者多个程序被所述一个或者多个处理器510执行时，实现如下操作：确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数；获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息；在所述N个资源单元上传输所述M个数据块。
本实施例提出的发射机与上述实施例提出的应用于发射机的数据传输方法属于同一构思，未在本实施例中详尽描述的技术细节可参见上述任意实施例，并且本实施例具备与执行应用于发射机的数据传输方法相同的有益效果。
本申请实施例还提供一种接收机。上述实施例中应用于接收机的数据传输方法可以由数据传输装置执行，该数据传输装置可以通过软件和/或硬件的方式实现，并集成在所述接收机中。所述接收机可以为基站。
图10为一实施例提供的一种接收机的硬件结构示意图。如图10所示，本实施例提供的一种接收机，包括：处理器610和存储装置620。该接收机中的处理器610可以是一个或多个，图10中以一个处理器610为例，所述接收机中的处理器610和存储装置620可以通过总线或其他方式连接，图10中以通过总线连接为例。
所述一个或多个程序被所述一个或多个处理器610执行，使得所述一个或多个处理器610实现上述任一实施例所述的应用于接收机的数据传输方法。
该接收机中的存储装置620作为一种计算机可读存储介质，可用于存储一个或多个程序，所述程序可以是软件程序、计算机可执行程序以及模块，如本发明实施例中数据传输方法对应的程序指令/模块(例如，附图8所示的数据传输装置中的模块，包括：待检测资源确定模块410和检测模块420)。处理器610通过运行存储在存储装置620中的软件程序、指令以及模块，从而执行接收机的各种功能应用以及数据处理，即实现上述方法实施例中应用于接收机的数据传输方法。
存储装置620主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据设备的使用所创建的数据等(如上述实施例中的数据块、第一检测结果等)。此外，存储装置620可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些示例中，存储装置620可进一步包括相对于处理器610远程设置的存储器，这些远程存储器可以通过网络连接至接收机。上述网络的示例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
并且，当上述接收机中所包括的一个或者多个程序被所述一个或者多个处理器610执行时，实现如下操作：确定待检测的资源单元；所述待检测的资源单元上进行检测，获取第一检测结果，其中，所述第一检测结果包括M个数据块中的至少一个数据块，所述第一检测结果中包含用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，其中，M为大于或等于1的整数，N为大于或等于1的整数。
本实施例提出的接收机与上述实施例提出的应用于接收机的数据传输方法属于同一构思，未在本实施例中详尽描述的技术细节可参见上述任意实施例，并且本实施例具备与执行应用于接收机的数据传输方法相同的有益效果。
本申请实施例还提供一种包含计算机可执行指令的存储介质，计算机可执行指令在由计算机处理器执行时用于执行一种数据传输方法。该方法包括：确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数；获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用 于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息；在所述N个资源单元上传输所述M个数据块。
或者，该方法包括：确定待检测的资源单元；所述待检测的资源单元上进行检测，获取第一检测结果，其中，所述第一检测结果包括M个数据块中的至少一个数据块，所述第一检测结果中包含用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，其中，M为大于或等于1的整数，N为大于或等于1的整数。
通过以上关于实施方式的描述，所属领域的技术人员可以了解到，本申请可借助软件及通用硬件来实现，也可以通过硬件实现。基于这样的理解，本申请的技术方案可以以软件产品的形式体现出来，该计算机软件产品可以存储在计算机可读存储介质中，如计算机的软盘、只读存储器(Read-Only Memory,ROM)、随机存取存储器(Random Access Memory,RAM)、闪存(FLASH)、硬盘或光盘等，包括多个指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请任意实施例所述的方法。
以上所述，仅为本申请的示例性实施例而已，并非用于限定本申请的保护范围。
本申请附图中的任何逻辑流程的框图可以表示程序步骤，或者可以表示相互连接的逻辑电路、模块和功能，或者可以表示程序步骤与逻辑电路、模块和功能的组合。计算机程序可以存储在存储器上。存储器可以具有任何适合于本地技术环境的类型并且可以使用任何适合的数据存储技术实现，例如但不限于只读存储器(Read-Only Memory，ROM)、随机访问存储器(Random Access Memory，RAM)、光存储器装置和系统(数码多功能光碟(Digital Video Disk，DVD)或便携式紧凑磁盘(Compact Disc，CD)光盘)等。计算机可读介质可以包括非瞬时性存储介质。数据处理器可以是任何适合于本地技术环境的类型，例如但不限于通用计算机、专用计算机、微处理器、数字信号处理器(Digital Signal Processor，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、可编程逻辑器件(Field Programmable Gate Array，FPGA)以及基于多核处理器架构的处理器。

Claims (26)

  1. 一种数据传输方法，应用于发射机，包括：
    确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数；
    获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息；
    在所述N个资源单元上传输所述M个数据块。
  2. 根据权利要求1所述的方法，其中，所述确定资源单元数量N以及相应的N个资源单元，包括：
    根据所述每个数据块中包含的用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息，确定所述资源单元数量N以及所述相应的N个资源单元。
  3. 根据权利要求1所述的方法，其中，所述确定资源单元数量N以及相应的N个资源单元，包括以下之一：
    随机确定所述资源单元数量N并随机选择所述N个资源单元；
    根据待传输的数据块的数量M确定所述资源单元数量N，并随机选择所述N个资源单元。
  4. 根据权利要求1所述的方法，其中，所述获取待传输的M个数据块，包括：
    获取M个数据组，分别在每个数据组中增加用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息，生成所述待传输的M个数据块。
  5. 根据权利要求1所述的方法，其中，每个数据块中包含指定比特，所述指定比特用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息。
  6. 根据权利要求5所述的方法，其中，所述指定比特为隐式指示比特或者显式指示比特。
  7. 根据权利要求5所述的方法，其中，所述指定比特为公共数据中的数据比特，其中，所述公共数据为所述M个数据块中均包含的数据。
  8. 根据权利要求5所述的方法，其中，所述指定比特，包括以下之一：
    用于指示所述资源单元数量N的第一比特，以及用于指示所述N个资源单元中的至少一个资源单元的位置的第二比特；
    用于指示比特组数量X的第三比特，以及用于指示所述N个资源单元中的至少一个资源单元的位置的X个比特组，其中，X为大于或等于1的整数；
    用于指示所述N个资源单元中的至少一个资源单元的位置的第一比特位图；
    用于指示所述N个资源单元中的第一个资源单元的位置的第四比特和最后一个资源单元的位置的第五比特。
  9. 根据权利要求8所述的方法，其中，所述确定资源单元数量N以及相应的N个资源单元，包括：在所述指定比特包括用于指示所述N个资源单元中的至少一个资源单元的位置的第一比特位图，且所述第一比特位图的比特的值全为0或者值为1的数量超过指定值的情况下，按照指定规则确定所述资源单元数量N以及所述相应的N个资源单元。
  10. 根据权利要求1所述的方法，其中，每个数据块中还包含以下信息至少之一：
    可用资源单元的起始位置信息；
    可用资源单元的数量信息。
  11. 根据权利要求1所述的方法，其中，所述N个资源单元满足以下至少之一：
    所述N个资源单元位于相关带宽范围内；
    所述N个资源单元位于相关时间范围内；
    所述N个资源单元上的信道是相关的。
  12. 根据权利要求1所述的方法，其中，每个数据块中还包含以下信息至少之一：
    在所述N个资源单元中的至少一个资源单元上使用的导频信息；
    在所述N个资源单元中的至少一个资源单元上使用的序列信息。
  13. 根据权利要求1所述的方法，其中，所述M个数据块中的至少一个数据块中还包含身份识别信息。
  14. 根据权利要求1所述的方法，其中，所述M个数据块中的至少一个数据块中还包含有效数据。
  15. 一种数据传输方法，应用于接收机，包括：
    确定待检测的资源单元；
    在所述待检测的资源单元上进行检测，获取第一检测结果，其中，所述第一检测结果包括M个数据块中的至少一个数据块，所述第一检测结果中包含用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，M为大于或等于1的整数，N为大于或等于1的整数。
  16. 根据权利要求15所述的方法，其中，所述第一检测结果还包括以下信息至少之一：
    可用资源单元的起始位置信息；
    可用资源单元的数量信息；
    所述N个资源单元中的至少一个资源单元上的导频信息；
    所述N个资源单元中的至少一个资源单元上的序列信息；
    身份识别信息；
    有效数据。
  17. 根据权利要求15所述的方法，其中，所述在所述待检测的资源单元上进行检测，获取第一检测结果，包括：
    获取所述待检测的资源单元上的接收符号；
    对所述接收符号进行检测，获取所述第一检测结果。
  18. 根据权利要求15所述的方法，还包括：
    根据所述第一检测结果中包含的用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，确定待处理的资源单元，或者，更新所述待检测的资源单元。
  19. 根据权利要求15所述的方法，还包括：
    根据所述第一检测结果进行重构，得到重构后的符号；
    根据所述重构后的符号对所述N个资源单元中的至少一个资源单元上的信道进行信道估计，得到信道估计结果。
  20. 根据权利要求19所述的方法，还包括：
    根据所述重构后的符号和所述信道估计结果，对所述至少一个资源单元上的接收符号进行干扰消除，得到干扰消除后的接收符号；
    对所述干扰消除后的接收符号进行检测，获取第二检测结果。
  21. 根据权利要求19所述的方法，还包括：
    根据所述信道估计结果，对所述至少一个资源单元上的接收符号进行检测，获取第三检测结果。
  22. 一种数据传输装置，包括：
    资源确定模块，设置为确定资源单元数量N以及相应的N个资源单元，N为大于或等于1的整数；
    数据块获取模块，设置为获取待传输的M个数据块，M为大于或等于1的整数，其中，每个数据块中包含用于指示所述资源单元数量N以及所述N个资源单元中的至少一个资源单元的位置的信息；
    传输模块，设置为在所述N个资源单元上传输所述M个数据块。
  23. 一种数据传输装置，包括：
    待检测资源确定模块，设置为确定待检测的资源单元；
    检测模块，设置为在所述待检测的资源单元上进行检测，获取第一检测结果，其中，所述第一检测结果包括M个数据块中的至少一个数据块，所述第一检测结果中包含用于指示传输所述M个数据块所使用的资源单元数量N以及N个资源单元中的至少一个资源单元的位置的信息，M为大于或等于1的整数，N为大于或等于1的整数。
  24. 一种发射机，包括：
    一个或多个处理器；
    存储装置，设置为存储一个或多个程序；
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如权利要求1-14中任一项所述的数据传输方法。
  25. 一种接收机，包括：
    一个或多个处理器；
    存储装置，设置为存储一个或多个程序；
    当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如权利要求15-21中任一项所述的数据传输方法。
  26. 一种计算机可读存储介质，存储有计算机程序，其中，所述计算机程序被处理器执行时实现如权利要求1-14中任一项所述的数据传输方法或如权利要求15-21中任一项所述的数据传输方法。
PCT/CN2021/099385 2020-06-12 2021-06-10 数据传输方法、装置、发射机、接收机及存储介质 WO2021249481A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP21821006.0A EP4167676A1 (en) 2020-06-12 2021-06-10 Data transmission method and apparatus, transmitter, receiver, and storage medium
CA3182416A CA3182416A1 (en) 2020-06-12 2021-06-10 Data transmission method and apparatus, transmitter, receiver, and storage medium
KR1020237001041A KR20230024974A (ko) 2020-06-12 2021-06-10 데이터 전송 방법, 장치, 송신기, 수신기 및 저장 매체
US18/009,892 US20230224110A1 (en) 2020-06-12 2021-06-10 Data transmission method and apparatus, transmitter, receiver, and storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010538212.0A CN111901892A (zh) 2020-06-12 2020-06-12 数据传输方法、装置、发射机、接收机及存储介质
CN202010538212.0 2020-06-12

Publications (1)

Publication Number Publication Date
WO2021249481A1 true WO2021249481A1 (zh) 2021-12-16

Family

ID=73206325

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/099385 WO2021249481A1 (zh) 2020-06-12 2021-06-10 数据传输方法、装置、发射机、接收机及存储介质

Country Status (6)

Country Link
US (1) US20230224110A1 (zh)
EP (1) EP4167676A1 (zh)
KR (1) KR20230024974A (zh)
CN (1) CN111901892A (zh)
CA (1) CA3182416A1 (zh)
WO (1) WO2021249481A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111901892A (zh) * 2020-06-12 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、发射机、接收机及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107801243A (zh) * 2016-08-29 2018-03-13 华为技术有限公司 一种下行传输方法及装置
WO2019033396A1 (zh) * 2017-08-18 2019-02-21 Oppo广东移动通信有限公司 无线通信方法和设备
CN110267227A (zh) * 2018-03-12 2019-09-20 华为技术有限公司 一种数据传输方法、相关设备及系统
CN110959300A (zh) * 2018-07-27 2020-04-03 北京小米移动软件有限公司 数据传输方法、装置、设备、系统及存储介质
CN111901892A (zh) * 2020-06-12 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、发射机、接收机及存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107801243A (zh) * 2016-08-29 2018-03-13 华为技术有限公司 一种下行传输方法及装置
WO2019033396A1 (zh) * 2017-08-18 2019-02-21 Oppo广东移动通信有限公司 无线通信方法和设备
CN110267227A (zh) * 2018-03-12 2019-09-20 华为技术有限公司 一种数据传输方法、相关设备及系统
CN110959300A (zh) * 2018-07-27 2020-04-03 北京小米移动软件有限公司 数据传输方法、装置、设备、系统及存储介质
CN111901892A (zh) * 2020-06-12 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、发射机、接收机及存储介质

Also Published As

Publication number Publication date
EP4167676A1 (en) 2023-04-19
KR20230024974A (ko) 2023-02-21
US20230224110A1 (en) 2023-07-13
CN111901892A (zh) 2020-11-06
CA3182416A1 (en) 2021-12-16

Similar Documents

Publication Publication Date Title
US11849433B2 (en) Method and device for determining transmission parameters and storage medium
CN108347318B (zh) 一种上行传输方法及装置
US11784864B2 (en) Physical layer protocol data unit transmission method and apparatus
US11272533B2 (en) Random-access sending and receiving method and apparatus, transmitting end and receiving end
WO2017000233A1 (zh) 传输导频序列的方法和装置
CN108882314B (zh) 多端口数据传输的方法及设备
KR20170089897A (ko) 정보 처리 방법, 기지국, 및 단말기
WO2018027985A1 (zh) 无线宽带终端设备的上行数据传输方法和装置
WO2021249481A1 (zh) 数据传输方法、装置、发射机、接收机及存储介质
WO2021143632A1 (zh) 数据传输方法、装置、第一通信节点和第二通信节点
CN111726878A (zh) 下行控制信息的检测方法和装置
CN110958589B (zh) 数据传输方法、装置及存储介质
EP4093138A1 (en) Data processing methods and apparatuses, first communication node, second communication mode, and storage medium
CN114257354A (zh) 一种传输方法、终端设备及网络侧设备
US10979263B2 (en) Data processing method and device
WO2018184513A1 (zh) 一种数据处理方法，基站以及接收设备
WO2019140701A1 (zh) 一种信息确定方法及装置、计算机存储介质
WO2021143529A1 (zh) 信号处理方法、装置、第一通信节点、第二通信节点及存储介质
CN107205273B (zh) 一种dci盲探测数据的处理方法及装置
CN111756483B (zh) 一种反馈信息传输方法和终端
WO2016184097A1 (zh) 一种信号处理方法、网络设备、系统及计算机存储介质
CN113613342B (zh) 异步免调度多址接入方法、装置、电子设备和存储介质
WO2022151267A1 (zh) 一种监听方法及设备
WO2023193634A1 (zh) 传输方法、电子设备和存储介质
CN116582225A (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: 21821006

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 3182416

Country of ref document: CA

ENP Entry into the national phase

Ref document number: 20237001041

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2021821006

Country of ref document: EP

Effective date: 20230112