Communication method and apparatus

Abstract

The present application provides a communication method and apparatus. The method comprises: receiving first indication information and a cell identifier, wherein the first indication information indicates that the mapping mode of a first control resource set 0, CORESET#0, is interleaving; and determining an interleaving mapping sequence of the first CORESET#0 on the basis of a first parameter, wherein the value of the first parameter is related to the cell identifier.

Description

Communication method and device Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a communication method and device. Background Art

[0002] Currently, the industry has proposed implementing new generation radio access technology (NR) communications in private network spectrum. For example, private network spectrum includes the 3.6MHz frequency division duplexing (FDD) band spectrum of the European railway private network and the 3MHz spectrum of the European public safety network. Under such narrowband, the number of resource blocks (RBs) that the private network spectrum can support in the frequency domain is limited. The network may not be able to send a complete public control resource block, such as control resource set #0 (CORESET #0). Therefore, the complete CORESET #0 may be punctured to obtain CORESET #0 for actual transmission. However, puncturing may reduce the transmission performance of CORESET #0.

[0003] Summary of the Invention

[0004] The embodiments of the present application provide a communication method and apparatus that can ensure good transmission performance.

[0005] In a first aspect, the present application provides a communication method. Optionally, the execution subject of the method may be a terminal device, or a component or device applied to the terminal device (such as a processor, chip, or chip system, etc.), or a logic module or software that can implement all or part of the terminal device functions. The method includes:

[0006] First indication information and a cell identifier are received, wherein the first indication information indicates that a mapping mode of a first control resource set 0 (CORESET#0) is interleaving; and an interleaving mapping order of the first CORESET#0 is determined according to a first parameter, where a value of the first parameter is related to the cell identifier.

[0007] In a second aspect, the present application provides a communication method. Optionally, the execution subject of the method may be a network device, or a component applied to the network device (such as a processor, chip, or chip system, etc.), or a logic module or software that can implement all or part of the network device functions. The method includes:

[0008] Send first indication information and a cell identifier, where the first indication information indicates that the mapping mode of the first control resource set 0, CORESET#0, is interleaving; determine the interleaving mapping order of the first CORESET#0 according to a first parameter, and the value of the first parameter is related to the cell identifier.

[0009] By adopting the method of the first aspect or the second aspect, the interleaving mapping order of the first CORESET#0 can be adjusted according to the correlation between the value of the first parameter and the cell identifier, thereby avoiding some parameter configurations with poor transmission performance, thereby ensuring better transmission performance.

[0010] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter is also related to one or more of the following: the number of resource blocks (RBs) of the first CORESET#0 indicated by the first indication information; the bandwidth of the first CORESET#0; the aggregation level of the first CORESET#0; or the number of symbols occupied by the first CORESET#0 in the time domain.

[0011] In this way, by associating the first parameter with one or more of the above parameters, the first parameter can take a specific value when the values ​​of the one or more parameters are different. This can adapt to different parameter configurations, avoid some parameter configurations with poor transmission performance, and thus ensure good transmission performance.

[0012] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter is an even number.

[0013] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter satisfies n=6*a+K, where n is the value of the first parameter, a is an arbitrary integer, and the numerical set to which the value of K belongs consists of one or more of 0, 1, 3, 4 or 5.

[0014] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter satisfies n=6*a+K, where n is the value of the first parameter, a is an arbitrary integer, and the value of K belongs to a numerical set consisting of 0, 1, 3, 4 and 5.

[0015] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter satisfies n=a mod b+c, where n is the value of the first parameter, a is any integer, b is 3 or 6, and c is 3, 4 or 5.

[0016] In combination with the first aspect or the second aspect, in an optional manner, when the aggregation level of the first CORESET#0 is 4 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of the first parameter is an even number.

[0017] In combination with the first aspect or the second aspect, in an optional manner, when the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a first value set, and the first value set consists of one or more of 0, 1, 3, 4 or 5.

[0018] In combination with the first aspect or the second aspect, in an optional manner, when the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a first value set, and the first value set consists of 0, 1, 3, 4 and 5.

[0019] In combination with the first aspect or the second aspect, in an optional manner, when the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a second value set, and the second value set consists of one or more of 0, 4 or 5.

[0020] In combination with the first aspect or the second aspect, in an optional manner, when the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a second value set, and the second value set consists of 0, 4 and 5.

[0021] In combination with the first aspect or the second aspect, in an optional manner, when the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the value of K belongs to a third value set, and the third value set consists of one or more of 0, 1 or 5.

[0022] In combination with the first aspect or the second aspect, in an optional manner, when the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the value of K belongs to a third value set, and the third value set consists of 0, 1 and 5.

[0023] In combination with the first aspect or the second aspect, in an optional manner, when the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the value of K is 0.

[0024] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter is an integer multiple of 6, or the value of K is 0.

[0025] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter satisfies n=2*Cell_ID, where Cell_ID is a cell identifier and n is the value of the first parameter.

[0026] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter satisfies n=6*Cell_ID, where Cell_ID is a cell identifier and n is the value of the first parameter.

[0027] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter satisfies n=6*Cell_ID+K, where Cell_ID is the cell identifier, n is the value of the first parameter, and the value set to which K belongs consists of one or more of 0, 1, 3, 4 or 5.

[0028] In combination with the first aspect or the second aspect, in an optional manner, the first CORESET#0 is a CORESET#0 of 15 RBs obtained by puncturing the 9 highest-numbered RBs in a CORESET#0 of 24 RBs, or the first CORESET#0 is a CORESET#0 of 20 RBs obtained by puncturing the 4 highest-numbered RBs in a CORESET#0 of 24 RBs.

[0029] In combination with the first aspect or the second aspect, in an optional manner, the number of symbols occupied by the first CORESET#0 in the time domain is 3.

[0030] In a third aspect, a communication device is provided, which can execute the method provided in the first aspect. The communication device specifically includes: a transceiver unit, used to receive first indication information and a cell identifier, wherein the first indication information indicates that the mapping mode of the first control resource set 0, CORESET#0, is interleaving; and a processing unit, used to determine the interleaving mapping order of the first CORESET#0 according to a first parameter, wherein the value of the first parameter is related to the cell identifier.

[0031] In a fourth aspect, a communication device is provided, which can execute the method provided in the second aspect, and the communication device specifically includes: a transceiver unit, used to send first indication information and a cell identifier, wherein the first indication information indicates that the mapping mode of the first control resource set 0, CORESET#0, is interleaving; a processing unit, used to determine the interleaving mapping order of the first CORESET#0 according to a first parameter, wherein the value of the first parameter is related to the cell identifier.

[0032] Regarding the first parameter and the first CORESET#0, as well as the beneficial effects, reference may be made to the description of the first aspect and the second aspect, which will not be repeated here.

[0033] In a fifth aspect, the present application provides a communication method. Optionally, the execution subject of the method may be a terminal device, or a component or device applied to the terminal device (such as a processor, chip, or chip system, etc.), or a logic module or software that can implement all or part of the terminal device functions. The method includes:

[0034] Receive first indication information; determine the time-frequency resource location of a first control resource set 0, CORESET#0, according to the first indication information; wherein, when the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved.

[0035] Alternatively, the method comprises:

[0036] Receive first indication information; determine a time-frequency resource location of a first control resource set 0, CORESET#0, according to the first indication information; wherein, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

[0037] In a sixth aspect, the present application provides a communication method. Optionally, the execution subject of the method may be a network device, or a component applied to the network device (such as a processor, chip, or chip system, etc.), or a logic module or software that can implement all or part of the network device functions. The method includes:

[0038] Determine first indication information, where the first indication information is used to determine a time-frequency resource location of a first control resource set 0 (CORESET#0); and send the first indication information; wherein, when the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicates that a mapping mode of the first CORESET#0 is non-interleaved.

[0039] Alternatively, the method comprises:

[0040] Determine first indication information, where the first indication information is used to determine a time-frequency resource location of a first control resource set 0 (CORESET#0); and send the first indication information; wherein, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

[0041] By adopting the method of the fifth aspect or the sixth aspect, under some parameter configurations, it is agreed that the first indication information indicates a fixed parameter value, thereby avoiding some parameter configurations with poor transmission performance, thereby ensuring better transmission performance.

[0042] In the seventh aspect, a communication device is provided, which can execute the method provided in the fifth aspect. The communication device specifically includes: a transceiver unit, used to receive first indication information; a processing unit, used to determine the time-frequency resource position of the first control resource set 0, CORESET#0, based on the first indication information; wherein, when the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved.

[0043] Alternatively, the communication device specifically includes: a transceiver unit, configured to receive first indication information; a processing unit, configured to determine the time-frequency resource position of a first control resource set 0, CORESET#0, based on the first indication information; wherein, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

[0044] In the eighth aspect, a communication device is provided, which can execute the method provided in the sixth aspect, and the communication device specifically includes: a processing unit, used to determine first indication information, the first indication information is used to determine the time-frequency resource position of the first control resource set 0, CORESET#0; a transceiver unit, used to send the first indication information; wherein, when the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved.

[0045] Alternatively, the communication device specifically includes: a processing unit, configured to determine first indication information, the first indication information being used to determine the time-frequency resource position of a first control resource set 0, CORESET#0; and a transceiver unit, configured to send the first indication information; wherein, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

[0046] Regarding the beneficial effects, please refer to the description of the fifth and sixth aspects, which will not be repeated here.

[0047] In a ninth aspect, the present application provides a communication device, comprising a processor for running a computer program or instruction to enable the communication device to execute the method described in the first aspect, the second aspect, the fifth aspect, or the sixth aspect.

[0048] In an optional manner, the communication device also includes a memory, a processor and the memory are coupled, and the processor is used to run a computer program or instruction stored in the memory so that the communication device executes the method described in the first aspect, the second aspect, the fifth aspect, or the sixth aspect.

[0049] In the tenth aspect, the present application provides a communication device, which includes a processor, a memory and a transceiver, and the processor and the memory are coupled; the transceiver is used to send and receive data, and the processor is used to implement the method described in the first aspect or the second aspect or the fifth aspect or the sixth aspect.

[0050] In the eleventh aspect, the present application provides a chip comprising a processor and an interface, wherein the processor and the interface are coupled; the interface is used to receive or output signals, and the processor is used to execute code instructions so that the method described in the first aspect or the second aspect or the fifth aspect or the sixth aspect is executed.

[0051] In the twelfth aspect, the present application provides a computer-readable storage medium, which stores a computer program or instruction. When the computer program or instruction runs on a communication device, the method described in the first aspect, the second aspect, the fifth aspect, or the sixth aspect is executed.

[0052] In the thirteenth aspect, the present application provides a communication system, which includes a first communication device and a second communication device, the first communication device is used to execute the method described in the first aspect, and the second communication device is used to execute the method described in the second aspect; or, the first communication device is the communication device as described in the third aspect, and the second communication device is the communication device as described in the fourth aspect; the first communication device is used to execute the method described in the fifth aspect, and the second communication device is used to execute the method described in the sixth aspect; or, the first communication device is the communication device as described in the seventh aspect, and the second communication device is the communication device as described in the eighth aspect.

[0053] In a fourteenth aspect, the present application provides a computer program product, which includes computer instructions. When part or all of the computer instructions are run on a communication device, the computer executes the method described in the first aspect, the second aspect, the fifth aspect, or the sixth aspect.

[0054] The beneficial effects of the above ninth to fourteenth aspects and their possible designs can refer to the beneficial effects of the first to eighth aspects and their possible designs. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] FIG1 is a schematic diagram of the architecture of a wireless communication system provided in an embodiment of the present application;

[0056] FIG2 is a schematic diagram of the division and numbering of REG bundles provided in an embodiment of the present application;

[0057] FIG3 is a schematic diagram of a CCE-REG mapping relationship in CORESET#0;

[0058] FIG4 is a schematic diagram of a spectrum;

[0059] Figure 5 shows the different n in case of non-interleaving and interleaving. shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the value;

[0060] Figure 6 shows the different n values ​​when interleaving in case 2. shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the value;

[0061] Figure 7 shows the non-interleaving and interleaving conditions with different n shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the value;

[0062] Figure 8 shows the different n in case 4 when interleaving shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the value;

[0063] FIG9 is a flow chart of a communication method provided by the present application;

[0064] FIG10 is a flow chart of a communication method provided by the present application;

[0065] FIG11 is a schematic structural diagram of a communication device provided by the present application;

[0066] FIG12 is a schematic structural diagram of another communication device provided by the present application;

[0067] FIG13 is a schematic diagram of the structure of a chip provided in this application. DETAILED DESCRIPTION

[0068] The present application provides a communication method and apparatus. Since the method and apparatus solve similar problems, the implementation of the apparatus and method can refer to each other, and the repetitive parts will not be repeated.

[0069] In the description of this application, words such as "first" and "second" are used solely for descriptive purposes and should not be construed as indicating or implying relative importance or order. It should be noted that this application does not limit the order of appearance of "first," "second," etc. For example, "second" may appear before "first," and this is not a limitation in this application.

[0070] In the description of this application, "at least one (kind)" refers to one (kind) or more (kinds), and more (kinds) refers to two (kinds) or more than two (kinds). "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 represent: a, b, c, a and b, a and c, b and c, or a and b and c, where a, b, c can be single or multiple. In the description of this application, " / " means "or", for example, a / b means a or b.

[0071] In the description of this application, "send" can be replaced by "output" and "receive" can be replaced by "input". The symbol "*" represents multiplication operation, the symbol " / " represents division operation, and the symbol Represents round down.

[0072] Figure 1 is a schematic diagram of the architecture of a communication system 1000 used in an embodiment of the present application. As shown in Figure 1, the communication system includes an access network 100 and a core network 200. Optionally, the communication system 1000 may also include the Internet 300. The radio access network (RAN) 100 may include at least one RAN node (such as 110a and 110b in Figure 1) and may also include at least one terminal (such as 120a-120j in Figure 1). The terminal is connected to the radio access network device via wireless communication, and the radio access network device is connected to the core network via wireless or wired communication. The core network device and the radio access network device may be independent and different physical devices, or the functions of the core network device and the logical functions of the radio access network device may be integrated into the same physical device, or the functions of some core network devices and some radio access network devices may be integrated into one physical device. Terminals and radio access network devices may be connected to each other via wired or wireless communication. FIG1 is only a schematic diagram. The communication system may further include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in FIG1 .

[0073] A network device is a network-side device with wireless transceiver functions. A network device can be a device in a radio access network (RAN) that provides wireless communication functions for terminal devices, and is called a RAN device. The RAN can be an access network in the 3rd Generation Partnership Project (3GPP), such as 4G, 5G, or the future-oriented 6G network. The RAN can also be an open access network (open RAN, O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network of two or more of the above networks. A RAN device can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation base station (next generation nodeB, gNB) in a fifth-generation (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, a wireless fidelity (WiFi) system, a long-range radio (LoRa) system, or an access node in a vehicle network system. RAN equipment can also be a module or unit that performs some of the functions of a base station. For example, it can be a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). The CU here performs the functions of the base station's radio resource control protocol and packet data convergence protocol (PDCP), and can also perform the functions of the service data adaptation protocol (SDAP); the DU performs the functions of the base station's radio link control layer and medium access control (MAC) layer, and can also perform some or all of the physical layer functions. For detailed descriptions of each of the above protocol layers, please refer to the relevant technical specifications of the 3rd Generation Partnership Project (3GPP). The CU and DU can be set up separately, or they can be included in the same network element, such as the baseband unit (BBU).The RU may be included in a radio frequency device or radio frequency unit, for example, a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, CU, DU, or RU may have different names, but those skilled in the art will understand their meanings. For example, in an ORAN system, CU may also be called O-CU (Open CU), DU may also be called O-DU, and RU may also be called O-RU. Any of the CU (or CU-CP, CU-UP), DU, and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module. The radio access network device may be a macro base station (such as 110a in Figure 1), a micro base station or an indoor station (such as 110b in Figure 1), a relay node, a donor node, etc. The embodiments of this application do not limit the specific technology and specific device form adopted by the radio access network device. For ease of description, network device is referred to as the abbreviation of radio access network device, and base station is used as an example of radio access network device.

[0074] A terminal is a device with wireless transceiver capabilities that can send signals to a base station or receive signals from a base station. A terminal may also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. Terminals 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. A terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, wearable device, vehicle, airplane, ship, robot, robotic arm, smart home device, etc. The embodiments of this application do not limit the specific technology and specific device form adopted by the terminal.

[0075] 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 on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of base stations and terminals.

[0076] The roles of base stations and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile base station. To terminals 120j accessing the wireless access network 100 via 120i, terminal 120i is a base station. However, to base station 110a, 120i is a terminal, meaning that communication between 110a and 120i occurs via a wireless air interface protocol. Of course, communication between 110a and 120i can also occur via a base station-to-base station interface protocol. In this case, 120i is also a base station relative to 110a. Therefore, base stations and terminals can be collectively referred to as communication devices. 110a and 110b in Figure 1 can be referred to as communication devices with base station functionality, while 120a-120j in Figure 1 can be referred to as communication devices with terminal functionality.

[0077] In the embodiments of the present application, the functions of the base station may also be performed by a module (such as a chip) in the base station, or by a control subsystem that includes the base station functions. The control subsystem that includes the base station functions here may be a control center in the above-mentioned application scenarios such as smart grid, industrial control, smart transportation, and smart city. The functions of the terminal may also be performed by a module (such as a chip or modem) in the terminal, or by a device that includes the terminal functions.

[0078] Based on the above communication system, the present application provides a communication method. The following is an explanation of some nouns or terms used in the present application, which are also considered part of the invention content.

[0079] 1. Synchronization signal and physical broadcast channel (PBCH) block (SSB)

[0080] The synchronization signal and PBCH, taken together, are referred to as the SSB. The synchronization signal is used for time synchronization, and the PBCH carries the Master Information Block (MIB). In one implementation, the SSB occupies 20 resource blocks (RBs) in the frequency domain.

[0081] For a cell, the MIB contains some basic configuration information for the cell, especially some parameters used for initial access, such as the configuration information for the physical downlink control channel (PDCCH) that schedules system information block 1 (SIB1). Terminal devices usually decode the MIB first and then use the parameters in the MIB to continue receiving SIB1 and other broadcast information.

[0082] 2. Control-resource set (CORESET) and CORESET#0

[0083] The terminal device needs to perform blind detection based on the possible time-frequency resource positions of the PDCCH when receiving the PDCCH. Information such as the resource positions occupied by the possible time-frequency resource positions of the PDCCH in the frequency domain and / or the number of symbols occupied in the time domain is called CORESET. Information such as the starting symbol of the possible time-frequency resource positions of the PDCCH in the time domain and the listening period of the terminal device is called the search space. The terminal device can determine the time-frequency resource positions that need blind detection in combination with the CORESET and the search space, so as to receive the PDCCH. It can be understood that the time-frequency resource positions that the terminal device needs to blindly detect can also be called CORESET. The embodiment of the present application provides a method related to CORESET, which does not limit the search space.

[0084] CORESET#0 corresponds to the PDCCH that schedules SIB1, namely Type0-PDCCH. The terminal device has not yet successfully accessed when receiving the Type0-PDCCH, and therefore cannot obtain the parameter configuration of CORESET#0 through RRC signaling. The terminal device can determine the parameter configuration of CORESET#0 through the indication information included in the MIB, and further determine the time-frequency resource location of CORESET#0, or the time-frequency resource information of CORESET#0. In one implementation, CORESET#0 occupies 24 RBs in the frequency domain.

[0085] The physical time-frequency resources in the CORESET are composed of resource element groups (REGs). One REG occupies one RB in the frequency domain and one orthogonal frequency division multiplexing (OFDM) symbol (or simply called symbol) in the time domain, that is, one REG includes 12 REs. Furthermore, the REGs in the CORESET are divided into multiple REG bundles. A REG bundle consists of L REGs. The number of symbols occupied by the L REGs in the time domain is the same as the number of time domain symbols occupied by the CORESET in the time domain, and the number of REGs required to satisfy the L REG composition in the frequency domain. When L=6, for example, when the CORESET occupies 3 symbols in the time domain, one REG bundle occupies 3 symbols in the time domain and 2 REGs in the frequency domain. For another example, when the CORESET occupies 2 symbols in the time domain, a REG bundle occupies 2 symbols in the time domain and 3 REGs in the frequency domain. The numbering of the REG bundles in the CORESET increases from 0 in the frequency domain from low frequency to high frequency. As shown in Figure 2, a schematic diagram of the division and numbering of REG bundles provided in an embodiment of the present application is shown. The left side shows the case where the CORESET occupies 3 symbols in the time domain, and the right side shows the case where the CORESET occupies 2 symbols in the time domain. In Figure 2, the horizontal axis is time, with one symbol as one grid, and the vertical axis is the frequency domain, with one RB as one grid.

[0086] The PDCCH candidates in a CORESET are composed of a specific number of control channel elements (CCEs) at an aggregation level, in the order of the CCE numbers. For example, if the aggregation level is AL, then CCEs numbered 0 to AL-1 form a PDCCH candidate, CCEs numbered AL to 2*AL-1 form a PDCCH candidate, and CCEs numbered 2*AL to 3*AL-1 form a PDCCH candidate. One CCE consists of one REG bundle, or in other words, one CCE consists of six REGs. Therefore, there is a mapping relationship between one CCE and one REG bundle.

[0087] NR supports two CCE to REG mapping modes: non-interleaved mapping and interleaved mapping. The CCE and REG bundle relationship can be described as follows:

[0088] REG bundle i contains REGs{iL,iL+1,…,iL+L-1}, where L is the number of REGs contained in the REG bundle. i is the number of the REG bundle. is the number of REGs in CORESET.

[0089] CCE j contains REG bundles {f(6j / L),f(6j / L+1),…,f(6j / L+6 / L-1)}, where f(.) is a mapping function and j is the CCE number.

[0090] In the interleaved mapping mode, the mapping function formula is:

[0091] Currently, CORESET#0 supports 2 or 3 time-domain symbols and 4, 8, or 16 aggregation levels (ALs). With a 15kHz subcarrier spacing and a 5MHz channel bandwidth, CORESET#0 contains 24 RBs. Furthermore, CORESET#0 only supports CCE-REG interleaving mapping, with interleaver parameters R=2 and L=6. shift =Equal to the cell ID (Cell ID), which is the Cell ID of the cell where the terminal device is located. When L=6, CCE j contains REG bundles {f(j)}. Therefore, when L=6, a CCE contains a REG bundle, and the REG bundle is numbered f(j).

[0092] For example, when n shift When is equal to 0, the interleaving mapping result is shown in Figure 3. Figure 3 is a schematic diagram of the CCE-REG mapping relationship in CORESET#0. If CORESET#0 occupies 2 time domain symbols and 24 frequency domain RBs, every 6 REGs can form a REG bundle. The CCE-REG mapping relationship is as follows: CCE 0 maps to REG bundle 0, CCE 1 maps to REG bundle 4, CCE 2 maps to REG bundle 1, CCE 3 maps to REG bundle 5, ..., CCE 7 maps to REG bundle 7. If CORESET#0 occupies 3 time domain symbols and 24 frequency domain RBs, every 6 REGs form a REG bundle. The CCE-REG mapping relationship is as follows: CCE 0 maps to REG bundle 0, CCE 1 maps to REG bundle 6, CCE 2 maps to REG bundle 1, CCE 3 maps to REG bundle 7, ..., CCE 11 maps to REG bundle 11.

[0093] For a search space associated with CORESET#0, for aggregation level AL, the numbers of CCEs that may be included in the PDCCH candidates are shown in Table 1:

[0094] Table 1

[0095] 3. Private Network Spectrum

[0096] Figure 4 shows a spectrum diagram. For NR communication in a private network spectrum, the channel bandwidth can be 3 MHz or 5 MHz. In a 3 MHz channel, the number of available RBs may be 12 or 15. In a 5 MHz channel, the number of available RBs may be 20.

[0097] In such a narrow channel bandwidth, the number of RBs available for the channel is limited, and the network may not be able to send the complete SSB or CORESET#0 mentioned above.

[0098] 4. CORESET#0 in the Private Network

[0099] In order to adapt to the channel bandwidth of the private network spectrum or the number of RBs available for the channel, one possible approach is to puncture (or truncate) CORESET#0.

[0100] When the number of available RBs in the channel is 15, the current 24 RBs of CORESET#0 are punctured to obtain a 15 RB CORESET#0. The above-mentioned CCE-to-REG interleaving mapping mode and non-interleaving mapping mode with R=2 are supported.

[0101] When the number of available RBs in the channel is 20, the current 24 RBs of CORESET#0 are punctured to obtain a 20 RB CORESET#0. The above-mentioned CCE-to-REG interleaving mapping mode of R=2 is supported.

[0102] When the number of available RBs in the channel is 12, Set to 12, and use the above method to determine CORESET to obtain CORESET#0 with 12 RBs. No puncturing is required. The above CCE-to-REG interleaving mapping method with R=2 is supported.

[0103] In the embodiment of the present application, for CORESET#0 that requires puncturing, the bandwidth of CORESET#0 is the number of RBs after puncturing. For CORESET#0 that does not require puncturing, the bandwidth of CORESET#0 and the number of RBs actually occupied by CORESET#0 correspond to the same number of physical resources. In the examples below, unless otherwise specified, the CORESET with 24 RBs is the CORESET before puncturing, the CORESET with 15 or 20 RBs is the CORESET obtained after puncturing, and the CORESET with 12 RBs is the directly determined CORESET.

[0104] It should be understood that the embodiments of the present application protect a puncturing result, and a network device or terminal device may not perform puncturing. CORESET#0 before puncturing can be understood as the current complete 24-RB CORESET#0. CORESET#0 after puncturing can be understood as CORESET#0 determined based on CORESET#0 before puncturing, or as a portion of CORESET#0 before puncturing. The network can transmit based on CORESET#0 before puncturing, and the terminal device can receive based on CORESET#0 after puncturing. Of course, the network can also transmit based on CORESET#0 after puncturing. CORESET#0 after puncturing can be a continuous portion of CORESET#0 in the frequency domain before puncturing. Specifically, CORESET#0 after puncturing can be a CORESET#0 with 15 RBs obtained by removing the highest-numbered 9 RBs from CORESET#0 before puncturing. Alternatively, CORESET#0 after puncturing can be a CORESET#0 with 20 RBs obtained by removing the highest-numbered 4 RBs from CORESET#0 before puncturing.

[0105] The above is an explanation of some nouns or terms used in this application.

[0106] To accommodate the channel bandwidth of the private network spectrum, CORESET#0 may be punctured. However, puncturing may degrade the transmission performance of CORESET#0. As previously mentioned, the PDCCH candidates in CORESET#0 are composed of CCEs with a specific aggregation level, arranged in CCE numbering order. Puncturing may remove or lose some CCEs from the PDCCH candidate, thereby degrading the transmission performance of the PDCCH candidate.

[0107] The number of CCEs in the PDCCH candidate with the most CCEs retained in CORESET#0 after puncturing is defined as the number of valid CCEs, which characterizes the transmission performance of CORESET#0. The number of valid CCEs may vary depending on whether CORESET#0 is interleaved, the number of symbols occupied by CORESET#0 in the time domain, the bandwidth of CORESET#0, and the aggregation level.

[0108] According to the mapping function f(.) described above, the interleaving mapping parameters include: the number of interleaving rows R, the offset value n shift And the number of REGs contained in each REG bundle, L. For CORESET#0, R is equal to 2, L is equal to 6, and n shift is equal to the cell ID. In addition, the value range of the cell ID in NR is 0 to 1007. Therefore, n shift When the value of is different, the interleaving mapping order of CCE and REG bundle is different, and the number of valid CCEs may also change accordingly. The interleaving mapping order can be understood as the order of the CCE numbers mapped from low frequency to high frequency in the frequency domain.

[0109] See the following situations for details:

[0110] Case 1: The number of symbols occupied by CORESET#0 in the time domain is 2, and the bandwidth of CORESET#0 is 15 RBs

[0111] The number of CCEs included in CORESET#0 before puncturing is equal to 8. The supported aggregation level AL can be 4 or 8. As shown in Figure 5, Figure 5 shows the non-interleaving and interleaving conditions in case 1 with different n shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the value. In Figure 5, the vertical axis represents frequency, from low to high frequency. One CCE occupies 3 RBs in the frequency domain.

[0112] When AL is equal to 4 and the mapping mode is non-interleaved mapping, there is no loss of PDCCH candidates {CCE0, CCE 1, CCE 2, CCE 3} contained in CORESET#0. The number of valid CCEs is 4.

[0113] When AL is equal to 4 and the mapping mode is interleaved mapping, for different n shift For the two PDCCH candidates {CCE0, CCE1, CCE2, CCE3} and {CCE4, CCE5, CCE6, CCE7} included in CORESET#0, one always loses 1 CCE and the other loses 2 CCEs. The number of valid CCEs is 3.

[0114] When AL is equal to 8, the mapping mode is non-interleaved mapping or interleaved mapping, and for different n shift When taking the value, the PDCCH candidates {CCE0, CCE1, CCE2, CCE3, CCE4, CCE5, CCE6, CCE7} contained in CORESET#0 always lose 3 CCEs. The number of valid CCEs is 5.

[0115] Case 2: The number of symbols occupied by CORESET#0 in the time domain is 2, and the bandwidth of CORESET#0 is 20 RBs

[0116] The number of CCEs included in CORESET#0 before puncturing is equal to 8. The supported aggregation level AL can be 4 or 8. As shown in Figure 6, Figure 6 shows the different n shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the corresponding values. It should be understood that in case 2, the loss of one RB for the CCE with the second highest frequency is negligible. In Figure 6, the vertical axis represents frequency, from low to high frequency. One CCE occupies three RBs in the frequency domain.

[0117] When AL is equal to 4 and the mapping mode is interleaved mapping, for different n shift For the two PDCCH candidates {CCE0, CCE1, CCE2, CCE3} and {CCE4, CCE5, CCE6, CCE7} in CORESET#0, one always loses one CCE and the other does not. The number of valid CCEs is 4.

[0118] When AL is equal to 8, the mapping mode is interleaved mapping, and for different n shift When taking the value, the PDCCH candidates {CCE0, CCE1, CCE2, CCE3, CCE4, CCE5, CCE6, CCE7} contained in CORESET#0 always lose one CCE. The number of valid CCEs is 7.

[0119] Summarizing Case 1 and Case 2, when the number of symbols occupied in the CORESET#0 time domain is 2, for the same AL value, the mapping method is interleaved mapping. shift The effective CCEs corresponding to different values ​​of are consistent; when the number of symbols occupied by CORESET#0 in the time domain is 2, when AL is equal to 4 and the bandwidth of CORESET#0 is 15 RBs, the transmission performance of non-interleaved mapping is better than that of interleaved mapping.

[0120] Case 3: The number of symbols occupied by CORESET#0 in the time domain is 3, and the bandwidth of CORESET#0 is 15 RBs

[0121] The number of CCEs included in CORESET#0 before puncturing is equal to 12. The supported aggregation level AL can be 4 or 8. As shown in Figure 7, Figure 7 shows the non-interleaving and interleaving conditions in case 3 with different n shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the value. In Figure 7, the vertical axis represents frequency, from low to high, representing low frequency to high frequency. One CCE occupies two RBs in the frequency domain.

[0122] When AL is equal to 4, the PDCCH candidates contained in CORESET#0 are divided into {CCE0, CCE 1, CCE 2, CCE 3}, {CCE 4, CCE 5, CCE 6, CCE 7} and {CCE 8, CCE 9, CCE 10, CCE 11}.

[0123] When AL is equal to 4 and the mapping mode is non-interleaved mapping, there is no loss of PDCCH candidates {CCE0, CCE 1, CCE 2, CCE 3} contained in CORESET#0. The number of valid CCEs is 4.

[0124] When AL is equal to 4 and the mapping mode is interleaved mapping, for different n shift The PDCCH candidate with the most CCEs among the three PDCCH candidates in CORESET#0 may lose 0.5 or 1 CCE. Accordingly, the number of valid CCEs is 3.5 or 3.

[0125] When AL is equal to 4, the PDCCH candidate with the most CCEs retained among the three PDCCH candidates included in CORESET#0 and the number of lost CCEs are shown in Table 2.

[0126] Table 2 The PDCCH candidate with the most CCEs among the three PDCCH candidates in CORESET#0 and the number of lost CCEs

[0127] When AL is 8 and the mapping mode is non-interleaved mapping, the PDCCH candidates {CCE0, CCE1, CCE2, CCE3, CCE4, CCE5, CCE6, CCE7} contained in CORESET#0 lose 0.5 CCEs. The number of valid CCEs is 7.5.

[0128] When AL is equal to 8 and the mapping mode is interleaved mapping, for different n shiftThe PDCCH candidates {CCE0, CCE1, CCE2, CCE3, CCE4, CCE5, CCE6, CCE7} in CORESET#0 may lose 2.5, 3, 3.5, or 4 CCEs. Correspondingly, the number of valid CCEs is 5.5, 5, 4.5, or 4.

[0129] Case 4: The number of symbols occupied by CORESET#0 in the time domain is 3, and the bandwidth of CORESET#0 is 20 RBs

[0130] The number of CCEs included in CORESET#0 before puncturing is equal to 12. The supported aggregation level AL can be 4 or 8. As shown in Figure 8, Figure 8 shows the different n shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the value. In Figure 8, the vertical axis represents frequency, from low to high, representing low frequency to high frequency. One CCE occupies two RBs in the frequency domain.

[0131] When AL is equal to 4, the PDCCH candidates contained in CORESET#0 are divided into {CCE0, CCE 1, CCE 2, CCE 3}, {CCE 4, CCE 5, CCE 6, CCE 7} and {CCE 8, CCE 9, CCE 10, CCE 11}.

[0132] When AL is equal to 4 and the mapping mode is interleaved mapping, for different n shift The value is selected, and the PDCCH candidate with the most CCEs among the three PDCCH candidates included in CORESET#0 is not lost. Accordingly, the number of valid CCEs is 4.

[0133] When AL is equal to 8 and the mapping mode is interleaved mapping, for different n shift The PDCCH candidates {CCE0, CCE1, CCE2, CCE3, CCE4, CCE5, CCE6, CCE7} in CORESET#0 may lose 0, 1, or 2 CCEs. Correspondingly, the number of valid CCEs is 8, 7, or 6.

[0134] Summarizing cases 3 and 4, when the number of symbols occupied in the CORESET#0 time domain is 3, for the same AL value, the mapping method is interleaved mapping. shift The effective CCEs corresponding to different values ​​of are inconsistent; when the number of symbols occupied by CORESET#0 in the time domain is 3, when AL is equal to 4 and the bandwidth of CORESET#0 is 15 RBs, the transmission performance of non-interleaved mapping is better than that of interleaved mapping.

[0135] Summarizing cases 1 to 4, when AL is equal to 8 and interleaved mapping is used, the bandwidth of CORESET#0 is 15 RBs or 20 RBs, and the number of symbols occupied in the CORESET#0 time domain is 3, part n shift The corresponding transmission performance is better than when the number of symbols occupied in the CORESET#0 time domain is 2. shift Corresponding transmission performance.

[0136] As shown in Table 3, the transmission performance differences under different parameter configurations are summarized.

[0137] Table 3 Number of lost CCEs and number of valid CCEs under different parameter configurations

[0138] As shown in Table 3, under some parameter configurations, the number of lost CCEs is 0, while under other parameter configurations, the number of lost CCEs is large, and the transmission performance is poor. Therefore, it is necessary to design a new method to prevent CORESET#0 from adopting a parameter configuration with poor transmission performance, thereby ensuring better transmission performance. It should be understood that when the number of available RBs in the channel is 12 RBs, there is no need to puncture CORESET#0. Therefore, the transmission performance difference summarized in Table 3 is not for the case where the number of available RBs in the channel is 12 RBs. However, the method provided in the embodiment of the present application can still be applied to the case where the number of available RBs in the channel is 12 RBs, and can also be applied to the case where the transmission bandwidth of CORESET#0 is 12 RBs, and this application does not limit it.

[0139] The following further describes a communication method and a communication device provided in an embodiment of the present application:

[0140] In one embodiment of the present application, a communication method is provided. Refer to Figure 9, which is a flow chart of a communication method 100. In the following description, the method is applied to the network architecture diagram shown in Figure 1 as an example. For ease of introduction, the following description takes the method being performed by a network device and a terminal device as an example. Because the embodiment of the present application is based on the application in the network architecture shown in Figure 1 as an example. Therefore, the network device described below is, for example, an access network device in the network architecture shown in Figure 1, and the terminal device described below can be a terminal device in the network architecture shown in Figure 1.

[0141] S101: A network device sends first indication information and a cell identifier, and a terminal device receives the first indication information and the cell identifier, wherein the first indication information indicates that the mapping mode of the first control resource set 0, CORESET#0, is interleaving.

[0142] The network device may send the first indication information and the cell identifier at different times and via different signaling. This application does not limit the order in which the network device sends the first indication information and the cell identifier. Correspondingly, the terminal device may receive the information at different times and via different signaling. The order is not limited.

[0143] The first indication information is used to indicate relevant parameters of the first CORESET#0. Optionally, the first indication information is carried in the MIB. The first indication information can be carried in the MIB, or in the PBCH, or in a broadcast message. The first indication information can be sent periodically.

[0144] Specifically, the first indication information is an index value carried in the MIB, and the index value is used to determine the first parameter configuration corresponding to the index value from the K parameter configurations. The first parameter configuration is the relevant parameters of the first CORESET#0 mentioned above. In one implementation, the mapping mode corresponding to the first parameter configuration is interleaved mapping. Any parameter configuration in the K parameter configurations includes one or more of the following parameters, or any parameter configuration in the K parameter configurations consists of one or more of the following parameters: number of resource blocks (RBs), frequency domain resource offset value, number of time domain symbols, mapping mode, and multiplexing mode. If the bandwidth of the first CORESET#0 is 12 RBs, the number of RBs indicated by the first parameter configuration is 12; if the bandwidth of the first CORESET#0 is 15 RBs, the number of RBs indicated by the first parameter configuration is 24; if the bandwidth of the first CORESET#0 is 20 RBs, the number of RBs indicated by the first parameter configuration is 24. The number of time domain symbols is the number of symbols occupied by the first CORESET#0 in the time domain. The mapping mode is interleaved mapping or non-interleaved mapping. Optionally, the first indication information may be N bits, and different values ​​of the N bits may indicate different parameter configurations among the K parameter configurations. Further, N may be 4, and K may be less than or equal to 2. N An integer, specifically, K can be 12.

[0145] Optionally, the cell identifier is carried in a synchronization signal, and further, may be carried in a primary synchronization signal or a secondary synchronization signal. Alternatively, it may be carried partially in a primary synchronization signal and partially in a secondary synchronization signal, and the cell identifier is formed by combining the two. Therefore, the cell identifier may be carried in multiple signals transmitted at multiple times. Specifically, the manner in which the cell identifier is carried by the primary synchronization signal and the secondary synchronization signal can be found in Chapter 7.4.2 of 3GPP TS 38.211 V17.4.0.

[0146] S102: The network device determines the interleaving mapping order of the first CORESET#0 according to a first parameter, wherein the value of the first parameter is related to the cell identifier.

[0147] S103: The terminal device determines the interleaving mapping order of the first CORESET#0 according to the first parameter, wherein the value of the first parameter is related to the cell identifier.

[0148] To ensure interoperability between the network device and the terminal device when transmitting and receiving signals, both the network device and the terminal device determine the interleaving mapping order of the first CORESET #0 based on the same first parameter. It should be understood that for the network device, the time sequence of S101 and S102 can be implemented in different ways, and therefore, this application does not impose any restrictions. For the terminal device, S101 precedes S103.

[0149] In a possible implementation, the network device and the terminal device determine the interleaving mapping order of the first CORESET#0 according to the mapping function f(.) as described above. The interleaving mapping parameters include: the number of interleaving rows R, the offset value n shift And the number of REGs contained in each REG bundle, L. For CORESET#0, R is equal to 2 and L is equal to 6. shift When the value of is different, the interleaving mapping order of CCE and REG bundle is different, and the number of valid CCEs may also change accordingly. Therefore, the first parameter can be n shift The first parameter may also be represented by other symbols, and the following description will be based on the first parameter. The network device and the terminal device can determine the interleaving mapping order of the first CORESET#0 based on the first parameter and the above-mentioned mapping function. The value of the first parameter is related to the cell identifier.

[0150] Optionally, the cell ID value ranges from 0 to 1007.

[0151] In one possible implementation, the first CORESET#0 is a punctured CORESET#0. For example, when the bandwidth of the first CORESET#0 is 15 RBs, the first CORESET#0 is a 15-RB CORESET#0 obtained by puncturing the 9 highest-numbered RBs in a 24-RB CORESET#0. For example, when the bandwidth of the first CORESET#0 is 20 RBs, the first CORESET#0 is a 20-RB CORESET#0 obtained by puncturing the 4 highest-numbered RBs in a 24-RB CORESET#0.

[0152] As mentioned above, under some parameter configurations, the transmission performance of CORESET#0 is poor. Therefore, the value of the first parameter can be restricted to prevent CORESET#0 from adopting parameter configurations with poor transmission performance, thereby ensuring good transmission performance.

[0153] In one possible implementation, the value of the first parameter can be directly restricted. This value can be applicable to situations where one or more of the following values ​​are taken: the number of resource blocks (RBs) of the first CORESET#0 indicated by the first indication information, the bandwidth of the first CORESET#0, the aggregation level of the first CORESET#0, and the number of symbols occupied by the first CORESET#0 in the time domain. In another possible implementation, the value of the first parameter is further related to one or more of the following: the number of resource blocks (RBs) of the first CORESET#0 indicated by the first indication information, the bandwidth of the first CORESET#0, the aggregation level of the first CORESET#0, and the number of symbols occupied by the first CORESET#0 in the time domain. In this way, the value of the first parameter can be restricted under specific parameter configurations.

[0154] Specifically, the first parameter can be limited as follows:

[0155] Solution 1: The value of the first parameter is an even number. Furthermore, when the aggregation level of the first CORESET#0 is 4 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of the first parameter is an even number. Thus, when the AL is 4 and / or the bandwidth of the first CORESET#0 is 15 RBs, the number of effective CCEs in the first CORESET#0 can be greater than 3, ensuring good transmission performance.

[0156] Optionally, the value of the first parameter is one of 0, 2, 4, 6, 8, 10, ..., M, or the value range of the first parameter is 0, 2, 4, 6, 8, 10, ..., M. Exemplarily, the maximum cell identifier of NR is equal to 1007, so the value of M can be equal to 1006 or an even number less than 1006.

[0157] Optionally, the value of the first parameter is defined as n=2*Cell_ID, where Cell_ID is the cell identifier. It should be understood that the first parameter may also be an even multiple of 4, 6, or 8 times the cell identifier.

[0158] Optionally, the value of the first parameter is defined as Where Cell_ID is the cell ID. In this case, the first parameter is equal to half of the cell ID and rounded down, which can be understood as the partial even number in the cell ID. Optionally, this definition can also be multiplied by an integer greater than 1, such as 2, 3, 4, or 5. For example, when the integer greater than 1 is 2, a variation of the above formula is

[0159] Solution 2: The value of the first parameter satisfies n=α*a+K, where n is the value of the first parameter, α is the multiplication coefficient, which can be 3 or an integer multiple of 6, a is any integer, and K is a non-negative integer less than α.

[0160] Exemplarily, α=6, K is a non-negative integer less than 6. Furthermore, the value set to which the value of K belongs consists of one or more of 0, 1, 3, 4 or 5. The following is explained using α=6 as an example. When α is an integer multiple of 6, α can be expressed as α=6*x, where x is a positive integer. In this case, K is a non-negative integer less than α=6*x. When α is an integer multiple of 6, the value set to which the value of K belongs satisfies {k x}={k6}+(X-1)*6, where {k x} represents the numerical set to which the value of K belongs when α=6*x, {k6} represents the numerical set to which the value of K belongs when α is 6, and X takes all values ​​from 1 to x. Exemplarily, when α=12, the numerical set to which the value of K belongs is the union of the numerical set {k6}+(1-1)*6 and the numerical set {k6}+(2-1)*6. For example, if when α=6, the numerical set to which the value of K belongs consists of 0, 1, 3, 4 and 5, then when α=12, the numerical set to which the value of K belongs consists of 0, 1, 3, 4 and 5 and 6, 7, 9, 10 and 11. Exemplarily, α=3, the value of the first parameter satisfies n=3*a+K. K is a non-negative integer less than 3. Further, the value of K is 0, or the value of K is 1, or the numerical set to which the value of K belongs consists of 0 and 1.

[0161] In one implementation of Solution 2, the value of K is 0, that is, the value of the first parameter satisfies n=6*a. In this case, the value of the first parameter is an integer multiple of 6, that is, 0, 6, 12, 18, .... Further, when the bandwidth of the first CORESET#0 can be 15 RBs and / or 20 RBs, the value of K is 0. Or, when the number of resource blocks (RBs) of the first CORESET#0 indicated by the first indication information is 24, the value of K is 0. Or, when the aggregation level AL of the first CORESET#0 is equal to 4 and / or 8, the value of K is 0. In this way, when AL is 4 or 8, and / or the bandwidth of the first CORESET#0 is 15 RBs or 20 RBs, the first CORESET#0 can obtain the minimum CCE loss under this parameter configuration, ensuring good transmission performance.

[0162] Optionally, the value of the first parameter is defined as n=6*Cell_ID, where Cell_ID is a cell identifier.

[0163] In another implementation of Solution 2, the value of K is one of 0, 1, 3, 4, or 5, or the value of K belongs to a first value set consisting of one or more of 0, 1, 3, 4, or 5. The value of the first parameter satisfies n = 6*a + K. In this case, the value of the first parameter is one of 6*a, 6*a+1, 6*a+3, 6*a+4, and 6*a+5. Furthermore, when the bandwidth of the first CORESET#0 is 15 RBs and / or the aggregation level AL of the first CORESET#0 is 8, the value of K is one of 0, 1, 3, 4, or 5, or the value of K belongs to a first value set consisting of one or more of 0, 1, 3, 4, or 5. In this way, when AL is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the CCE loss of the first CORESET#0 is less than 4 CCEs, ensuring good transmission performance.

[0164] Optionally, the value of the first parameter is defined as n=6*Cell_ID+K, where Cell_ID is a cell identifier. The value of K is one of 0, 1, 3, 4, or 5, or the value of K belongs to a first value set consisting of one or more of 0, 1, 3, 4, or 5.

[0165] Optionally, the value of the first parameter is defined as n=(Cell_ID) mod 5 + 3, where Cell_ID is the cell identifier and () mod is the modulo calculation. In this case, the possible values ​​of n are 3, 4, 5, 6, or 7.

[0166] In another implementation of Solution 2, the value of K is one of 0, 4, or 5, or the value of K belongs to a second value set, and the second value set consists of one or more of 0, 4, or 5. The value of the first parameter satisfies n=6*a+K. In this case, the value of the first parameter is one of 6*a, 6*a+4, and 6*a+5. Furthermore, when the bandwidth of the first CORESET#0 is 15 RBs and / or the aggregation level AL of the first CORESET#0 is 8, the value of K is one of 0, 4, or 5, or the value of K belongs to a second value set, and the second value set consists of one or more of 0, 4, or 5. In this way, when AL is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the CCE loss of the first CORESET#0 is less than 3 CCEs, ensuring good transmission performance.

[0167] Optionally, the value of the first parameter is defined as n=6*Cell_ID+K, where Cell_ID is a cell identifier. The value of K is one of 0, 4, or 5, or the value of K belongs to a second value set, and the second value set consists of one or more of 0, 4, or 5.

[0168] Optionally, the value of the first parameter is defined as n=(Cell_ID) mod 3 + 4, where Cell_ID is the cell identifier and () mod is the modulo calculation. In this case, the possible values ​​of n are 4, 5, or 6.

[0169] In another implementation of Solution 2, the value of K is one of 0, 1, or 5, or the value of K belongs to a third value set, and the third value set consists of one or more of 0, 1, or 5. The value of the first parameter satisfies n=6*a+K. In this case, the value of the first parameter is one of 6*a, 6*a+1, and 6*a+5. Further, when the bandwidth of the first CORESET#0 is 20 RBs and / or the aggregation level AL of the first CORESET#0 is equal to 8, the value of K is one of 0, 1, or 5, or the value of K belongs to a third value set, and the third value set consists of one or more of 0, 1, or 5. In this way, when AL is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the CCE loss of the first CORESET#0 is less than 2 CCEs, ensuring good transmission performance.

[0170] Optionally, the value of the first parameter is defined as n=6*Cell_ID+K, where Cell_ID is a cell identifier. The value of K is one of 0, 1, or 5, or the value of K belongs to a third value set consisting of one or more of 0, 1, or 5.

[0171] Optionally, the value of the first parameter is defined as n=(Cell_ID) mod 3 + 5, where Cell_ID is the cell identifier and () mod is the modulo calculation. In this case, the possible values ​​of n are 5, 6, or 7.

[0172] In another implementation of Solution 2, the value of K is 0. The value of the first parameter satisfies n = 6*a. In this case, the value of the first parameter is one of 6*a. Furthermore, when the bandwidth of the first CORESET#0 is 20 RBs and / or the aggregation level AL of the first CORESET#0 is 8, the value of K is 0. Thus, when AL is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the first CORESET#0 does not lose CCEs, ensuring good transmission performance.

[0173] Optionally, the value of the first parameter is defined as n=6*Cell_ID, where Cell_ID is a cell identifier.

[0174] In another implementation of Solution 2, the value of K is one of 0 or 4, or the value of K belongs to a fourth value set, and the fourth value set consists of one or more of 0 or 4. The value of the first parameter satisfies n=6*a+K. In this case, the value of the first parameter is one of 6*a and 6*a+4. Further, when the bandwidth of the first CORESET#0 is 15RB, the value of K is one of 0 or 4, or the value of K belongs to a fourth value set, and the fourth value set consists of one or more of 0 or 4. In this way, when the bandwidth of the first CORESET#0 is 15RB, the CCE loss of the first CORESET#0 is less than 3 CCEs, ensuring better transmission performance. In this case, the aggregation level AL of the first CORESET#0 can be equal to 8 or 4.

[0175] Optionally, the value of the first parameter is defined as n=6*Cell_ID+K, where Cell_ID is a cell identifier, and the value of K is one of 0 and 4, or the value of K belongs to a fourth value set consisting of one or more of 0 and 4.

[0176] In another implementation of Solution 2, the value of K is one of 0 or 5, or the value of K belongs to the fifth value set, and the fifth value set consists of one or more of 0 or 5. The value of the first parameter satisfies n=6*a+K. In this case, the value of the first parameter is one of 6*a and 6*a+5. Further, when the aggregation level AL of the first CORESET#0 is equal to 8, the value of K is one of 0 or 5, or the value of K belongs to the fifth value set, and the fifth value set consists of one or more of 0 or 5. In this way, when AL is 8, the CCE loss of the first CORESET#0 is less than 3 CCEs, ensuring good transmission performance. At this time, the bandwidth of the first CORESET#0 is 20RB or 15RB.

[0177] Optionally, the value of the first parameter is defined as n=6*Cell_ID+K, where Cell_ID is a cell identifier, and the value of K is one of 0 and 5, or the value of K belongs to a fifth value set consisting of one or more of 0 and 5.

[0178] Optionally, the value of the first parameter is defined as n=(Cell_ID) mod 2 + 5, where Cell_ID is the cell identifier and () mod is a modulo calculation. In this case, the possible value of n is 5 or 6.

[0179] It can be understood that when the first parameter and the cell identifier are represented in binary, the network device and the terminal device may only calculate the values ​​of some bits in the lower order of all bits without calculating the complete value.

[0180] The above-mentioned limiting scheme for the first parameter is applicable to the case where the number of symbols occupied by the first CORESET#0 in the time domain is 3. It can be understood that based on the above summary of Case 1 and Case 2, when the number of symbols occupied by the first CORESET#0 in the time domain is 2, different values ​​of the first parameter do not affect the transmission performance of the first CORESET#0. However, the above-mentioned limiting scheme for the first parameter can still be applied to the case where the number of symbols occupied by the first CORESET#0 in the time domain is 2, and this application does not impose any limitation.

[0181] S104: The network device sends control information on the first CORESET#0. Correspondingly, the terminal device receives the control information on the first CORESET#0. S104 is an optional step and is not shown in the figure.

[0182] The network device may send a PDCCH on a PDCCH candidate in the first CORESET#0, wherein the PDCCH carries control information, and the terminal device receives the control information accordingly.

[0183] In another embodiment of the present application, a communication method is provided. Referring to FIG10 , which is a flow chart of a communication method 200. In the following description, the method is applied to the network architecture diagram shown in FIG1 as an example. For ease of introduction, the following description takes the method being performed by a network device and a terminal device as an example. Because the embodiment of the present application is based on the application in the network architecture shown in FIG1 as an example. Therefore, the network device described below is, for example, an access network device in the network architecture shown in FIG1, and the terminal device described below can be a terminal device in the network architecture shown in FIG1.

[0184] S201: A network device determines first indication information, where the first indication information is used to determine a time-frequency resource location of a first CORESET#0.

[0185] S202: The network device sends the first indication information, and correspondingly, the terminal device receives the first indication information.

[0186] S203: The terminal device determines the time-frequency resource location of the first CORESET#0 according to the first indication information.

[0187] S204: The network device sends control information on the first CORESET#0. Correspondingly, the terminal device receives the control information on the first CORESET#0. S204 is an optional step and is not shown in the figure. S204 can refer to S104.

[0188] For a description of the first indication information, reference may be made to the description of the first indication information in the embodiment shown in FIG9 . The first indication information may indicate that the number of symbols occupied by the first CORESET#0 in the time domain is 2 or 3. The first indication information may also indicate whether the mapping mode of the first CORESET#0 is interleaved or non-interleaved.

[0189] As previously mentioned, under certain parameter configurations, the transmission performance of CORESET #0 is poor. Therefore, the values ​​of parameters related to the first CORESET #0 indicated by the network device under specific conditions can be restricted. This prevents the first CORESET #0 from adopting parameter configurations with poor transmission performance, thereby ensuring good transmission performance.

[0190] In one possible implementation, when the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved. Further, when the bandwidth of the first CORESET#0 is 15 RBs and the first condition is met, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved.

[0191] The first condition includes one or more of the following: the aggregation level of the first CORESET#0 is 4, the aggregation level of the first CORESET#0 is 8, the number of symbols occupied by the first CORESET#0 in the time domain is 2, and the number of symbols occupied by the first CORESET#0 in the time domain is 3. The aggregation level of the first CORESET#0 is 4 and the aggregation level of the first CORESET#0 is 8, which are not included in the first condition at the same time. The number of symbols occupied by the first CORESET#0 in the time domain is 2 and the number of symbols occupied by the first CORESET#0 in the time domain is 3, which are not included in the first condition at the same time. When the first condition includes multiple sub-conditions, the sub-conditions included in the first condition must be met simultaneously.

[0192] In one implementation of the first condition, the first condition is that the aggregation level of the first CORESET#0 is 4. That is, when the bandwidth of the first CORESET#0 is 15 RBs and the aggregation level of the first CORESET#0 is 4, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved. In this way, when the bandwidth of the first CORESET#0 is 15 RBs and the aggregation level of the first CORESET#0 is 4, the first CORESET#0 does not lose CCEs. In this implementation, the number of time-domain symbols is not limited.

[0193] In another implementation of the first condition, the first condition is that the number of symbols occupied by the first CORESET#0 in the time domain is 3. That is, when the bandwidth of the first CORESET#0 is 15 RBs and the number of symbols occupied by the first CORESET#0 in the time domain is 3, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved. In this way, when the bandwidth of the first CORESET#0 is 15 RBs and the number of symbols occupied by the first CORESET#0 in the time domain is 3, the number of CCEs lost by the first CORESET#0 is smaller. In this implementation, the aggregation level is not restricted.

[0194] In another implementation of the first condition, the first condition is that the number of symbols occupied by the first CORESET#0 in the time domain is 3, and the aggregation level of the first CORESET#0 is 8. That is, when the bandwidth of the first CORESET#0 is 15 RBs, the number of symbols occupied by the first CORESET#0 in the time domain is 3, and the aggregation level of the first CORESET#0 is 8, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaving. In this way, when the bandwidth of the first CORESET#0 is 15 RBs, the number of symbols occupied by the first CORESET#0 in the time domain is 3, and the aggregation level of the first CORESET#0 is 8, the number of CCEs lost by the first CORESET#0 is smaller.

[0195] In another possible implementation, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. Further, when the bandwidth of the first CORESET#0 is 15 or 20 RBs and the second condition is met, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

[0196] The second condition includes one or more of the following: the aggregation level of the first CORESET#0 is 8, the mapping mode of the first CORESET#0 is interleaved, the mapping mode of the first CORESET#0 is non-interleaved, the bandwidth of the first CORESET#0 is 15 RBs, and the bandwidth of the first CORESET#0 is 20 RBs. The mapping mode of the first CORESET#0 is interleaved and the mapping mode of the first CORESET#0 is non-interleaved are not both included in the second condition. The bandwidth of the first CORESET#0 is 15 RBs and the bandwidth of the first CORESET#0 is 20 RBs are not both included in the second condition. When the second condition includes multiple sub-conditions, all sub-conditions included in the second condition must be met simultaneously.

[0197] In one implementation of the second condition, the second condition is that the aggregation level of the first CORESET#0 is 8, and the bandwidth of the first CORESET#0 is 15 RBs. That is, when the bandwidth of the first CORESET#0 is 15 RBs and the aggregation level of the first CORESET#0 is 8, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. Thus, when the bandwidth of the first CORESET#0 is 15 RBs and the aggregation level of the first CORESET#0 is 8, the number of CCEs lost by the first CORESET#0 is smaller. In this implementation, the mapping method is not restricted.

[0198] In another implementation of the second condition, the second condition is that the aggregation level of the first CORESET#0 is 8, the bandwidth of the first CORESET#0 is 20 RBs, and the mapping mode of the first CORESET#0 is interleaved. That is, when the bandwidth of the first CORESET#0 is 20 RBs, the aggregation level of the first CORESET#0 is 8, and the mapping mode of the first CORESET#0 is interleaved, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. In this way, the first CORESET#0 does not lose CCEs. In this implementation, the mapping mode is not restricted.

[0199] In another possible implementation, the embodiment shown in FIG. 10 may also be combined with the embodiment shown in FIG. 9 .

[0200] Method 200 may also include step S205: the network device sends a cell identifier, and the terminal device receives the cell identifier accordingly. The value of the first parameter is related to the cell identifier, wherein the first parameter is used to determine the interleaving mapping order of CORESET#0. Step S205 is not shown in the figure.

[0201] For the description of the cell identifier, reference may be made to the description of the cell identifier in the embodiment shown in Figure 9. For the time sequence between steps S205 and S201-203, reference may be made to the description in the embodiment shown in Figure 9.

[0202] The first parameter is used to determine the interleaving mapping order of CORESET#0. In a possible implementation, the network device and the terminal device determine the interleaving mapping order of CORESET#0 according to the mapping function f(.) as described above. shift When the value of is different, the interleaving mapping order of CCE and REG bundle is different, and the number of valid CCEs may also change accordingly. Therefore, the first parameter can be n shiftThe first parameter may also be represented by other symbols. The following description will be based on the first parameter. The network device and the terminal device can determine the interleaving mapping order of CORESET#0 based on the first parameter and the above mapping function. Optionally, the cell identifier value ranges from 0 to 1007.

[0203] The value of the first parameter is related to the cell identifier.

[0204] In one implementation of the first parameter, the value of the first parameter is equal to the cell identifier. Reference may be made to the conditions satisfied by the value of the first parameter in the first parameter limitation scheme in the embodiment shown in FIG9 . When the value of the first parameter in the embodiment shown in FIG10 does not satisfy the conditions described in the embodiment shown in FIG9 , the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved.

[0205] For example, in the scheme 1 provided in the embodiment shown in FIG9 , the value of the first parameter is an even number. Further, when the aggregation level of the first CORESET#0 is 4 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of the first parameter is an even number. Then, in the embodiment shown in FIG10 , when the value of the first parameter is not an even number, or the value of the first parameter is an odd number, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved. Further, in the embodiment shown in FIG10 , when the aggregation level of the first CORESET#0 is 4 and / or the bandwidth of the first CORESET#0 is 15 RBs, when the value of the first parameter is not an even number, or the value of the first parameter is an odd number, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved.

[0206] For another example, in the second solution provided in the embodiment shown in FIG9 , the value of the first parameter satisfies n=6*a+K. Where n is the value of the first parameter, and K is a non-negative integer less than 6. Then, in the embodiment shown in FIG10 , when the value of the first parameter does not satisfy n=6*a+K, and K is a non-negative integer less than 6, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved. In a possible implementation, the value set to which the value of K belongs consists of 0, 1, 3, 4, and 5. Then, the value of the first parameter does not satisfy n=6*a+K, which can be understood as the value of the first parameter satisfying n=6*a+J, where the value of J is 2.

[0207] For another example, in an implementation of Solution 2 provided in the embodiment shown in FIG9 , the value of the first parameter satisfies n=6*a+K. Here, n is the value of the first parameter, and the value of K is one of 0, 4, or 5, or the value of K belongs to a second value set consisting of one or more of 0, 4, or 5. Furthermore, when the bandwidth of the first CORESET#0 is 15 RBs and / or the aggregation level AL of the first CORESET#0 is 8, the value of K is one of 0, 4, or 5, or the value of K belongs to a second value set consisting of one or more of 0, 4, or 5. Then, in the embodiment shown in FIG10 , when the value of the first parameter does not satisfy n=6*a+K, the value of K is one of 0, 4, or 5, or the value of K belongs to the second value set consisting of one or more of 0, 4, or 5, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved. Furthermore, when the bandwidth of the first CORESET#0 is 15 RBs and / or the aggregation level AL of the first CORESET#0 is 8, when the value of the first parameter does not satisfy n=6*a+K, the value of K is one of 0, 4, or 5, or the value of K belongs to a second value set, and the second value set consists of one or more of 0, 4, or 5, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved. In a possible implementation, the value set to which the value of K belongs consists of 0, 4, and 5. Then, the value of the first parameter does not satisfy n=6*a+K, which can be understood as the value of the first parameter satisfying n=6*a+J, where the value range of J is 1, 2, and 3.

[0208] In another implementation of the first parameter, the value of the first parameter satisfies n=α*a+K, where n is the value of the first parameter, α is a multiplication coefficient, α may be an integer multiple of 3 or 6, a is any integer, and K is a non-negative integer less than α.

[0209] For example, α=6, and K is a non-negative integer less than 6. Furthermore, the value of K belongs to a numerical set consisting of 0, 1, 3, 4, and 5. The following description takes α=6 as an example. When α can be 3 or an integer multiple of 6, please refer to the relevant description in Figure 9.

[0210] Optionally, the value of the first parameter is defined as n=6*Cell_ID+K, where Cell_ID is a cell identifier. The value of K is one of 0, 1, 3, 4, or 5, or the value of K belongs to a first value set consisting of 0, 1, 3, 4, and 5.

[0211] For example, α=6, and K is a non-negative integer less than 6. Furthermore, the value of K belongs to a numerical set consisting of one or more of 0, 1, 3, 4, or 5. The following description takes α=6 as an example. When α can be 3 or an integer multiple of 6, refer to the relevant description in Figure 9.

[0212] Optionally, the value of the first parameter is defined as n=6*Cell_ID+K, where Cell_ID is a cell identifier. The value of K is one of 0, 1, 3, 4, or 5, or the value of K belongs to a first value set consisting of one or more of 0, 1, 3, 4, or 5.

[0213] Further referring to the above description, when the bandwidth of the first CORESET #0 is 15 RBs, the first indication information indicates that the mapping mode of the first CORESET #0 is non-interleaved. Alternatively, when the bandwidth of the first CORESET #0 is 15 RBs and the first condition is met, the first indication information indicates that the mapping mode of the first CORESET #0 is non-interleaved. The first condition can refer to the above description of the first condition.

[0214] In a possible embodiment, when the bandwidth of the first CORESET#0 is 15 RBs, the aggregation level of the first CORESET#0 is 4, and the value of K is 1, 3, or 5, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaving. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

[0215] In another possible embodiment, when the bandwidth of the first CORESET#0 is 15 RBs, the aggregation level of the first CORESET#0 is 8, the number of symbols occupied by the first CORESET#0 in the time domain is 3, and the value of K is 1 or 3, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaving. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

[0216] With further reference to the above description, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. Alternatively, when the bandwidth of the first CORESET#0 is 15 or 20 RBs and the second condition is met, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. For the second condition, reference may be made to the above description of the second condition.

[0217] In a possible embodiment, when the bandwidth of the first CORESET#0 is 15 RBs, the aggregation level of the first CORESET#0 is 8, the mapping mode of the first CORESET#0 is interleaving, and the value of K is 1 or 3, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

[0218] In another possible embodiment, when the bandwidth of the first CORESET#0 is 20 RBs, the aggregation level of the first CORESET#0 is 8, the mapping mode of the first CORESET#0 is interleaving, and the value of K is 3 or 4, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. In this way, the first CORESET#0 loses fewer CCEs, thereby ensuring better transmission performance.

[0219] In another possible embodiment, when the bandwidth of the first CORESET#0 is 20 RBs, the aggregation level of the first CORESET#0 is 8, the mapping mode of the first CORESET#0 is interleaving, and the value of K is 1, 3, 4, or 5, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

[0220] In another implementation of the first parameter, the value of the first parameter is defined as n = (Cell_ID) mod 5 + 3, where Cell_ID is the cell identifier and () mod is the modulo calculation. In this case, the possible values ​​of n are 3, 4, 5, 6, or 7.

[0221] Further referring to the above description, when the bandwidth of the first CORESET #0 is 15 RBs, the first indication information indicates that the mapping mode of the first CORESET #0 is non-interleaved. Alternatively, when the bandwidth of the first CORESET #0 is 15 RBs and the first condition is met, the first indication information indicates that the mapping mode of the first CORESET #0 is non-interleaved. The first condition can refer to the above description of the first condition.

[0222] In a possible embodiment, when the bandwidth of the first CORESET#0 is 15 RBs, the aggregation level of the first CORESET#0 is 4, and the value of K is 3, 5, or 7, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaving. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

[0223] In another possible embodiment, when the bandwidth of the first CORESET#0 is 15 RBs, the aggregation level of the first CORESET#0 is 8, the number of symbols occupied by the first CORESET#0 in the time domain is 3, and the value of K is 3 or 7, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaving. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

[0224] With further reference to the above description, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. Alternatively, when the bandwidth of the first CORESET#0 is 15 or 20 RBs and the second condition is met, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. For the second condition, reference may be made to the above description of the second condition.

[0225] In a possible embodiment, when the bandwidth of the first CORESET#0 is 15 RBs, the aggregation level of the first CORESET#0 is 8, the mapping mode of the first CORESET#0 is interleaving, and the value of K is 3 or 7, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

[0226] In another possible embodiment, when the bandwidth of the first CORESET#0 is 20 RBs, the aggregation level of the first CORESET#0 is 8, the mapping mode of the first CORESET#0 is interleaving, and the value of K is 3 or 4, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. In this way, the first CORESET#0 loses fewer CCEs, thereby ensuring better transmission performance.

[0227] In another possible embodiment, when the bandwidth of the first CORESET#0 is 20 RBs, the aggregation level of the first CORESET#0 is 8, the mapping mode of the first CORESET#0 is interleaving, and the value of K is 3, 4, 5, or 7, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

[0228] It should be understood that in the embodiments of the present application, "when" and "under..." only limit the behavior of the execution subject under these conditions, and this application does not limit the behavior that is not under these conditions.

[0229] Figure 12 shows a schematic diagram of the structure of another communication device. The communication device 1800 can be a terminal device or network device in the above method embodiment, or can also be a chip, chip system, or processor that supports the terminal device or network device to implement the above method. This communication device can be used to implement the method described in the above method embodiment. For details, please refer to the description of the above method embodiment.

[0230] The communication device 1800 may include one or more processors 1801. The processor 1801 may be a general-purpose processor or a dedicated processor. For example, it may be a baseband processor or a central processing unit (CPU). The baseband processor may be used to process communication protocols and communication data, while the CPU may be used to control the communication device (e.g., a base station, a baseband chip, a terminal, a terminal chip, a DU or a CU), execute software programs, and process software program data.

[0231] Optionally, the communication device 1800 may include one or more memories 1802, on which instructions 1804 may be stored. The instructions may be executed on the processor 1801, causing the communication device 1800 to perform the method described in the above method embodiment. Optionally, the memory 1802 may also store data. The processor 1801 and memory 1802 may be provided separately or integrated together.

[0232] Optionally, the communication device 1800 may further include a transceiver 1805 and an antenna 1806. The transceiver 1805 may be referred to as a transceiver unit, a transceiver, or a transceiver circuit, and is configured to implement transceiver functions. The transceiver 1805 may include a receiver and a transmitter. The receiver may be referred to as a receiver or a receiving circuit, and is configured to implement a receiving function; the transmitter may be referred to as a transmitter or a transmitting circuit, and is configured to implement a transmitting function. The processing unit 1702 shown in FIG11 may be the processor 1801. The transceiver unit 1701 may be the transceiver 1805.

[0233] When the communication device is applied to a terminal device:

[0234] The transceiver 1805 or the transceiver unit 1701 can complete the receiving action in the above embodiment S101 or S102. The processor 1801 or the processing unit 1702 can complete the determining action in the above embodiment S102.

[0235] When the communication device is applied to a network device:

[0236] The transceiver 1805 or the transceiver unit 1701 can complete the sending action in the above embodiment S101. The processor 1801 or the processing unit 1702 can complete the determining action or the generating action in the above embodiment S101, or the indicating action in the above embodiment S102.

[0237] In another possible design, processor 1801 may include a transceiver for implementing receiving and transmitting functions. For example, the transceiver may be a transceiver circuit, an interface, or an interface circuit. The transceiver circuit, interface, or interface circuit for implementing the receiving and transmitting functions may be separate or integrated. The transceiver circuit, interface, or interface circuit may be used for reading and writing code / data, or the transceiver circuit, interface, or interface circuit may be used for transmitting or delivering signals.

[0238] In another possible design, processor 1801 may optionally store instructions 1803. Instructions 1803, when executed on processor 1801, may cause communication device 1800 to perform the method described in the above method embodiment. Instructions 1803 may be fixed in processor 1801. In this case, processor 1801 may be implemented by hardware.

[0239] In another possible design, communication device 1800 may include a circuit, and the circuit can implement the function of transmitting or receiving or communicating the communication device or the first terminal device in the aforementioned method embodiment. The processor and transceiver described in the embodiment of the present application can be implemented in an integrated circuit (iMtegrated circuit, IC), an analog IC, a radio frequency integrated circuit RFIC, a mixed signal IC, an application specific integrated circuit (application specific iMtegrated circuit, ASIC), a printed circuit board (printed circuit board, PCB), an electronic device, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal oxide semiconductor (complementary metal oxide semiconductor (CMOS), M-type metal oxide semiconductor (MKOS), p-type metal oxide semiconductor (positive CMOS), bipolar junction transistor (Bipolar Junction Transistor, BJT), bipolar CKOS (BiCKOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.

[0240] The communication device described in the above embodiments may be a terminal device or a network device, but the scope of the communication device described in the embodiments of the present application is not limited thereto, and the structure of the communication device may not be limited to FIG12. The communication device may be an independent device or may be part of a larger device. For example, the communication device may be:

[0241] (1) An independent integrated circuit (IC), or chip, or chip system or subsystem;

[0242] (2) A set of one or more ICs, optionally including a storage component for storing data and instructions;

[0243] (3) ASIC, such as modem (KSK);

[0244] (4) Modules that can be embedded in other devices;

[0245] (5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handheld devices, mobile units, vehicle-mounted devices, network devices, cloud devices, artificial intelligence devices, etc.;

[0246] (6)Others, etc.

[0247] In the case where the communication device can be a chip or a chip system, please refer to the chip structure diagram shown in Figure 13. The chip 1900 shown in Figure 13 includes a processor 1901 and an interface 1902. Optionally, it may also include a memory 1903. The number of processors 1901 can be one or more, and the number of interfaces 1902 can be multiple.

[0248] For the case where the chip is used to implement the functions of the network device or terminal device in the embodiments of the present application:

[0249] The interface 1902 is used to receive or output signals;

[0250] The processor 1901 is configured to execute data processing operations of a network device or a terminal device.

[0251] It is understandable 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. They may also be combined with other features in certain scenarios as needed. Accordingly, the communication device provided in the embodiments of the present application may also implement these features or functions accordingly, which will not be described in detail here.

[0252] It should be understood that the processor in the embodiment of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by an integrated logic circuit of the hardware in the processor or an instruction in the form of software. The above processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component.

[0253] It is understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROK), a programmable read-only memory (PROK), an erasable programmable read-only memory (EPROK), an electrically erasable programmable read-only memory (EEPROK), or a flash memory. The volatile memory may be a random access memory (RAK), which is used as an external cache. By way of example and not limitation, many forms of RAK are available, such as static random access memory (SRAK), dynamic random access memory (DRAK), synchronous dynamic random access memory (SDRAK), double data rate synchronous dynamic random access memory (DDR SDRAK), enhanced synchronous dynamic random access memory (ESDRAK), synchronous linked dynamic random access memory (SLDRAK), and direct memory bus random access memory (DR RAK). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0254] The present application also provides a computer-readable medium, in which a computer program or instruction is stored. When the computer program or instruction is executed by a communication device, the functions of any of the above method embodiments are implemented.

[0255] The present application also provides a computer program product including instructions, which enables a computer to implement the functions of any of the above method embodiments when the computer reads and executes the computer program product.

[0256] In the above embodiments, all or part of the embodiments may be implemented by 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 instructions. When the computer instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present application are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated therein. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a high-density digital video disc (DVD)), or a semiconductor medium (eg, a solid state disk (SSD)).

[0257] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A communication method, characterized in that: The method comprises: receiving first indication information and a cell identifier, wherein the first indication information indicates that a mapping mode of a first control resource set 0, CORESET#0, is interleaving; An interleaving mapping order of the first CORESET#0 is determined according to a first parameter, wherein a value of the first parameter is related to the cell identifier.

2. The method according to claim 1, characterized in that The value of the first parameter is also related to one or more of the following: The number of resource blocks (RBs) of the first CORESET#0 indicated by the first indication information; The bandwidth of the first CORESET#0; the aggregation level of the first CORESET#0; or The number of symbols occupied by the first CORESET#0 in the time domain.

3. The method according to claim 1 or 2, characterized in that: The value of the first parameter is an even number; or, The value of the first parameter satisfies n=6*a+K Wherein, n is the value of the first parameter, a is an arbitrary integer, and the value set to which the value of K belongs consists of one or more of 0, 1, 3, 4 or 5; or, The value of the first parameter satisfies n=a mod b+c Among them, n is the value of the first parameter, a is an arbitrary integer, b is 3 or 6, and c is 3, 4 or 5.

4. The method according to claim 3, characterized in that When the aggregation level of the first CORESET#0 is 4 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of the first parameter is an even number.

5. The method according to claim 3, characterized in that: When the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a first value set, and the first value set consists of one or more of 0, 1, 3, 4 or 5; or, When the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a second value set, and the second value set consists of one or more of 0, 4 or 5; or, When the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the value of K belongs to a third value set, and the third value set consists of one or more of 0, 1 or 5; or, When the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the value of K is 0.

6. The method according to claim 3, characterized in that The value of the first parameter is an integer multiple of 6, or the value of K is 0.

7. The method according to any one of claims 1 to 6, characterized in that The value of the first parameter satisfies n=2*Cell_ID Or satisfy n=6*Cell_ID Or satisfy n=6*Cell_ID+K Among them, Cell_ID is the cell identifier, n is the value of the first parameter, and the value set to which K belongs consists of one or more of 0, 1, 3, 4 or 5.

8. The method according to any one of claims 1 to 7, characterized in that The first CORESET#0 is a CORESET#0 of 15 RBs obtained by puncturing the highest-numbered 9 RBs of CORESET#0 of 24 RBs, or the first CORESET#0 is a CORESET#0 of 20 RBs obtained by puncturing the highest-numbered 4 RBs of CORESET#0 of 24 RBs.

9. The method according to any one of claims 1 to 8, characterized in that The number of symbols occupied by the first CORESET#0 in the time domain is 3.

10. A communication method, characterized in that: The method comprises: Sending first indication information and a cell identifier, wherein the first indication information indicates that a mapping mode of a first control resource set 0, CORESET#0, is interleaving; An interleaving mapping order of the first CORESET#0 is determined according to a first parameter, wherein a value of the first parameter is related to the cell identifier.

11. The method according to claim 10, characterized in that The value of the first parameter is also related to one or more of the following: The number of resource blocks (RBs) of the first CORESET#0 indicated by the first indication information; The bandwidth of the first CORESET#0; the aggregation level of the first CORESET#0; or The number of symbols occupied by the first CORESET#0 in the time domain.

12. The method according to claim 10 or 11, characterized in that: The value of the first parameter is an even number; or, The value of the first parameter satisfies n=6*a+K Wherein, n is the value of the first parameter, a is an arbitrary integer, and the value set to which the value of K belongs consists of one or more of 0, 1, 3, 4 or 5; or, The value of the first parameter satisfies n=a mod b+c Among them, n is the value of the first parameter, a is an arbitrary integer, b is 3 or 6, and c is 3, 4 or 5.

13. The method according to claim 12, characterized in that When the aggregation level of the first CORESET#0 is 4 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of the first parameter is an even number.

14. The method according to claim 12, characterized in that When the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a first value set, and the first value set consists of one or more of 0, 1, 3, 4 or 5; or, When the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a second value set, and the second value set consists of one or more of 0, 4 or 5; or, When the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the value of K belongs to a third value set, and the third value set consists of one or more of 0, 1 or 5; or, When the aggregation level of the first CORESET#0 is 8 and / or the bandwidth of the first CORESET#0 is 20 RBs, the value of K is 0.

15. The method according to claim 12, characterized in that The value of the first parameter is an integer multiple of 6, or the value of K is 0.

16. The method according to any one of claims 10 to 15, characterized in that The value of the first parameter satisfies n=2*Cell_ID Or satisfy n=6*Cell_ID Or satisfy n=6*Cell_ID+K Among them, Cell_ID is the cell identifier, n is the value of the first parameter, and the value set to which K belongs consists of one or more of 0, 1, 3, 4 or 5.

17. The method according to any one of claims 10 to 16, characterized in that The first CORESET#0 is a CORESET#0 of 15 RBs obtained by puncturing the highest-numbered 9 RBs of the CORESET#0 of 24 RBs, or the first CORESET#0 is a CORESET#0 of 24 RBs obtained by puncturing the highest-numbered 4 RBs. CORESET#0 of 20 RBs.

18. The method according to any one of claims 10 to 17, characterized in that: The number of symbols occupied by the first CORESET#0 in the time domain is 3.

19. A communication method, characterized in that: The method comprises: receiving first indication information; Determine the time-frequency resource position of the first control resource set 0, CORESET#0, according to the first indication information; Among them, when the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved, or, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

20. The method according to claim 19, characterized in that When the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicating that the mapping mode of the first CORESET#0 is non-interleaved includes: When the bandwidth of the first CORESET#0 is 15 RBs and the first condition is met, the first indication information indicates non-interleaving.

21. The method according to claim 20, characterized in that The first condition includes one or more of the following: The aggregation level of the first CORESET#0 is 4; The aggregation level of the first CORESET#0 is 8; The number of symbols occupied by the first CORESET#0 in the time domain is 2; The number of symbols occupied by the first CORESET#0 in the time domain is 3.

22. The method according to claim 19, characterized in that When the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicating that the number of symbols occupied by the first CORESET#0 in the time domain is 3 includes: When the bandwidth of the first CORESET#0 is 15 or 20 RBs and the second condition is met, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

23. The method according to claim 22, characterized in that The second condition includes one or more of the following: The aggregation level of the first CORESET#0 is 8; The CCE-to-REG mapping mode of the first CORESET#0 is interleaving; The CCE-to-REG mapping mode of the first CORESET#0 is non-interleaved.

24. The method according to any one of claims 19 to 23, characterized in that The method further comprises: receiving a cell identification; The first parameter is used to determine the interleaving mapping order of CORESET#0, and the value of the first parameter is related to the cell identifier.

25. The method according to claim 24, characterized in that The value of the first parameter satisfies n=6*a+K Wherein, n is the value of the first parameter, a is an arbitrary integer, and the value set to which the value of K belongs consists of one or more of 0, 1, 3, 4 or 5; or, The value of the first parameter satisfies n=a mod b+c Among them, n is the value of the first parameter, a is an arbitrary integer, b is 3, and c is 3.

26. The method according to claim 24, characterized in that The value of the first parameter satisfies n=6*Cell_ID Or satisfy n=6*Cell_ID+K Among them, Cell_ID is the cell identifier, n is the value of the first parameter, and the value set to which K belongs consists of one or more of 0, 1, 3, 4 or 5.

27. A communication method, characterized in that: The method comprises: Determine first indication information, where the first indication information is used to determine a time-frequency resource position of a first control resource set 0, CORESET#0; sending the first indication information; When the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicates that the first CORESET#0 The mapping mode is non-interleaved, or, when the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

28. The method according to claim 27, characterized in that When the bandwidth of the first CORESET#0 is 15 RBs, the first indication information indicating that the mapping mode of the first CORESET#0 is non-interleaved includes: When the bandwidth of the first CORESET#0 is 15 RBs and the first condition is met, the first indication information indicates non-interleaving.

29. The method according to claim 28, characterized in that The first condition includes one or more of the following: The aggregation level of the first CORESET#0 is 4; The aggregation level of the first CORESET#0 is 8; The number of symbols occupied by the first CORESET#0 in the time domain is 2; The number of symbols occupied by the first CORESET#0 in the time domain is 3.

30. The method according to claim 27, characterized in that When the bandwidth of the first CORESET#0 is 15 or 20 RBs, the first indication information indicating that the number of symbols occupied by the first CORESET#0 in the time domain is 3 includes: When the bandwidth of the first CORESET#0 is 15 or 20 RBs and the second condition is met, the first indication information indicates that the number of symbols occupied by the first CORESET#0 in the time domain is 3.

31. The method according to claim 30, characterized in that The second condition includes one or more of the following: The aggregation level of the first CORESET#0 is 8; The CCE-to-REG mapping mode of the first CORESET#0 is interleaving; The CCE-to-REG mapping mode of the first CORESET#0 is non-interleaved.

32. The method according to any one of claims 27 to 31, characterized in that The method further comprises: Sending cell identification; The first parameter is used to determine the interleaving mapping order of CORESET#0, and the value of the first parameter is related to the cell identifier.

33. The method according to claim 32, characterized in that The value of the first parameter satisfies n=6*a+K Wherein, n is the value of the first parameter, a is an arbitrary integer, and the value set to which the value of K belongs consists of one or more of 0, 1, 3, 4 or 5; or, The value of the first parameter satisfies n=a mod b+c Among them, n is the value of the first parameter, a is an arbitrary integer, b is 3, and c is 3.

34. The method according to claim 32, characterized in that The value of the first parameter satisfies n=6*Cell_ID Or satisfy n=6*Cell_ID+K Among them, Cell_ID is the cell identifier, n is the value of the first parameter, and the value set to which K belongs consists of one or more of 0, 1, 3, 4 or 5.

35. A communication device, characterized in that: The method comprises a unit for implementing the method according to any one of claims 1 to 9, or comprises a unit for implementing the method according to any one of claims 19 to 26.

36. A communication device, characterized in that: The method comprises a unit for implementing the method according to any one of claims 10 to 18, or comprises a unit for implementing the method according to any one of claims 27 to 34.

37. A communication device, characterized in that: The communication device includes a processor; the processor is used to run a computer program or instructions so that the communication device performs the method as described in any one of claims 1 to 9, or so that the communication device performs the method as described in any one of claims 10 to 18, or so that the communication device performs the method as described in any one of claims 19 to 26, or so that the communication device performs the method as described in any one of claims 27 to 34.

38. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions or programs, which, when executed on a communication device, cause the method described in any one of claims 1 to 9 to be executed, or cause the method described in any one of claims 10 to 18 to be executed, or cause the method described in any one of claims 19 to 26 to be executed, or cause the method described in any one of claims 27 to 34 to be executed.

39. A computer program product, characterized in that The computer program product includes computer instructions; when part or all of the computer instructions are executed on a communication device, the method as described in any one of claims 1 to 9 is executed, or the method as described in any one of claims 10 to 18 is executed, or the method as described in any one of claims 19 to 26 is executed, or the method as described in any one of claims 27 to 34 is executed.

40. A communication system, characterized in that: Includes the communication device as claimed in claim 35 and the communication device as claimed in claim 36.

Images