Communication method, communication apparatus, chip system, storage medium, and program product

Abstract

Embodiments of the present application provide a communication method, a communication apparatus, a chip system, a storage medium, and a program product, which are applied in the technical field of communications, and are conducive to reducing energy consumption of a terminal device and improving resource utilization. The method comprises: a first communication apparatus sends first messages on a first resource set, wherein the first messages are used for requesting access; correspondingly, a second communication apparatus receives X first messages; and the second communication apparatus sends Y second messages on a second resource set, wherein the second messages comprise responses to the first messages, each of N second time-frequency resources is associated with K first time-frequency resources, each of the N second time-frequency resources is used for sending all or some of the responses to the first messages from the K first time-frequency resources, and 1<K<M; correspondingly, the first communication apparatus receives the second messages.

Description

Communication methods, communication devices, chip systems, storage media and software products

[0001] This application claims priority to Chinese patent application filed on January 27, 2025, with application number 202510127459.6 and entitled "Communication Method, Communication Device, Chip System, Storage Medium and Program Product", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to a communication method, communication device, chip system, storage medium and program product. Background Technology

[0003] During random access, after receiving an access request from a terminal device, the network device can send an access request response to the terminal device to indicate that the random access was successful. After receiving the access request response, the terminal device can send data to the network device.

[0004] In related technologies, network devices can send access request responses in any of the following ways: 1) There is a one-to-one correspondence between access request resources and access request response resources, and the network device can reply with an access request response on the corresponding access request response resource for each received access request; 2) The network device can reply with only one access request response for all received access requests.

[0005] The implementation of method 1) above requires network devices to reserve corresponding access request response resources for access request resources that have not sent access requests, resulting in a significant waste of resources; while the implementation of method 2) above may cause terminal devices to receive a lot of redundant access request responses, resulting in a large energy consumption of themselves. Summary of the Invention

[0006] This application provides a communication method, communication device, chip system, storage medium, and program product, which are applied in the field of communication technology and are beneficial to saving energy consumption of terminal equipment and improving resource utilization.

[0007] In a first aspect, embodiments of this application propose a communication method applied to a second communication device. The method includes: receiving X first messages on a first resource set, the first resource set including M first time-frequency resources, the first time-frequency resources being used to send the first messages, the first messages being used to request access; and sending Y second messages on a second resource set, the second resource set including N second time-frequency resources, the second time-frequency resources being used to send the second messages, the second messages including responses to the first messages, each of the N second time-frequency resources being associated with K first time-frequency resources, each of the N second time-frequency resources being used to send all or part of the responses from the first messages on the K first time-frequency resources, where 1 < K < M.

[0008] In one implementation, the first message can be called an access request, a random access request, or Msg1, or any message name used to describe the request for access. The second message can be called an access response, a random access response, or Msg2, or any name that includes the meaning of responding to the first message. This application does not limit the specific names of the first message and the second message.

[0009] In this embodiment, each of the N second time-frequency resources included in the second resource set is associated with K first time-frequency resources. This means that each second time-frequency resource can be used to send all or part of the response to the first message received from the K first time-frequency resources associated with it, where 1 < K < M. This approach, compared to the second communication device only being able to use a certain second time-frequency resource to send the first message received on its corresponding first time-frequency resource (or, in other words, a one-to-one correspondence between access request response resources and access request resources), allows each second time-frequency resource to be associated with K first time-frequency resources. Thus, even if no first message is received on a certain first time-frequency resource associated with a second time-frequency resource, that second time-frequency resource can still be used to send responses to the first message received on other first time-frequency resources associated with it. The unused first time-frequency resources can be... The reduced likelihood of failure is beneficial for improving the utilization rate of the second time-frequency resource and reducing resource waste. On the other hand, in the method provided by the embodiments of this application, the second communication device (equivalent to the network device mentioned above) can use the second time-frequency resource to send all or part of the response to the first message from the K first time-frequency resources associated with it. Compared with the case where the second communication device uses a second message (one second message is carried on one second time-frequency resource) to respond to all the first messages received on M first time-frequency resources (equivalent to the case where the network device can only reply to one access request response for all the received access requests), the first communication device can only receive the second message on the second time-frequency resource corresponding to the first time-frequency resource it uses. Since the second message may not contain the response to all the first messages, it is beneficial to reduce the redundant information that the first communication device needs to receive and to save the energy consumption of the first communication device.

[0010] In conjunction with the first aspect, in some implementations of the first aspect, the M first time-frequency resources are arranged in a first order, wherein the M first time-frequency resources are connected end-to-end in the first order, and the N second time-frequency resources are arranged in a second order; the K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include the following two implementation methods:

[0011] Implementation method 1: The xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained sequentially in a preset direction starting from the xth first time-frequency resource, wherein x is agreed upon by the protocol or determined by the network side, and x is related to n.

[0012] Optionally, the relationship between x and n can be x = n, x = n * K, or x = n[*[M / N]], but this application does not specifically limit this. It should be understood that [] is the floor operator, and "[a]" represents the largest integer not exceeding the number a, that is, the integer part of a.

[0013] In one possible implementation, the position m of the first time-frequency resource associated with the nth second time-frequency resource among the N second time-frequency resources in the first order, and the relationship between the position m and the x, the K and the M, satisfies: m = (x + k) mod M, where k = 0, 1, 2...K-1.

[0014] Implementation Method 2: The xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained from the xth first time-frequency resource in a preset direction, wherein there is a y-time-frequency resource interval between every two adjacent first time-frequency resources in the K first time-frequency resources, wherein y is agreed upon by the protocol or determined by the network side.

[0015] In one possible implementation, the position m of the first time-frequency resource associated with the nth second time-frequency resource among the N second time-frequency resources in the first order, and the relationship between the position m and the x, the y and the M, satisfies: m = (x + k * y) mod M, where k = 0, 1, 2, ..., K-1.

[0016] The method provided in this application embodiment allows for multiple ways to associate the nth second time-frequency resource among N second time-frequency resources with the K first time-frequency resources. That is, any second time-frequency resource and a first time-frequency resource may not have a strong binding relationship. The time domain position of a certain second time-frequency resource in the second resource set is not strongly associated with the time domain positions of its associated k first time-frequency resources in the first resource set, which is beneficial for the flexible utilization of resources.

[0017] In conjunction with the first aspect, in some implementations of the first aspect, the first order includes: M first time-frequency resources arranged in order of frequency domain from low to high and time domain from front to back.

[0018] The M first time-frequency resources are arranged first in the frequency domain from low to high, and then in the time domain from front to back. This can be understood as starting from the first time-domain unit, sorting the first time-frequency resources corresponding to that time-domain unit in ascending order of frequency domain. Then, starting from that time-domain unit, the first time-frequency resources corresponding to the next time-domain unit are sorted in ascending order of frequency domain, until the first time-frequency resources corresponding to the last time-domain unit are sorted in ascending order of frequency domain.

[0019] In conjunction with the first aspect, in some implementations of the first aspect, the first order includes: a third order obtained by arranging M first time-frequency resources in a first frequency domain from low to high and then in a second time domain from front to back, and an order obtained by performing row-column interleaving based on the third order.

[0020] In some implementations, the first resource set contains both TDMA and FDMA. The M first time-frequency resources in the first resource set are arranged in a first order, which is obtained by first arranging them from low to high in the frequency domain and then from front to back in the time domain, and then performing row and column interleaving. The second resource set contains only TDMA. The N second time-frequency resources in the second resource set can be arranged in a second order, which can be arranged from front to back in the time domain.

[0021] Based on a first order obtained by arranging M first time-frequency resources in ascending frequency domain and then in ascending time domain, followed by row-column interleaving, and a second order obtained by arranging N second time-frequency resources in ascending time domain, combined with the two implementation methods of associating the second time-frequency resources with K first time-frequency resources, each second time-frequency resource is associated with K first time-frequency resources. This approach has two advantages: firstly, when a first communication device sends a first message using a later-time-domain first time-frequency resource in the first resource set, it may receive its own response on a earlier-time-domain second time-frequency resource in the second resource set, thus saving energy; secondly, for communication devices sending first messages using later-time-domain first time-frequency resources in the first resource set, when the number of second time-frequency resources in the second resource set is limited, this approach helps the first communication device receive its response on the second resource set, thus reducing the energy consumption of the second communication device and decreasing the packet loss rate of the second message.

[0022] In conjunction with the first aspect, in some implementations of the first aspect, each of the second messages includes a response to P of the first messages, wherein P is agreed upon by the protocol or determined by the network side, and P≤K.

[0023] In this embodiment, the network side can be understood as a second communication device, meaning the second communication device can determine the number of responses to the first message included in the second message based on protocol agreements or its own specific implementation. Thus, the responses to the first message carried by the second time-frequency resource are not fixed, which facilitates flexible configuration of the second time-frequency resource and improves resource utilization.

[0024] Secondly, this application also provides a communication method applied to a first communication device, the method comprising: sending a first message on a first resource set, the first resource set including M first time-frequency resources, the first time-frequency resources being used to send the first message, the first message being used to request access; receiving a second message on a second resource set, the second resource set including N second time-frequency resources, the second time-frequency resources being used to send the second message, the second message including a response to the first message, each of the N second time-frequency resources being associated with K first time-frequency resources, each of the N second time-frequency resources being used to send all or part of the response to the first message from the K first time-frequency resources, 1 < K < M.

[0025] In conjunction with the second aspect, in some implementations of the second aspect, the M first time-frequency resources are arranged in a first order, wherein the M first time-frequency resources are connected end-to-end in the first order, and the N second time-frequency resources are arranged in a second order; the K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained sequentially in a preset direction starting from the xth first time-frequency resource, wherein x is agreed upon by the protocol or determined by the network side, and x is related to n.

[0026] In conjunction with the second aspect, in some implementations of the second aspect, the position m of the first time-frequency resource associated with the nth second time-frequency resource among the N second time-frequency resources in the first order, and the relationship between the position m and the x, the K and the M, satisfy: m = (x + k) mod M, where k = 0, 1, 2…K-1.

