Communication method and apparatus

Abstract

A communication method and apparatus, the communication method comprising: obtaining m1 third sequences on the basis of a first sequence and m1 second sequences, wherein an (a×n1+i)th third sequence is the product of an (a×n1+i)th second sequence and an ith element in the first sequence, the first sequence comprises n1 elements, and for the same a value, each second sequence among an (a×n1+1)th second sequence to an (a×n1+n1)th second sequence carries the same redundancy version of a data packet; and sending a first signal, wherein the first signal is generated on the basis of the m1 third sequences. In the present application, second sequences are processed by means of a first sequence to obtain third sequences, such that the third sequences sent by different sending ends can have orthogonality. Therefore, different sending ends can reuse the same time-frequency resource, and more data can be sent on the same time-frequency resource, thereby improving the utilization efficiency of time-frequency resources.

Description

Communication method and device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office on March 29, 2024, with application number "202410385676.0" and invention name "Communication Method and Device", the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communications, and in particular to communication methods and devices. Background Art

[0003] In some wireless communication scenarios, users at the edge of certain coverage areas often experience significantly different signal quality, both received and transmitted, compared to users in the center of coverage. For example, in suburban scenarios, where network devices are located far apart, signal quality can be severely degraded for terminals at the edge of network coverage. Another example is satellite communication systems, where the distance between satellites and terminals can reach tens of thousands of kilometers. Terminals at the edge of satellite coverage experience very low signal quality, both received and transmitted.

[0004] To improve signal quality for terminals in areas at the edge of network coverage, repeated transmissions can be used. For example, the same data can be sent repeatedly. However, this approach consumes significant time and frequency resources, significantly reducing network spectrum utilization efficiency. Summary of the Invention

[0005] The embodiments of the present application provide a communication method and apparatus to improve the utilization efficiency of time-frequency resources.

[0006] To achieve the above objectives, this application adopts the following technical solutions:

[0007] In a first aspect, a communication method is provided. The method can be performed by a first communication device. The first communication device can be a terminal or network device, or a component of a terminal or network device (such as a processor, chip, or chip system), or a logic module or software that can implement all or part of the functions of the terminal or network device. For ease of description, the following description uses execution by the first communication device as an example.

[0008] The method includes: obtaining m1 third sequences based on a first sequence and m1 second sequences. The a×n1+ith third sequence is the product of the a×n1+ith second sequence and the i-th element in the first sequence. The first sequence includes n1 elements. For the same value of a, each second sequence from the a×n1+1th to a×n1+n1th second sequences carries the same redundancy version (RV) of a data packet. n1 and m1 are integers greater than 1. i is a positive integer less than or equal to n1. a is a non-negative integer. The first signal is transmitted. The first signal is generated based on the m1 third sequences. In some examples, the m1 second sequences may be m1 repetitions of the second sequence. In some examples, the first sequence is an OCC sequence, and A may be represented by the a+1th OCC period. Where A=a+1. In some examples, the third sequences processed based on different first sequences may be orthogonal to each other.

[0009] This application processes the second sequence using the first sequence to generate a third sequence, ensuring orthogonality between the third sequences sent by different transmitters. This allows different transmitters to reuse the same time-frequency resources, allowing more data to be sent using the same resources, thereby improving the utilization efficiency of time-frequency resources.

[0010] In one possible design, for the a×n1+ith second sequence, for different values ​​of a, different second sequences carry different RVs of data packets. For example, if the first sequence is OCC, different OCC periods may use different RVs.

[0011] In the present application, different RVs may be used for second sequences processed by different OCCs, thereby improving the coding gain during the communication process.

[0012] In one possible design, the second sequence includes a second sequence using resources located in multiple time slots.

[0013] This application can avoid the situation where OCC cannot be used due to splitting of duplicates occupying multiple time slots. Therefore, when there are duplicates occupying multiple time slots, the same time-frequency resources can be reused to send more data, thereby improving the utilization efficiency of time-frequency resources.

[0014] In one possible design, the m1 second sequences correspond to multiple repetitions of the data packet, and the m1 second sequences do not include repetitions that occupy multiple time slots in the multiple repetitions.

[0015] In the process of processing the second sequence using OCC, the present application may not process the second sequence occupying multiple time slots, thereby avoiding affecting the orthogonality of the third sequence after OCC processing.

[0016] In one possible design, the method further includes: obtaining m2 sixth sequences based on the fourth sequence and m2 fifth sequences. The b×n2+jth sixth sequence is the product of the b×n2+jth fifth sequence and the jth element in the fourth sequence. The fourth sequence includes n2 elements. For the same value of b, each of the b×n2+1th to b×n2+n2th fifth sequences carries the same RV of the data packet. n2 and m2 are integers greater than 1. j is less than or equal to n2. b is a non-negative integer. The m2 fifth sequences correspond to repetitions occupying multiple time slots in the multiple repetitions. Generating the first signal based on the m1 third sequences includes: generating the first signal based on the m1 third sequences and the m2 sixth sequences. In some examples, the m2 fifth sequences may be m2 repetitions of the fifth sequence. In some examples, the fourth sequence is an OCC sequence, and B may be represented by the b+1th OCC period. Wherein, B=b+1.

[0017] The present application can divide the second sequence occupying multiple time slots into multiple fifth sequences and use a sequence different from the first sequence to process the fifth sequence. This allows the fifth sequence to be used for processing when the second sequence occupying multiple time slots is divided into more sequences, thereby improving the utilization efficiency of time-frequency resources.

[0018] In one possible design, the method further includes skipping repetitions that occupy multiple time slots among the multiple repetitions.

[0019] The first signal that can be sent in the present application may not include the second sequence occupying multiple time slots, which can reduce the resources occupied by the first signal and reduce the complexity of the receiving end in parsing the first signal.

[0020] In one possible design, any integer multiple of n1 is different from m1. Obtaining m1 third sequences based on the first sequence and m1 second sequences includes obtaining m1+m3 third sequences based on the first sequence, m1 second sequences, and m3 second sequences, where m1+m3 is an integer multiple of n1.

[0021] The present application can also introduce a new second sequence to avoid the situation where the number of elements in the second sequence is not a multiple of the number of elements in the first sequence, thereby improving universality.

[0022] In one possible design, the n1 third sequences are mapped into one time slot.

[0023] The present application can map n1 third sequences into one time slot, thereby ensuring that multiple repetitions of a first sequence process are all in one time slot.

[0024] In one possible design, the first signal is mapped into a time slot.

[0025] The embodiment of the present application can ensure that multiple repetitions of the data packet are in one time slot by mapping the first signal in one time slot.

[0026] In one possible design, the first sequence is an orthogonal cover code OCC.

[0027] In this application, different transmitting ends can use OCC to process the second sequence to obtain a third sequence, so that the third sequences sent by different transmitting ends are mutually orthogonal. This allows different transmitting ends to reuse the same time-frequency resources for communication when using RV to send data, thereby improving the utilization efficiency of time-frequency resources.

[0028] In one possible design, the fourth sequence is OCC.

[0029] The present application can enable the second sequence occupying multiple time slots to be divided into more sequences, while still being processed using OCC, thereby improving the utilization efficiency of time-frequency resources.

[0030] In one possible design, each of the multiple repetitions of the data packet corresponding to the m1 second sequences occupies a separate time slot. Alternatively, the multiple repetitions of the data packet corresponding to the m1 second sequences are arranged sequentially, with no gap between adjacent repetitions in the time domain. In some examples, when unusable resources exist in the time domain, during resource mapping of the multiple repetitions of the data packet, these unusable resources can be skipped, and mapping can continue on adjacent usable resources.

[0031] This application provides a variety of repetition methods that can be used, so that more appropriate repetition methods can be used for communication in different scenarios, thereby improving universality.

[0032] In one possible design, the method further includes: adopting physical downlink shared channel (PDSCH) mapping type A and / or physical uplink shared channel (PUSCH) mapping type A for each of the m1 third sequences, that is, using resources in a separate time slot for resource mapping to obtain the first signal. Alternatively, adopting PDSCH mapping type B and / or PUSCH mapping type B for the m1 third sequences, that is, starting from any symbol in any time slot, performing resource mapping in sequence to obtain the first signal. There is no gap between two adjacent third sequences in the time domain.

[0033] The present application provides a variety of mapping methods, so that a suitable mapping method can be selected in different scenarios to map and obtain the first signal, thereby improving universality.

[0034] In a second aspect, a communication method is provided. This method can be performed by a second communication device. The second communication device can be a terminal or network device, or a component of a terminal or network device (such as a processor, chip, or chip system), or a logic module or software that can implement all or part of the functions of the terminal or network device. For ease of description, the following description uses execution by the second communication device as an example.

[0035] The method includes: receiving a first signal. The first signal is obtained based on m1 third sequences. The m1 third sequences are determined based on the first sequence and m1 second sequences. The first sequence includes n1 elements. For the same value of a, each second sequence from the a×n1+1th second sequence to the a×n1+n1th second sequence carries the same redundancy version RV of the data packet. The n1 and m1 are integers greater than 1. The a is a non-negative integer. In some examples, the m1 second sequences may be the second sequence repeated m1 times. In some examples, the first sequence is an OCC sequence, and A may be represented as the a+1th OCC period. Wherein, A=a+1. In some examples, for each value of i from 1 to n1, m1 second sequences are obtained based on the product of the a×n1+ith third sequence and the i-th element in the first sequence. i is a positive integer less than or equal to n1.

