Communication method and device

Abstract

The invention provides a communication method and a communication device. The method comprises: receiving first indication information and a cell identifier, the first indication information indicating that a first control resource set 0 and CORESET # 0 are mapped in an interleaving manner; and determining an interleaving mapping sequence of the first CORESET # 0 according to the first parameter, wherein the value of the first parameter is related to the cell identifier.

Description

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] At present, the industry has proposed to realize the communication of the new generation of wireless access technology (NR) under the private network spectrum. For example, the private network spectrum is the 3.6MHz spectrum of the frequency division duplexing (FDD) band of the European railway private network and the 3MHz spectrum of the European public safety network. Under this narrow band, 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. Summary of the invention

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

[0004] 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 (such as a processor, a chip, or a chip system, etc.) applied to the terminal device, or a logic module or software that can implement all or part of the functions of the terminal device. The method includes:

[0005] Receive 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; determine an interleaving mapping order of the first CORESET#0 according to a first parameter, wherein a value of the first parameter is related to the cell identifier.

[0006] 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, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the network device functions. The method includes:

[0007] 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; 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.

[0008] 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, avoiding some parameter configurations with poor transmission performance, thereby ensuring better transmission performance.

[0009] 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 RB 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.

[0010] In this way, the first parameter can be associated with one or more of the above parameters, so that the first parameter can take a specific value when the values ​​of the above one or more parameters are different. In this way, different parameter configurations can be adapted, and some parameter configurations with poor transmission performance can be avoided, thereby ensuring better transmission performance.

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

[0012] 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, wherein 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.