[0027] In conjunction with the second aspect, in some implementations of the second aspect, the M first time-frequency resources are arranged in a first order, the M first time-frequency resources are connected end to end, and the N second time-frequency resources are arranged in a second order; the K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained from the xth first time-frequency resource in a preset direction, wherein each pair of adjacent first time-frequency resources among the K first time-frequency resources is spaced y times apart, where y is agreed upon by the protocol or determined by the network side.

[0028] In conjunction with the second aspect, in some implementations of the second aspect, the position m of the first time-frequency resource associated with the nth second time-frequency resource among the N second time-frequency resources in the first order, and the relationship between the position m and the x, the y and the M, satisfy: m = (x + k * y) mod M, where k = 0, 1, 2…K-1.

[0029] In conjunction with the second aspect, in some implementations of the second aspect, the first order includes: M first time-frequency resources arranged in order of frequency domain from low to high and time domain from front to back.

[0030] In conjunction with the second aspect, in some implementations of the second aspect, the first order includes: a third order obtained by arranging M first time-frequency resources in a first frequency domain from low to high and then in a second time domain from front to back, and an order obtained by performing row-column interleaving based on the third order.

[0031] In conjunction with the second aspect, in some implementations of the second aspect, each of the second messages includes a response to P of the first messages, wherein P is agreed upon by the protocol, configured on the network side, or determined according to the network side configuration, and P≤K.

[0032] Thirdly, a communication apparatus is provided for performing the method in any possible implementation of the first or second aspect described above. Specifically, the apparatus includes a module for performing the method in any possible implementation of the first or second aspect described above.

[0033] Fourthly, this application provides yet another communication device, including a processor coupled to a memory, which can be used to execute instructions in the memory to implement the method in any of the possible implementations of the first or second aspect described above. Optionally, the device further includes a memory. Optionally, the device further includes a communication interface, to which the processor is coupled.

[0034] In one implementation, the device is a terminal device. When the device is a terminal device, the aforementioned communication interface can be a transceiver, or an input / output interface.

[0035] In another implementation, the device is a chip configured in a terminal device. When the device is a chip configured in a terminal device, the aforementioned communication interface can be an input / output interface.

[0036] Fifthly, a processor is provided, comprising: an input circuit, an output circuit, and a processing circuit. The processing circuit is configured to receive signals through the input circuit and transmit signals through the output circuit, causing the processor to execute the method in any possible implementation of the first or second aspect described above.

[0037] In the specific implementation process, the processor can be a chip, the input circuit can be an input pin, the output circuit can be an output pin, and the processing circuit can be a transistor, gate circuit, flip-flop, and various logic circuits. The input signal received by the input circuit can be received and input by, for example, but not limited to, a receiver, and the signal output by the output circuit can be output to, for example, but not limited to, a transmitter and transmitted by the transmitter. Furthermore, the input circuit and the output circuit can be the same circuit, which is used as the input circuit and the output circuit at different times. This application does not limit the specific implementation of the processor and various circuits.

[0038] A sixth aspect provides a processing apparatus including a processor and a memory. The processor is configured to read instructions stored in the memory and to receive signals via a receiver and transmit signals via a transmitter to execute the methods in any of the possible implementations of the first or second aspect described above.

[0039] Optionally, the processor may be one or more, and the memory may be one or more.

[0040] Optionally, the memory may be integrated with the processor, or the memory may be separated from the processor.

[0041] In the specific implementation process, the memory can be a non-transitory memory, such as read-only memory (ROM), which can be integrated with the processor on the same chip or set on different chips. This application does not limit the type of memory or the way the memory and processor are set.

[0042] It should be understood that the relevant data interaction process, such as sending instruction information, can be a process of outputting instruction information from the processor, and receiving capability information can be a process of the processor receiving input capability information. Specifically, the processed output data can be output to the transmitter, and the input data received by the processor can come from the receiver. Here, the transmitter and receiver can be collectively referred to as transceivers.

[0043] The processing device in the sixth aspect above can be a chip. The processor can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc. When implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. The memory can be integrated into the processor or located outside the processor and exist independently.

[0044] In a seventh aspect, a computer program product is provided, comprising: a computer program (also referred to as code or instructions) that, when executed, causes a computer to perform the method in any possible implementation of the first or second aspect described above.

[0045] Eighthly, a computer-readable storage medium is provided that stores a computer program (also referred to as code or instructions) that, when executed on a computer, causes the computer to perform the methods in any of the possible implementations of the first or second aspect described above.

[0046] Ninthly, a communication system is provided, including the aforementioned first communication device and second communication device. Optionally, the communication system may further include other communication devices. Attached Figure Description

[0047] Figure 1 is a schematic diagram of the communication system provided in an embodiment of this application;

[0048] Figure 2 is a schematic diagram of a resource correspondence provided in an embodiment of this application;

[0049] Figure 3 is a schematic diagram of another resource correspondence provided in an embodiment of this application;

[0050] Figure 4 is a schematic flowchart of a communication method provided in an embodiment of this application;

[0051] Figure 5 is a schematic diagram of a first-order sorting method provided in an embodiment of this application;

[0052] Figure 6 is a schematic diagram of another first-order sorting method provided in the embodiments of this application;

[0053] Figure 7 is a schematic diagram of another first-order sorting method provided in the embodiments of this application;

[0054] Figure 8 is a schematic diagram of another sorting method for the first order provided in the embodiments of this application;

[0055] Figure 9 is a schematic block diagram of a communication device provided in an embodiment of this application;

[0056] Figure 10 is a schematic block diagram of another communication device provided in an embodiment of this application. Detailed Implementation

[0057] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0058] To facilitate understanding of the embodiments of this application, the following points are explained first:

[0059] First, in the embodiments of the present application, terms such as "first" and "second" are used to distinguish identical or similar items with basically the same functions and roles. For example, the first value and the second value are only used to distinguish different values, and do not limit their sequence. Those skilled in the art can understand that terms such as "first" and "second" do not limit the quantity and execution order, and the terms "first" and "second" do not necessarily limit differences.

[0060] It should be noted that in the embodiments of the present application, words such as "exemplarily" or "for example" are used to give examples, illustrations or explanations. Any embodiment or design solution described as "exemplarily" or "for example" in the present application should not be construed as more preferred or more advantageous than other embodiments or design solutions. Rather, the use of words such as "exemplarily" or "for example" aims to present relevant concepts in a specific manner.

[0061] In the embodiments of the present application, "at least one" means one or more, and "multiple" means two or more. "And / or" describes the association relationship of associated objects, indicating that three relationships can exist. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the associated objects before and after are in an "or" relationship. "At least one (item)" or its similar expression refers to any combination of these items, including any combination of single item (item) or plural items (items). For example, at least one (item) of a, b, or c can represent: a, b, c, a - b, a - c, b - c, or a - b - c, where a, b, and c can be single or multiple.

[0062] Second, "send" and "receive" in the embodiments of the present application represent the direction of signal transmission. For example, "sending information to the second device" can be understood as the destination of the information being the second device, which can include direct transmission through the air interface, and also include indirect transmission through the air interface by other units or modules. "Receiving configuration information from charging" can be understood as the source of the configuration information being the second device, which can include directly receiving from the second device through the air interface, or indirectly receiving from the second device through the air interface from other units or modules. "Send" can also be understood as the "output" of the chip interface, and "receive" can also be understood as the "input" of the chip interface.

[0063] In other words, sending and receiving can be carried out between devices. For example, between the second device and the first device; it can also be carried out within a device. For example, sending or receiving between components within a device, between modules, between chips, between software modules or hardware modules through a bus, trace or interface.

[0064] It is understandable that information may undergo necessary processing, such as encoding and modulation, before being sent from the source to the destination. Similarly, the destination, upon receiving information from the source, can also perform corresponding processing, such as decoding and demodulation, to interpret the valid information from the source. Similar expressions in this application can be understood in a similar way and will not be elaborated further.

[0065] Third, for ease of understanding, this document provides several examples of messages or signals, such as a first signal, a second signal, a first message, a second message, or a third message. These signals or messages and their names are merely examples and should not be construed as limiting this application.

[0066] Fourth, in the embodiments of this application, "instruction" can include direct instruction and indirect instruction, as well as explicit instruction and implicit instruction. The information indicated by a certain piece of information is called the information to be instructed. In the specific implementation process, there are many ways to instruct the information to be instructed, such as, but not limited to, directly instructing the information to be instructed, such as the information to be instructed itself or its index. It can also indirectly instruct the information to be instructed by instructing other information, where there is a relationship between the other information and the information to be instructed; or it can only instruct a part of the information to be instructed, while the other parts of the information to be instructed are known or pre-agreed upon. For example, the instruction of specific information can be achieved by using a pre-agreed (e.g., protocol predefined) arrangement order of various pieces of information, thereby reducing instruction overhead to a certain extent. This application does not limit the specific method of instruction.

[0067] It is understandable that, for the sender of the instruction information, the instruction information can be used to indicate the information to be indicated, and for the receiver of the instruction information, the instruction information can be used to determine the information to be indicated.

[0068] Fifth, the tables in the embodiments of this application are merely examples. The values ​​of the information in each table are only examples and can be configured to other values; this application is not limited thereto. The tables do not limit the scope of protection of this application. For example, appropriate modifications and adjustments can be made based on the tables described above, such as splitting, merging, etc. Furthermore, the parameter names shown in the headings of each table can also use other names understandable to the communication device, and the values ​​or representations of the parameters can also be other values ​​or representations understandable to the communication device. Moreover, in the implementation of the above tables, other data structures can also be used, such as arrays, queues, containers, stacks, linear lists, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables, or hash tables, etc.

[0069] Sixth, in the embodiments of this application, descriptions such as "when," "under the circumstances," "if," and "if" all refer to the fact that the device (e.g., network device or terminal device) will make corresponding processing under certain objective circumstances. They are not time limits, nor do they require the device (e.g., network device or terminal device) to make a judgment action when implementing it, nor do they mean that there are other limitations.

[0070] Seventh, the predefined terms in this application can be understood as: definition, pre-defined, storage, pre-storage, pre-negotiation, pre-configuration, solidification, or pre-firing.

[0071] Eighth, the term "storage" in this application can refer to storage in one or more memories. These memories can be separate installations or integrated into an encoder, decoder, processor, or communication device. Alternatively, some memories can be separately installed, while others are integrated into the decoder, processor, or communication device. The type of memory can be any form of storage medium, and this application does not limit this.