[0036] This application processes the second sequence using the first sequence to generate a third sequence, ensuring orthogonality between the third sequences sent by different transmitters. This allows different transmitters to reuse the same time-frequency resources, allowing more data to be sent using the same resources, thereby improving the utilization efficiency of time-frequency resources.

[0037] In one possible design, for the a×n1+ith second sequence, different values ​​of a may result in different RVs for data packets carried by different second sequences. For example, if the first sequence is an OCC, different RVs may be used for different OCC periods. Where i is a positive integer less than or equal to n1.

[0038] In one possible design, the second sequence includes a second sequence using resources located in multiple time slots.

[0039] In one possible design, the m1 second sequences correspond to multiple repetitions of the data packet, and the m1 second sequences do not include repetitions that occupy multiple time slots in the multiple repetitions.

[0040] In one possible design, the first signal is obtained based on the m1 third sequences, including: the first signal is generated based on the m1 third sequences and m2 sixth sequences. The m2 sixth sequences are determined based on the third sequence and m2 fifth sequences. The fourth sequence includes n1 elements. For the same value of b, each of the b×n2+1th to b×n2+n2th fifth sequences carries the same RV of the data packet. n2 and m2 are integers greater than 1. b is a non-negative integer. The m2 fifth sequences correspond to repetitions that occupy multiple time slots in the multiple repetitions. In some examples, the m2 fifth sequences may be m2 repetitions of the fifth sequence. In some examples, the fourth sequence is an OCC sequence, and B may be represented as the b+1th OCC period. Wherein, B=b+1. In some examples, for each value of j from 1 to n2, m2 fifth sequences are obtained by multiplying the b×n2+jth sixth sequence by the jth element in the fourth sequence. Wherein, j is less than or equal to n2.

[0041] In one possible design, the first signal does not include repetitions of the data packet that occupy multiple time slots.

[0042] In one possible design, the n1 third sequences are mapped into one time slot.

[0043] In one possible design, the first signal is mapped into a time slot.

[0044] In one possible design, the first sequence is an orthogonal cover code OCC.

[0045] In one possible design, the fourth sequence is OCC.

[0046] In one possible design, each of the multiple repetitions of the data packet corresponding to the m1 second sequences occupies a separate time slot. Alternatively, the multiple repetitions of the data packet corresponding to the m1 second sequences are arranged sequentially, with no gap between adjacent repetitions in the time domain. In some examples, if unusable resources exist in the time domain, the multiple repetitions of the data packet do not occupy these unusable resources. That is, the unusable resources are skipped.

[0047] In one possible design, PDSCH mapping type A and / or PUSCH mapping type A are adopted for each of the m1 third sequences, that is, a separate time slot is used for resource mapping in the time domain. Alternatively, the m1 third sequences adopt PDSCH mapping type B and / or PUSCH mapping type B, that is, they are mapped sequentially in the time domain, and the starting position of the mapping of the m1 third sequences in the time domain is any symbol in any time slot, and there is no gap between two adjacent third sequences in the time domain.

[0048] In a third aspect, a communication device is provided. The communication device is used to implement the various communication methods involved in the first and / or second aspects above. The communication device can be the first communication device described above or the second communication device described above. The communication device includes modules, units, or means corresponding to implementing the above communication methods. The modules, units, or means can be implemented in hardware, software, or by hardware executing corresponding software implementations. The hardware or software includes one or more modules or units corresponding to the above functions.

[0049] Exemplarily, the communication device includes a transceiver unit and a processing unit.

[0050] In a fourth aspect, a communication device is provided, comprising: at least one processor and a communication interface, wherein the communication interface is used to receive and / or send signals, and the processor is configured to enable the communication method of any of the above aspects to be executed.

[0051] In a fifth aspect, a communication device is provided. The communication device includes: at least one processor and a memory; the memory is configured to store computer instructions, and when the processor is configured to execute the computer instructions, the communication device executes the communication method of any of the above aspects.

[0052] In a sixth aspect, a communication device is provided, which includes at least one processor configured to execute computer instructions so that the communication device implements the functions involved in any of the above aspects.

[0053] In a possible design, the communication device further includes a memory, which is used to store program instructions and data necessary for the communication device.

[0054] In one possible design, the communication device further includes: a communication interface for receiving and / or sending signals.

[0055] In the seventh aspect, a chip system is provided, which includes a processor and an input / output port, the processor is used to implement the processing functions involved in the communication method of any aspect of the above aspects, and the input / output port is used to implement the transceiver functions involved in the communication method of any aspect of the above aspects.

[0056] In one possible design, the chip system also includes a memory, which is used to store program instructions and data for implementing the functions involved in the communication method of any of the above aspects.

[0057] The chip system may be composed of at least one chip, or may include a chip and other discrete devices.

[0058] In an eighth aspect, a communication system is provided, which includes a communication device (such as a first communication device) that executes any method of the first aspect, and a communication device (such as a second communication device) that executes any method of the second aspect.

[0059] In a ninth aspect, a computer-readable storage medium is provided. The computer-readable storage medium stores computer instructions, which, when executed on a computer, execute the communication method according to any of the above aspects.

[0060] In a tenth aspect, a computer program product is provided, which includes a computer program or instructions, and when the computer program or instructions are run on a computer, the communication method according to any one of the above aspects is executed. BRIEF DESCRIPTION OF THE DRAWINGS

[0061] FIG1 is an exemplary diagram of the architecture of a communication system provided in an embodiment of the present application;

[0062] FIG2 is a flow chart of a communication method provided in an embodiment of the present application;

[0063] FIG3 is a communication diagram provided in an embodiment of the present application;

[0064] FIG4 is a schematic diagram of a signal repetition type provided in an embodiment of the present application;

[0065] FIG5 is a schematic diagram of another signal repetition type provided in an embodiment of the present application;

[0066] FIG6 is a schematic diagram of a signal configuration provided in an embodiment of the present application;

[0067] FIG7 is a schematic diagram of another signal configuration provided in an embodiment of the present application;

[0068] FIG8 is a schematic diagram of another signal configuration provided in an embodiment of the present application;

[0069] FIG9 is a schematic diagram of a signal mapping provided in an embodiment of the present application;

[0070] FIG10 is another schematic diagram of signal mapping provided in an embodiment of the present application;

[0071] FIG11 is a schematic diagram of a communication device provided in an embodiment of the present application;

[0072] FIG12 is a schematic diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0073] The network architecture and business scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Ordinary technicians in this field will know that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0074] The terms "first" and "second" in the description and drawings of the embodiments of the present application are used to distinguish different objects, or to distinguish different treatments of the same object. Words such as "first" and "second" can distinguish between identical or similar items with substantially the same functions and effects. For example, the first device and the second device are merely used to distinguish different devices and do not limit their order. Those skilled in the art will understand that words such as "first" and "second" do not limit the quantity and execution order, and words such as "first" and "second" do not necessarily limit differences.

[0075] In the description of the embodiments of the present application, unless otherwise specified, " / " indicates that the objects associated before and after are in an "or" relationship, for example, A / B can represent A or B; "and / or" in the embodiments of the present application is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.

[0076] In the description of the embodiments of the present application, unless otherwise specified, "at least one" means one or more, and "more than one" means two or more than two. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or plural.

[0077] Furthermore, the terms "including," "having," and any variations thereof, mentioned in the description of the embodiments of the present application are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or units is not limited to the listed steps or units, but may optionally include other steps or units not listed, or may optionally include other steps or units inherent to the process, method, product, or apparatus.

[0078] In the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.

[0079] It will be understood that the “embodiment” mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the embodiment of the present application. Therefore, the various embodiments in the entire specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It will be understood that in the various embodiments of the embodiment of the present application, the size of the sequence number of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present application.

[0080] It can be understood that in the embodiments of the present application, "when" and "if" both mean that corresponding processing will be performed under certain objective circumstances, and do not limit the time, nor do they require any judgment action when implementing, nor do they mean that there are other limitations.

[0081] It is understood that some optional features in the embodiments of the present application may, in certain scenarios, be implemented independently of other features, such as the solution on which they are currently based, to solve corresponding technical problems and achieve corresponding effects. In certain scenarios, they may also be combined with other features as needed. Accordingly, the devices provided in the embodiments of the present application may also implement these features or functions accordingly, which will not be described in detail here.

[0082] In the embodiments of the present application, unless otherwise specified, the same or similar parts between the various embodiments can refer to each other. In the various embodiments of the present application, and the various implementation methods / implementation methods / implementation methods in the various embodiments, if there is no special explanation and logical conflict, the terms and / or descriptions between different embodiments and the various implementation methods / implementation methods / implementation methods in the various embodiments are consistent and can be referenced to each other. The technical features in different embodiments and the various implementation methods / implementation methods / implementation methods in the various embodiments can be combined to form new embodiments, implementation methods, implementation methods, or implementation methods according to their inherent logical relationships. The implementation methods of the embodiments of the present application described below do not constitute a limitation on the scope of protection of the embodiments of the present application.

[0083] The collection, storage, use, processing, transmission, provision, and disclosure of user personal information in the technical solutions of the embodiments of this application are in compliance with relevant laws and regulations and do not violate public order and good morals. For example, in the technical solutions of the embodiments of this application, the processing of user personal information is performed with the user's authorization, which is explained here and will not be repeated below.

[0084] FIG1 is an example diagram of the architecture of a communication system provided in an embodiment of the present application.