[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 value of K belongs to a numerical set consisting of 0, 1, 3, 4 and 5.

[0014] In combination with the first aspect or the second aspect, in an optional manner, the value of the first parameter satisfies n=a modb+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.

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

[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 8 and / or the bandwidth of the first CORESET#0 is 15 RBs, the value of K belongs to a first numerical set, and the first numerical set consists of one or more of 0, 1, 3, 4 or 5.

[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 numerical set, and the first numerical set consists of 0, 1, 3, 4 and 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 second numerical set, and the second numerical set consists of one or more of 0, 4 or 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 0, 4 and 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 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.

[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 0, 1 and 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 is 0.

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

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

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

[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+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.

[0027] 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 highest-numbered 9 RBs of a 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 a CORESET#0 of 24 RBs.

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

[0029] In a third aspect, a communication device is provided, which can execute the method provided in the first aspect, and 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; 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.

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

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

[0032] 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 (such as a processor, a chip, or a chip system, etc.) applied to the terminal device, or a logic module or software that can implement all or part of the functions of the terminal device. The method includes:

[0033] Receive first indication information; determine the time-frequency resource position of the 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.

[0034] Alternatively, the method comprises:

[0035] Receive first indication information; determine the time-frequency resource position of the 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.

[0036] 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, a chip, or a chip system, etc.), or a logic module or software that can implement all or part of the network device functions. The method includes:

[0037] Determine first indication information, where the first indication information is used to determine the time-frequency resource location of a first control resource set 0, CORESET#0; 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.

[0038] Alternatively, the method comprises:

[0039] Determine first indication information, where the first indication information is used to determine the time-frequency resource position of a first control resource set 0, CORESET#0; 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.

[0040] 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, so as to avoid some parameter configurations with poor transmission performance, thereby ensuring better transmission performance.

[0041] In the seventh aspect, a communication device is provided, which can execute the method provided in the fifth aspect, and 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, 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.

[0042] Alternatively, 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, 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.

[0043] In an 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.

[0044] Alternatively, 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 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.

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

[0046] In a ninth aspect, the present application provides a communication device, comprising a processor, wherein the processor is used to run a computer program or instructions so that the communication device executes the method described in the first aspect, the second aspect, the fifth aspect, or the sixth aspect.

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

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

[0049] In the eleventh aspect, the present application provides a chip, which includes a processor and an interface, and 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.

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

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

[0052] 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 executed on a communication device, the computer executes the method described in the first aspect, the second aspect, the fifth aspect, or the sixth aspect.

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

[0054] Figure 1 A schematic diagram of the architecture of a wireless communication system provided in an embodiment of the present application;

[0055] Figure 2 A schematic diagram of the division and numbering of REG bundles provided in an embodiment of the present application;

[0056] Figure 3 Schematic diagram of a mapping relationship between CCE-REG in CORESET#0;

[0057] Figure 4 is a spectrum schematic diagram;

[0058] Figure 5 For the case 1, n is different when non-interleaving and interleaving shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the values;

[0059] Figure 6 For the case 2, when interweaving, n is different shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the values;

[0060] Figure 7 For the non-interleaving and interleaving situations in case 3, n is different shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the values;

[0061] Figure 8 For the case 4, when interweaving, n is different shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the values;

[0062] Fig. 9 A flow chart of a communication method provided by the present application;

[0063] Fig.10 A flow chart of a communication method provided by the present application;

[0064] Fig.11 A schematic diagram of the structure of a communication device provided by the present application;

[0065] Fig.12 A schematic diagram of the structure of another communication device provided by the present application;

[0066] Fig.13 A schematic diagram of the structure of a chip provided in this application. DETAILED DESCRIPTION

[0067] The embodiment of the present application provides a communication method and device. Since the method and the device solve the problem in a similar principle, the implementation of the device and the method can refer to each other, and the repeated parts will not be repeated.

[0068] In the description of this application, words such as "first" and "second" are only used for the purpose of distinguishing descriptions, and cannot be understood as indicating or implying relative importance, nor can they be understood as indicating or implying order. It should be noted that the order of appearance of first, second, etc. is not limited in this application. For example, the second may appear first and then the first, and this application does not limit this.

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

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

[0071] Figure 1 FIG. 1 is a schematic diagram of the architecture of a communication system 1000 used in an embodiment of the present application. Figure 1 As shown, 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 (eg, Figure 1 110a and 110b), and may further include at least one terminal (such as Figure 1 120a-120j in the figure). The terminal is connected to the wireless access network device by wireless means, and the wireless access network device is connected to the core network by wireless or wired means. The core network device and the wireless access network device can be independent and different physical devices, or the functions of the core network device and the logical functions of the wireless access network device can be integrated on the same physical device, or part of the functions of the core network device and part of the functions of the wireless access network device can be integrated on one physical device. Terminals and wireless access network devices can be connected to each other by wired or wireless means. Figure 1 This is just a schematic diagram. The communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices. Figure 1 Not drawn in.

[0072] A network device is a network-side device with wireless transceiver functions. A network device may be a device in a radio access network (RAN) that provides wireless communication functions for terminal devices, and is called a RAN device. RAN may be an access network in the third generation partnership project (3GPP), for example, 4G, 5G, or a future-oriented 6G network. RAN may also be an open access network (open RAN, O-RAN or ORAN), a cloud radio access network (cloud radio access network, CRAN), or a communication network of two or more of the above networks. RAN devices may be base stations, evolved NodeBs (eNodeBs), transmission reception points (TRPs), next generation base stations (next generation nodeBs, gNBs) in fifth generation (5G) mobile communication systems, next generation base stations in sixth generation (6G) mobile communication systems, base stations in future mobile communication systems, wireless fidelity (WiFi) systems, long range radio (LoRa) systems, or access nodes in Internet of Vehicles systems. The RAN device can also be a module or unit that completes part of the functions of the base station, for example, it can be a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). The CU here completes the functions of the radio resource control protocol and the packet data convergence layer protocol (PDCP) of the base station, and can also complete the function of the service data adaptation protocol (SDAP); the DU completes the functions of the radio link control layer and the medium access control (MAC) layer of the base station, and can also complete the functions of part of the physical layer or all of the physical layer. For the specific description of the above-mentioned protocol layers, please refer to the relevant technical specifications of the 3rd Generation Partnership Project (3GPP). The CU and DU can be set separately, or they can also be included in the same network element, such as the baseband unit (BBU).The RU may be included in a radio frequency device or a radio frequency unit, for example, in a remote radio unit (RRU), an active antenna unit (AAU) or a remote radio head (RRH). In different systems, CU, DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in an ORAN system, CU may also be referred to as O-CU (open CU), DU may also be referred to as O-DU, and RU may also be referred to as 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 wireless access network device may be a macro base station (eg. Figure 1 110a), or a micro base station or an indoor station (such as Figure 1 110b), may also be a relay node or a donor node, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the wireless access network device. For ease of description, network device is used as the abbreviation of wireless access network device, and base station is used as an example of wireless access network device.

[0073] A terminal is a device with wireless transceiver function, which can send signals to a base station or receive signals from a base station. A terminal can also be called a terminal device, user equipment (UE), a mobile station, a mobile terminal, etc. The terminal can be widely used in various scenarios, for example, device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IOT), virtual reality, augmented reality, industrial control, automatic driving, telemedicine, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal can be a mobile phone, a tablet computer, a computer with wireless transceiver function, a wearable device, a vehicle, an airplane, a ship, a robot, a mechanical arm, a smart home device, etc. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal.

[0074] Base stations and terminals can be fixed or movable. Base stations and terminals can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water surface; they can also be deployed on airplanes, balloons, and artificial satellites. The embodiments of this application do not limit the application scenarios of base stations and terminals.

[0075] The roles of the base station and the terminal can be relative, for example, Figure 1 The helicopter or drone 120i in the figure can be configured as a mobile base station. For the terminal 120j that accesses the wireless access network 100 through 120i, the terminal 120i is a base station; but for the base station 110a, 120i is a terminal, that is, 110a and 120i communicate through the wireless air interface protocol. Of course, 110a and 120i can also communicate through the interface protocol between base stations. In this case, relative to 110a, 120i is also a base station. Therefore, base stations and terminals can be collectively referred to as communication devices. Figure 1 110a and 110b in the figure may be referred to as communication devices having base station functions. Figure 1 120a-120j in the figure can be called communication devices with terminal functions.

[0076] 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 including the base station function. The control subsystem including the base station function 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 a modem) in the terminal, or by a device including the terminal function.

[0077] 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 as part of the invention content.

[0078] 1. Synchronization signal and physical broadcast channel (PBCH) block (synchronization signal and PBCH block, SSB)

[0079] The synchronization signal and PBCH as a whole are called 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.

[0080] For a cell, the MIB contains some basic configuration information of the cell, especially some parameters used for initial access, such as the configuration information of the physical downlink control channel (PDCCH) of the system information block 1 (SIB1). The terminal device usually decodes the MIB first, and then uses the parameters in the MIB to continue to receive SIB1 and other broadcast information.

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

[0082] 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 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, without limiting the search space.

[0083] CORESET#0 corresponds to the PDCCH that schedules SIB1, namely Type0-PDCCH. The terminal device has not successfully accessed when receiving Type0-PDCCH, so it is unable to 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.

[0084] The physical time-frequency resources in 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 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 CORESET in the time domain, and the number of REGs in the frequency domain is the same as the number of time domain symbols occupied by 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 CORESET occupies 3 symbols in the time domain, one REGbundle occupies 3 symbols in the time domain and 2 REGs in the frequency domain. For another example, when 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 REG bundles in CORESET increases from 0 in the frequency domain from low frequency to high frequency. Figure 2 , is a schematic diagram of the division and numbering of REGbundle provided in an embodiment of the present application. The left side shows the case where CORESET occupies 3 symbols in the time domain, and the right side shows the case where CORESET occupies 2 symbols in the time domain. Figure 2 In the figure, the horizontal axis is time, with one symbol as one grid, and the vertical axis is frequency domain, with one RB as one grid.

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

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

[0087] 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. It is the number of REGs in CORESET.

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

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

[0090]

[0091] x=cR+r

[0092] r=0,1,…,R-1

[0093] c=0,1,…,C-1

[0094]

[0095] Currently, CORESET#0 supports 2 or 3 time domain symbols and 4, 8 or 16 aggregation levels (AL). With a subcarrier spacing of 15 kHz and a channel bandwidth of 5 MHz, CORESET#0 contains 24 RBs. In addition, CORESET#0 only supports CCE-REG interleaving mapping, with interleaver parameters R=2 and L=6. shift is equal to the 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 number of the REG bundle is f(j).

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

[0097] 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:

[0098] Table 1

[0099] AL PDCCH candidates 4 {0，1，2，3}，{4，5，6，7}，{8，9，10，11}，{12，13，14，15} 8 {0，1，2，3，4，5，6，7}，{8，9，10，11，12，13，14，15} 16 {0，1，2，3，4，5，6，7，8，9，10，11，12，13，14，15}

[0100] 3. Private Network Spectrum

[0101] like Figure 4 As shown, Figure 4 This is a spectrum diagram. To implement NR communication in a private network spectrum, the channel bandwidth can be 3MHz or 5MHz. In a 3MHz channel, the number of RBs available for the channel may be 12 RBs or 15 RBs. In a 5MHz channel, the number of RBs available for the channel may be 20 RBs.

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

[0103] 4. CORESET#0 in the private network

[0104] 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 shorten) CORESET#0.

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

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

