Data transmission method and apparatus, transmitter, receiver, and storage medium

Abstract

The application provides a data transmission method and device, a transmitter, a receiver and a storage medium. The method determines a resource unit quantity N and corresponding N resource units, N being an integer greater than or equal to 1; obtains M data blocks to be transmitted, M being an integer greater than or equal to 1, wherein each data block contains information for indicating the resource unit quantity N and the position of at least one resource unit in the N resource units; and transmits the M data blocks on the N resource units.

Description

Technical Field

[0001] This application relates to wireless communication technologies, such as a data transmission method, apparatus, transmitter, receiver, and storage medium. Background Technology

[0002] In contention-based, scheduling-free transmission, when there is a need for service transmission, the transmitter can randomly select resources for data transmission, such as time-frequency resources and pilot signals, to compete for access and transmission. The resources selected by different transmitters may collide, leading to unstable or failed data transmission, affecting the reliability and capacity of data transmission. Summary of the Invention

[0003] This application provides a data transmission method, apparatus, transmitter, receiver, and storage medium. By transmitting data on one or more resource units and carrying the number and location information of the resource units in the transmitted data blocks, the receiver can perform comprehensive reception and processing, thereby improving the reliability and capacity of data transmission.

[0004] This application provides a data transmission method applied to a transmitter, including:

[0005] Determine the number of resource units N and the corresponding N resource units, where N is an integer greater than or equal to 1;

[0006] Obtain M data blocks to be transmitted, where M is an integer greater than or equal to 1, wherein each data block contains information indicating the number N of resource units and the location of at least one of the N resource units;

[0007] The M data blocks are transmitted on the N resource units.

[0008] This application also provides a data transmission method applied to a receiver, including:

[0009] Identify the resource unit to be detected;

[0010] Detection is performed 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, and the first detection result contains information for indicating the number N of resource units used to transmit the M data blocks and the location of at least one resource unit among the N resource units, wherein M is an integer greater than or equal to 1 and N is an integer greater than or equal to 1.

[0011] This application also provides a data transmission device, including:

[0012] The resource determination module is set to determine the number of resource units N and the corresponding N resource units, where N is an integer greater than or equal to 1;

[0013] 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. Each data block contains information indicating the number N of resource units and the location of at least one of the N resource units.

[0014] The transmission module is configured to transmit the M data blocks over the N resource units.

[0015] This application also provides a data transmission device, including:

[0016] The module for determining resources to be detected is configured to determine the resource units to be detected.

[0017] 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 for indicating the number N of resource units used to transmit the M data blocks and the location of at least one resource unit among the N resource units, wherein M is an integer greater than or equal to 1 and N is an integer greater than or equal to 1.

[0018] This application also provides a transmitter, including:

[0019] One or more processors;

[0020] Storage device for storing one or more programs;

[0021] When the one or more programs are executed by the one or more processors, the one or more processors implement the data transmission method applied to the transmitter described above.

[0022] This application also provides a receiver, including:

[0023] One or more processors;

[0024] Storage device for storing one or more programs;

[0025] When the one or more programs are executed by the one or more processors, the one or more processors implement the data transmission method applied to the receiver as described above.

[0026] This application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described data transmission method. Attached Figure Description

[0027] Figure 1 A flowchart illustrating a data transmission method provided in one embodiment;

[0028] Figure 2A A schematic diagram of a specified bit provided for one embodiment;

[0029] Figure 2B A schematic diagram of a specified bit provided for another embodiment;

[0030] Figure 2C A schematic diagram of a specified bit provided for yet another embodiment;

[0031] Figure 2D A schematic diagram of a specified bit provided for yet another embodiment;

[0032] Figure 2E A schematic diagram of a specified bit provided for yet another embodiment;

[0033] Figure 2F A schematic diagram of a specified bit provided for yet another embodiment;

[0034] Figure 3A A schematic diagram of a specified bit provided for yet another embodiment;

[0035] Figure 3B A schematic diagram of a specified bit provided for yet another embodiment;

[0036] Figure 3C A schematic diagram of a specified bit provided for yet another embodiment;

[0037] Figure 3D A schematic diagram of a specified bit provided for yet another embodiment;

[0038] Figure 3E A schematic diagram of a specified bit provided for yet another embodiment;

[0039] Figure 3F A schematic diagram of a specified bit provided for yet another embodiment;

[0040] Figure 4A A schematic diagram of a specified bit provided for yet another embodiment;

[0041] Figure 4B A schematic diagram of a specified bit provided for yet another embodiment;

[0042] Figure 4C A schematic diagram of a specified bit provided for yet another embodiment;

[0043] Figure 4D A schematic diagram of a specified bit provided for yet another embodiment;

[0044] Figure 4E A schematic diagram of a specified bit provided for yet another embodiment;

[0045] Figure 4F A schematic diagram of a specified bit provided for yet another embodiment;

[0046] Figure 5A A schematic diagram of a specified bit provided for yet another embodiment;

[0047] Figure 5B A schematic diagram of a specified bit provided for yet another embodiment;

[0048] Figure 5C A schematic diagram of a specified bit provided for yet another embodiment;

[0049] Figure 5D A schematic diagram of a specified bit provided for yet another embodiment;

[0050] Figure 5E A schematic diagram of a specified bit provided for yet another embodiment;

[0051] Figure 5F A schematic diagram of a specified bit provided for yet another embodiment;

[0052] Figure 6 A flowchart of a data transmission method provided in another embodiment;

[0053] Figure 7 A schematic diagram of the structure of a data transmission device provided in one embodiment;

[0054] Figure 8 A schematic diagram of a data transmission device is provided for another embodiment;

[0055] Figure 9 This is a schematic diagram of the hardware structure of a transmitter provided in one embodiment;

[0056] Figure 10 This is a schematic diagram of the hardware structure of a receiver provided in one embodiment. Detailed Implementation

[0057] The present application will now be described in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are merely illustrative of the application and not intended to limit it. It should be noted that, unless otherwise specified, the embodiments and features described herein can be arbitrarily combined with each other. Furthermore, it should be noted that, for ease of description, the accompanying drawings show only the parts relevant to the present application, not the entire structure.

[0058] In grant-free transmission, transmitters (such as user terminals) can send data autonomously without sending scheduling requests or waiting for dynamic scheduling. Grant-free transmission reduces signaling overhead and transmission latency, and also reduces transmitter power consumption. Furthermore, combining grant-free transmission with non-orthogonal transmission can increase the number of transmitters that can access the wireless network.

[0059] Scheduling-free transmission includes two schemes: semi-persistent scheduling (or configured grant) and contention-based scheduling. For semi-persistent scheduling, the receiver (e.g., a base station) can pre-configure or semi-statically configure time-frequency resources and pilot sequences for each transmitter. By having multiple transmitters use different time-frequency resources and / or pilot sequences, collisions are avoided, facilitating user identification and detection. Available time-frequency resources are periodic, making it suitable for periodic services, but less efficient and more delayed for random burst services. However, for contention-based scheduling, when a transmitter has a service transmission requirement, it can randomly select time-frequency resources and pilot sequences for contention and access. Collisions may occur when multiple transmitters use the same time-frequency resources and pilot sequences, requiring the receiver to use more complex blind detection algorithms for user identification and detection. Contention-based scheduling is more suitable for random burst services, offering better transmission efficiency and lower latency.

[0060] In contention-free scheduling transmission, if resources used by multiple transmitters collide, it will severely affect the data transmission performance of these transmitters. This application provides a data transmission method that transmits data on one or more resource units and carries the number and location information of the resource units in the transmitted data block for the receiver to fully receive and process. This improves the reliability of data transmission, enhances transmission performance under collision conditions, and ultimately improves the performance and capacity of contention-free scheduling transmission.

[0061] Figure 1 A flowchart of a data transmission method provided in one embodiment, such as Figure 1 As shown, the method provided in this embodiment includes steps 110-130.

[0062] In step 110, the number of resource units N and the corresponding N resource units are determined, where N is an integer greater than or equal to 1.

[0063] In step 120, M data blocks to be transmitted are obtained, where M is an integer greater than or equal to 1. Each data block contains information indicating the number N of resource units and the location of at least one of the N resource units.

[0064] In step 130, the M data blocks are transmitted on the N resource units.

[0065] In this embodiment, 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 of the N resource units, providing a reliable basis for receiver processing. Based on this, as long as the transmitter does not collide with other transmitters on a certain resource unit, the data transmitted by that transmitter has a high probability (except in cases of network instability, such as poor signal quality, interference, or noise) that it can be received and decoded by the receiver. The receiver can then obtain information such as the resource unit used by the transmitter from the decoded data. Using this information, the data on these resource units can be comprehensively processed, thereby improving the reliability of data transmission, enhancing transmission performance in the event of collisions, and improving the performance and capacity of contention-free scheduling-free transmission.

[0066] It should be noted that this embodiment does not limit the execution order of steps 110 and 120. That is, the transmitter can first determine N resource units and then obtain M data blocks based on these N resource units; or it can first obtain M data blocks and then determine N resource units based on these M data blocks; or it can first obtain M data blocks, perform some processing during the execution process, then determine N resource units, and then continue with other processing of the M data blocks.

[0067] In one embodiment, step 110 includes: determining the number of resource units N and the corresponding N resource units based on information contained in each data block that indicates the number of resource units N and the location of at least one of the N resource units.

[0068] In this embodiment, the transmitter can first acquire M data blocks to be transmitted. Each data block can contain specified bits to indicate the number N of resource units and the position of at least one resource unit among the N resource units. Based on the information contained in the M data blocks, the transmitter can determine the number N of resource units and the positions of the N resource units used to transmit the M data blocks. For example, the number N of resource units and the positions of the N resource units can be indicated by the bit values ​​of some bits in each data block, or the position of the first or last resource unit among the N resource units; or, for example, some bits in each data block can be used to indicate which resource units to use for transmitting the data blocks in the form of a bitmap. Based on these bit values ​​in each data block, the transmitter can determine the positions of all N resource units, and then use the N resource units to transmit the M data blocks.

[0069] In one embodiment, step 110 includes one of the following: randomly determining the number N of resource units and randomly selecting N resource units; determining the number N of resource units according to the number M of data blocks to be transmitted, and randomly selecting N resource units.