[0072] Ninth, several embodiments are described in detail below with reference to multiple flowcharts. However, it should be understood that these flowcharts and their corresponding descriptions are for illustrative purposes only and should not constitute any limitation on this application. Not every step in each flowchart is necessarily required; for example, some steps can be skipped. Furthermore, the execution order of each step is not fixed and is not limited to what is shown in the figures. The execution order of each step should be determined by its function and internal logic.

[0073] The technical solutions of this application can be applied to various communication systems, such as: Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, 5th Generation (5G) systems or New Radio (NR) systems, future communication systems, and Ambient Internet of Things (AIoT) systems, etc.

[0074] Figure 1 illustrates a schematic diagram of a communication system 100 to which embodiments of this application are applicable. The communication system 100 may include at least one first communication device 101 and at least one second communication device 102, and the first communication device 101 and the second communication device 102 may communicate via a wireless link.

[0075] In one possible scenario, the second communication device 102 can act as a transmitter and the first communication device 101 can act as a receiver, with the second communication device 102 sending downlink signals to the first communication device 101; in another possible scenario, the second communication device 102 can act as a receiver and the first communication device 101 can act as a transmitter, with the first communication device 101 sending uplink signals to the second communication device 102.

[0076] Optionally, the communication system 100 may further include a relay device (not shown in Figure 1). In one possible implementation, the second communication device 102 can act as a transmitter, and the first communication device 101 can act as a receiver, with the second communication device 102 transmitting downlink signals to the first communication device 101 via the relay device. In another possible implementation, the second communication device 102 can act as a receiver, and the first communication device 101 can act as a transmitter, with the first communication device 101 transmitting uplink signals to the second communication device 102 via the relay device. The type of the relay device can be the same as that of the first or second communication device, and this application does not limit this.

[0077] Optionally, the first communication device may be referred to as: terminal equipment, user equipment (UE), mobile station (MS), mobile terminal (MT), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent, or user equipment, etc.