[0107] 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 of 12 RBs. No puncturing is required. Support the above CCE-to-REG interleaving mapping method of R=2.

[0108] In the embodiment of the present application, for CORESET#0 that needs to be punctured, the bandwidth of CORESET#0 is the number of RBs after puncturing; for CORESET#0 that does not need to be punctured, 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 of 24 RBs is the CORESET before puncturing, the CORESET of 15 RBs or 20 RBs is the CORESET obtained after puncturing, and the CORESET of 12 RBs is the directly determined CORESET.

[0109] It should be understood that the embodiment of the present application protects a result after puncturing, and the network device or the terminal device may not perform the puncturing action. CORESET#0 before puncturing can be understood as the current complete CORESET#0 of 24 RBs. CORESET#0 after puncturing can be understood as CORESET#0 determined based on CORESET#0 before puncturing, and can also be understood as a part of CORESET#0 before puncturing. The network can send according to CORESET#0 before puncturing, and the terminal device can receive according to CORESET#0 after puncturing. Of course, the network can also send according to CORESET#0 after puncturing. CORESET#0 after puncturing can be a continuous part of the frequency domain in CORESET#0 before puncturing. Specifically, CORESET#0 after puncturing can be CORESET#0 with 15 RBs removed from the 9 RBs with the highest number in CORESET#0 before puncturing. Alternatively, CORESET#0 after puncturing can be CORESET#0 with 20 RBs removed from the 4 RBs with the highest number in CORESET#0 before puncturing.

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