[0070] In this embodiment, the transmitter can first determine N resource units. For example, it can randomly determine the number of resource units N and randomly select N resource units from the configured available resource units for transmitting data blocks. Alternatively, it can first acquire M data blocks and then determine N resource units based on the number of data blocks M. For example, if the number of data blocks M = 2, then N = 2 resource units can be used to transmit these 2 data blocks. M and N can be equal or unequal. For example, N can be determined based on the specific transmission scheme. If M is less than N, there are sufficient resource units, and a data block can be repeatedly transmitted on multiple resource units. If M is greater than N, there are relatively few resource units, and multiple data blocks can be superimposed and transmitted on one resource unit, or the M data blocks can be transmitted sequentially in the time domain.

[0071] In one embodiment, step 120 includes: acquiring M data groups, adding information indicating the number N of resource units and the location of at least one of the N resource units to each data group, and generating M data blocks to be transmitted.

[0072] In this embodiment, the transmitter can first determine N resource units, then acquire M data groups to be transmitted, and add some bits to each data group to indicate the number N resource units and the location of at least one of the N resource units, thereby generating M data blocks. Alternatively, some bits can be added to each data group to indicate the number (N-1) of other resource units used besides the current data block, and the location of at least one of these N-1 resource units. These two methods can be considered equivalent, with the latter having slightly lower overhead.

[0073] In one embodiment, each data block contains designated bits that indicate the number N of resource units and the location of at least one of the N resource units.

[0074] In this embodiment, each data block contains specified bits, and each data block carries information indicating the number of resource units N and the location of at least one of the N resource units.

[0075] In one embodiment, the designated bit is an implicit indicator bit or an explicit indicator bit.

[0076] In this embodiment, the specified bit can be an implicit indicator bit, that is, using data bits with existing meaning in the M data blocks to be transmitted, while carrying existing information, implicitly indicating the number N of resource units and the position of at least one resource unit among the N resource units; or it can be an explicit indicator bit, that is, an additional data bit added on the basis of the data group to be sent.

[0077] In one embodiment, the designated bit is the data bit in the common data, wherein the common data is data contained in M ​​data blocks.

[0078] In this embodiment, the designated bit can be a data bit in the common data that is included in all 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 to indicate the number of resource units N and the position of at least one resource unit among the N resource units.

[0079] In one embodiment, the designated bit includes one of the following: a first bit for indicating the number N of resource units, and a second bit for indicating the position of at least one resource unit among the N resource units; a third bit for indicating the number X of bit groups, and X bit groups for indicating the position of at least one resource unit among the N resource units, wherein X is an integer greater than or equal to 1; a first bit map for indicating the position of at least one resource unit among the N resource units; a fourth bit for indicating the position of the first resource unit among the N resource units and a fifth bit for indicating the position of the last resource unit.

[0080] In this embodiment, the designated bit may include a first bit and a second bit, wherein the first bit is used to indicate the number N of resource units, 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, wherein the third bit is used to indicate the number X of bit groups, and the X bit groups are used to indicate the position of at least one resource unit among the N resource units; or, the designated bit includes a first bit map, which is used to indicate the position of at least one resource unit among the N resource units; or, the designated bit includes a fourth bit and a fifth bit, wherein 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.

[0081] In one embodiment, step 110 includes: when the specified bit includes a first bit map for indicating the position of at least one of the N resource units, and the number of values ​​of the first bit map that are all 0 or the number of values ​​of 1 exceeds a specified value, determining the number N of resource units and the corresponding N resource units according to a specified rule.

[0082] In this embodiment, the specified bits include a first bitmap, for example, the first bitmap is "01010101", where a value of 0 indicates that the resource unit at the corresponding position is not used, and a value of 1 indicates that the resource unit at the corresponding position is used. According to this first bitmap, the number of resource units can be determined to be 4, namely the 2nd, 4th, 6th, and 8th resource units. Using a bitmap method can simultaneously indicate the number of resource units and the position of each resource unit; that is, indicating the position of the resource units implicitly indicates the number of resource units. If all values ​​in the first bitmap are 0, or the number of values ​​of 1 exceeds a specified value, a specified rule can be used to determine the number N of resource units and the corresponding N resource units. For example, when all values ​​in the first bitmap are 0, all resource units can be used to transmit data blocks, or a specified number and specified positions of resource units can be used to transmit data blocks, etc.

[0083] In one embodiment, each data block further includes at least one of the following: starting location information of available resource units; and quantity information of available resource units.

[0084] In this embodiment, each data block can indicate not only the number N of resource units used to transmit M data blocks and the position of at least one of the N resource units, but also the starting position information and / or the number of available resource units. In one example, no available resource units are pre-configured for the transmitter; the transmitter determines the available resource units based on the indication information in the data block, or the transmitter determines the available resource units and adds the indication information to the data block. In one example, a resource unit pool (also called the overall available resource units) can be pre-configured for the transmitter. Available resource units (also called local available resource units or currently available resource units) are determined from this resource unit pool based on the indication information in the data block, or the transmitter determines the available resource units from this resource unit pool and adds the indication information to the data block. The transmitter determines N resource units from the available resource units for transmitting M data blocks, where the number of available resource units is greater than or equal to N.

[0085] In one embodiment, the N resource units satisfy at least one of the following: the N resource units are located within a relevant bandwidth range; the N resource units are located within a relevant time range; and the channels on the N resource units are correlated.

[0086] In this embodiment, 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 correlated, thereby making the channels on the N resource units highly correlated, thus simplifying receiver processing and implementation.

[0087] In one embodiment, each data block further includes at least one of the following: pilot information used on at least one of the N resource units; and sequence information used on at least one of the N resource units.

[0088] In this embodiment, each data block further includes pilot information used on at least one of the N resource units, and / or sequence information used on at least one of the N resource units. For example, each data block may include one of the following: pilot information used on the N resource units; sequence information used on the N resource units; pilot information and sequence information used on the N resource units; pilot information used on the resource unit transmitting the current data block; sequence information used on the resource unit transmitting the current data block; or pilot information and sequence information used on the resource unit transmitting the current data block.

[0089] In one embodiment, at least one of the M data blocks further includes identification information.

[0090] In this embodiment, at least one of the M data blocks also contains identification information, which is used by the receiver to identify the transmitter.

[0091] In one embodiment, at least one of the M data blocks further contains valid data.

[0092] In this embodiment, at least one of the M data blocks also contains valid data, such as specified messages or business data, which are used by the receiver to decode and process to obtain the corresponding information.

[0093] In one embodiment, step 130 includes: processing the M data blocks respectively, 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: encoding, scrambling (including partial scrambling), modulation, spreading, interleaving, precoding, superposition, etc.

[0094] In one embodiment, the transmitter sends data blocks on one or more resource units. The M data blocks sent on each resource unit are identical; that is, the transmitter sends the same data block D on each resource unit separately, thereby improving transmission reliability in contention-free scheduling scenarios. The transmitter can be a terminal. In this embodiment, the transmitter determines the number N of resource units used for transmitting data blocks and the corresponding N resource units, obtains the data block D to be transmitted on each resource unit, and then sends the data block D on each resource unit separately.

[0095] In one embodiment, the transmitter can determine the number of resource units N and the corresponding N resource units based on specified bits in data block D.

[0096] Figure 2A This is a schematic diagram illustrating a specific bit in one embodiment. For example... Figure 2A As shown, the transmitter can determine the number of resource units N, where N is greater than or equal to 1, based on the specified bit group 0 (i.e., the first bit in the specified bits) in data block D. The specified bit group 0 can contain A bits, where A is an integer greater than or equal to 1. The value of A is related to the number of available resource units. For example, assuming there are 4 available resource units, A = 2 bits can be used to indicate the number of resource units N ("00", "01", "10", and "11" are used to indicate N = 1, N = 2, N = 3, and N = 4, respectively); assuming there are 8 available resource units, A = 3 bits can be used to indicate the number of resource units. Furthermore, the transmitter can also determine the corresponding N resource units based on the specified bit groups 1 to N (i.e., the second bit in the specified bits) in data block D. The specified bit groups 1 to N can also each contain A bits, with each bit group indicating the location information of a resource unit, which can be an index of the resource unit.

[0097] The specified bit groups 1 to N can be consecutive or non-consecutive. In one case, for example, if the bits in the consecutive N bit groups are all different and can be used to indicate different location information, then these N bit groups can be used as specified bits to indicate the location information of N resource units respectively.

[0098] In another scenario, for example, if a bit group is identical to a bit group preceding it, they will both indicate the same location. In this case, the bit group can be skipped from indicating the location information of a resource unit. Instead, the process can proceed sequentially to determine if the next bit group can be used to indicate the location information of a resource unit. If the next bit group is not identical to any of the bits preceding it, it can be used to indicate the location information of a resource unit, and so on, until N bit groups are used to indicate or determine the location of N resource units.

[0099] In one embodiment, even if a bit group is identical to a bit group preceding it—meaning they indicate the same location—the resource unit at that location can still be used to transmit data. In this case, a sequential approach is not necessary.

[0100] In contention-free transmission, the number and location of resource units used by the transmitter are unknown to the receiver. Furthermore, it is uncertain which data block transmitted on which resource unit can be correctly decoded. Therefore, the transmitter provides a reliable basis for the receiver to decode the data transmitted in each resource unit by indicating the number of resource units N and the location information of at least one of the N resource units in the data block D transmitted on each resource unit.

[0101] Figure 2B A schematic diagram of a specified bit provided for another embodiment. For example... Figure 2B As shown, the transmitter can determine the number of bit groups X based on the specified bit group 0 (i.e. the third bit in the specified bits) in data block D, where X is greater than or equal to 1; and determine N resource units for transmitting the data block based on the specified bit groups 1 to X in data block D, where each bit group in bit groups 1 to X indicates the location information of a resource unit, which can be an index of a resource unit.

[0102] If all bits in specified bit groups 1 through X are different, they can all be used directly to indicate the location information of X resource units. However, some bits in specified bit groups 1 through X may be the same. If a bit group is the same as a previous bit group, they will indicate the same location. In this case, this bit group will not be used to indicate the location information of a resource unit. If one or more bit groups are not used, the actual number of resource units determined for transmitting data blocks will be less than X. Therefore, as... Figure 2B As shown, bit group X indicates the location of the Nth resource unit, where 1 <= N <= X.

[0103] In this embodiment, designated bit group 0 indicates that the number of bit groups used to indicate the location of resource units is X, and resource units used to transmit data blocks can be determined based on these X designated bit groups. Figure 2B In the example shown, it is equivalent to jointly determining the number of resource units and the resource units used to transmit data blocks based on the specified bit group 0 and the specified bit groups 1 to X. That is, the number of resource units used to transmit data blocks is determined to be N, and the positions of these N resource units are determined.

[0104] The specified bit groups 1 to X can be X consecutive bit groups, or they can be non-consecutive, for example, with a specified interval between each bit group.