[0078] The first communication device can be a device that provides voice / data connectivity to a user, such as a handheld device or vehicle-mounted device with wireless connectivity. Currently, examples of terminal devices include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), point-of-sale (POS) machines, customer-premises equipment (CPEs), light user equipment (UEs), reduced capability UEs (REDCAP UEs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving vehicles, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, cellular phones, cordless phones, SIP phones, wireless local loop (WLL) stations, and personal digital assistants (PDAs). This application does not limit the scope to include devices such as personal assistants (PDAs), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to a wireless modem, in-vehicle devices, wearable devices, terminal devices in 5G networks, or terminal devices in future evolved public land mobile networks (PLMNs).

[0079] By way of example and not limitation, in this application, the first communication device may be an ambient internet of things (AIoT) device. It should be understood that an AIoT device may also be referred to as a tag, A-IoT device, tag, electronic AIoT device, AIoT tag, smart AIoT device, transponder, data carrier, or device, etc., and this application does not specifically limit its usage. For ease of understanding, a tag will be used as an example in the following description.

[0080] To accommodate different use cases, labels can include multiple types of devices. For example, they include: label 1 (device 1), label 2a (device 2a), label 2b (device 2b), and label c (device c).

[0081] Device 1 can also be referred to as a Type 1 tag or AIoT device 1, etc. It lacks downlink and uplink power amplification capabilities and has a limited frequency modulation range. Device 1 can obtain power from carrier waves (CW) emitted by other devices. For example, it can transmit signals to other devices by reflecting carrier waves emitted by other devices. This method of sending signals to other devices by reflecting carrier waves can also be called backscatter. The device that transmits (or provides) the carrier wave can also be called a CW device or a CW node.

[0082] Device 2a and device 2b can be understood as type 2 tags or type 2 AIoT devices.

[0083] In this context, device 2a is a tag that needs to transmit signals via backscattering. Device 2b is a tag that can generate signals internally (actively transmit signals), meaning that device 2b does not need to transmit signals via carrier reflection.

[0084] Device C, also known as AIoT device C, is a tag that can generate signals internally (actively send signals), meaning that device C does not need to send signals by reflecting a carrier wave.

[0085] Compared to devices 1, 2a, and 2b, device c can be understood as a wide-area coverage type label, meaning that device c has a larger uplink coverage area. Devices 1, 2a, and 2b, on the other hand, can be understood as local-area coverage type labels, meaning that their uplink coverage area is smaller.

[0086] It should be understood that "larger uplink coverage" can be interpreted as an uplink coverage area greater than or equal to a certain threshold, and "smaller uplink coverage" can be interpreted as an uplink coverage area less than a certain threshold; or, "larger uplink coverage" and "smaller uplink coverage" are relative terms, meaning that the uplink coverage area of ​​device c is greater than that of device 1, device 2a, and device 2b. This application does not impose specific limitations in this regard.

[0087] The Internet of Things (IoT) is a crucial component of future information technology development. Its main technological characteristic is connecting objects to networks via communication technologies, thereby achieving intelligent networks that enable human-machine and machine-to-machine interconnection. For example, the first communication device in this application embodiment can also be a wearable device. Wearable devices, also known as wearable smart devices, are a general term for devices that utilize wearable technology to intelligently design and develop everyday wearables, such as glasses, gloves, watches, clothing, and shoes. Wearable devices are portable devices that can be worn directly on the body or integrated into a user's clothing or accessories. Wearable devices are not merely hardware devices; they can also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly defined, wearable smart devices include those with comprehensive functions, large sizes, and the ability to achieve complete or partial functions without relying on a smartphone, such as smartwatches or smart glasses, as well as those focused on a specific application function that require the use of other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0088] By way of example and not limitation, in the embodiments of this application, the first communication device can also be a terminal in machine-type communication (MTC). Furthermore, the first communication device can also be an on-board module, on-board component, on-board chip, or on-board unit built into a vehicle as one or more components or units. The vehicle can implement the methods provided in this application through the built-in on-board module, on-board component, on-board chip, or on-board unit. Therefore, the embodiments of this application can also be applied to vehicle-to-everything (V2X) networks, such as vehicle-to-everything (V2X), long-term evolution-vehicle (LTE-V) technology, and vehicle-to-vehicle (V2V) technology.

[0089] Optionally, the aforementioned second communication device can be referred to as an access network device or a radio access network (RAN) device. The RAN device can provide wireless communication services and allow terminals to access the wireless network. The RAN device can be a node in the RAN, or simply a RAN node.

[0090] In one possible scenario, a RAN node can be a base station (BS), an evolved NodeB (eNodeB), a transmission reception point (TRP), a home evolved NodeB (or home Node B, HNB), a Wi-Fi access point (AP), a mobile switching center, a next-generation NodeB (gNB) in a 5G mobile communication system, a next-generation base station in a future mobile communication system, or a base station in a future mobile communication system. A RAN node can also be a device that performs base station functions in device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, machine-to-machine (M2M) communication systems, and internet-to-things (IoT) communication systems. A RAN node can also be a RAN node in a non-terrestrial network (NTN), meaning that a RAN node can be deployed on a high-altitude platform or a satellite. RAN nodes can be macro base stations, micro base stations, indoor stations, relay nodes, donor nodes, etc., or radio controllers in cloud radio access network (CRAN) scenarios, or nodes in open radio access network (O-RAN or ORAN) scenarios. Optionally, RAN nodes can also be servers, wearable devices, vehicles, or in-vehicle equipment. For example, in V2X technology, RAN nodes can be roadside units (RSUs). Of course, RAN nodes can also be nodes in the core network.

[0091] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, with each RAN node performing a portion of the base station's functions. For example, RAN nodes can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. CUs and DUs can be separate entities or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0092] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in the ORAN system, CU can also be called open CU (O-CU), DU can also be called open DU (O-DU), CU-CP can also be called open CU-CP (O-CU-CP), CU-UP can also be called open CU-UP (O-CU-UP), and RU can also be called open RU (O-RU).

[0093] Any one of the CU (or CU-CP, CU-UP), DU, and RU units can be implemented through software modules, hardware modules, or a combination of software and hardware modules. That is, the wireless access network device in this application can be a virtualized device, for example, implemented through general-purpose hardware and instantiated virtualization functions, or dedicated hardware and instantiated virtualization functions. The general-purpose hardware can be a server, such as a cloud server.

[0094] Optionally, the second communication device can also be a reader in an ambient internet of things (AIoT) system, which can have communication and identification capabilities, data processing and forwarding, adaptability and compatibility, low power consumption and high efficiency, security and reliability, and ease of deployment and maintenance. This application does not limit this.

[0095] To facilitate a clear description of the technical solutions in the embodiments of this application, some terms and technologies involved in the embodiments of this application will be briefly introduced below:

[0096] 1. Time Division Multiple Access (TDMA)

[0097] A communication technology divides the entire time of a channel into several time-domain units, and allocates these units according to a time-domain unit allocation principle, allowing different users to occupy different time-domain units to transmit signals. In this way, multiple users can communicate using the same frequency in different time-domain units, thus avoiding mutual interference.

[0098] 2. Frequency Division Multiple Access (FDMA)

[0099] A communication technology that achieves multiple access communication by allocating different carrier frequencies to different users. In an FDMA system, the entire frequency band is divided into multiple sub-bands (or channels), and each user is assigned to a specific sub-band for communication. Because each user uses a different frequency, their signals do not interfere with each other. To avoid interference between adjacent carriers, a narrow guard band is maintained between each carrier band.

[0100] 3. Competitive Access Mechanism

[0101] Contention access is a method used in wireless communication to resolve conflicts when multiple users or devices simultaneously attempt to access the same resource (such as a channel or network).

[0102] For example, in an AIoT system where the first communication device is an ambient internet of things (AIoT) device, such as a tag device, and the second communication device is a reader, the following two competing access schemes can be supported.

[0103] Option 1 includes the following 3 steps:

[0104] Step 11: The device sends Msg1 to the reader. Msg1 is used to request network access and carries a random number (random ID) generated by the device. Correspondingly, the reader receives Msg1.

[0105] Step 12: The reader sends Msg2 to the device as a response to the received Msg1, where Msg2 may contain the random ID carried in the received Msg1.

[0106] It should be understood that when the device receives Msg2 containing its own random ID, the device considers the race to be resolved successfully and proceeds to step 13.

[0107] Step 13: The device sends upper-layer data to the reader. For example, the device identity (device ID).

[0108] Option 2 includes the following two steps:

[0109] Step 21: The device sends Msg1 to the reader. Msg1 is used to request network access and carries upper-layer data.

[0110] Upper-layer data can be understood as the data that the device needs to send to the reader after successfully connecting to the network, such as the device ID.

[0111] Step 22: The reader sends Msg2 to the device as a response to the received Msg1, where Msg2 may contain the device ID carried in the received Msg1.

[0112] It should be understood that if the device receives Msg2 containing its own device ID, the device considers the contention to be resolved successfully, meaning that the reader has successfully received the upper-layer data from the device.

[0113] In one possible implementation, whether it is scheme 1 or scheme 2 above, the reader can reply with a Msg2 as a response for each received Msg1.

[0114] For example, in a 5G NR system where the first communication device is a user equipment (UE) and the second communication device is a gNB, the following contention access scheme 3 can be supported.

[0115] Option 3 includes the following four steps:

[0116] Step 31: The UE sends Msg1 to the gNB. Msg1 is used to request network access and carries a preamble.

[0117] Step 32: The gNB sends Msg2 to the UE, which contains a random access response (RAR) for each received Msg1. Each RAR contains a preamble index corresponding to the preamble.

[0118] Step 33: If the Msg2 received by the UE contains the preamble index it sent, the UE sends Msg3 to the gNB. Msg3 may contain upper-layer messages, such as Radio Resource Control Setup Request (RRCSetupRequest).

[0119] Step 34: gNB sends Msg4 to UE, where Msg4 may contain part of Msg3 for contention resolution.

[0120] In Scheme 3 above, the gNB can reply with only one Msg2 for Msg1 received from multiple UEs, and this one Msg2 contains the random access response (RAR) for Msg1 from multiple UEs.

[0121] In some implementations, on the link direction where the reader sends data to the device (which can be called the downlink or R2D link, etc.), the data channels sent by the reader to different devices are multiplexed together in the form of TDMA; on the link direction where the device sends data to the reader (which can be called the uplink or D2R link), the data channels sent by different devices to the reader are multiplexed together in the form of TDMA and / or FDMA.

[0122] If Scheme 1 or Scheme 2 is adopted, that is, the reader replies with a Msg2 for each Msg1 as a response, as shown in Figure 2, for example, the data channels sent by different devices to the reader on the uplink in Figure 2 are multiplexed together in the manner of TDMA and FDMA.

[0123] As shown in Figure 2, each Msg1 resource corresponds to a separate Msg2 resource specifically for carrying the RAR corresponding to that Msg1. The dashed arrows in the figure indicate this correspondence. In this case, the device can receive only the Msg2 corresponding to its own Msg1 without needing to receive other Msg2 resources. However, the reader needs to reserve the corresponding Msg2 resource for each Msg1, even if the reader does not receive any Msg1 on a particular Msg1 resource. For example, in the Msg1 resource set 201 in Figure 2, even if no device uses this resource to send Msg1, the reader still needs to reserve the corresponding Msg2 resource for resource 201, such as 202 in the Msg2 resource set in Figure 2. This approach wastes Msg2 transmission resources.

[0124] If the logic of the above scheme 3 is applied to the link direction of the reader sending data to the device, the reader can send only one Msg2 for Msg1 from multiple devices. This Msg2 carries the RAR corresponding to all Msg1, as shown in Figure 3. For example, in Figure 3, the data channels sent by different devices to the reader on the uplink are multiplexed together in the manner of TDMA and FDMA.

[0125] As shown in Figure 3, Msg2 only needs to carry the RAR corresponding to the actually received Msg1, without reserving corresponding Msg2 transmission resources for all Msg1 candidate positions. For example, if no device uses Msg1 resource 301 to send Msg1, correspondingly, the Msg2 sent by the reader does not reserve resources for 301. The dashed arrows in the figure are only to highlight that no resources are reserved for 301 in Msg2, and do not indicate the correspondence between Msg1 resources and Msg2 resources.

[0126] As shown in Figure 3, the device needs to receive the entire Msg2 and then search it for the RAR corresponding to its own Msg1. This may require the device to receive RARs from other devices, potentially causing additional energy consumption and affecting its subsequent behavior. For example, the extra energy consumption may deplete the device's energy storage more easily, preventing further data transmission.

[0127] It is evident that the Reader has certain limitations, whether it replies with a Msg2 for each Msg1 or replies with only one Msg2 for all Msg1s.

[0128] In view of this, embodiments of this application provide a communication method, a communication device, a chip system, a storage medium, and a program product. By redesigning the aforementioned time and frequency resources, resource utilization can be improved and resource waste can be reduced. On the other hand, it is beneficial to reduce the redundant information that the first communication device needs to receive and to save the energy consumption of the first communication device.

[0129] It should be understood that the communication system and the corresponding devices in the above description of the random access mechanism are merely exemplary and do not constitute a limitation on the scope of this application.

[0130] The communication method provided in the embodiments of this application will be described in detail below with reference to the accompanying drawings. The embodiments shown in this application illustrate the communication method provided in this application from the perspective of device interaction. The specific form and number of the devices shown are merely examples and should not constitute any limitation on the implementation of the method provided in this application.

[0131] Figure 4 is a schematic flowchart of a communication method 400 provided in an embodiment of this application. This communication method 400 can be applied to the communication system 100 shown in Figure 1.

[0132] The first communication device involved in the embodiments of this application can be a UE in a wireless communication system such as a 5G network described above, or a device in an environmental Internet of Things system. This application does not make specific limitations in this regard. The first communication device can be the first communication device itself, or a chip, chip system, or processor that supports the first communication device in implementing a signal transmission method, or a logic module or software that can implement all or part of the functions of the first communication device. The second communication device can be a network device in a wireless communication system such as a 5G network described above, or a reader in an environmental Internet of Things system. This application does not make specific limitations in this regard. The second communication device can be the device itself, or a chip, chip system, or processor that supports the second communication device in implementing a signal reception method, or a logic module or software that can implement all or part of the functions of the second communication device. This application does not make specific limitations in this regard.

[0133] The method 400 includes:

[0134] S401, the first communication device sends a first message to the second communication device on a first resource set, the first resource set including M first time-frequency resources, the first time-frequency resources are used to send the first message, the first message is used to request access; correspondingly, the second communication device receives the X first messages on the first resource set.

[0135] S402, the second communication device sends Y second messages to the first communication device on a second resource set. The second resource set includes N second time-frequency resources, which are used to send the second messages. The second messages include responses to the first messages. Each of the N second time-frequency resources is associated with K first time-frequency resources. Each of the N second time-frequency resources is used to send all or part of the response to the first message from the K first time-frequency resources, where 1 < K < X. Correspondingly, the first communication device receives the second message on one or more second time-frequency resources, which are associated with the first time-frequency resources used to send the first message.

[0136] It should be understood that the communication system 100 may include a plurality of first communication devices, all and part of which may send first messages to second communication devices respectively.

[0137] In one implementation, the first message can be called an access request, a random access request, or Msg1, or any message name used to describe the request for access. The second message can be called an access response, a random access response, or Msg2, or any name that includes the meaning of responding to the first message. This application does not limit the specific names of the first message and the second message.

[0138] It should be understood that each of the M first time-frequency resources included in the first resource set can correspond to a time-frequency resource block formed by a time-domain unit and a frequency-domain unit. Optionally, a time-domain unit can be, for example, a unit obtained by dividing the time domain under a time slot, a symbol, or other arbitrary rules; a frequency-domain unit can be a unit obtained by dividing the frequency domain under a subcarrier, a resource element (RE), a resource block (RB), or other arbitrary rules. This application does not specifically limit the size of the time-domain unit, the frequency-domain unit, or the first time-frequency resource.

[0139] It should also be understood that the meaning of the second time-frequency resource can be similar to that of the first time-frequency resource, and the size of the second time-frequency resource can be the same as or different from that of the first time-frequency resource. This application does not make any specific limitations in this regard.

[0140] Optionally, the first resource set and / or the second resource set may also be a set of code domain resources. The M resources included in the first resource set may be code domain resources, and the N resources included in the second resource set may also be code domain resources. This application does not specifically limit the resource types of the first resource set and the second resource set.

[0141] In some implementations, the first communication device can use a first time-frequency resource in a first resource set to send its own first message, and the second communication device can use a second time-frequency resource in a second resource set to send a second message.

[0142] In this embodiment, each of the N second time-frequency resources included in the second resource set is associated with K first time-frequency resources. This means that each second time-frequency resource can be used to send all or part of the response to the first message from the K first time-frequency resources associated with it, where 1 < K < M. This approach, compared to the second communication device only being able to use a certain second time-frequency resource to send the first message received on its corresponding first time-frequency resource (or, as described in Figure 2 above, where the second time-frequency resource can be understood as Msg2 resource and the first time-frequency resource as Msg1 resource), allows each second time-frequency resource to be associated with K first time-frequency resources. Thus, even if no first message is received on a certain first time-frequency resource associated with the second time-frequency resource, that second time-frequency resource can still be used to send responses from other associated first time-frequency resources. The response to the first message received from the source reduces the possibility of the first time-frequency resource being idle, which is beneficial to improving the utilization rate of the second time-frequency resource and reducing resource waste. On the other hand, in the method provided by the embodiments of this application, the second communication device can use the second time-frequency resource to send all or part of the response to the first message from the K first time-frequency resources associated with it. Compared with the case where the second communication device uses a second message (one second message is carried on one second time-frequency resource) to respond to all the first messages received on M first time-frequency resources (for example, as described in Figure 3 above, the device (equivalent to the first communication device) needs to receive responses for all devices), the first communication device can only receive the second message on the second time-frequency resource corresponding to the first time-frequency resource it uses. Since the second message may not contain responses to all the first messages, it is beneficial to reduce the redundant information that the first communication device needs to receive and to save the energy consumption of the first communication device.

[0143] It should be understood that a first time-frequency resource can be used to send a first message, and a second time-frequency resource can be used to send a second message. In this embodiment, each second time-frequency resource is associated with K first time-frequency resources. It can be understood that each second time-frequency resource is qualified to carry the response of the first message from these K first time-frequency resources. However, whether the second communication device sends the response of the first message from these K first time-frequency resources on each second time-frequency resource can be determined by its specific implementation. This application does not limit the number of responses of the first message carried by each second time-frequency resource.

[0144] As an optional embodiment, each second message includes a response to P first messages, where P is agreed upon by the protocol or determined by the network side, and P≤K.

[0145] In this embodiment, the network side can be understood as a second communication device, meaning the second communication device can determine the number of responses to the first message included in the second message based on protocol agreements or its own specific implementation. Thus, the responses to the first message carried by the second time-frequency resource are not fixed, which facilitates flexible configuration of the second time-frequency resource and improves resource utilization.

[0146] As an optional embodiment, M first time-frequency resources are arranged in a first order, with the M first time-frequency resources connected end to end in the first order, and N second time-frequency resources are arranged in a second order. The association method between the nth second time-frequency resource among the N second time-frequency resources and the K first time-frequency resources among the N first time-frequency resources includes the following two methods.

[0147] Method 1: The K first time-frequency resources associated with the nth second time-frequency resource among N second time-frequency resources include: the xth first time-frequency resource among M first time-frequency resources, and K-1 first time-frequency resources obtained sequentially in a preset direction starting from the xth first time-frequency resource. x is agreed upon by the protocol or determined by the network side, and x is related to n.

[0148] Optionally, the relationship between x and n can be x = n, x = n * K, or x = n * [M / N], but this application does not specifically limit this.

[0149] Taking M=8, N=4, K=3 as an example, the first method is illustrated. The M first time-frequency resources are numbered 0, 1, 2, 3, 4, 5, 6, 7 in the first order. After the first time-frequency resource numbered 7, the cycle continues starting from the first time-frequency resource numbered 0. The N second time-frequency resources are numbered 0, 1, 2, 3 in the second order, n=0, 1, 2, 3.

[0150] In the first implementation, taking x = n * K = 3 * n as an example, the 0th second time-frequency resource among the 4 second time-frequency resources (that is, the second time-frequency resource numbered 0 obtained by arranging according to the second order) is associated with 3 first time-frequency resources, including the 0th first time-frequency resource among the 8 first time-frequency resources (that is, the first time-frequency resource numbered 0 obtained by arranging according to the first order), and 2 first time-frequency resources obtained sequentially after the 0th first time-frequency resource in a preset direction. If the preset direction is a direction in which the numbers gradually increase, these 2 first time-frequency resources are the 1st and 2nd first time-frequency resources after the 8 first time-frequency resources are arranged according to the first order. That is, the 0th second time-frequency resource is associated with the first time-frequency resources numbered 0, 1, and 2. The 1st second time-frequency resource among the 4 second time-frequency resources is associated with 3 first time-frequency resources, including the 3rd (x = 3 * n = 3 * 1 = 3) among the 8 first time-frequency resources. The first time-frequency resource, and the two first time-frequency resources obtained sequentially after the third first time-frequency resource in a preset direction starting from the third first time-frequency resource, if the preset direction is a direction with gradually increasing numbers, these two first time-frequency resources are the fourth and fifth of the eight first time-frequency resources arranged in the first order, that is, the first second time-frequency resource is associated with the first time-frequency resources numbered 3, 4, and 5; similarly, the second second time-frequency resource among the four second time-frequency resources is associated with the sixth, seventh, and eighth first time-frequency resources arranged in the first order. Since the eight first time-frequency resources in the first order are connected end to end, and the number of the eighth first time-frequency resource is 0, the second second time-frequency resource among the four second time-frequency resources is associated with the first time-frequency resources numbered 6, 7, and 0; furthermore, similarly, the third second time-frequency resource among the four second time-frequency resources is associated with the first time-frequency resources numbered 1, 2, and 3, and the principle will not be elaborated further.

[0151] It should be understood that in the embodiments of this application, "*" is used to represent the multiplication operator, for example, A*B means A multiplied by B; "mod" is used to represent the remainder operation, the result of A mod B is equal to the remainder obtained by dividing A by B; [] is the integer operator, for example, "[a]" means the largest integer not exceeding the number a, that is, the integer part of a, which will not be explained again later.

[0152] In the second implementation, taking x = n * [M / N] = n * [8 / 4)] = n * 2 as an example, the 0th second time-frequency resource among the 4 second time-frequency resources (that is, the second time-frequency resource numbered 0 obtained by arranging according to the second order) is associated with 3 first time-frequency resources, including the 0th first time-frequency resource among the 8 first time-frequency resources (that is, the first time-frequency resource numbered 0 obtained by arranging according to the first order), and 2 first time-frequency resources obtained sequentially after the 0th first time-frequency resource in a preset direction starting from the 0th first time-frequency resource. If the preset direction is a direction in which the numbers gradually increase, these 2 first time-frequency resources are the 1st and 2nd of the 8 first time-frequency resources after arranging according to the first order, that is, the 0th second time-frequency resource is associated with the first time-frequency resources numbered 0, 1, and 2; the 1st second time-frequency resource among the 4 second time-frequency resources is associated with 3 first time-frequency resources, including the 8 first time-frequency resources. The second (x = 2 * n = 2) first time-frequency resource, and the two first time-frequency resources obtained sequentially after the second first time-frequency resource in the preset direction starting from the second first time-frequency resource, if the preset direction is the direction of gradually increasing number, these two first time-frequency resources are the third and fourth of the eight first time-frequency resources arranged in the first order, that is, the first second time-frequency resource is associated with the first time-frequency resources numbered 2, 3, and 4; similarly, the second second time-frequency resource among the four second time-frequency resources is associated with the first time-frequency resources numbered 4, 5, and 6, and the third second time-frequency resource among the four second time-frequency resources is associated with the sixth, seventh, and eighth first time-frequency resources arranged in the first order. Since the eight first time-frequency resources in the first order are connected end to end, and the number of the eighth first time-frequency resource is 0, the third second time-frequency resource among the four second time-frequency resources is associated with the first time-frequency resources numbered 6, 7, and 0.