[0085] As shown in FIG. 1 , the communication system involved in the embodiment of the present application may include at least one terminal 110 and a network device 120 .

[0086] Terminal 110 and network device 120 communicate wirelessly. Network device 120 may be a wireless access network device. Terminals and wireless access network devices may be connected to each other via wired or wireless means. Figure 1 is merely a schematic diagram. The communication system may also include other network devices, such as wireless relay devices, wireless backhaul devices, and core network devices, which are not shown in Figure 1. The connection relationships between devices are not limited to the methods listed above.

[0087] A radio access network (RAN) device may be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNodeB / gNB) in a 5G mobile communication system, a next-generation base station in a sixth-generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system; it may also be a module or unit that performs some of the functions of a base station, for example, a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). A radio access network device may be a macro base station, a micro base station, an indoor station, a relay node, or a donor node. In other embodiments, the radio access network device may also be an access network device in an open RAN (O-RAN). In O-RAN, the CU can be referred to as an open CU (O-CU), the DU can be referred to as an open DU (O-DU), and the RU can be referred to as an open RU (O-RU). The embodiments of this application do not limit the specific technologies and device forms used by the radio access network equipment. Radio access network equipment is sometimes also referred to as network equipment. For ease of description, the following description uses a base station as an example of a radio access network equipment.

[0088] A terminal may also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grid, smart furniture, smart office, smart wearable, smart transportation, smart city, etc. Terminal devices can be mobile phones, tablet computers, computers with wireless transceiver functions, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal devices.

[0089] Base stations and terminals can be fixed or mobile. They can be deployed on land, indoors or outdoors, handheld or vehicle-mounted; on water; or in the air on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of base stations and terminal devices.

[0090] Communication between base stations and terminals, between base stations, and between terminals can be carried out through authorized spectrum, unauthorized spectrum, or both; communication can be carried out through spectrum below 6 gigahertz (GHz), spectrum above 6 GHz, or spectrum below 6 GHz and spectrum above 6 GHz. The embodiments of the present application do not limit the spectrum resources used for wireless communication.

[0091] In an embodiment of the present application, the function of the base station may also be performed by a module (such as a chip) in the base station, or by a control subsystem including a base station function. The control subsystem including the base station function here may be a control center in the application scenarios of the above-mentioned terminal devices such as smart grid, industrial control, intelligent transportation, smart city, etc. The function of the repeater may also be performed by a module (such as a chip or a modem) in the repeater, or by a device including a relay function. The function of the terminal may also be performed by a module (such as a chip or a modem) in the terminal, or by a device including a terminal function.

[0092] A wireless communication system includes communication devices, which can communicate wirelessly using air interface resources. Communication devices can include network devices and terminal devices. Network devices can also be referred to as base station devices. Air interface resources can include at least one of time domain resources, frequency domain resources, code resources, and spatial resources. Communication devices can also be referred to as communication devices.

[0093] The solutions provided in the embodiments of this application can be applied to wireless communications between communication devices. Wireless communications can include wireless communications between network devices and terminals, wireless communications between network devices, and wireless communications between terminals. In the embodiments of this application, the term "wireless communications" can also be simply referred to as "communication," which can also be described as "data transmission," "information transmission," or "transmission."

[0094] The embodiments of the present application can be used for possible communication links such as uplink (UL), downlink (DL), access link, backhaul link, sidelink (SL), etc., and the embodiments of the present application are not limited here. From the perspective of business scenarios, the embodiments of the present application are applicable to a variety of scenarios, such as extended reality (XR) business, artificial intelligence (AI) business, large-capacity scenarios, etc., and the embodiments of the present application are not limited here. Among them, SL can also be called side link, side line, etc., and the embodiments of the present application are not limited here.

[0095] In the fifth generation mobile networks (5G), downlink data is usually carried on the physical downlink shared channel (PDSCH), and uplink data is usually carried on the physical uplink shared channel (PUSCH). It can be understood that the 5G involved in the various embodiments of the present application includes a non-terrestrial network (NTN). For terminals with poor coverage at the cell edge, the signal quality can be improved by repetition. For downlink services, the same data can be sent repeatedly multiple times, which can be called PDSCH repeated transmission. For uplink services, the network equipment can instruct the terminal to send the same data repeatedly multiple times, such as called PUSCH repeated transmission.

[0096] That is, in a scheme that improves signal quality by repeatedly sending the same data, the transmitter typically encodes the same data and sends it multiple times. The receiver can combine the multiple received signals to improve the demodulation signal-to-noise ratio.

[0097] However, increasing network coverage through repeated transmission reduces the network's spectral efficiency. Repeating the same data multiple times consumes more time and frequency resources, significantly reducing spectral efficiency. For networks with a large number of edge terminals, communication across the entire network can be severely impacted.

[0098] Therefore, an embodiment of the present application provides a communication method to improve the utilization efficiency of time-frequency resources.

[0099] FIG2 is a flow chart of a communication method provided in an embodiment of the present application.

[0100] As shown in Figure 2, the communication process can be applied to, but not limited to, the communication scenario shown in Figure 1. The method can be applied to a first communication device and a second communication device. The first communication device can be various possible devices in the above scenario, such as a terminal, a network device, a satellite, etc., which are not limited in this embodiment of the present application. The second communication device can be various possible devices in the above scenario, such as a terminal, a network device, a satellite, etc., which are not limited in this embodiment of the present application. The embodiment of the present application can be applicable to any possible communication scenario such as uplink, downlink, side link, satellite communication, etc., which are not limited in this embodiment.

[0101] In the embodiment of the present application, the first communication device may also be referred to as a transmitting end, and the second communication device may also be referred to as a receiving end.

[0102] The method may include the following steps:

[0103] S101: A transmitting end obtains a third sequence according to a first sequence and a second sequence.

[0104] In some embodiments, the transmitting end may obtain m1 third sequences based on the first sequence and m1 second sequences. Here, m1 is an integer greater than 1. In some examples, the second sequence and the third sequence may be bit sequences or symbol sequences. For example, the second sequence and the third sequence may also be understood as data packets before modulation, i.e., bit sequences. For another example, the second sequence and the third sequence may also be understood as signals after modulation, i.e., symbol sequences. It is understood that in the various embodiments of the present application, data and data packets may be used interchangeably.

[0105] In some examples, the m1 second sequences may be the second sequence repeated m1 times.

[0106] In some examples, the first sequence may be an orthogonal cover code (OCC), wherein the first sequence includes n1 elements, where n1 is an integer greater than 1.

[0107] For example, in the case where repeated transmission of the same data packet causes a decrease in spectrum efficiency, the embodiment of the present application considers adopting an OCC method to enable different transmitters to reuse the same time-frequency resources to transmit their respective information, thereby improving spectrum efficiency.

[0108] Referring to Figure 3, taking a satellite communication scenario as an example, satellite 320 can communicate with terminal A 311 and terminal B 312. Terminal A 311 can use OCC 0 to process transmitted data packets, while terminal B 312 can use OCC 1 to process transmitted data packets. Assume that the data packets sent by terminal A 311 are repeated multiple times, such as [s0, s0, s0, s0]. s0 can be understood as a second sequence. If terminal A 311 does not use OCC processing, satellite 320 can superimpose the received information to obtain 4s0. The corresponding signal energy is also increased by 4 times. However, in this case, the time-frequency resources occupied by [s0, s0, s0, s0] cannot be used by terminal B 312.

[0109] Using different OCCs allows terminals A 311 and B 312 to use the same time-frequency resources. Assume that terminal A 311 uses OCC 0 of [+1, +1, +1, +1] and terminal B 312 uses OCC 1 of [+1, -1, +1, -1], with OCC 0 and OCC 1 being orthogonal. Terminal A 311 transmits a four-repetition signal using OCC 0, which can be recorded as [s0, s0, s0, s0]. Terminal B 312 transmits a four-repetition signal using OCC 1, which can be recorded as [s1, -s1, s1, -s1]. Terminals A 311 and B 312 transmit on the same time-frequency resources. The signal received by satellite 320 can be recorded as [s0+s1, s0-s1, s0+s1, s0-s1]. In this example, the actual effects of channel and noise can be ignored. In some instances, relevant technologies can be used to remove the corresponding channel and noise influences. The specific implementation method can refer to the relevant technology, and the embodiments of this application will not be repeated here.

[0110] Satellite 320 can use OCC 0 to separate s0, sent by terminal A 311, from the received signals [s0+s1, s0-s1, s0+s1, s0-s1]. For example, satellite 320 combines [s0+s1, s0-s1, s0+s1, s0-s1] using OCC 0. That is, (s0+s1)×1+(s0-s1)×1+(s0+s1)×1+(s0-s1)×1, resulting in 4s0. Thus, satellite 320 can use OCC 0 to eliminate the signal portion processed using OCC 1, retaining only the signal portion processed using OCC 0. Similarly, satellite 320 can use OCC 1 to obtain 4s1. Satellite 320 can use OCC 1 to eliminate the signal portion processed using OCC 0, retaining only the signal portion processed using OCC 1. It can be understood that the above OCC 0 and OCC 1 are orthogonal to each other.

[0111] By using mutually orthogonal OCCs at different transmitters, multiple transmitters can send signals simultaneously without interfering with each other, thereby improving spectrum efficiency.