[0105] It should be noted that if in Figure 2A In the example shown, if it is impossible to find N distinct bit groups that satisfy the conditions (different) to indicate or determine the location of N resource units, then the actual number of resource units used can be less than N.

[0106] Figure 2C This is a schematic diagram of a specified bit provided for another embodiment. For example... Figure 2C As shown, the transmitter can determine the number N of resource units used to transmit the data block based on the specified bit group 0 (i.e. the first bit in the specified bits) in the data block D, where N is greater than or equal to 1; it can also determine the position of the first resource unit used to transmit the data block based on the specified bit group 1 (i.e. the second bit in the specified bits) in the data block D.

[0107] In this embodiment, the transmitter can use N consecutive resource units. After determining the number N resource units and the position of the first resource unit, the transmitter will select the N consecutive resource units starting from the first resource unit as the N resource units for transmitting data blocks. If it is impossible to obtain N consecutive resource units until the last available resource unit, then resource units will be obtained starting from the first resource unit. This is equivalent to cyclically obtaining N resource units, or obtaining N resource units that are cyclically consecutive.

[0108] In this embodiment, the transmitter can also use N resource units with a specified interval. After determining the number N resource units and the position of the first resource unit, the transmitter determines the N resource units with a specified interval starting from the first resource unit as the N resource units for transmitting the data block. Similarly, N resource units can be obtained cyclically from the available resource units. If the cyclically obtained resource unit is the same as the previously determined resource unit, the resource unit can be reused, or the process can proceed to the next resource unit that is different from the previously determined resource unit, and the next resource unit that satisfies the specified interval can be obtained based on that resource unit. The specified interval can be preset, or it can be indicated by a specified bit group 2 in the data block D.

[0109] In this embodiment, the specified bit group 1 can indicate the location of any one of the N resource units. Here, we only use the indication of the location of the first resource unit as an example.

[0110] In this embodiment, the randomness of the locations of the N resource units will decrease, but the correlation of the channels on the N resource units will be better.

[0111] Figure 2D This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 2D As shown, the transmitter can determine the number of resource units used to transmit the data block and the corresponding resource units based on the first bitmap. This bitmap consists of T bits specified in the data block D. The value of T is related to the number of available resource units. For example, assuming there are 8 available resource units, then T = 8. An example of this bitmap is "01010101". A value of 0 indicates that the resource unit at the corresponding position is not used, and a value of 1 indicates that the resource unit at the corresponding position is used. Therefore, it can be seen that the number of resource units used to transmit the data block is 4, which are the 2nd, 4th, 6th, and 8th resource units. Here we can also see that by using a bitmap, the number of resource units and the position of each resource unit can be indicated simultaneously, or in other words, the number of resource units is implicitly indicated while indicating the position of the resource units.

[0112] In this embodiment, the first bit map can be derived from data bits that already have meaning in the data, and is used to implicitly indicate the quantity and location information of resource units.

[0113] When all bits in the first bitmap are 0, the number of resource units and the corresponding resource units used to transmit the data block can be determined according to specified rules. For example, all resource units can be used, which is equivalent to bit inversion, resulting in all bits being 1; or, a specified number and specified positions of resource units can be used, such as using 1 resource unit at a specified position, using 2 resource units at specified positions, using resource units at odd positions, using resource units at even positions, or using a specified number of resource units located at the beginning, end, or middle, etc.

[0114] If all bits in the first bitmap are 1 (or the number of 1 bits exceeds a certain limit), and 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 determine the number of resource units and the corresponding resource units for transmitting data blocks according to specified rules. For example, you can use a specified number and specified positions of resource units.

[0115] In one embodiment, the number N of resource units used for transmitting data blocks can be limited. For example, N can be less than or equal to V, where V can be 1 / 2, 1 / 3, etc., of the number of available resource units. If the number of resource units N determined by the transmitter is greater than V, N can be set to V, and then the location of the resource units used for transmitting data blocks can be determined according to any of the above embodiments. Alternatively, the range of N can be limited by limiting the number of bits in bit group 0 (i.e., the first bit in the specified bits). For example, assuming there are 8 available resource units, and the number of resource units used for transmitting data blocks is limited to a maximum of 4, then only bit group 0 containing 2 bits can be used to indicate the number of resource units, while each bit group indicating the location of the resource units can still contain 3 bits. That is, the number of bits contained in bit group 0 and other bit groups can be different.

[0116] for Figure 2D For example, when the number of resource units N determined by a bitmap consisting of T bits is greater than V, the number of resource units can be determined by a bitmap consisting of bits at specified positions. For instance, if the first bit is 0, a bitmap consisting of V bits at even positions is used; if the first bit is 1, a bitmap consisting of V bits at odd positions is used; or, if the first two bits are 00, 01, 10, or 11, bitmaps consisting of V bits at odd positions, V bits at even positions, the first V bits, or the last V bits are used respectively. That is, a specified bit in the first bitmap is used to indicate that a new bitmap is composed of bits at specified positions, which is used to indicate the actual number and position of resource units used.

[0117] Figure 2E This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 2E As shown, the transmitter can determine the position of the first resource unit among the N resource units used to transmit the data block based on the specified bit group 0 (i.e., the fourth bit in the specified bits) in data block D; and can determine the position of the last resource unit among the N resource units used to transmit the data block based on the specified bit group 1 (i.e., the fifth bit in the specified bits) in data block D. The N resource units can be all consecutive resource units between the first and last resource units or resource units with a specified interval.

[0118] Figure 2F This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 2FAs shown, designated bit group 0 (equivalent to the first bit in the designated bit group) can indicate the starting position of the currently available resource unit (or partially available resource unit), and a bit map consisting of V bits (equivalent to the first bit map in the designated bit group) can correspond to the currently available resource unit. That is, this bit map can correspond to V resource units located at a designated position starting from the resource unit indicated by bit group 0, and this bit map is used to indicate the number and position of resource units used for transmitting data blocks. Specifically, the position of the first resource unit in the resource unit corresponding to the bit map can be determined based on bit group 0, and the number of resource units used for transmitting data blocks and the position of each resource unit can be determined from the corresponding resource units based on the bit map. Furthermore, the currently available resource units can be obtained cyclically from the available resource units (which can be the overall available resource units configured for the transmitter), or the bit map can correspond cyclically with the available resource units. This embodiment is advantageous in ensuring that the channels on the N resource units used for transmitting data blocks are correlated.

[0119] In addition, this embodiment is also applicable to situations where the total available resource units are unknown. The starting position of the total available resource units can be determined based on the specified bit group 0, and N resource units for transmitting data blocks can be determined from the corresponding resource units according to the bit map.

[0120] In the above embodiments, designated bit groups 0, 1, ..., etc., can start from the head of data block D, or from the tail of data block D, or from a designated position, and are distributed according to a specified rule. For example, starting from the tail of data block D, the bits from the tail to the head can be designated bit groups 0, 1, ..., etc. Designated bit group 1 and designated bit group 0 can be adjacent or non-adjacent. For example, designated bit group 1 can start from a designated position, or there can be a specified interval between designated bit group 1 and designated bit group 0.

[0121] In the above embodiments, the first bitmap can also start from a specified position and be distributed according to a specified rule. For example, the T bits at the end of data block D can indicate the usage status of each available resource unit from the end to the beginning, or they can indicate the usage status of each available resource unit from the beginning to the end.

[0122] In one embodiment, the number of resource units N-1 can be indicated by a specified bit in the data block, indicating that in addition to the resource units used by the current data block, N-1 other resource units are used.

[0123] In one embodiment, when N is a fixed value, the number of resource units may not be indicated; only the location information of at least one of the N resource units may be indicated.

[0124] In one embodiment, the bitmap can also be used to indicate resource patterns, wherein the resource patterns can be pre-configured or semi-statically configured, or can be obtained according to specified rules, such as combining available resource units to obtain a specified combination form.

[0125] In one embodiment, data block D may contain valid data (payload), such as service data, specified messages, etc. Data block D may also contain transmitter identification information, enabling the receiver to determine which transmitter sent the data after decoding. Data block D may be an uncoded, uncoded, or encoded data block.

[0126] The specified bits in the above embodiments may be at least one of the data bits of valid data in data block D, data bits carrying the transmitter's identification information, etc. Although these data bits have existing meanings, they can be used to implicitly indicate or carry the number of resource units N and the location information of at least one of the N resource units.

[0127] In one embodiment, data block D may also carry at least one of the pilot information (e.g., preamble, pilot signal, reference signal, etc.) and sequence information (e.g., extended sequence, interleaving sequence, scrambling sequence, sequence set, etc.) used on N resource units. Carrying this information provides a reliable basis for receiver processing. After correctly decoding the data on one resource unit, the receiver can use this information to reconstruct the transmitted symbols and perform interference cancellation, thereby assisting in data decoding on other resource units. In this embodiment, the data block may carry pilot information and sequence information used on N resource units, or it may carry only the pilot information and sequence information used on the current resource unit in the data block transmitted on the nth resource unit, where 1 <= n <= N. In this case, after decoding is completed on the nth resource unit, it can also be used to assist in data decoding on other resource units. In one embodiment, if there is a specified correlation between the pilot information and the sequence information, only the pilot information or the sequence information may be carried in data block D.

[0128] In one embodiment, the bits carrying pilot information, sequence information, etc., can be in the form of a bit group similar to any of the above embodiments, or in the form of a bit map similar to any of the above embodiments.

[0129] In one embodiment, the bits carrying pilot information, sequence information, etc., can come from data bits in the data that already have meaning, and implicitly indicate pilot information, sequence information, etc.

[0130] In one embodiment, the bits carrying pilot information, sequence information, etc., may also be additional bits. In this embodiment, the transmitter first determines the pilot information, sequence information, etc., to be used on each resource unit, for example, by random generation or random selection. Then, the transmitter adds corresponding bits to the data to be transmitted to explicitly indicate the pilot information, sequence information, etc.

[0131] In one embodiment, bit multiplexing can be further considered, that is, using some bits to simultaneously indicate or carry multiple types of information.

[0132] In one embodiment, 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.

[0133] In one embodiment, the channels on the available resource units are correlated, or the available resource units are within a correlated bandwidth and / or correlated time range. In another embodiment, the channels on multiple resource units used to transmit data blocks are correlated, or are within a correlated bandwidth and / or correlated time range.

[0134] In one embodiment, the available resource units may be pre-configured or determined according to preset rules.

