Method and device for transmitting data based on multiple carriers in wireless communication system
By scheduling data channels on multiple carrier waves using FDRA, the method improves data transmission efficiency and coverage in 5G and 6G systems, addressing the challenges of high-frequency band management.
Patent Information
- Application Number
- PCT/KR2026/096771
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-05-14
- Filing Date
- 2026-05-08
- Publication Date
- 2026-11-19
AI Technical Summary
Existing wireless communication systems face challenges in efficiently managing data transmission across multiple carrier waves, particularly in high-frequency bands, which affects the performance and coverage of 5G and emerging 6G mobile communication technologies.
A method and apparatus for scheduling a data channel on a plurality of carrier waves, utilizing frequency domain resource allocation (FDRA) information to determine frequency resources for data transmission and reception between terminals and base stations.
Enhances data transmission efficiency and coverage by effectively utilizing multiple carriers, supporting advanced services in 5G and laying the groundwork for 6G mobile communication systems.
Smart Images

Figure KR2026096771_19112026_PF_FP_ABST
Abstract
Description
Multiple Carrier-Based Data Transmission Method and Device in a Wireless Communication System
[0001] The present disclosure relates to the operation of a terminal and a base station in a wireless communication system. Specifically, the present disclosure relates to a method for a terminal to generate a data channel on a plurality of carrier waves and an apparatus capable of performing the same.
[0002] 5G mobile communication technology defines a wide frequency band to enable fast transmission speeds and new services, and can be implemented not only in frequency bands below 6 GHz ('Sub 6 GHz'), such as 3.5 gigahertz (3.5 GHz), but also in ultra-high frequency bands called millimeter waves (mmWave), such as 28 GHz and 39 GHz ('Above 6 GHz'). In addition, for 6G mobile communication technology, which is referred to as a system beyond 5G, implementation in the terahertz band (e.g., the 3 terahertz (3 THz) band at 95 GHz) is being considered to achieve transmission speeds 50 times faster and ultra-low latency reduced to one-tenth compared to 5G mobile communication technology.
[0003] In the early stages of 5G mobile communication technology, aiming to satisfy service support and performance requirements for enhanced Mobile BroadBand (eMBB), Ultra-Reliable Low-Latency Communications (URLLC), and Massive Machine-Type Communications (mMTC), technologies included beamforming and Massive MIMO to mitigate path loss and increase transmission distance in ultra-high frequency bands; support for various numerologies (such as operating multiple subcarrier spacings) and dynamic operation of slot formats for the efficient utilization of ultra-high frequency resources; initial access techniques to support multi-beam transmission and broadband; the definition and operation of Band-Width Parts (BWP); Low Density Parity Check (LDPC) codes for high-volume data transmission; new channel coding methods such as Polar Codes for the reliable transmission of control information; and L2 pre-processing (L2 Standardization has been carried out for pre-processing, network slicing which provides a dedicated network specialized for specific services, and other methods.
[0004] Currently, discussions are underway to improve and enhance the performance of the initial 5G mobile communication technology, taking into account the services that the 5G mobile communication technology was intended to support. Additionally, standardization of the physical layer is in progress for technologies such as V2X (Vehicle-to-Everything), which helps autonomous vehicles make driving decisions and enhance user convenience based on their own location and status information transmitted by the vehicle; NR-U (New Radio Unlicensed), which aims for system operation in unlicensed bands to comply with various regulatory requirements; NR terminal low power consumption technology (UE Power Saving); Non-Terrestrial Network (NTN), which is direct terminal-satellite communication for securing coverage in areas where communication with the terrestrial network is impossible; and positioning.
[0005] In addition, standardization is underway in the field of wireless interface architecture / protocols for technologies such as the Industrial Internet of Things (IIoT) to support new services through linkage and convergence with other industries, Integrated Access and Backhaul (IAB) which provides nodes to expand network service areas by integrating wireless backhaul links and access links, Mobility Enhancement including Conditional Handover and Dual Active Protocol Stack (DAPS) Handover, and 2-step Random Access (2-step RACH for NR) which simplifies random access procedures. Standardization is also underway in the field of system architecture / services for 5G baseline architectures (e.g., Service based Architecture, Service based Interface) to incorporate Network Functions Virtualization (NFV) and Software-Defined Networking (SDN) technologies, and Mobile Edge Computing (MEC), which provides services based on the location of the terminal.
[0006] When such 5G mobile communication systems are commercialized, connected devices, which are increasing explosively, will be connected to communication networks. Accordingly, it is expected that there will be a need to enhance the functionality and performance of 5G mobile communication systems and to integrate the operation of connected devices. To this end, new research is planned to be conducted on 5G performance improvement and complexity reduction, support for AI services, support for metaverse services, and drone communication using eXtended Reality (XR), Artificial Intelligence (AI), and Machine Learning (ML) to efficiently support Augmented Reality (AR), Virtual Reality (VR), and Mixed Reality (MR).
[0007] Furthermore, the advancement of these 5G mobile communication systems encompasses multi-antenna transmission technologies such as new waveforms, Full Dimensional MIMO (FD-MIMO), array antennas, and large-scale antennas to guarantee coverage in the terahertz band of 6G mobile communication technology; metamaterial-based lenses and antennas; high-dimensional spatial multiplexing technology using Orbital Angular Momentum (OAM); and Reconfigurable Intelligent Surface (RIS) technology to improve terahertz band signal coverage; as well as full-duplex technology for enhancing frequency efficiency and system networks in 6G mobile communication technology; AI-based communication technologies that realize system optimization by utilizing satellites and Artificial Intelligence (AI) from the design stage and internalizing end-to-end AI support functions; and the realization of services of complexity exceeding the limits of terminal computing capabilities by utilizing ultra-high-performance communication and computing resources. It could serve as a foundation for the development of next-generation distributed computing technologies.
[0008] The disclosed embodiment aims to provide an apparatus and method capable of effectively providing services in a mobile communication system. Specifically, it provides a method and apparatus for transmitting and receiving data when a single data channel is scheduled on a plurality of carrier waves.
[0009] The present disclosure describes a method for a terminal to receive a data channel on a plurality of carriers and a method to transmit it to a base station. According to the present disclosure, a method performed by a terminal of a communication system comprises: receiving configuration information for a plurality of carriers from a base station; receiving scheduling information for a data channel mapped to the plurality of carriers from the base station, wherein the scheduling information includes FDRA (frequency domain resource allocation) information for a reference carrier, and the reference carrier is one of the carriers; determining a frequency resource of the data channel on the plurality of carriers based on the FDRA information; and receiving downlink data from the base station at the frequency resource of the data channel.
[0010] In addition, a method performed by a base station of a communication system comprises: a step of transmitting configuration information for a plurality of carriers to a terminal; a step of transmitting scheduling information for a data channel mapped to the plurality of carriers to the terminal, wherein the scheduling information includes FDRA (frequency domain resource allocation) information for a reference carrier, and the reference carrier is one of the carriers among the plurality of carriers; and a step of transmitting downlink data from the frequency resources of the data channel to the terminal, wherein the FDRA information is related to the frequency resources of the data channel on the plurality of carriers.
[0011] Additionally, a terminal of a communication system comprises: at least one transceiver; at least one processor connected to the at least one transceiver so as to be able to communicate with the at least one transceiver; and a memory connected to the at least one processor so as to be able to communicate with the at least one processor and capable of executing the at least one processor individually or in any combination thereof, wherein the terminal: receives configuration information for a plurality of carriers from a base station, receives scheduling information for a data channel mapped to the plurality of carriers from the base station, wherein the scheduling information includes FDRA (frequency domain resource allocation) information for a reference carrier, wherein the reference carrier is one of the carriers among the plurality of carriers, determines the frequency resources of the data channel on the plurality of carriers based on the FDRA information, and stores an instruction to receive downlink data from the base station at the frequency resources of the data channel.
[0012] Additionally, a base station of a communication system comprises: at least one transceiver; at least one processor connected to the at least one transceiver so as to be able to communicate with the at least one transceiver; and a memory connected to the at least one processor so as to be able to communicate with the at least one processor and capable of executing the at least one processor individually or in any combination thereof, wherein the base station: transmits configuration information for a plurality of carriers to a terminal and transmits scheduling information for a data channel mapped to the plurality of carriers to the terminal, wherein the scheduling information includes FDRA (frequency domain resource allocation) information for a reference carrier, wherein the reference carrier is one of the carriers among the plurality of carriers, and stores a command to transmit downlink data from the frequency resource of the data channel to the terminal; and wherein the FDRA information is related to the frequency resource of the data channel on the plurality of carriers.
[0013] The disclosed embodiments may provide an apparatus and a method capable of effectively providing services in a mobile communication system. Specifically, a base station and a terminal can effectively transmit and receive data channels mapped to a plurality of carrier waves.
[0014] FIG. 1 is a diagram illustrating the basic structure of the time-frequency domain in a wireless communication system according to one embodiment of the present disclosure.
[0015] FIG. 2 is a drawing illustrating a frame, subframe, and slot structure in a wireless communication system according to one embodiment of the present disclosure.
[0016] FIG. 3 is a drawing illustrating an example of a bandwidth portion setting in a wireless communication system according to one embodiment of the present disclosure.
[0017] Figure 4 is a diagram illustrating an example of a control area in which a downlink control channel is transmitted in a 5G wireless communication system.
[0018] Figure 5 is a diagram illustrating an example of a basic unit of time and frequency resources that constitute a downlink control channel that can be used in 5G.
[0019] FIG. 6 is a diagram illustrating an example of a base station and a terminal transmitting and receiving data in consideration of downlink data channels and rate matching resources.
[0020] FIG. 7 is a diagram illustrating an example of frequency axis resource allocation of a PDSCH in a wireless communication system according to one embodiment of the present disclosure.
[0021] FIG. 8 is a diagram illustrating an example of time-axis resource allocation of PDSCH in a wireless communication system according to one embodiment of the present disclosure.
[0022] FIG. 9 is a diagram illustrating an example of time-axis resource allocation according to the subcarrier interval of a data channel and a control channel in a wireless communication system according to one embodiment of the present disclosure.
[0023] FIG. 10 is a diagram illustrating an example of a wireless protocol structure of a base station and a terminal in a single cell, carrier aggregation, and dual connectivity situation according to one embodiment of the present disclosure.
[0024] FIG. 11 is a diagram illustrating an example of scheduling data channels on multiple carriers.
[0025] FIG. 12 is a drawing illustrating an example of determining a scheduled VRB according to the 3-1 to 3-2 determination methods of the present disclosure.
[0026] FIG. 13 is a diagram illustrating an example of identifying a PRB when one FDRA is indicated for all (scheduled) carriers according to one embodiment of the present disclosure.
[0027] Figure 14 is a diagram illustrating an example of VRB-to-PRB by carrier.
[0028] FIG. 15 is a drawing illustrating an example of VRB-to-PRB mapping according to one embodiment of the present disclosure.
[0029] FIG. 16 is a drawing illustrating another example of VRB-to-PRB mapping according to one embodiment of the present disclosure.
[0030] FIG. 17 is a diagram illustrating an example of resource determination and code block mapping of a plurality of carriers according to the present disclosure.
[0031] FIG. 18 is a drawing illustrating another example of resource determination and code block mapping of a plurality of carriers according to the present disclosure.
[0032] FIG. 19 is a drawing illustrating another example of resource determination and code block mapping of a plurality of carriers according to the present disclosure.
[0033] FIG. 20 is a drawing illustrating another example of resource determination and code block mapping of a plurality of carriers according to the present disclosure.
[0034] FIG. 21a is a diagram illustrating an example of the operation of a base station performing transmission of a downlink data channel based on at least one embodiment of the present disclosure.
[0035] FIG. 21b is a diagram illustrating an example of the operation of a terminal performing reception of a downlink data channel based on at least one embodiment of the present disclosure.
[0036] FIG. 22a is a diagram illustrating an example of the operation of a base station performing reception of an uplink data channel based on at least one embodiment of the present disclosure.
[0037] FIG. 22b is a diagram illustrating an example of the operation of a terminal performing transmission of an uplink data channel based on at least one embodiment of the present disclosure.
[0038] FIG. 23 is a block diagram of a terminal or user equipment (2300) according to one embodiment of the present disclosure.
[0039] FIG. 24 is a block diagram of a base station (2400) according to one embodiment of the present disclosure.
[0040] FIG. 25 is a block diagram of a network entity (2500) that performs network functions according to one embodiment of the present disclosure.
[0041] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the attached drawings.
[0042] In describing the embodiments, technical details that are well known in the art to which this disclosure belongs and are not directly related to this disclosure are omitted. This is intended to convey the essence of this disclosure more clearly without obscuring it by omitting unnecessary explanations.
[0043] For the same reason, some components in the attached drawings have been exaggerated, omitted, or schematically depicted. Additionally, the size of each component does not entirely reflect its actual size. Identical or corresponding components in each drawing have been assigned the same or different reference numbers.
[0044] The advantages and features of the present disclosure, and the methods for achieving them, will become clear by referring to the embodiments described below in detail together with the accompanying drawings. However, the present disclosure is not limited to the embodiments disclosed below but may be implemented in various different forms. These embodiments are provided merely to ensure that the disclosure is complete and to fully inform those skilled in the art of the scope of the disclosure, and the present disclosure is defined only by the scope of the claims. Throughout the specification, the same reference numerals refer to the same components. Furthermore, in describing the present disclosure, if it is determined that a detailed description of a related function or configuration might unnecessarily obscure the essence of the present disclosure, such detailed description is omitted. Additionally, the terms described below are defined considering their functions in the present disclosure, and these may vary depending on the intentions or conventions of the user or operator. Therefore, their definitions should be based on the content throughout the specification.
[0045] In the present disclosure, it will be understood that each block of the process flow diagrams and combinations of the flow diagrams may be performed based on computer program instructions. Since these computer program instructions may be optionally loaded into at least one processor of a general-purpose computer, a computer for special purposes, or other programmable data processing equipment, the instructions performed through any one or any combination of at least one processor of the computer or other programmable data processing equipment create means for performing the functions described in the flow diagram block(s). Since these computer program instructions may also be stored in computer-available or computer-readable memory that can be directed toward the computer or other programmable data processing equipment to implement the functions in a specific manner, the instructions stored in computer-available or computer-readable memory may also produce a manufactured item containing means of instruction for performing the functions described in the flow diagram block(s). Since computer program instructions can be loaded onto a computer or other programmable data processing equipment, instructions that perform a series of operation steps on the computer or other programmable data processing equipment to create a process executed by the computer can also provide steps for executing the functions described in the flowchart block(s).
[0046] Additionally, each block may represent a module, segment, or part of code containing one or more executable instructions for executing a specified logical function(s). It should also be noted that in some alternative execution examples, the functions mentioned in the blocks may occur out of order. For example, two blocks (or functions) described in succession may actually be executed substantially simultaneously, or the blocks may sometimes be executed in reverse order according to the corresponding function.
[0047] As used in the embodiments of the present disclosure, the term “part” refers to a software or hardware component, such as a field programmable gate array (FPGA) or an application-specific integrated circuit (ASIC), and the “part” performs certain roles. However, the term including “part” is not limited to software or hardware. The “part” may be configured to reside in an addressable storage medium or may be configured to run on one or more processors. Thus, by example, the “part” includes components such as software components, object-oriented software components, class components, and task components, as well as processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables. The functions provided within the components and “parts” may be combined into a smaller number of components and “parts” or further separated into additional components and “parts.” In addition, the components and 'parts' may be implemented to utilize one or more CPUs (central processing units) within the device or secure multimedia card. Also, in the embodiments, the 'parts' may include one or more processors.
[0048] As stated above, it should be noted that the blocks of each flowchart and combinations of flowcharts described in this disclosure may be executed by one or more computer programs including instructions. The entirety of one or more computer programs may be stored in a single memory device, or one or more computer programs may be divided into different parts and stored across multiple memory devices.
[0049] Additionally, any / any function or operation described in this disclosure may be processed by a single processor or a combination of processors. The single processor or combination of processors is a circuitry that performs processing and may include an application processor (AP, e.g., a central processing unit (CPU)), a communication processor (CP, e.g., a modem), a graphics processing unit (GPU), a neural network processing unit (NPU) (e.g., an artificial intelligence (AI) chip), a Wi-Fi chip, a Bluetooth® chip, a global positioning system (GPS) chip, a near-field communication (NFC) chip, a connectivity chip, a sensor controller, a touch controller, a fingerprint sensor controller, a display driver integrated circuit (IC), an audio codec (CODEC) chip, a universal serial bus (USB) controller, a camera controller, an image processing IC, a microprocessor unit (MPU), a system-on-chip (SoC), an IC, or similar circuitry.
[0050] Additionally, it should be noted that various embodiments in the claims and description of the present disclosure may be implemented in the form of hardware, software, or a combination of hardware and software.
[0051] Such software may be stored on a non-transitory computer-readable storage medium. A non-transitory computer-readable storage medium stores one or more computer programs (software modules), and said one or more computer programs include computer-executable instructions that operate an electronic device to perform a method according to the present disclosure when executed alone or collectively by one or more processors of an electronic device.
[0052] The software may be stored in a transient or non-transient storage device, for example, in the form of read-only memory (ROM) (whether or not it is erasable or rewritable), or random access memory (RAM), memory chips, devices, or integrated circuits (ICs). Additionally, the software may be stored in the form of an optically or magnetically readable medium, for example, a compact disc (CD), a digital multifunction disc (DVD), a magnetic disc, or a magnetic tape. It should be understood that the storage device and the storage medium are examples of non-transient machine-readable storage media suitable for storing programs for implementing various embodiments of the present disclosure. Accordingly, various embodiments of the present disclosure may provide a program containing code for implementing a device or method according to any one of the claims of this specification, and a non-transient machine-readable storage medium storing such program.
[0053] In the following disclosure, determining the priority between A and B may be referred to in various ways, such as selecting the one with the higher priority according to a predetermined priority rule and performing the corresponding action, or omitting or dropping the action for the one with the lower priority.
[0054] Hereinafter, 'A or B' as described in the present disclosure may be understood as 'A and / or B', which may be understood as including 'A', or 'B', or 'A and B'.
[0055] Additionally, 'at least one of A, B, and C' described in the present disclosure may be understood to include 'A', or 'B', or 'C', or 'any combination of A, B, and C'.
[0056] Additionally, 'at least one of A, B, or C' described in the present disclosure may be understood to include 'A', or 'B', or 'C', or 'any combination of A, B, and C'.
[0057] Additionally, 'A / B' as described in the present disclosure may be understood as 'A and / or B', which may be understood as including 'A', or 'B', or 'A and B'.
[0058] Additionally, 'A, B' described in the present disclosure may be understood as 'A and / or B', which may be understood as including 'A', or 'B', or 'A and B'.
[0059] Additionally, 'A and B' described in the present disclosure may be understood as 'A and / or B', which may be understood as including 'A', or 'B', or 'A and B'.
[0060] Furthermore, the phrase "when conditions A and B are satisfied" as described in the present disclosure is not necessarily limited to cases where both conditions A and B are satisfied, but may be understood to include cases where either condition A or condition B is satisfied individually, cases where both conditions A and B are satisfied, or cases where one or more additional conditions are satisfied together.
[0061] Furthermore, throughout this specification, ordinal terms (and similar modifiers) such as 'first', 'second', 'third', etc. are used solely for the purpose of distinguishing various instances, occurrences, configurations, messages, stages, or aspects of elements, operations, or information, as described below. Unless clearly required otherwise by the context, the use of such ordinal terms does not require that the elements, operations, or information distinguished by such terms be structurally different, numerically distinct, or essentially different. For example, 'first signal' and 'second signal' may represent instances of the same signal transmitted at different times, signals containing the same core information even with some variations, or signals having different content or characteristics depending on the specific context. Similarly, 'first value' and 'second value' may represent the same magnitude measured or applied in different situations, or may represent different magnitudes. Such interpretation must be determined based on the specific technical context, function, and relationship described in the relevant parts of the specification and claims.
[0062] Furthermore, although terms such as "first," "second," etc., as used in this disclosure are used for various elements such as information, objects, actions, and sequences, they are not intended to limit such elements to a specific order. These terms may be understood merely as distinguishing one element from another. For example, a first element may be referred to as a second element, and likewise, a second element may be referred to as a first element.
[0063] Additionally, the terms 'first' and 'second' described in this disclosure may be understood to refer to identical or different elements. For example, if an element is information, the first information and the second information may both be information, and depending on the case, they may be the same information or different information.
[0064] Furthermore, the expressions 'if' and 'in case that' described in this disclosure or claims may be interpreted, depending on the context, as meaning 'when or upon,' 'in response to,' 'based on,' or 'according to,' and these expressions may be used interchangeably. In addition, other expressions having substantially the same meaning may be used as substitutes, provided that they do not impair the technical features of this disclosure.
[0065] Additionally, the term "not perform" as used in this disclosure or claims may be understood, depending on the context, to mean to omit or skip the corresponding step. Such a term may be replaced with other terms having the same or substantially similar meaning.
[0066] Additionally, the phrase "transmitting a message containing A and B" as described in this specification may be interpreted to include not only (i) cases where A and B are transmitted as a single message, but also (ii) cases where A and B are transmitted individually through multiple messages (e.g., transmitting a first message containing A and a second message containing B). This interpretation may also apply to cases where messages containing two or more items, such as A, B, and C, are transmitted together or individually.
[0067] In addition, 'transmitting a message containing A and transmitting a message containing B' can also be interpreted as transmitting a single message containing A and B.
[0068] In the specific embodiments of the present disclosure described below, terms or components included in the disclosure will be expressed in the singular or plural form according to the specific embodiments presented. However, the singular or plural expression is selected to suit the circumstances presented for convenience of explanation, and the present disclosure is not limited to singular or plural components; even if a component is expressed in the plural form, it may be composed in the singular form, and even if a component is expressed in the singular form, it may be composed in the plural form.
[0069] The drawings or flowcharts described below illustrate exemplary methods that may be implemented in accordance with the principles of the present disclosure, and various modifications may be made to the methods illustrated in the flowcharts of the present disclosure. For example, although illustrated as a series of steps, the various steps of each drawing or flowchart may overlap, occur in parallel, occur in a different order, or occur multiple times. In other examples, any step may be omitted or replaced with another step.
[0070] The methods and devices proposed in the embodiments of the present disclosure below are not limited to each embodiment and may be utilized as a combination of all or part of the embodiments proposed in the disclosure. Accordingly, the embodiments of the present disclosure may be applied with some modifications within the scope that does not deviate significantly from the scope of the present disclosure, at the judgment of a person skilled in the art.
[0071] In this case, any wording mentioned in different embodiments may be used interchangeably, combined, or substituted if the concepts correspond. For example, regarding the same or corresponding concepts, even if the expression 'A' is used in one embodiment and the expression 'B' is used in another embodiment, they may be understood by interchangeably, substituted, or combined.
[0072] Terms used in the following description to identify connection nodes, terms referring to network entities, terms referring to messages, terms referring to interfaces between network entities, terms referring to various identification information, etc., are examples provided for the convenience of explanation. Accordingly, the present disclosure is not limited to the terms described below, and other terms referring to objects having equivalent technical meanings may be used. Furthermore, where appropriate, such terms may be replaced with terms defined in the 3GPP (3rd generation partnership project) Technical Specifications (TS).
[0073] Hereinafter, the base station, as the entity performing resource allocation for terminals, may be at least one of gNode B, eNode B, Node B, BS (base station), wireless access unit, base station controller, or a node on a network. Additionally, the base station of the present disclosure may include a structure split into a central unit (CU) and a distributed unit (DU). In such a structure, the CU is responsible for the upper layer of the control and user plane, and the DU is responsible for wireless resource processing of the lower layer. The embodiments of the present disclosure can be equally applied to a 5G base station structure in which functions are separated into the CU and DU as described above.
[0074] The terminal may include UE (user equipment), MS (mobile station), cellular phone, smartphone, computer, or a multimedia system capable of performing communication functions.
[0075] In the present disclosure, a downlink (DL) refers to a wireless transmission path of a signal transmitted by a base station to a terminal, and an uplink (UL) refers to a wireless transmission path of a signal transmitted by a terminal to a base station.
[0076] In addition, while 5th generation mobile communication systems (5G, new radio, NR) and 6th generation mobile communication systems (6G) may be described below as examples, embodiments of the present disclosure may also be applied to other communication systems having similar technical backgrounds or channel types. For example, new advanced mobile communication systems developed after 5G and 6G may be included therein. Furthermore, the present disclosure may be applied to other communication systems (e.g., Wi-Fi systems) with some modifications made in the judgment of a person with skilled technical knowledge, without significantly departing from the scope of the present disclosure.
[0077] In the following description, the terms "physical channel" and "signal" may be used interchangeably with "data" or "control signal." For example, PDSCH (physical downlink shared channel) is a term referring to a physical channel through which data is transmitted, but PDSCH may also be used to refer to data. That is, in this disclosure, the expression "transmits a physical channel" may be interpreted as equivalent to the expression "transmits data or a signal through a physical channel."
[0078] In describing the present disclosure below, the term "upper layer signaling" may be a signaling corresponding to at least one or a combination of at least one of MIB (master information block), SIB (system information block), SIB M (M=1, 2, ...), RRC (radio resource control), MAC (medium access control), CE (control element), NAS (non-access stratum) signaling, or application layer messages. The RRC signaling may also be referred to as L3 signaling (layer 3 signaling).
[0079] Additionally, L1 signaling may be a signaling method corresponding to at least one or a combination of at least one of the following: a physical layer channel or signaling of a PDCCH (physical downlink control channel), a DCI (downlink control information), a UE-specific DCI, a group common DCI, a common DCI, a scheduling DCI (e.g., a DCI used for the purpose of scheduling downlink or uplink data), a non-scheduling DCI (e.g., a DCI not used for the purpose of scheduling downlink or uplink data), a PUCCH (physical uplink control channel), or an UCI (uplink control information). The above L1 signaling may also be referred to as physical layer signaling.
[0080] Hereinafter, the expression in the present disclosure or claims that information can be configured from a base station may mean that, depending on the context, a terminal receives said information from a base station through physical layer signaling or upper layer signaling, and such expression may be replaced with other terms having the same or substantially similar meaning.
[0081] The operating principle of the present disclosure will be explained in detail below with reference to the attached drawings.
[0082] Wireless communication systems are evolving from providing early voice-oriented services to broadband wireless communication systems that provide high-speed, high-quality packet data services, such as communication standards like 3GPP’s HSPA (High Speed Packet Access), LTE (Long Term Evolution or E-UTRA (Evolved Universal Terrestrial Radio Access)), LTE-Advanced (LTE-A), LTE-Pro, 3GPP2’s HRPD (High Rate Packet Data), UMB (Ultra Mobile Broadband), and IEEE’s 802.16e.
[0083] As a representative example of the above-mentioned broadband wireless communication system, the LTE system employs the Orthogonal Frequency Division Multiplexing (OFDM) method for the downlink (DL) and the Single Carrier Frequency Division Multiple Access (SC-FDMA) method for the uplink (UL). The uplink refers to a wireless link through which a terminal (User Equipment (UE) or Mobile Station (MS)) transmits data or control signals to a base station (eNode B, or base station (BS)), and the downlink refers to a wireless link through which a base station transmits data or control signals to a terminal. The above-mentioned multiple access method can distinguish the data or control information of each user by allocating and operating time-frequency resources to be sent for each user so that they do not overlap, that is, so that orthogonality is established.
[0084] As a future communication system following LTE, that is, a 5G communication system, it must be able to freely reflect the diverse requirements of users and service providers, and therefore, services that satisfy various requirements simultaneously must be supported. Services being considered for the 5G communication system include enhanced Mobile Broadband (eMBB), massive Machine Type Communication (mMTC), and Ultra Reliability Low Latency Communication (URLLC).
[0085] eMBB aims to provide data transmission speeds that are superior to those supported by existing LTE, LTE-A, or LTE-Pro. For example, in a 5G communication system, eMBB must be able to provide a peak data rate of 20 Gbps in the downlink and 10 Gbps in the uplink from the perspective of a single base station. Furthermore, while providing these peak data rates, the 5G communication system must also provide an increased user-perceived data rate. To satisfy these requirements, it necessitates improvements in various transmission and reception technologies, including enhanced Multi-Input Multi-Output (MIMO) transmission technology. Additionally, while LTE transmits signals using a maximum bandwidth of 20 MHz in the 2 GHz band, the 5G communication system can meet the data transmission speeds required by using a frequency bandwidth wider than 20 MHz in frequency bands of 3–6 GHz or above 6 GHz.
[0086] At the same time, mMTC is being considered to support application services such as the Internet of Things (IoT) in 5G communication systems. To efficiently provide IoT, mMTC requires support for the connection of a large number of terminals within a cell, improved terminal coverage, enhanced battery life, and reduced terminal costs. Since IoT provides communication functions by attaching to various sensors and devices, a large number of terminals within a cell (e.g., 1,000,000 terminals / km²) 2It must be able to support mMTC. In addition, due to the nature of the service, terminals supporting mMTC are likely to be located in dead zones where cells cannot cover, such as building basements, so they may require wider coverage compared to other services provided by the 5G communication system. Terminals supporting mMTC must consist of low-cost devices, and since it is difficult to frequently replace the device's battery, a very long battery life of 10 to 15 years may be required.
[0087] Finally, URLLC is a mission-critical cellular-based wireless communication service. For example, consider services used for remote control of robots or machinery, industrial automation, unmanned aerial vehicles, remote health care, and emergency alerts. Therefore, the communication provided by URLLC must offer very low latency and very high reliability. For instance, services supporting URLLC must satisfy an air interface latency of less than 0.5 milliseconds, and simultaneously 10 -5 The following packet error rate requirements apply. Therefore, for services supporting URLLC, 5G systems must provide a Transmit Time Interval (TTI) smaller than other services, and at the same time, design considerations may be required to allocate a wide resource in the frequency band to ensure the reliability of the communication link.
[0088] The three 5G services, namely eMBB, URLLC, and mMTC, can be multiplexed and transmitted within a single system. In this case, different transmission and reception techniques and parameters may be used between the services to satisfy the different requirements of each service. Of course, 5G is not limited to the three services mentioned above.
[0089] The frame structure of the 5G system will be explained in more detail below with reference to the drawings.
[0090] Figure 1 is a diagram illustrating the basic structure of the time-frequency domain, which is a wireless resource domain where data or control channels are transmitted in a 5G system.
[0091] The horizontal axis of FIG. 1 represents the time domain, and the vertical axis represents the frequency domain. In the time and frequency domains, the basic unit of a resource is a resource element (RE, 101), which can be defined as one OFDM (orthogonal frequency division multiplexing) symbol (102) on the time axis and one subcarrier (103) on the frequency axis. In the frequency domain (For example, 12) consecutive REs can form a single resource block (resourcebBlock, RB, 104).
[0092] Figure 2 is a diagram illustrating an example of the frame, subframe, and slot structure of a 5G system.
[0093] FIG. 2 illustrates an example of a frame (200), subframe (201), and slot (202) structure. One frame (200) can be defined as 10ms. One subframe (201) can be defined as 1ms, and thus one frame (200) can be composed of a total of 10 subframes (201). One slot (202, 203) can be defined as 14 OFDM symbols (i.e., the number of symbols per slot). = 14). A subframe (201) may be composed of one or more slots (202, 203), and the number of slots (202, 203) per subframe (201) may vary depending on the setting value μ (204, 205) for the subcarrier spacing (SCS). In an example of FIG. 2, cases where μ=0 (204) and μ=1 (205) are shown as the subcarrier spacing setting values.
[0094] When μ=0 (204), 1 subframe (201) can be composed of 1 slot (202), and when μ=1 (205), 1 subframe (201) can be composed of 2 slots (203). That is, depending on the setting value μ for the subcarrier spacing, the number of slots per subframe ( ) may vary, and accordingly, the number of slots per frame ( ) may vary. Depending on each subcarrier interval setting μ and It can be defined as shown in Table 1 below.
[0095] μ 014101114202214404314808414160165143203261464064
[0096] Next, the bandwidth part (BWP) setting in the 5G communication system will be explained in detail with reference to the drawing.
[0097] FIG. 3 is a drawing illustrating an example of a bandwidth portion setting in a wireless communication system according to one embodiment of the present disclosure.
[0098] FIG. 3 shows an example in which the terminal bandwidth (UE bandwidth, 300) is configured into two bandwidth parts, namely bandwidth part #1 (BWP#1, 301) and bandwidth part #2 (BWP#2, 302). The base station may configure one or more bandwidth parts for the terminal and may configure information such as that shown in Table 2 below for each bandwidth part.
[0099] BWP ::= SEQUENCE {bwp-Id BWP-Id,(Bandwidth Identifier)locationAndBandwidth INTEGER (1..65536),(Bandwidth Location)subcarrierSpacing ENUMERATED {n0, n1, n2, n3, n4, n5},(Subcarrier Spacing)cyclicPrefix ENUMERATED { extended}(Cyclical Prefix)}
[0100] Of course, the above examples are not limited, and various parameters related to bandwidth portions may be configured for the terminal in addition to the above configuration information. The above information may be transmitted by the base station to the terminal via higher-layer signaling, for example, radio resource control (RRC) signaling. At least one of the configured bandwidth portions may be activated. Whether a configured bandwidth portion is activated may be transmitted quasi-statically from the base station to the terminal via RRC signaling or dynamically via downlink control information (DCI).
[0101] According to some embodiments, prior to the RRC connection, the terminal may receive an Initial Bandwidth Part (Initial BWP) for initial connection from the base station via a Master Information Block (MIB). More specifically, during the initial connection phase, the terminal may receive configuration information for a control resource set (CORESET) and a search space via the MIB, through which a PDCCH can be transmitted to receive system information required for initial connection (remaining system information; which may correspond to RMSI or system information block 1; SIB1). The control resource set and the search space configured via the MIB may each be considered as Identity (ID) 0. The base station may notify the terminal via the MIB of configuration information, such as frequency allocation information, time allocation information, and numerology, for control resource set #0. Additionally, the base station may notify the terminal via the MIB of configuration information regarding the monitoring period and occasion for control resource set #0, i.e., configuration information for search space #0. The terminal may consider the frequency region set as control region #0 obtained from the MIB as the initial bandwidth portion for initial access. In this case, the identifier (ID) of the initial bandwidth portion may be considered as 0. Through the set initial bandwidth portion, the terminal can receive the PDSCH (physical downlink shared channel) through which the SIB is transmitted. In addition to receiving the SIB, the initial bandwidth portion may also be utilized for other system information (OSI), paging, and random access.
[0102] The settings for the bandwidth portion supported by the above 5G can be used for various purposes.
[0103] According to some embodiments, if the bandwidth supported by the terminal is smaller than the system bandwidth, this can be supported through the bandwidth portion setting. For example, by setting the frequency position of the bandwidth portion (setting information 2) to the terminal, the terminal can transmit and receive data at a specific frequency position within the system bandwidth.
[0104] In addition, according to some embodiments, a base station may set multiple bandwidth portions for a terminal for the purpose of supporting different numerologies. For example, to support data transmission and reception using both a 15 kHz subcarrier interval and a 30 kHz subcarrier interval for a terminal, two bandwidth portions may be set to subcarrier intervals of 15 kHz and 30 kHz, respectively. Different bandwidth portions may be frequency division multiplexed, and when data transmission and reception is to be performed with a specific subcarrier interval, the bandwidth portion set to that subcarrier interval may be activated.
[0105] In addition, according to some embodiments, a base station may set a bandwidth portion having different bandwidth sizes for the purpose of reducing the power consumption of the terminal. For example, if the terminal supports a very large bandwidth, such as 100 MHz, and always transmits and receives data using that bandwidth, very large power consumption may occur. In particular, in a situation where there is no traffic, performing monitoring of an unnecessary downlink control channel using a large bandwidth of 100 MHz can be very inefficient in terms of power consumption. To reduce the power consumption of the terminal, the base station may set a bandwidth portion of a relatively small bandwidth, such as 20 MHz, for the terminal. In a situation where there is no traffic, the terminal can perform monitoring operations in the 20 MHz bandwidth portion, and when data is generated, it can transmit and receive data using the 100 MHz bandwidth portion according to the instructions of the base station.
[0106] When one or more bandwidth parts are set for a terminal, the base station may instruct the terminal to change (or switch, transition) the bandwidth part using the bandwidth part indicator field in the DCI. For example, in FIG. 3, if the currently active bandwidth part of the terminal is bandwidth part #1 (301), the base station may instruct the terminal to bandwidth part #2 (302) using the bandwidth part indicator in the DCI, and the terminal may perform a bandwidth part change to bandwidth part #2 (302) indicated by the received bandwidth part indicator in the DCI.
[0107] As mentioned above, since DCI-based bandwidth portion changes can be directed by a DCI scheduling a PDSCH or PUSCH (physical uplink shared channel), when a terminal receives a bandwidth portion change request, it must be able to seamlessly receive or transmit the PDSCH or PUSCH scheduled by the corresponding DCI within the changed bandwidth portion. To this end, the standard specifies the delay time (T) required for bandwidth portion changes. BWP The requirements for ) have been specified and can be defined, for example, as shown in Table 3.
[0108] μNR Slot length (ms)BWP switch delay T BWP (slots)Type 1 Note 1 Type 2 Note 1 011310.52520.253930.125618Note 1: Depends on UE capability.Note 2: If the BWP switch involves changing of SCS, the BWP switch delay is determined by the larger one between the SCS before BWP switch and the SCS after BWP switch.
[0109] The requirements for bandwidth portion change delay time support Type 1 or Type 2 depending on the terminal's capability. The terminal can report the supported bandwidth portion delay time type to the base station.
[0110] In accordance with the aforementioned requirements for bandwidth portion change delay time, if the terminal receives a DCI containing a bandwidth portion change indicator in slot n, the terminal performs a change to the new bandwidth portion indicated by the bandwidth portion change indicator in slot n+T BWPCompletion can be performed at a time no later than the new bandwidth portion, and transmission and reception for the data channel scheduled by the corresponding DCI can be performed in the changed new bandwidth portion. If the base station intends to schedule a data channel in the new bandwidth portion, the terminal's bandwidth portion change delay time (T BWP By considering ), time-domain resource allocation for a data channel can be determined. That is, when a base station schedules a data channel with a new bandwidth portion, in the method for determining time-domain resource allocation for a data channel, the data channel can be scheduled after the bandwidth portion change delay time. Accordingly, the terminal [is notified] that the DCI instructing the bandwidth portion change is the bandwidth portion change delay time (T BWP You may not expect to indicate a slot offset (K0 or K2) value smaller than )
[0111] If a terminal receives a DCI (e.g., DCI format 1_1 or 0_1) instructing a change in the bandwidth portion, the terminal may not perform any transmission or reception during a time interval corresponding to the time interval from the third symbol of the slot in which the PDCCH containing the said DCI was received to the beginning of the slot indicated by the slot offset value (K0 or K2) indicated by the time domain resource allocation indicator field within the said DCI. For example, if a terminal receives a DCI instructing a change in the bandwidth portion in slot n, and the slot offset value indicated by the said DCI is K, the terminal may not perform any transmission or reception from the third symbol of slot n to the symbol before slot n+K (i.e., the last symbol of slot n+K-1).
[0112] Next, we will explain the SS / PBCH block (synchronization signal / physical broadcast channel block) in 5G.
[0113] An SS / PBCH block may refer to a physical layer channel block composed of PSS (primary synchronization signal), SSS (secondary synchronization signal), and PBCH. Specifically, it is as follows.
[0114] - PSS: A signal that serves as the reference for downlink time / frequency synchronization and provides some information about the cell ID.
[0115] - SSS: Serves as the reference for downlink time / frequency synchronization and provides the remaining cell ID information not provided by PSS. Additionally, it can serve as a reference signal for PBCH demodulation.
[0116] - PBCH: Provides essential system information required for the transmission and reception of the terminal's data and control channels. The essential system information may include search space-related control information representing wireless resource mapping information of the control channel, scheduling control information for a separate data channel transmitting system information, etc.
[0117] - SS / PBCH block: An SS / PBCH block is composed of a combination of PSS, SSS, and PBCH. One or more SS / PBCH blocks may be transmitted within a time of 5ms, and each transmitted SS / PBCH block may be distinguished by an index.
[0118] The terminal can detect PSS and SSS during the initial connection phase and can decode PBCH. It can obtain MIB from PBCH and receive configuration for Control Area #0 from it. The terminal can perform monitoring of Control Area #0 by assuming that the selected SS / PBCH block and the demodulation reference signal (DMRS) transmitted from Control Area #0 are quasi-co-located (QCL). The terminal can receive system information using downlink control information transmitted from Control Area #0. From the received system information, the terminal can obtain configuration information related to the random access channel (RACH) required for initial connection. The terminal can transmit a Physical RACH (PRACH) to the base station considering the selected SS / PBCH index, and the base station receiving the PRACH can obtain information regarding the SS / PBCH block index selected by the terminal. The base station can know that the terminal has selected a block among the respective SS / PBCH blocks and is monitoring the Control Area #0 associated with it.
[0119] Next, downlink control information (DCI) in 5G systems will be explained in detail.
[0120] In a 5G system, scheduling information for uplink data (or physical uplink data channel (PUSCH)) or downlink data (or physical downlink data channel (PDSCH)) is transmitted from the base station to the terminal via DCI. The terminal can monitor the fallback DCI format and the non-fallback DCI format for PUSCH or PDSCH. The fallback DCI format may consist of fixed fields selected between the base station and the terminal, and the non-fallback DCI format may include configurable fields.
[0121] DCI can be transmitted via the PDCCH, a physical downlink control channel, after undergoing channel coding and modulation processes. A cyclic redundancy check (CRC) is attached to the DCI message payload, and the CRC can be scrambled into a radio network temporary identifier (RNTI) corresponding to the terminal's identity. Different RNTIs may be used depending on the purpose of the DCI message, such as UE-specific data transmission, power control commands, or random access responses. In other words, the RNTI is not transmitted explicitly but is included in the CRC calculation process. Upon receiving a DCI message transmitted over the PDCCH, the terminal checks the CRC using the assigned RNTI; if the CRC check result is correct, the terminal knows that the message has been transmitted to it.
[0122] For example, a DCI scheduling a PDSCH for system information (SI) can be scrambled to SI-RNTI. A DCI scheduling a PDSCH for a random access response (RAR) message can be scrambled to RA-RNTI. A DCI scheduling a PDSCH for a paging message can be scrambled to P-RNTI. A DCI notifying a slot format indicator (SFI) can be scrambled to SFI-RNTI. A DCI notifying a transmit power control (TPC) can be scrambled to TPC-RNTI. A DCI scheduling a terminal-specific PDSCH or PUSCH can be scrambled to C-RNTI (cell RNTI).
[0123] DCI format 0_0 can be used as a countermeasure DCI for scheduling PUSCH, in which case the CRC can be scrambled with C-RNTI. DCI format 0_0 with the CRC scrambled with C-RNTI can include, for example, the information in Table 4.
[0124] - Identifier for DCI formats - [1] bit- Frequency domain resource assignment -[ ] bits- Time domain resource assignment - X bits- Frequency hopping flag - 1 bit- Modulation and coding scheme - 5 bits- New data indicator - 1 bit- Redundancy version - 2 bits- HARQ process number - 4 bits- TPC command for scheduled PUSCH - [2] bits- UL / SUL indicator - 0 or 1 bit
[0125] DCI format 0_1 can be used as a non-defense DCI for scheduling PUSCH, whereby the CRC can be scrambled with C-RNTI. DCI format 0_1 with the CRC scrambled with C-RNTI may include, for example, the information in Table 5 below.
[0126] - Carrier indicator - 0 or 3 bits - UL / SUL indicator - 0 or 1 bit - Identifier for DCI formats - [1] bits - Bandwidth part indicator - 0, 1 or 2 bits - Frequency domain resource assignment - For resource allocation type 0, bits- For resource allocation type 1, bits- Time domain resource assignment -1, 2, 3, or 4 bits- VRB-to-PRB mapping (virtual resource block-to-physical resource block mapping) - 0 or 1 bit, only for resource allocation type 1.○ 0 bit if only resource allocation type 0 is configured;○ 1 bit otherwise.- Frequency hopping flag - 0 or 1 bit, only for resource allocation type 1.○ 0 bit if only resource allocation type 0 is configured;○ 1 bit otherwise.- Modulation and coding scheme - 5 bits- New data indicator - 1 bit- Redundancy version - 2 bits- HARQ process number - 4 bits- 1st downlink assignment index (first downlink allocation index)- 1 or 2 bits○ 1 bit for semi-static HARQ-ACK codebook (semi-static HARQ-ACK In case of codebook);○ 2 bits for dynamic HARQ-ACK codebook with single HARQ-ACK codebook (when a dynamic HARQ-ACK codebook is used with a single HARQ-ACK codebook).- 2nd downlink assignment index - 0 or 2 bits ○ 2 bits for dynamic HARQ-ACK codebook with two HARQ-ACK sub-codebooks (when a dynamic HARQ-ACK codebook is used with two HARQ-ACK sub-codebooks); ○ 0 bit otherwise.TPC command for scheduled PUSCH - 2 bits- SRS resource indicator (SRS resource indicator) -. or bits○ bits for non-codebook based PUSCH transmission(if PUSCH transmission is not codebook-based);○ bits for codebook-based PUSCH transmission. - Precoding information and number of layers - up to 6 bits - Antenna ports - up to 5 bits - SRS request - 2 bits - CSI request - 0, 1, 2, 3, 4, 5, or 6 bits - CBG transmission information - 0, 2, 4, 6, or 8 bits - PTRS-DMRS association - 0 or 2 bits - beta_offset indicator - 0 or 2 bits - DMRS sequence initialization - 0 or 1 bit
[0127] DCI format 1_0 can be used as a countermeasure DCI for scheduling PDSCH, in which case the CRC can be scrambled with C-RNTI. DCI format 1_0 with the CRC scrambled with C-RNTI may include, for example, the information in Table 6 below.
[0128] - Identifier for DCI formats - [1] bit- Frequency domain resource assignment -[ ] bits- Time domain resource assignment - X bits- VRB-to-PRB mapping - 1 bit- Modulation and coding scheme - 5 bits- New data indicator - 1 bit- Redundancy version - 2 bits- HARQ process number - 4 bits- Downlink assignment index - 2 bits- TPC command for scheduled PUCCH - [2] bits- PUCCH resource indicator - 3 bits- PDSCH-to-HARQ feedback timing indicator - [3] bits
[0129] DCI format 1_1 can be used as a non-defense DCI for scheduling PDSCH, whereby the CRC can be scrambled with C-RNTI. DCI format 1_1 with the CRC scrambled with C-RNTI may include, for example, the information in Table 7 below.
[0130] - Carrier indicator - 0 or 3 bits- Identifier for DCI formats - [1] bits- Bandwidth part indicator - 0, 1 or 2 bits- Frequency domain resource assignment○ For resource allocation type 0, bits○ For resource allocation type 1, bits- Time domain resource assignment -1, 2, 3, or 4 bits- VRB-to-PRB mapping - 0 or 1 bit, only for resource allocation type 1.○ 0 bit if only resource allocation type 0 is configured;○ 1 bit otherwise.- PRB bundling size indicator - 0 or 1 bit - Rate matching indicator - 0, 1, or 2 bits - ZP CSI-RS trigger - 0, 1, or 2 bits - For transport block 1: - Modulation and coding scheme - 5 bits - New data indicator - 1 bit - Redundancy version - 2 bits - For transport block 2: - Modulation and coding scheme - 5 bits - New data indicator - 1 bit - Redundancy version - 2 bits - HARQ process number - 4 bits - Downlink assignment index - 0 or 2 or 4 bits - TPC command for scheduled PUCCH - 2 bits - PUCCH resource indicator - 3 bits - PDSCH-to-HARQ_feedback timing indicator - 3 bits - Antenna ports 4, 5, or 6 bits - Transmission configuration indication - 0 or 3 bits - SRS request - 2 bits - CBG transmission information - 0, 2, 4, 6, or 8 bits - CBG flushing out information - 0 or 1 bit - DMRS sequence initialization - 1 bit.
[0131] In the following, the downlink control channel in a 5G communication system will be explained in more detail with reference to the drawings.
[0132] FIG. 4 illustrates an example of a control area in which a downlink control channel is transmitted in a 5G wireless communication system. FIG. 4 illustrates an example in which two control areas (control area #1 (401), control area #2 (402)) are set within a terminal bandwidth part (UE bandwidth part, 410) on the frequency axis and one slot (420) on the time axis. The control areas (401, 402) can be set in a specific frequency resource (403) within the entire terminal bandwidth part (410) on the frequency axis. On the time axis, they can be set with one or more OFDM symbols and can be defined as the control resource set duration (404). Referring to the example illustrated in FIG. 4, control area #1 (401) is set with a control resource set duration of 2 symbols, and control area #2 (402) is set with a control resource set duration of 1 symbol.
[0133] The control domain in the aforementioned 5G can be configured by a base station to a terminal through upper-layer signaling (e.g., system information, MIB, RRC signaling). Configuring a control domain to a terminal means providing information such as a control domain identifier, the frequency location of the control domain, and the symbol length of the control domain. For example, it may include the information in Table 8.
[0134] ControlResourceSet ::= SEQUENCE {-- Corresponds to L1 parameter 'CORESET-ID'controlResourceSetId ControlResourceSetId,(Control Domain Identifier(Identity))frequencyDomainResources BIT STRING (SIZE (45)),(Frequency Axis Resource Allocation Info)duration INTEGER (1..maxCoReSetDuration),(Time Axis Resource Allocation Info)cce-REG-MappingType CHOICE {(CCE-to-REG Mapping Type)interleaved SEQUENCE {reg-BundleSize ENUMERATED {n2, n3, n6},(REG Bundle Size)precoderGranularity ENUMERATED {sameAsREG-bundle, allContiguousRBs},interleaverSize ENUMERATED {n2, n3, n6}(Interleaver Size)shiftIndex INTEGER(0..maxNrofPhysicalResourceBlocks-1) OPTIONAL(Interleaved Shift)},nonInterleaved NULL},tci-StatesPDCCH SEQUENCE(SIZE (1..maxNrofTCI-StatesPDCCH)) OF TCI-StateId OPTIONAL,(QCL setting information)tci-PresentInDCI ENUMERATED {enabled} OPTIONAL, -- Need S}
[0135] In Table 8, the tci-StatesPDCCH (simply named TCI (transmission configuration indication) state) configuration information may include information on one or more SS / PBCH block indices or CSI-RS (channel state information reference signal) indices that are in a quasi-co-located relationship with the DMRS transmitted in the corresponding control area.
[0136] FIG. 5 illustrates an example of a basic unit of time and frequency resources that constitute a downlink control channel that can be used in 5G. According to FIG. 5, the basic unit of time and frequency resources that constitute a control channel can be called a REG (resource element group, 503), and the REG (503) can be defined as 1 OFDM symbol (501) on the time axis and 1 PRB (physical resource block, 502) on the frequency axis, i.e., 12 subcarriers. A base station can construct a downlink control channel allocation unit by concatenating REGs (503).
[0137] As illustrated in FIG. 5, if the basic unit to which a downlink control channel is allocated in 5G is called a CCE (control channel element, 504), then 1 CCE (504) can be composed of multiple REGs (503). For example, if the REG (503) illustrated in FIG. 5 is described, the REG (503) can be composed of 12 REs, and if 1 CCE (504) is composed of 6 REGs (503), then 1 CCE (504) can be composed of 72 REs. When a downlink control area is established, the area can be composed of multiple CCEs (504), and a specific downlink control channel can be mapped to one or multiple CCEs (504) and transmitted according to the aggregation level (AL) within the control area. The CCEs (504) within the control area are distinguished by numbers, and the numbers of the CCEs (504) can be assigned according to a logical mapping method.
[0138] The basic unit of the downlink control channel, namely the REG (503) shown in FIG. 5, may include both the REs to which the DCI is mapped and the DMRS (505), which is a reference signal for decoding, to which the area is mapped. As shown in FIG. 5, three DMRS (505) may be transmitted within one REG (503). The number of CCEs required to transmit the PDCCH may be 1, 2, 4, 8, or 16 depending on the aggregation level, and different numbers of CCEs may be used to implement link adaptation of the downlink control channel. For example, when AL=L, one downlink control channel may be transmitted through L CCEs. The terminal must detect the signal without knowing information about the downlink control channel, and a search space representing a set of CCEs is defined for blind decoding. A search space is a set of downlink control channel candidates consisting of CCEs that a terminal must attempt to decode on a given aggregation level, and since there are various aggregation levels that form a group of 1, 2, 4, 8, or 16 CCEs, a terminal may have multiple search spaces. A search space set can be defined as a set of search spaces on all configured aggregation levels.
[0139] Search spaces can be classified into common search spaces and UE-specific search spaces. A certain group of terminals or all terminals may examine the common search space of the PDCCH to receive cell-common control information, such as dynamic scheduling or paging messages regarding system information. For example, PDSCH scheduling allocation information for the transmission of SIBs containing cell operator information can be received by examining the common search space of the PDCCH. In the case of the common search space, since a certain group of terminals or all terminals must receive the PDCCH, it can be defined as a pre-arranged set of CCEs. Scheduling allocation information for a UE-specific PDSCH or PUSCH can be received by examining the UE-specific search space of the PDCCH. The UE-specific search space can be defined specifically as a function of the terminal's identity and various system parameters.
[0140] In 5G, parameters for the search space for a PDCCH can be configured from the base station to the terminal via upper-layer signaling (e.g., SIB, MIB, RRC signaling). For example, the base station may configure the terminal the number of PDCCH candidates at each aggregation level L, the monitoring period for the search space, the occasion for monitoring in slot-symbol units for the search space, the search space type (common search space or terminal-specific search space), the combination of DCI format and RNTI to be monitored in the search space, and the control domain index to be monitored in the search space. For example, the information in Table 9 may be included.
[0141] SearchSpace ::= SEQUENCE {-- Identity of the search space. SearchSpaceId = 0 identifies the SearchSpace configured via PBCH (MIB) or ServingCellConfigCommon.searchSpaceId SearchSpaceId,(Search Space Identifier)controlResourceSetId ControlResourceSetId,(Control Area Identifier)monitoringSlotPeriodicityAndOffset CHOICE {(Monitoring Slot Level Period)sl1 NULL,sl2 INTEGER (0..1),sl4 INTEGER (0..3),sl5 INTEGER (0..4),sl8 INTEGER (0..7),sl10 INTEGER (0..9),sl16 INTEGER (0..15),sl20 INTEGER (0..19)} OPTIONAL,duration(Monitoring Length) INTEGER (2..2559)monitoringSymbolsWithinSlot BIT STRING (SIZE (14)) OPTIONAL,(슬롘 내 나이스 심보)nrofCandidates SEQUENCE {(집성 별보 PDCCH 이리군 수)aggregationLevel1 ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8},aggregationLevel2 ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8},aggregationLevel4 ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8},aggregationLevel8 ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8},aggregationLevel16 ENUMERATED {n0, n1, n2, n3, n4, n5, n6, n8}},searchSpaceType CHOICE {(தமம்ப்புக்குக்க்கு திய்)-- Configures this search space as common search space (CSS) and DCI formats to monitor.common SEQUENCE {(공통이이국이)}ue-Specific SEQUENCE {(단말-특정이스국)-- Indicates whether the UE monitors in this USS for DCI formats 0-0 and 1-0 or for formats 0-1 and 1-1.formats ENUMERATED {formats0-0-And-1-0, formats0-1-And-1-1},...}.
[0142] According to the configuration information, the base station may set one or multiple sets of search spaces for the terminal. According to some embodiments, the base station may set search space set 1 and search space set 2 for the terminal, and may set DCI format A scrambled with X-RNTI in search space set 1 to be monitored in a common search space, and may set DCI format B scrambled with Y-RNTI in search space set 2 to be monitored in a terminal-specific search space.
[0143] According to the configuration information, one or more sets of search spaces may exist in a common search space or a terminal-specific search space. For example, Search Space Set #1 and Search Space Set #2 may be configured as a common search space, and Search Space Set #3 and Search Space Set #4 may be configured as a terminal-specific search space.
[0144] In the common search space, the following combinations of DCI formats and RNTI can be monitored. Of course, they are not limited to the examples below.
[0145] - DCI format 0_0 / 1_0 with CRC scrambled by C-RNTI, CS-RNTI, SP-CSI-RNTI, RA-RNTI, TC-RNTI, P-RNTI, SI-RNTI
[0146] - DCI format 2_0 with CRC scrambled by SFI-RNTI
[0147] - DCI format 2_1 with CRC scrambled by INT-RNTI
[0148] - DCI format 2_2 with CRC scrambled by TPC-PUSCH-RNTI, TPC-PUCCH-RNTI
[0149] - DCI format 2_3 with CRC scrambled by TPC-SRS-RNTI
[0150] In terminal-specific search spaces, the following combinations of DCI formats and RNTI can be monitored. Of course, they are not limited to the examples below.
[0151] - DCI format 0_0 / 1_0 with CRC scrambled by C-RNTI, CS-RNTI, TC-RNTI
[0152] - DCI format 1_0 / 1_1 with CRC scrambled by C-RNTI, CS-RNTI, TC-RNTI
[0153] The specified RNTIs may follow the definitions and uses below.
[0154] C-RNTI (cell RNTI): Used for terminal-specific PDSCH scheduling
[0155] TC-RNTI (temporary cell RNTI): Used for terminal-specific PDSCH scheduling
[0156] CS-RNTI (configured scheduling RNTI): Used for semi-statically configured terminal-specific PDSCH scheduling.
[0157] RA-RNTI (random access RNTI): Used for PDSCH scheduling during the random access phase
[0158] P-RNTI (paging RNTI): Used for PDSCH scheduling where paging is transmitted.
[0159] SI-RNTI (System Information RNTI): Used for PDSCH scheduling where system information is transmitted.
[0160] INT-RNTI (interruption RNTI): Used to indicate whether PDSCH is pucturing.
[0161] TPC-PUSCH-RNTI (transmit power control for PUSCH RNTI): Used to instruct power control commands to the PUSCH
[0162] TPC-PUCCH-RNTI (transmit power control for PUCCH RNTI): Used to instruct power control commands to the PUCCH
[0163] TPC-SRS-RNTI (transmit power control for SRS RNTI): Used to instruct power regulation commands to the SRS
[0164] The aforementioned specified DCI formats may follow definitions such as the example in Table 10.
[0165] DCI formatUsage0_0Scheduling of PUSCH in one cell0_1Scheduling of PUSCH in one cell1_0Scheduling of PDSCH in one cell1_1Scheduling of PDSCH in one cell2_0Notifying a group of UEs of the slot format2_1Notifying a group of UEs of the PRB(s) and OFDM symbol(s) where UE may assume no transmission is intended for the UE2_2Transmission of TPC commands for PUCCH and PUSCH2_3Transmission of a group of TPC commands for SRS transmissions by one or more UEs
[0166] In a 5G system, the search space of aggregation level L in CORESET p and search space set s can be expressed as Equation 1 below.
[0167] [Mathematical Formula 1]
[0168]
[0169] - L: Lamination Level
[0170] - n CI : Carrier Index
[0171] - n CCE,p : Total number of CCEs existing in CORESET p
[0172] - : Slot Index
[0173] - : Number of PDCCH candidates at assembly level L
[0174] - = 0, ..., -1: PDCCH candidate index of aggregation level L
[0175] - l = 0, ..., L -1
[0176] - , Y p,-1 = nRNTI≠0, A p = 39827 for p mod 3 = 0, A p = 39829 for p mod 3 = 1, A p = 39839 for p mod 3 = 2, D= 65537
[0177] - n RNTI : Terminal identifier
[0178] The value may be 0 for the common search space.
[0179] In the case of a terminal-specific search space, the value may correspond to a value that changes depending on the terminal's identity (C-RNTI or ID set for the terminal by the base station) and the time index.
[0180] In 5G, as multiple sets of search spaces can be configured with different parameters (e.g., the parameters in Table 9), the set of search space sets monitored by the terminal at each point in time may vary. For example, if search space set #1 is configured with an X-slot period and search space set #2 is configured with a Y-slot period and X and Y are different, the terminal may monitor both search space set #1 and search space set #2 in a specific slot, and monitor either search space set #1 or search space set #2 in a specific slot.
[0181] In the following, the rate matching and puncturing operations will be described in detail.
[0182] When a time and frequency resource A intended to transmit an arbitrary symbol sequence A overlaps with an arbitrary time and frequency resource B, rate matching or puncturing operations may be considered as transmission and reception operations of channel A, taking into account the area resource C where resource A and resource B overlap. Specific operations may follow the details below.
[0183] The rate matching operation is described below.
[0184] - A base station may transmit symbol sequence A to a terminal by mapping Channel A only to the remaining resource area, excluding Resource C which corresponds to the area overlapping with Resource B, from the entire Resource A. For example, if symbol sequence A consists of {Symbol #1, Symbol #2, Symbol #3, Symbol #4}, Resource A is {Resource #1, Resource #2, Resource #3, Resource #4}, and Resource B is {Resource #3, Resource #5}, the base station may sequentially map and send symbol sequence A to {Resource #1, Resource #2, Resource #4}, which is the remaining resource excluding {Resource #3}, which corresponds to Resource C within Resource A. Consequently, the base station can transmit the symbol sequence {Symbol #1, Symbol #2, Symbol #3} by mapping it to {Resource #1, Resource #2, Resource #4}, respectively.
[0185] The terminal can determine Resource A and Resource B from scheduling information regarding Symbol Sequence A received from the base station, and thereby determine Resource C, which is the area where Resource A and Resource B overlap. The terminal can receive Symbol Sequence A by assuming that Symbol Sequence A was transmitted by mapping it to the remaining area of Resource A, excluding Resource C. For example, if Symbol Sequence A consists of {Symbol #1, Symbol #2, Symbol #3, Symbol #4}, Resource A is {Resource #1, Resource #2, Resource #3, Resource #4}, and Resource B is {Resource #3, Resource #5}, the terminal can receive Symbol Sequence A by assuming that it was sequentially mapped to the remaining resources {Resource #1, Resource #2, Resource #4}, excluding {Resource #3}, which corresponds to Resource C. Consequently, the terminal can perform a subsequent series of reception operations by assuming that Symbol Sequence {Symbol #1, Symbol #2, Symbol #3} was transmitted by mapping it to {Resource #1, Resource #2, Resource #4}, respectively.
[0186] The puncturing motion is described below.
[0187] If there exists a resource C corresponding to an area overlapping with resource B among the entire resource A to which the base station intends to transmit symbol sequence A to the terminal, the base station maps symbol sequence A to the entire resource A, but does not perform transmission in the resource area corresponding to resource C, and can perform transmission only for the remaining resource area of resource A excluding resource C. For example, if symbol sequence A consists of {Symbol #1, Symbol #2, Symbol #3, Symbol #4}, resource A is {Resource #1, Resource #2, Resource #3, Resource #4}, and resource B is {Resource #3, Resource #5}, the base station can map symbol sequence A {Symbol #1, Symbol #2, Symbol #3, Symbol #4} to resource A {Resource #1, Resource #2, Resource #3, Resource #4} respectively, and can transmit only the symbol sequence {Symbol #1, Symbol #2, Symbol #4} corresponding to the remaining resources {Resource #1, Resource #2, Resource #4}, excluding {Resource #3} corresponding to resource C, and may not transmit {Symbol #3} mapped to {Resource #3} corresponding to resource C. Consequently, the base station can map and transmit the symbol sequence {Symbol #1, Symbol #2, Symbol #4} to {Resource #1, Resource #2, Resource #4} respectively.
[0188] The terminal can determine resources A and B from scheduling information for symbol sequence A received from the base station, and thereby determine resource C, which is the overlapping area of resources A and B. The terminal can receive symbol sequence A by assuming that symbol sequence A is mapped to the entire resource A but was transmitted only in the remaining area of resource A excluding resource C. For example, if symbol sequence A consists of {Symbol #1, Symbol #2, Symbol #3, Symbol #4}, resource A is {Resource #1, Resource #2, Resource #3, Resource #4}, and resource B is {Resource #3, Resource #5}, the terminal can assume that symbol sequence A {Symbol #1, Symbol #2, Symbol #3, Symbol #4} is mapped to resource A {Resource #1, Resource #2, Resource #3, Resource #4} respectively, but {Symbol #3} mapped to {Resource #3} corresponding to resource C is not transmitted, and can receive by assuming that symbol sequence {Symbol #1, Symbol #2, Symbol #4} corresponding to the remaining resources {Resource #1, Resource #2, Resource #4}—excluding {Resource #3} corresponding to resource C—is mapped and transmitted. Consequently, the terminal can perform a subsequent series of receiving operations by assuming that the symbol sequence {Symbol #1, Symbol #2, Symbol #4} has been transmitted and mapped to {Resource #1, Resource #2, Resource #4}, respectively.
[0189] In the following, a method for configuring rate matching resources for the purpose of rate matching in a 5G communication system is described. Rate matching refers to the adjustment of the signal size by considering the amount of resources available to transmit the signal. For example, rate matching of a data channel may mean that the data channel is mapped to a specific time and frequency resource range so that the data size is adjusted accordingly without transmission.
[0190] FIG. 6 is a diagram illustrating an example of a base station and a terminal transmitting and receiving data in consideration of downlink data channels and rate matching resources.
[0191] FIG. 6 illustrates a downlink data channel (PDSCH, 601) and a rate matching resource (602). A base station may set one or more rate matching resources (602) to a terminal through upper layer signaling (e.g., RRC signaling). The rate matching resource (602) setting information may include time-axis resource allocation information (603), frequency-axis resource allocation information (604), and period information (605). In the following, the bitmap corresponding to the frequency-axis resource allocation information (604) is named the "first bitmap," the bitmap corresponding to the time-axis resource allocation information (603) is named the "second bitmap," and the bitmap corresponding to the period information (605) is named the "third bitmap." If all or part of the time and frequency resources of a scheduled data channel (601) overlap with a set rate matching resource (602), the base station can transmit the data channel (601) by rate matching it in the rate matching resource (602) portion, and the terminal can perform reception and decoding after assuming that the data channel (601) is rate matched in the rate matching resource (602) portion.
[0192] The base station can dynamically notify the terminal via DCI whether to rate match a data channel in the above-mentioned rate matching resource portion through additional settings (corresponding to the "rate matching indicator" within the aforementioned DCI format). Specifically, the base station can select some of the above-mentioned rate matching resources and group them into rate matching resource groups, and can indicate to the terminal via DCI using a bitmap method whether to rate match a data channel for each rate matching resource group. For example, if four rate matching resources, RMR#1, RMR#2, RMR#3, and RMR#4, are set, the base station can set RMG#1={RMR#1, RMR#2} and RMG#2={RMR#3, RMR#4} as rate matching groups, and can indicate to the terminal via a bitmap whether to rate match in RMG#1 and RMG#2, respectively, using 2 bits within the DCI field. For example, you can set each bit to "1" when rate matching is required, and set each bit to "0" when rate matching is not required.
[0193] In 5G, the granularity of "RB symbol level" and "RE level" is supported by setting the aforementioned rate matching resources to the terminal. More specifically, the following setting method may be followed.
[0194] The terminal can receive up to four RateMatchPatterns as upper layer signaling for each bandwidth portion, and one RateMatchPattern may include the following contents.
[0195] - As a reserved resource within the bandwidth portion, a resource may be included in which the time and frequency resource domains of the said reserved resource are set as a combination of an RB level bitmap and a symbol level bitmap along the frequency axis. The said reserved resource may be spanned across one or two slots. A time domain pattern (periodicityAndPattern) in which the time and frequency domains composed of each RB level and symbol level bitmap pair are repeated may be additionally set.
[0196] - It may include time and frequency domain resource areas set as control resource sets within the bandwidth portion, and resource areas corresponding to time domain patterns set as search space settings where the resource areas are repeated.
[0197] Below, the method for setting rate matching of RE levels is described.
[0198] The terminal can receive the following settings through upper-layer signaling.
[0199] - As configuration information for an RE corresponding to an LTE CRS (cell-specific reference signal or common reference signal) pattern (lte-CRS-ToMatchAround), the number of ports of the LTE CRS (nrofCRS-Ports) and the LTE-CRS-vshift(s) value (v-shift), the location information of the LTE carrier's center subcarrier (carrierFreqDL) from a reference frequency point (e.g., reference point A), the LTE carrier's bandwidth size (carrierBandwidthDL) information, and the subframe configuration information corresponding to a Multiast-broadcast single-frequency network (mbsfn-SubframConfigList) may be included in the upper layer signaling. Based on the aforementioned information, the terminal can determine the location of the CRS within the NR slot corresponding to the LTE subframe.
[0200] - Configuration information for resource sets corresponding to one or more ZP (Zero Power) CSI-RS within the bandwidth portion may be included in the upper layer signaling.
[0201] Next, the rate matching process for the LTE CRS described above will be explained in detail. For LTE and NR coexistence, NR provides a function to set the pattern of the LTE CRS to the NR terminal. More specifically, the CRS pattern may be provided by RRC signaling that includes at least one parameter within the ServingCellConfig IE (information element) or ServingCellConfigCommon IE. Examples of the parameters may include lte-CRS-ToMatchAround, lte-CRS-PatternList1-r16, lte-CRS-PatternList2-r16, crs-RateMatch-PerCORESETPoolIndex-r16, etc.
[0202] In Rel-15 NR, the lte-CRS-ToMatchAround parameter provides the ability to set one CRS pattern per serving cell. In Rel-16 NR, this ability has been extended to allow multiple CRS patterns to be set per serving cell. More specifically, for a Single-TRP (transmission and reception point) configured terminal, one CRS pattern can be set per LTE carrier, and for a Multi-TRP configured terminal, two CRS patterns can be set per LTE carrier. For example, for a Single-TRP configured terminal, up to three CRS patterns per serving cell can be set through the lte-CRS-PatternList1-r16 parameter. As another example, for a multi-TRP configured terminal, a CRS can be set per TRP. In other words, the CRS pattern for TRP1 is set via the lte-CRS-PatternList1-r16 parameter, and the CRS pattern for TRP2 can be set via the lte-CRS-PatternList2-r16 parameter. Meanwhile, when two TRPs are configured as described above, whether to apply the CRS patterns of both TRP1 and TRP2 to a specific PDSCH, or to apply the CRS pattern of only one TRP, is determined via the crs-RateMatch-PerCORESETPoolIndex-r16 parameter; if the crs-RateMatch-PerCORESETPoolIndex-r16 parameter is set to enabled, the CRS pattern of only one TRP is applied, and otherwise, the CRS patterns of both TRPs are applied.
[0203] Table 11 shows a ServingCellConfig IE including the above CRS pattern, and Table 12 shows a RateMatchPatternLTE-CRS IE including at least one parameter for the CRS pattern.
[0204] ServingCellConfig ::= SEQUENCE {tdd-UL-DL-ConfigurationDedicated TDD-UL-DL-ConfigDedicated OPTIONAL, -- Cond TDDinitialDownlinkBWP BWP-DownlinkDedicated OPTIONAL, -- Need MdownlinkBWP-ToReleaseList SEQUENCE (SIZE (1..maxNrofBWPs)) OF BWP-Id OPTIONAL, -- Need NdownlinkBWP-ToAddModList SEQUENCE (SIZE (1..maxNrofBWPs)) OF BWP-Downlink OPTIONAL, -- Need NfirstActiveDownlinkBWP-Id BWP-Id OPTIONAL, -- Cond SyncAndCellAddbwp-InactivityTimer ENUMERATED {ms2, ms3, ms4, ms5, ms6, ms8, ms10, ms20, ms30,ms40,ms50, ms60, ms80,ms100, ms200,ms300, ms500,ms750, ms1280, ms1920, ms2560, spare10, spare9, spare8,spare7, spare6, spare5, spare4, spare3, spare2, spare1} OPTIONAL, --Need RdefaultDownlinkBWP-Id BWP-Id OPTIONAL, -- Need SuplinkConfig UplinkConfig OPTIONAL, -- Need MsupplementaryUplink UplinkConfig OPTIONAL, -- Need Mpdcch-ServingCellConfig SetupRelease { PDCCH-ServingCellConfig} OPTIONAL, -- Need Mpdsch-ServingCellConfig SetupRelease { PDSCH-ServingCellConfig} OPTIONAL,-- Need Mcsi-MeasConfig SetupRelease { CSI-MeasConfig} OPTIONAL, -- Need MsCellDeactivationTimer ENUMERATED {ms20, ms40, ms80, ms160, ms200, ms240,ms320, ms400, ms480, ms520, ms640, ms720,ms840, ms1280, spare2,spare1} OPTIONAL, -- Cond ServingCellWithoutPUCCHcrossCarrierSchedulingConfig CrossCarrierSchedulingConfig OPTIONAL, -- Need Mtag-Id TAG-Id,dummy ENUMERATED {enabled} OPTIONAL, -- Need RpathlossReferenceLinking ENUMERATED {spCell, sCell} OPTIONAL, -- Cond SCellOnlyservingCellMO MeasObjectId OPTIONAL, -- Cond MeasObject...,[[lte-CRS-ToMatchAround SetupRelease { RateMatchPatternLTE-CRS} OPTIONAL, -- Need MrateMatchPatternToAddModList SEQUENCE (SIZE (1..maxNrofRateMatchPatterns)) OF RateMatchPattern OPTIONAL, -- Need NrateMatchPatternToReleaseList SEQUENCE (SIZE (1..maxNrofRateMatchPatterns)) OF RateMatchPatternId OPTIONAL, -- Need NdownlinkChannelBW-PerSCS-List SEQUENCE (SIZE (1..maxSCSs)) OF SCS-SpecificCarrier OPTIONAL -- Need S]],[[supplementaryUplinkRelease ENUMERATED {true} OPTIONAL, -- Need Ntdd-UL-DL-ConfigurationDedicated-IAB-MT-r16 TDD-UL-DL-ConfigDedicated-IAB-MT-r16 OPTIONAL, -- Cond TDD_IABdormantBWP-Config-r16 SetupRelease { DormantBWP-Config-r16} OPTIONAL, -- Need Mca-SlotOffset-r16 CHOICE {refSCS15kHz INTEGER (-2..2),refSCS30KHz INTEGER (-5..5),refSCS60KHz INTEGER (-10..10),refSCS120KHz INTEGER (-20..20)} OPTIONAL, -- Cond AsyncCAchannelAccessConfig-r16 SetupRelease { ChannelAccessConfig-r16} OPTIONAL, -- Need MintraCellGuardBandsDL-List-r16 SEQUENCE (SIZE (1..maxSCSs)) OF IntraCellGuardBandsPerSCS-r16 OPTIONAL, -- Need SintraCellGuardBandsUL-List-r16 SEQUENCE (SIZE (1..maxSCSs)) OF IntraCellGuardBandsPerSCS-r16 OPTIONAL, -- Need Scsi-RS-ValidationWith-DCI-r16 ENUMERATED {enabled} OPTIONAL, -- Need Rlte-CRS-PatternList1-r16 SetupRelease { LTE-CRS-PatternList-r16} OPTIONAL, -- Need Mlte-CRS-PatternList2-r16 SetupRelease { LTE-CRS-PatternList-r16} OPTIONAL,-- Need Mcrs-RateMatch-PerCORESETPoolIndex-r16 ENUMERATED {enabled} OPTIONAL, -- Need RenableTwoDefaultTCI-States-r16 ENUMERATED {enabled} OPTIONAL, -- Need RenableDefaultTCI-StatePerCoresetPoolIndex-r16 ENUMERATED {enabled} OPTIONAL, -- Need RenableBeamSwitchTiming-r16 ENUMERATED {true} OPTIONAL, -- Need Rcbg-TxDiffTBsProcessingType1-r16 ENUMERATED {enabled} OPTIONAL, -- Need Rcbg-TxDiffTBsProcessingType2-r16 ENUMERATED {enabled} OPTIONAL -- Need R]]},
[0205] - RateMatchPatternLTE-CRSThe IE RateMatchPatternLTE-CRS is used to configure a pattern to rate match around LTE CRS. See TS 38.214
[0019] , clause 5.1.4.2.RateMatchPatternLTE-CRS information element-- ASN1START-- TAG-RATEMATCHPATTERNLTE-CRS-STARTRateMatchPatternLTE-CRS ::= SEQUENCE {carrierFreqDL INTEGER (0..16383),carrierBandwidthDL ENUMERATED {n6, n15, n25, n50, n75, n100, spare2, spare1},mbsfn-SubframeConfigList EUTRA-MBSFN-SubframeConfigList OPTIONAL, -- Need MnrofCRS-Ports ENUMERATED {n1, n2, n4},v-Shift ENUMERATED {n0, n1, n2, n3, n4, n5}}LTE-CRS-PatternList-r16 ::= SEQUENCE (SIZE (1..maxLTE-CRS-Patterns-r16)) OF RateMatchPatternLTE-CRS-- TAG-RATEMATCHPATTERNLTE-CRS-STOP-- ASN1STOP
[0206] RateMatchPatternLTE-CRS 필드 descriptions
[0207] carrierBandwidthDL: BW of the LTE carrier in number of PRBs (see TS 38.214
[0019] , clause 5.1.4.2).
[0208] carrierFreqDL:Center of the LTE carrier (see TS 38.214
[0019] , clause 5.1.4.2).
[0209] mbsfn-SubframeConfigList:LTE MBSFN subframe configuration (see TS 38.214
[0019] , clause 5.1.4.2).
[0210] nrofCRS-Ports:Number of LTE CRS antenna port to rate-match around (see TS 38.214
[0019] , clause 5.1.4.2).
[0211] v-Shift: Shifting value v-shift in LTE to rate match around LTE CRS (see TS 38.214
[0019] , clause 5.1.4.2).
[0212]
[0213] FIG. 7 is a diagram illustrating an example of frequency axis resource allocation of a PDSCH in a wireless communication system according to one embodiment of the present disclosure. According to FIG. 7, three frequency axis resource allocation methods are illustrated, including type 0 (700), type 1 (705), and dynamic switch (710), which can be configured through an upper layer in an NR wireless communication system.
[0214] Referring to FIG. 7, if the terminal is configured to use only resource type 0 through upper layer signaling (700), some DCIs that allocate PDSCH to the terminal are N RBG It includes a bitmap composed of bits. The conditions for this will be explained again later. In this case, N RBG This refers to the number of RBGs (resource block groups) determined as shown in Table 13 below, based on the BWP size assigned by the BWP indicator and the upper layer parameter rbg-Size, and data is transmitted to the RBG indicated as 1 by the bitmap.
[0215] Bandwidth Part SizeConfiguration 1Configuration 21-362437-724873-144816145-2751616
[0216] If the terminal is configured to use only resource type 1 through upper layer signaling (705), some DCIs that assign PDSCH to the terminal are It includes frequency axis resource allocation information consisting of bits. The conditions for this will be explained later. Through this, the base station can set the starting VRB (720) and the length (725) of the frequency axis resources continuously allocated therefrom.
[0217] If the terminal is configured to use both resource type 0 and resource type 1 through upper layer signaling (710), some DCIs that allocate PDSCH to the terminal include frequency axis resource allocation information consisting of bits of the larger value (735) of the payload (715) for setting resource type 0 and the payload (720, 725) for setting resource type 1. The conditions for this will be explained later. At this time, one bit may be added to the first part (MSB) of the frequency axis resource allocation information within the DCI, and if the bit has a value of '0', it indicates that resource type 0 is used, and if it has a value of '1', it indicates that resource type 1 is used.
[0218] The following describes a time-domain resource allocation method for data channels in next-generation mobile communication systems (5G or NR systems).
[0219] The base station may set a table for time domain resource allocation information for PDSCH and PUSCH for the terminal using upper-layer signaling (e.g., RRC signaling). For PDSCH, a table consisting of a maximum of maxNrofDL-Allocations = 16 entries may be set, and for PUSCH, a table consisting of a maximum of maxNrofUL-Allocations = 16 entries may be set. In one embodiment, the time domain resource allocation information may include PDCCH-to-PDSCH slot timing (corresponding to a slot-unit time interval between the time when the PDCCH is received and the time when the PDSCH scheduled by the received PDCCH is transmitted, denoted as K0), PDCCH-to-PUSCH slot timing (corresponding to a slot-unit time interval between the time when the PDCCH is received and the time when the PUSCH scheduled by the received PDCCH is transmitted, denoted as K2), information regarding the position and length of the start symbol in which the PDSCH or PUSCH is scheduled within the slot, and the mapping type of the PDSCH or PUSCH. For example, information such as that shown in Table 14 or Table 15 below may be transmitted from the base station to the terminal.
[0220] PDSCH-TimeDomainResourceAllocationList information elementPDSCH-TimeDomainResourceAllocationList ::= SEQUENCE (SIZE(1..maxNrofDL-Allocations)) OF PDSCH-TimeDomainResourceAllocationPDSCH-TimeDomainResourceAllocation ::= SEQUENCE {k0 INTEGER(0..32) OPTIONAL, -- Need S(PDCCH-to-PDSCH timing, slot units)mappingType ENUMERATED {typeA, typeB},(PDSCH mapping type)startSymbolAndLength INTEGER (0..127)(start symbol and length of PDSCH)}
[0221] PUSCH-TimeDomainResourceAllocation information elementPUSCH-TimeDomainResourceAllocationList ::= SEQUENCE (SIZE(1..maxNrofUL-Allocations)) OF PUSCH-TimeDomainResourceAllocationPUSCH-TimeDomainResourceAllocation ::= SEQUENCE {k2 INTEGER(0..32) OPTIONAL, -- Need S(PDCCH-to-PUSCH timing, slots)mappingType ENUMERATED {typeA, typeB},(PUSCH mapping type)startSymbolAndLength INTEGER (0..127)(start symbol and length of PUSCH)}
[0222] A base station may notify a terminal of one of the entries in a table for the time domain resource allocation information described above via L1 signaling (e.g., DCI) (e.g., indicated by the 'time domain resource allocation' field within the DCI). The terminal may obtain time domain resource allocation information for PDSCH or PUSCH based on the DCI received from the base station. FIG. 8 is a diagram illustrating an example of time-axis resource allocation of PDSCH in a wireless communication system according to an embodiment of the present disclosure. Referring to FIG. 8, the base station [sets] the subcarrier spacing (μ) of the data channel and control channel using the upper layer. PDSCH , μ PDCCH The time axis position of the PDSCH resource can be indicated according to the scheduling offset (K0) value, and the OFDM symbol start position (800) and length (805) within one slot that are dynamically indicated through DCI.
[0223] FIG. 9 is a diagram illustrating an example of time-axis resource allocation according to the subcarrier spacing of a data channel and a control channel in a wireless communication system according to an embodiment of the present disclosure. Referring to FIG. 9, when the subcarrier spacing of the data channel and the control channel is the same (900, μ PDSCH = μ PDCCH ), since the slot numbers for data and control information are the same, the base station and the terminal can generate a scheduling offset by aligning with a predetermined slot offset K0. On the other hand, when the subcarrier spacing of the data channel and the control channel is different (905, μ PDSCH ≠ PDCCHSince the slot numbers for data and control information are different, the base station and the terminal can generate a scheduling offset based on the subcarrier interval of the PDCCH and in accordance with a predetermined slot offset K0.
[0224] FIG. 10 is a diagram illustrating an example of a wireless protocol structure of a base station and a terminal in a single cell, carrier aggregation, and dual connectivity situation according to one embodiment of the present disclosure.
[0225] Referring to FIG. 10, the wireless protocol of the next-generation mobile communication system consists of NR SDAP (Service Data Adaptation Protocol 1025, 1070), NR PDCP (Packet Data Convergence Protocol 1030, 1065), NR RLC (Radio Link Control 1035, 1060), and NR MAC (Medium Access Control 1040, 1055) at the terminal and the NR base station, respectively.
[0226] The main functions of NR SDAP (1025, 1070) may include some of the following functions.
[0227] - User data transfer function (transfer of user plane data)
[0228] - Mapping function between a QoS flow and a DRB for both DL and UL for uplink and downlink
[0229] - Marking QoS flow ID for uplink and downlink (marking QoS flow ID in both DL and UL packets)
[0230] - Function to map reflective QoS flow to data bearers for uplink SDAP PDUs (reflective QoS flow to DRB mapping for the UL SDAP PDUs).
[0231] Regarding the SDAP layer device, the terminal may receive a setting via an RRC message indicating whether to use the header of the SDAP layer device or the functions of the SDAP layer device for each PDCP layer device, for each bearer, or for each logical channel. If the SDAP header is set, the terminal may be instructed to update or reset the mapping information for the uplink and downlink QoS flows and data bearers to the NAS reflective QoS and AS reflective QoS 1-bit indicators of the SDAP header. The SDAP header may include QoS flow ID information indicating QoS. The QoS information may be used for data processing priority, scheduling information, etc., to support smooth service.
[0232] The main functions of NR PDCP (1030, 1065) may include some of the following functions.
[0233] - Header compression and decompression features (ROHC only)
[0234] - User data transfer function (Transfer of user data)
[0235] - Sequential delivery function (In-sequence delivery of upper layer PDUs)
[0236] - Out-of-sequence delivery of upper layer PDUs
[0237] - Reordering function (PDCP PDU reordering for reception)
[0238] - Duplicate detection function (Duplicate detection of lower layer SDUs)
[0239] - Retransmission of PDCP SDUs
[0240] - Encryption and decryption functions (Ciphering and deciphering)
[0241] - Timer-based SDU discard in uplink.
[0242] In the above, the reordering function of the NR PDCP device refers to a function that reorders PDCP PDUs received from a lower layer in order based on the PDCP SN (sequence number), and may include a function that transmits data to an upper layer in the reordered order. Alternatively, the reordering function of the NR PDCP device may include a function that transmits immediately without considering the order, a function that records lost PDCP PDUs by reordering, a function that reports the status of lost PDCP PDUs to the transmitting side, and a function that requests retransmission of lost PDCP PDUs.
[0243] The main functions of NR RLC(1035, 1060) may include some of the following functions.
[0244] - Data transfer function (Transfer of upper layer PDUs)
[0245] - Sequential delivery function (In-sequence delivery of upper layer PDUs)
[0246] - Out-of-sequence delivery of upper layer PDUs
[0247] - ARQ function (Error Correction through ARQ)
[0248] - Concatenation, segmentation, and reassembly functions of RLC SDUs
[0249] - Re-segmentation function (Re-segmentation of RLC data PDUs)
[0250] - Reordering function (Reordering of RLC data PDUs)
[0251] - Duplicate detection
[0252] - Error detection function (Protocol error detection)
[0253] - RLC SDU discard function
[0254] RLC re-establishment function
[0255] In the above, the in-sequence delivery function of the NR RLC device refers to the function of delivering RLC SDUs received from a lower layer to an upper layer in order. The in-sequence delivery function of the NR RLC device may include a function of reassembling and delivering the RLC SDUs when the original RLC SDU is received divided into multiple RLC SDUs, a function of rearranging the received RLC PDUs based on an RLC SN (sequence number) or PDCP SN (sequence number), a function of recording lost RLC PDUs by rearranging the order, a function of reporting the status of lost RLC PDUs to the transmitting side, and a function of requesting retransmission of lost RLC PDUs. The in-sequence delivery function of the NR RLC device may include a function to deliver only the RLC SDUs prior to the lost RLC SDU in order to the upper layer if there is a lost RLC SDU, or a function to deliver all RLC SDUs received before the timer started in order to the upper layer if a predetermined timer has expired even if there is a lost RLC SDU. Alternatively, the in-sequence delivery function of the NR RLC device may include a function to deliver all RLC SDUs received up to the present in order to the upper layer if a predetermined timer has expired even if there is a lost RLC SDU.In addition, the RLC PDUs described above may be processed in the order they are received (regardless of the order of sequence numbers, in the order of arrival) and delivered to the PDCP device out of order (out-of-sequence delivery). In the case of segments, segments stored in a buffer or to be received later may be received, reconstructed into a single complete RLC PDU, processed, and delivered to the PDCP device. The NR RLC layer may not include a concatenation function, and this function may be performed by the NR MAC layer or replaced by the multiplexing function of the NR MAC layer.
[0256] In the above, the out-of-sequence delivery function of the NR RLC device refers to a function of delivering RLC SDUs received from a lower layer directly to an upper layer regardless of order. It may include a function of reassembling and delivering RLC SDUs when a single RLC SDU is received divided into multiple RLC SDUs, and may include a function of storing the RLC SN or PDCP SN of the received RLC PDUs and sorting the order to record the lost RLC PDUs.
[0257] The NR MAC (1040, 1055) can be connected to multiple NR RLC layer devices configured in a terminal, and the main functions of the NR MAC may include some of the following functions.
[0258] - Mapping function (Mapping between logical channels and transport channels)
[0259] - Multiplexing and demultiplexing functions (Multiplexing / demultiplexing of MAC SDUs)
[0260] - Scheduling information reporting function
[0261] - HARQ function (Error correction through HARQ)
[0262] - Priority handling between logical channels of one UE
[0263] - Priority handling between UEs by means of dynamic scheduling
[0264] - MBMS service identification
[0265] - Transport format selection function
[0266] - Padding
[0267] The NR PHY layer (1045, 1050) can perform the operation of channel coding and modulating upper layer data, creating OFDM symbols and transmitting them to the wireless channel, or demodulating OFDM symbols received through the wireless channel and channel decoding them to transmit them to the upper layer.
[0268] The detailed structure of the above wireless protocol structure may vary depending on the carrier (or cell) operation method. For example, when a base station transmits data to a terminal based on a single carrier (or cell), the base station and the terminal use a protocol structure that has a single structure for each layer, such as S00. On the other hand, when a base station transmits data to a terminal based on Carrier Aggregation (CA) using multiple carriers in a single TRP, the base station and the terminal use a protocol structure that has a single structure up to RLC, such as 1010, but multiplexes the PHY layer through the MAC layer. As another example, when a base station transmits data to a terminal based on Dual Connectivity (DC) using multiple carriers in multiple TRPs, the base station and the terminal use a protocol structure that has a single structure up to RLC, such as 1020, but multiplexes the PHY layer through the MAC layer.
[0269] In subsequent disclosures, the carrier may represent a set bandwidth part of the carrier. That is, the data channel scheduled on the carrier may represent a data channel scheduled on the bandwidth part of the carrier. In subsequent disclosures, the carrier may be interpreted as being replaced by a cell. In subsequent disclosures, the data channel may correspond to a physical downlink data channel (PDSCH) or a physical uplink data channel (PUSCH), and all methods described below may be applied to both PDSCH and PUSCH, or specific methods may be applied only to specific channels.
[0270] The method for a base station to generate a downlink data channel (PDSCH) to transmit a DL-SCH (or transport block, TB) is as follows. The generation method below may also be applied to the terminal's uplink data channel (PUSCH). Based on the generation method below, the terminal can decode the DL-SCH (or TB) from the PDSCH. In the case of reception, each step of the method described below proceeds in reverse order, and the corresponding opposite operation may be performed.
[0271] TB generation and TB CRC attachment block: The physical layer of the base station receives a DL-SCH from the upper layer of the base station and can generate a TB based on the bits included in the DL-SCH. Here, the length of the TB (number of bits included, TB size, TBS) may be associated with the scheduling information of the PDSCH. The terminal may include a CRC in the TB. The terminal may refer to the CRC as TB-CRC. When the terminal receives the PDSCH, it can determine whether the TB has been correctly decoded based on the TB-CRC. The length of the TB-CRC may be 24 bits.
[0272] The PUSCH scheduling information used to determine the TB length (TBS) includes the modulation and coding scheme (MCS), time domain resource assignment (TDRA), frequency domain resource assignment (FDRA), and DMRS configuration information, antenna port (AP) related information, and overhead related information (X oh It may be at least one or a plurality of ). The TBS determination method is described later in the second embodiment.
[0273] Code block segmentation and code block CRC attachment block: TB and TB-CRC can be divided into one or more code blocks (CB). Here, the number of bits contained in each CB may be the same. A CB-CRC may be attached to each CB. Here, when the terminal decodes the PDSCH, the CB-CRC can be used to determine whether the corresponding CB has been correctly decoded.
[0274] Channel coding of DL-SCH block: Each CB and CB-CRC can be encoded according to channel coding. For example, the CB and CB-CRC can be encoded using LDPC channel coding.
[0275] Rate matching block: Rate matching can be performed on encoded CBs and CB-CRCs based on the number of resources through which DL-SCH can be transmitted in PDSCH. That is, among the encoded CBs and CB-CRCs, the bits to be transmitted to PDSCH can be determined. According to the conventional technique, the same rate-matching is applied to multiple CBs included in DL-SCH. The same rate-matching means that the number of bits transmitted after each CB is channel-coded is nearly identical. More specifically, the bits transmitted after the CBs are channel-coded can be determined as shown in Table 16.
[0276] E r E is the number of bits after rate-matching when code block r is rate-matched. r It can be determined as follows. Set j=0 for r=0 to C-1 if ;else ;end ifj=j+1;end ifend forwhere- N Lis the number of transmission layers that the transport block is mapped onto;- Q m is the modulation order;- G is the total number of coded bits available for transmission of the transport block;- C the number of scheduled code blocks of the transport block
[0277] Referring to Table 16, based on the number of bits that can transmit DL-SCH to PDSCH, the number of G and CB, and C, the number of bits after rate matching is This or It can be. In one RE of PDSCH, there is N L ×Q m N bits can be mapped. This means that N bits can be mapped to a single RE. L There are corresponding modulation symbols, and each modulation symbol is Q m This is because bits correspond. Therefore, the length of each code block (E r ) is N L ×Q m It can be an integer multiple of. Only one code block can be mapped to one RE.
[0278] Code block concatenation block: If multiple CBs are generated, the encoded bits (number determined in the rate matching block) corresponding to each CB and CB-CRC can be configured into a single bit stream. For example, if two CBs are generated, the encoded bits corresponding to the 0th CB and CB-CRC are {C 0,0 , C 0,1, ... , C 0,M-1}, encoded bits corresponding to the first CB and CB-CRC {C 1,0 , C 1,1, ... , C 1,M-1 When saying}, {C 0,0 , C 0,1, ... , C 0,M-1 ,C 1,0 , C 1,1, ... , C 1,M-1} can be generated.
[0279] Scrambling Block: The base station can apply scrambling to the bit stream. The input bit streams of the Scrambling Block are b(0), ..., b(M bit When given as -1), the scrambled output bit stream is can be calculated as follows. M bit is the length of the bit stream included in PDSCH, E0+E1+... +E C-1 It could be.
[0280]
[0281] Here, c(i) is a scrambling permutation, and the initial value is c inti = n RNTI ×2 15 +q×2 14 +n ID It can be expressed as. Here, n ID is a unique scrambling identifier, which may be a value set by the base station for the terminal or the physical identifier value of the cell. RNTI q may be an RNTI value corresponding to the terminal's PDSCH. When the terminal includes multiple codewords in the PDSCH, q may be 0 for the first codeword and 1 for the second codeword.
[0282] Modulation Block: The base station can modulate a scrambled bit sequence. The modulation method can follow schemes such as QPSK, 16QAM, 64QAM, and 256QAM. The modulated symbols are d(0), ..., d(M symb -1) It could be, and M symb =M bits / Q m It could be.
[0283] Layer mapping and Antenna mapping block: The base station can map modulated symbols to the MIMO layers of the PDSCH. The PDSCH can have up to 8 layers. If the PDSCH includes v=1 MIMO layer, then x (0) (i)=d(i), and if PDSCH includes v=2 MIMO layers, then x (0) (i)=d(2*i), x (1) (i)=d(2*i+1), and if PDSCH includes v=3 MIMO layers, then x (0) (i)=d(3*i), x (1) (i)=d(3*i+1), x (2) (i)=d(3*i+2), and if PDSCH includes v=4 MIMO layers, then x (0) (i)=d(4*i), x (1) (i)=d(4*i+1), x (2) (i)=d(4*i+2), x (3) (i)=d(4*i+3) can be.
[0284] After being mapped to the layers, an antenna port can be mapped to each layer. That is, It can be. Here, s=0, ..., v-1.
[0285] VRB Mapping Block: The base station is It can be mapped to resources of the PDSCH. Here, resources can represent VRBs (virtual resource blocks). The base station can include the mapped PDSCH VRBs in the scheduling information and map modulated symbols to the VRBs in a predetermined order. More specifically, the base station [maps] the resources among the VRBs, excluding those that cannot be used for the PDSCH. It can be arranged in ascending order of frequency, and then in ascending order of time.
[0286] VRB-to-PRB Mapping Block: The base station can map values mapped to VRBs to PRBs (physical resource blocks). Multiple consecutive VRBs are grouped to form VRB bundles, and multiple consecutive PRBs are grouped to form PRB bundles, and these can be mapped to PRB bundles on a VRB bundle basis. Here, VRB bundle j can be mapped to PRB bundle f(j) based on the VRB-to-PRB interleaver function f(j). The VRB-to-PRB interleaver function f(j) is described later in the first embodiment.
[0287] OFDM signal generation block: The base station can generate an OFDM signal based on values mapped to PRBs and transmit it to the terminal.
[0288] FIG. 11 is a diagram illustrating an example of scheduling data channels on multiple carriers.
[0289] According to the conventional method, a separate data channel may be scheduled for each carrier wave. Each data channel may include a TB. For example, a first data channel (1101) may be scheduled for a first carrier wave (1100) with a center frequency of f1. The first data channel (1101) may include a first transmission block (1102). A second data channel (1111) may be scheduled for a second carrier wave (1110) with a center frequency of f2. The second data channel (1111) may include a second transmission block (1112). Here, the first transmission block (1102) and the second transmission block (1112) may contain different information. The first transmission block (1102) may include one or more code blocks (CB#1-0, CB#1-1, CB#1-2). The second transmission block (1112) may include one or more code blocks (CB#2-0, CB#2-1).
[0290] Alternatively, a single data channel (1151) may be scheduled to a plurality of carriers (1100, 1110) for the terminal. The single data channel (1151) may include a single TB (1152). That is, a single TB may be transmitted across a plurality of carriers. Furthermore, a single TB (1152) may include a plurality of code blocks (CB#0, CB#1, CB#2, CB#3, CB#4), and each code block may be mapped across a plurality of carriers.
[0291] The present disclosure discloses methods for determining frequency resources, length of transmission blocks (TB size), rate-matching, and mapping code blocks within a data channel when a data channel is scheduled on a plurality of carriers.
[0292] Although described as a carrier wave in this disclosure, it may be replaced with various terms such as a cell or a frequency segment. Additionally, the carrier wave may correspond to at least one of the following.
[0293] A terminal may be configured with multiple bandwidth portions. Each bandwidth portion may include consecutive RBs. The multiple bandwidth portions may be combined (i.e., the entire set) and considered as a single bandwidth portion. An embodiment of the present disclosure may interpret consecutive RBs as a single carrier wave.
[0294] The terminal can receive an ultra-wideband carrier. Here, the terminal can receive the ultra-wideband carrier through multiple RF chains. For example, the ultra-wideband carrier has a bandwidth of 400 MHz, and the terminal can receive the ultra-wideband carrier using two RF chains with a bandwidth of 200 MHz. In this case, the RBs corresponding to each RF chain can be interpreted as a single carrier. That is, the terminal receives one ultra-wideband carrier (400 MHz) from the base station, but can operate by considering it as two carriers (200 MHz) from the terminal's perspective.
[0295] [First Embodiment: Method for Determining Scheduled Frequency Resources (RB)]
[0296] According to a conventional method, a method for determining frequency resources for a single carrier is disclosed. More specifically, a terminal can determine resources for which a data channel is scheduled in two steps as follows.
[0297] In the first step, the terminal can determine the indices of scheduled RBs based on frequency domain resource assignment (FDRA) information. Here, the scheduled RBs may be referred to as VRBs. This can be used to distinguish them from PRBs, which are frequency resources actually scheduled for the terminal. In one method, the FDRA may include a bitmap. Each bit corresponds to a VRB, and if the bit value is '1', the terminal can determine that the corresponding VRBs are scheduled. This may be referred to as FDRA type-0. In another method, the FDRA may include the index of the starting VRB and the number of consecutive VRBs. Here, the index of the starting VRB and the number of consecutive VRBs may be jointly coded as a RIV (resource indication value) and included in the FDRA. The terminal can determine that the VRBs consecutive from the starting VRB are scheduled. This may be referred to as FDRA type-1.
[0298] In the second step, the index of the VRB can be mapped to the index of the PRB. Based on the indices of the mapped PRBs, the data channel can be transmitted or received. The mapping between the index of the VRB and the index of the PRB can be called VRB-to-PRB mapping. The purpose of the second step may be to distribute the scheduled VRBs to the PRBs of the actual frequency axis.
[0299] More specifically, the conventional VRB-to-PRB mapping is as follows.
[0300] If FDRA type-0, the VRB with index i can correspond to the PRB with index i. This is because the VRBs have already been scheduled and distributed across the frequency axis based on a bitmap.
[0301] If FDRA type-1, VRB-to-PRB mapping can be performed via the following process. N size Let be the number of RBs included in the BWP on the carrier wave, and N start Let be the starting index of the RB included in the BWP. Here, the index is assigned based on the common RB, and the lowest RE (or subcarrier) in the frequency axis of the common RB with an index of 0 is called PointA, and it may be a value that the base station informs the same terminal within the same cell.
[0302] N included in the carrier wave size The dogs' RBs It can be grouped into bundles. Here, L can be a value of 2 or 4, which is the size of the VRB-to-PRB mapping. The terminal can receive the L value from the base station.
[0303] - The first group (the group with index 0) is L-(N start It includes mod L) RBs, and
[0304] - Last group of groups (index N bundle -1 person bundle) is (N start +N size If )mod L>0, then (N start +N size )mod includes L RBs, otherwise includes L RBs,
[0305] - The remaining bundles may contain L RBs.
[0306] VRBs can be mapped to PRBs in bundles. More specifically,
[0307] - Index is N bundle A VRB bundle of -1 has an index of N bundle It can be mapped to a PRB of -1.
[0308] - Index j∈{0, 1, ... N bundleA VRB group of {-2} can be mapped to a PRB of index f(j). Here, f(j) can be as follows.
[0309] [Mathematical Formula 3]
[0310] f(j) = rC+c
[0311] j=cR+r
[0312] r=0, 1, ... R-1
[0313] c=0, 1, ... C-1
[0314] R=2
[0315] C=
[0316] According to the conventional method, VRB-to-PRB mapping can distribute consecutively scheduled VRBs into R=2 consecutive PRBs.
[0317] A single data channel may be mapped to multiple carriers. In this case, PRBs scheduled on multiple carriers must be determined. A method for this is disclosed. A method for a terminal to determine a PRB includes a first step of determining a scheduled VRB of one or more carriers by receiving instructions from a base station for one or more FDRAs, and a second step corresponding to VRB-to-PRB mapping of determining a PRB based on the determined scheduled VRB. To determine a PRB, one or more combinations of a plurality of methods for the first step and one or more combinations of a plurality of methods for the second step described below may be used.
[0318] Below, various methods for the first stage are described.
[0319] In one method, as a first step, the terminal may receive a plurality of FDRAs from a base station. Here, each FDRA may correspond to each carrier. That is, the terminal may determine the FDRA corresponding to the i-th carrier from the plurality of FDRAs. The terminal may determine the VRBs scheduled on the i-th carrier through the said FDRAs. If the terminal has a maximum of N c If a data channel can be scheduled on N carriers, the terminal receives N from the base station c Can be prescribed FDRA.
[0320] Each FDRA can have the same FDRA type. That is, different FDRAs may not be set to different FDRA types.
[0321] The following describes a method for determining a VRB that is scheduled based on an FDRA for a single carrier. In one method, as a first step, a terminal may be instructed by a base station to have an FDRA for a single carrier. Here, the single carrier may be a reference carrier. For example, the carrier with the lowest index among the carriers may be called the reference carrier. For example, if the terminal is set to carriers with indices {0, 1, 2, 3} by the base station, the reference carrier may be the carrier with index 0. Note that the reference carrier may not actually be scheduled. Alternatively, for example, the carrier with the lowest index among the scheduled carriers may be called the reference carrier. For example, if the terminal is set to carriers with indices {0, 1, 2, 3} by the base station and the scheduled carrier is {2, 3}, the reference carrier may be the carrier with index 2. Alternatively, it is also possible for the reference carrier to be set by the base station.
[0322] The terminal can interpret the FDRA based on the settings of the reference carrier. Here, the settings of the FDRA and the length of the FDRA can be determined according to the settings of the reference carrier. The terminal can determine the indices of the VRBs of the reference carrier based on the FDRA. The VRBs scheduled on the actually scheduled carrier can be determined as follows. For convenience, the determination method described below is in the VRB unit, but it can be determined in the VRB bundle unit. In this case, the index of the VRB can be interpreted by replacing it with the index of the VRB bundle.
[0323] In the following description, VRB i in the reference carrier is a VRB with index i, and the index of the VRB can be determined as follows: the index of the RB with the lowest frequency of the reference carrier or the RB with the lowest frequency of the BWP of the reference carrier is 0, and the index of the RB can be determined in ascending order of frequency. In the actually scheduled carrier, VRB i is a VRB with index i, and the index of the VRB can be determined as follows: the index of the RB with the lowest frequency of the actually scheduled carrier or the RB with the lowest frequency of the BWP of the actually scheduled carrier is 0, and the index of the RB can be determined in ascending order of frequency. If the reference carrier and the actually scheduled carrier are different, VRB i in the reference carrier and VRB i in the actually scheduled carrier may have the same index but be different VRBs.
[0324] <First Determination Method>
[0325] - According to the first decision method, VRBs with the same index in the carriers can be scheduled.
[0326] - If VRB i is scheduled on the reference carrier, VRB i can be determined to be scheduled on the actually scheduled carriers.
[0327] ■ The terminal can determine that VRB i is not scheduled if VRB i is not included in the actually scheduled carrier.
[0328] - If VRB j is not scheduled on the reference carrier, it can be determined that VRB j is not scheduled on the actually scheduled carriers.
[0329] <Second Determination Method>
[0330] - According to the second determination method, a method is provided for determining the RBs that are scheduled for the actual carrier based on the number of RBs included in the reference carrier and the actual carrier being scheduled. Here, if the number of RBs included in the actual carrier being scheduled is greater than or equal to K times the number of RBs included in the reference carrier (where K is an integer), one VRB of the reference carrier may correspond to K VRBs of the actual carrier being scheduled.
[0331] - The number of VRBs that can be scheduled on the reference carrier is N ref Let's say that N is the number of VRBs that can actually be scheduled on a scheduled carrier k. act,k Let's say. If <2, follow the first criterion, and K= If ≥2, follow the method below.
[0332] - If VRB i is scheduled on the reference carrier, VRB K*i, VRB K*i+1,..., VRB K*i+K-1 on the actually scheduled carriers can be determined to be scheduled.
[0333] ■ The terminal can determine that VRB(s) among VRB K*i, VRB K*i+1,..., VRB K*i+K-1 that are not included in the actually scheduled carrier are not scheduled.
[0334] - If VRB j is not scheduled in the reference carrier, VRB K*j, VRB K*j+1, ..., VRB K*j+K-1 in the actually scheduled carriers can be determined not to be scheduled.
[0335] <Section 3-1 Determination Method>
[0336] - According to the determination method of 3-1 to 3-2, a method is provided for determining the RBs that are scheduled for the actual carrier based on the number of RBs included in the reference carrier and the actual carrier that is scheduled. Here, if the number of RBs included in the reference carrier is greater than or equal to M times the number of RBs included in the actual carrier that is scheduled (M is an integer), then M VRBs of the reference carrier may correspond to one VRB of the actual carrier that is scheduled.
[0337] - The number of VRBs that can be scheduled on the reference carrier is N ref Let's say that N is the number of VRBs that can actually be scheduled on a scheduled carrier k. act,k Let's say. If ≥1, follow the first or second criterion, and If <1, follow the method below. Here, M= am.
[0338] - If VRB M*i, VRB M*i+1, ..., VRB M*i+M-1 are all scheduled in the reference carrier, VRB i can be determined to be scheduled in the actually scheduled carriers.
[0339] ■ The terminal can determine that VRB i is not scheduled if VRB i is not included in the actually scheduled carrier.
[0340] - If at least one VRB among VRB M*j, VRB M*j+1, ..., VRB M*j+M-1 in the reference carrier is not scheduled, VRB j in the actually scheduled carriers can be determined not to be scheduled.
[0341] <Section 3-2 Determination Method>
[0342] - The number of VRBs that can be scheduled on the reference carrier is N ref Let's say that N is the number of VRBs that can actually be scheduled on a scheduled carrier k. act,k Let's say. If ≥1, follow the first or second criterion, and If <1, follow the method below. Here, M= am.
[0343] - If at least one VRB among VRB M*i, VRB M*i+1, ... VRB M*i+M-1 is scheduled in the reference carrier, VRB i can be determined to be scheduled in the actually scheduled carriers.
[0344] ■ The terminal can determine that VRB i is not scheduled if VRB i is not included in the actually scheduled carrier.
[0345] - If VRB M*j, VRB M*j+1, ... VRB M*j+M-1 are all not scheduled in the reference carrier, VRB j can be determined not to be scheduled in the actually scheduled carriers.
[0346] The above method can be applied independently to each scheduled carrier.
[0347] According to the method described above, a correspondence relationship may exist between the VRB of the reference carrier and the VRB of the actual scheduled carrier. Here, the correspondence relationship may be a one-to-one relationship (Method 1), a one-to-many relationship (1-to-K mapping, Method 2), or a many-to-many relationship (M-to-1 mapping, Embodiment 3). Here, the relationship may be determined based on the ratio of the number of RBs included in the reference carrier to the number of RBs included in the scheduled carrier. For example, the K value to the M value may be determined based on the settings of the base station. Additionally, the base station may set the terminal whether to apply the first to third (3-1 or 3-2) determination methods.
[0348] FIG. 12 is a drawing illustrating an example of determining a scheduled VRB according to the 3-1 to 3-2 determination methods of the present disclosure.
[0349] Referring to FIG. 12, a terminal may receive a data channel scheduled on a first carrier (1200) and a second carrier (1210). Here, the first carrier (1200) may include 20 RB bundles, and the second carrier (1210) may include 10 RB bundles. The terminal may determine the first carrier (1200) as a reference carrier. That is, the terminal may receive an FDRA corresponding to the first carrier (1200) from a base station. The terminal may determine the VRBs (here, VRB bundles) scheduled on the first carrier from the FDRA. For example, based on the FDRA, the terminal may determine that VRB bundles 0, 1, 2, and 3 are scheduled on the first carrier.
[0350] At this time, the terminal can determine the VRBs (here, VRB bundles) scheduled on the second carrier wave (1210). Here, M= = can be 2. That is, consecutive M=2 VRBs (here, VRB bundles) of the first carrier can correspond to one VRB (here, VRB bundle) of the second carrier. More specifically, the terminal can determine that VRB bundle 0 of the second carrier is scheduled because VRB bundles 0 and 1 of the first carrier are scheduled. Also, the terminal can determine that VRB bundle 1 of the second carrier is scheduled because VRB bundles 2 and 3 of the first carrier are scheduled.
[0351] Next, a method for a single FDRA for all (scheduled) carriers is described. In one method, as a first step, a terminal may receive a single FDRA for all (scheduled) carriers from a base station. Here, the FDRA may represent scheduling information for VRBs included in all (scheduled) carriers. For example, in the case of FDRA type-0, the FDRA may include a bitmap. Here, the length of the bitmap may be determined based on the number of VRBs corresponding to all (scheduled) carriers. Each bit of the bitmap may have a corresponding carrier and a corresponding VRB. If the bit is '1', it may be determined that the VRBs corresponding to the corresponding carrier are scheduled. In the case of FDRA type-1, the FDRA may include the index of the starting VRB and the number of consecutive VRBs.
[0352] Here, VRBs included in all carriers can be indexed in ascending order along the frequency axis. That is, VRBs with lower indices can be located at lower frequencies than VRBs with higher indices. Here, VRBs included in unscheduled carriers may also be included when indexing. In this case, the carrier index can be ignored.
[0353] Alternatively, here, VRBs included in scheduled carriers may be indexed in ascending order along the frequency axis. That is, VRBs with lower indices may be located at lower frequencies than VRBs with higher indices. Here, the carrier index may be ignored. Here, VRBs included in scheduled carriers are included when indexing, but VRBs included in unscheduled carriers may be excluded. Here, the carrier index may be ignored.
[0354] Alternatively, VRBs included in all carriers can be indexed in ascending order of the carrier index and the frequency axis. That is, VRBs of carriers with lower indices can have lower indices than VRBs of carriers with higher indices. VRBs included in the same carrier can be indexed in ascending order of frequency. Here, VRBs included in unscheduled carriers can also be included when indexing.
[0355] Alternatively, VRBs included in scheduled carriers may be indexed in ascending order of carrier index and in ascending order of the frequency axis. That is, VRBs of carriers with lower indices may have lower indices than VRBs of carriers with higher indices. VRBs included in the same carrier may be indexed in ascending order of frequency. Here, VRBs included in scheduled carriers are included when indexing, but VRBs included in unscheduled carriers may not be included.
[0356] FIG. 13 is a diagram illustrating an example of identifying a PRB when receiving a single FDRA for all (scheduled) carriers according to one embodiment of the present disclosure. Referring to FIG. 13, the first carrier (1300) may contain 20 VRBs, and the second carrier (1310) may contain 10 VRBs. The terminal may index the VRBs. Here, an example is illustrated in which the index of the VRBs of the first carrier (1300) is indexed first, and then the index of the VRBs of the second carrier (1310) is indexed. Thus, the index of the total VRBs of the two carriers may be 0, 1, ..., 29. The terminal may receive a FDRA indicating 15 as the index of the starting VRB among the VRBs and 8 as the number of consecutive VRBs. According to the above instructions, VRB 15, 16, 17, 18, 19 of the first carrier wave (1300) and VRB 0, 1, 2 of the second carrier wave (1310) can be scheduled.
[0357] In the second step, the VRB-to-PRB mapping can be as follows.
[0358] In the first method, the terminal can perform VRB-to-PRB mapping for VRBs of each carrier. That is, VRBs scheduled on carrier k can be mapped to PRBs according to equation f(i) of Equation 3 described above. In this case, values set on carrier k (e.g., L value) can be used. That is, VRB-to-PRB mapping can be performed based on different set values on different carriers.
[0359] The terminal may receive a DCI from the base station for scheduling data channels. The DCI may include a field indicating whether VRB-to-PRB mapping is applied to all scheduled carriers. For example, if the value of the field is '0', VRB-to-PRB mapping is not applied to all scheduled carriers (non-interleaved mapping), and if the value of the field is '1', VRB-to-PRB mapping is applied to all scheduled carriers (interleaved mapping).
[0360] Alternatively, the terminal may receive a DCI from a base station for scheduling a data channel. The DCI may include a field indicating whether to apply VRB-to-PRB mapping to each of the scheduled carriers. For example, the field may include bits corresponding to the number of carriers being scheduled, and each bit may correspond to each carrier. If the value of the bit is '0', VRB-to-PRB mapping is not applied to the corresponding scheduled carriers (non-interleaved mapping), and if the value of the bit is '1', VRB-to-PRB mapping is applied to the corresponding scheduled carriers (interleaved mapping).
[0361] Figure 14 is a diagram illustrating an example of VRB-to-PRB by carrier.
[0362] The terminal can be scheduled VRB bundles 0, 1, 2, and 3 of the first carrier (1400) and VRB bundles 0 and 1 of the second carrier (1410). The terminal can apply f(i) of Equation 3 according to VRB-to-PRB mapping to 20 VRB bundles of the first carrier. Here, R=2 and N bundle= can be 20. Therefore, PRB bundles 0, 1, 10, and 11 of the first carrier can be scheduled. The terminal can apply f(i) of Equation 3 to the 10 VRB bundles of the second carrier according to VRB-to-PRB mapping. Here, R=2 and N bundle =10. Therefore, PRB bundles 0 and 5 of the second carrier can be scheduled.
[0363] In the second method, the terminal can perform VRB-to-PRB mapping for the VRBs of all carriers. That is, the VRBs scheduled on all carriers can be mapped to PRBs by the equation f(i) according to Equation 3, where N bundle ≠
[0364] - In one method, R may be a value set by the base station. That is, the terminal may receive the value of R from the base station from upper-layer configuration information (e.g., an RRC signal). The value of R may be applied when data channels are scheduled on multiple carriers.
[0365] - In one method, R may be indicated by a base station. That is, the terminal may receive a DCI from the base station for scheduling a data channel. The DCI may include a field indicating an R value. The terminal may apply the indicated R value and use it for VRB-to-PRB mapping. For example, if the value of the field is '0', VRB-to-PRB mapping is not applied (non-interleaved mapping); if the value of the field is '1', the terminal applies a first R value; and if the value of the field is '2', the terminal applies a second R value.
[0366] - In one method, R can be determined based on the number of carriers to which the data channel is scheduled. The terminal can determine the number of carriers to which the data channel is scheduled. If the number is 2, R may be 2. If the number is 3, R may be 3. That is, R may be a value equal to the number of carriers to which the data channel is scheduled. Alternatively, if the number of carriers to which the data channel is scheduled is less than or equal to a specific value, R may be a first value (e.g., R=2). If the number of carriers to which the data channel is scheduled is greater than a specific value, R may be a second value (e.g., R=4). That is, there may exist an R value corresponding to the number of carriers to which the data channel is scheduled.
[0367] FIG. 15 is a drawing illustrating an example of VRB-to-PRB mapping according to one embodiment of the present disclosure.
[0368] Referring to FIG. 15, VRB bundles 0, 1, 2, 3, 20, and 21 can be scheduled for the terminal. In FIG. 15 (a), the terminal is N bundle With =30 and R=2, the VRB bundle can be mapped to the PRB based on f(i) of Equation 3. The terminal can determine that the PRB bundles 0, 1, 10, 15, 16 of the first carrier (1500) and the PRB bundle 5 of the second carrier (1510) are scheduled.
[0369] In Fig. 15(b), the terminal is N bundle With R=30 and R=3, the VRB bundle can be mapped to the PRB through f(i). The terminal can determine that the PRB bundles 0, 1, 7, 10 of the first carrier (1500) and the PRB bundles 0, 6 of the second carrier (1510) are scheduled. As described above, the PRB bundles scheduled may vary depending on the setting of the R value.
[0370] In a third method, the terminal can perform VRB-to-PRB mapping for the VRBs of all carriers. That is, the VRBs scheduled on all carriers can be mapped to PRBs using equation g(i) of Equation 4 below. In this case, N bundle ε₀ may be the number of bundles determined by grouping the VRBs of all carrier waves. g(j) can be expressed as follows. Here, R=2, or the value of R can be determined according to the second method described above.
[0371] [Mathematical Formula 4]
[0372] g(i)=cR+rj=rC+cr=0, 1, ... , R-1
[0373] c=0, 1, ... , C-1
[0374] C=
[0375] FIG. 16 is a drawing illustrating another example of VRB-to-PRB mapping according to one embodiment of the present disclosure.
[0376] Referring to FIG. 16, VRB bundles 15, 16, 17, 18, 19, 20, 21, and 22 can be scheduled for the terminal. In FIG. 16 (a), the terminal is N bundle With =30 and R=2, the VRB bundle can be mapped to the PRB through g(j). The terminal can determine that the PRB bundles 1, 3, 5, 7, 9, 11, 13, and 15 of the first carrier wave (1600) are scheduled.
[0377] In Fig. 16(b), the terminal is N bundle With R=30 and R=3, VRB bundles can be mapped to PRBs through g(j). The terminal can determine that PRB bundles 2, 5, 8, 16, and 19 of the first carrier (1600) and PRB bundles 2, 5, and 8 of the second carrier (1610) are scheduled. As described above, the PRB bundles scheduled may vary depending on the setting of the R value.
[0378] In the methods described above, VRB bundles or PRB bundles can be determined for each carrier. And the indices of VRB bundles or PRB bundles can be assigned in ascending order of frequency, or / and based on the carrier index. That is, the indices of VRB bundles of the carrier with the lowest carrier index can be assigned in ascending order of frequency starting from 0, and the indices of VRB bundles of the carrier with the next lowest index can be assigned in ascending order of frequency.
[0379] A single VRB bundle or PRB bundle may contain only the VPBs or PRBs of a single carrier. Therefore, the following process may be performed for each carrier.
[0380] Let be the number of RBs included in the BWP of carrier i, and Let be the starting index of the RB included in the BWP of carrier i. Here, the index is assigned based on the common RB, and the lowest RE (or subcarrier) in the frequency axis of the common RB with an index of 0 is called Point A, and it may be a value that the base station informs terminals within the same cell equally.
[0381] Included in carrier i The dogs' RBs It can be grouped into bundles. Here, L i can be a value of 2 or 4, which is the magnitude of the VRB-to-PRB mapping of carrier i. The terminal is the above L i The value can be set from the base station.
[0382] - The first group (the group with index 0) is L i -(N i start mod L i Includes ) RBs,
[0383] - Last group of groups (index N bundle,i -1 person bundle) is (N i start +N i size )mod L i If >0 (N i start +N i size )mod L i Includes RBs, and otherwise, L i Includes RBs,
[0384] - The remaining bundles are L i It can include RBs.
[0385] VRBs can be mapped to PRBs in bundles.
[0386] For example,
[0387] - The index of each carrier is N bundle,i A VRB bundle of -1 has an index of N bundle,i It can be mapped to a PRB of -1.
[0388] - Index j∈{0, 1, ... N bundle,tot - N c A VRB group of {-1} can be mapped to a PRB of index f(j), where N c is the number of carriers. For each carrier, since the last VRB bundle is mapped to the last PRB bundle, the VRB bundle and PRB bundles can be excluded from indexing.
[0389] As another example,
[0390] - A VRB bundle with an index of 0 for each carrier can be mapped to a PRB bundle with an index of 0.
[0391] - The index of each carrier is N bundle,i A VRB bundle of -1 has an index of N bundle,i -1 can be mapped to a PRB bundle.
[0392] - Index j∈{0, 1, ... N bundle,tot - 2*N c A VRB bundle of {-1} can be mapped to a PRB of index f(j), where N c is the number of carriers. For each carrier, the first VRB bundle is mapped to the first PRB bundle and the last VRB bundle is mapped to the last PRB bundle, so the VRB bundle and PRB bundles can be excluded from indexing.
[0393] The size of the VRB-to-PRB mapping (L), which is the number of RBs included in one bundle per carrier. i ) can be the same value.
[0394] Carrier 0, 1, ..., N c For -1, the following f(j) can be applied. Here, N is N bundle,tot - N c -1 or, N bundle,tot - 2*N c -1 or N bundle,tot It can be at least one of the values.
[0395] f(j)=rC+c
[0396] j=cR+r
[0397] r=0, 1, ... , R-1
[0398] c=0, 1, ... , C-1
[0399] R=2
[0400] C=
[0401] Alternatively, a single VRB bundle to PRB bundle may include VPBs to PRBs of multiple carriers. Accordingly, the following process may be performed for each carrier.
[0402] Let be the number of RBs included in the BWP of carrier i, and Let be the starting index of the RB included in the BWP of carrier i. All carriers (carriers 0, 1, ..., N c For -1), RBs can be grouped and indexed. That is, the number of RBs included in the BWP of all carriers is It becomes.
[0403] Included in all carriers The dogs' RBs It can be grouped into bundles. Here, L can be a value of 2 or 4, which is the size of the VRB-to-PRB mapping for all carriers. The terminal can receive the L value from the base station.
[0404] - The first group (the group with index 0) is L-(N0 start It includes mod L) RBs, and
[0405] - Last group of groups (index N bundle -1 person bundle) is (N0 start +N tot size If )mod L > 0, then (N0 start +N tot size )mod L RBs, otherwise, includes L RBs,
[0406] - The remaining bundles may contain L RBs.
[0407] VRBs can be mapped to PRBs in bundles. More specifically,
[0408] - Index is N bundle A VRB bundle of -1 has an index of N bundle It can be mapped to a PRB of -1.
[0409] - Index j∈{0, 1, ... N bundle A VRB group of {-2} can be mapped to a PRB of index f(j).
[0410] All carriers 0, 1, ...,Nc Mathematical formula 3 can be applied to -1.
[0411] [2nd Example: Method for Determining TBS]
[0412] According to the conventional method, the terminal determines the size of the TB (Transport block size, TBS) as follows. In the conventional method, a single PDSCH or PUSCH can be scheduled on a single carrier. Therefore, although not mentioned in the TBS determination method below, the method below corresponds to the TBS determination method for a PDSCH or PUSCH within a single carrier.
[0413] In the first step, the terminal uses the number of REs (N) used for data transmission within the slot. RE ) can determine. First, the terminal determines the number of REs (N') used for data transmission in one PRB within one slot. RE ) can be determined. The number of REs (N') used for data transmission in a single PRB within the slot. RE )Is It can be determined as. Here, N sc RB is the number of subcarriers included in the PRB, which can be 12. N symb sh can be the number of scheduled OFDM symbols. N DMRS PRB can be the number of REs used in DMRS. And, N oh PRB can represent the overhead value of the carrier wave.
[0414] The terminal uses the number of REs (N') for data transmission in one PRB within the slot. RE ) and the number of scheduled PRBs (n PRB Based on ), the number of REs (N) used for data transmission within the slot RE ) can be determined. More specifically, It could be.
[0415] In the second step, the terminal uses the number of REs (N) used for data transmission within the slot. RE The number of information bits (N) corresponding to ) info ) can be determined. More specifically, N info = N RE * R * Q m It can be represented as * v. Here, R is the code rate, Q m n is the modulation order, and v can be the number of MIMO layers. R and Q m It can be indicated through a DCI or upper-layer signal that schedules the data channel. For example, the DCI or upper-layer signal that schedules the data channel may include an MCS (Modulation and coding scheme) field, and the value of said field is a code rate (R) and a modulation order (Q m It can correspond to ). Here, N info may not be a natural number. (i.e., it may be a prime number)
[0416] In the third step, the terminal is N info The TBS corresponding to can be determined. More specifically, if N info If ≤ 3824, , And, TBS can be determined based on Table 17 below. If N info If it is 3824, , is. And, if the code rate R≤1 / 4, , is. And, the code rate R>1 / 4 and N' info If > 8424, , and, code rate R>1 / 4 and N' info If ≤8424 , C can be 1. Here, C can be the number of code blocks included in one TB.
[0417] IndexTBSIndexTBSIndexTBSIndexTBS1243133661128891362423232352621320923752340333686313529338244483438464141655635408651480664364326 61544772374566716088803848068167298839504691736109640528701800111 04415527118641211242576721928131204360873202414128446407420881513 645672752152161444670476221617152477367722801816048768782408191684980879247220176508488025362118451888812600221925292882266423208 5398483272824224541032842792252405510648528562625656112886297627272571160873104282885811928832402930459122489336830320601256903496
[0418] According to one embodiment of the present disclosure, a method for determining the size of a transmission block (TBS) included in a data channel is disclosed when a terminal transmits or receives a data channel on a plurality of carriers. In the first method, a reference carrier may be set for determining the TBS. The terminal may determine the reference TBS based on scheduling information of the reference carrier, and the actual TBS may be determined based on the carriers scheduled with the reference TBS.
[0419] The terminal can determine the TBS for the reference carrier. Here, based on Table 17, the terminal can determine the TBS of the reference carrier. More specifically, it is as follows.
[0420] In one method of the present disclosure, for example, in the first step, the terminal uses a number of REs (N) for data transmission within a slot of a reference carrier. RE,ref ) can be determined. First, the terminal determines the number of REs (N') used for data transmission in one PRB within one slot of the reference carrier. RE,ref ) can be determined. The number of REs (N') used for data transmission in one PRB within the reference carrier slot. RE )Is It can be determined as. N symb,ref sh can be the number of OFDM symbols scheduled on the reference carrier. N DMRS,ref PRB can be the number of REs used in the DMRS depending on the reference carrier setting. And, N oh,ref PRB It can represent the overhead value set on the reference carrier.
[0421] The terminal uses the number of REs (N') for data transmission in one PRB within the reference carrier slot. RE ) and the number of scheduled PRBs of the reference carrier (n PRB,ref Based on ), the number of REs (N) used for data transmission within the slot RE,ref ) can be determined. More specifically, It could be.
[0422] In one method of the present disclosure, in the second step, the terminal uses the number of REs (N) used for data transmission within the slot of the reference carrier. RE,ref The number of information bits (N) corresponding to ) info,ref ) can be determined. More specifically, N info,ref = N RE,ref * R ref * Q m,ref * v ref It can be expressed as. Here, R ref is the code rate of the reference carrier, Q m,ref is the modulation order of the reference carrier, v refcan be the number of MIMO layers of the reference carrier. R ref and Q m,ref This can be indicated through a DCI or upper-layer signal that schedules the data channel to the reference carrier.
[0423] In one method of the present disclosure, in the third step, N info =N info,ref Considering it as such, the terminal can determine the TBS.
[0424] That is, in the case of a downlink or uplink data channel, a base station or terminal can generate a TB based on a TBS determined based on a reference carrier and receive or transmit it through a plurality of scheduled carriers. According to the above method, since the base station or terminal determines the TBS based on the reference carrier and receives or transmits the TB using a plurality of carriers, the TB can be transmitted at a lower code rate. Therefore, a higher probability of reception or transmission success (higher coverage) can be provided.
[0425] However, data channels may be transmitted or received at a code rate different from the code rate specified by the base station. Furthermore, as the code rate decreases as the number of scheduled carriers increases, data channels may be transmitted or received at an unnecessarily low code rate, which can reduce the efficiency of frequency resources.
[0426] In one method of the present disclosure, N of the first step RE,ref N of the second stage info,ref TBS of stage 3 or 3 ref can be scaled according to the number of scheduled carriers. For example, N of the first stage RE,ref is the number of scheduled carriers (N carrier sch It can be scaled according to ). That is, for example, N RE = N RE,ref * N carrier sch It could be. Or, N of the second stageinfo,ref is the number of scheduled carriers (N carrier sch It can be scaled according to ). That is, for example, N info = N info,ref * N carrier sch It could be. The terminal is N RE N info Based on this, TBS can be determined based on Table 17, the conventional method. 3-step TBS ref is the number of scheduled carriers (N carrier sch It can be scaled according to ). That is, for example, TBS = TBS ref * N carrier sch It could be. Here, TBS ref is N RE,ref N info,ref It may be the TBS of the reference carrier determined based on.
[0427] According to the method described above, the terminal can increase the TBS based on the number of scheduled carriers. However, if the number of scheduled PRBs for each carrier is different, the TBS scaled simply based on the number of scheduled carriers may have a value different from the code rate intended by the base station. Therefore, the method described above may be advantageous when applied when the number of scheduled PRBs for the scheduled carriers is the same or similar.
[0428] In one method of the present disclosure, N of the first step RE,ref N of the second stage info,ref can be scaled according to the ratio of the number of scheduled PRBs (on the reference carrier). Here, the ratio of the number of scheduled PRBs is the number of PRBs scheduled on all carriers (n PRB,total ) and the number of PRBs scheduled on the reference carrier (n PRB,ref As a ratio between, (n PRB,total / n PRB,ref It can be.
[0429] For example, N of the first stage RE,ref is the ratio of the number of scheduled PRBs (n PRB,total / n PRB,ref It can be scaled according to ). That is, N RE = N RE,ref * n PRB,total / n PRB,ref It could be. Or, N of the second stage info,ref is the ratio of the number of scheduled PRBs (n PRB,total / n PRB,ref It can be scaled according to ). That is, N info = N info,ref * n PRB,total / n PRB,ref It could be. The terminal is N RE N info Based on this, the TBS can be determined based on the conventional method Table 17.
[0430] For reference, the method described above may be the same as the following.
[0431]
[0432] That is, the number of REs (N') that the terminal uses for data transmission in one PRB within one slot of the reference carrier. RE,ref Calculate ) and the number of scheduled PRBs of all scheduled carriers (n PRB,total It may be that scaling is performed using ).
[0433] In one method of the present disclosure, N of the first step RE,ref N of the second stage info,ref A scaling value K can be applied to it.
[0434] For example, N of the first stage RE,ref can be scaled according to the scaling value K. That is, N RE = N RE,ref * It can be K. Or, N of the second stage info,ref can be scaled according to the scaling value K. That is, N info = N info,ref It can be K. The terminal is NRE N info Based on this, the TBS can be determined based on the conventional method Table 17.
[0435] Here, the scaling value K may be a value set by the base station for the terminal or a value instructed by the DCI. For example, the terminal may receive the scaling value K as a higher-level signal (RRC signal) from the base station. The terminal may determine the TBS by applying the set K value. This applies only when the scheduled data channel is scheduled on at least two carriers (i.e., if it is scheduled on only one carrier, the K value is not applied). For example, the terminal may receive multiple scheduling values K as a higher-level signal (RRC signal) from the base station and receive a single scaling value instructed by the DCI that schedules the data channel. The terminal may determine the K value based on the single scaling value instructed by the DCI and determine the TBS using the said K value.
[0436] At least one of the scaling parameters described above is TBS ref It can be used for scaling. For example, TBS based on at least one of the number of scheduled carriers, the number of PRBs scheduled for each carrier, and scaling parameters set from the base station. ref G can be scaled, whereby N of the first or second step described above can be scaled. RE,ref or N info,ref Scaling can be applied to.
[0437] A second method is disclosed for determining a TBS based on information of a plurality of scheduled carriers. In this case, a separate reference carrier is not determined, and a TBS can be determined separately for each carrier.
[0438] In one method, the terminal, for each carrier, N' RE and N RECalculate individually, and N of each carrier wave RE Based on listening N info It can be determined. For convenience, N' corresponding to carrier i RE (i) and N RE Let's call it (i). Here It can be. Here, N symb sh (i) is the number of OFDM symbols scheduled on carrier i, N DMRS PRB (i) is the number of REs used in DMRS on carrier i, N oh PRB (i) can be the amount of overhead in carrier i. It can be. Here, n PRB (i) can be the number of RBs scheduled on carrier i.
[0439] The terminal can determine the total number of REs of the scheduled carriers (for convenience, assuming that carriers with indices i=0,1, ...,K-1 are scheduled). That is, N RE =N RE (0) + N RE (1) + ... + N RE (K-1) It could be. The terminal is N RE Based on this, the TBS can be determined by applying the second and third steps of the TBS determination described above. For reference, when applying the second step, for each scheduled carrier, R and Q m If , v are different, the terminal uses R and Q of a single carrier (the reference carrier mentioned above). m , v values can be used. Or the {R, Q of scheduled carriers m The smallest (or largest) value among { , v} can be used. Or the R*Q of the scheduled carriers. m You can use the smallest (or largest) value among the *v values.
[0440] Or the terminal is N corresponding to the number of REs for each of the scheduled carriers (for convenience, assuming carriers with indices i=0,1, ...,K-1 are scheduled). info The value can be determined. That is, N info =N info (0) + N info (1) + ... + N info (K-1) It can be. Here, N info (i) = N RE (i) * R(i) * Q m (i) * v(i) can be. Here, R(i) is the code of carrier i, Q m (i) is the modulation order of carrier i, and v(i) may be the number of MIMO layers of carrier i. The terminal is N info Based on this, the TBS can be determined by applying the third step of the TBS determination described above.
[0441] Or, when K carriers are scheduled, the terminal is N as follows info You can determine the value.
[0442]
[0443] Here, N info (i) can be determined based on the REs scheduled for each carrier. For example, N info (i) = N RE (i) * R(i) * Q m (i) * v(i) can be. Alternatively, N info (i) can be determined based on REs scheduled on all carriers. For example, N info (i) = N RE,tot * R(i) * Q m (i) * v(i) can be. Here, N RE,tot = N RE (0)+N RE (1)+... N RE It could be (K-1).
[0444] The aforementioned N info It can be derived as follows. For convenience, let us assume that one TB consists of two code blocks, and that the size of each code block is half of a TBS. The first code block can be transmitted on the first carrier, and the second code block can be transmitted on the second carrier. If the first code block is transmitted on the first carrier (index 0), the number of REs required (N RE (0)) is And, if the second code block is transmitted on the second carrier (index 1), the number of REs required (N RE (1)) is It could be. Therefore, is, and this It could be.
[0445] According to the present disclosure, for a terminal, the number of OFDM symbols scheduled per carrier (N symb sh ), number of DMRS REs according to DMRS settings of scheduled data channels (N DMRS PRB ), overhead value (N oh PRB ), Code Rate(R), Modulation Order(Q m At least one value of the number of MIMO layers (v) can be individually set.
[0446] A third method is disclosed in which a terminal determines a TBS corresponding to each carrier based on information of each carrier. Here, the terminal can determine a TBS for each carrier, generate a TB based on the TBS for each carrier, and then map the TB to the corresponding carrier to receive. The third method of the present disclosure may involve scheduling a PDSCH across multiple carriers, but a TB may be generated and mapped for each carrier.
[0447] More specifically, the terminal can determine the number of PRBs scheduled per carrier. For each carrier (carrier i), the terminal determines the number of REs (N') used for data transmission in one PRB within the slot. RE ) and the number of carrier-scheduled PRBs (n PRB,i The number of REs used for data transmission within a slot based on ) (n RE,i ) can be determined. More specifically, It could be. Afterwards, n RE,i Based on this, the TBS of carrier i can be determined according to the TBS determination method.
[0448] The terminal can divide a transmission block corresponding to a TBS on carrier i into one or more code blocks and map said code blocks to time-frequency resources of carrier i. That is, the code blocks can be mapped only within carrier i.
[0449] A method for determining a reference carrier is disclosed below.
[0450] The reference carrier may be the carrier with the lowest index among the scheduled carriers. For example, a terminal may receive a DCI for scheduling a data channel (e.g., PDSCH or PUSCH). The DCI may indicate the carriers that are actually scheduled among the candidate carriers set for scheduling the data channel. If the terminal receives four candidate carriers (indexes 0, 1, 2, and 3) from the base station, these four candidate carriers may be candidate carriers for scheduling the data channel. Through the DCI, the terminal may be indicated the carriers that are actually scheduled among the candidate carriers. For example, among the four candidate carriers (indexes 0, 1, 2, 3), only two carriers (indexes 1, 3) are actually scheduled, and the remaining two candidate carriers (indexes 0, 2) may not have data channels scheduled. According to the present embodiment, the reference carrier may be the carrier with index 1, which is the carrier with the lowest index among the carriers that are actually scheduled.
[0451] The reference carrier can be determined based on the medium frequency resources (number of PRBs) of the scheduled carriers. The terminal can determine the frequency resources (number of PRBs) occupied by the data channel on each of the scheduled carriers through the DCI. For example, if a data channel is scheduled on two carriers, the first carrier has n PRB,1 Can PRBs be scheduled, and on the second carrier, n PRB,2 N PRBs can be scheduled. The terminal is n PRB,1 and n PRB,2 Based on this, one carrier can be determined as the reference carrier. For example, the carrier scheduled with the least frequency resources can be determined as the reference carrier. As another example, the carrier scheduled with the most frequency resources can be determined as the reference carrier.
[0452] The reference carrier may be determined as the carrier in the lowest frequency band among the scheduled carriers. For example, a terminal may receive a DCI that schedules a data channel (e.g., PDSCH or PUSCH). The DCI may indicate the carriers that are actually scheduled among the candidate carriers set for scheduling the data channel. The terminal may determine the frequency bands corresponding to the carriers. For example, the frequency rank (or relative position) among the carriers may be determined based on the center frequency of the carrier, the lowest frequency of the carrier, or the highest frequency of the carrier. Here, the carrier in the lowest frequency rank (lowest frequency band) may be determined as the reference carrier.
[0453] The reference carrier may be the carrier among the scheduled carriers on which the PDCCH was received. The terminal may monitor the PDCCH on one of the multiple carriers. If a data channel is scheduled on the carrier on which the PDCCH was received, the terminal may preferentially determine the carrier as the reference carrier.
[0454] The reference carrier may be a carrier among the scheduled carriers for which PUCCH is configured. The terminal may be configured to transmit uplink control information on one of the multiple carriers. When a data channel is scheduled on the carrier for which PUCCH is configured, the terminal may preferentially determine the carrier as the reference carrier.
[0455] A reference carrier can be determined based on the subcarrier interval among the scheduled carriers. For example, a terminal may receive a DCI that schedules a data channel (e.g., PDSCH or PUSCH). The DCI may indicate the carriers that are actually scheduled among the candidate carriers set for scheduling the data channel. The carriers that are actually scheduled may correspond to specific subcarrier intervals. Based on the subcarrier intervals, a reference carrier can be determined. For example, a carrier with the smallest subcarrier interval may be determined as the reference carrier. For example, a carrier with the highest subcarrier interval may be determined as the reference carrier.
[0456] A reference carrier may be explicitly designated from a base station. For example, a terminal may receive a DCI that schedules a data channel (e.g., PDSCH or PUSCH). The DCI may designate the carriers that are actually scheduled among the candidate carriers set to be scheduled for the data channel. The DCI may designate the index of a reference subcarrier among the carriers that are actually scheduled. For example, if the indices of the two carriers that are actually scheduled are #1 and #3, the DCI may designate one of the indices #1 and #3 as the reference carrier. For example, #1 may be designated as the reference carrier.
[0457] In one method, the indices of the carriers scheduled in the DCI and the reference carrier may be indicated individually. For example, the first field of the DCI may indicate the indices of the carriers scheduled (e.g., {#1, #3}). And, the second field of the DCI may indicate the index of the reference carrier (e.g., {#1}). Accordingly, the terminal may obtain information regarding the indices of the carriers scheduled (e.g., {#1, #3}) through the first field of the DCI, and obtain information regarding the index of the reference carrier (e.g., {#1}) through the second field of the DCI. If the reference carrier indicated by the second field of the DCI is not included among the carriers scheduled in the first field of the DCI, the terminal may determine this as an error case and not transmit or receive the data channel scheduled by the DCI.
[0458] In one method, the indices of the carriers being scheduled and the reference carrier in the DCI may be indicated individually. For example, the first field of the DCI may indicate the indices of the carriers being scheduled (e.g., {#1, #3}). And, the second field of the DCI may indicate the order of the reference carrier among the scheduled carriers. For example, the second field may indicate the first carrier among the scheduled carriers (e.g., {#1, #3}). Thus, {#1}, which is the first carrier among the scheduled carriers (e.g., {#1, #3}), may be determined as the reference carrier. The terminal can obtain information about the indices of scheduled carriers (e.g., {#1, #3}) through the first field of the DCI, and obtain information about the reference carrier index among the indices of scheduled carriers (e.g., {#1} if it is the first carrier, {#3} if it is the second carrier) through the second field of the DCI.
[0459] In one method, the indices of the scheduled carriers and the reference carrier may be indicated together in the DCI. The terminal may receive a table (or list) from the base station, and said table may be set up in upper layer signaling. Each row of the table may contain the indices of the scheduled carriers and the index of the reference carrier. And each row of the table may be assigned a unique index. One field included in the DCI may contain the unique index of the row. The terminal may obtain the unique index of the row through the field of the DCI. And it may obtain the indices of the scheduled carriers and the indices of the reference carriers included in the row corresponding to the unique index.
[0460] Table 18 is an example of the present method. Referring to Table 18, the terminal may receive a table with four rows from the base station. Here, the indices of the scheduled carriers in row 0 may be {#0, #1}, and the index of the reference carrier may be {#0}. The indices of the scheduled carriers in row 1 may be {#0, #1}, and the index of the reference carrier may be {#1}. The indices of the scheduled carriers in row 2 may be {#1, #3}, and the index of the reference carrier may be {#1}. The indices of the scheduled carriers in row 3 may be {#2, #3}, and the index of the reference carrier may be {#3}. If the terminal is instructed to row 2 from the DCI, the scheduled carriers may be #1, #3, and the reference carrier may be #1.
[0461] Row indexScheduled carrier indexesReference carrier index0{#0, #1}{#0}1{#0, #1}{#1}2{#1, #3}{#1}3{#2, #3}{#3}
[0462] [Third Embodiment: Rate-matching and Resource mapping method]
[0463] The terminal can transmit data channels simultaneously on multiple carriers. In the second embodiment described above, the terminal can determine a TBS. Accordingly, the terminal can generate a transmission block (TB) based on the TBS, divide the transmission block into multiple code blocks, encode the code blocks using channel coding, and map the encoded bits to scheduled PRBs (PRBs determined in the first embodiment) of the scheduled carriers and transmit them.
[0464] In the third embodiment of the present disclosure, a method for mapping encoded bits to scheduled PRBs of scheduled carriers is disclosed. The number of scheduled carriers may be greater than one. For convenience of description, the description is based on two scheduled carriers, but the present disclosure is not limited to this example. A transmission block transmitted by a single data channel may include one or more code blocks. For convenience of description, the transmission block is based on three code blocks, but the present disclosure is not limited to this example.
[0465] <Method 1: Resource determination and bit mapping for each carrier>
[0466] In the first method of the present disclosure, a terminal can determine the number of bits capable of transmission block mapping for each of a plurality of scheduled carriers. The number of bits capable of transmission block mapping in a carrier of index i can be represented as G(i). For example, the number of bits capable of transmission block mapping in a carrier of index i can be determined based on the number of resources capable of transmission block mapping (e.g., the number of REs among scheduled REs excluding those used for reference signals (DMRS or PTRS) and those that cannot be transmitted block mapped), the modulation order of the data channel, and the number of MIMO layers.
[0467] If the transmission block contains C code blocks, the terminal can divide the number of bits G(i) that can be mapped to the transmission block of the carrier with index i into each code block. More specifically, the number of bits E assigned to code block r in the carrier with index i r (i) can be as follows.
[0468] or
[0469] Here, N L (i), Q m (i) can be the number of MIMO layers and the modulation order on the carrier wave of index i. And E0(i)+E1(i)+... +E C-1 (i) = G(i) can be.
[0470] The terminal can map code blocks to a carrier with index i. On the carrier with index i, code block r is E r It can be mapped to (i) bits. Among the bits after code block r is channel-coded, E r (i) Methods for determining bits are disclosed. Bits after a code block r is channel-coded may be stored in a circular buffer of a terminal. The terminal E in the circular buffer r (i) The index of the start bit of the bits must be determined. The terminal E from the above index in the circular buffer r (i) bits can be mapped to a carrier wave of index i.
[0471] <RV 값 기반 주파수 반복>
[0472] In one method, the terminal may be instructed by the base station to apply a redundancy version (RV) value to each scheduled carrier. Each RV value may be one of, for example, 0, 1, 2, or 3. The terminal may determine a start index corresponding to said value in a circular buffer. The terminal or the base station may determine E from said start index in the circular buffer. r (i) bits can be mapped to a carrier wave of index i.
[0473] According to the present method, the terminal can determine an RV value corresponding to each carrier wave, and bits mapped in the carrier wave can be determined based on the RV value.
[0474] For example, when a terminal receives or transmits a data channel on two carriers, it may receive a first RV value corresponding to the first carrier (index 0) and a second RV value corresponding to the second carrier (index 1) from a base station. To map code block r on the first carrier (index 0), the terminal uses E of code block r. r (0) bits must be determined. This is E from the starting position corresponding to the first RV value in the circular buffer corresponding to code block r. r (0) bits may be used. The terminal maps code block r to the second carrier (index 1) using E of code block r. r (1) bits must be determined. This is E from the starting position corresponding to the second RV value in the circular buffer corresponding to code block r. r (1) It can be bits.
[0475] In the method described above, the terminal may receive a DCI from a base station that schedules a data channel on a plurality of scheduling carriers. The DCI may include RV values corresponding to each of the scheduled carriers. For example, if the number of carriers scheduled by the DCI is N (indices are I(0), I(1), ..., I(N-1)), the DCI may include a field indicating each of the N RV values. For example, the number of RV values that can be indicated for a carrier with index i is N rv (i) If so, the number of bits for indicating the RV value of the carrier i is B(i) = ceil(log2(N rv (i))) It may be. Therefore, the terminal is DCI's B(I(0))+ B(I(1))+...+ B(I(N-1)) = ceil(log2(N rv (I(0))))+ ceil(log2(N rv (I(1))))+ ...+ceil(log2(N rv The RV values of N carrier waves scheduled based on (I(N-1)))) bits can be received.
[0476] N, the number of RV values that can be indicated on the carrier wave of index i. rv (i) can be configured per carrier. That is, the terminal receives N from the base station rv (i) can be set. Alternatively, the number of bits B(i) corresponding to the RV value that can be indicated on the carrier wave with index i can be set per carrier wave. That is, the terminal can receive B(i) from the base station. And the RV values used can be determined according to the value of the set B(i).
[0477] In the method described above, the terminal may be instructed by the DCI to have different numbers and combinations of carriers to be scheduled. For example, the DCI may schedule a data channel to a first set of carriers to be scheduled (e.g., carriers 0 and 1). For example, the DCI may schedule a data channel to a second set of carriers to be scheduled (e.g., carriers 1, 2, and 3). Thus, the number or combination of carriers in the first set and the second set of carriers to be scheduled by the DCI may be different. When the first set is scheduled, the number of bits to indicate the RV value for the carrier(s) to be scheduled is B(0) + B(1), but when the second set is scheduled, the number of bits to indicate the RV value for the carrier(s) to be scheduled may be B(1) + B(2) + B(3). Therefore, the number of bits required to indicate each RV value within the DCI may vary. This affects the length of the DCI and can cause complexity for the terminal receiving the DCI. To address this, the number of bits indicating the RV values of each scheduled carrier within the DCI (hereinafter the length of the RV field) can be determined as follows.
[0478] In one method, the length of the RV field may be determined based on the maximum value among the number of RV values of all scheduled carriers that the DCI can indicate and the number of scheduled carriers. More specifically, the terminal has N RV values of the first carrier (index 0) and the number of corresponding bits. rv (0), B(0), and the number of RV values of the second carrier (index 1) and the number of corresponding bits are N rv (1), if B(1), then the maximum value is N rv,max =max{N rv (0), N rv (1)} to B max=max{B(0), B(1)} can be determined. In addition, the terminal can determine the maximum number of carriers (N) that can be scheduled. c,max ...can determine ). For example, if the DCI can schedule a data channel to a first set of scheduled carriers (e.g., carriers 0, 1) and can schedule a data channel to a second set of scheduled carriers (e.g., carriers 1, 2, 3), the maximum number of carriers that can be scheduled may be 3. The terminal is N rv,max , B max , or N c,max The length of the RV field can be determined based on . More specifically, the length of the RV field is ceil(log2(N rv,max ))*N c,max or B max *N c,max It could be.
[0479] Length B max *N c,max The RV field may contain RV values of scheduled carriers. Here, B corresponding to the scheduled carrier within the RV field max can be determined by the following method. In one method, B max *N c,max The RV fields are N c,max Dog B max It can be distinguished by bits, and the first B max bits correspond to the carrier with the lowest index, and the second B max bits can correspond to the carrier with the second lowest index. That is, they can be sorted in ascending order of the carrier indices. Here, the carriers can be scheduled carriers. That is, if the scheduled carriers are {1, 2, 3} (where the total carriers are {0, 1, 2, 3}), B corresponding to carrier 1 max bits is the first B max bits, and B corresponding to carrier 2 max bits is the second Bmax It is bits, and B corresponding to carrier 3. max bits is the third B max It can be bits. The remaining bits can be 0.
[0480] In one method, the length of the RV field may be determined based on the maximum value among the number of RV values of all scheduled carriers that the DCI can indicate and the number of configured carriers. More specifically, the terminal has N RV values of the first carrier (index 0) and the number of corresponding bits. rv (0), B(0), and the number of RV values of the second carrier (index 1) and the number of corresponding bits are N rv (1), if B(1), then the maximum value is N rv,max =max{N rv (0), N rv (1)} to B max =max{B(0), B(1)} can be determined. In addition, the terminal can determine the maximum number of set carriers (N conf,max It can determine ). The configured carriers refer to all carriers that the DCI can schedule. If the DCI can schedule a carrier with an index of 0 or 1, and can schedule a carrier with an index of 2 or 3, then the configured carriers are {0, 1, 2, 3}, and the terminal is the maximum number of configured carriers (N conf,max ) can be determined as 4. The terminal is N rv,max , B max , or N conf,max The length of the RV field can be determined based on . More specifically, the length of the RV field is ceil(log2(N rv,max ))*N conf,max or B max *N conf,max It could be.
[0481] In one method, the RV field may include bits indicating the RV value of each of all configured carriers. A configured carrier refers to all carriers that the DCI can schedule, and if the DCI can schedule a carrier with index 0 or 1, and can schedule a carrier with index 2 or 3, the configured carriers are {0, 1, 2, 3}. The RV field may include bits indicating the RV value of each of the configured carriers. That is, the RV field may include B(0) bits to indicate the RV value of a carrier with index 0, B(1) bits to indicate the RV value of a carrier with index 1, B(2) bits to indicate the RV value of a carrier with index 2, and B(3) bits to indicate the RV value of a carrier with index 3. That is, the length of the RV field is B(0)+B(1)+B(2)+B(3), and RV values can be included according to the ascending order of the carrier wave indices.
[0482] Here, carriers 0, 1, 2, and 3 may be indices of all carriers that DCI can schedule (or indices assigned in ascending order of carrier indices). For example, when a data channel is scheduled from a base station to carriers with indices 1 and 3, the terminal can obtain the RV value of the carrier with index 1 from B(1) bits in the RV field (B(1) bits after MSB B(0) in the RV field) and obtain the RV value of the carrier with index 3 from B(3) bits in the RV field (B(3) bits after MSB B(0)+B(1)+B(2) in the RV field).
[0483] In one way, the length of the RV field can be determined based on the largest value among the number of bits of RV values corresponding to all sets of scheduled carriers that the DCI can indicate. For example, if the number of bits to indicate the RV value is B(0)+B(1) when the first set is scheduled, and the number of bits to indicate the RV value is B(1)+B(2)+B(3) when the second set is scheduled, then the length of the RV field is B tot =max{B(0)+ B(1), B(1)+ B(2)+B(3)} can be. If the DCI indicates the first set, the terminal is B of the RV field. tot Scheduled carrier 0 and 1 RV values can be obtained respectively from the B(0)+ B(1) bits among the bits. At this time, B of the RV field tot - (B(0)+B(1)) bits can be set to 0. If the DCI indicates the second set, the terminal is B of the RV field. tot The RV values of scheduled carriers 1, 2, and 3 can be obtained respectively from the B(1)+B(2)+B(3) bits among the bits. At this time, B of the RV field tot - (B(1)+B(2)+B(3)) bits can be set to 0.
[0484] If DCI indicates the first set, B of the RV field tot The method for determining the B(0)+ B(1) bits among the bits is as follows. One method is the B of the RV field. tot Among the bits, B(0)+B(1) bits starting from the MSB (most significant bit) can be used. Alternatively, B of the RV field tot Among the bits, B(0)+ B(1) bits can be used starting from the LSB (least significant bit).
[0485] Among the selected B(0)+B(1) bits, the preceding B(0) bits indicate the RV value of the subcarrier with index 0, and the succeeding B(1) bits indicate the RV value of the subcarrier with index 1. That is, the B(0)+B(1) bits can indicate the RV value in ascending order of the carrier index. Alternatively, among the B(0)+B(1) bits, the succeeding B(0) bits indicate the RV value of the subcarrier with index 0, and the preceding B(1) bits indicate the RV value of the subcarrier with index 1. That is, the B(0)+B(1) bits can indicate the RV value in descending order of the carrier index.
[0486] In the example described above, two carrier waves were used, but this is not limited to them.
[0487] Alternatively, the terminal may obtain a first value from the DCI and determine an RV value to be applied to each carrier based on the first value. More specifically, an RV sequence may correspond to the first value. For example, the first RV sequence may be {0,0,0,0}, the second RV sequence may be {0, 3, 0, 3}, the third RV sequence may be {0, 2, 3,1}, etc. This is an example and is not limited thereto. In general expression, an RV sequence of length R may be {rv(0), rv(1), rv(2), rv(3), ..., rv(R-1)}. Here, R may be 4. Here, rv(i) may be one of the values 0, 1, 2, or 3. Here, the RV sequence may be set by the base station to the terminal. The number of set RV sequences may be one or multiple, and if there are multiple, the terminal may be instructed to receive one RV sequence from the DCI. The above RV sequence can be set as upper-layer signaling.
[0488] The terminal may receive a set of RV sequences and receive instructions from the DCI for the order of scheduling the RV sequences to carriers. For example, the DCI may instruct a circular shift of the RV sequence. That is, let Q be the value obtained from the DCI, and if the set RV sequence is {rv(0), rv(1), rv(2), rv(3), ..., rv(R-1)}, the circularly shifted RV sequence may be {rv((0+Q) mod R), rv((1+Q) mod R), rv((2+Q) mod R), rv((3+Q) mod R), ..., rv(mod(R-1+Q) mod R)} or {rv((0-Q) mod R), rv((1-Q) mod R), rv((2-Q) mod R), rv((3-Q) mod R), ..., rv(mod(R-1-Q) mod R)}. And Q can be 0, 1, ..., R-1. The terminal can obtain the RV value of each carrier by associating the RV values of the cyclically shifted RV sequence with each carrier.
[0489] If the RV sequence or the circularly shifted RV sequence assigned to the terminal is {rv(0), rv(1), rv(2), rv(3), ..., rv(R-1)}, the RV value of each RV sequence may correspond to each carrier. For example, rv(0) may correspond to the carrier with the lowest index among the scheduled carriers, and rv(1) may correspond to the carrier with the second lowest index among the scheduled carriers. That is, the nth RV value (rv(n-1)) of the RV sequence may be applied to the nth scheduled carrier. If the number of scheduled carriers (N c If ) is longer than the length of the RV sequence, (i.e., N c > R), the (n-1) mod R +1th RV value (= rv((n-1) mod R)) can be applied to the nth scheduled carrier.
[0490] FIG. 17 is a diagram illustrating an example of resource determination and code block mapping of a plurality of carriers according to the present disclosure.
[0491] Referring to FIG. 17, a transmission block containing three code blocks on two carriers can be scheduled for the terminal. The terminal can determine an RV value corresponding to each carrier. For example, the first carrier (1700) may be associated with an RV value of 0, and the second carrier (1710) may be associated with an RV value of 2. Accordingly, the first carrier (1700) may be mapped to E0 (0) bits from the index (S0) of the start bit corresponding to RV0 in the circular buffer. Here, the E0 (0) bits may be mapped to the first carrier (1700) in a time-first, frequency-later method. The second carrier (1710) may be mapped to E0 (1) bits from the index (S2) of the start bit corresponding to RV2 in the circular buffer. Here, E0 (1) bits can be mapped in a time-first, frequency-later manner on the second carrier (1710).
[0492] Continuous Frequency Mapping (Carrier-First Mapping)
[0493] In one method, the terminal may be instructed by the base station to apply an RV value to one of the scheduled carriers (e.g., the carrier with the lowest index). Each RV value may be one of 0, 1, 2, 3. For convenience, the indices of the scheduled carriers are 0, 1, ..., N c Let's assume it is -1. The terminal can determine a starting index (S(0)) corresponding to the above value in the circular buffer. The terminal can determine E from the starting index (S(0)) in the circular buffer. r (0) bits can be mapped to a carrier wave with index 0. And the above start index (S(0)) and E rBased on (0), the starting index (S(1)) of Carrier 1, which is the next carrier (the carrier with the second highest index) in the circular buffer, can be determined. Then, the terminal can determine E from the starting index (S(1)) in the circular buffer. r (1) bits can be mapped to a carrier wave with index 1. For example, the starting index of carrier 1 in a circular buffer is S(1) = S(0) + E r (0) may be. Or the starting index of carrier 1 of the circular buffer, S(1), is S(0) + E r It can be determined based on (0). This can be applied in ascending order of the carrier index. That is, the starting index of carrier n of the circular buffer is S(n) = S(n-1) + E r It can be (n-1).
[0494] FIG. 18 is a drawing illustrating another example of resource determination and code block mapping of a plurality of carriers according to the present disclosure.
[0495] Referring to FIG. 18, the terminal may schedule a transmission block containing three code blocks on two carriers. The terminal may determine an RV value corresponding to one carrier (the first carrier as the reference carrier). For example, 0 may be corresponded to the RV value of the first carrier (1800). Accordingly, E0 (0) bits from the index of the start bit (S(0)) corresponding to RV0 in the circular buffer may be mapped to the first carrier (1800). Here, the E0 (0) bits may be mapped in the first carrier (1800) in a time-first, frequency-later manner. E0 (1) bits from the index of the start bit corresponding to S(0)+E0(0) in the circular buffer may be mapped to the second carrier (1810). Here, E0 (1) bits can be mapped in a time-first, frequency-later manner on the second carrier (1810).
[0496] Continuous Frequency Mapping (Frequency-First Mapping)
[0497] In one method, the terminal may be instructed to receive an RV value from the base station. Each RV value may be one of, for example, 0, 1, 2, or 3. The terminal may determine a start index (S) corresponding to the value in a circular buffer. The indices of the scheduled carriers are 0, 1, ..., N c Let's assume -1. The terminal is E from the start index (S) in the circular buffer. r,tot = E r (0)+ E r (1)+ ... E r (N c -1) bits can be determined.
[0498] The terminal is E for each carrier r (i) bits can determine the resources to be mapped. Resources can first be determined on the frequency axis of a single OFDM symbol on carrier i, where resources can be determined in ascending order of frequency. If, for a single OFDM symbol, E r (i) After determining resources for bits and mapping them to one OFDM symbol, if there are remaining bits, resources for the remaining bits can be determined in the next OFDM symbol. E on carrier i r (i) A set of resources of bits W r Let (i). For all carriers, E r,tot = E r (0)+ E r (1)+ ... E r (N c -1) The set of resources is W r,tot = W r (0)∪W r (1)∪ ...W r (N c -1) It can be. Here, resources can represent REs.
[0499] The terminal is E r,tot bits resource set W r,tot It can be mapped to. E r,totbits is a resource set W r,tot The first OFDM symbol of can be mapped to REs in ascending order along the frequency axis. And resource set W r,tot The remaining bits are mapped to the first OFDM symbol of and resource set W r,tot In the next OFDM symbol of, it can be mapped to REs in ascending order of the frequency axis. The above process is E r,tot bits resource set W r,tot It can continue until all are mapped to.
[0500] Although not separately mentioned in the example above, code blocks with lower indices can be mapped before code blocks with higher indices.
[0501] FIG. 19 is a drawing illustrating another example of resource determination and code block mapping of a plurality of carriers according to the present disclosure.
[0502] Referring to FIG. 19, the terminal may schedule a transmission block containing three code blocks on two carriers. The terminal may determine an RV value corresponding to one carrier (the first carrier as the reference carrier). For example, 0 may correspond to the RV value of the first carrier (1900). Accordingly, the terminal may determine E0(0) + E0(1) bits from the index (S(0)) of the start bit corresponding to RV0 in the circular buffer. Then, the terminal may determine a resource W0(0) for the E0(0) bits in the first carrier (1900) and determine a resource W0(1) for the E0(1) bits in the second carrier (1910). The terminal W the determined E0(0) + E0(1) bits 0,tot It can be mapped to =W0(0)∪W0(1). Here, it can be mapped according to the frequency-first, time-later method.
[0503] <Method 2: Resource determination and bit mapping for all carriers>
[0504] In the second method of the present disclosure, the terminal has E of code block r in resources of scheduled carriers. r It is possible to map bits of bits. In this case, E r Bits can be mapped to all scheduled carriers in ascending order along the frequency axis of the first OFDM symbol. The bits remaining after mapping to the first OFDM symbol can be mapped to the next OFDM symbol in ascending order along the frequency axis. The above process is E r,tot This process may continue until all bits are mapped. Here, the carrier index is ignored, and bits can be mapped in ascending order of the frequencies of the REs within the carrier.
[0505] Alternatively, the carrier index can be considered. That is, bit mapping can be performed preferentially on carriers with lower indices. Within the carrier, bits can be mapped in ascending order along the frequency axis. That is, E r Bits can be mapped in ascending order along the frequency axis from the first OFDM symbol for the carrier with the lowest index. The bits remaining after mapping to the first OFDM symbol of the carrier with the lowest index can be mapped in ascending order along the frequency axis from the first OFDM symbol of the carrier with the second lowest index. The above process can continue in ascending order of the carrier indices. The bits remaining after mapping to the first OFDM symbol can be mapped to the next OFDM symbol. The above process is E r,tot It can continue until all bits are mapped.
[0506] The terminal can determine the number of bits of code block r as follows. Below, G(i) corresponds to the number of bits that can be mapped to a transmission block on a carrier with index i.
[0507] or
[0508] Here, is N L (0)*Q m(0), N L (1)*Q m (1), ... N L (N c -1)*Q m (N c -1) can be the least common multiple. That is, the terminal can use the number of bits (G(0)+G(1)+.. +G(N)) for data channel transmission on all carriers. c -1)) can be divided into C code blocks. Here, the number of bits available for data channel transmission on all carriers during division is It can be divided into units. In other words, a single code block is It can be a multiple of.
[0509] According to the present disclosure, the unit when divided is can be used. This means that different carriers have different numbers of MIMO layers (N L (i)) or modulation order (Q m When using (i), bits corresponding to a single RE can be made to correspond to only one code block. For reference, a single RE of carrier i is N L (i)*Q m (i) bits may be included. For example, the first carrier (index 0) is N L (0)*Q m Let (0)=4, and the second carrier (index 1) is N L (1)*Q m Let (1)=6. If rate matching is performed based on one of the two values, it may be as follows. For example, N of the first carrier (index 0). L (0)*Q m When rate matching is performed based on the value (0)=4, the number of bits (E) occupied by code block r r ) is as follows.
[0510] or
[0511] The above Er The value is N L (0)*Q m (0) is a multiple of 4. Therefore, in the first carrier (index 0), 4 bits are mapped to 1 RE, so the length of the code block can be an integer multiple of the number of REs. However, in the second carrier (index 1), 6 bits are mapped to 1 RE, so the length of the code block is not an integer multiple of the number of REs. That is, only some of the 6 bits corresponding to one RE can be mapped to code block r.
[0512] According to an embodiment of the present disclosure, the first carrier wave (index 0) is N L (0)*Q m Let (0)=4, and the second carrier (index 1) is N L (1)*Q m If (1)=6, rate matching can be performed based on the least common multiple of the two values. That is, When rate matching based on the value =12, the number of bits (E) occupied by code block r r ) is as follows.
[0513] or
[0514] The above E r The value = is a multiple of 12. Therefore, since 4 bits are mapped to 1 RE in the first carrier (index 0), the length of the code block (a multiple of 12) can be an integer multiple of the number of REs. Also, since 6 bits are mapped to 1 RE in the second carrier (index 1), the length of the code block (a multiple of 12) can be an integer multiple of the number of REs.
[0515] According to the example described above, in the method of the present disclosure, the length E of code block r r It can satisfy the condition that each RE of the scheduled carrier is an integer multiple of the number of bits contained therein.
[0516] FIG. 20 is a drawing illustrating another example of resource determination and code block mapping of a plurality of carriers according to the present disclosure.
[0517] According to FIG. 20, a terminal may schedule a transmission block containing three code blocks on two carriers. The terminal may determine an RV value corresponding to one carrier (the first carrier as the reference carrier). For example, 0 may correspond to the RV value for the first carrier (2000). The terminal determines the number of bits E to which code block r is mapped. r The terminal can determine the E0(0)+ E0(1) bits (=E from the index (S(0)) of the start bit corresponding to RV0 in the circular buffer. 0,tot bits) can be determined. And, E on the first carrier wave (2000) and the second carrier wave (2010). 0,tot Bits can be mapped. Here, they can be mapped across two carriers according to a frequency-first, time-later method.
[0518] FIG. 21a is a diagram illustrating an example of the operation of a base station performing transmission of a downlink data channel based on at least one embodiment of the present disclosure.
[0519] According to FIG. 21a, a base station transmits configuration information to a terminal for scheduling a data channel on one or more carriers (or multiple carriers) (2100). The transmission of the configuration information may be performed by upper layer signaling. The configuration information may include at least one of the configuration information described in the first to third embodiments, and, for example, may include configuration information for multiple carriers capable of scheduling a single data channel, parameters required for transmitting and receiving data channels applied to each carrier, etc. For specific details, refer to at least one of the first to third embodiments described above.
[0520] Subsequently, the base station transmits scheduling information to the terminal (2110). The scheduling information may be a DCI, and the scheduling information may include data channel scheduling information for one or more carriers. The scheduling information may include at least one of the information included in the DCI described in the first to third embodiments, and for specific details, one may refer to at least one of the first to third embodiments described above.
[0521] The base station maps a transmission block to be transmitted to a terminal to one or more carriers (2120). The base station sets the configuration information and scheduling information according to the transmission block mapping according to the base station's scheduling and transmits them to the terminal so that the terminal receiving the configuration information and scheduling information can identify the transmission block based on the configuration information and scheduling information. At this time, the base station maps the transmission block using at least one of the first to third embodiments. Subsequently, the base station transmits the transmission block (or downlink data) to the terminal over one or more carriers via a data channel (2130).
[0522] An example such as FIG. 21a illustrates an exemplary method that can be implemented according to the principles of the present disclosure, and various modifications may be made to said example. For example, a series of operations may overlap, occur in parallel, occur in a different order, or occur multiple times. In other examples, each operation may be omitted or replaced with another operation.
[0523] FIG. 21b is a diagram illustrating an example of the operation of a terminal performing reception of a downlink data channel based on at least one embodiment of the present disclosure.
[0524] According to FIG. 21b, a terminal receives configuration information from a base station for scheduling a data channel on one or more carriers (or multiple carriers) (2150). The reception of the configuration information may be performed by upper layer signaling. The configuration information may include at least one of the configuration information described in the first to third embodiments, and, for example, may include configuration information for multiple carriers capable of scheduling a single data channel, parameters required for transmitting and receiving data channels applied to each carrier, etc. For specific details, refer to at least one of the first to third embodiments described above.
[0525] Subsequently, the terminal receives scheduling information from the base station (2160). The scheduling information may be a DCI, and the scheduling information may include data channel scheduling information for one or more carriers. The scheduling information may include at least one of the information included in the DCI described in the first to third embodiments, and for specific details, one may refer to at least one of the first to third embodiments described above.
[0526] The terminal receives a transmission block (or downlink data) on one or more carriers from a base station on a data channel (2170). The terminal checks the transmission block transmitted by the base station based on the received data channel (2180). At this time, the terminal checks the transmission block based on at least one method of the first to third embodiments based on the setting information and the scheduling information.
[0527] An example such as FIG. 21b illustrates an exemplary method that can be implemented according to the principles of the present disclosure, and various modifications may be made to said example. For example, a series of operations may overlap, occur in parallel, occur in a different order, or occur multiple times. In other examples, each operation may be omitted or replaced with another operation.
[0528] 22a is a drawing illustrating an example of the operation of a base station performing reception of an uplink data channel based on at least one embodiment of the present disclosure.
[0529] According to FIG. 22a, a base station transmits configuration information to a terminal for scheduling a data channel on one or more carriers (or multiple carriers) (2200). The transmission of the configuration information may be performed by upper layer signaling. The configuration information may include at least one of the configuration information described in the first to third embodiments, and, for example, may include configuration information for multiple carriers capable of scheduling a single data channel, parameters required for transmitting and receiving data channels applied to each carrier, etc. For specific details, refer to at least one of the first to third embodiments described above.
[0530] Subsequently, the base station transmits scheduling information to the terminal (2210). The scheduling information may be DCI, and the scheduling information may include data channel scheduling information for one or more carriers. The scheduling information may include at least one of the information included in the DCI described in the first to third embodiments, and specific details may be referenced to at least one of the first to third embodiments described above. At this time, the base station sets the setting information and scheduling information according to the transmission block mapping based on the base station's scheduling and transmits them to the terminal so that the terminal receiving the setting information and scheduling information can transmit a transmission block based on the setting information and scheduling information.
[0531] A base station receives a transmission block (or uplink data) on one or more carriers from a terminal on a data channel (2220). The base station identifies a transmission block transmitted by the terminal based on the received data channel (2230). At this time, the base station identifies the transmission block based on at least one method of the first to third embodiments.
[0532] An example such as FIG. 22a illustrates an exemplary method that can be implemented according to the principles of the present disclosure, and various modifications may be made to said example. For example, a series of operations may overlap, occur in parallel, occur in a different order, or occur multiple times. In other examples, each operation may be omitted or replaced with another operation.
[0533] FIG. 22b is a diagram illustrating an example of the operation of a terminal performing transmission of an uplink data channel based on at least one embodiment of the present disclosure.
[0534] According to FIG. 22b, a terminal receives configuration information from a base station for scheduling a data channel on one or more carriers (or multiple carriers) (2250). The reception of the configuration information may be performed by upper layer signaling. The configuration information may include at least one of the configuration information described in the first to third embodiments, and, for example, may include configuration information for multiple carriers capable of scheduling a single data channel, parameters required for transmitting and receiving data channels applied to each carrier, etc. For specific details, refer to at least one of the first to third embodiments described above.
[0535] Subsequently, the terminal receives scheduling information from the base station (2160). The scheduling information may be a DCI, and the scheduling information may include data channel scheduling information for one or more carriers. The scheduling information may include at least one of the information included in the DCI described in the first to third embodiments, and for specific details, one may refer to at least one of the first to third embodiments described above.
[0536] The terminal maps a transmission block to one or more carriers (2270). At this time, the mapping of the transmission block may be performed using at least one method of the first to third embodiments based on the received configuration information and scheduling information. Subsequently, the terminal transmits the transmission block (or uplink data) over one or more carriers to the base station over a data channel (2270).
[0537] An example such as FIG. 22b illustrates an exemplary method that can be implemented according to the principles of the present disclosure, and various modifications may be made to said example. For example, a series of operations may overlap, occur in parallel, occur in a different order, or occur multiple times. In other examples, each operation may be omitted or replaced with another operation.
[0538] FIG. 23 is a block diagram of a terminal or user equipment (2300) according to one embodiment of the present disclosure.
[0539] The terminal (2300) is an electronic device capable of wireless communication and may include user equipment (UE), mobile phones, smartphones, tablets, Internet of Things (IoT) devices having various form factors, and can perform wireless communication with a base station through a wireless channel.
[0540] Referring to FIG. 23, the terminal (2300) may include at least one transceiver (2301) (hereinafter, transceiver), at least one processor (2302) (hereinafter, processor), and at least one memory (2303) (hereinafter, memory). The transceiver (2301), processor (2302), and memory (2303) of the terminal (2300) may be operated according to at least one or a combination thereof of the methods corresponding to the embodiments of the present disclosure. However, the components of the terminal (2300) are not limited to the examples of components shown in FIG. 23. In other embodiments, the terminal (2300) may include additional components in addition to the aforementioned components, or some components may be omitted. Also, in some embodiments, any combination of the transceiver (2301), processor (2302), or memory (2303) may be integrated into a single component.
[0541] The transceiver (2301) may be a basic communication circuit or communication circuitry that enables the terminal (2300) to perform wireless communication with a node or entity of a network. For example, the transceiver (2301) may enable the terminal (2300) to transmit and receive signals to and from a base station via cellular wireless communication, or to transmit and receive signals to and from another terminal via cellular wireless communication. For example, the transceiver (2301) may be 3G (3rd generation), 4G (4th generation), LTE (long-term evolution), 5G (5th generation), NR (new radio), 6G (6th It can support at least one of various cellular wireless communication technologies including (generation), and the various cellular wireless communication technologies supported by the transceiver (2301) may include all subsequent evolved generations of wireless communication.
[0542] According to one embodiment, the terminal (2300) may include a plurality of transceivers, and for example, when supporting EN-DC (E-UTRA (evolved-universal terrestrial radio access) - NR dual connectivity), it may include a first transceiver supporting 4G LTE wireless communication and a second transceiver supporting 5G NR wireless communication. According to another embodiment, when the terminal (2300) supports NR-DC (NR Dual Connectivity), the terminal (2300) may include a plurality of transceivers supporting 5G NR wireless communication. According to another embodiment, if the terminal (2300) supports short-range wireless communication, the terminal (2300) may separately include a transceiver that supports at least one of a group of wireless communication protocol standards such as those defined by Bluetooth®, wireless LAN or WLAN (wireless local area network) network (including, but not limited to, 802.11ah, 802.11ad, 802.11ay, 802.11ax, 802.11az, 802.11ba and 802.11be).
[0543] According to one embodiment, the transceiver (2301) may include various circuit structures used to transmit and receive signals to and from a base station via a wireless channel. The signals may include control information and data. For example, the transceiver (2301) may be configured to include a radio frequency (RF) transmitter that up-converts and amplifies the frequency of a transmitted signal, and an RF receiver that low-noise amplifies a received signal and down-converts the frequency. The transceiver (2301) may output the signal received via the wireless channel to a processor (2302) and transmit the signal output from the processor (2302) via the wireless channel.
[0544] The processor (2302) can control the overall operation of the terminal (2300) according to an embodiment of the present disclosure. The processor (2302) may be implemented as one or more IC (integrated circuit (or circuitry)) chips and may perform various data processing operations. The processor (2302) may include at least one electrical circuit and may execute instructions (or programs, code, data, etc.) stored in memory (2303) individually, collectively, or in any combination. Additionally, the processor (2302) may include a single-core processor or a multi-core processor, and in a specific implementation, may be composed of a processor assembly including a plurality of processing circuits.
[0545] The processor (2302) is electrically, operatively, or communicatively coupled to the transceiver (2301) so as to control the transceiver (2301).
[0546] The processor (2302) may include at least one processor (or, processing circuitry), and at least one processor may perform the following operations individually, collectively, or in any combination. For example, the processor (2302) may include a communication processor (CP) that controls communication operations and an application processor (AP) that controls the execution of an upper layer (e.g., an application layer). In a specific embodiment, at least one part of the processor (2302) may be included in one chip, and another part of the processor (2302) may be included in a separate chip. Alternatively, at least one processor may be included in other components, e.g., a transceiver (2301) or a memory (2303).
[0547] The processor (2302) may perform, cause, or control the operation of a terminal to perform at least one or a combination of the methods according to the embodiments of the present disclosure. For example, the processor (2302) may control the operation of a terminal to process a downlink signal received from a base station or to generate an uplink signal and transmit it to a base station. To this end, the processor (2302) may control other components of the terminal (2300) to perform various operations by executing computer programs, code, or instructions stored in memory (2303).
[0548] Memory (2303) is a hardware storage device capable of storing information temporarily or permanently and may include one or more storage media. For example, memory (2303) may include a memory assembly comprising one or more storage media. For example, the one or more storage media may include a hard drive, flash memory, permanent memory such as ROM (read-only memory), semipermanent memory such as RAM (random access memory), cache memory, or any combination thereof.
[0549] The memory (2303) can be electrically, operatively, or communically coupled with the processor (2302) and can be accessed by the processor (2302).
[0550] A computer program, code, or instruction that can be executed by a processor (2302) may be stored in the memory (2303). According to one embodiment, the computer program, code, or instruction that can be executed by the processor (2302) may be stored in a single memory device or may be separated and distributed across two or more memory devices. The processor (2302) may perform various functions according to the embodiments of the present disclosure by executing the instruction stored in the memory (2303).
[0551] According to one embodiment of the present disclosure, the operation of the terminal (2300) may be caused to be performed based on at least one processor (or processing circuit) configured to perform the features of the present disclosure individually, collectively, or in any combination based on the execution of instructions (or computer program or code) stored in memory (2303), based on processing circuitry not configured to execute instructions, and / or based on components of a processing circuitry not configured to execute instructions.
[0552] FIG. 24 is a block diagram of a base station (2400) according to one embodiment of the present disclosure.
[0553] The base station (2400) can perform wireless communication with at least one terminal within the area of the base station (2400) through a wireless channel.
[0554] Referring to FIG. 24, a base station (2400) may include at least one transceiver (2401) (hereinafter, transceiver), at least one processor (2402) (hereinafter, processor), and at least one memory (2403) (hereinafter, memory). According to at least one or a combination thereof of methods corresponding to embodiments of the present disclosure, the transceiver (2401), processor (2402), and memory (2403) of the base station (2400) may be operated. However, the components of the base station (2400) are not limited to the examples of components shown in FIG. 24. In other embodiments, the base station (2400) may include additional components in addition to the aforementioned components, or some components may be omitted. Also, in some embodiments, any combination of the transceiver (2401), processor (2402), or memory (2403) may be integrated into a single component.
[0555] The transceiver (2401) may be a communication circuit or communication circuitry that enables the base station (2400) to perform wireless communication with a node or entity of the network. For example, the transceiver (2401) may enable the base station (2400) to transmit and receive signals to and from a terminal (2300) via cellular wireless communication, or to transmit and receive signals to and from another network entity via wireless communication. For example, the transceiver (2401) may be 3G (3rd generation), 4G (4th generation) LTE (long-term evolution), 5G (5th generation) NR (new radio), 6G (6th generation) Various cellular wireless communication technologies, including (generation), etc., can be supported, and the various cellular wireless communication technologies supported by the transceiver (2401) may include all subsequent evolved generations of wireless communication. According to one embodiment, the transceiver (2401) may include various circuit structures used to transmit and receive signals to and from a terminal via a wireless channel. The signals may include control information and data. For example, the transceiver (2401) may be configured to include an RF (radio frequency) transmitter that up-converts and amplifies the frequency of a transmitted signal, and an RF receiver that low-noise amplifies a received signal and down-converts the frequency. The transceiver (2401) may output the signal received via the wireless channel to a processor (2402) and transmit the signal output from the processor (2402) via the wireless channel.
[0556] Meanwhile, according to one embodiment of the present disclosure, a base station (2400) may communicate with an entity or node of a network via wired or wireless communication. For example, the base station (2400) may communicate via wired or wireless communication with an entity or node of an adjacent base station or core network via a backhaul network. Although not shown in the drawings, when the base station (2400) performs wired communication, the base station (2400) may include a separate network interface for wired communication in addition to the transceiver (2401). The network interface may be referred to as network interface circuitry, communication interface circuitry, etc.
[0557] The processor (2402) can control the overall operation of the base station (2400) according to an embodiment of the present disclosure. The processor (2402) may be implemented as one or more IC (integrated circuit or circuitry) chips and may perform various data processing operations. The processor (Y02) may include at least one electrical circuit and may execute instructions (or programs, code, data, etc.) stored in memory (2403) individually, collectively, or in any combination. Additionally, the processor (2402) may include a single-core processor or a multi-core processor, and in a specific implementation, may be composed of a processor assembly including a plurality of processing circuits.
[0558] The processor (2402) is electrically, operatively, or communicatively coupled to the transceiver (2401) so as to control the transceiver (2401).
[0559] The processor (2402) may include at least one processor (or processor circuitry), and at least one processor may perform the following operations individually, collectively, or in any combination. In a particular embodiment, at least one part of the processor (2402) may be included in one chip, and another part of the processor (2402) may be included in a separate chip. Alternatively, at least one processor may be included in other components, such as a transceiver (2401) or memory (2403).
[0560] The processor (2402) may perform, cause, or control the operation of a base station to perform at least one or a combination of the methods according to the embodiments of the present disclosure. For example, the processor (2402) may control the operation of a base station to generate a downlink signal and transmit it to a terminal, or to process an uplink signal received from a terminal. Alternatively, the base station may transmit and receive signals with an adjacent base station, transmit a signal received from a terminal to an upper node of the network, or receive a signal from an upper node of the network and transmit it to a terminal. To this end, the processor (2402) may control other components of the base station (2400) to perform various operations by executing computer programs, codes, and instructions stored in memory (2403).
[0561] Memory (2403) is a hardware storage device capable of storing information temporarily or permanently and may include one or more storage media. For example, memory (2403) may include a memory assembly comprising one or more storage media. For example, the one or more storage media may include a hard drive, flash memory, permanent memory such as ROM (read-only memory), semi-permanent memory such as RAM (random access memory), cache memory, or any combination thereof.
[0562] The memory (2403) can be electrically, operatively, or communically coupled with the processor (2402) and can be accessed by the processor (2402).
[0563] A computer program, code, or instruction that can be executed by a processor (2402) may be stored in the memory (2403). According to one embodiment, the computer program, code, or instruction that can be executed by the processor (2402) may be stored in a single memory device or may be separated and distributed among two or more memory devices. The processor (2402) may perform various functions according to the embodiments of the present disclosure by executing the instruction stored in the memory (2403).
[0564] According to one embodiment of the present disclosure, the operation of a base station (2400) may be caused to be performed based on at least one processor (or processing circuit) configured to perform the features of the present disclosure individually, collectively, or in any combination based on the execution of instructions (or computer program or code) stored in memory (2403), based on a processing circuitry not configured to execute instructions, and / or based on a component of a processing circuitry not configured to execute instructions.
[0565] A terminal or a base station can perform various communication procedures related to the control plane or user plane by interacting with network entities based on communication through a wireless channel. For example, a terminal can communicate with network entities such as an access and mobility management function (AMF) or a session management function (SMF) through a base station. Alternatively, the base station can perform at least one communication procedure by directly transmitting and receiving signals or relaying them with network entities. The structure of the above-mentioned network entities will be explained in more detail through the drawings below.
[0566] FIG. 25 is a block diagram of a network entity (2500) that performs network functions according to one embodiment of the present disclosure.
[0567] A network entity (2500) may include one or more network functions (NF) that constitute a core network (e.g., 5G (5th generation) core, 5GC) in a communication system, or entities (devices, devices, nodes, or servers, etc.) that perform part of a network function. In this case, multiple NFs may be implemented within a single network entity, or a single NF may be implemented distributed across multiple network entities. Additionally, when an NF is implemented within a network entity, the NF may be implemented in the form of software, and in such cases, a program for running the NF may be loaded into the memory of the network entity (2500).
[0568] A single NF can be implemented as one or more instances and can operate by being distributed across the same network entity or multiple network entities. Here, the instance is a software unit that logically executes a specific network function and may be separate from physical hardware resources. Additionally, one or more NFs may be implemented as a single network slice to operate in order to satisfy the specifications required by a specific service.
[0569] The above NF may include any one of an access and mobility management function (AMF), a session management function (SMF), a local session management function (L-SMF), a user plane function (UPF), a local user plane function (L-UPF), a policy control function (PCF), unified data management (UDM), a unified data repository (UDR), a network exposure function (NEF), a network repository function (NRF), an application function (AF), a network slice selection function (NSSF), a network data analytics function (NWDAF), a network slice admission control function (NSACF), an authentication server function (AUSF), or a data network (DN).
[0570] Referring to FIG. 25, a network entity (2500) may include at least one network interface (2501), at least one processor (2502) (hereinafter referred to as processor), and at least one memory (2503) (hereinafter referred to as memory). As described above, the NF may be implemented in the form of a physical device such as the network entity (2500), or may be implemented and executed in the form of a virtualized instance. When the NF is implemented in the form of an instance, it may not necessarily include physical components as illustrated in FIG. 25. In such cases, the instance may be composed of one or more logical functional units and may be logically represented.
[0571] According to at least one or a combination thereof of the methods corresponding to the embodiments of the present disclosure, the network interface (2501), processor (2502), and memory (2503) of the network entity (2500) may be operated. However, the components of the network entity (2500) are not limited to the examples of components shown in FIG. 25. In other embodiments, the network entity (2500) may include additional components in addition to the aforementioned components, or some components may be omitted. Also, in one embodiment, the network interface (2501), processor (2502), or memory (2503) may be implemented as a single component.
[0572] The network interface (2501) is a collective term for the transmitting and receiving parts of a network entity and may be a communication circuit for transmitting and receiving signals with a terminal (user equipment, UE), a base station, or other network entities. In this case, the communication circuit may include both a communication circuit for wireless communication and a communication circuit for wired communication. For example, the network interface (2501) may include circuits, logic, hardware, etc. configured to exchange control plane messages or user plane messages with a terminal, a base station, or other core network entities via wireless or wired communication. The network interface (2501) may operate using various protocols (e.g., NAS (Non-Access Stratum) protocol). Depending on the convenience of explanation and technical implementation, the network interface (2501) may be referred to as a communication circuitry, a network interface circuitry, or a communication interface circuitry.
[0573] A processor (2502) may control the overall operation of a network entity (2500) according to an embodiment of the present disclosure. In one embodiment, the processor (2502) may be implemented as one or more IC (integrated circuit or circuitry) chips and may execute various data processing operations. The processor (2502) may include at least one electrical circuit and may execute instructions (or programs, code, data, etc.) stored in memory (2503) individually, collectively, or in any combination. Additionally, the processor (2502) may include a single-core processor or a multi-core processor, and in a specific implementation, may be composed of a processor assembly including a plurality of processing circuits. Additionally, it should be noted that the processor (2502) may not necessarily be composed of physical hardware when the network function (2500) is implemented in an instance form according to another embodiment.
[0574] According to one embodiment, the processor (2502) is electrically, operatively, or communicatively coupled to the network interface (2501) so as to control the network interface (2501).
[0575] The processor (2502) may include at least one processor (or processor circuitry), and at least one processor may perform the following operations individually, collectively, or in any combination. In a specific embodiment, at least one part of the processor (2502) may be included in one chip, and another part of the processor (2502) may be included in a separate chip. Alternatively, at least one processor may be included in other components, such as a network interface (2501) or memory (2503).
[0576] A processor (2502) may perform or control operations of a network entity (2500) to perform at least one or a combination thereof of methods according to embodiments of the present disclosure. For example, the processor (2502) may control operations of the network entity (2500) to exchange control plane messages or user plane messages with terminals, base stations, or other core network entities via wireless or wired communication using various protocols (e.g., NAS protocols). To this end, the processor (2502) may control other components of the network entity (2500) to perform various operations by executing computer programs, code, or instructions stored in memory (2503).
[0577] Memory (2503) is a hardware storage device capable of storing information temporarily or permanently and may include one or more storage media. For example, memory (2503) may include a memory assembly comprising one or more storage media. For example, the one or more storage media may include a hard drive, flash memory, permanent memory such as ROM (read-only memory), semipermanent memory such as RAM (random access memory), cache memory, or any combination thereof.
[0578] According to one embodiment, the memory (2503) may be electrically, operatively, or communicatively coupled to the processor (2502) and may be accessed by the processor (2502).
[0579] A computer program, code, or instruction that can be executed by a processor (2502) may be stored in the memory (2503). According to one embodiment, the computer program, code, or instruction that can be executed by the processor (2502) may be stored in a single memory or separated and distributed across two or more memories. The processor (2502) may perform various functions according to the embodiments of the present disclosure by executing the instruction stored in the memory (2503).
[0580] According to one embodiment of the present disclosure, the operation of a network entity (2500) may be caused to be performed based on at least one processor (or processing circuit) configured to perform the features of the present disclosure individually, collectively, or in any combination based on the execution of instructions (or computer program or code) stored in memory (2503), based on a processing circuitry not configured to execute instructions, and / or based on a component of a processing circuitry not configured to execute instructions.
[0581] Meanwhile, although specific embodiments have been described in the detailed description of the present disclosure, it is understood that various modifications are possible within the scope of the present disclosure. Therefore, the scope of the present disclosure should not be limited to the described embodiments, but should be defined by the claims set forth below as well as equivalents thereof.
Claims
In a method performed by a terminal of a communication system, A step of receiving configuration information for multiple carriers from a base station; A step of receiving scheduling information for a data channel mapped to a plurality of carriers from the base station, wherein the scheduling information includes FDRA (frequency domain resource allocation) information for a reference carrier, and the reference carrier is one of the plurality of carriers; A step of determining the frequency resources of the data channels on the plurality of carriers based on the above FDRA information; and A method characterized by including the step of receiving downlink data from the frequency resource of the data channel from the base station. In paragraph 1, The above FDRA information indicates the scheduled VRB (virtual resource block) of the above reference carrier, and A method characterized in that a scheduled VRB on a specific scheduled carrier is determined based on the ratio of the total number of VRBs of the specific scheduled carrier to the total number of VRBs of the reference carrier. In paragraph 1, A method characterized in that the reference carrier is the carrier with the smallest carrier index among the plurality of carriers, the carrier with the lowest frequency band among the plurality of carriers, or the carrier to which the scheduling information is transmitted. In paragraph 1, The frequency resource of the above data channel corresponds to a PRB (physical resource block) corresponding to the VRB indicated by the above FDRA information, and A method characterized in that an indicator included in the above scheduling information indicates whether VRB-to-PRB mapping is applied to a specific scheduled carrier. In the method performed by a base station of a communication system, A step of transmitting configuration information for multiple carriers to a terminal; A step of transmitting scheduling information for a data channel mapped to a plurality of carriers to the terminal, wherein the scheduling information includes FDRA (frequency domain resource allocation) information for a reference carrier, and the reference carrier is one of the plurality of carriers; and The method includes the step of transmitting downlink data from the frequency resources of the data channel to the terminal, A method characterized in that the above FDRA information relates to the frequency resources of the data channels on the plurality of carriers. In paragraph 5, The above FDRA information indicates the scheduled VRB (virtual resource block) of the above reference carrier, and A method characterized in that a scheduled VRB on a specific scheduled carrier is determined based on the ratio of the total number of VRBs of the specific scheduled carrier to the total number of VRBs of the reference carrier. In paragraph 5, A method characterized in that the reference carrier is the carrier with the smallest carrier index among the plurality of carriers, the carrier with the lowest frequency band among the plurality of carriers, or the carrier to which the scheduling information is transmitted. In paragraph 5, The frequency resource of the above data channel corresponds to a PRB (physical resource block) corresponding to the VRB indicated by the above FDRA information, and A method characterized in that an indicator included in the above scheduling information indicates whether VRB-to-PRB mapping is applied to a specific scheduled carrier. In a terminal of a communication system, At least one transceiver; At least one processor connected to the above at least one transceiver so as to be able to communicate; and Connected to communicate with at least one processor and capable of executing individually or in any combination of the at least one processor, the terminal: Receive configuration information for multiple carriers from a base station, and Receives scheduling information for a data channel mapped to the plurality of carriers from the base station, and the scheduling information includes FDRA (frequency domain resource allocation) information for a reference carrier, and the reference carrier is one of the carriers among the plurality of carriers. Determining the frequency resources of the data channels on the plurality of carriers based on the above FDRA information, and A terminal characterized by including: a memory that stores a command to receive downlink data from the base station in the frequency resource of the data channel. In Paragraph 9, The above FDRA information indicates the scheduled VRB (virtual resource block) of the above reference carrier, and A terminal characterized in that a scheduled VRB on a specific scheduled carrier is determined based on the ratio of the total number of VRBs of the specific scheduled carrier to the total number of VRBs of the reference carrier. In Paragraph 9, A terminal characterized in that the reference carrier is the carrier with the smallest carrier index among the plurality of carriers, the carrier with the lowest frequency band among the plurality of carriers, or the carrier to which the scheduling information is transmitted. In Paragraph 9, The frequency resource of the above data channel corresponds to a PRB (physical resource block) corresponding to the VRB indicated by the above FDRA information, and A terminal characterized by an indicator included in the above scheduling information indicating whether VRB-to-PRB mapping is applied to a specific scheduled carrier. In a base station of a communication system, At least one transceiver; At least one processor connected to the above at least one transceiver so as to be able to communicate; and Connected to communicate with at least one processor and capable of executing individually or in any combination of the at least one processor, the base station: Transmit configuration information for multiple carriers to a terminal, and Scheduling information for a data channel mapped to the plurality of carriers is transmitted to the terminal, and the scheduling information includes FDRA (frequency domain resource allocation) information for a reference carrier, and the reference carrier is one of the plurality of carriers. A memory storing a command to transmit downlink data from the frequency resources of the data channel to the terminal; including A base station characterized by the fact that the above FDRA information relates to the frequency resources of the data channels on the plurality of carriers. In Paragraph 13, The above FDRA information indicates the scheduled VRB (virtual resource block) of the above reference carrier, and A base station characterized in that a scheduled VRB on a specific scheduled carrier is determined based on the ratio of the total number of VRBs of the specific scheduled carrier to the total number of VRBs of the reference carrier. In Paragraph 13, A base station characterized in that the reference carrier is the carrier with the smallest carrier index among the plurality of carriers, the carrier with the lowest frequency band among the plurality of carriers, or the carrier to which the scheduling information is transmitted.