[0112] In some examples, if the transmitting end is a terminal, different terminals can use different orthogonal OCCs. Each terminal uses its own corresponding OCC to process duplicate data packets. This allows different terminals to reuse the same time-frequency resources to transmit their respective information during uplink communications. Network equipment can also decode received signals based on the orthogonal OCCs to obtain data packets sent by different terminals. This improves the efficiency of time-frequency resource utilization.

[0113] Of course, in some examples, for downlink communications, network devices can use multiple orthogonal OCCs to communicate with different terminals. For example, the network device uses OCC 1 to process the signal for communication with terminal 1, and uses OCC 2 to process the signal for communication with terminal 2. Network devices can also reuse the same time-frequency resources to communicate with different terminals, improving time-frequency resource utilization efficiency.

[0114] In the embodiment of the present application, different transmitting ends can use OCC to process the second sequence to obtain a third sequence, so that the third sequences sent by different transmitting ends are mutually orthogonal. This allows different transmitting ends to reuse the same time-frequency resources for communication when using RV to send data, thereby improving the utilization efficiency of time-frequency resources.

[0115] In some examples, a first sequence can be used to process multiple second sequences to obtain a third sequence. For example, the first element of the first sequence can be multiplied by the first second sequence to obtain the first third sequence. In other words, the product of the a×n1+ith second sequence and the i-th element in the first sequence is the a×n1+ith third sequence. Given that the length of the first sequence is not necessarily the same as the number of second sequences, in some examples, n1 second sequences can be grouped together, with each group of second sequences processed using a single first sequence. Here, a is a nonnegative integer, and i is a positive integer less than or equal to n1.

[0116] For example, for group 0, if a is 0, the i-th second sequence is multiplied by the i-th element in the first sequence to obtain the i-th third sequence. For group 1, if a is 1, the n1+i-th second sequence is multiplied by the i-th element in the first sequence to obtain the n1+i-th third sequence. And so on. Suppose the first sequence is [+1, -1], the m1 second sequences are [s0, s0, s0, s0], and n1 is 2. Then, if a is 0, the first "s0" is multiplied by "+1" to obtain the first third sequence "s0"; the second "s0" is multiplied by "-1" to obtain the second third sequence "-s0". If a is 1, the third "s0" is multiplied by "+1" to obtain the third third sequence "s0"; the fourth "s0" is multiplied by "-1" to obtain the fourth third sequence "-s0".

[0117] In some examples, when the first sequence is an OCC sequence, A can be represented as the a+1th OCC cycle. Here, A = a+1. Therefore, it can be considered that every n1 second sequences corresponds to an OCC cycle. In other words, a group of second sequences involved in the above example corresponds to one OCC cycle.

[0118] In some examples, each of the multiple repetitions of the data packet corresponding to the m1 second sequence occupies a separate time slot. This repetition method can be referred to as repetition type A. Repetition type A can be considered to require that each repetition of the multiple repetitions of the signal occupies a separate time slot, and that orthogonal frequency division multiplexing (OFDM) symbols are located in the same position in each time slot. It is understood that the symbols involved in the various embodiments of the present application can be OFDM symbols.

[0119] For example, referring to Figure 4 , a time slot includes 14 symbols. Assume that the second sequence needs to be repeated four times: Repetition 0, Repetition 1, Repetition 2, and Repetition 3. Furthermore, the starting symbol position of each repetition is the first symbol in the corresponding time slot, and the length of each repetition is 12 time slots. Each repetition occupies a separate time slot. It can be seen that the symbol positions in each time slot are also the same for each repetition, i.e., the squares filled with diagonal lines in Figure 4 . Although there are unoccupied symbols in any time slot, i.e., the white squares in Figure 4 , these symbols will not be occupied by other repetitions.

[0120] In other examples, multiple repetitions of the data packets corresponding to the m1 second sequences are arranged sequentially, with no gap in the time domain between adjacent repetitions. This repetition type can be referred to as repetition type B. Repetition type B requires that the multiple repetitions be arranged sequentially in the time domain and allows a repetition to occupy multiple time slots. This means that a repetition can span time slots, or cross time slot boundaries.

[0121] For example, referring to FIG5 , assume that the second sequence needs to be repeated four times: repetition 0, repetition 1, repetition 2, and repetition 3. Furthermore, the length of each repetition is 4, and a time slot includes 14 symbols. Taking the example of repetition 0 starting at the first symbol of a time slot, the four repetitions are arranged sequentially in the time domain. It can be seen that there is no gap in the time domain between two adjacent repetitions. For repetition 3, this repetition occupies two time slots, meaning it spans time slots. In FIG5 , the squares filled with diagonal lines represent symbols that are occupied by multiple repetitions, and the white squares represent unoccupied symbols.

[0122] In some examples, for repetition 3 in Figure 5, because it occupies multiple time slots, this repetition can be further divided. In this case, repetitions 0 to 3 can be referred to as nominal repetitions 0 to 3. Referring to Figure 5, nominal repetition 3 can also be divided into actual repetition 3 and actual repetition 4. In other examples, for a repetition that spans unusable symbols, this repetition can be further split into multiple actual repetitions. The unusable symbols can be considered as resources that cannot be used for some reason.

[0123] In some examples, when there may be unusable resources in the time domain, during the resource mapping process for multiple repetitions of a data packet, these unusable resources may be skipped, and mapping may continue on adjacent usable resources.

[0124] The embodiments of the present application provide a variety of repetition methods that can be adopted, so that more appropriate repetition methods can be used for communication in different scenarios, thereby improving universality.

[0125] In some embodiments, for a scheme in which the same data is transmitted using different repetition modes, the network device may configure a redundancy version (RV) to be used for each repetition. In the case where the transmitting end is a terminal, the network device may indicate to the terminal the RV to be used for each repetition. For example, in the case where the network device schedules a PUSCH, the network device may indicate the RV to be used for each repetition via downlink control information (DCI).

[0126] For example, the network device can configure the RV used in each repetition. In the case of the network device scheduling PUSCH, a field can be set in the DCI to indicate the RV used in each repetition. As shown in Table 1,

[0127] Table 1

[0128] It can be seen that, assuming that the field in the DCI used to indicate the RV used in each repetition is 0, it means that RV 0, RV 2, RV 3 and RV 1 are used in sequence for multiple repetitions. It can be understood that different RVs represent data packets read at different starting positions after encoding a data packet. For example, a data packet is 25 bits, and a 100-bit data packet is obtained after encoding. The 1st to 25th bits of the 100 bits can correspond to RV0, the 26th to 50th bits can correspond to RV1, the 51st to 75th bits can correspond to RV2, and the 76th to 100th bits can correspond to RV3. Of course, the above explanation of RV is only an exemplary explanation. The specific implementation process of RV can refer to the relevant technology, and the embodiments of the present application will not be repeated here.

[0129] For example, taking repetition type A as an example, referring to the four repetitions shown in FIG4 , assuming the DCI indicates the third row in Table 1, repetition 0 uses RV 3, repetition 1 uses RV 1, repetition 2 uses RV 0, and repetition 3 uses RV 2. For another example, taking repetition type B as an example, referring to the four repetitions shown in FIG5 , assuming the DCI indicates the third row in Table 1, nominal repetition 0 uses RV 3, nominal repetition 1 uses RV 1, and nominal repetition 2 uses RV 0. For nominal repetition 3, the RV version allocation is based on the actual repetitions. Therefore, nominal repetition 3 should be split into actual repetition 3 and actual repetition 4, with actual repetition 3 using RV 2 and actual repetition 4 using RV 3. It can be considered that the RV cycle is implemented according to the actual repetitions.

[0130] In some cases, the receiving end can combine received signals based on different RVs to improve demodulation performance, enabling normal communication even for terminals at the cell edge where channel quality may be poor.

[0131] However, when OCC is introduced, it is necessary to ensure that each repetition is identical when using the OCC for processing multiple repetitions. Repetitions using different RVs are not strictly repetitions; rather, they can be understood as encoding different RVs. Therefore, using different RVs for multiple repetitions can affect the orthogonality between different OCCs, leading to a decrease in signal demodulation performance at the receiver.

[0132] Therefore, in some examples, in the process of using the first sequence to process multiple second sequences to obtain a third sequence, for the same value of a, each second sequence from the a×n1+1th second sequence to the a×n1+n1th second sequence carries the same RV of the data packet.

[0133] That is, the m1 second sequences can be divided into multiple groups of second sequences according to a, with each group of second sequences including n1 second sequences. For any group of second sequences, the first second sequence in the group can be recorded as the a×n1+1th second sequence, and the last second sequence in the group can be recorded as the a×n1+n1th second sequence. The RV of the data packets carried by each second sequence in the group can be the same RV.

[0134] For example, assume there are 8 second sequences and the OCC length is 4, that is, n1 is 4. Assume the second sequence is s0. Then, the first through fourth second sequences are processed using one OCC, and the same RV is used for these sequences; the fifth through eighth second sequences are processed using one OCC, and the same RV is used for these sequences. Assuming that the RVs used in the second row of Table 1 are configured, the OCCs used for the first through fourth second sequences are [+1, -1, +1, -1]. Then, the first s0 can use RV2 and be multiplied by "+1"; the second s0 can use RV2 and be multiplied by "-1"; the third s0 can use RV2 and be multiplied by "+1"; and the fourth s0 can use RV2 and be multiplied by "-1". The eight third sequences at the transmitter can be [s0,-s0,s0,-s0,s0,-s0,s0,-s0]. The first four third sequences can use RV2. Refer to the RV configuration used in the second row of Table 1. The last four third sequences can use RV3.