[0135] In one embodiment, the available resource units can be determined autonomously by the transmitter. Therefore, the starting position, number, or range of the available resource units is unknown to the receiver. In this case, the starting position information of the available resource units can be carried in the data blocks transmitted by the transmitter. For example, this could be the offset of the first resource unit or a specified position relative to the entire bandwidth, or the index of the starting resource unit. This can be achieved using... Figure 2F The example shown is similar; the number of available resource units can also be carried in the data block; the starting position, number, or range of available resource units can be indicated implicitly or explicitly.

[0136] In one embodiment, the transmitter sends data block D on N resource units respectively, which can form N transmissions. When the N resource units are N resource units in the time domain (with the same or different frequency domain positions), these N transmissions can consist of a first transmission and retransmissions. Furthermore, the transmitter can determine whether to perform a retransmission, for example, based on the time domain interval of the N resource units or based on other specified bits.

[0137] In one embodiment, the transmitter can transmit the data block D after low-rate encoding on N resource units.

[0138] In this embodiment, by using bits in data block D to implicitly indicate the number of resource units N and the location of at least one of the N resource units, the indication overhead can be saved.

[0139] In one embodiment, the transmitter will send data on one or more resource units. The M data blocks sent by the transmitter on each resource unit are identical; that is, the transmitter sends the same data block D on each resource unit separately. This improves transmission reliability in contention-free scheduling scenarios. In this embodiment, the transmitter first determines the number of resource units used for transmitting the data blocks and the corresponding resource units.

[0140] In one embodiment, the transmitter can randomly select the number and location of resource units used to transmit data blocks. For example, assuming there are 8 available resource units, the transmitter randomly selects 3 resource units and randomly selects the locations or indices of 3 resource units from the 8 available resource units, such as resource units 1, 3, and 6. Then, the transmitter acquires the data block D to be transmitted on each resource unit and transmits the data block D on each resource unit respectively.

[0141] Figure 3A This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 3A As shown, the transmitter first acquires the data block to be transmitted, adds bit group 0 (the first bit in the specified bits) to the data block to indicate the number N of resource units, and adds bit groups 1 to N (the second bits in the specified bits) to the data block to indicate the location information of each resource unit. This location information can be an index of a resource unit, thus forming a data block D. The number of bits contained in bit group 0 and bit groups 1 to N can be different.

[0142] In the case of multiple transmitters competing for scheduling-free transmission, the number of resource units used by the multiple transmitters may be different. Therefore, the final data block size formed by the multiple transmitters may be different. In this case, bit stuffing can be considered to make the data block size of each transmitter the same.

[0143] In contention-free transmission, the number and location of resource units used by the transmitter are unknown to the receiver. Furthermore, it is uncertain which data block transmitted on which resource unit can be correctly decoded. Therefore, an indication can be made in the data block D transmitted on each resource unit so that the receiver can decode the data transmitted on each resource unit.

[0144] Figure 3B This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 3BAs shown, the transmitter first acquires the data group to be transmitted, adds bit group 0 (i.e. the third bit in the specified bits) to the data group to indicate the number of bit groups X, and adds bit groups 1 to X to the data group to indicate the number of resource units N and the location information of at least one resource unit.

[0145] Figure 3C This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 3C As shown, the transmitter acquires the data group to be transmitted and adds a first bitmap to this data group to indicate the number and position of each resource unit, thus forming data block D. This first bitmap consists of T bits. The value of T is related to the number of available resource units. For example, according to the example above, if the 1st, 3rd, and 6th resource units out of 8 available resource units are used, then T = 8, and the bitmap can be "10100100". A value of 0 indicates that the resource unit at the corresponding position is not used, and a value of 1 indicates that the resource unit at the corresponding position is used. Using a bitmap, both the number and position of resource units can be indicated simultaneously, or in other words, the number of resource units is implicitly indicated while indicating their positions. In this example, using a bitmap to indicate N resource units has a small and relatively fixed indication overhead.

[0146] In one embodiment, for example, assuming there are 8 available resource units, the transmitter randomly determines or selects N=3 resource units, and randomly determines or selects the position or index of the first resource unit used to transmit the data block. The transmitter then determines the three consecutive resource units starting from that resource unit as the three resource units used to transmit the data block. For example, if the first resource unit used is resource unit 2, then resource units 2, 3, and 4 are determined as the three resource units used to transmit the data block. Then, the transmitter acquires the data block D to be transmitted on each resource unit and transmits the data block D on each resource unit respectively.

[0147] Figure 3D This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 3D As shown, the transmitter acquires the data group to be transmitted and adds bit group 0 (i.e. the first bit in the specified bits) to the data group to indicate the number of resource units N. It also adds bit group 1 (i.e. the second bit in the specified bits) to the data group to indicate the location information of the first resource unit used to transmit the data block. This location information can be an index of a resource unit, thus forming data block D.

[0148] In this embodiment, N resource units with a specified interval, starting from the first determined resource unit, can also be determined as N resource units for transmitting data blocks. The specified interval can be preset, or it can be indicated by adding bit group 2 to the data group to be transmitted.

[0149] In this embodiment, N resource units can be obtained cyclically from the available resource units.

[0150] In this embodiment, the location of any one of the N resource units can also be determined and indicated by bit group 1. Here, only the determination and indication of the location of the first resource unit is described as an example.

[0151] In this embodiment, the overall indication overhead is relatively small and relatively fixed, and it is easier to ensure that the channels of N resource units are correlated. The disadvantage is that the randomness of the location of the resource units deteriorates.

[0152] Figure 3E This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 3E As shown, the transmitter can add a specified bit group 0 (i.e., the fourth bit in the specified bits) to the data block to be transmitted, to indicate the position of the first resource unit among the N resource units used to transmit the data block; and add a specified bit group 1 (i.e., the fifth bit in the specified bits) 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 can be all consecutive resource units between the first and last resource units or resource units with a specified interval.

[0153] In one embodiment, the number N of resource units used to transmit data blocks can be limited, for example, by making N less than or equal to V, where V can be 1 / 2, 1 / 3, etc. of the available resource units.

[0154] In one embodiment, assuming there are 8 available resource units, the transmitter randomly selects one resource unit as the starting resource unit and designates V resource units located at specified positions starting from that resource unit as currently available resource units (or partially available resource units). For example, resource unit 3 is selected as the starting resource unit, and four consecutive resource units starting from resource unit 3 (i.e., resource units 3, 4, 5, and 6) are designated as currently available resource units. The transmitter then determines the number of resource units to be used for transmitting data blocks and the corresponding resource units from these currently available resource units. For example, the transmitter can randomly select N=2 resource units for transmitting data blocks and randomly select 2 resource units from the currently available resource units, such as resource units 3 and 5. Similarly, currently available resource units can be obtained cyclically from the available resource units. The transmitter then obtains the data block D to be transmitted on each resource unit and transmits the data block D on each resource unit respectively.

[0155] Figure 3F This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 3F As shown, the transmitter acquires the data group to be transmitted, adds bit group 0 (i.e., the first bit in the specified bits) to the data group to indicate the starting position information of the currently available resource units (i.e., the position information of the first resource unit), and adds a bit map (i.e., the first bit map in the specified bits) to the data group to indicate the number of resource units in the currently available resource units used for transmitting data blocks and the position of each resource unit, thereby forming data block D. This embodiment also has a smaller and more fixed indication overhead, which is beneficial to ensure that the channels of multiple resource units used for transmitting data blocks are correlated, and the resource unit positions have better randomness.

[0156] In one embodiment, the number of resource units N-1 can be carried in the data block, indicating that N-1 other resource units are used in addition to the current resource unit.

[0157] In one embodiment, the number of resource units used by the transmitter to transmit data blocks can be fixed. In this case, it is not necessary to add extra bits to the data group to be transmitted to indicate the number of resource units N. Only bits need to be added to indicate the position of at least one resource unit.

[0158] In one embodiment, the transmitter uses all available resource units for transmission, so it is not necessary to add extra bits to the data to be transmitted to indicate the number and location of resource units.

[0159] In the above embodiments, the added bits can be added to the beginning of data block D, the end of data block D, or a designated position, and distributed according to a specified rule. For example, when added to the end of data block D, the bits can be bit group 0, bit group 1, ..., etc., from the end to the beginning.

[0160] Similarly, for the bitmap approach, the bitmap can be added to specified positions and distributed according to specified rules. For example, T bits can be added to the end of the data group to be transmitted to indicate the usage status of each available resource unit from the end to the beginning, or the usage status of each available resource unit can be indicated from the beginning to the end.

[0161] In one embodiment, the data group to be transmitted may contain valid data, such as service data or designated messages. The data group may also contain transmitter identification information, enabling the receiver to determine which transmitter sent the data after decoding. The data group to be transmitted may be an uncoded, uncoded, or encoded data block.

[0162] In one embodiment, at least one of the pilot information (e.g., preamble, pilot signal, reference signal, etc.) and sequence information (e.g., extended sequence, interleaving sequence, scrambling sequence, sequence set, etc.) used on N resource units may also be carried in the data block D. Carrying this information is beneficial for the receiver to correctly decode the data on one resource unit for transmission symbol reconstruction and interference cancellation, as well as for assisting in the decoding of data on other resource units. The data block may carry the pilot information and sequence information used on N resource units, or it may carry only the pilot information and sequence information used on the current resource unit in the data block transmitted on the nth resource unit, where 1 <= n <= N. Even so, after decoding is completed on the nth resource unit, it can still be used to assist in the decoding of data on other resource units. In one embodiment, if there is a specified correlation between the pilot information and the sequence information, only the pilot information or the sequence information may be carried in the data block D.

[0163] In one embodiment, the bits carrying pilot information, sequence information, etc., can be in the form of a bit group as described in any of the above embodiments, or in the form of a bit map as described in any of the embodiments.

[0164] In one embodiment, the bits carrying pilot information, sequence information, etc., can come from data bits in the data that already have meaning, and implicitly indicate pilot information, sequence information, etc.

[0165] In one embodiment, the bits carrying pilot information, sequence information, etc., may also be additional bits. In this embodiment, the transmitter first determines the pilot information, sequence information, etc., to be used on each resource unit, for example, by random generation or random selection. Then, the transmitter adds corresponding bits to the data to be transmitted to explicitly indicate the pilot information, sequence information, etc.

[0166] In one embodiment, bit multiplexing can be further considered, that is, using some bits to simultaneously indicate or carry multiple types of information.

[0167] In one embodiment, the channels determined by the transmitter for transmitting multiple resource units of data blocks are correlated, or fall within a correlated bandwidth and / or correlated time range. This can be achieved by the transmitter applying certain controls or following specified rules.