[0153] Optionally, the position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between it and x, K and M, satisfy: m = (x + k) mod M, where k = 0, 1, 2...K-1, but this application does not specifically limit this.

[0154] It should be understood that for a given x, all possible values ​​of m should include the calculation results when k takes the values ​​0, 1, 2...K-1.

[0155] Method 2: The K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained from the xth first time-frequency resource in a preset direction. Each pair of adjacent first time-frequency resources in the K first time-frequency resources is spaced y first time-frequency resources apart, where y is agreed upon by the protocol or determined by the network side.

[0156] Taking M=8, N=4, K=3, and y=2 as an example, we will illustrate method two.

[0157] In some implementations, taking x=n as an example, the 0th (x=n=0) second time-frequency resource among the four second time-frequency resources (i.e., the second time-frequency resource numbered 0 according to the second order) is associated with three first time-frequency resources, including the 0th first time-frequency resource among the eight first time-frequency resources (i.e., the first time-frequency resource numbered 0 according to the first order) and two first time-frequency resources obtained from the 0th first time-frequency resource in a preset direction. Each pair of adjacent first time-frequency resources associated with this second time-frequency resource is spaced two first time-frequency resources apart. If the preset direction is a direction where the numbers gradually increase, then the 0th second time-frequency resource among the four second time-frequency resources is associated with the 0th, 3rd, and 6th first time-frequency resources after the first order of the eight first time-frequency resources. That is, the 0th second time-frequency resource is associated with the 0th, 3rd, and 6th first time-frequency resources. The first time-frequency resource is associated with the first of the four second time-frequency resources. Similarly, the first second time-frequency resource is associated with the first three first time-frequency resources, including the 1st (x=n=1), 4th, and 7th first time-frequency resources out of the eight first time-frequency resources. That is, the 0th second time-frequency resource is associated with the first time-frequency resources numbered 1, 4, and 7. The second second time-frequency resource is associated with the second (x=n=1), 5th, and 8th first time-frequency resources out of the four second time-frequency resources. Since the eight first time-frequency resources in the first sequence are connected end-to-end, the 8th first time-frequency resource is numbered 0. That is, two second time-frequency resources are associated with the first time-frequency resources numbered 2, 5, and 0. Similarly, three of the four second time-frequency resources are associated with the first time-frequency resources numbered 3, 6, and 1. The principle will not be elaborated further.

[0158] Optionally, y can be a value related to K and / or K, such as y = K, or y is a value that is coprime to M but does not exceed K, but this application does not specifically limit it.

[0159] Optionally, the position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between it and x, y and M, also satisfy: m = (x + k * y) mod M, where k = 0, 1, 2…K-1.

[0160] It should be understood that for a given x, all possible values ​​of m should include the calculation results when k takes the values ​​0, 1, 2...K-1.

[0161] The association results obtained from Method 1 and Method 2 show that the same first time-frequency resource may be associated with multiple second time-frequency resources. In this case, for a first communication device that uses the first time-frequency resource to send a first message, if the first communication device has already received the response of its own first message on the second time-frequency resource that is the earliest in the time domain among the multiple second time-frequency resources, it does not need to receive messages on other subsequent second time-frequency resources among these multiple second time-frequency resources. This is beneficial to saving the energy consumption of the first communication device.

[0162] As an optional embodiment, the first order includes: M first time-frequency resources arranged in order of frequency domain from low to high and time domain from front to back.

[0163] Taking the first resource set shown in Figure 5 as an example, the first order will be explained. For example, M=8, that is, the first resource set includes 8 first time-frequency resources, and these 8 first time-frequency resources have TDMA and FDMA. As shown in Figure 5, each cell in the figure is used to represent a first time-frequency resource, and each first time-frequency resource corresponds to a frequency domain unit in the frequency domain and a time domain unit in the time domain.

[0164] The M first time-frequency resources are arranged first in the frequency domain from low to high, and then in the time domain from front to back. This can be understood as starting from the first time-domain unit, sorting the first time-frequency resources corresponding to that time-domain unit in ascending order of frequency domain. Then, starting from that time-domain unit, the first time-frequency resources corresponding to the next time-domain unit are sorted in ascending order of frequency domain, until the first time-frequency resources corresponding to the last time-domain unit are sorted in ascending order of frequency domain.