[0135] In the above example, if the transmitting end is a terminal, it can receive configuration information sent by the network device. This configuration information can configure the repetition type used by the terminal to transmit PUSCH, such as repetition type A and repetition type B mentioned above. This configuration information can also configure the number of repetitions, that is, the number of second sequences. This configuration information can also configure the OCC used by the second sequence.

[0136] In some examples, the configuration information may include a first field, which is used to configure the OCC used by the second sequence. In some cases, the first field is only used to configure the OCC used by the second sequence. In other cases, the first field can be used to configure the OCC used by the second sequence, and the first field can also be used to configure other parameters, that is, the first field can be multiplexed with other parameters. For example, the first field can be expressed as a time domain resource allocation (TDRA) table. The TDRA table may include one or more rows, and each row of parameters is used to configure the PUSCH, such as configuring the start symbol of the PUSCH, the length of the PUSCH, the mapping type of the PUSCH, etc. Among them, the TDRA table can add a column, which is used to configure the OCC used by the second sequence. For any row of the TDRA table, it is equivalent to adding a parameter, that is, the parameter used to configure the OCC used by the second sequence. It can be understood that the parameters in each row of the TDRA table can be configured separately and there is no correlation between them.

[0137] In some embodiments, for the a×n1+ith second sequence, for different values ​​of a, the RVs of the data packets carried by different second sequences are different. In some examples, when the first sequence is an OCC, different OCC periods may use different RVs.

[0138] For example, taking eight second sequences and an OCC length of four as an example, assuming the RVs used for each repetition are configured according to the second row of Table 1, the first through fourth second sequences can use RV2, and the fifth through eighth second sequences can use RV3. The order of the RVs used for these eight second sequences can be recorded as [2, 2, 2, 2, 3, 3, 3, 3]. In other words, different RVs can be used for second sequences that are not processed by the same OCC. It is worth noting that the "same OCC" mentioned here refers to the OCC corresponding to the first through fourth second sequences, and is not the same OCC as the OCC corresponding to the fifth through eighth second sequences. However, the contents of these two OCCs can be the same. For example, the OCC corresponding to the first through fourth second sequences is called the first OCC, and the OCC corresponding to the fifth through eighth second sequences is called the second OCC. The first and second OCCs can both be [+1, -1, +1, -1].

[0139] It can be understood that using different RVs after data packet encoding during the communication process can improve the accuracy of data packet recovery during decoding and increase the coding gain.

[0140] In the embodiment of the present application, different RVs may be used for second sequences processed by different OCCs, thereby improving the coding gain during the communication process.

[0141] In some implementations, the second sequence includes a second sequence that utilizes resources located in multiple time slots. That is, the multiple second sequences processed by a single OCC may include a second sequence that occupies multiple time slots. It should be understood that the phrase "occupying multiple time slots" in the various embodiments of this application should be understood as occupying at least a portion of the resources in each of the multiple time slots. In some specific cases, all resources in multiple time slots may be occupied.

[0142] For example, referring to Figure 6, assume an OCC length of 4 and eight second sequences, namely, repeats 0 through 7. The eight second sequences are sequentially mapped to the corresponding time domain resources. Assuming each second sequence occupies 3 symbols, the first second sequence begins at the first symbol of a time slot. It can be seen that repeats 0 through 3 can be processed using the first OCC and can use the same RV. Repeats 4 through 7 can be processed using the second OCC and can use the same RV. Of course, the RV used for repeats 0 through 3 can be different from the RV used for repeats 4 through 7. The contents of the first and second OCCs can be the same. It can be seen that repeat 4 is a second sequence that spans time slots, meaning it occupies symbols in two different time slots. In this case, repeat 4 can be left unsplit, meaning it is not divided into multiple true repeats, or it can be considered that it is not split into multiple true repeats. In this case, repeats 0 through 7 can be considered the nominal repeats mentioned above.

[0143] It is understandable that if repetition 4 is divided into real repetition 41 and real repetition 42. Referring to Figure 6, real repetition 41 actually occupies 2 symbols, and real repetition 42 actually occupies 1 symbol. The remaining repetitions 0 to 3, and repetitions 5 to 7 all occupy 3 symbols. Obviously, even without considering the RV, the actual signals of real repetition 41, real repetition 42 and the remaining repetitions are different. As a result, OCC cannot be used for processing. For example, if the RV used is the same, since the number of symbols occupied by the actual signal is different, it means that the length of the actual signal is different. Even if the RV is the same, the actual signals of real repetition 41, real repetition 42 and the remaining repetitions are only partially the same, not completely the same. Therefore, in the embodiment of the present application, it is considered that the repetitions occupying multiple time slots will no longer be split. This ensures that multiple repetitions processed by the same OCC are the same.

[0144] In some examples, when the second sequence includes a second sequence occupying multiple time slots, if the transmitting end is a terminal, the network device can configure relevant parameters for the PUSCH for the terminal. The OCC used for the second sequence can be configured using a TDRA table. For details, please refer to the above-mentioned embodiments of configuring the OCC for the network device, which are not described in detail in this embodiment of the present application. In some cases, the network device can also instruct the terminal not to split nominal repetitions into real repetitions when repetition type B is used. For example, the network device can explicitly indicate in the configuration information sent to the terminal that nominal repetitions are not split into real repetitions when repetition type B is used. For example, this can be indicated using one or more bits; or any other equivalent method can be used for explicit indication, which is not limited in this embodiment of the present application. For another example, the network device can implicitly indicate in the configuration information sent to the terminal that nominal repetitions are not split into real repetitions when repetition type B is used. For example, if the OCC is configured in the configuration information, the default is to not split nominal repetitions into real repetitions when repetition type B is used.

[0145] The embodiments of the present application can avoid the situation where OCC cannot be used due to splitting of duplicates occupying multiple time slots. Thus, when duplicates occupying multiple time slots exist, the same time-frequency resources can be reused to send more data, thereby improving the utilization efficiency of time-frequency resources.

[0146] In some other implementations, the m1 second sequences correspond to multiple repetitions of the data packet, and the m1 second sequences do not include repetitions that occupy multiple time slots within the multiple repetitions. In other words, the multiple repetitions of the data packet may include repetitions that occupy multiple time slots, but the m1 second sequences processed with the first sequence do not include repetitions that occupy multiple time slots.

[0147] Referring to Figure 7, for example, the length of the OCC is 4, and the number of second sequences is 8, namely repetition 0 to repetition 7. The 8 second sequences are mapped sequentially on the corresponding time domain resources. Assuming that each second sequence occupies 3 symbols, the starting position of the first second sequence starts from the first symbol of a time slot. The oblique line filled boxes in Figure 7 represent the symbols occupied by repetition 0 to repetition 7. It can be seen that for repetition 3, since this repetition occupies multiple time slots, in the process of using OCC to process each repetition, this repetition can be skipped, that is, OCC is not used to process repetition 3. For example, the first OCC is used to process repetitions 0 to 2, and repetition 4. OCC processing is not performed on repetition 3. In other words, the multiple repetitions processed by the first OCC do not include repetition 3 that occupies multiple time slots.

[0148] Of course, for repetition 3 without OCC processing, the sending end may send it or not, and the embodiment of the present application does not limit this.

[0149] In the embodiment of the present application, when the OCC is used to process the second sequence, the second sequence occupying multiple time slots may not be processed, thereby avoiding affecting the orthogonality of the third sequence after the OCC processing.

[0150] In some examples, still using Figure 7 as an example, since OCC processing is not performed for Repetition 3, which occupies multiple time slots, the first OCC skips Repetition 3 and processes Repetition 4. Therefore, for the second OCC, only Repetitions 5, 6, and 7 remain. Clearly, the remaining number of repetitions does not meet the OCC length. Therefore, the second sequence can be supplemented, or an additional second sequence can be introduced. This is represented by Repetition 8 in Figure 7, which is represented by a box filled with horizontal lines. This allows the second OCC to process the multiple repetitions.

[0151] As can be seen, for any integer multiple of n1 that differs from m1, m1+m3 third sequences can be obtained based on the first sequence, m1 second sequences, and m3 second sequences. Here, m1+m3 is an integer multiple of n1. It can be understood that the m3 second sequences are the supplementary second sequences in the above example, such as the repetition 8 in Figure 7. m3 is a positive integer.

[0152] Of course, in some examples, for second sequences that do not occupy multiple time slots, and when any integer multiple of n1 is different from m1, m3 second sequences can still be introduced to ensure that m1+m3 is an integer multiple of n1. The m1+m3 second sequences are then processed using the first sequence to obtain m1+m3 third sequences.

[0153] In some other examples, some of the second sequences may be reduced. For example, the transmitter may obtain m1-m3 third sequences based on the first sequence, m1 second sequences, and m3 second sequences, where m1-m3 are integer multiples of n1.

[0154] The embodiment of the present application can also introduce a new second sequence to avoid the number of elements in the second sequence not being in a multiple relationship with the number of elements in the first sequence, thereby improving universality.

[0155] In yet other implementations, for a second sequence occupying multiple time slots, the second sequence occupying multiple time slots can be divided into m2 fifth sequences. For example, the second sequence occupying multiple time slots can be considered a nominal repetition across time slots, and the nominal repetition across time slots can be divided into m2 real repetitions. Each real repetition can be considered the fifth sequence mentioned above. The m2 fifth sequences correspond to repetitions that occupy multiple time slots among the multiple repetitions, that is, correspond to the second sequence occupying multiple time slots. In some examples, the m2 fifth sequences can be the fifth sequence repeated m2 times.