[0168] In this embodiment, by adding extra bits to the data to be transmitted to explicitly indicate the number of resource units N and the location of at least one of the N resource units, it is beneficial to control the resource units used and to make effective indications, but it will increase the indication overhead.

[0169] In one embodiment, the transmitter transmits data on one or more resource units. When data transmission occurs on multiple resource units, the transmitter will transmit M different data blocks on multiple resource units, thereby improving transmission capacity in contention-free scheduling scenarios. Technical details not described in detail in this embodiment can be found in any of the above embodiments. In this embodiment, the transmitter determines the number N of resource units used to transmit the M data blocks and the corresponding N resource units, obtains the M data blocks to be transmitted on each resource unit, and then transmits them on each resource unit separately.

[0170] In one embodiment, the transmitter will transmit data blocks D_1, D_2, ..., D_M on N resource units respectively. Some data in these M data blocks may be the same, referred to as common data. The common data in these M data blocks can carry information about the number of resource units N and the location of at least one of the N resource units. Furthermore, it can also be used to carry pilot information, sequence information, etc.

[0171] Figure 4A This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 4AAs shown, the transmitter can determine the number of resource units N based on the specified bit group 0 (i.e. the first bit in the specified bits) in the common data, where N is greater than or equal to 1. It can also determine the positions of the corresponding N resource units based on the specified bit groups 1 to N (i.e. the second bit in the specified bits) in the common data. Then, the transmitter can send data blocks D_1, D_2, ..., D_M on the N resource units respectively.

[0172] Figure 4B This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 4B As shown, the transmitter can determine the number of bit groups X based on the specified bit group 0 (i.e., the third bit in the specified bits) in the common data, where X is greater than or equal to 1. It can also determine the N resource units used to transmit data blocks based on the specified bit groups 1 through X in the common data. If a bit group has the same bits as a previous bit group, they will indicate the same location, and this bit group will not be used to indicate the location information of a resource unit, nor will there be any bit group continuation. The specified bit group X indicates the location of the Nth resource unit, where 1 <= N <= X.

[0173] In this embodiment, the number of resource units and the N resource units used for transmitting data blocks are jointly determined based on specified bit groups 0 and specified bit groups 1 to X. That is, the number of resource units used for transmitting data blocks is determined to be N, and the positions of these N resource units are determined. Then, the transmitter transmits data blocks D_1, D_2, ..., D_M on the N resource units respectively.

[0174] Figure 4C This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 4CAs shown, the transmitter can determine the number N of resource units used to transmit data blocks based on specified bit group 0 (i.e., the first bit in the specified bits) in the common data, where N is greater than or equal to 1; and determine the position of the first resource unit used to transmit the data block based on specified bit group 1 (i.e., the second bit in the specified bits) in the common data. The transmitter then uses N consecutive resource units starting from this resource unit, or N consecutive resource units with a specified interval starting from this resource unit. The specified interval can be preset or indicated by specified bit group 2 in the common data. N resource units can be obtained cyclically from the available resource units. Then, the transmitter transmits data blocks D_1, D_2, ..., D_M on N resource units respectively. For the receiver, after decoding a 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. Based on this information and the current resource units, other resource units used by the transmitter can be deduced, and then the data blocks transmitted on these resource units can be further decoded.

[0175] Figure 4D This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 4D As shown, the transmitter can determine the number N resource units (N) and the corresponding N resource units for transmitting data blocks based on the first bitmap in the common data. This bitmap consists of T specified bits from the common data. Then, the transmitter transmits data blocks D_1, D_2, ..., D_M on N resource units respectively.

[0176] In one embodiment, when all bits in the bitmap are 0, the number N of resource units used for transmitting the data block and the corresponding N resource units can be determined according to a specified rule. When all bits in the bitmap are 1 (or the number of 1 bits exceeds a certain number), if it is not desired to use all resource units (or not to use more than a certain number of resource units), the number N of resource units used for transmitting the data block and the corresponding N resource units can also be determined according to a specified rule.

[0177] Figure 4E This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 4E As shown, the transmitter can determine the location of the first resource unit for transmitting the data block based on the specified bit group 0 (i.e., the fourth bit in the specified bits) in the common data; and determine the location of the last resource unit for transmitting the data block based on the specified bit group 1 (i.e., the fifth bit in the specified bits) in the common data. The N resource units used by the transmitter can be all consecutive resource units between the first and last resource units or resource units with a specified interval.

[0178] In one embodiment, the number N of resource units used to transmit data blocks can be limited, for example, by making N less than or equal to V, where V can be 1 / 2, 1 / 3, etc. of the available resource units.

[0179] Figure 4F This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 4F As shown, the transmitter can determine the starting position of the currently available resource unit corresponding to the bit map based on the specified bit group 0 (i.e., the first bit in the specified bit) in the common data. It can also determine the number N of resource units N used for transmitting data blocks and the position of each resource unit from the corresponding currently available resource units based on the bit map consisting of V bits in the common data (i.e., the first bit in the specified bit map). Then, the transmitter transmits data blocks D_1, D_2, ..., D_M on N resource units respectively.

[0180] In one embodiment, data blocks D_1, D_2, ..., D_M can each contain valid data, such as service data, designated messages, etc. The valid data contained in the M data blocks can be different. Each of the M data blocks can also contain transmitter identification information, enabling the receiver to determine which transmitter sent the data after decoding. The common data in the M data blocks consists of data that each of these data blocks needs to carry, such as transmitter identification information, a designated message, etc. The M data blocks can be uncoded, uncoded, or encoded data blocks.

[0181] In one embodiment, M equals N, and the transmitter can send data blocks D_1, D_2, ..., D_N on N resource units respectively, sending one data block on each resource unit.

[0182] In one embodiment, M is less than N, and the transmitter can send at least one data block on multiple resource units, which helps to improve transmission reliability.

[0183] In one embodiment, M is greater than N, and the transmitter can send multiple data blocks using superimposed transmission on at least one resource unit.

[0184] In one embodiment, the transmitter can first send a portion of the data blocks from the M data blocks on N resource units, and the remaining data blocks can be transmitted at a later transmission time.

[0185] In one embodiment, at least one of the pilot information, sequence information, etc., used on the current transmission resource unit may also be carried in the data blocks D_1, D_2, ..., D_M. This can be implicitly indicated through common data or other data bits with existing meaning, or by adding additional bits to each data block to explicitly indicate the pilot information, sequence information, etc.

[0186] In one embodiment, for data blocks D_1, D_2, ..., D_M, the transmitter's identification information may be carried only in one of the data blocks, while other data blocks may not carry identification information, carry only partial identification information, or carry a small amount of identity verification information. The receiver may consider blind decoding, attempting to decode the two different data block sizes separately.

[0187] In one embodiment, the data block carrying transmitter identification information may not contain valid data, while valid data may be carried in other data blocks. In another embodiment, it can be ensured that the sizes of different data blocks are consistent.

[0188] In this embodiment, by sending different data and using bits of the common data portion in multiple data blocks to implicitly indicate the number of resource units N and the location of at least one resource unit among the N resource units, the transmission capacity can be improved and the indication overhead can be saved.

[0189] In one embodiment, the transmitter will send data on one or more resource units. When data transmission occurs on multiple resource units, the transmitter will send M different data blocks on those resource units, thereby improving transmission capacity in contention-free scheduling scenarios. In this embodiment, the transmitter first determines the number N resource units N used to transmit the M data blocks, and the corresponding N resource units. Then, the transmitter acquires the M data blocks to be transmitted on the N resource units and sends them on each of the N resource units.

[0190] In one embodiment, the transmitter may randomly select from the available resource units a number N for transmitting M data blocks, and randomly select the location or index of the N resource units.

[0191] In one embodiment, assuming the transmitter needs to transmit N data blocks, the number of resource units used for transmitting the data blocks is determined to be N based on this number N, and the positions or indices of N resource units are randomly selected.

[0192] Figure 5A This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 5AAs shown, the transmitter first acquires the data groups E_1, E_2, ..., E_M to be transmitted. These data groups will be transmitted on N resource units respectively. Then, the transmitter adds bit group 0 (i.e., the first bit in the specified bits) to each of these data groups to indicate the number of resource units N, and adds bit groups 1 to N (i.e., the second bit in the specified bits) to indicate the location information of each resource unit, thereby forming data blocks D_1, D_2, ..., D_M. The bits added to each data block are the same.

[0193] Figure 5B This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 5B As shown, the transmitter acquires the data groups E_1, E_2, ..., E_M to be transmitted, adds bit group 0 (i.e. the third bit in the specified bits) to each of these data groups to indicate the number of bit groups X, and adds bit groups 1 to X to each of 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.

[0194] Figure 5C This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 5C As shown, the transmitter acquires the data groups E_1, E_2, ..., E_M to be transmitted, and adds a first bit map to each of these data groups to indicate the number of resource units N and the position of the corresponding N resource units, thereby forming data blocks D_1, D_2, ..., D_M.

[0195] In one embodiment, the transmitter may randomly select N resource units from the available resource units, and randomly select the position or index of the first resource unit for transmission, and determine the N consecutive resource units starting from that resource unit or N resource units with a specified interval as the N resource units for transmission.

[0196] Figure 5D This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 5D As shown, the transmitter acquires the data groups E_1, E_2, ..., E_M to be transmitted, and adds bit group 0 (i.e. the first bit in the specified bits) to each of these data groups to indicate the number of resource units N. It also adds bit group 1 (i.e. the second bit in the specified bits) to each of these data groups to indicate the location information of the first resource unit used for transmission, thereby forming data blocks D_1, D_2, ..., D_M.

[0197] In this embodiment, the specified interval can be preset, or bit group 2 can be added to each of these data groups to indicate the specified interval.

[0198] For the receiver, after decoding a data block on a certain resource unit, it can obtain the number N of resource units used by the transmitter and the position of the first resource unit. Based on this information and the current resource unit, it can deduce the other resource units used by the transmitter, and then further decode the data blocks transmitted on these resource units.

[0199] In one embodiment, the number N of resource units used for transmission can be limited, for example, by making N less than or equal to V, where V can be 1 / 2, 1 / 3, etc. of the available resource units.

[0200] In one embodiment, the transmitter may randomly select a resource unit from the available resource units as the starting resource unit, and designate V resource units located at specified positions starting from that resource unit as the currently available resource units. The transmitter then determines the number N of resource units N to be used for transmission, and the corresponding resource units, from these currently available resource units.