[0111] In order to adapt to the channel bandwidth of the private network spectrum, CORESET#0 may be punctured. However, puncturing may reduce the transmission performance of CORESET#0. As mentioned above, the PDCCH candidates in CORESET#0 are composed of CCEs of a specific aggregation level in the order of CCE numbers. When puncturing, some CCEs in the PDCCH candidate may be punctured, or lost, thereby reducing the transmission performance on the PDCCH candidate.

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

[0113] 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, L is equal to 6, and n shift is equal to the cell ID. In addition, the cell ID in NR ranges from 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.

[0114] See the following situations for details:

[0115] 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

[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. Figure 5 As shown, Figure 5 For the case 1, n is different when non-interleaving and interleaving shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the values. Figure 5 In the figure, the vertical axis represents frequency, from low to high, it represents low frequency to high frequency. One CCE occupies 3 RBs in the frequency domain.

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

[0118] When AL is equal to 4 and the mapping mode is interleaved mapping, for different n shift The two PDCCH candidates {CCE0, CCE 1, CCE 2, CCE 3} and {CCE 4, CCE 5, CCE 6, CCE 7} included in CORESET#0 always have one CCE lost and the other one has two CCEs lost. The number of valid CCEs is 3.

[0119] 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, CCE 1, CCE 2, CCE 3, CCE 4, CCE 5, CCE 6, CCE 7} contained in CORESET#0 always lose 3 CCEs. The number of valid CCEs is 5.

[0120] 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

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

[0122] When AL is equal to 4 and the mapping mode is interleaved mapping, for different n shift The value of CORESET#0 contains two PDCCH candidates {CCE0, CCE 1, CCE 2, CCE 3} and {CCE 4, CCE 5, CCE 6, CCE 7}, one of which always loses 1 CCE and the other does not lose CCE. The number of valid CCEs is 4.

[0123] When AL is equal to 8, the mapping mode is interleaved mapping, and for different n shiftWhen taking the value, the PDCCH candidates {CCE0, CCE 1, CCE 2, CCE 3, CCE 4, CCE 5, CCE 6, CCE 7} contained in CORESET#0 always lose 1 CCE. The number of valid CCEs is 7.

[0124] Summarizing cases 1 and 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 valid CCE corresponding to different values ​​of is consistent; when the number of symbols occupied in the time domain of CORESET#0 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.

[0125] 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

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

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

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

[0129] 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 included in CORESET#0 may lose 0.5 or 1 CCE. Correspondingly, the number of valid CCEs is 3.5 or 3.

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

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

[0132]

[0133] When AL is equal to 8 and the mapping mode is non-interleaved mapping, the PDCCH candidates {CCE0, CCE 1, CCE 2, CCE 3, CCE 4, CCE 5, CCE 6, CCE 7} contained in CORESET#0 lose 0.5 CCEs. The number of valid CCEs is 7.5.