[0156] In some examples, for m2 fifth sequences, m2 sixth sequences can be obtained based on the fourth sequence and m2 fifth sequences. That is, a fourth sequence different from the first sequence can be used for the m2 fifth sequences to obtain m2 sixth sequences. Among them, the fourth sequence includes n2 elements, and the b×n2+jth sixth sequence can be the product of the b×n2+jth fifth sequence and the jth element in the fourth sequence. For the same value of b, each fifth sequence from the b×n2+1th to b×n2+n2th fifth sequences carries the same RV of the data packet. n2 and m2 are integers greater than 1, j is less than or equal to n2, and b is a non-negative integer. Of course, the specific implementation process can refer to the description of the corresponding embodiment of obtaining the third sequence based on the first sequence and the second sequence, and the embodiments of the present application will not be repeated here.

[0157] In some examples, when the fourth sequence is an OCC sequence, B may be represented as the b+1th OCC period, where B=b+1.

[0158] For example, the fourth sequence is an OCC. This fourth sequence can be an OCC different from the first sequence. It is understood that the content of the OCC corresponding to the fourth sequence is different from the content of the OCC corresponding to the first sequence. Therefore, in each embodiment of the present application, the first sequence can be referred to as the first OCC, and the fourth sequence can be referred to as the second OCC. For example, the first OCC is [+1, +1, +1, +1], and the second OCC is [+1, -1, +1, -1].

[0159] The embodiment of the present application can ensure that even when the second sequence occupying multiple time slots is divided into more sequences, OCC can still be used for processing, thereby improving the utilization efficiency of time-frequency resources.

[0160] In some examples, for a second sequence occupying multiple time slots, if the time slot boundaries cannot divide the second sequence into fifth sequences of equal length, such as shown in repetition 3 in reference FIG8 , repetition 3 can be divided into true repetition 31 and true repetition 32. True repetition 31 and true repetition 32 each occupy 2 symbols. In some cases, when repetitions that span time slots are divided according to time slot boundaries, the two true repetitions obtained may be of different sizes. For example, in FIG6 , repetition 4 is divided according to the time slot boundaries, resulting in two true repetitions, one of which occupies 2 symbols and the other occupies 1 symbol. In this case, repetition 4 can be re-split based on the length of the shorter true repetition. For example, repetition 4 can be divided based on the true repetition that occupies 1 symbol, resulting in three true repetitions, each of which occupies 1 symbol.

[0161] In other examples, the second sequence occupying multiple time slots can be divided according to a predetermined length. For example, the second sequence occupying multiple time slots can be divided according to a predetermined length of one symbol. Of course, the above description is merely an example, and any appropriate length can be selected as the predetermined length for dividing the second sequence occupying multiple time slots according to actual circumstances. This is not limited in the present embodiment.

[0162] In some other examples, assuming that after a second sequence occupying multiple time slots is divided based on time slot boundaries, the length of the shorter true repetition cannot completely divide the second sequence or the length of the longer true repetition. For example, the second sequence occupying multiple time slots occupies 7 symbols, and the two true repetitions obtained by dividing the second sequence based on the time slot boundaries have one true repetition occupying 5 symbols and the other true repetition occupying 2 symbols. Obviously, neither the second sequence nor the true repetition occupying 5 symbols can be completely divided based on 2 symbols. In this case, a common divisor, or common factor, of the two true repetition lengths can be used. For example, 1 symbol can be used to divide the second sequence or the true repetition occupying 5 symbols.

[0163] In some cases, during the aforementioned process of dividing the second sequence occupying multiple time slots into m2 fifth sequences, the m2 fifth sequences may be processed using the fourth sequence. Therefore, any integer multiple of n2 may differ from m2. In this case, m2+m4 sixth sequences can be obtained based on the fourth sequence, the m2 fifth sequences, and the m4 fifth sequences. Here, m2+m4 is an integer multiple of n2, and the m4 fifth sequences are supplementary fifth sequences.

[0164] In other examples, m2-m4 sixth sequences may be obtained based on the fourth sequence, m2 fifth sequences, and m4 fifth sequences, where m2-m4 are integer multiples of n2.

[0165] It can be understood that for sequences occupying multiple time slots, since they cannot be directly processed using the first sequence, the time-frequency resources occupied by these sequences cannot be used by multiple different transmitters. However, by dividing this type of second sequence into multiple fifth sequences and processing them using the fourth sequence to generate sixth sequences, the sixth sequences generated using different fourth sequences are mutually orthogonal. This allows time-frequency resources that were originally unusable by multiple different transmitters to be used by multiple different transmitters, thereby improving the utilization efficiency of these time-frequency resources.

[0166] In an embodiment of the present application, a second sequence occupying multiple time slots can be divided into multiple fifth sequences, and a sequence different from the first sequence can be used to process the fifth sequence. This allows the fifth sequence to be used for processing when the second sequence occupying multiple time slots is divided into more sequences, thereby improving the utilization efficiency of time-frequency resources.

[0167] S102: The transmitting end sends a first signal. Correspondingly, the receiving end may receive the first signal sent by the transmitting end.

[0168] In some embodiments, the transmitting end may generate a first signal according to m1 third sequences and may transmit the generated first signal.

[0169] In some examples, if the second sequence is supplemented, such as introducing m3 second sequences, the transmitting end may generate the first signal based on m1+m3 third sequences.

[0170] In other examples, if the second sequence of the occupied time slot is divided into m2 fifth sequences, and the m2 fifth sequences are processed using the fourth sequence to obtain m2 sixth sequences, the transmitter can generate the first signal based on the m1 third sequences and the m2 sixth sequences.

[0171] In some other examples, if the second sequence of the occupied time slot is divided into m2 fifth sequences, and the fifth sequence is supplemented, such as introducing m4 fifth sequences, the transmitter can generate the first signal based on m1 third sequences and m2+m4 sixth sequences.

[0172] In other examples, if the second sequence is supplemented, such as by introducing m3 second sequences, and if the second sequence of the occupied time slot is divided into m2 fifth sequences, and the m2 fifth sequences are processed using the fourth sequence to obtain m2 sixth sequences, the transmitter can generate the first signal based on the m1+m3 third sequences and the m2 sixth sequences.

[0173] In some other examples, if the second sequence is supplemented, such as by introducing m3 second sequences, and the m2 fifth sequences obtained by dividing the second sequence of the occupied time slot are supplemented, such as by introducing m4 fifth sequences, the transmitter can generate the first signal based on the m1+m3 third sequences and the m2+m4 sixth sequences.

[0174] In some embodiments, if the second sequence occupying multiple time slots is not processed using the first sequence and is not divided and processed using the fourth sequence, the first signal may directly include the second sequence occupying multiple time slots.

[0175] In some other examples, the first signal may not include the second sequence occupying multiple time slots. That is, the transmitting end directly skips the second sequence occupying multiple time slots and no longer transmits the second sequence occupying multiple time slots. This can be considered as the transmitting end skipping the repetition occupying multiple time slots among the multiple repetitions.

[0176] The first signal that can be sent in the embodiment of the present application may not include the second sequence occupying multiple time slots, which can reduce the resources occupied by the first signal and reduce the complexity of the receiving end in parsing the first signal.

[0177] It is understood that, in one case, the second sequence occupying multiple time slots may not be processed using the first sequence. However, the second sequence occupying multiple time slots is still transmitted during the transmission of the first signal. In other words, the second sequence occupying multiple time slots is also introduced during the generation of the first signal. In other cases, the second sequence occupying multiple time slots is not introduced during the generation of the first signal. In other words, the transmitted first signal does not include the second sequence occupying multiple time slots.

[0178] The following description will be made by taking the generation of the first signal according to m1 third sequences as an example. Of course, the following embodiments can also be applied to the generation of the first signal according to the other various situations mentioned above, and the specific implementation process is similar, which will not be repeated in this embodiment of the present application.

[0179] In some embodiments, for each of the m1 third sequences, resource mapping is performed using resources in a separate time slot to obtain a first signal. This mapping method may be referred to as mapping type A, such as PDSCH mapping type A, PUSCH mapping type A, etc.

[0180] For example, for PUSCH mapping type A, mapping can start from the first symbol in a time slot. For PDSCH mapping type A, mapping can start from any symbol in a time slot. However, regardless of PUSCH mapping type A or PDSCH mapping type A, each PUSCH and / or PDSCH corresponds to a single time slot, that is, a single time slot is used for resource mapping. The minimum length of a PUSCH and / or PDSCH in the time domain can be 4 symbols.

[0181] In some examples, taking the uplink PUSCH as an example, the starting position of the PUSCH can be recorded as S, and the length of the PUSCH can be recorded as L. Assume that a time slot includes 14 symbols, S=0, L=12. Referring to Figure 9, the 12 symbols occupied by the PUSCH are represented by boxes filled with slashes. Among them, the demodulation reference signal (DMRS) can be the 3rd symbol or the 4th symbol occupied by the PUSCH. That is, the black box in Figure 9 is represented as DMRS. Of course, the same applies to the downlink PDSCH, and its implementation process is similar to that of the PUSCH, and the embodiments of the present application will not be repeated here.