[0201] Figure 5E This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 5E As shown, the transmitter acquires the data groups E_1, E_2, ..., E_M to be transmitted, and adds bit group 0 (i.e., the first bit in the specified bits) to each of these data groups to indicate the starting position information of the currently available resource unit (i.e., the position information of the first resource unit). It also adds a bit map (i.e., the first bit map in the specified bits) to each of these data groups to indicate the number of resource units used for transmission in the currently available resource units and the position of each resource unit, thereby forming data blocks D_1, D_2, ..., D_M.

[0202] Figure 5F This is a schematic diagram of a specified bit provided for yet another embodiment. For example... Figure 5F As shown, the transmitter acquires the data groups E_1, E_2, ..., E_M to be transmitted. It adds bit group 0 (the fourth bit in the specified bits) to each of these data groups to indicate the location information of the first resource unit among the N resource units. It also adds bit group 1 (the fifth bit in the specified bits) to each of these data groups to indicate the location information of the last resource unit among the N resource units, thus forming data blocks D_1, D_2, ..., D_M. The N resource units used by the transmitter can be all consecutive resource units between the first and last resource units or resource units with a specified interval.

[0203] In one embodiment, the transmitter sends a data block D_m on the nth resource unit. The transmitter can then carry only the location information of resource units other than the nth resource unit in the data block D_m, without carrying the location of the current nth resource unit, thus saving overhead. Here, 1 <= n <= N, 1 <= m <= M. Specifically, the transmitter acquires the data groups E_1, E_2, ..., E_M to be transmitted, adds a bit group of 0 to each of these data groups to indicate the number of resource units N or N-1 (which can be considered equivalent), and adds N-1 bit groups to each of these data groups to indicate the location information of resource units other than the current resource unit, thereby forming data blocks D_1, D_2, ..., D_M. In this embodiment, the bits added to each data block are different.

[0204] In one embodiment, the number of resource units used by the transmitter for transmission can be fixed. In this case, it is not necessary to add extra bits to the data to be transmitted to indicate the number of resource units; only bits are needed to indicate the location of the resource units.

[0205] In one embodiment, the transmitter uses all available resource units for transmission, so it is not necessary to add extra bits to the data to be transmitted to indicate the number and location of resource units.

[0206] In one embodiment, data blocks D_1, D_2, ..., D_M may each contain valid data, such as service data, specified messages, etc. The valid data contained in the M data blocks may be different. Each of the M data blocks may also contain transmitter identification information, enabling the receiver to determine which transmitter sent the data after decoding. The M data blocks may be uncoded, uncoded, or encoded.

[0207] In one embodiment, M equals N. The transmitter acquires the data groups E_1, E_2, ..., E_N to be transmitted, adds the aforementioned indicator bits to each of these data groups to form data blocks D_1, D_2, ..., D_N, and then transmits these N data blocks on N resource units, transmitting one data block on each resource unit.

[0208] In one embodiment, M is less than N, and the transmitter can send at least one data block on multiple resource units, which helps to improve transmission reliability.

[0209] In one embodiment, M is greater than N, and the transmitter can send multiple data blocks using superimposed transmission on at least one resource unit.

[0210] In one embodiment, the transmitter can first send a portion of the data blocks from the M data blocks on N resource units, and the remaining data blocks can be transmitted at a later transmission time.

[0211] In one embodiment, different indicator bits can be added to a data group to form multiple data blocks, which are then transmitted on different resource units.

[0212] In one embodiment, at least one of the pilot information, sequence information, etc., used on the current transmission resource unit may also be carried in the data blocks D_1, D_2, ..., D_M. The pilot information, sequence information, etc., can be indicated implicitly or explicitly.

[0213] In one embodiment, for data blocks D_1, D_2, ..., D_M, the transmitter's identification information may be carried only in one of the data blocks, while other data blocks may not carry identification information, carry only partial identification information, or carry a small amount of identity verification information. The receiver may consider blind decoding, attempting to decode the two different data block sizes separately.

[0214] In one embodiment, the data block carrying transmitter identification information may not contain valid data, while valid data may be carried in other data blocks. In another embodiment, it can be ensured that the sizes of different data blocks are consistent.

[0215] In this embodiment, by sending different data and adding extra bits to the different data to be sent to explicitly indicate the number of resource units N and the location of at least one of the N resource units, the transmission capacity can be improved, which is beneficial for controlling the resource units used and making effective indications. However, it will increase the indication overhead.

[0216] In one embodiment, K transmitters T_1, T_2, ..., T_K transmit data according to the method in any of the above embodiments, where K is an integer greater than or equal to 1.

[0217] Each transmitter determines the number N of resource units it uses for transmission and the corresponding N resource units. For example, the k-th transmitter T_k determines that it uses N_k resource units for transmission and determines the positions or indices of the N_k resource units accordingly, 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 corresponding resource units may be the same, partially the same, or different.

[0218] Each transmitter also acquires the data it intends to transmit on the determined resource unit and transmits the data on the determined resource unit. The data transmitted by each transmitter includes the following information: information indicating the number N of resource units and the location of at least one of the N resource units.

[0219] In one embodiment, each transmitter also determines at least one of pilot information, sequence information, etc., for each resource unit used for transmission.

[0220] In one embodiment, the data transmitted by each transmitter also includes the following information: valid data, such as service data, designated messages, etc.

[0221] In one embodiment, the data transmitted by each transmitter also includes the following information: the transmitter's identification information.

[0222] In one embodiment, the data transmitted by each transmitter also includes at least one of the following: pilot information; sequence information, etc.

[0223] In one embodiment, the data transmitted by each transmitter contains information used by that transmitter.

[0224] In this embodiment, K transmitters transmit data on one or more resource units each. When a transmitter does not collide with other transmitters on a certain resource unit, the data transmitted by that transmitter is highly likely to be successfully decoded by the receiver. The receiver can then obtain information such as other resource units used by that transmitter from the decoded data and use this information to process the data on these resource units (e.g., detection, decoding, channel estimation, interference cancellation, etc., at least one of these), thereby improving the reliability of data transmission, improving the transmission performance in the event of collisions, and improving the performance and capacity of contention-free scheduling transmission.

[0225] This application also provides a data transmission method 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 of the N resource units, providing a reliable basis for receiver processing. Based on this, the receiver can obtain information such as the resource units used by the transmitter from the decoded data. Using this information, the data on these resource units can be comprehensively processed, thereby improving the reliability of data transmission, improving transmission performance in the event of collisions, and improving the performance and capacity of contention-free scheduling-free transmission.

[0226] Figure 6 A flowchart of a data transmission method provided for another embodiment, such as Figure 6As shown, the method provided in this embodiment includes steps 210 and 220.

[0227] In step 210, the resource unit to be detected is determined.

[0228] In step 220, detection is performed 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, and the first detection result contains information for indicating the number N of resource units used to transmit the M data blocks and the location of at least one resource unit among the N resource units, wherein M is an integer greater than or equal to 1 and N is an integer greater than or equal to 1.

[0229] In this embodiment, the receiver can determine the resource unit to be detected from all available resource units in the configuration, detect the received symbols on these resource units, and if at least one data block among M data blocks can be obtained through detection, and indication information is obtained (indicating 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), the N resource units can be further detected and processed accordingly.

[0230] It should be noted that the operations performed by the receiver correspond to the operations performed by the transmitter in any of the above embodiments, and technical details not described in detail in this embodiment can be found in any of the above embodiments.

[0231] In one embodiment, the first detection result further includes at least one of the following information: starting position information of available resource units; number of available resource units; pilot information on at least one of the N resource units; sequence information on at least one of the N resource units; identification information; and valid data.

[0232] In this embodiment, the first detection result can indicate not only the number N of resource units and the location of at least one of them, but also the starting location information of available resource units, the number of available resource units, etc., so that the receiver can determine the range of resource units to be detected; it can also include pilot information, sequence information, etc. used by a 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 identification information, so that the receiver can determine which transmitter sent the data; and it can also include valid data, which the receiver decodes and processes to realize the corresponding service processing.

[0233] In one embodiment, step 220 includes:

[0234] Obtain the received symbol on the resource unit to be detected; detect the received symbol and obtain the first detection result.

[0235] In one embodiment, it further includes:

[0236] Step 230: Based on the information contained in the first detection result, which indicates the number N of resource units used to transmit the M data blocks and the location of at least one of the N resource units, determine the resource unit to be processed, or update the resource unit to be detected.

[0237] In this embodiment, the receiver, based on the number N of resource elements indicated by the first detection result and the position of at least one of the N resource elements, can determine the next resource element to be detected, or the resource element that needs further processing. For the resource element to be processed, the following processes may be performed: detection, reconstruction, channel estimation, and interference cancellation.

[0238] In one embodiment, it further includes:

[0239] Step 240: Reconstruct the symbol based on the first detection result to obtain the reconstructed symbol;

[0240] Step 250: Perform channel estimation on at least one of the N resource units based on the reconstructed symbols to obtain the channel estimation result.

[0241] In one embodiment, it further includes:

[0242] Step 260: Based on the reconstructed symbols and the channel estimation results, perform interference cancellation on the received symbols on the at least one resource unit to obtain the interference-cancelled received symbols;

[0243] Step 270: Detect the received symbols after interference cancellation and obtain a second detection result.

[0244] In this embodiment, the received symbol can be the initial received symbol on at least one resource unit, or a received symbol that has not undergone interference cancellation. Based on the reconstructed symbol and channel estimation results, interference cancellation can be performed on the received symbol, and further detection can be conducted to obtain a second detection result, thereby achieving better detection performance and realizing comprehensive and reliable reception processing.

[0245] In one embodiment, it further includes:

[0246] Step 280: Based on the channel estimation result, detect the received symbols on the at least one resource unit to obtain a third detection result.

[0247] In this embodiment, the received symbol can be a received symbol that has not undergone interference cancellation, or a symbol that has undergone interference cancellation (e.g., a symbol after the previous interference cancellation or a symbol after the current interference cancellation). Based on the channel estimation result, the received symbol on at least one resource unit can be further detected to obtain a third detection result, thereby achieving better detection performance and realizing comprehensive and reliable reception processing.

[0248] In one embodiment, K transmitters transmit on one or more resource units, respectively. After transmission through the channel, the signals reach the receiver, where the receiver detects and decodes the received signals. Here, K is an integer greater than or equal to 1.

[0249] In one embodiment, the transmitter can be a terminal device or a user device, and the receiver can be a base station device.

[0250] In one embodiment, the receiver identifies P available resource units as the resource units to be detected, and performs detection on each of the P available resource units, obtaining Q detection results. Here, P is an integer greater than or equal to 1, and Q is an integer greater than or equal to 0. In one embodiment, Q is related to factors such as the number of transmitters and the resources used by each transmitter. From at least one of the Q detection results, the receiver can 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. This information pertains to the number N resource units N used for transmission by a transmitter and the location information of at least one resource unit among the N resource units.