[0165] As shown in Figure 5, the first time-domain unit in the first resource set is 501. Therefore, the first time-frequency resources corresponding to 501 are numbered in ascending order in the frequency domain, such as the first time-frequency resources numbered 0 and 1 shown in Figure 5. Then, starting from 501, the first time-frequency resources corresponding to the next time-domain unit 502 are numbered in ascending order in the frequency domain, such as the first time-frequency resources numbered 2 and 3 shown in Figure 5. Then, the first time-frequency resources corresponding to the next time-domain unit 503 are numbered in ascending order in the frequency domain, such as the first time-frequency resources numbered 4 and 5 shown in Figure 5. Then, the first time-frequency resources corresponding to the last time-domain unit 504 in the first resource set are numbered in ascending order in the frequency domain, such as the first time-frequency resources numbered 6 and 7 shown in Figure 5.

[0166] Each number can represent the location of the first time-frequency resource corresponding to that number. The first order is the order in which the first time-frequency resources are arranged according to the numbers 0, 1, 2, 3, 4, 5, 6, 7.

[0167] Optionally, the first order can also be the order obtained by arranging the M first time-frequency resources from low to high in the frequency domain first, and from back to front in the time domain. This sorting method will be illustrated with Figure 6. For example, Figure 6 still uses M=8, that is, the first resource set includes 8 first time-frequency resources, and these 8 first time-frequency resources include both TDMA and FDMA.

[0168] The M first time-frequency resources are arranged first in the frequency domain from low to high, and then in the time domain from back to front. This can be understood as starting from the last time-domain unit in the first resource set, sorting the first time-frequency resources corresponding to that time-domain unit in the frequency domain from low to high, and then continuing to sort the first time-frequency resources corresponding to the next time-domain unit in the frequency domain from low to high, until the first time-frequency resources corresponding to the first time-domain unit are sorted in the frequency domain from low to high, and then the process ends.

[0169] As shown in Figure 6, the last time-domain unit in the first resource set is 604. Therefore, the first time-frequency resources corresponding to 604 are first numbered in ascending order of frequency domain, such as the first time-frequency resources numbered 0 and 1 shown in Figure 6. Then, starting from 604, the first time-frequency resources corresponding to the next time-domain unit 603 are numbered in ascending order of frequency domain, such as the first time-frequency resources numbered 2 and 3 shown in Figure 6. Then, the first time-frequency resources corresponding to the next time-domain unit 602 of 603 are numbered in ascending order of frequency domain, such as the first time-frequency resources numbered 4 and 5 shown in Figure 6. Then, the first time-frequency resources corresponding to the first time-domain unit 601 in the first resource set are numbered in ascending order of frequency domain, such as the first time-frequency resources numbered 6 and 7 shown in Figure 6.

[0170] Each number can represent the location of the first time-frequency resource corresponding to that number. The first order is the order in which the first time-frequency resources are arranged according to the numbers 0, 1, 2, 3, 4, 5, 6, 7.

[0171] Optionally, the first order can also be the order obtained by arranging the M first time-frequency resources from front to back in the time domain and then from low to high in the frequency domain. This sorting method will be illustrated with Figure 7. For example, Figure 7 still uses M=8, that is, the first resource set includes 8 first time-frequency resources, and these 8 first time-frequency resources include both TDMA and FDMA.

[0172] The M first time-frequency resources are arranged first from front to back in the time domain and then from low to high in the frequency domain. This can be understood as starting from the lowest frequency unit in the first resource set, sorting the first time-frequency resources corresponding to that unit in the time domain in front-to-back order, and then continuing to sort the first time-frequency resources corresponding to the next frequency unit in the direction of increasing frequency in the time domain in front-to-back order, until the first time-frequency resources corresponding to the highest frequency unit in the first resource set are sorted in front-to-back order in the time domain.

[0173] As shown in Figure 7, the lowest frequency unit in the first resource set is 701. Therefore, the first time-frequency resources corresponding to 701 are numbered in the order from front to back in the time domain, such as the first time-frequency resources numbered 0, 1, 2, and 3 shown in Figure 7. Then, starting from frequency unit 701, the first time-frequency resources corresponding to the next frequency unit 702 are arranged in the order from front to back in the time domain, such as the first time-frequency resources numbered 4, 5, 6, and 7 shown in Figure 7.

[0174] Each number can represent the location of the first time-frequency resource corresponding to that number. The first order is the order in which the first time-frequency resources are arranged according to the numbers 0, 1, 2, 3, 4, 5, 6, 7.

[0175] Optionally, the first order can also be the order obtained by arranging the M first time-frequency resources from front to back in the time domain and then from high to low in the frequency domain. This sorting method will be illustrated with Figure 8. For example, Figure 8 still uses M=8, that is, the first resource set includes 8 first time-frequency resources, and these 8 first time-frequency resources include both TDMA and FDMA.

[0176] The M first time-frequency resources are arranged first from front to back in the time domain and then from high to low in the frequency domain. This can be understood as starting from the frequency domain unit with the highest frequency in the first resource set, sorting the first time-frequency resources corresponding to that frequency domain unit in the time domain in the order from front to back, and then starting from that frequency domain unit and moving in the direction of decreasing frequency, continuing to sort the first time-frequency resources corresponding to the next frequency domain unit in the time domain in the order from front to back, until the first time-frequency resources corresponding to the frequency domain unit with the lowest frequency in the first resource set are sorted in the order from front to back in the time domain.

[0177] As shown in Figure 8, the frequency domain unit with the highest frequency in the first resource set is 802. Therefore, the first time-frequency resources corresponding to 802 are first numbered in the order from front to back in the time domain, such as the first time-frequency resources numbered 0, 1, 2, and 3 shown in Figure 8. Then, starting from the frequency domain unit 802, the first time-frequency resources corresponding to the next frequency domain unit 801 are arranged in the order from front to back in the time domain, such as the first time-frequency resources numbered 4, 5, 6, and 7 shown in Figure 8.

[0178] Each number can represent the location of the first time-frequency resource corresponding to that number. The first order is the order in which the first time-frequency resources are arranged according to the numbers 0, 1, 2, 3, 4, 5, 6, 7.

[0179] Optionally, the first order can also be the order obtained by arranging the M first time-frequency resources from back to front in the time domain and from high to low in the frequency domain, or the order obtained by arranging the M first time-frequency resources from back to front in the time domain and from low to high in the frequency domain, or the order obtained by arranging the M first time-frequency resources from high to low in the frequency domain and from back to front in the time domain, or the order obtained by arranging the M first time-frequency resources from high to low in the frequency domain and from front to back in the time domain. The specific implementation can be referred to the logic described in Figures 5 to 8, which will not be elaborated further for the sake of brevity.

[0180] Of course, the first order can also be the order obtained by sorting the first time-frequency resources in the first resource set under any other rule. This application does not limit the specific sorting rule of the first order.

[0181] As an optional embodiment, the first order includes: a third order obtained by arranging M first time-frequency resources in a first frequency domain from low to high and then in a second time domain from front to back, and an order obtained by performing row and column interleaving based on the third order.

[0182] The arrangement of the M first time-frequency resources in the frequency domain from low to high and then from front to back in the time domain is illustrated in Figure 5. This is referred to as the third order. The specific method will not be repeated here. In this embodiment, the first order can also be the order obtained by performing row and column interleaving processing on the basis of the third order.

[0183] Row-column interleaving can be understood as a method of rearranging data in a two-dimensional matrix. Specifically, it involves writing data into a row-column interleaver in a row- or column-by-column manner, and then reading it out from the interleaver in another manner (column- or row-by-column).

[0184] For example, the numbers 0, 1, 2, 3, 4, 5, 6, and 7 corresponding to the eight first time-frequency resources obtained in the third order are placed into a row-column interleaver with two rows and four columns to obtain the following Table 1.

[0185] The table contains the following information: Row 0: 0, 1, 2, 3; Row 1: 4, 5, 6, 7. Reading the table column-wise, for example, from column 0 to column 3, reading each column in the order of row 0 first, then row 1, yields: 0, 4, 1, 5, 2, 6, 3, 7. This order can be understood as a first order obtained by interleaving rows and columns based on a third order. In this first order, the 0th first time-frequency resource is numbered 0, the 1st first time-frequency resource is numbered 4, the 2nd first time-frequency resource is numbered 1, the 3rd first time-frequency resource is numbered 5, the 4th first time-frequency resource is numbered 2, the 5th first time-frequency resource is numbered 6, the 6th first time-frequency resource is numbered 3, and the 7th first time-frequency resource is numbered 7. It should be understood that, under this order, the K first time-frequency resources associated with the second time-frequency resource can still be determined according to the above method one or method two. The determination method is similar, the difference being that the number corresponding to the sorting position of the first time-frequency resource may have changed.

[0186] For example, if the first time-frequency resources in the first sequence are arranged according to the numbers 0, 4, 1, 5, 2, 6, 3, 7, taking M=8, N=4, K=3 as an example, based on the method of associating the second time-frequency resources with K first time-frequency resources described in the first implementation of the above method, the 0th second time-frequency resource out of the 4 second time-frequency resources is associated with 3 first time-frequency resources, including the 0th, 1st, and 2nd first time-frequency resources out of these 8 first time-frequency resources. That is, the 0th second time-frequency resource out of the 4 second time-frequency resources is associated with the first time-frequency resources numbered 0, 4, and 1; similarly, the 1st second time-frequency resource out of the 4 second time-frequency resources is associated with 3 first time-frequency resources, including the 0th, 1st, and 2nd first time-frequency resources out of these 8 first time-frequency resources. The 3rd, 4th, and 5th first time-frequency resources, which are also the 1st second time-frequency resources, are associated with the first time-frequency resources numbered 5, 2, and 6. Similarly, the 2nd second time-frequency resource among the 4 second time-frequency resources is associated with the 6th, 7th, and 8th first time-frequency resources arranged in the first order. Since the 8 first time-frequency resources in the first order are connected end to end, and the 8th first time-frequency resource is numbered 0, the 2nd second time-frequency resource among the 4 second time-frequency resources is associated with the first time-frequency resources numbered 3, 7, and 0. Furthermore, similarly, the 3rd second time-frequency resource among the 4 second time-frequency resources is associated with the first time-frequency resources numbered 4, 1, and 5. The principle will not be elaborated further.