[0182] In some embodiments, for m1 third sequences, starting at any symbol in any time slot, resource mapping is performed sequentially to obtain a first signal. There is no gap between two adjacent third sequences in the time domain. This mapping method may be referred to as mapping type B.

[0183] For example, mapping type B may require that each PUSCH and / or PDSCH can be mapped starting from any symbol in any time slot. The shortest length of the PUSCH and / or PDSCH in the time domain can be 1 symbol length. It can be seen that mapping using mapping type B can form a very short PUSCH and / or PDSCH in time. For example, the length is 1, 2, 3 or 4. This reduces transmission delay and can be applied to ultra-reliable low-latency communications (URLLC) services.

[0184] In some examples, taking the uplink PUSCH as an example, assuming that a time slot includes 14 symbols, there are 3 PUSCHs. Among them, S=0 and L=4 for PUSCH 1. S=4 and L=4 for PUSCH 2. S=8 and L=6 for PUSCH 3. Referring to Figure 10, the symbols occupied by each PUSCH are represented by a box filled with slashes. Among them, the DMRS of each PUSCH can be located at the first symbol of each PUSCH, that is, the black box in Figure 10 is represented as DMRS. The DMRS under this mapping method can be called a front-load DMRS. Of course, the same applies to the downlink PDSCH, and its implementation process is similar to that of PUSCH, and the embodiments of the present application will not be repeated here.

[0185] It is clear that mapping type A can be applied to the aforementioned repetition type A. Mapping type B can be applied to both the aforementioned repetition type A and the aforementioned repetition type B. In some examples, Table 2 shows the values ​​of S and L for different mapping types.

[0186] Table 2

[0187] Of course, Table 2 is only one possible implementation method, and any appropriate values ​​of S and L can be selected according to actual conditions, and the embodiments of the present application are not limited here.

[0188] The embodiments of the present application provide multiple mapping methods, so that a suitable mapping method can be selected in different scenarios to map and obtain the first signal, thereby improving universality.

[0189] In some embodiments, n1 third sequences are mapped into one time slot. That is, multiple third sequences obtained by processing the same first sequence can be mapped into one time slot. For example, assuming the first sequence is an OCC with an OCC length of 4, the four third sequences obtained by processing the OCC can be mapped into the same time slot, without one or more third sequences being in a different time slot from the remaining third sequences.

[0190] In the embodiment of the present application, n1 third sequences may be mapped into one time slot, thereby ensuring that multiple repetitions of a first sequence process are all in one time slot.

[0191] In some embodiments, the first signal is mapped into a single time slot. That is, the first signal obtained based on multiple third sequences, or based on multiple third sequences and the sixth sequence, can be mapped into a single time slot. This means that the above operation needs to be repeated for the number of times allowed within a time slot, and the obtained first signal also remains within a single time slot. In other words, the resources occupied by the first signal will not appear in more than one time slot.

[0192] The embodiment of the present application can ensure that multiple repetitions of the data packet are in one time slot by mapping the first signal in one time slot.

[0193] In the communication method provided in the embodiments of the present application, the number of elements in the first sequence configured for repetition type A may be smaller than the number of elements in the first sequence configured for repetition type B. Taking the first sequence as an OCC as an example, the length of the OCC configured for repetition type A may be smaller than the length of the OCC configured for repetition type B.

[0194] The reason for this is that each second sequence using repetition type A is located in a different time slot. Therefore, the time span of these multiple second sequences is longer than the time span occupied by the same number of second sequences using repetition type B. This increases the probability of deviation in the orthogonality of first signals transmitted by different devices. Therefore, second sequences using repetition type A can be configured with a first sequence with fewer elements to ensure orthogonality between first signals transmitted by different devices.

[0195] For example, assuming the first sequence is an OCC, an OCC length of 2 or 4 can be configured for repetition type A, and an OCC length of 4 or 8 can be configured for repetition type B. Of course, the above specific OCC lengths are merely exemplary, and the corresponding OCC lengths can be set according to actual circumstances, and are not limited in this embodiment of the present application.

[0196] Optionally, in S103, the receiving end determines a second sequence based on the first signal and the first sequence.

[0197] In some embodiments, the first signal received by the receiving end is obtained based on m1 third sequences. The receiving end can process the third sequence using the first sequence to obtain the second sequence. It is understood that the receiving end can decode the m1 third sequences using the first sequence.

[0198] For example, for values ​​of i ranging from 1 to n1, m1 second sequences are obtained by multiplying the a×n1+i-th third sequence by the i-th element in the first sequence. This process can also be considered the inverse process of generating the third sequence. For the specific implementation process, reference can be made to the aforementioned description of processing received signals using OCC, and this embodiment of the present application will not be repeated here.

[0199] In this embodiment, a third sequence is generated by processing the second sequence using the first sequence, so that the third sequences sent by different transmitting ends are orthogonal. This allows different transmitting ends to reuse the same time-frequency resources, allowing more data to be sent using the same time-frequency resources, thereby improving the utilization efficiency of time-frequency resources.

[0200] It should be noted that the above-mentioned multiple embodiments can be combined and the combined solutions can be implemented. Optionally, some operations in the process of each method embodiment are optionally combined, and / or the order of some operations is optionally changed. In addition, the execution order between the steps of each process is only exemplary and does not constitute a limitation on the execution order between the steps. There can also be other execution orders between the steps. It is not intended to indicate that the execution order is the only order in which these operations can be performed. Ordinary technicians in this field will think of many ways to reorder the operations of this article. In addition, it should be pointed out that the process details involved in a certain embodiment of this article are also applicable to other embodiments in a similar manner, or different embodiments can be used in combination.

[0201] It is understood that in order to implement the functions in the above embodiments, the base station and the terminal include hardware structures and / or software modules that perform the corresponding functions. Those skilled in the art should readily appreciate that, in combination with the units and method steps of the various examples described in the embodiments disclosed in the present application, the embodiments of the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in hardware or in a computer software-driven hardware manner depends on the specific application scenario and design constraints of the technical solution.

[0202] Figures 11 and 12 are schematic diagrams of the structures of possible communication devices provided in embodiments of the present application. These communication devices can be used to implement the functions of any possible transmitter and / or receiver in the above-mentioned method embodiments, thereby also achieving the beneficial effects of the above-mentioned method embodiments. In the embodiments of the present application, the communication device can be a transmitter and / or receiver, or a module applied to the transmitter and / or receiver. For example, a chip.

[0203] As shown in FIG. 11 , the communication device 1100 includes a processing unit 1110 .

[0204] In a possible implementation, the communication device 1100 may further include a transceiver unit 1120 .

[0205] In a possible implementation, the communication device 1100 may further include a storage unit 1130 .

[0206] In a possible implementation, the communication device 1100 may further include a transceiver unit 1120 and a storage unit 1130 .

[0207] The communication device 1100 is used to implement the functions of the transmitting end and / or the receiving end in the method embodiment shown in FIG. 2 .

[0208] When the communication device 1100 is used to implement the functions of the transmitter in the method embodiment shown in FIG2 : the processing unit 1110 is configured to obtain m1 third sequences based on the first sequence and m1 second sequences. The transceiver unit 1120 is configured to transmit a first signal. The processing unit 1110 is further configured to perform all operations performed by the communication device 1100 in the embodiment shown in FIG2 , except for the transceiver operations, and / or to support other processes of the technology described herein. The storage unit 1130 is configured to store any data, computer instructions, and / or computer programs that may be involved in the various embodiments of this application.

[0209] When the communication device 1100 is used to implement the functions of the receiving end in the method embodiment shown in FIG2 , the transceiver unit 1120 is used to receive the first signal. The processing unit 1110 is also used to perform all operations performed by the communication device 1100 in the embodiment shown in FIG2 , except for the transceiver operations, and / or to support other processes of the technology described herein. The storage unit 1130 is used to store any data, computer instructions, and / or computer programs that may be involved in the various embodiments of this application.

[0210] For a more detailed description of the processing unit 1110 and the transceiver unit 1120, please refer to the relevant description of the method embodiment shown in Figure 2. The processing unit 1110 and the transceiver unit 1120 may also perform other steps, and the specific implementation can refer to the method embodiment, which will not be repeated here.

[0211] Optionally, the transceiver unit 1120 may be a transceiver, which may include an antenna and a radio frequency circuit, etc.

[0212] The processing unit 1110 may be a processor (or a processing circuit), such as a baseband processor, which may include one or more CPUs.

[0213] As shown in FIG12 , the communication device 1200 includes at least one processor 1210. In one possible implementation, the communication device 1200 may further include an interface circuit 1220.

[0214] In a possible implementation, the communication device 1200 may further include a memory 1230 .

[0215] In a possible implementation, the communication device 1200 may further include a memory 1230 and an interface circuit 1220 .

[0216] In some embodiments, the processor 1210 and the memory 1230 are coupled to each other; and / or the processor 1210 and the interface circuit 1220 are coupled to each other. It will be appreciated that the interface circuit 1220 may be a transceiver or an input / output interface. The memory 1230 may be used to store computer instructions executed by the processor 1210, input data required by the processor 1210 to execute computer instructions, or data generated by the processor 1210 after executing computer instructions.

[0217] When the communication device 1200 is used to implement the method shown in Figure 2, the processor 1210 can be used to implement the functions of the above-mentioned processing unit 1110, and / or the interface circuit 1220 can be used to implement the functions of the above-mentioned transceiver unit 1120, and / or the memory 1230 can be used to implement the functions of the above-mentioned storage unit 1130.