[0251] In one embodiment, the receiver can determine the number N of resource units used by the transmitter and the location of the N resource units based on the acquired information, thereby determining other resource units that need to be processed for the transmitter. The processing includes at least one of detection, decoding, channel estimation, and interference cancellation.

[0252] In one embodiment, the receiver may also obtain the following information from the detection result: valid data, such as service data, designated messages, etc. In one embodiment, the receiver may also obtain the following information from the detection result: transmitter identification information. In one embodiment, the receiver may also obtain at least one of the following information from the detection result: pilot information; sequence information, etc. Some specific details are similar to those in the above embodiments and will not be repeated.

[0253] In one embodiment, the receiver can perform blind decoding on the received data, attempting to decode data of various block sizes. For example, among the multiple data blocks transmitted by the transmitter, some data blocks carry identification information, while others do not carry identification information or carry only partial identification information, resulting in multiple data blocks of different sizes.

[0254] In one embodiment, the receiver can also reconstruct the symbols transmitted by the transmitter to obtain reconstructed symbols.

[0255] In one embodiment, the receiver can also perform channel estimation using the reconstructed symbols to obtain channel estimation results for at least one of the N resource elements. This process can be used to obtain channel estimation results for the resource element corresponding to the current detection result, or it can be used to obtain channel estimation results for other resource elements.

[0256] In one embodiment, the receiver can further perform interference cancellation on the received symbols in at least one of the N resource units based on the reconstructed symbols and the channel estimation result, and obtain updated received symbols. This process can be used at least to cancel interference on the received symbols in the resource unit corresponding to the current detection result, and can also be used to cancel interference on the received symbols in other resource units.

[0257] In one embodiment, the updated receive symbol is used by the receiver to perform a new round of detection on the corresponding resource unit and obtain new detection results.

[0258] In one embodiment, the channel estimation results are used by the receiver to detect other resource elements that need to be detected, and to obtain new detection results.

[0259] In one embodiment, the receiver does not know the starting position, number, or range of available resource units. The receiver can identify at least one possible available resource unit as the resource unit to be detected and perform the detection. After obtaining a detection result for a resource unit, the receiver can obtain the following information from the detection result: the number of resource units N and the position information of at least one resource unit among the N resource units; and the following information: the starting position information of the available resource unit. In one embodiment, the receiver can also obtain the following information from the detection result: the number of available resource units.

[0260] In one embodiment, the receiver iteratively executes at least a portion of the above-described processing procedure.

[0261] It should be noted that the terms "first," "second," and "third" in the above embodiments are only used for descriptive distinction and do not emphasize the order of events. In one case, such as during iterative detection, they can be collectively referred to as detection results, and in implementation, they can be represented by the same parameter or variable.

[0262] This application also provides a data transmission device. Figure 7 This is a schematic diagram of a data transmission device according to one embodiment. Figure 7As shown, the data transmission device includes: a resource determination module 310, a data block acquisition module 320, and a transmission module 330.

[0263] The resource determination module 310 is configured to determine the number of resource units N and the corresponding N resource units, where N is an integer greater than or equal to 1;

[0264] 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. Each data block contains information indicating the number N of resource units and the location of at least one of the N resource units.

[0265] The transmission module 330 is configured to transmit the M data blocks over the N resource units.

[0266] The data transmission device of this embodiment transmits M data blocks using N resource units, and each data block carries information about the number of resource units N and the location of at least one of the N resource units, providing a reliable basis for receiver processing. Based on this, the receiver can obtain information such as the resource units used by the transmitter from the decoded data. Using this information, the data on these resource units can be comprehensively processed, thereby improving the reliability of data transmission, enhancing transmission performance in the event of collisions, and improving the performance and capacity of contention-free scheduling-free transmission.

[0267] In one embodiment, the resource determination module 310 is configured as follows:

[0268] The number of resource units N and the corresponding N resource units are determined based on the information contained in each data block that indicates the number of resource units N and the location of at least one of the N resource units.

[0269] In one embodiment, the resource determination module 310 is configured as one of the following:

[0270] The number N of resource units is randomly determined and N resource units are randomly selected;

[0271] The number of resource units N is determined based on the number M of data blocks to be transmitted, and N resource units are randomly selected.

[0272] In one embodiment, the data block acquisition module 320 is configured as follows:

[0273] M data groups are acquired, and information indicating the number N of resource units and the location of at least one of the N resource units is added to each data group to generate M data blocks to be transmitted.

[0274] In one embodiment, each data block contains designated bits that indicate the number N of resource units and the location of at least one of the N resource units.

[0275] In one embodiment, the designated bit is an implicit indicator bit or an explicit indicator bit.

[0276] In one embodiment, the designated bit is a data bit in the common data, wherein the common data is data contained in M ​​data blocks.

[0277] In one embodiment, the designated bit includes one of the following:

[0278] A first bit is used to indicate the number N of resource units, and a second bit is used to indicate the position of at least one of the N resource units;

[0279] The third bit is used to indicate the number of bit groups X, and the X bit groups are used to indicate the location of at least one of the N resource units, where X is an integer greater than or equal to 1.

[0280] A first bitmap used to indicate the location of at least one of the N resource units;

[0281] 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.

[0282] In one embodiment, the resource determination module 310 is configured as follows:

[0283] When the specified bit includes a first bit map indicating the location of at least one of the N resource units, and the number of values ​​of the first bit map that are all 0 or have values ​​of 1 exceeds a specified value, the number N of resource units and the corresponding N resource units are determined according to a specified rule.

[0284] In one embodiment, each data block further includes at least one of the following:

[0285] Starting location information of available resource units;

[0286] Information on the number of available resource units.

[0287] In one embodiment, the N resource units satisfy at least one of the following:

[0288] The N resource units are located within the relevant bandwidth range;

[0289] The N resource units are located within the relevant time range;

[0290] The channels on the N resource units are correlated.

[0291] In one embodiment, each data block further includes at least one of the following:

[0292] Pilot information used on at least one of the N resource units;

[0293] Sequence information used on at least one of the N resource units.

[0294] In one embodiment, at least one of the M data blocks further includes identification information.

[0295] In one embodiment, at least one of the M data blocks further contains valid data.

[0296] The data transmission device proposed in this embodiment belongs to the same inventive concept as the data transmission method applied to the transmitter proposed in the above embodiments. Technical details not described in detail in this embodiment can be found in any of the above embodiments. Furthermore, this embodiment has the same beneficial effects as performing the data transmission method applied to the transmitter.

[0297] This application also provides a data transmission device. Figure 8 A schematic diagram of a data transmission device provided for another embodiment. (See diagram below.) Figure 8 As shown, the data transmission device includes a resource determination module 410 and a detection module 420.

[0298] The resource to be detected determination module 410 is configured to determine the resource unit to be detected;

[0299] The detection module 420 is configured to perform detection on the resource unit to be detected and obtain a first detection result. The first detection result includes at least one data block among M data blocks. 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 among 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.

[0300] The data transmission device of this embodiment transmits M data blocks by using N resource units, and carries the number of resource units N and the location information of at least one resource unit among the N resource units in each data block. The receiver can obtain information such as the resource units used by the transmitter from the decoded data. Using this information, the data on these resource units can be processed comprehensively, thereby improving the reliability of data transmission, improving the transmission performance in the event of collision, and improving the performance and capacity of contention-free scheduling transmission.

[0301] In one embodiment, the first detection result further includes at least one of the following information: starting position information of available resource units; number of available resource units; pilot information on at least one of the N resource units; sequence information on at least one of the N resource units; identification information; and valid data.

[0302] In one embodiment, the detection module 420 is configured to: acquire the received symbols on the resource unit to be detected; detect the received symbols and acquire the first detection result.

[0303] In one embodiment, it further includes:

[0304] The resource detection determination module 410 is further configured to determine the resource unit to be processed, or update the resource unit to be detected, based on the information contained in the first detection result, which indicates the number N of resource units used to transmit the M data blocks and the position of at least one of the N resource units.

[0305] In one embodiment, it further includes:

[0306] The reconstruction module is configured to reconstruct the symbol based on the first detection result to obtain the reconstructed symbol.

[0307] The channel estimation module is configured to perform channel estimation on at least one of the N resource units based on the reconstructed symbols, and obtain the channel estimation result.

[0308] In one embodiment, it further includes:

[0309] The interference cancellation module is configured to perform interference cancellation on the received symbols on at least one resource unit based on the reconstructed symbols and the channel estimation results, so as to obtain the received symbols after interference cancellation.

[0310] The detection module 420 is further configured to detect the received symbols after interference cancellation and obtain a second detection result.

[0311] In one embodiment, the detection module 420 is further configured as follows:

[0312] Based on the channel estimation result, the received symbols on the at least one resource unit are detected to obtain a third detection result.

[0313] The data transmission device proposed in this embodiment belongs to the same inventive concept as the data transmission method applied to the receiver proposed in the above embodiments. Technical details not described in detail in this embodiment can be found in any of the above embodiments. Furthermore, this embodiment has the same beneficial effects as performing the data transmission method applied to the receiver.

[0314] This application also provides a transmitter. The data transmission method applied to the transmitter in the above embodiments can be executed by a data transmission device, which can be implemented by software and / or hardware and integrated into the transmitter. The transmitter can be a terminal.

[0315] Figure 9 This is a schematic diagram of the hardware structure of a transmitter provided in one embodiment. Figure 9 As shown, this embodiment provides a transmitter, including a processor 510 and a storage device 520. The processor in the transmitter can be one or more. Figure 9 Taking a processor 510 as an example, the processor 510 and the storage device 520 in the device can be connected via a bus or other means. Figure 9 Taking the example of a connection between China and Israel via a bus.

[0316] The one or more programs are executed by the one or more processors 510, causing the one or more processors to implement the data transmission method applied to the transmitter as described in any of the above embodiments.

[0317] The storage device 520 in the transmitter serves as a computer-readable storage medium, capable of storing one or more programs. These programs can be software programs, computer-executable programs, and modules, such as the program instructions / modules corresponding to the data transmission method in this embodiment of the invention (e.g., appendix). Figure 7 The data transmission device shown includes modules such as 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 software programs, instructions, and modules stored in the storage device 520, thereby implementing the data transmission method applied to the transmitter in the above method embodiment.

