Method and device for transmitting and receiving signals in wireless communication system
By aligning starting CCE indices for PDCCH candidates across different aggregation levels, the method optimizes resource allocation and signal processing in wireless communication systems, enhancing efficiency and performance.
Patent Information
- Application Number
- PCT/KR2026/006008
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-05-12
- Filing Date
- 2026-05-12
- Publication Date
- 2026-11-19
AI Technical Summary
Existing wireless communication systems face inefficiencies in transmitting and receiving signals, particularly in managing control channel elements (CCEs) for PDCCH candidates, leading to suboptimal signal processing and resource utilization.
A method and apparatus are provided for efficiently managing PDCCH candidates by determining the starting CCE index alignment for different aggregation levels, ensuring efficient overlap and resource allocation in PDCCH candidates, thereby optimizing signal transmission and reception.
This approach enhances signal transmission and reception efficiency by optimizing resource utilization and reducing unnecessary processing, improving overall system performance.
Smart Images

Figure KR2026006008_19112026_PF_FP_ABST
Abstract
Description
Method and device for transmitting and receiving signals in a wireless communication system
[0001] This specification relates to methods and devices used in wireless communication systems.
[0002] Wireless communication systems are being widely deployed to provide various types of communication services, such as voice and data. Generally, a wireless communication system is a multiple access system capable of supporting communication with multiple users by sharing available system resources (bandwidth, transmission power, etc.). Examples of multiple access systems include CDMA (Code Division Multiple Access), FDMA (Frequency Division Multiple Access), TDMA (Time Division Multiple Access), OFDMA (Orthogonal Frequency Division Multiple Access), and SC-FDMA (Single Carrier Frequency Division Multiple Access).
[0003] The technical problem to be solved by the present specification is to provide a method for efficiently transmitting and receiving wireless communication signals and an apparatus for doing so.
[0004] The technical challenges are not limited to those described above, and other technical challenges can be inferred from the embodiments.
[0005] The present specification provides a method and apparatus for transmitting and receiving signals in a wireless communication system.
[0006] A method is provided comprising, in one embodiment of the present specification: receiving information about a set of SS (search space); and monitoring PDCCH (physical downlink control channel) candidates based on said information, wherein the information includes information about the number of PDCCH candidates for each of the set AL (aggregation levels), said ALs include a first AL and a second AL greater than said first AL, and based on all CCE(s) (control channel element(s)) mapped to the first PDCCH candidate that is the first AL overlap with the CCEs mapped to the second PDCCH candidate that is the second AL, the starting CCE index of said first PDCCH candidate is determined to be the same CCE index as the starting CCE index of said second PDCCH candidate.
[0007] In another aspect of the present specification, a device for performing the method comprises a terminal, a processor, and a storage medium.
[0008] In another aspect of the present specification, a method is provided comprising: transmitting information about a set of SS (search space); and transmitting a PDCCH (physical downlink control channel) based on said information, wherein the information includes information about the number of PDCCH candidates for each of the set AL (aggregation levels), said ALs include a first AL and a second AL greater than said first AL, and based on the fact that all CCE(s) (control channel element(s)) mapped to the first PDCCH candidate, which is said to be the first AL, overlap with the CCEs mapped to the second PDCCH candidate, which is said to be the second AL, the starting CCE index of said first PDCCH candidate is determined to be the same CCE index as the starting CCE index of said second PDCCH candidate.
[0009] In another aspect of the present specification, a base station, a processor, and a storage medium are provided as an apparatus for performing the method.
[0010] The above devices may include at least a terminal, a network, and an autonomous vehicle capable of communicating with other autonomous vehicles other than the device.
[0011] The embodiments of this specification described above are merely some of the preferred embodiments of this specification, and various embodiments reflecting the technical features can be derived and understood by those skilled in the art based on the detailed description.
[0012] According to one embodiment of the present specification, when a signal is transmitted and received between communication devices, there is an advantage that more efficient signal transmission and reception can be performed through an operation differentiated from the prior art.
[0013] The technical effects are not limited to those described above, and other technical effects may be inferred from the examples.
[0014] FIG. 1 illustrates an exemplary flexible network topology to which some of the examples of the present specification may be applied.
[0015] FIG. 2 illustrates an example of a communication system applicable to the present disclosure.
[0016] FIG. 3 illustrates an example of a wireless device that can be applied to the present disclosure.
[0017] FIG. 4 illustrates a communication procedure between a first node (e.g., a terminal) and a second node (e.g., a base station) applicable to the present disclosure.
[0018] FIGS. 5 to 12 are drawings for explaining a signal transmission and reception method according to an embodiment of the present disclosure.
[0019] In this specification, "A or B" may mean "only A," "only B," or "both A and B." Alternatively, in this specification, "A or B" may be interpreted as "A and / or B." For example, in this specification, "A, B or C" may mean "only A," "only B," "only C," or "any combination of A, B and C."
[0020] A slash ( / ) or a comma used in this specification may mean "and / or." For example, "A / B" may mean "A and / or B." Accordingly, "A / B" may mean "only A," "only B," or "both A and B." For example, "A, B, C" may mean "A, B or C."
[0021] In this specification, "at least one of A and B" may mean "only A," "only B," or "both A and B." Additionally, in this specification, the expressions "at least one of A or B" or "at least one of A and / or B" may be interpreted as synonymous with "at least one of A and B."
[0022] Additionally, in this specification, "at least one of A, B and C" may mean "only A," "only B," "only C," or "any combination of A, B and C." Also, "at least one of A, B or C" or "at least one of A, B and / or C" may mean "at least one of A, B and C."
[0023] Additionally, parentheses used in this specification may mean "for example." Specifically, when indicated as "control information (ABC)," "ABC" may be described as an example of "control information." For example, "control information" may include DEF as another example. In other words, "control information" in this specification is not limited to "ABC," and "ABC" may be described as an example of "control information." Also, when indicated as "control information (i.e., ABC)," "ABC" may be described as an example of "control information."
[0024] In addition, terms such as "first," "second," etc. in this specification are used solely for the purpose of distinguishing one component from another and are not used to limit the components, nor are they used to limit the order or importance of the components unless specifically limited. Accordingly, a first component in one embodiment of this specification may be referred to as a second component in another embodiment, and likewise, a second component in one embodiment may be referred to as a first component in another embodiment.
[0025] In the following explanation, 'when, if, in case of' can be replaced with 'based on'.
[0026] Technical features described individually within a single drawing in this specification may be implemented individually or simultaneously.
[0027] In this specification, a terminal is a user-side device (user equipment, UE) or a consumer-side device, and may also be referred to as a first node that receives / transmits signals from / to a base station / second node / IAB node / Transmission-Reception Point (TRP). A terminal may correspond to a physical node or a logical node. A terminal may correspond to a user-side endpoint or an intermediate point between other endpoints. In communication between two points not limited to endpoints (including one-to-one / many-to-one / one-to-many / many-to-many communication), a terminal may correspond to a served node. A terminal may be a fixed-location node or a non-fixed-location (or mobile) node.
[0028] In this specification, a Base Station (BS) is a device on the network side and may also be referred to as a second node / IAB node / x-NodeB (x-NodeB, where x may be an abbreviation related to Radio Access Technology (RAT)) / Transmission-Reception Point (TRP). A Base Station may correspond to a physical node or a logical node. A Base Station may correspond to an endpoint on the network side or an intermediate point between other endpoints. In communication between two points not limited to endpoints (including one-to-one / many-to-one / one-to-many / many-to-many communication), a Base Station may correspond to a serving node. A Base Station may be a node with a fixed location or a node with an indefinite location.
[0029] In this specification, higher layer parameters may be set for the terminal, pre-set, or pre-defined. For example, a base station may transmit higher layer parameters to the terminal. For example, the terminal may transmit parameters such as capability to the base station as higher layer parameters. For example, higher layer parameters may be transmitted via RRC (radio resource control) signaling or MAC (medium access control) signaling.
[0030] In this specification, information / state / parameters being "configured" or "pre-configured" may be interpreted as the information / state / parameters being provided / pre-provided to the terminal through pre-defined signaling (e.g., SIB, MAC, RRC) from the base station. In this specification, information / state / parameters being "defined" or "pre-defined" may be interpreted as being known or stored in advance by the base station and the terminal without signaling between the base station and the terminal.
[0031] The technology described in this specification can be used in various wireless communication systems such as CDMA (code division multiple access), FDMA (frequency division multiple access), TDMA (time division multiple access), OFDMA (orthogonal frequency division multiple access), and SC-FDMA (single carrier frequency division multiple access). CDMA can be implemented with wireless technologies such as UTRA (universal terrestrial radio access) or CDMA2000. TDMA can be implemented with wireless technologies such as GSM (global system for mobile communications) / GPRS (general packet radio service) / EDGE (enhanced data rates for GSM evolution). OFDMA can be implemented with wireless technologies such as IEEE (institute of electrical and electronics engineers) 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802-20, E-UTRA (evolved UTRA), LTE (long term evolution), and 5G NR.
[0032] The technology described in this specification can be implemented as 6G wireless technology and applied to various 6G systems. For example, 6G systems may have key factors such as eMBB (enhanced mobile broadband), URLLC (ultra-reliable low latency communications), mMTC (massive machine-type communication), AI (artificial intelligence) integrated communication, tactile internet, high throughput, high network capacity, high energy efficiency, low backhaul and access network congestion, and enhanced data security.
[0033] In a wireless communication system, a terminal receives information from a base station via the downlink (DL) and transmits information to the base station via the uplink (UL). The information transmitted and received by the base station and the terminal includes data and various control information, and various physical channels and signals exist depending on the type and purpose of the information being transmitted and received. A physical channel corresponds to a set of resource elements (REs) that carry information originating from the upper layer. A physical signal corresponds to a set of resource elements (REs) used by the physical layer (PHY), but it does not carry information originating from the upper layer. The upper layer includes the MAC (Medium Access Control) layer, RLC (Radio Link Control) layer, PDCP (Packet Data Convergence Protocol) layer, RRC (Radio Resource Control) layer, etc.
[0034] DL physical channels include PBCH (Physical Broadcast Channel), PDSCH (Physical Downlink Shared Channel), and PDCCH (Physical Downlink Control Channel). DL physical signals include DL RS (Reference Signal), PSS (Primary Synchronization Signal), and SSS (Secondary Synchronization Signal). DL RS includes DM-RS (Demodulation RS), PT-RS (Phase-tracking RS), and CSI-RS (Channel-state Information RS). UL physical channels include PRACH (Physical Random Access Channel), PUSCH (Physical Uplink Shared Channel), and PUCCH (Physical Uplink Control Channel). UL physical signals include UL RS. UL RS includes DM-RS, PT-RS, and SRS (Sounding RS).
[0035] FIG. 1 illustrates an exemplary flexible network topology to which some of the examples of the present specification may be applied.
[0036] To compensate for incomplete areas of network coverage, a network topology in which the Split Radio Access Network (RAN) is configured more flexibly and resiliently may be considered. To this end, various nodes such as IAB nodes, relays, and RF repeaters, as exemplified in Fig. 1, may be applied, and NTN may be integrated. For example, an IAB node may correspond to a node that provides wireless backhaul. For example, a relay may refer to any intermediate point, and in the case of a sidelink relay where a terminal functions as a relay, it may collectively refer to a terminal-to-network (U2N) relay and a terminal-to-terminal (U2U) relay. For example, an RF repeater may correspond to a node that performs simple signal amplification and forwarding functions, and in the case of a network-controlled repeater, it may adjust transmit / receive settings based on information provided by the network as well as signal amplification and forwarding. For example, an NTN node may correspond to a satellite or aircraft that provides NTN coverage that is difficult for a terrestrial network to provide. In addition to these examples, various intermediate points can be introduced to improve network topology.
[0037] Referring to FIG. 1, a split RAN can support the division of a base station into one centralized unit (CU) and one or more distributed units (DU). The CU and DU may correspond to logical units. The CU may be further divided into a control plane (CP) portion and one or more user plane (UP) portions. Since a failure in the CU-CP affects not only the CU-UP but also the DU, various intermediate points may be introduced to compensate for this.
[0038] An intermediate point may correspond to a terminal or a base station depending on its relative relationship with other nodes. For example, an IAB node may include a mobile-termination (MT) portion and a DU. The MT can connect the IAB node to a donor node. The DU of the IAB node may serve other terminals or connect to other IAB nodes to provide multi-hop wireless backhaul to terminals. In other words, an IAB node may correspond to a base station in its relative relationship with user-side nodes and to a terminal in its relative relationship with network-side nodes.
[0039] In some examples of this specification, the description of a terminal may apply equally to an intermediate point corresponding to a terminal in relation to a network-side endpoint as well as to a user-side endpoint. Similarly, in some examples of this specification, the description of a base station may apply equally to an intermediate point corresponding to a base station in relation to a user-side endpoint as well as to a network-side endpoint. However, in most cases where there is no additional description of the operation of three or more entities, the communication entities in this specification are briefly described by the term terminal and / or base station (or first node and / or second node), wherein the term terminal and / or base station (or first node and / or second node) is interpreted to include or replace any endpoint or any intermediate point in relation to other nodes.
[0040] That is, for the sake of brevity of description in some examples of this specification, the subject of the operation may be referred to as a base station and / or terminal (or a first node and / or a second node). Additionally, the term base station and / or terminal (or a first node and / or a second node) may be interpreted or substituted as in the following examples: for example, the base station (or the first node) and the terminal (or the second node) may correspond to a first endpoint and a second endpoint, respectively; may correspond to an endpoint and an intermediate point, respectively; may correspond to an intermediate point and an endpoint, respectively; or may correspond to a first intermediate point and a second intermediate point, respectively.
[0041] In this specification, there may be no intermediate points between the base station and the terminal, or there may be one or more. If intermediate points exist, the intermediate points may correspond to IAB nodes, relays, RF repeaters, NTN (non-terrestrial network) nodes, or nodes supporting other functions. The intermediate points may be nodes with a fixed location or nodes with an indefinite location.
[0042] FIG. 2 illustrates a communication system applicable to the present disclosure.
[0043] The communication system (100) of FIG. 2 includes a wireless device (110), a network device (120), and a network (130). Here, the wireless device (110) refers to a device that performs communication using wireless access technology (e.g., LTE, LTE-A, LTE-A pro, NR, 5G, 5G-A, 6G) and may be referred to as a communication / wireless / 5G / 6G device. Although not limited thereto, the wireless device (110) may include a robot (110a), a vehicle (110b-1, 110b-2), an XR (extended reality) device (110c), a hand-held device (110d), a home appliance (110e), an IoT (Internet of Thing) device (110f), and an AI (artificial intelligence) device / server (110g). For example, the vehicle may include a vehicle equipped with wireless communication capabilities, an autonomous vehicle, a vehicle capable of performing inter-vehicle communication, etc. Here, the vehicle (110b-1, 110b-2) may include an unmanned aerial vehicle (UAV) (e.g., a drone). The XR device (110c) includes an augmented reality (AR) / virtual reality (VR) / mixed reality (MR) device and may be implemented in the form of a head-mounted device (HMD), a head-up display (HUD) equipped in a vehicle, a television, a smartphone, a computer, a wearable device, a home appliance, digital signage, a vehicle, a robot, etc. The portable device (110d) may include a smartphone, a smartpad, a wearable device (e.g., a smartwatch, smart glasses), a computer (e.g., a laptop, etc.). The home appliance (110e) may include a TV, a refrigerator, a washing machine, etc. The IoT device (110f) may include a sensor, a smart meter, etc. The wireless device (110) may correspond to a terminal (or first node) or an intermediate point.The network device (120) may correspond to a base station (or a second node) or another intermediate point. For example, the network device (120) may also be implemented as a wireless device (110), and a specific wireless device (120a) may operate as a network device (120) to another wireless device (110).
[0044] Wireless devices (110a to 110f) can be connected to a network (130) through a network device (120). AI technology may be applied to the wireless devices (110a to 110f), and the wireless devices (110a to 110f) can be connected to an AI server (110g) through the network (130). The network (130) can be configured using a 3G network, a 4G (e.g., LTE) network, a 5G (e.g., NR) network, or a 6G network. The wireless devices (110a to 110f) may communicate with each other through the network device (120) / network (130), but may also communicate directly (e.g., sidelink communication) without going through the network device (120) / network (130). For example, vehicles (110b-1, 110b-2) can communicate directly (e.g., V2V (vehicle to vehicle) / V2X (vehicle to everything) communication). Also, an IoT device (110f) (e.g., a sensor) can communicate directly with another IoT device (e.g., a sensor) or other wireless devices (110a to 110f).
[0045] Wireless communication / connection (150a, 150b, 150c) can be established between wireless devices (110a to 110f) / network devices (120) and between network devices (120). Here, wireless communication / connection can be established through various wireless access technologies such as uplink / downlink communication (150a), sidelink communication (150b) (or D2D communication), and communication between network devices (150c) (e.g., relay, IAB (integrated access backhaul)). Through wireless communication / connection (150a, 150b, 150c), wireless devices and network devices / wireless devices, and network devices and network devices can transmit / receive wireless signals to / from each other. For example, wireless communication / connection (150a, 150b, 150c) can transmit / receive signals through various physical channels. To this end, based on the various descriptions of the present disclosure, at least some of the following may be performed: a process for setting various configuration information for the transmission / reception of a wireless signal, a process for various signal processing (e.g., channel encoding / decoding, modulation / demodulation, resource mapping / demapping, etc.), a resource allocation process, etc.
[0046] FIG. 3 illustrates an example of a wireless device that can be applied to the present disclosure.
[0047] Referring to FIG. 3, the wireless device (200) can transmit and receive wireless signals through various wireless access technologies (e.g., LTE, LTE-A, LTE-A pro, NR, 5G, 5G-A, 6G). The wireless device (200) includes at least one processor (202) and at least one memory (204), and may additionally include at least one transceiver (206) and / or at least one antenna (208).
[0048] The processor (202) controls the memory (204) and / or the transceiver (206) and may be configured to implement the descriptions, functions, procedures, proposals, methods, and / or sequences of operation disclosed in this document. For example, the processor (202) may process information within the memory (204) to generate a first information / signal and then transmit a wireless signal containing the first information / signal through the transceiver (206). Additionally, the processor (202) may receive a wireless signal containing a second information / signal through the transceiver (206) and then store information obtained from the signal processing of the second information / signal in the memory (204). The memory (204) may be connected to the processor (202) and may store various information related to the operation of the processor (202). For example, memory (204) may store software code containing instructions for performing some or all of the processes controlled by the processor (202) or for performing the descriptions, functions, procedures, proposals, methods, and / or sequences of operations disclosed in this document. Here, the processor (202) and memory (204) may be part of a communication modem / circuit / chip designed to implement wireless communication technology. A transceiver (206) may be connected to the processor (202) and may transmit and / or receive wireless signals through at least one antenna (208). The transceiver (206) may include a transmitter and / or receiver. The transceiver (206) may be interchangeable with an RF (radio frequency) unit. In this disclosure, a wireless device may mean a communication modem / circuit / chip.
[0049] Hereinafter, hardware elements of the wireless device (200) will be described in more detail. Although not limited thereto, at least one protocol layer may be implemented by at least one processor (202). For example, at least one processor (202) may implement at least one layer (e.g., functional layers such as PHY (physical), MAC (media access control), RLC (radio link control), PDCP (packet data convergence protocol), RRC (radio resource control), and SDAP (service data adaptation protocol). At least one processor (202) may generate at least one PDU (Protocol Data Unit) and / or at least one SDU (service data unit) according to the descriptions, functions, procedures, proposals, methods and / or operation sequences disclosed in this document. At least one processor (202) may generate messages, control information, data, or information according to the descriptions, functions, procedures, proposals, methods and / or operation sequences disclosed in this document. At least one processor (202) may generate a signal (e.g., baseband signal) including a PDU, SDU, message, control information, data, or information according to the functions, procedures, proposals, and / or methods disclosed in this document and provide it to at least one transceiver (206). At least one processor (202) may receive a signal (e.g., baseband signal) from at least one transceiver (206) and may obtain a PDU, SDU, message, control information, data, or information according to the descriptions, functions, procedures, proposals, methods, and / or operation sequences disclosed in this document.
[0050] At least one processor (202) may be referred to as a controller, microcontroller, microprocessor, or microcomputer. At least one processor (202) may be implemented by hardware, firmware, software, or a combination thereof. For example, at least one application-specific integrated circuit (ASIC), at least one digital signal processor (DSP), at least one digital signal processing device (DSPD), at least one programmable logic device (PLD), or at least one field programmable gate array (FPGA) may be included in at least one processor (202). The descriptions, functions, procedures, proposals, methods, and / or operation sequences disclosed in this document may be implemented using firmware or software, and the firmware or software may be implemented to include modules, procedures, functions, etc. Firmware or software configured to perform the descriptions, functions, procedures, proposals, methods, and / or operation sequences disclosed in this document may be included in at least one processor (202) or stored in at least one memory (204) and driven by at least one processor (202). The descriptions, functions, procedures, proposals, methods, and / or flowcharts disclosed in this document may be implemented using firmware or software in the form of code, instructions, and / or sets of instructions.
[0051] At least one memory (204) may be connected to at least one processor (202) and may store various forms of data, signals, messages, information, programs, codes, instructions, and / or commands. At least one memory (204) may be composed of ROM (read-only memory), RAM (random access memory), EPROM (erasable programmable read-only memory), flash memory, hard drive, registers, cache memory, computer read storage media, and / or combinations thereof. At least one memory (204) may be located inside and / or outside of at least one processor (202). Additionally, at least one memory (204) may be connected to at least one processor (202) via various technologies, such as wired or wireless connections.
[0052] At least one transceiver (206) may transmit user data, control information, wireless signals / channels, etc., as mentioned in the methods and / or operation flowcharts, etc. of this document to at least one other device. At least one transceiver (206) may receive user data, control information, wireless signals / channels, etc., as mentioned in the descriptions, functions, procedures, proposals, methods and / or operation flowcharts, etc. disclosed in this document from at least one other device. For example, at least one transceiver (206) may be connected to at least one processor (202) and may transmit and receive wireless signals. For example, at least one processor (202) may control at least one transceiver (206) to transmit user data, control information, or wireless signals to at least one other device. Additionally, at least one processor (202) may control at least one transceiver (206) to receive user data, control information, or wireless signals from at least one other device. Additionally, at least one transceiver (206) may be connected to at least one antenna (208), and at least one transceiver (206) may be configured to transmit and receive user data, control information, wireless signals / channels, etc., as described in the descriptions, functions, procedures, proposals, methods, and / or operation sequence diagrams disclosed in this document through at least one antenna (208). In this document, at least one antenna may be a plurality of physical antennas or a plurality of logical antennas (e.g., antenna ports). At least one transceiver (206) may convert the received wireless signals / channels, etc., from RF band signals to baseband signals in order to process the received user data, control information, wireless signals / channels, etc., using at least one processor (202). At least one transceiver (206) may convert the processed user data, control information, wireless signals / channels, etc., from baseband signals to RF band signals using at least one processor (202).To this end, at least one transceiver (206) may include an (analog) oscillator and / or filter.
[0053] The components of the wireless device described with reference to FIG. 3 may be referred to by other terms in terms of their function. For example, the processor (202) may be referred to as the control unit, the transceiver (206) as the communication unit, and the memory (204) as the storage unit. In some cases, the communication unit may be used to mean at least a part of the processor (202) and the transceiver (206).
[0054] The structure of the wireless device described with reference to FIG. 3 can be understood as the structure of at least part of various devices. For example, the structure of the wireless device illustrated in FIG. 3 may be at least part of the various devices described with reference to FIG. 2 (e.g., robot (110a), vehicle (110b-1, 110b-2), XR device (110c), portable device (110d), home appliance (110e), IoT device (110f), AI device / server (110g)). Furthermore, according to various embodiments, the device may include other components in addition to the components illustrated in FIG. 3.
[0055] For example, the device may be a portable device such as a smartphone, smartpad, wearable device (e.g., smart watch, smart glasses), or portable computer (e.g., laptop, etc.). In this case, the device may further include at least one of a power supply unit that supplies power and includes a wired / wireless charging circuit, a battery, etc., an interface unit that includes at least one port for connection with another device (e.g., audio input / output port, video input / output port), and an input / output unit for inputting and outputting video information / signals, audio information / signals, data, and / or information input by a user.
[0056] For example, the device may be a mobile device such as a mobile robot, vehicle, train, manned / unmanned aerial vehicle (AV), or ship. In this case, the device may further include at least one of a drive unit comprising at least one of an engine, motor, power train, wheel, brake, and steering device of the device; a power supply unit that supplies power and includes a wired / wireless charging circuit, battery, etc.; a sensor unit that senses state information, environmental information, and user information of the device or its surroundings; an autonomous driving unit that performs functions such as path maintenance, speed control, and destination setting; and a position measurement unit that acquires position information of the moving body through a GPS (global positioning system) and various sensors.
[0057] For example, the device may be an XR device such as an HMD, a HUD (head-up display) equipped in a vehicle, a television, a smartphone, a computer, a wearable device, a home appliance, digital signage, a vehicle, a robot, etc. In this case, the device may further include at least one of a power supply unit that supplies power and includes a wired / wireless charging circuit, a battery, etc., an input / output unit that acquires control information, data, etc. from the outside and outputs a generated XR object, and a sensor unit that senses state information, environment information, and user information of the device or the surroundings of the device.
[0058] For example, the device may be a robot that can be classified into industrial, medical, household, military, etc., depending on the purpose or field of use. In this case, the device may further include at least one of a sensor unit that senses state information, environmental information, and user information of the device or its surroundings, and a drive unit that performs various physical actions, such as moving robot joints.
[0059] For example, the device may be an AI device such as a TV, projector, smartphone, PC, laptop, digital broadcasting terminal, tablet PC, wearable device, set-top box (STB), radio, washing machine, refrigerator, digital signage, robot, vehicle, etc. In this case, the device may further include at least one of an input unit that acquires various types of data from the outside, an output unit that generates output related to sight, hearing, or touch, a sensor unit that senses state information, environmental information, and user information of the device or its surroundings, and a training unit that learns a model composed of an artificial neural network using training data.
[0060] The structure of the wireless device exemplified in FIG. 3 may be understood as part of a terminal (or first node), or part of an intermediate point, or part of a base station (or second node). If the device exemplified in FIG. 3 is a base station (or second node), the device may further include a wired transceiver for front haul and / or back haul communication. However, if the front haul and / or back haul communication is based on wireless communication, at least one transceiver (206) exemplified in FIG. 3 is used for front haul and / or back haul communication, and the wired transceiver may not be included.
[0061] A communication procedure between a first node (e.g., a terminal) and a second node (e.g., a base station) applicable to the present disclosure is illustrated.
[0062] The second node of FIG. 4 supports dynamic spectrum sharing (DSS) and can provide connectivity to both nodes where 6G technology is implemented and nodes where pre-6G wireless communication technology (e.g., 5G, 4G) is implemented. That is, the first node of FIG. 4 may have 6G technology implemented or pre-6G wireless communication technology (e.g., 5G, 4G) implemented. Additionally, the first node and / or the second node may support full duplex mode as well as non-overlapping full duplex mode.
[0063] In FIG. 4, for the sake of simplicity of explanation, the first node and the second node are assumed to be a terminal and a base station, respectively, and the operation of the terminal (110) and the base station (120) transmitting and / or receiving data, and the operation performed prior to this, are illustrated. However, the operation of FIG. 4 is not limited to the operation between the terminal and the base station, but can be interpreted as the operation between the first node and the second node. Additionally, FIG. 4 illustrates the operation of direct transmission and reception of wireless signals between the terminal (110) and the base station (120), but there may be one or more intermediate points between the terminal (110) and the base station (120), and wireless signals may be transmitted and received via one or more intermediate points.
[0064] Referring to FIG. 4, the terminal (110) and the base station (120) can perform synchronization (401). For example, the terminal (110) performs an initial cell search operation. Specifically, the terminal (110) can detect a synchronization signal for at least one base station connection transmitted from the base station (120) according to a predefined rule. Here, the synchronization signal may include a plurality of synchronization signals classified according to structure or use (e.g., a first synchronization signal (e.g., a primary synchronization signal), a second synchronization signal (e.g., a secondary synchronization signal), etc.). Through this, the terminal (110) can identify the boundary of the unit (e.g., frame, subframe, slot and / or symbol) constituting the wireless signal transmission of the base station (120) and obtain information about the base station (120) (e.g., cell identifier).
[0065] The terminal (110) can obtain system information transmitted from the base station (120) (403). System information is information related to the attributes, characteristics, and / or capabilities of the base station (120) required to connect to the base station (120) and use the service, and can be classified according to content (e.g., whether it is essential for connection), transmission structure (e.g., channel used, whether it is provided on-demand), etc., and can be classified, for example, into first system information (e.g., MIB (master information block), primary system information), second system information (e.g., SIB (system information block), secondary system information), etc. If necessary, the terminal (110) may transmit a signal requesting system information prior to receiving the system information. However, the request and provision of system information may be performed after the random access procedure described later.
[0066] A terminal (110) and a base station (120) can perform a random access procedure (405). The terminal (110) can transmit and / or receive at least one message for a random access procedure (e.g., random access preamble, RAR (random access response) message, etc.) based on information related to the channel for the random access procedure of the base station (120) obtained through system information (e.g., channel location, channel structure, structure of supported preamble, etc.). For example, the terminal (110) can transmit a first message (e.g., preamble, MSG1) through the channel for the random access procedure, receive a second message (e.g., RAR message, MSG2), transmit a third message (e.g., MSG3) containing information related to the terminal (110) (e.g., identification information) to the base station (120) using scheduling information included in the second message, and receive a fourth message (e.g., MSG4) for contention resolution and / or connection establishment. As another example, the first message and the third message can be transmitted and received as a single message, or the second message and the fourth message can be transmitted and received as a single message.
[0067] The terminal (110) and the base station (120) can perform signaling of control information (407). Here, the control information can be defined in various layers, such as a layer that controls the connection (e.g., a radio resource control (RRC) layer), a layer that handles mapping between logical channels and transmission channels (e.g., a media access control (MAC) layer), and a layer that handles physical channels (e.g., a physical (PHY) layer). For example, the terminal (110) and the base station (120) can perform at least one of signaling to establish a connection, signaling to determine settings related to communication, and signaling to indicate allocated resources.
[0068] The terminal (110) and the base station (120) can transmit and / or receive data (409). In other words, the terminal (110) and the base station (120) can process, transmit and / or receive data based on the signaling of control information. For example, when transmitting data, the terminal (110) or the base station (120) can perform at least one of channel encoding, rate matching, scrambling, constellation mapping, layer mapping, waveform modulation, antenna mapping, and resource mapping on the information bits. Conversely, when receiving data, the terminal (110) or the base station (120) can perform at least one of signal extraction from resources, antenna-specific waveform demodulation, signal placement considering layer mapping, constellation demapping, descrambling, and channel decoding.
[0069] 6G System Core Technology
[0070] The 6G (wireless communication) system aims for (i) very high data rates per device, (ii) a very large number of connected devices, (iii) global connectivity, (iv) very low latency, (v) reduced energy consumption of battery-free IoT (internet of things) devices, (vi) ultra-reliable connectivity, and (vii) connected intelligence with machine learning capabilities. The vision of the 6G system can be four aspects: intelligent connectivity, deep connectivity, holographic connectivity, and ubiquitous connectivity.
[0071] As core implementation technologies for 6G systems, technologies such as artificial intelligence (AI), THz (Terahertz) communication, optical wireless technology, FSO backhaul network, massive MIMO technology, blockchain, 3D networking, quantum communication, unmanned aerial vehicles, cell-free communication, wireless information and energy transfer (WIET), integration of sensing and communication, integration of access backhaul networks, holographic beamforming, big data analysis, and large intelligent surface (LIS) can be adopted.
[0072] Method for CCE mapping of nested structure
[0073] The contents examined above can be applied in combination with the proposed methods described below, or can be supplemented to clarify the technical characteristics of the proposed methods.
[0074] In addition, the methods described below can be applied in the same way to the NR system (licensed band) or shared spectrum described above, and it goes without saying that the technical concept proposed in this specification can be modified or replaced to fit the terms, expressions, structures, etc. defined in each system so that it can be implemented in the system as well.
[0075] In conventional standards, polar codes may be used for the transmission and reception of UL and DL control channels. The DL control channel may be, for example, a PDCCH. The transmission and reception of a PDCCH may be performed in units of CCEs (Control Channel Elements) within a CORESET (Control Resource Set), which is a resource in the time and frequency axes. One, two, four, eight, or sixteen CCEs may be utilized to transmit a single PDCCH. Depending on the number of CCEs utilized, the AL (Aggregation Level) of a PDCCH candidate may be classified as AL 1, AL 2, AL 4, AL 8, and AL 16.
[0076] The terminal can perform blind decoding for each PDCCH candidate. The terminal can estimate the channel through the DMRS (Demodulation Reference Signal) of the CCE to receive the PDCCH. The terminal can perform blind decoding on multiple PDCCH candidates to receive the PDCCH that matches the terminal's RNTI (Radio Network Temporary Identifier). Therefore, the terminal can estimate the channel for multiple CCEs to fully receive the PDCCH. In addition, the terminal can perform blind decoding on multiple PDCCH candidates.
[0077] To prevent the terminal from performing excessive operations within a single slot, slot group, or span, the number of non-overlapped CCEs and the number of blind decodings for channel estimation may be limited. This limitation may be referred to as the BD (Blind Decoding) / CCE limit. The number of blind decodings performed by the terminal within a single slot and the number of non-overlapped CCEs may be limited per SCS (Subcarrier Spacing). Accordingly, there may be cases where PDCCH candidates exist within a single slot for which actual decoding is not performed.
[0078] In next-generation wireless communication systems such as 6G (6th Generation), polar codes may be applied to traffic channels. When polar codes are applied to traffic channels, a polar code structure that supports retransmission in the form of Incremental Redundancy (IR) (hereinafter referred to as IR-polar) may be considered as one of the methods for determining the coded bits included in the physical channel being retransmitted to support retransmission situations. Channel coding that supports the above IR method can provide a structure in which, when information is transmitted one or more times, the transmitted coded bits can be concatenated and used as a single coded bit. The above structure can be understood as a structure in which the entire coded bit is generated at the transmitting end, and a portion of the entire coded bit is transmitted during each transmission. The receiving end can decode the long coded bit generated by concatenating the coded bits included in different transmissions. Accordingly, when retransmission occurs, the code rate gradually decreases, thereby obtaining the benefit of improved decoding probability.
[0079] FIG. 5 is a diagram illustrating an example of the process in which coded bits are processed from the perspective of channel coding when an IR structure is applied. When information (FG 101) to be transmitted exists at the transmitting end, said information (FG 101) can be encoded (Encoding, FG 102) to generate a total coded bit (FG 103). Partial coded bits, which are separated from a portion of the generated total coded bit (FG 103), can be mapped to respective transmission blocks and transmitted to the receiving end. At this time, the transmission of each partial coded bit (FG 104, FG 105) can be designed to be self-decodable. Each transmitted partial coded bit (FG 104, FG 105) can be decoded independently without the help of other partial coded bits. When multiple different partial coded bits are received at the receiving end, the received partial coded bits can be processed to become a single concatenated coded bit (FG 106) according to a preset rule. The concatenated coded bit (FG 106) can be decoded through a decoder (FG 107) to be estimated as decoded information (FG 108), which is the received information.
[0080] A method for constructing PDCCH candidates for different ALs using an IR-polar structure can be considered. The IR-polar structure can generally be utilized to support retransmission situations. When the first AL is smaller than the second AL, the encoding bits for the PDCCH candidates of the first AL may correspond to the partial encoding bits of FIG. 5. The encoding bits for the PDCCH candidates of the second AL may be configured in the form of the connected encoding bits of FIG. 5. In other words, the IR-polar structure can be formed by the PDCCH candidates of the first AL each constituting a partial encoding bit, and the PDCCH candidates of the second AL constituting an encoding bit formed by connecting multiple partial encoding bits.
[0081] In conventional standards, the mapping relationship between the CCE for PDCCH transmission and the PDCCH candidates for each AL can be configured through a hashing function. For example, in a CORESET composed of 16 CCEs, PDCCH candidates for AL 1, AL 2, and AL 4 can be configured with 4, 2, and 1, respectively. In this case, the mapping relationship between the CCE and the PDCCH candidates for a single terminal can be represented as shown in FIG. 6.
[0082] A CORESET, which is a resource area where a PDCCH can be transmitted, can be configured commonly for multiple terminals. Through the CORESET, a PDCCH can be transmitted to different terminals, or multiple terminals can share and receive a PDCCH. To prevent duplicate transmission of PDCCHs in the same resource area while sharing the CORESET, PDCCH candidates for other terminals can be mapped to CCEs that are not mapped to PDCCH candidates for a specific terminal. FIG. 6 illustrates an example of a structure in which PDCCH candidates transmittable to a specific terminal are mapped to CCEs. The example in FIG. 6 shows an example where four PDCCH candidates for AL 1, two PDCCH candidates for AL 2, and one PDCCH candidate for AL 4 are mapped. This
[0083] For AL L=1, 2, 4, M (L) =4, 2, 1
[0084] It can be expressed as.
[0085] In FIG. 6, the remaining CCEs not mapped to PDCCH candidates (PCs) #0 through #6 may be mapped to PDCCH candidates for other terminals, which may correspond to the unshaded area in FIG. 6. To perform PDCCH monitoring in the corresponding CORESET, the terminal may perform blind decoding for all 7 PDCCH candidates and channel estimation for 8 CCEs. In the embodiment of FIG. 6, a set of CCEs mapped to PDCCH candidates of a relatively small AL, such as the relationship between PC #0, PC #4, and PC #6, may be included in a set of CCEs mapped to PDCCH candidates of a larger AL. This structure may be referred to as a nested structure. A nested CCE-to-PDCCH candidate mapping can mean a mapping to construct a structure in which a CCE mapped to a PDCCH candidate with AL of n belongs to the set of CCEs mapped to a PDCCH candidate with AL of m (where m is an integer greater than n). In Figure 6, PC #2 and PC #5 can also be seen as having a nested structure.
[0086] By applying the above-described IR-polar structure to PDCCH candidates included in the overlapping structure, the effect of reducing the number of blind decodings performed by the terminal or the number of CCEs required for decoding can be obtained. For example, referring to FIG. 6, in the conventional PDCCH monitoring operation, decoding of the polar code can be performed independently for PDCCH candidate (PC) #0 of AL 1 corresponding to CCE index 0, PC #4 of AL 2 corresponding to CCE indices 0 and 1, and PC #6 of AL 4 corresponding to CCE indices 0 to 3. On the other hand, when the PDCCH is configured by utilizing the above-described IR-polar structure, the decoding result of PC #0 can be used for the decoding of PC #4. Additionally, the decoding result of PC #4 can be used for the decoding of PC #6.
[0087] Accordingly, a result can be expected in which the number of CCEs required for actual decoding by the terminal is reduced. Excluding the descrambling process of RNTI, if the terminal first performs blind decoding on the PDCCH candidate of the higher AL, the decoding results of PC #0 and PC #4 can be derived during the decoding process of PC #6. Therefore, the processing of the terminal can be completed with only one decoding operation for the three PDCCH candidates included in the nested structure.
[0088] To address the problem of PDCCH candidates not undergoing actual decoding due to BD / CCE limitations within a single slot, a nested CCE-to-PDCCH candidate mapping method may be proposed for next-generation wireless communication systems including 6G. Through the proposed method, the operation of a terminal performing excessive blind decoding within a single slot can be prevented. Furthermore, by preventing PDCCH candidates from being omitted due to excessive blind decoding, benefits may be provided in terms of the terminal's decoding performance or latency.
[0089] Although the above-mentioned nested CCE-to-PDCCH candidate mapping method is proposed and described within the specification assuming the above-mentioned IR-polar structure, the proposed method may also be applied to other channel coding schemes if they operate in a manner similar to the above-mentioned IR-polar or are consistent with the operating principle of the proposed method, thereby maintaining the spirit of the present invention.
[0090] In the following, communication terms and operating principles of the system are explained based on a 6G wireless communication system. However, the proposed method is not limited thereto and can be widely applied to general wireless communication systems as long as the spirit of the present invention is maintained.
[0091] In this specification, a mapping structure between PDCCH candidates and CCEs and a method for determining the location or order in which each PDCCH candidate is mapped to a CCE may be proposed. The proposed nested CCE-to-PDCCH candidate mapping method may include a starting CCE index when each PDCCH candidate is mapped to a CCE and an order in which each CCE index is selected.
[0092] For the proposed PDCCH candidates with a nested structure, it can be assumed that the terminal performs decoding in the following two ways.
[0093] - The terminal can perform decoding starting from the PDCCH candidate of the large AL.
[0094] For example, a terminal can perform decoding starting from a PDCCH candidate composed of a large number of CCEs. When the terminal decodes PDCCH candidate A of L1, which is an AL greater than 1 included in a nested structure, it can be expected that other PDCCH candidates included in the nested structure, which are ALs smaller than L1, will be decoded together during the decoding process of PDCCH candidate A.
[0095] Based on the IR-polar structure, the decoding of the above PDCCH candidate A can be performed based on the decoding results of PDCCH candidate A_1 and PDCCH candidate A_2, where AL is half of L1. Therefore, when the terminal decodes the PDCCH candidate of the largest AL forming the overlapping structure, the decoding of all PDCCH candidates of AL included in the overlapping structure can also be performed simultaneously.
[0096] - The terminal can perform decoding starting from the PDCCH candidate of the small AL.
[0097] The terminal can perform decoding starting from a PDCCH candidate composed of a small number of CCEs. Generally, the terminal can perform decoding starting from a PDCCH candidate where AL is 1. When the terminal decodes a PDCCH candidate of L2 with a small AL, the decoding result can be used to decode a PDCCH candidate that has an AL twice that of L2 and is included in the same nested structure. Therefore, when the terminal decodes a PDCCH candidate where AL is 2*L2, the decoding process for half of the CCEs can reuse the results previously performed for a PDCCH candidate where AL is L2, so the decoding process can be reduced by that proportion.
[0098] If the terminal follows one or more of the two assumed operations, a significant reduction in polar decoding for detecting PDCCH when the terminal performs decoding in a specific CORESET can be expected. The total number of CCEs decoded by the terminal can be significantly reduced through the proposed nesting structure. Since the terminal can share some decoding processes among PDCCH candidates within the nesting structure, an early termination effect can also be expected. The total number of blind decodings, excluding the RNTI scrambling process, can be reduced, which enables blind decoding for high SS (Search Space) set indices that were originally dropped due to BD / CCE limitations.
[0099] Method 1: CCE Mapping of PDCCH Candidates Considering Nested Structures
[0100] The proposed structure, 'nested CCE-to-PDCCH candidate mapping' or 'nested mapping structure', may be configured such that a set of CCEs to which a PDCCH candidate of a first AL is mapped includes a set of CCEs to which one or more of the PDCCH candidates of a second AL smaller than the first AL are mapped.
[0101] For example, CCEs mapped to PDCCH candidates with AL of L1 may include CCEs mapped to PDCCH candidates with AL of L2 (where L1 is an integer greater than L2). The above inclusion relationship can be applied repeatedly up to PDCCH candidates with AL of 1. Therefore, the above nesting structure can be understood as a structure in which one or more PDCCH candidates of different ALs are mapped to a specific set of CCEs. To utilize the above IR-polar structure, the starting CCE index of each of the above PDCCH candidates can be configured identically. An example of the structure proposed in this way can be shown as in FIG. 7.
[0102] Referring to FIG. 7, PDCCH candidates for AL 16, AL 8, AL 4, AL 2, and AL 1 can be mapped to CCE indices 0 through 15. This may correspond to Group 0 of FIG. 7 described above. The starting CCE index of each of the above PDCCH candidates may all be configured identically as CCE index 0. The PDCCH candidate for AL 1 may be mapped to CCE index 0. The PDCCH candidate for AL 2 may be mapped in the order of CCE indices 0 and 1. The PDCCH candidate for AL 16 may be mapped in the order of CCE indices 0 through 15. PDCCH candidates for AL 8, AL 4, AL 2, and AL 1 may be mapped to CCE indices 16 through 23, which may correspond to Group 1 of FIG. 7. When mapping is performed in this manner, the terminal can have the PDCCH candidates mapped to the CCE to have multiple nested structures within the corresponding CORESET.
[0103] As described above, the decoding operation for the CCE mapped to the PDCCH candidates constituting the nested structure can be performed once (without redundancy). When the terminal decodes the PDCCH candidate of AL 16 mapped to CCE indices 0 to 15 of FIG. 7, the decoding of the PDCCH candidates of AL 8, AL 4, AL 2, and AL 1, which form a nested structure with it, is not performed redundantly. Therefore, there is an effect of reducing the overall decoding complexity.
[0104] In the case where conventional polar decoding is performed without considering the IR-polar structure in the mapped structure as shown in Fig. 7, the total number of blind decodings may be 23, consisting of 8 PDCCH candidates for AL 1, 8 PDCCH candidates for AL 2, 4 PDCCH candidates for AL 4, 2 PDCCH candidates for AL 8, and 1 PDCCH candidate for AL 16. Additionally, the total number of CCEs calculated for this decoding may be 72. On the other hand, when the IR-polar structure and the superposition structure are considered, the total number of CCEs calculated for the decoding may be reduced to approximately 40. Furthermore, when the RNTI scrambling process is excluded, the total number of blind decodings may be reduced to 8.
[0105] In a scenario where multiple terminals share a CORESET, a CCE index mapping method can be considered to ensure that PDCCH candidates for each terminal have a nested structure. This CCE index mapping may include the CCE index starting from each PDCCH candidate and the CCE mapping order.
[0106] FIG. 7, described above, illustrates an embodiment in which PDCCH candidates are mapped in the CORESET based on a single terminal. In FIG. 7, the unshaded white areas may represent regions where the PDCCH candidates are not mapped. Therefore, PDCCH candidates that other terminals can expect may be mapped to these regions. Consequently, when PDCCH candidates are mapped to CCEs based on the nesting structure, the nesting structure may be newly configured for the remaining CCEs that are not mapped by a specific terminal and assigned to other terminals.
[0107] FIG. 8 illustrates a mapping method in the embodiment of FIG. 7 in which PDCCH candidates utilize unmapped CCEs to form a new nested structure. To this end, PDCCH candidates can be mapped to CCEs in reverse order. For example, PDCCH candidates for AL 16 can be mapped in the order of CCE indices 31, 30, ..., 16. This is the result of reversing the mapping order of CCEs while maintaining the same starting CCE index to which PDCCH candidates are mapped in order to form a nested structure.
[0108] Referring to FIGS. 7 and 8, it is confirmed that the CCE mappings of PDCCH candidates for two different terminals each maintain an independent nested structure, and that combinations of CCEs do not overlap. In this CCE mapping, the starting CCE index of the PDCCH candidates having a nested structure can be determined as the CCE to which the PDCCH candidate of AL 1 within the structure is mapped. Furthermore, the CCE mapping order of the PDCCH candidates within the nested structure can be mapped starting from the PDCCH candidate of the lowest first AL. Additionally, the PDCCH candidate of the second AL, which is the next highest after the first AL, can be mapped preferentially to a CCE index that overlaps with the CCE of the PDCCH candidate of the first AL, and then mapped later to a CCE index that does not overlap. This mapping order can be applied repeatedly until the PDCCH candidate of the largest AL included in the nested structure is mapped.
[0109] When multiple terminals share a CORESET and there are insufficient available CCEs, PDCCH candidates from the larger AL can be mapped by allowing overlap. PDCCH candidates from the smaller AL can avoid overlap as much as possible to form an overall overlap structure for each terminal.
[0110] FIG. 9 shows the number of PDCCH candidates M for AL L=1 for two different terminals, terminal 0 (UE#0) and terminal 1 (UE#1). (L) The number of PDCCH candidates M where this is 2 and AL L=2 (L) The number of PDCCH candidates M where this is 2 and AL L=4 (L) This is a diagram illustrating an example where PDCCH candidates are mapped to form an overlapping structure in the case of 1. The number of available CCEs within the CORESET is limited to a maximum of 4, and two terminals may share the CORESET. In this case, overlap may be allowed for the PDCCH candidates of AL 4 for two different terminals. For the PDCCH candidates of AL 2 and AL 1, since there are sufficient available CCEs, they can be mapped to avoid mutual overlap. Figure 9 shows the result of CCE mapping according to these rules.
[0111] When multiple terminals share a CORESET and available CCE resources are insufficient, overlap of PDCCH candidates for relatively small ALs may be allowed. In such cases, a method for determining the order of the starting CCE index and the mapping CCE index may be defined.
[0112] FIG. 10 shows the number of PDCCH candidates M for AL L=1 for four different terminals, terminal 0 (UE#0), terminal 1 (UE#1), terminal 2 (UE#2), and terminal 3 (UE#3). (L) The number of PDCCH candidates M where is 1 and AL L=2 (L) The number of PDCCH candidates M where is 1 and AL L=4 (L) This is a diagram showing an example in which PDCCH candidates are mapped to form an overlapping structure. Referring to Fig. 10, because there is a shortage of available CCEs within the CORESET, only the PDCCH candidates of AL 1 for each terminal are mapped without overlapping, while the PDCCH candidates of AL 2 and AL 4 can be mapped with overlapping allowed.
[0113] Referring to FIG. 10, PDCCH candidates for each terminal form an overlapping structure, and mapping is performed to avoid overlapping as much as possible. For each terminal, PDCCH candidates with AL 1 can be mapped to CCE indices 0, 1, 2, and 3, respectively, without overlapping. PDCCH candidates with AL 2 are distributed without overlapping as much as possible, so that the PDCCH candidates of terminal 0 and terminal 1 are mapped to CCE indices 0 and 1, and the PDCCH candidates of terminal 2 and terminal 3 are mapped to CCE indices 2 and 3. The PDCCH candidates with AL 2 of terminal 0 and terminal 1 are mapped by sharing the same CCE, but the mapping order may differ. In the case of terminal 0, they may be mapped in the order of CCE indices 0 and 1, and in the case of terminal 1, they may be mapped in the order of CCE indices 1 and 0. This is a mapping CCE index order to ensure that PDCCH candidates of lower AL do not overlap with each other while maintaining the nested structure.
[0114] According to the same method, the PDCCH candidates of AL 4 can be mapped in the order of CCE indices 0, 1, 2, and 3 for the terminal 0. The PDCCH candidates of AL 4 for the terminal 1 can be mapped in the order of CCE indices 1, 0, 3, and 2 or in the order of CCE indices 1, 0, 2, and 3. The PDCCH candidates of AL 4 can be mapped first to CCEs that overlap with the PDCCH candidates of AL 2, and later to CCEs that do not overlap with the PDCCH candidates of AL 2. When the PDCCH candidates of AL 4 are mapped to CCEs that do not overlap with the PDCCH candidates of AL 2, they may follow the order of the CCEs that overlap with the PDCCH candidates of AL 2 that were mapped first, or they may follow the order of mapping from the lowest index to the highest index. According to the proposed mapping order, the PDCCH candidates of AL 4 of the terminal 2 can be mapped in the order of CCE index 2, 3, 0, 1, and the PDCCH candidates of AL 4 of the terminal 3 can be mapped in the order of CCE index 3, 2, 1, 0.
[0115] For a single terminal, an overlapping structure can be applied to cross-carrier scheduling where the carrier performing instructions via DCI (Downlink Control Information) and the carrier transmitting and receiving data via said instructions are different. In conventional standards, parameters (e.g., n CI Self-carrier scheduling and cross-carrier scheduling can be distinguished through ). Based on self-carrier scheduling, a hashing function can be defined so that PDCCH candidates for cross-carrier can be mapped adjacently. The proposed nesting structure can be applied to PDCCH candidates for cross-carrier scheduling.
[0116] For PDCCH candidates for cross-carrier scheduling of a terminal, the mapping method for different terminals described above may be applied. From the perspective of terminals sharing the entire CORESET, the mapping method for one terminal among the mapping methods for different terminals described above may be used for one carrier. For example, if an additional cross-carrier scheduling is configured for a terminal, the CCE mapping described above with reference to FIGS. 7 and FIGS. 8 may be configured for one terminal.
[0117] Alternatively, additional CCE indices may be configured, and PDCCH candidates for the cross-carrier scheduling may be mapped to the corresponding CCEs. On one side of the terminal, the number of available CCEs increases, but each PDCCH candidate may be configured to avoid overlap while maintaining the nested structure.
[0118] Alternatively, as in the conventional method, PDCCH candidates for the cross-carrier scheduling may be mapped to CCE indices corresponding to multiples of each AL so that they can be configured adjacent to PDCCH candidates for self-carrier scheduling. For example, mapping may be performed so that an overlapping structure is maintained based on PDCCH candidates of a higher AL.
[0119] In the case where a situation is assumed in which, in addition to self-carrier scheduling where the number of PDCCH candidates for ALs are 8, 8, 4, 2, and 1 respectively for ALs of 1, 2, 4, 8, and 16, cross-carrier scheduling where the number of PDCCH candidates for ALs of 1, 2, 4, and 8 respectively is additionally mapped, the PDCCH candidates of the higher AL are preferentially mapped to CCE indices corresponding to multiples of the AL, and the PDCCH candidates of the lower AL can be mapped sequentially so that the nesting structure can be maintained.
[0120] Figure 11 illustrates an example of a mapping method in a cross-carrier scheduling situation. Referring to Figure 11, the CCEs indicated by the hatched pattern represent CCEs that were first mapped for self-carrier scheduling, and the CCEs indicated by the dot pattern represent CCEs for cross-carrier scheduling. Referring to Figure 11, one PDCCH candidate of AL 8, the largest AL for cross-carrier scheduling, can be mapped adjacently to the PDCCH candidate of AL 8 for the existing self-carrier scheduling. Since there is one or more PDCCH candidates for AL 4, AL 2, and AL 1 for cross-carrier scheduling, CCE mapping can be performed according to the nested structure. The second PDCCH candidate, AL 4 for cross-carrier scheduling, is mapped adjacently to the PDCCH candidate of AL 4 for self-carrier scheduling. The second PDCCH candidate with AL 2 and the second PDCCH candidate with AL 1 can be mapped to the second PDCCH candidate with AL 4 in a nested structure. The third and fourth PDCCH candidates with AL 2 and the third and fourth PDCCH candidates with AL 1 are mapped while forming a nested structure. Since the remaining two PDCCH candidates with AL 1 cannot form a nested structure and must be mapped additionally, they can be mapped adjacent to the PDCCH candidate with AL 1 for the existing self-carrier scheduling.
[0121] Method 2: Hashing function considering nested structures
[0122] The proposed nested CCE-to-PDCCH candidate mapping or nested mapping structure is configured such that a set of CCEs mapped to PDCCH candidates of a larger AL includes a set of CCEs mapped to one or more PDCCH candidates of an AL smaller than the larger AL. For example, CCEs mapped to PDCCH candidates of AL L1 may include CCEs mapped to PDCCH candidates of AL L2 (where L1 is an integer greater than L2). This inclusion relationship may be repeated up to PDCCH candidates of AL 1. Thus, the nested structure can be understood as a structure in which one or more PDCCH candidates of different ALs are mapped to a specific set of CCEs. To utilize the IR-polar structure, the starting CCE index of each PDCCH candidate can be configured identically.
[0123] In conventional standards, a hashing function may be defined to map the above PDCCH candidates to CCEs for each AL. For example, through a hashing function, the available CCE resources of the entire CORESET may be divided into M(L) sub-bands, and each PDCCH candidate may be located in each sub-band. In Method 2, a hashing function for applying nested mapping may be proposed. The proposed hashing function may be constructed by partially referencing the hashing function in the conventional standard.
[0124] In the conventional standard (Section 10.1 of 3GPP TS 38.213), for an SS set s associated with CORESET p, the carrier indicator field value n CI Slot for the active DL BWP of the serving cell corresponding to PDCCH candidates of the above SS set The CCE indices for AL L corresponding to can be determined by Equation 1.
[0125] [Mathematical Formula 1]
[0126]
[0127] In the above mathematical formula, for any CSS (Common Search Space) It can be 0.
[0128] Regarding USS (UE-specific Search Space) = (A p · ) mod D and Y p,-1 = n RNTI It can be ≠ 0. In this case, if p mod 3 = 0, A p If = 39827 and p mod 3 = 1, then A p If = 39829 and p mod 3 = 2, then A p = 39839 and D = 65537.
[0129] Also, i = 0, ..., L-1.
[0130] N CCE,p exists within the above CORESET p and ranges from 0 to N CCE,p It is the number of CCEs numbered up to -1.
[0131] When a carrier indicator field is configured by CrossCarrierSchedulingConfig for a serving cell where PDCCH is monitored at the terminal, the above n CI is the value of the above-mentioned carrier indicator field. However, in the case of scheduling the above-mentioned serving cell from the same serving cell, n CI = 0. In other cases including any of the above CSS, the above n CI = can be 0.
[0132] = 0, ..., It is -1. Here is n CI It may be the number of PDCCH candidates set to be monitored by the terminal for the AL L of the SS set s for the serving cell corresponding to.
[0133] For all CSS, am.
[0134] About the USS is all n set for CCE AL L of SS set s CI Across the values It can be the maximum value of.
[0135] n RNTI The RNTI value used for this can be C-RNTI (Cell RNTI).
[0136] The PDCCH candidates to which a hashing function can be applied and the CCE mapping operations thereto can be performed under the following preconditions.
[0137] - First, AL is L i The number of PDCCH candidates is M(L i When defined as ), L i Ga L i-1 If it is greater than M(L i ) is M(L i-1 It has a value less than or equal to ).
[0138] - Second, AL is L i The PDCCH candidates for the total CCE resources are M(L i Each sub-band created by dividing into ) is mapped one by one.
[0139] - Third, the above AL is L i Among the PDCCH candidates, the CCEs constituting the m-th PDCCH candidate are those with a specific CCE index c(m, L i Starting with ), continuous L i It consists of CCEs. Consecutive CCEs are not limited to having consecutive indices in ascending or descending order, and the mapping order of consecutive CCEs within a single subband can be determined separately.
[0140] PDCCH candidates for a single terminal are mapped to CCEs through a series of processes branching according to the corresponding AL.
[0141] In the case of the first condition where AL is 1, the following process is repeated while sequentially increasing the index m from 0 to M(1).
[0142] - The m-th PDCCH candidate in the first condition above consists of one CCE selected with c(m, 1), determined by a conventional hashing function, as the starting CCE index. In other words, the starting CCE index c(m, 1) is a multiple of 1 and is determined through the hashing function.
[0143] AL is L i In the case of the second condition (where i is an integer greater than 1), different mapping processes are performed as follows depending on the range of the index m.
[0144] - m from 0 to M(L i If it falls within the first range corresponding to )-1, AL is L i The m-th PDCCH candidate is AL L i-1 c(m, L) is the starting CCE index of the m-th PDCCH candidate. i-1 It is mapped to consist of consecutive Li CCEs starting from ). In other words, the above CCE index c(m, L i ) is c(m, L i-1 It is set to be the same as ).
[0145] - m is M(L i From ) to M(L i-1 If it falls within the second range corresponding to )-1, the m-th PDCCH candidate is M(L from the 0th in the preceding process. i-1 For CCEs where PDCCH candidates up to the )-1th are not mapped, c(m, L) determined by the hashing function i It is mapped to consist of Li consecutive CCEs with ) as the starting CCE index. In other words, the CCE index c(m, L i ) is, c(0, L i) to c(m-1, L i Not ) but L i As a multiple of, it is determined through a hashing function.
[0146] Furthermore, an optional mapping operation may be additionally performed to minimize the PDCCH blocking probability. If the optional operation is applied, the starting CCE index c(m, L) for the m-th PDCCH candidate i ) is AL is L i+1 PDCCH candidates are selected from the remaining area excluding the mapped CCEs. In other words, CCE index c(m, L i ) is, c(0, L i ) to the above c(m-1, L i Not ) but L i It is a multiple of, and AL is L i+1 PDCCH candidates are determined from among the unmapped CCEs through a hashing function.
[0147] The proposed hashing function is,
[0148] - Starting CCE index c(m, Li) for mapping PDCCH candidates consisting of consecutive CCEs and
[0149] - Defined for two factors: the order in which PDCCH candidates are mapped to consecutive CCEs based on the starting CCE index.
[0150] The PDCCH candidates to which the hashing function is applied and their corresponding CCE mappings follow the following assumptions.
[0151] - The CCEs within the CORESET to which the PDCCH candidate is mapped are indexed sequentially starting from the lowest or highest frequency range.
[0152] - AL is from L1 to L max It consists of up to.
[0153] - AL is L iWhen the number of PDCCH candidates is defined as M(Li), the above L i Ga L i+1 If smaller than the above M(L i ) is M(L i+1 That is all.
[0154] - AL is L i Among the PDCCH candidates, the CCEs constituting the m-th PDCCH candidate are the starting CCE index c(m, L i From ) continuous L i It consists of several CCEs.
[0155] - CCEs mapped to a PDCCH candidate for a single terminal are selected so as not to overlap with CCEs mapped to a PDCCH candidate for another terminal, to the extent possible. However, if available CCE resources are insufficient, the CCEs mapped to a PDCCH candidate for a single terminal and the CCEs mapped to a PDCCH candidate for another terminal may be configured identically.
[0156] The starting CCE index is not determined by being limited to only the highest or lowest index among the CCEs to which the PDCCH candidate is mapped, nor are the indices of the CCEs to which the PDCCH candidate is mapped always composed of sequential values starting from the aforementioned starting CCE index.
[0157] The CCEs mapped to the PDCCH candidates are determined through the following process, taking into account different terminals and carriers.
[0158] - First, all CCE resources are floor[N CCE / M(L i M(L having the size of )] i It is divided into ) subbands. Within each subband, the CCE indexes to which PDCCH candidates can be mapped are L i * (n mod {floor[N CCE / L i It is determined through ]}) + i.
[0159] - Within the subband, Li CCEs are set as a single CCE set unit, and the nth CCE set is determined to be the CCEs to which the PDCCH candidates are actually mapped.
[0160] - For PDCCH candidates for different carriers and different terminals, a mapping target CCE is selected by prioritizing that other PDCCH candidates within each subband do not overlap with the mapped CCEs.
[0161] PDCCH candidates for one terminal and one carrier are mapped first, and PDCCH candidates for another carrier and another terminal are mapped sequentially.
[0162] - AL is L max If a PDCCH candidate maps to a CCE, then m ranges from 0 to M(L max When )-1, the m-th PDCCH candidate is mapped with priority given to the lower CCE index within the subband while following the previously described rule. For example, starting from a value where n is 0, it is checked whether the corresponding n value is suitable, and the n value is selected. The operation of determining and mapping the n value includes the following operations (1) to (6).
[0163] (1) An action that is optionally performed or omitted, wherein AL is L max+1 If a CCE index mapped to a PDCCH candidate of another terminal exists, the n value selectable with that CCE index is excluded, and the n+1 value is selected.
[0164] (2) If there is a PDCCH candidate already mapped for the CCE index corresponding to the selected n value, the n+1 value is selected.
[0165] (3) n value is floor(N CCE / L i If ) is not selected, a random value of n is selected. In this case, AL is L max+1If a CCE index mapped to a PDCCH candidate of another terminal exists, a different value of n other than the value of n selectable with that CCE index is selected in priority.
[0166] (4) The m-th PDCCH candidate is mapped to the CCE indices given by the selected n value.
[0167] (5) CCE indexes are selected so that PDCCH candidates for different carriers and different terminals are mapped with minimal overlap, but overlap is allowed if available CCE resources are insufficient.
[0168] (6) An offset may be set in the value of n for determining the mapping location of the CCE so that the mapping of the PDCCH candidate of another terminal is performed while avoiding the mapped CCE. The offset is of the conventional standard. It can be determined arbitrarily, like a variable, or pre-set or instructed by the base station.
[0169] - AL is L i (Here L i is L max If a PDCCH candidate (less than) maps to CCE, operation 1 or operation 2 is performed depending on the range of index m.
[0170] (Operation 1) From m 0, M(L i-1 When )-1, the m-th PDCCH candidate is AL is L i-1 The m-th PDCCH candidate is mapped to the CCE determined according to the above rule for the mapped CCEs.
[0171] (Operation 2) The above m is M(L i-1 From ) to M(L i When )-1, the m-th PDCCH candidate is M(L starting from the 0th. i-1 For CCEs that are not mapped to the )-1st PDCCH candidate, they are mapped to the CCE determined according to the above rule.
[0172] According to the above rules, PDCCH candidates are mapped to CCE in order from highest to lowest AL.
[0173] For PDCCH candidates mapped to CCE, the starting CCE index c(m, L i Based on the ) and start CCE index, the order in which PDCCH candidates are mapped to consecutive CCEs is determined as follows.
[0174] - Starting CCE index c(m, L i ) is determined by one or more of the following conditions.
[0175] (1) The CCE index that is common to the sets of CCEs mapped to PDCCH candidates of different consecutive ALs is the starting CCE index c(m, L i It is determined as follows. If two or more CCEs are common, the starting CCE index is determined as the lowest or highest index. Specifically, if the CCEs do not overlap with other terminal's PDCCH candidates, the CCE index of the lowest or highest index is determined as the starting CCE index according to a pre-set rule or instructions for the terminal. On the other hand, if the CCEs overlap with other terminal's PDCCH candidates, a different CCE index other than the starting CCE index for other terminal's PDCCH candidates is determined as the starting CCE index (if possible).
[0176] (2) For the m-th PDCCH candidate where AL is L1 (where L1 is 1), all CCE indices mapped to that PDCCH candidate are determined as the starting CCE indices.
[0177] (3) AL is L i (Here i For the starting CCE index of the m-th PDCCH candidate (where is an integer greater than 1), AL is L i-1The starting CCE index of the m-th PDCCH candidate is determined by the above starting CCE index. In other words, CCE index c(m, L i ) is the CCE index c(m, L i-1 It is set to be the same as ).
[0178] Next, the order in which PDCCH candidates are mapped to consecutive CCEs based on the starting CCE index is determined as follows.
[0179] (1) For the m-th PDCCH candidate where AL is L1 (where L1 is 1), the starting CCE index c(m, L1) has the first mapping order.
[0180] (2) AL is L i For the m-th PDCCH candidate (where i is an integer greater than 1), L i-1 The CCEs identical to the mapped CCE of the m-th PDCCH candidate are AL is L i-1 It is mapped in the same order as the m-th PDCCH candidate. L i-1 The unmapped CCEs of the m-th PDCCH candidate are L i-1 L in the mapping CCE index of the m-th PDCCH candidate i The order of addition or L i It is mapped in the order excluding . Or, L i-1 CCEs for which the m-th PDCCH candidate is not mapped are mapped in ascending or descending order of the CCE index according to a preset rule or instructions for the terminal.
[0181] It is evident that the examples of the proposed methods described above can also be included as one of the implementation methods and thus can be regarded as a type of proposed method. Furthermore, while the proposed methods described above may be implemented independently, they may also be implemented in the form of a combination (or merger) of some proposed methods. Rules may be defined so that information regarding the application of the proposed methods (or information regarding the rules of the proposed methods) is communicated by a base station to a terminal or by a transmitting terminal to a receiving terminal via a predefined signal (e.g., a physical layer signal or a higher layer signal).
[0182] Implementation example
[0183] FIG. 12 is a flowchart according to one embodiment.
[0184] Referring to FIG. 12, one embodiment based on the methods of the present specification may be a method comprising: receiving information about an SS set (S1201); and monitoring PDCCH candidates based on said information (S1203). Additionally, a corresponding method may be included in the embodiment, comprising: transmitting information about an SS set (S1201); and transmitting a PDCCH based on said information (S1203).
[0185] The information regarding the SS set in FIG. 12 is information for defining how / where the terminal will search for PDCCH candidates. The information regarding the SS set can be replaced with expressions such as information about PDCCH candidates, information about PDCCH, information about PDCCH resources, or information for monitoring PDCCH (candidates). Alternatively, it may be briefly expressed as 'configuration information'.
[0186] In addition to the operation of FIG. 12, one or more operations disclosed through Method 1 and / or Method 2 may be performed.
[0187] For example, information regarding the SS set may include information regarding the ALs set on a specific terminal and the number of PDCCH candidates for each of the ALs.
[0188] ALs may include, for example, 1, 2, 4, 8, and 16, and the number of PDCCH candidates for each AL is set independently. The number of PDCCH candidates for a specific AL may be set to one of 0, 1, 2, 3, 4, 5, 6, and 8. In relation to the nested structure proposed in this specification, at least two different PDCCH candidates may be set for a specific terminal.
[0189] Referring to FIGS. 6 through 11 and the descriptions of methods 1 through 2, at least two PDCCH candidates associated with a specific carrier of a specific terminal can form an overlapping structure. In this case, all CCE(s) mapped to the first PDCCH candidate of the first AL set in the specific terminal overlap with the CCE(s) mapped to the second PDCCH candidate of the second AL, which is larger than the first AL. Based on this, the starting CCE index for the first PDCCH candidate is determined to be the same as the starting CCE index of the second PDCCH candidate.
[0190] When the AL of a PDCCH candidate is greater than 1, the PDCCH candidate is mapped to consecutive CCE indices starting from the starting CCE index and up to the size of AL, similar to the conventional method. However, by referring to FIG. 10 and the related description of FIG. 10 and the 'order in which a PDCCH candidate is mapped to consecutive CCEs based on the starting CCE index' of Method 2, the order in which a PDCCH candidate is mapped to CCE indices can be differentiated from the conventional method.
[0191] Conventionally, the mapping order of CCE indices for PDCCH candidates was determined only in ascending order from the starting CCE index. On the other hand, referring to the preceding methods, the mapping order of CCE indices can be determined based on PDCCH candidates and CCE indices mapped to consider multiple terminals or carriers.
[0192] From the perspective of a specific terminal, for a first PDCCH candidate and a second PDCCH candidate with the same starting CCE, if the first AL is 1 and the second AL is 2, the mapping order for the CCE indices of the second PDCCH candidate is the direction in which the remaining CCE indices, excluding the starting CCE index, are located.
[0193] If the first AL is greater than 1 and the second AL is greater than the first AL, the mapping order for the CCE indices of the second PDCCH candidate is determined in the same order as the mapping order for the CCE indices of the first PDCCH candidate for CCEs that overlap with the first PDCCH candidate. For CCEs that do not overlap with the first PDCCH candidate, the order is determined in ascending or descending order of the CCE indices. Whether the order is determined in ascending or descending order may be determined by a pre-set rule or instruction.
[0194] If the number of PDCCH candidates of the first AL is 2 or more, the first PDCCH candidate forms an overlapping structure with the second PDCCH candidate, so the third PDCCH candidate of the first AL is mapped to CCEs that do not overlap with the second PDCCH candidate. However, if there is no CCE that does not overlap with the second PDCCH candidate, the third PDCCH candidate may be mapped to CCEs that overlap with the CCEs to which the second PDCCH candidate is mapped, and to CCEs to which the first PDCCH candidate is not mapped.
[0195] Referring to FIG. 11 and an example of PDCCH candidates for self-carrier scheduling / cross-carrier scheduling, if the carrier containing the resource scheduled by the third PDCCH candidate and the carrier containing the resource scheduled by the first PDCCH candidate are different, the mapping order for the CCE indices of the third PDCCH candidate may be determined differently from the mapping order for the CCE indices of the first PDCCH candidate.
[0196] From the perspective of a specific terminal, the terminal does not directly perform the mapping between PDCCH candidates and CCEs. However, the specific terminal can perform monitoring of PDCCH candidates by determining, estimating, or assuming the CCEs to which each PDCCH candidate is mapped (and / or CCE indices and / or the mapping order of CCE indices) based on information regarding the SS set (and / or information regarding the CORESET). Alternatively, for PDCCH monitoring, mapping information between PDCCH candidates and CCEs for another terminal may be transmitted from the base station to the specific terminal.
[0197] In an environment where multiple terminals share a CORESET, if each terminal blind-decodes PDCCH candidates for CCEs with different mapping orders, the terminal can early terminate the decoding of PDCCH candidates that were not transmitted to it. Specifically, as the CCE mapping order is set differently between terminals, the position of the frozen bit in the polar code for the received encoded bit is configured differently for each terminal. Therefore, during the sequential decoding stage, such as the SC (Successive Cancellation) or SCL (Successive Cancellation List), the terminal can determine early that the corresponding PDCCH candidate was not transmitted to it and can stop the operation before completing the decoding of the entire bit.
[0198] The embodiments described above are combinations of the components and features of the present disclosure in a specific form. Each component or feature should be considered optional unless otherwise explicitly stated. Each component or feature may be implemented in a form not combined with other components or features. Additionally, it is possible to construct embodiments of the present disclosure by combining some components and / or features. The order of operations described in the embodiments of the present disclosure may be changed. Some components or features of one embodiment may be included in another embodiment, or may be replaced with corresponding components or features of another embodiment. It is obvious that embodiments may be constructed by combining claims that are not explicitly related in the claims, or that they may be included as new claims by amendment after filing.
[0199] It is obvious to those skilled in the art that the present disclosure may be embodied in other specific forms without departing from the features of the present disclosure. Accordingly, the foregoing detailed description should not be interpreted restrictively in all respects and should be considered illustrative. The scope of the present disclosure shall be determined by a reasonable interpretation of the appended claims, and all modifications within the equivalent scope of the present disclosure are included within the scope of the present disclosure.
[0200] As described above, the embodiments of this specification can be applied to various wireless communication systems.
Claims
1. Regarding the method, A step of receiving information about the SS (search space) set; and The step of monitoring PDCCH (physical downlink control channel) candidates based on the above information; The above information includes information on the number of PDCCH candidates for each of the set AL (aggregation levels), and The above ALs include a first AL and a second AL larger than the first AL, and Based on the fact that all CCE(s) (control channel element(s)) mapped to the first PDCCH candidate, which is the first AL, overlap with the CCEs mapped to the second PDCCH candidate, which is the second AL, the starting CCE index of the first PDCCH candidate is determined to be the same CCE index as the starting CCE index of the second PDCCH candidate. method.
2. In Paragraph 1, The above second PDCCH candidate is mapped to consecutive CCE indices from the above starting CCE index up to the size of the above second AL, and The mapping order for the CCE indices of the second PDCCH candidate is determined in the same order as the mapping order for the CCE indices of the first PDCCH candidate for the CCEs that overlap with the CCEs mapped to the first PDCCH candidate. method.
3. In Paragraph 2, The mapping order of the above-mentioned second PDCCH candidate to the above-mentioned CCE indices is determined in ascending or descending order of the CCE indices for CCEs that do not overlap with the CCEs to which the above-mentioned first PDCCH candidate is mapped. method.
4. In Paragraph 1, The third PDCCH candidate, which is the first AL, is mapped to CCEs that do not overlap with the CCEs mapped to the second PDCCH candidate, based on the fact that all CCE(s) mapped to the first PDCCH candidate overlap with the CCEs mapped to the second PDCCH candidate. method.
5. In Paragraph 1, Based on the fact that the carrier containing the resource scheduled by the third PDCCH candidate, which is the first AL, and the carrier containing the resource scheduled by the first PDCCH candidate are different from each other, the mapping order for the CCE indices of the third PDCCH candidate is determined differently from the mapping order for the CCE indices of the first PDCCH candidate. method.
6. In the device, At least one processor; and It includes at least one memory connected to the at least one processor so as to be operable, and storing instructions that cause the at least one processor to perform a specific operation when executed. The above specific operation is: A step of receiving information about the SS (search space) set; and The step of monitoring PDCCH (physical downlink control channel) candidates based on the above information; The above information includes information on the number of PDCCH candidates for each of the set AL (aggregation levels), and The above ALs include a first AL and a second AL larger than the first AL, and Based on the fact that all CCE(s) (control channel element(s)) mapped to the first PDCCH candidate, which is the first AL, overlap with the CCEs mapped to the second PDCCH candidate, which is the second AL, the starting CCE index of the first PDCCH candidate is determined to be the same CCE index as the starting CCE index of the second PDCCH candidate. device.
7. In Paragraph 1, The above second PDCCH candidate is mapped to consecutive CCE indices from the above starting CCE index up to the size of the above second AL, and The mapping order for the CCE indices of the second PDCCH candidate is determined in the same order as the mapping order for the CCE indices of the first PDCCH candidate for the CCEs that overlap with the CCEs mapped to the first PDCCH candidate. device.
8. In Paragraph 7, The mapping order of the above-mentioned second PDCCH candidate to the above-mentioned CCE indices is determined in ascending or descending order of the CCE indices for CCEs that do not overlap with the CCEs to which the above-mentioned first PDCCH candidate is mapped. device.
9. In Paragraph 6, The third PDCCH candidate, which is the first AL, is mapped to CCEs that do not overlap with the CCEs mapped to the second PDCCH candidate, based on the fact that all CCE(s) mapped to the first PDCCH candidate overlap with the CCEs mapped to the second PDCCH candidate. device.
10. In Paragraph 6, Based on the fact that the carrier containing the resource scheduled by the third PDCCH candidate, which is the first AL, and the carrier containing the resource scheduled by the first PDCCH candidate are different from each other, the mapping order for the CCE indices of the third PDCCH candidate is determined differently from the mapping order for the CCE indices of the first PDCCH candidate. device.
11. In Paragraph 6, The above device is a terminal comprising at least one transceiver or a processor for controlling the terminal, device.
12. A computer-readable non-volatile storage medium comprising at least one computer program that causes a terminal including at least one processor to perform an operation, wherein the operation is: A step of receiving information about the SS (search space) set; and The step of monitoring PDCCH (physical downlink control channel) candidates based on the above information; The above information includes information on the number of PDCCH candidates for each of the set AL (aggregation levels), and The above ALs include a first AL and a second AL larger than the first AL, and Based on the fact that all CCE(s) (control channel element(s)) mapped to the first PDCCH candidate, which is the first AL, overlap with the CCEs mapped to the second PDCCH candidate, which is the second AL, the starting CCE index of the first PDCCH candidate is determined to be the same CCE index as the starting CCE index of the second PDCCH candidate. Storage medium.
13. Regarding the method, A step of transmitting information about the SS (search space) set; and The method includes the step of transmitting a PDCCH (physical downlink control channel) based on the above information; The above information includes information on the number of PDCCH candidates for each of the set AL (aggregation levels), and The above ALs include a first AL and a second AL larger than the first AL, and Based on the fact that all CCE(s) (control channel element(s)) mapped to the first PDCCH candidate, which is the first AL, overlap with the CCEs mapped to the second PDCCH candidate, which is the second AL, the starting CCE index of the first PDCCH candidate is determined to be the same CCE index as the starting CCE index of the second PDCCH candidate. method.
14. In the device, At least one processor; and It includes at least one memory connected to the at least one processor so as to be operable, and storing instructions that cause the at least one processor to perform a specific operation when executed. The above specific operation is: A step of transmitting information about the SS (search space) set; and The method includes the step of transmitting a PDCCH (physical downlink control channel) based on the above information; The above information includes information on the number of PDCCH candidates for each of the set AL (aggregation levels), and The above ALs include a first AL and a second AL larger than the first AL, and Based on the fact that all CCE(s) (control channel element(s)) mapped to the first PDCCH candidate, which is the first AL, overlap with the CCEs mapped to the second PDCCH candidate, which is the second AL, the starting CCE index of the first PDCCH candidate is determined to be the same CCE index as the starting CCE index of the second PDCCH candidate. device.