[0218] The communication device shown in FIG. 11 or FIG. 12 is merely an example, and in actual applications the communication device may have more or fewer components than those shown in FIG. 11 or FIG. 12 , may combine two or more components, or may have a different component configuration.

[0219] In the embodiments of the present application, when entity A sends information to entity B, A may send the information directly to B or indirectly to B through another entity. Similarly, when entity B receives information from entity A, entity B may directly receive the information sent by entity A or indirectly receive the information sent by entity A through another entity. Entities A and B herein may be RAN nodes or terminals, or modules within a RAN node or terminal. The sending and receiving of information may be information exchange between a RAN node and a terminal, for example, information exchange between a network device and a terminal; the sending and receiving of information may also be information exchange between two RAN nodes, for example, information exchange between a CU and a DU; the sending and receiving of information may also be information exchange between different modules within a device, for example, information exchange between a terminal chip and other modules of the terminal, or information exchange between a network device chip and other modules within the network device.

[0220] In the embodiments of the present application, a network device sends downlink signals or downlink information to a terminal device, and the downlink information is carried on a downlink channel. The terminal device sends uplink signals or uplink information to the network device, and the uplink information is carried on an uplink channel. To communicate with the network device, the terminal device needs to establish a wireless connection with a cell controlled by the network device. The cell with which the terminal device has established a wireless connection is called the serving cell of the terminal device.

[0221] It can be understood that in the embodiment of the present application, PDSCH and PUSCH are only used as examples of downlink data channels and uplink data channels. In different systems and different scenarios, data channels and control channels may have different names, and the embodiment of the present application does not limit this.

[0222] It is understood that the processor in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. The general-purpose processor may be a microprocessor or any conventional processor.

[0223] The method steps in the embodiments of the present application can be implemented in hardware or in software instructions that can be executed by a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disk, mobile hard disk, CD-ROM or any other form of storage medium well known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. The storage medium can also be an integral part of the processor. The processor and storage medium can be located in an ASIC. In addition, the ASIC can be located in a network device or a terminal. The processor and storage medium can also exist in a network device or a terminal as discrete components.

[0224] In the above embodiments, all or part of the embodiments may be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are performed in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user device, or other programmable device. The computer program or instructions may be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions may be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center that integrates one or more available media. The available medium may be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; an optical medium, such as a digital video disk; or a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

[0225] In each embodiment of the present application, unless otherwise specified or provided by logic, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form a new embodiment based on their inherent logical relationships.

[0226] It is understood that the various numbers used in the embodiments of this application are merely for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the sequence numbers of the above-mentioned processes does not necessarily imply a specific order of execution; the order of execution of the processes should be determined by their functions and inherent logic.

Claims

1. A communication method, characterized in that: include: m1 third sequences are obtained based on the first sequence and m1 second sequences, the a×n1+ith third sequence is the product of the a×n1+ith second sequence and the i-th element in the first sequence, the first sequence includes n1 elements, wherein for the same value of a, each second sequence from the a×n1+1th second sequence to the a×n1+n1th second sequence carries the same redundancy version RV of the data packet, n1 and m1 are integers greater than 1, i is a positive integer less than or equal to n1, and a is a non-negative integer; The first signal is sent, where the first signal is generated according to the m1 third sequences.

2. The method according to claim 1, characterized in that For the a×n1+i-th second sequence, for different values ​​of a, the RVs of data packets carried by different second sequences are different.

3. The method according to claim 2, characterized in that The second sequence includes a second sequence using resources located in a plurality of time slots.

4. The method according to claim 2, characterized in that The m1 second sequences correspond to multiple repetitions of the data packet, and the m1 second sequences do not include repetitions occupying multiple time slots in the multiple repetitions.

5. The method according to claim 4, characterized in that The method further comprises: Obtain m2 sixth sequences based on the fourth sequence and m2 fifth sequences, where the b×n2+jth sixth sequence is the product of the b×n2+jth fifth sequence and the jth element in the fourth sequence, and the fourth sequence includes n2 elements. For a same value of b, each of the b×n2+1th to b×n2+n2th fifth sequences carries the same RV of the data packet, n2 and m2 are integers greater than 1, j is less than or equal to n2, b is a non-negative integer, and the m2 fifth sequences correspond to repetitions that occupy multiple time slots in the multiple repetitions. The first signal is generated according to the m1 third sequences, including: The first signal is generated according to the m1 third sequences and m2 sixth sequences.

6. The method according to claim 4, characterized in that The method further comprises: Repetitions occupying multiple time slots among the multiple repetitions are skipped.

7. The method according to any one of claims 1 to 6, characterized in that Any integer multiple of n1 is different from m1; and m1 third sequences are obtained based on the first sequence and m1 second sequences, including: According to the first sequence, m1 second sequences and m3 second sequences, m1+m3 third sequences are obtained, where m1+m3 is an integer multiple of n1.

8. The method according to any one of claims 1 to 7, characterized in that The n1 third sequences are mapped into one time slot.

9. The method according to any one of claims 1 to 8, characterized in that The first signal is mapped into one time slot.

10. The method according to any one of claims 1 to 9, characterized in that The first sequence is an orthogonal cover code OCC.

11. The method according to claim 5, characterized in that The fourth sequence is OCC.

12. The method according to any one of claims 1 to 11, characterized in that Each of the multiple repetitions of the data packet corresponding to the m1 second sequences occupies a time slot alone; or, the multiple repetitions of the data packet corresponding to the m1 second sequences are arranged sequentially, with no interval between two adjacent repetitions in the time domain.

13. The method according to any one of claims 1 to 12, characterized in that The method further comprises: For each of the m1 third sequences, use resources in a separate time slot to perform resource mapping to obtain the first signal; or, For the m1 third sequences, resource mapping is performed in sequence starting from any symbol in any time slot to obtain the first signal, and there is no gap between two adjacent third sequences in the time domain.

14. A communication method, characterized in that: include: receiving a first signal; The first signal is obtained based on m1 third sequences, the m1 third sequences are determined based on the first sequence and m1 second sequences, the first sequence includes n1 elements, and for the same value of a, each second sequence from the a×n1+1th second sequence to the a×n1+n1th second sequence carries the same redundant version RV of the data packet, the n1 and m1 are integers greater than 1, and a is a non-negative integer.

15. The method according to claim 14, characterized in that For the a×n1+i-th second sequence, for different values ​​of a, the RVs of data packets carried by different second sequences are different, where i is a positive integer less than or equal to n1.

16. The method according to claim 15, characterized in that The second sequence includes a second sequence using resources located in a plurality of time slots.

17. The method according to claim 15, characterized in that The m1 second sequences correspond to multiple repetitions of the data packet, and the m1 second sequences do not include repetitions occupying multiple time slots in the multiple repetitions.

18. The method according to claim 17, characterized in that The first signal is obtained based on the m1 third sequences, including: the first signal is generated according to the m1 third sequences and m2 sixth sequences, and the m2 sixth sequences are determined based on the fourth sequence and m2 fifth sequences; The fourth sequence includes n1 elements. For the same value of b, each fifth sequence in the b×n2+1 to b×n2+n2 fifth sequences carries the same RV of the data packet, the n2 and m2 are integers greater than 1, the b is a non-negative integer, and the m2 fifth sequences correspond to repetitions occupying multiple time slots in the multiple repetitions.

19. The method according to claim 17, wherein The first signal does not include repetitions occupying multiple time slots among the multiple repetitions of the data packet.

20. The method according to any one of claims 14 to 19, characterized in that The n1 third sequences are mapped into one time slot.

21. The method according to any one of claims 14 to 20, characterized in that The first signal is mapped into one time slot.

22. The method according to any one of claims 14 to 21, characterized in that The first sequence is an orthogonal cover code OCC.

23. The method according to claim 18, wherein The fourth sequence is OCC.

24. The method according to any one of claims 14 to 23, characterized in that Each of the multiple repetitions of the data packet corresponding to the m1 second sequences occupies a time slot alone; or, the multiple repetitions of the data packet corresponding to the m1 second sequences are arranged sequentially, with no interval between two adjacent repetitions in the time domain.

25. The method according to any one of claims 14 to 24, characterized in that For each of the m1 third sequences, use a separate time slot for resource mapping in the time domain; or, The m1 third sequences are mapped sequentially in the time domain. The starting positions of the m1 third sequences mapped in the time domain are any symbols in any time slots. There is no gap between two adjacent third sequences in the time domain.

26. A communication device, characterized in that: Comprising a module for performing the method of any one of claims 1 to 13, or a module for performing the method of any one of claims 14 to 25.

27. A communication device, characterized in that: include: At least one processor configured to execute computer instructions so that the communication device performs the method according to any one of claims 1 to 13, or so that the communication device performs the method according to any one of claims 14 to 25.

28. A communication system, characterized in that: The system includes: a communication device for executing the method according to any one of claims 1 to 13, and a communication device for executing the method according to any one of claims 14 to 25.

29. A computer-readable storage medium, characterized in that The computer-readable storage medium stores instructions or programs, and when the instructions or programs are executed on the communication device, the method according to any one of claims 1 to 13 is executed, or the method according to any one of claims 14 to 25 is executed.

30. A computer program product, characterized in that The computer program product comprises a computer program or instructions, and when the computer program or instructions are run on a computer, the method according to any one of claims 1 to 13 is executed, and the method according to any one of claims 14 to 25 is executed.

Images