[0134] When AL is equal to 8 and the mapping mode is interleaved mapping, for different n shift The PDCCH candidates {CCE0, CCE 1, CCE 2, CCE 3, CCE 4, CCE 5, CCE 6, CCE 7} included 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.

[0135] 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

[0136] The number of CCEs included in CORESET#0 before puncturing is equal to 12. The supported aggregation level AL can be 4 or 8. Figure 8 As shown, Figure 8 For the case 4, when interweaving, n is different shift Schematic diagram of the CCE numbers reserved in the bandwidth of CORESET#0 corresponding to the values. Figure 8 In the figure, the vertical axis represents frequency, from low to high, it represents low frequency to high frequency. One CCE occupies 2 RBs in the frequency domain.

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

[0138] When AL is equal to 4 and the mapping mode is interleaved mapping, for different n shiftThe value is selected, and the PDCCH candidate with the most CCEs is retained without loss among the three PDCCH candidates included in CORESET#0. Correspondingly, the number of valid CCEs is 4.

[0139] When AL is equal to 8 and the mapping mode is interleaved mapping, for different n shift The PDCCH candidates {CCE0, CCE 1, CCE 2, CCE 3, CCE 4, CCE 5, CCE 6, CCE 7} included in CORESET#0 may lose 0, 1 or 2 CCEs. Correspondingly, the number of valid CCEs is 8, 7 or 6.

[0140] 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 valid 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.

[0141] To summarize cases 1 to 4, when AL is equal to 8 and interleaved mapping is performed, for the bandwidth of CORESET#0 is 15 RBs or 20 RBs, and the number of symbols occupied in the time domain of CORESET#0 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 The corresponding transmission performance.

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

[0143] Table 3 The number of lost CCEs and the number of valid CCEs under different parameter configurations

[0144]

[0145] As shown in Table 3, under some parameter configurations, the number of lost CCEs is 0, and 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 parameter configurations 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.

[0146] The following is a further description of a communication method and a communication device provided in an embodiment of the present application:

[0147] In one embodiment of the present application, a communication method is provided. Fig. 9 , is a flow chart of a communication method 100. In the following description, the method is applied to Figure 1 For the sake of convenience, the following takes the method executed by a network device and a terminal device as an example. Figure 1 The network architecture shown in FIG. 1 is taken as an example. Therefore, the network devices described below are, for example, Figure 1 The access network device in the network architecture shown in the figure, the terminal device described below can be Figure 1 Terminal devices in the network architecture shown.

[0148] S101: The network device sends first indication information and a cell identifier, and correspondingly, the 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.

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

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

[0151] 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 is composed of one or more of the following parameters: the number of resource blocks RB, the frequency domain resource offset value, the number of time domain symbols, the mapping mode, and the multiplexing mode. Among them, if the bandwidth of the first CORESET#0 is 12RB, the number of RBs indicated by the first parameter configuration is 12; if the bandwidth of the first CORESET#0 is 15RB, the number of RBs indicated by the first parameter configuration is 24; if the bandwidth of the first CORESET#0 is 20RB, 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 of information 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.

[0152] Optionally, the cell identifier is carried in the synchronization signal, and further, may be carried in the primary synchronization signal or the secondary synchronization signal. Alternatively, it may be partially carried in the primary synchronization signal and partially carried in the 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 referred to the description in Chapter 7.4.2 of 3GPP TS 38.211V17.4.0.

[0153] S102: The network 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.

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

[0155] In order to ensure the interconnection and interoperability of the network device and the terminal device when sending and receiving signals, the network device and the terminal device will determine the interleaving mapping order of the first CORESET#0 according to 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, so this application does not limit it. For the terminal device, S101 is before S103.

[0156] 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 REGbundle, 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 is based on the first parameter. The network device and the terminal device may determine the interleaving mapping order of the first CORESET#0 according to the first parameter and the above mapping function. The value of the first parameter is related to the cell identifier.

[0157] Optionally, the cell identifier ranges from 0 to 1007.

[0158] In a possible implementation, the first CORESET#0 is a punctured CORESET#0. Exemplarily, when the bandwidth of the first CORESET#0 is 15 RBs, the first CORESET#0 is a CORESET#0 of 15 RBs obtained by puncturing the highest-numbered 9 RBs of a CORESET#0 of 24 RBs. Exemplarily, when the bandwidth of the first CORESET#0 is 20 RBs, the first CORESET#0 is a CORESET#0 of 20 RBs obtained by puncturing the highest-numbered 4 RBs of a CORESET#0 of 24 RBs.

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