[0318] Storage device 520 mainly includes a program storage area and a data storage area. The program storage area can store the operating system and at least one application program required for a function. The data storage area can store data created according to the use of the device (such as data blocks in the above embodiment, information indicating the number N of resource units and the location of at least one of the N resource units, etc.). Furthermore, storage device 520 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, storage device 520 may further include memory remotely located relative to processor 510, which can be connected to a transmitter via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0319] Furthermore, when one or more programs included in the aforementioned transmitter are executed by one or more processors 510, the following operations are performed: determining the number of resource units N and the corresponding N resource units, where N is an integer greater than or equal to 1; acquiring M data blocks to be transmitted, where M is an integer greater than or equal to 1, wherein each data block contains information indicating the number of resource units N and the position of at least one of the N resource units; and transmitting the M data blocks on the N resource units.

[0320] The transmitter proposed in this embodiment and the data transmission method applied to the transmitter proposed in the above embodiments belong to the same inventive concept. Technical details not described in detail in this embodiment can be found in any of the above embodiments. Furthermore, this embodiment has the same beneficial effects as performing the data transmission method applied to the transmitter.

[0321] This application also provides a receiver. The data transmission method applied to the receiver in the above embodiments can be executed by a data transmission device, which can be implemented by software and / or hardware and integrated into the receiver. The receiver can be a base station.

[0322] Figure 10 This is a schematic diagram of the hardware structure of a receiver provided in one embodiment. For example... Figure 10 As shown, this embodiment provides a receiver, including a processor 610 and a storage device 620. The processor in this receiver can be one or more. Figure 10 Taking a processor 610 as an example, the processor 610 and the storage device 620 in the device can be connected via a bus or other means. Figure 10 Taking the example of a connection between China and Israel via a bus.

[0323] The one or more programs are executed by the one or more processors 610, causing the one or more processors to implement the data transmission method applied to the receiver as described in any of the above embodiments.

[0324] The storage device 620 in the receiver serves as a computer-readable storage medium, capable of storing one or more programs. These programs can be software programs, computer-executable programs, and modules, such as the program instructions / modules corresponding to the data transmission method in this embodiment of the invention (e.g., appendix). Figure 8 The data transmission device shown includes modules such as a resource determination module 410 and a detection module 420. The processor 610 executes various functions and data processing of the receiver by running software programs, instructions, and modules stored in the storage device 620, thereby implementing the data transmission method applied to the receiver in the above method embodiment.

[0325] Storage device 620 mainly includes a program storage area and a data storage area. The program storage area can store the operating system and at least one application program required for a function; the data storage area can store data created based on device usage (such as data blocks, first detection results, etc. in the above embodiments). Furthermore, storage device 620 may include high-speed random access memory and non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some examples, storage device 620 may further include memory remotely located relative to processor 610, which can be connected to a receiver via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0326] Furthermore, when one or more programs included in the aforementioned receiver are executed by one or more processors 610, the following operations are performed: determining the 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, and the first detection result contains information for indicating the number N of resource units used to transmit the M data blocks and the position of at least one resource unit among the N resource units, wherein M is an integer greater than or equal to 1, and N is an integer greater than or equal to 1.

[0327] The receiver proposed in this embodiment and the data transmission method applied to the receiver proposed in the above embodiments belong to the same inventive concept. Technical details not described in detail in this embodiment can be found in any of the above embodiments. Furthermore, this embodiment has the same beneficial effects as performing the data transmission method applied to the receiver.

[0328] This application also provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to perform a data transmission method. The method includes: determining a number N of resource units and corresponding N resource units, where N is an integer greater than or equal to 1; acquiring M data blocks to be transmitted, where M is an integer greater than or equal to 1, wherein each data block contains information indicating the number N of resource units and the location of at least one of the N resource units; and transmitting the M data blocks on the N resource units.

[0329] Alternatively, 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, and the first detection result contains information for indicating the number N of resource units used to transmit the M data blocks and the location of at least one resource unit among the N resource units, wherein M is an integer greater than or equal to 1 and N is an integer greater than or equal to 1.

[0330] Based on the above description of the implementation methods, those skilled in the art will understand that this application can be implemented using software and general-purpose hardware, or it can be implemented using hardware. Based on this understanding, the technical solution of this application can be embodied in the form of a software product. This 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, hard disk, or optical disk, etc., including multiple instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in any embodiment of this application.

[0331] The above description is merely an exemplary embodiment of this application and is not intended to limit the scope of protection of this application.

[0332] Any block diagram of logical flow in the accompanying drawings of this 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 may be stored in memory. The memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical storage devices and systems (Digital Multifunction Discs, DVDs, or CDs), etc. Computer-readable media may include non-transitory storage media. The data processor may be of any type suitable to the local technical environment, such as, but not limited to, general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), programmable logic devices (FGPAs), and processors based on multi-core processor architectures.

[0333] A detailed description of exemplary embodiments of this application has been provided above through exemplary and non-limiting examples. However, various modifications and adjustments to the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and claims, without departing from the scope of the invention. Therefore, the proper scope of the invention will be determined by the claims.

Claims

1. A data transmission method applied to a transmitter, characterized in that, include: Determine the number of resource units N and the corresponding N resource units, where N is an integer greater than or equal to 1; Obtain M data blocks to be transmitted, where M is an integer greater than or equal to 1. Each data block contains information indicating the number N of resource units and the location of at least one of the N resource units. Each data block also contains a specified bit, which is used to indicate the number N of resource units and the location of at least one other resource unit among the N resource units. The M data blocks are transmitted on the N resource units.

2. The method according to claim 1, characterized in that, The determination of the number N of resource units and the corresponding N resource units includes: The number of resource units N and the corresponding N resource units are determined based on the information contained in each data block that indicates the number of resource units N and the location of at least one of the N resource units.

3. The method according to claim 1, characterized in that, The determination of the number N of resource units and the corresponding N resource units includes one of the following: The number N of resource units is randomly determined and N resource units are randomly selected; The number of resource units N is determined based on the number M of data blocks to be transmitted, and N resource units are randomly selected.

4. The method according to claim 1, characterized in that, The acquisition of the M data blocks to be transmitted includes: M data groups are acquired, and information indicating the number N of resource units and the location of at least one of the N resource units is added to each data group to generate M data blocks to be transmitted.

5. The method according to claim 1, characterized in that, The specified bit can be an implicit indicator bit or an explicit indicator bit.

6. The method according to claim 1, characterized in that, The designated bit is the data bit in the public data, wherein the public data is the data contained in all M data blocks.

7. The method according to claim 1, characterized in that, The specified bit includes one of the following: A first bit is used to indicate the number N of resource units, and a second bit is used to indicate the position of at least one of the N resource units; The third bit is used to indicate the number of bit groups X, and the X bit groups are used to indicate the location of at least one of the N resource units, where X is an integer greater than or equal to 1. A first bitmap used to indicate the location of at least one of 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 used to indicate the position of the last resource unit.

8. The method according to claim 7, characterized in that, The determination of the number of resource units N and the corresponding N resource units includes: when the specified bit includes a first bit map for indicating the position of at least one of the N resource units, and the number of values ​​of the first bit map that are all 0 or have values ​​of 1 exceeds a specified value, determining the number of resource units N and the corresponding N resource units according to a specified rule.

9. The method according to claim 1, characterized in that, Each data block also contains at least one of the following: Starting location information of available resource units; Information on the number of available resource units.

10. The method according to claim 1, characterized in that, 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 correlated.

11. The method according to claim 1, characterized in that, Each data block also contains at least one of the following: Pilot information used on at least one of the N resource units; Sequence information used on at least one of the N resource units.

12. The method according to claim 1, characterized in that, At least one of the M data blocks also contains identity information.

13. The method according to claim 1, characterized in that, At least one of the M data blocks also contains valid data.

14. A data transmission method applied to a receiver, characterized in that, include: Identify the resource unit to be detected; Detection is performed 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 contains information for indicating the number N of resource units used to transmit the M data blocks and the location of at least one resource unit among the N resource units, wherein M is an integer greater than or equal to 1 and N is an integer greater than or equal to 1. Each data block contains a specified bit, which is used to indicate the number N of resource units and the location of at least one other resource unit among the N resource units.

15. The method according to claim 14, characterized in that, The first detection result also includes at least one of the following: Starting location information of available resource units; Information on the number of available resource units; Pilot information on at least one of the N resource units; Sequence information on at least one of the N resource units; Identification information; Valid data.

16. The method according to claim 14, characterized in that, The step of performing detection on the resource unit to be detected and obtaining a first detection result includes: Obtain the received symbol on the resource unit to be detected; The received symbol is detected, and the first detection result is obtained.

17. The method according to claim 14, characterized in that, Also includes: Based on the information contained in the first detection result, which indicates the number N of resource units used to transmit the M data blocks and the location of at least one of the N resource units, the resource unit to be processed is determined, or the resource unit to be detected is updated.

18. The method according to claim 14, characterized in that, Also includes: The reconstructed symbol is obtained by reconstructing the symbol based on the first detection result; Channel estimation is performed on at least one of the N resource units based on the reconstructed symbols to obtain the channel estimation result.

19. The method according to claim 18, characterized in that, Also includes: Based on the reconstructed symbols and the channel estimation results, interference cancellation is performed on the received symbols on the at least one resource unit to obtain the interference-cancelled received symbols. The received symbols after interference cancellation are detected to obtain a second detection result.

20. The method according to claim 18, characterized in that, Also includes: Based on the channel estimation result, the received symbols on the at least one resource unit are detected to obtain a third detection result.

21. A data transmission device, characterized in that, include: The resource determination module is set to determine the number of resource units N 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. Each data block contains information indicating the number N of resource units and the location of at least one of the N resource units. Each data block contains a specified bit, which is used to indicate the number N of resource units and the location of at least one other resource unit among the N resource units. The transmission module is configured to transmit the M data blocks over the N resource units.

22. A data transmission device, characterized in that, include: The module for determining resources to be detected is configured to determine the resource units to be detected. The detection module is configured to perform detection on the resource unit to be detected and obtain a first detection result. The first detection result includes at least one data block among M data blocks. 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 among the N resource units. M is an integer greater than or equal to 1, and N is an integer greater than or equal to 1. Each data block contains a specified bit, which is used to indicate the number N of resource units and the location of at least one other resource unit among the N resource units.

23. A transmitter, characterized in that, include: One or more processors; Storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the data transmission method as described in any one of claims 1-13.

24. A receiver, characterized in that, include: One or more processors; Storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the data transmission method as described in any one of claims 14-20.

25. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the data transmission method as described in any one of claims 1-13 or the data transmission method as described in any one of claims 14-20.

Images