[0187] For example, the numbers 0, 1, 2, 3, 4, 5, 6, and 7 corresponding to the eight first time-frequency resources obtained in the third order can also be placed into a two-row, four-column interleaver to obtain the following Table 2.

[0188] Read the table by reading row 0 first, then row 1, and then reading each row sequentially from column 0 to column 3, resulting in: 0, 2, 4, 6, 1, 3, 5, 7.

[0189] It should be understood that during row-column interleaving, if data is read in row-wise and then read out column-wise, the default reading start is from column 0 when reading out column-wise. In some implementations, an offset of 1 can be set. This offset of 1 indicates the offset of the column being read from column 0. For example, for Table 1 above, if the offset of 1 is set to 1, then starting from column 1, the second column, the third column, and then the 0th column are read sequentially, with each column read in the order of reading row 0 first and then row 1. The read result is: 1, 5, 2, 6, 3, 7, 0, 4. Optionally, this implementation method can be called column cyclic permutation, which means that the reading order of column 0 is replaced by the order after column 3. This application does not specifically limit the value of the offset of 1 used to implement the permutation.

[0190] Similarly, when performing row-column interleaving, if the data is read in column-wise and then read out row-wise, the default reading start is from row 0 when reading out row-wise. In this case, an offset of 2 can also be set. This offset of 2 indicates the offset of the currently read row from row 0. For example, for Table 2 above, if the offset of 2 is set to 1, then starting from row 1, row 1 is read first, then row 0, and each row is read in the order from column 0 to column 3, resulting in 1, 3, 5, 7, 0, 1, 4, 6. Optionally, this implementation method can be called row cyclic permutation, which replaces the reading order of column 0 with that of column 1. This application does not specifically limit the value of the offset of 2 used to implement the permutation.

[0191] Optionally, when performing row-column interleaving, whether reading in by row and reading out by column, or reading in by column and reading out by row, it is also possible to start with any specified column or row and read out in any specified order. This application embodiment does not specifically limit the reading order during interleaving.

[0192] In one possible implementation, the second time-frequency resource may only involve time-division multiplexing. The second time-frequency resource may be numbered sequentially according to a second order from front to back in the time domain. That is, the second time-frequency resource numbered 0 may be the earliest second time-frequency resource in the time domain within the second resource set, and the second time-frequency resource numbered 3 may be the latest second time-frequency resource in the second resource set. Based on this, the aforementioned first order is obtained by arranging M first time-frequency resources first in the frequency domain from low to high and then in the time domain from front to back, followed by row-column interleaving. The method of associating the second time-frequency resource with K first time-frequency resources as described in the first implementation of the above method one is beneficial for associating the first time-frequency resource in the first resource set that is later in the time domain with the second video resource in the second resource set that is earlier in the time domain. For example, the 0th second time-frequency resource out of four can be associated with the first time-frequency resource numbered 4. Referring to Figure 5, the first time-frequency resource numbered 4 is later in the time domain within the first resource set.

[0193] In this way, on the one hand, when the first communication device sends the first message using the first time-frequency resource in the first resource set that is later in the time domain, it may receive its own response on the second time-frequency resource in the second resource set that is earlier in the time domain, which is beneficial to saving its energy consumption. On the other hand, for a communication device that sends the first message using the first time-frequency resource in the first resource set that is later in the time domain, when the number of second time-frequency resources in the second resource set is limited, this method is beneficial to the first communication device receiving its response on the second resource set, which is beneficial to reducing the energy consumption of the second communication device and reducing the packet loss rate of the second message.

[0194] Optionally, the first order can also be the order obtained by arranging the M first time-frequency resources from low to high in the frequency domain first, then from front to back in the time domain, and then performing row and column interleaving; or, it can also be the order obtained by arranging the M first time-frequency resources from low to high in the frequency domain first, then from back to front in the time domain, and then performing row and column interleaving; or, it can also be the order obtained by arranging the M first time-frequency resources from front to back in the time domain first, then from low to high in the frequency domain, and then performing row and column interleaving; or, it can also be the order obtained by arranging the M first time-frequency resources from front to back in the time domain first, then from high to low in the frequency domain, and then performing row and column interleaving; or, it can also be the order obtained by arranging the M first time-frequency resources from back to front in the time domain first. The order can be obtained by arranging the first time-frequency resources in the first resource set from high to low in the second frequency domain and then performing row-column interleaving; or, it can be obtained by arranging the M first time-frequency resources from back to front in the first time domain and from low to high in the second frequency domain and then performing row-column interleaving; or, it can be obtained by arranging the M first time-frequency resources from high to low in the first frequency domain and from back to front in the second time domain and then performing row-column interleaving; or, it can be obtained by sorting the first time-frequency resources in the first resource set under any other rule and then performing row-column interleaving. This application does not make any specific limitation on this.

[0195] It should be understood that after row-column interleaving, the position of the first time-frequency resource corresponding to each number in the first sequence remains unchanged; what changes is only the position of the time-frequency resource in the queue formed under the first sequence.

[0196] In one possible implementation, the M first time-frequency resources are arranged in a third order, first from low to high in the frequency domain and then from front to back in the time domain. Based on this third order, a row-column interleaving process is performed to obtain the following order: the first time-frequency resource numbered ww in the third order has a position f(w) = (r*C+c+n) in the first order. shift ) mod M, where w = c * R + r; R is the row number of the row-column interleaver used in the row-column interleaver processing; r represents the r-th row of the row-column interleaver for the first time-frequency resource numbered w in the third order, r = 0, 1, ..., R-1; C is the column number of the row-column interleaver used in the row-column interleaver processing; c represents the c-th column of the row-column interleaver for the first time-frequency resource numbered w in the third order, c = 0, 1, ..., C-1; C = [M / R], n shift This indicates the offset between the first row (or first column) read from the row-column interleaver and the 0th row (or 0th column).

[0197] Taking Table 2 above as an example, M=8, the number of rows R=2 and the number of columns C=4 of this row-column interleaver, and take n shift=0, then the first time-frequency resource in the 1st row (r=1) and 2nd column (c=2) has the position f(w) in the readout order as f(w) = (r*C+c+n) shift )mod M=(1*4+2+0)mod 8=6, the first time-frequency resource in the first row (r=1) and second column (c=2) is numbered in the original order as w=c*R+r=2*2+1=5.

[0198] The communication method of the embodiments of this application has been described in detail above with reference to Figures 4 to 8. The communication device of the embodiments of this application will be described in detail below with reference to Figures 9 and 10. The communication device includes modules or units for executing the corresponding parts of each of the above embodiments. Modules or units can be software, hardware, or a combination of software and hardware. The following is only a brief illustrative description of the communication device; for details of the implementation, please refer to the description of the foregoing method embodiments, which will not be repeated below.

[0199] Figure 9 is a schematic diagram of the structure of a communication device 400 provided in an embodiment of this application. As shown in Figure 4, the device 400 includes a processing module 901 and a transceiver module 902.

[0200] In one possible implementation, the communication device 900 is a second communication device, which is used to implement the steps corresponding to the second communication device in the above method embodiments.

[0201] The transceiver module 402 is configured to: receive X first messages on a first resource set, the first resource set including M first time-frequency resources, the first time-frequency resources being used to send the first messages, the first messages being used to request access; and send Y second messages on a second resource set, the second resource set including N second time-frequency resources, the second time-frequency resources being used to send the second messages, the second messages including responses to the first messages, each of the N second time-frequency resources being associated with K first time-frequency resources, each of the N second time-frequency resources being used to send all or part of the responses from the first messages on the K first time-frequency resources, 1 < K < M.

[0202] Optionally, the M first time-frequency resources are arranged in a first order, with the M first time-frequency resources connected end to end in the first order, and the N second time-frequency resources are arranged in a second order; the K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained sequentially in a preset direction starting from the xth first time-frequency resource, where x is agreed upon by the protocol or determined by the network side, and x is related to n.

[0203] Optionally, the position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between it and x, K, and M, satisfies: m = (x + k) mod M, where k = 0, 1, 2, ..., K-1.

[0204] Optionally, the M first time-frequency resources are arranged in a first order, with the M first time-frequency resources connected end to end, and the N second time-frequency resources are arranged in a second order; the K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained from the xth first time-frequency resource in a preset direction, and each pair of adjacent first time-frequency resources among the K first time-frequency resources is spaced y first time-frequency resources apart, where y is agreed upon by the protocol or determined by the network side.

[0205] Optionally, the position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between it and x, y and M, satisfy: m = (x + k * y) mod M, where k = 0, 1, 2…K-1.

[0206] Optionally, the first order includes: M first time-frequency resources arranged in order from low to high in the frequency domain first, and from front to back in the time domain.

[0207] Optionally, the first order includes: a third order obtained by arranging M first time-frequency resources in the frequency domain from low to high and then from front to back in the time domain, and an order obtained by performing row and column interleaving based on the third order.

[0208] Optionally, each second message includes a response to P first messages, where P is defined by the protocol or determined by the network side, and P≤K.

[0209] In another possible implementation, the communication device 900 is a first communication device, which is used to implement the steps corresponding to the first communication device in the above method embodiments.

[0210] The transceiver module 902 is configured to: send a first message on a first resource set, the first resource set including M first time-frequency resources, the first time-frequency resources being used to send the first message, the first message being used to request access; and receive a second message on a second resource set, the second resource set including N second time-frequency resources, the second time-frequency resources being used to send the second message, the second message including a response to the first message, each of the N second time-frequency resources being associated with K first time-frequency resources, each of the N second time-frequency resources being used to send all or part of the response to the first message from the K first time-frequency resources, 1 < K < M.

[0211] Optionally, the M first time-frequency resources are arranged in a first order, with the M first time-frequency resources connected end to end in the first order, and the N second time-frequency resources are arranged in a second order; the K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained sequentially in a preset direction starting from the xth first time-frequency resource, where x is agreed upon by the protocol or determined by the network side, and x is related to n.