[0160] In one possible implementation, the value of the first parameter can be directly limited, and the value can be applicable to the following situations where one or more of the following takes any value: the number of resource blocks RB 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 also related to one or more of the following: the number of resource blocks RB 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 limited under a specific parameter configuration.

[0161] Specifically, the first parameter can be limited in the following ways:

[0162] Solution 1: 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. In this way, when the AL is 4 and / or the bandwidth of the first CORESET#0 is 15 RBs, the number of valid CCEs of the first CORESET#0 can be greater than 3, ensuring better transmission performance.

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

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

[0165] Optionally, the value of the first parameter is defined as Wherein, 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 a partial even number in the cell ID. Optionally, the definition can also be multiplied by an integer greater than 1, for example, 2, 3, 4 or 5. Exemplarily, when the integer greater than 1 is 2, a variation of the above formula is

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

[0167] Exemplarily, α=6, K is a non-negative integer less than 6. Further, 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, and 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.

[0168] In one implementation of the second solution, the value of K is 0, that is, the value of the first parameter satisfies n=6*a. At this time, 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 15RB and / or 20RB, the value of K is 0. Or, when the number of resource blocks RB 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 better transmission performance.

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

[0170] In another implementation of the second solution, the value of K is one of 0, 1, 3, 4 or 5, or 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. The value of the first parameter satisfies n=6*a+K. At this time, the value of the first parameter is one of 6*a, 6*a+1, 6*a+3, 6*a+4, and 6*a+5. Further, when the bandwidth of the first CORESET#0 is 15 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, 3, 4 or 5, or 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. 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 better transmission performance.

[0171] 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, 1, 3, 4, or 5, or 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.

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

[0173] In another implementation of the second scheme, 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. At this time, the value of the first parameter is one of 6*a, 6*a+4, and 6*a+5. Further, when the bandwidth of the first CORESET#0 is 15RB, and / or the aggregation level AL of the first CORESET#0 is equal to 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 RB, the CCE loss of the first CORESET#0 is less than 3 CCEs, ensuring better transmission performance.

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

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

[0176] In another implementation of the second solution, 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. At this time, 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 20RB, 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 RB, the CCE loss of the first CORESET#0 is less than 2 CCEs, ensuring better transmission performance.

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

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

[0179] In another implementation of the second solution, the value of K is 0. The value of the first parameter satisfies n=6*a. At this time, the value of the first parameter is one of 6*a. 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 0. In this way, when AL is 8, and / or the bandwidth of the first CORESET#0 is 20 RBs, the first CORESET#0 does not lose CCE, ensuring better transmission performance.

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

[0181] In another implementation of Scheme 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. At this time, the value of the first parameter is one of 6*a, 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 15 RB, the CCE loss of the first CORESET#0 is less than 3 CCEs, ensuring better transmission performance. At this time, the aggregation level AL of the first CORESET#0 can be equal to 8 or 4.

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

[0183] In another implementation of Scheme 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. At this time, the value of the first parameter is one of 6*a, 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 better transmission performance. At this time, the bandwidth of the first CORESET#0 is 20RB or 15RB.

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

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

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

[0187] 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 will 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 limit it.

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

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

[0190] In another embodiment of the present application, a communication method is provided. Fig.10 , is a flow chart of a communication method 200. In the following description, the method is applied to Figure 1 For the sake of convenience, the following takes the method executed by a network device and a terminal device as an example. Figure 1 The network architecture shown in FIG. 1 is taken as an example. Therefore, the network devices described below are, for example, Figure 1 The access network device in the network architecture shown in the figure, the terminal device described below can be Figure 1 Terminal devices in the network architecture shown.

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

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

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

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

[0195] For the description of the first indication information, please refer to Fig. 9 Description of the first indication information in the illustrated embodiment: 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 that the mapping mode of the first CORESET#0 is interleaved or non-interleaved.

[0196] As mentioned above, under some parameter configurations, the transmission performance of CORESET#0 is poor. Therefore, the values ​​of the parameters related to the first CORESET#0 indicated by the network device under specific conditions can be limited to avoid the first CORESET#0 adopting a parameter configuration with poor transmission performance, thereby ensuring better transmission performance.

[0197] In a 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.

[0198] 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. Among them, the aggregation level of the first CORESET#0 is 4 and 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. When the first condition includes multiple sub-conditions, the sub-conditions included in the first condition must be met at the same time.

[0199] In an 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 CCE. In this implementation, the number of time domain symbols is not limited.

[0200] 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 limited.

[0201] 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-interleaved. 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.

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

[0203] 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 15RB, and the bandwidth of the first CORESET#0 is 20RB. Among them, the mapping mode of the first CORESET#0 is interleaved and the mapping mode of the first CORESET#0 is non-interleaved are not included in the second condition at the same time. The bandwidth of the first CORESET#0 is 15RB and the bandwidth of the first CORESET#0 is 20RB are not included in the second condition at the same time. When the second condition includes multiple sub-conditions, the sub-conditions included in the second condition must be met at the same time.

[0204] 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. In this way, 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 limited.

[0205] 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 interleaving. 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 interleaving, 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 CCE. In this implementation, the mapping mode is not limited.

[0206] In another possible implementation, Fig.10 The embodiment shown can also be combined with Fig. 9 The embodiment shown.

[0207] The method 200 may further include step S205: the network device sends a cell identifier, and correspondingly, the terminal device receives the cell identifier. 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.

[0208] For a description of the cell identifier, please refer to Fig. 9The description of the cell identification in the embodiment shown in FIG. 205 and the time sequence between steps S201-203 can be referred to in Fig. 9 Description of the illustrated embodiment.

[0209] 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 shift The first parameter may also be represented by other symbols, and the following description is based on the first parameter. The network device and the terminal device may determine the interleaving mapping order of CORESET#0 according to the first parameter and the above mapping function. Optionally, the value range of the cell identifier is 0 to 1007.

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

[0211] In one implementation of the first parameter, the value of the first parameter is equal to the cell identifier. Fig. 9 In the embodiment shown in the figure, the conditions satisfied by the value of the first parameter in the limiting scheme of the first parameter are as follows: Fig.10 The value of the first parameter in the embodiment shown does not satisfy Fig. 9 When the conditions described in the illustrated embodiment are met, the first indication information indicates that the mapping mode of the first CORESET#0 is non-interleaved.

[0212] For example, in Fig. 9 In the solution 1 provided in the embodiment shown, 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, Fig.10 In the illustrated embodiment, 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. Fig.10 In the illustrated embodiment, 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.

[0213] For example, in Fig. 9In the second solution provided by the embodiment shown, 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, Fig.10 In the illustrated embodiment, 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 satisfies n=6*a+J, where the value of J is 2.

[0214] For example, in Fig. 9 In an implementation of the second solution provided in the illustrated embodiment, the value of the first parameter satisfies n=6*a+K. Where n is the value of the first parameter, 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. Further, when the bandwidth of the first CORESET#0 is 15RB, and / or the aggregation level AL of the first CORESET#0 is equal to 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. Then, in Fig.10 In the illustrated embodiment, 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, 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. Further, when the bandwidth of the first CORESET#0 is 15RB, and / or the aggregation level AL of the first CORESET#0 is equal to 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 the 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 satisfies n=6*a+J, where the value range of J is 1, 2 and 3.

[0215] 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 the product coefficient, α can be 3 or an integer multiple of 6, a is an arbitrary integer, and K is a non-negative integer less than α.

[0216] For example, α=6, and K is a non-negative integer less than 6. Further, the value set to which K belongs consists of 0, 1, 3, 4, and 5. The following description is made by taking α=6 as an example. When α can be 3 or an integer multiple of 6, reference can be made to Fig. 9 Related description in .

[0217] 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, 1, 3, 4, or 5, or the value of K belongs to a first value set consisting of 0, 1, 3, 4, and 5.

[0218] For example, α=6, and K is a non-negative integer less than 6. Further, the value set to which the value of K belongs consists of one or more of 0, 1, 3, 4, or 5. The following description is made by taking α=6 as an example. When α can be 3 or an integer multiple of 6, reference can be made to Fig. 9 Related description in .

[0219] 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, 1, 3, 4, or 5, or 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.

[0220] With further reference 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 may refer to the above description of the first condition.

[0221] 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-interleaved. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

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

[0223] 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. The second condition may refer to the above description of the second condition.

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

[0225] 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, 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 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, thereby ensuring better transmission performance.

[0227] In another implementation of the first parameter, the value of the first parameter is defined as n=(Cell_ID)mod5+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.

[0228] With further reference 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 may refer to the above description of the first condition.

[0229] 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-interleaved. In this way, the first CORESET#0 loses fewer CCEs, ensuring better transmission performance.

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

[0231] 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. The second condition may refer to the above description of the second condition.

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