[0212] Optionally, the position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between it and x, K, and M, satisfies: m = (x + k) mod M, where k = 0, 1, 2, ..., K-1.

[0213] Optionally, the M first time-frequency resources are arranged in a first order, with the M first time-frequency resources connected end to end, and the N second time-frequency resources are arranged in a second order; the K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained from the xth first time-frequency resource in a preset direction, and each pair of adjacent first time-frequency resources among the K first time-frequency resources is spaced y first time-frequency resources apart, where y is agreed upon by the protocol or determined by the network side.

[0214] Optionally, the position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between it and x, y and M, satisfy: m = (x + k * y) mod M, where k = 0, 1, 2…K-1.

[0215] Optionally, the first order includes: M first time-frequency resources arranged in order from low to high in the frequency domain first, and from front to back in the time domain.

[0216] Optionally, the first order includes: a third order obtained by arranging M first time-frequency resources in the frequency domain from low to high and then from front to back in the time domain, and an order obtained by performing row and column interleaving based on the third order.

[0217] Optionally, each second message includes a response to P first messages, where P is defined by the protocol, configured on the network side, or determined according to the network side configuration, and P≤K.

[0218] It should be understood that the device 900 here is embodied in the form of a functional module. The term "module" here can refer to application-specific integrated circuits (ASICs), electronic circuits, processors (e.g., shared processors, proprietary processors, or group processors, etc.) and memories for executing one or more software or firmware programs, integrated logic circuits, and / or other suitable components supporting the described functions. In an alternative example, those skilled in the art will understand that the device 900 can specifically be the terminal device in the above embodiments. The device 900 can be used to execute the various processes and / or steps corresponding to the terminal device or network device in the above method embodiments; to avoid repetition, these will not be described again here.

[0219] The aforementioned device 900 has the function of implementing the corresponding steps performed by the terminal device in the aforementioned method; the aforementioned function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the aforementioned function.

[0220] In embodiments of this application, the device 900 in FIG9 can also be a chip, such as a System-on-a-Chip (SoC). Correspondingly, the transceiver module 902 can be the transceiver circuit of the chip, which is not limited here.

[0221] Figure 10 is a schematic diagram of the structure of a communication device 1000 provided in an embodiment of this application. The device 1000 includes a processor 1001, a transceiver 1002, and a memory 1003. The processor 1001, transceiver 1002, and memory 1003 communicate with each other through an internal connection path. The memory 1003 is used to store instructions, and the processor 1001 is used to execute the instructions stored in the memory 1003 to control the transceiver 1002 to send and / or receive signals.

[0222] It should be understood that the device 1000 may specifically be the terminal device in the above embodiments, and may be used to execute the various steps and / or processes corresponding to the terminal device in the above method embodiments. Optionally, the memory 1003 may include read-only memory and random access memory, and provide instructions and data to the processor. A portion of the memory may also include non-volatile random access memory. For example, the memory may also store device type information. The processor 1001 may be used to execute instructions stored in the memory, and when the processor 1001 executes instructions stored in the memory, the processor 1001 is used to execute the various steps and / or processes of the above method embodiments. The transceiver 1002 may include a transmitter and a receiver, the transmitter may be used to implement the various steps and / or processes corresponding to the transceiver for performing a transmitting action, and the receiver may be used to implement the various steps and / or processes corresponding to the transceiver for performing a receiving action.

[0223] It should be understood that, in the embodiments of this application, the processor may be a central processing unit (CPU), or it may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.

[0224] In implementation, each step of the above method can be completed by integrated logic circuits in the processor's hardware or by instructions in software. The steps of the method disclosed in the embodiments of this application can be directly manifested as execution by a hardware processor, or as a combination of hardware and software modules within the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor executes the instructions in the memory, combining them with its hardware to complete the steps of the above method. To avoid repetition, detailed descriptions are omitted here.

[0225] This application also provides a computer-readable storage medium for storing a computer program for implementing the methods shown in the above-described method embodiments.

[0226] This application also provides a computer program product, which includes computer program code or computer program instructions. When the computer program code or computer program instructions are run on a computer, the computer can perform the methods shown in the above-described method embodiments.

[0227] Those skilled in the art will recognize that the modules and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0228] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and modules described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0229] In the embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or modules may be electrical, mechanical, or other forms.

[0230] The modules described as separate components may or may not be physically separate. Similarly, the components shown as modules may or may not be physical modules; they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected to achieve the purpose of this embodiment, depending on actual needs.

[0231] In addition, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module.

[0232] If a function is implemented as a software module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0233] The above are merely specific embodiments of this application, but the protection scope of the embodiments of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the embodiments of this application should be included within the protection scope of the embodiments of this application. Therefore, the protection scope of the embodiments of this application should be determined by the protection scope of the claims.

Claims

1. A communication method, characterized in that, The method includes: Receive X first messages on a first resource set, the first resource set including M first time-frequency resources, the first time-frequency resources are used to send first messages, the first messages are used to request access; Y second messages are sent on a second resource set, which includes N second time-frequency resources. The second time-frequency resources are used to send the second messages, and the second messages include responses to the first messages. Each of the N second time-frequency resources is associated with K first time-frequency resources. Each of the N second time-frequency resources is used to send all or part of the responses to the first messages from the K first time-frequency resources, where 1 < K < M.

2. The method according to claim 1, characterized in that, The M first time-frequency resources are arranged in a first order, wherein the M first time-frequency resources are connected end to end in the first order, and the N second time-frequency resources are arranged in a second order; The K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained sequentially in a preset direction starting from the xth first time-frequency resource, wherein x is agreed upon by the protocol or determined by the network side, and x is related to n.

3. The method according to claim 2, characterized in that, The position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between the position m and the x, the K and the M, satisfy: m = (x + k) mod M, where k = 0, 1, 2...K-1.

4. The method according to claim 1, characterized in that, The M first time-frequency resources are arranged in a first order, with the M first time-frequency resources connected end-to-end, and the N second time-frequency resources are arranged in a second order; The K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained from the xth first time-frequency resource in a preset direction. Each pair of adjacent first time-frequency resources in the K first time-frequency resources is spaced y times apart, where y is agreed upon by the protocol or determined by the network side.

5. The method according to claim 4, characterized in that, The position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between the first time-frequency resource and the x, y and M, satisfy: m = (x + k * y) mod M, where k = 0, 1, 2, ..., K-1.

6. The method according to any one of claims 2 to 5, characterized in that, The first order includes: M first time-frequency resources arranged in order of frequency domain from low to high and time domain from front to back.

7. The method according to any one of claims 2 to 5, characterized in that, The first order includes: a third order obtained by arranging M first time-frequency resources in a first frequency domain from low to high and then in a second time domain from front to back, and an order obtained by performing row and column interleaving based on the third order.

8. The method according to any one of claims 1 to 7, characterized in that, Each second message includes a response to P first messages, where P is defined by the protocol or determined by the network side, and P≤K.

9. A communication method, characterized in that, The method includes: Send a first message on a first resource set, the first resource set including M first time-frequency resources, the first time-frequency resources being used to send the first message, the first message being used to request access; A second message is received on a second resource set, the second resource set including N second time-frequency resources, the second time-frequency resources being used to send the second message, the second message including a response to the first message, each of the N second time-frequency resources being associated with K first time-frequency resources, each of the N second time-frequency resources being used to send all or part of the response to the first message from the K first time-frequency resources, 1 < K < M.

10. The method according to claim 9, characterized in that, The M first time-frequency resources are arranged in a first order, wherein the M first time-frequency resources are connected end to end in the first order, and the N second time-frequency resources are arranged in a second order; The K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained sequentially in a preset direction starting from the xth first time-frequency resource, wherein x is agreed upon by the protocol or determined by the network side, and x is related to n.

11. The method according to claim 10, characterized in that, The position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between the position m and the x, the K and the M, satisfy: m = (x + k) mod M, where k = 0, 1, 2...K-1.

12. The method according to claim 9, characterized in that, The M first time-frequency resources are arranged in a first order, with the M first time-frequency resources connected end-to-end, and the N second time-frequency resources are arranged in a second order; The K first time-frequency resources associated with the nth second time-frequency resource among the N second time-frequency resources include: the xth first time-frequency resource among the M first time-frequency resources, and K-1 first time-frequency resources obtained from the xth first time-frequency resource in a preset direction. Each pair of adjacent first time-frequency resources in the K first time-frequency resources is spaced y times apart, where y is agreed upon by the protocol or determined by the network side.

13. The method according to claim 12, characterized in that, The position m of the first time-frequency resource associated with the nth second time-frequency resource in the first order, and the relationship between the first time-frequency resource and the x, y and M, satisfy: m = (x + k * y) mod M, where k = 0, 1, 2, ..., K-1.

14. The method according to any one of claims 10 to 13, characterized in that, The first order includes: M first time-frequency resources arranged in order of frequency domain from low to high and time domain from front to back.

15. The method according to any one of claims 10 to 13, characterized in that, The first order includes: a third order obtained by arranging M first time-frequency resources in a first frequency domain from low to high and then in a second time domain from front to back, and an order obtained by performing row and column interleaving based on the third order.

16. The method according to any one of claims 9 to 15, characterized in that, Each second message includes a response to P first messages, where P is defined by the protocol, configured on the network side, or determined according to the network side configuration, and P≤K.

17. A communication device, characterized in that, It includes modules for implementing the method as described in any one of claims 1 to 8, or modules for implementing the method as described in any one of claims 9 to 16.

18. A communication device, characterized in that, include: A processor coupled to a memory for storing a computer program, which, when invoked by the processor, causes the apparatus to perform the method as claimed in any one of claims 1 to 8, or the method as claimed in any one of claims 9 to 16.

19. A chip system, characterized in that, It includes at least one processor and a communication interface, the communication interface and the at least one processor being interconnected via a line, the at least one processor being configured to run a computer program or instructions to perform the method as claimed in any one of claims 1 to 8, or to perform the method as claimed in any one of claims 9 to 16.

20. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program, the computer program including instructions for implementing the method as described in any one of claims 1 to 8, or instructions for implementing the method as described in any one of claims 9 to 16.

Images