[0233] 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, ensuring better transmission performance.

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

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

[0236] Fig.12 A schematic diagram of the structure of another communication device is given. The communication device 1800 may be a terminal device or a network device in the above method embodiment, or may be a chip, a chip system, or a processor that supports the terminal device or the network device to implement the above method. The communication device may be used to implement the method described in the above method embodiment, and the details may refer to the description in the above method embodiment.

[0237] The communication device 1800 may include one or more processors 1801. The processor 1801 may be a general-purpose processor or a dedicated processor, etc. For example, it may be a baseband processor or a central processing unit. The baseband processor may be used to process the communication protocol and communication data, and the central processing unit may be used to control the communication device (such as a base station, a baseband chip, a terminal, a terminal chip, a DU or a CU, etc.), execute a software program, and process the data of the software program.

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

[0239] 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, etc., for implementing a transceiver function. The transceiver 1805 may include a receiver and a transmitter, the receiver may be referred to as a receiver or a receiving circuit, etc., for implementing a receiving function; the transmitter may be referred to as a transmitter or a transmitting circuit, etc., for implementing a transmitting function. Among them, Fig.11 The processing unit 1702 shown may be a processor 1801. The transceiver unit 1701 may be a transceiver 1805.

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

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

[0242] When the communication device is applied to network equipment:

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

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

[0245] In another possible design, optionally, the processor 1801 may store an instruction 1803, and the instruction 1803 runs on the processor 1801, so that the communication device 1800 can execute the method described in the above method embodiment. The instruction 1803 may be solidified in the processor 1801, in which case the processor 1801 may be implemented by hardware.

[0246] In another possible design, the communication device 1800 may include a circuit, and the circuit can realize the transmission or reception or communication function of 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 (iMintegrated circuit, IC), an analog IC, a radio frequency integrated circuit RFIC, a mixed signal IC, an application-specific integrated circuit (application specific iMintegrated circuit, ASIC), a printed circuit board (printed circuit board, PCB), an electronic device, etc. The processor and transceiver can also be manufactured with various IC process technologies, such as complementary metal oxide semiconductor (complementary metal oxide semiconductor, CKOS), M-type metal oxide semiconductor (MKetal-oxide-seKicoMductor, MKOS), P-type metal oxide semiconductor (positive chaMMel Ketal oxide seKicoMductor, PKOS), bipolar junction transistor (Bipolar JuMctioM Transistor, BJT), bipolar CKOS (BiCKOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.

[0247] 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 thereto. Fig.12 The communication device may be an independent device or may be part of a larger device. For example, the communication device may be:

[0248] (1) Independent integrated circuit IC, or chip, or chip system or subsystem;

[0249] (2) having a set of one or more ICs, and optionally, the IC set may also include a storage component for storing data and instructions;

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

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

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

[0253] (6)Others

[0254] For the case where the communication device may be a chip or a chip system, see Fig.13 Schematic diagram of the chip structure shown. Fig.13 The chip 1900 shown includes a processor 1901 and an interface 1902. Optionally, it may also include a memory 1903. The number of the processors 1901 may be one or more, and the number of the interfaces 1902 may be multiple.

[0255] 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:

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

[0257] The processor 1901 is used to execute data processing operations of the network device or the terminal device.

[0258] It is understandable that some optional features in the embodiments of the present application may be implemented independently in certain scenarios without relying on other features, such as the solution on which they are currently based, to solve corresponding technical problems and achieve corresponding effects, or may be combined with other features according to needs in certain scenarios. 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.

[0259] 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 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 (digital signal processor, DSP), an application-specific integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.

[0260] It can be understood that the memory in the embodiment of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (read-oMly KeKory, ROK), a programmable read-only memory (programgraKKable ROK, PROK), an erasable programmable read-only memory (erasable PROK, EPROK), an electrically erasable programmable read-only memory (electrically EPROK, EEPROK) or a flash memory. The volatile memory can be a random access memory (random access KeKory, 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 link 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.

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

[0262] The present application also provides a computer program product including instructions, and when a computer reads and executes the computer program product, the computer implements the functions of any of the above method embodiments.

[0263] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part 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, the process or function described in the embodiment of the present application is generated in whole or in part. 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 a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber liMe, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. 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. 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)).

[0264] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope 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 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.

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 claims 19-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; 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.

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 claims 27-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 comprising the communication device according to claim 35 and the communication device according to claim 36.

Images