Method performed by terminal or network and device therefor in wireless communication system

Abstract

A terminal according to an embodiment of the present disclosure may receive scheduling information for uplink scheduling or downlink scheduling, and transmit or receive a data channel on the basis of the scheduling information. The data channel may include coded bits encoded on the basis of polar coding for an input bit sequence including K information bits, the input bit sequence may include N bits, wherein N is an integer equal to or greater than K, and positions to which the K information bits among the N bits are to be mapped may be determined on the basis of a basic coding rate (Rbase) configured for the polar coding.

Description

Method performed by a terminal or network in a wireless communication system and device therefor

[0001] The present disclosure relates to a wireless communication system, and more particularly, to a method for transmitting or receiving an uplink / downlink signal between a terminal or a network in a wireless communication system and a device therefor.

[0002] The 5G mobile communications system, the successor to LTE (long-term evolution), is a new, clean-slate mobile communications system characterized by high performance, low latency, and high availability. 5G NR can utilize all available spectrum resources, from low-frequency bands below 1 GHz, to intermediate-frequency bands between 1 GHz and 10 GHz, and high-frequency (millimeter wave) bands above 24 GHz. 6G mobile communications systems are being developed based on the underlying technologies of 5G mobile communications.

[0003] In the 5G NR (New Radio) system, various channel coding schemes were introduced to ensure the reliability of wireless transmission. Polar coding was applied to the control channel, and LDPC (Low Density Parity Check) coding was applied to the data channel. In 5G NR, Polar coding for the control channel did not support repetition or retransmission techniques that varied the redundancy level. In particular, even when repetition was performed on the Physical Downlink Control Channel (PDCCH) for purposes such as coverage enhancement, the same coded bits were repeatedly transmitted.

[0004] The technical task to be achieved in the present disclosure is to provide a method for efficiently performing a wireless signal transmission and reception process and a device therefor. A method for applying polar coding to various channels, such as DL / UL data / control channels, is provided. For example, a method for applying a polar code structure supporting IR (Incremental Redundancy) (hereinafter referred to as IR-Polar) to DL / UL data / control channels may be provided. For example, a basic polar encoding structure for IR-Polar may be provided.

[0005] In addition to the technical challenges described above, other technical challenges can be inferred from the description below.

[0006] According to one aspect of the present disclosure, a method performed by a terminal includes receiving scheduling information for uplink scheduling or downlink scheduling; and performing transmission or reception on a data channel based on the scheduling information, wherein the data channel includes coded bits encoded based on polar coding for an input bit sequence including K information bits, the input bit sequence including N bits, wherein N is an integer greater than or equal to K, and positions to which the K information bits among the N bits are to be mapped are determined by a basic coding rate (R) set for the polar coding. base ) can be determined based on.

[0007] The above basic coding rate (R base ) can be determined based on the above scheduling information.

[0008] The terminal determines the basic coding rate (R) based on the MCS (modulation and scheme) information and resource allocation information included in the scheduling information. base ) can be determined.

[0009] The above terminal has the basic coding rate (R base ) is set for the polar coding based on the basic rate matching output sequence length (E base ) and determine the basic rate matching output sequence length (E base ) can determine the locations to which the K information bits among the N bits are to be mapped.

[0010] The above terminal has the basic coding rate (R base ) is set for the polar coding based on the basic rate matching output sequence length (E base ) and determine the basic rate matching output sequence length (E base ) is set for the polar coding based on the basic input sequence length (N base ) is determined, but the basic input sequence length (N base ) is the basic rate matching output sequence length (E base ) can be the smallest number among the powers of 2.

[0011] The above terminal has the basic coding rate (R base ) can be determined as puncturing or shortening for the basic rate matching method set for the polar coding.

[0012] The terminal may perform retransmission or rereception for the data channel. The same basic coding settings may be used for transmission and retransmission for the data channel, or for reception and rereception for the data channel.

[0013] The same basic coding settings as above are applied to the basic rate matching output sequence length (E base ), the basic input bit sequence length (N base ) or may include at least one of the basic rate matching methods.

[0014] Transmission or reception on the above data channel may relate to a first redundancy version, and retransmission or rereception on the above data channel may relate to a second redundancy version.

[0015] According to another aspect of the present disclosure, a non-transitory computer-readable recording medium having recorded thereon a program for performing the method described above may be provided.

[0016] According to another aspect of the present disclosure, a device comprises at least one processor; and at least one memory configured to store instructions that are executed by the at least one processor to cause the at least one processor to perform operations, wherein the operations of the processor include receiving scheduling information for uplink scheduling or downlink scheduling; and performing transmission or reception for a data channel based on the scheduling information, wherein the data channel includes coded bits encoded based on polar coding for an input bit sequence including K information bits, the input bit sequence including N bits, wherein N is an integer greater than or equal to K, and positions to which the K information bits among the N bits are to be mapped are determined by a basic coding rate (R) set for the polar coding. base ) can be determined based on.

[0017] The above device may further include a transmitter and receiver.

[0018] The above device may be a terminal operating in a wireless communication system.

[0019] The above device may be a processing device configured to control a terminal operating in a wireless communication system.

[0020] According to another aspect of the present disclosure, a method performed by a base station includes transmitting scheduling information for uplink scheduling or downlink scheduling; and performing transmission or reception for a data channel based on the scheduling information, wherein the data channel includes coded bits encoded based on polar coding for an input bit sequence including K information bits, the input bit sequence including N bits, wherein N is an integer greater than or equal to K, and positions to which the K information bits among the N bits are to be mapped are set to a basic coding rate (R) set for the polar coding. base ) can be determined based on.

[0021] According to another aspect of the present disclosure, a base station includes at least one processor; and at least one memory configured to store instructions that are executed by the at least one processor to cause the at least one processor to perform operations, wherein the operations of the processor include transmitting scheduling information for uplink scheduling or downlink scheduling; and performing transmission or reception for a data channel based on the scheduling information, wherein the data channel includes coded bits encoded based on polar coding for an input bit sequence including K information bits, the input bit sequence including N bits, wherein N is an integer greater than or equal to K, and positions to which the K information bits among the N bits are to be mapped are determined by a basic coding rate (R) set for the polar coding. base ) can be determined based on.

[0022] According to the present disclosure, signal transmission and reception can be efficiently performed in a wireless communication system. According to one embodiment, Polar Coding can be applied not only to the control channel but also to UL / DL data channels, and the introduction of a Polar Code structure that supports Incremental Redundancy (IR) can improve coding gain and transmission reliability. Furthermore, by defining a basic structure for Polar Encoding, the problem of ambiguity in channel encoding / decoding due to changes in redundancy when introducing IR Polar can be resolved.

[0023] In addition to the technical effects described above, other technical effects can be inferred from the description below.

[0024] Figure 1 illustrates a flexible network topology to which some examples of this specification may be applied.

[0025] FIG. 2 illustrates an example of a communication system applicable to the present disclosure.

[0026] FIG. 3 illustrates an example of a wireless device applicable to the present disclosure.

[0027] FIG. 4 illustrates a communication procedure between a first node (e.g., a terminal) and a second node (e.g., a base station) applicable to the present disclosure.

[0028] Figure 5 illustrates a general functional architecture for an AI / ML model.

[0029] Figure 6 illustrates a communication procedure between a first node (e.g., terminal) and a second node (e.g., base station) to which an AI / ML model is applied.

[0030] FIG. 7 illustrates an electromagnetic spectrum according to one embodiment of the present disclosure.

[0031] FIG. 8 illustrates an example of a procedure for transmitting system information for THz communication to which the present disclosure applies.

[0032] Figure 9 illustrates a beam management procedure applicable to the present disclosure.

[0033] FIG. 10 illustrates an example of a sensing operation according to one embodiment of the present disclosure.

[0034] FIG. 11 illustrates time / frequency resources for sensing operations according to one embodiment of the present specification.

[0035] FIG. 12 illustrates a procedure related to a sensing operation according to one embodiment of the present specification.

[0036] Figure 13 illustrates the coding chain of NR LDPC.

[0037] Figure 14 is a diagram for explaining the BG structure of 5G NR.

[0038] Figure 15 illustrates an example of a 16QAM interleaver.

[0039] Figure 16 illustrates the coding chain of Polar code.

[0040] Figure 17 is a diagram for explaining the structure in which the sub-block interleaver and rate matching of the Polar code are performed.

[0041] Figure 18 is a drawing for explaining the Channel interleaver of Polar code.

[0042] Figure 19 is a diagram to explain the concept of IR (Incremental Redundancy)-polar coding.

[0043] Figure 20 is a diagram to explain the concept of IF (Incremental Freezing)-polar coding.

[0044] Figure 21 illustrates an example of channel coding to which an IR structure is applied.

[0045] Figure 22 illustrates cases where different rate matching methods are applied / assumed in the structure of IR-polar.

[0046] Figure 23 is a conceptual diagram briefly illustrating the overall Polar coding process according to one embodiment.

[0047] Figure 24 illustrates puncturing in basic rate matching according to one embodiment.

[0048] Figure 25 illustrates shortening in basic rate matching according to one embodiment.

[0049] FIG. 26 is a diagram for explaining input bit sequences when basic puncturing is applied according to one embodiment.

[0050] FIG. 27 is a diagram for explaining input bit sequences when basic shortening is applied according to one embodiment.

[0051] Figure 28 is a drawing for explaining terminal operation according to one embodiment.

[0052] Figure 29 is a diagram for explaining the operation of a base station according to one embodiment.

[0053] FIG. 30 is a diagram for explaining signal transmission and reception between terminal base stations according to one embodiment.

[0054] Figure 31 is a diagram illustrating the effect of IR-polar application and rate matching according to one embodiment.

[0055] Figure 32 illustrates a flow of a method performed by a terminal according to one embodiment.

[0056] FIG. 33 illustrates a flow of a method performed by a base station according to one embodiment.

[0057] As used herein, "A or B" can mean "only A," "only B," or "both A and B." In other words, as used herein, "A or B" can be interpreted as "A and / or B." For example, as used herein, "A, B or C" can mean "only A," "only B," "only C," or "any combination of A, B and C."

[0058] As used herein, a slash ( / ) or a comma can mean "and / or." For example, "A / B" can mean "A and / or B." Accordingly, "A / B" can mean "only A," "only B," or "both A and B." For example, "A, B, C" can mean "A, B, or C."

[0059] In this specification, "at least one of A and B" may mean "only A", "only B" or "both A and B". Additionally, in this specification, the expressions "at least one of A or B" or "at least one of A and / or B" may be interpreted identically to "at least one of A and B".

[0060] Additionally, in this specification, “at least one of A, B and C” can mean “only A,” “only B,” “only C,” or “any combination of A, B and C.” Additionally, “at least one of A, B or C” or “at least one of A, B and / or C” can mean “at least one of A, B and C.”

[0061] Additionally, parentheses used herein may mean "for example." Specifically, when "control information (ABC)" is indicated, "ABC" may be described as an example of "control information." For example, "control information" may include DEF as another example. In other words, "control information" in this specification is not limited to "ABC," and "ABC" may be described as an example of "control information." Furthermore, even when indicated as "control information (i.e., ABC)," "ABC" may be described as an example of "control information."

[0062] Additionally, in this specification, terms such as “first,” “second,” etc. are used only for the purpose of distinguishing one component from another component and are not used to limit the components, and do not limit the order or importance between the components unless specifically limited. Accordingly, a first component in one embodiment of this specification may be referred to as a second component in another embodiment, and similarly, a second component in one embodiment may be referred to as a first component in another embodiment.

[0063] In the following explanation, ‘when, if, in case of’ can be replaced with ‘based on’.

[0064] Technical features individually described in a single drawing in this specification may be implemented individually or simultaneously.

[0065] In this specification, a terminal is a user equipment (UE) or a consumer-side device, and may also be referred to as a base station / second node / IAB node / first node that receives / transmits signals from / to a Transmission-Reception Point (TRP). A terminal may correspond to a physical node or a logical node. A terminal may correspond to an endpoint on the user side, or may correspond to an intermediate point between other endpoints. In communication between two points that are not limited to endpoints (including one-to-one / many-to-one / one-to-many / many-to-many communication), a terminal may correspond to a served node. A terminal may be a node with a fixed location, or a node with an unfixed location (or mobile).

[0066] In this specification, a base station (BS) is a device on the network side, and may also be called a second node / IAB node / x-NodeB (x-NodeB, x may be an abbreviation related to radio access technology (RAT)) / Transmission-Reception Point (TRP). A BS may correspond to a physical node or a logical node. A BS may correspond to an endpoint on the network side, or may correspond to an intermediate point between other endpoints. In communication between two points that are not limited to endpoints (including one-to-one / many-to-one / one-to-many / many-to-many communication), a BS may correspond to a serving node. A BS may be a node with a fixed location, or a node with an unfixed location.

[0067] In this specification, higher layer parameters may be set for the terminal, preset, or predefined. For example, the base station may transmit higher layer parameters to the terminal. For example, the terminal may transmit parameters such as capabilities to the base station as higher layer parameters. For example, the higher layer parameters may be transmitted via radio resource control (RRC) signaling or medium access control (MAC) signaling.

[0068] In this specification, the information / state / parameter being “configured or pre-configured” can be interpreted as the information / state / parameter being provided / pre-provided to the terminal through pre-defined signaling (e.g., SIB, MAC, RRC) from the base station. In this specification, the information / state / parameter being “defined or pre-defined” can be interpreted as the information / state / parameter being known in advance or pre-stored at the base station and the terminal without signaling between the base station and the terminal.

[0069] The technology described in this specification can be used in various wireless communication systems such as CDMA (code division multiple access), FDMA (frequency division multiple access), TDMA (time division multiple access), OFDMA (orthogonal frequency division multiple access), and SC-FDMA (single carrier frequency division multiple access). CDMA can be implemented with wireless technologies such as UTRA (universal terrestrial radio access) or CDMA2000. TDMA can be implemented with wireless technologies such as GSM (global system for mobile communications) / GPRS (general packet radio service) / EDGE (enhanced data rates for GSM evolution). OFDMA can be implemented with wireless technologies such as IEEE (Institute of Electrical and Electronics Engineers) 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802-20, E-UTRA (evolved UTRA), LTE (long term evolution), and 5G NR.

[0070] The technology described in this specification can be implemented with 6G wireless technology and applied to various 6G systems. For example, the 6G system can have key factors such as enhanced mobile broadband (eMBB), ultra-reliable low latency communications (URLLC), massive machine-type communication (mMTC), artificial intelligence (AI) integrated communication, tactile internet, high throughput, high network capacity, high energy efficiency, low backhaul and access network congestion, and enhanced data security.

[0071] <Symbols, Abbreviations, Terms>

[0072] - UL: Uplink

[0073] - DL: Downlink

[0074] - PDCCH: Physical Downlink Control CHannel

[0075] - PUCCH: Physical Uplink Control CHannel

[0076] - PDSCH: Physical Downlink Shared CHannel

[0077] - PUSCH: Physical Uplink Shared Channel

[0078] - TB: Transport Block

[0079] - CB: Code Block

[0080] - CBG: Code Block Group

[0081] - HARQ: Hybrid ARQ

[0082] - ACK: ACKnowledgement

[0083] - NACK: Negative ACKnowledgement

[0084] - RV: Redundancy Version

[0085] - DCI: Downlink Control Information

[0086] - UCI: Uplink Control Information

[0087] - IR: Incremental Redundancy

[0088] - IF: Incremental Freezing

[0089] - SC: Successive Cancelation

[0090] - SCL: Successive Cancelation List

[0091] - RE: Resource Element

[0092] - REG: Resource Element Group

[0093] - CCE: Control Channel Element

[0094] - AL: Aggregation Level

[0095] - RNTI: Radio Network Temporary Identifier

[0096] - Decoding order: When sequential decoding is performed, such as SC or SCL decoding, the order in which bit values ​​are estimated by decoding.

[0097] - Puncturing order: The order in which puncturing is performed first when rate matching.

[0098] - Reliability order: The order in which the polarization effect appears high at the input stage of the polar matrix, or the order of priority in which information bits are arranged.

[0099] Among the terms used in this specification, the term initial transmission / retransmission can be used with the same meaning as initial transmission / retransmission.

[0100] Among the terms used in this specification, the term information can be used with the same meaning as information.

[0101] Figure 1 illustrates a flexible network topology to which some examples of this specification may be applied.

[0102] To compensate for incomplete network coverage areas, a network topology that allows for more flexible and resilient split radio access networks (RANs) may be considered. For this purpose, various nodes, such as IAB nodes, relays, and RF repeaters, as illustrated in the example in Figure 1, may be applied, or NTNs may be integrated. For example, an IAB node may correspond to a node that provides wireless backhaul. For example, a relay may refer to any intermediate point, or in the case of a sidelink relay where a terminal functions as a relay, it may collectively refer to a terminal-to-network (U2N) relay and a terminal-to-terminal (U2U) relay. For example, an RF repeater may correspond to a node that simply performs the function of signal amplification and forwarding, while a network-controlled repeater may not only amplify and forward signals but also adjust transmission and reception settings based on information provided by the network. For example, an NTN node may correspond to a satellite or aircraft that provides NTN coverage that is difficult for terrestrial networks to provide. In addition to these examples, various intermediate points can be introduced to improve the network topology.

[0103] Referring to Figure 1, a split RAN can support the division of a base station into a centralized unit (CU) and one or more distributed units (DUs). The CU and DU can correspond to logical units. The CU can be further divided into a control plane (CP) portion and one or more user plane (UP) portions. Since a failure in the CU-CP affects not only the CU-UP but also the DUs, various intermediate points can be introduced to compensate for this.

[0104] An intermediate point may correspond to a terminal or a base station, depending on its relationship to other nodes. For example, an IAB node may include a mobile-termination (MT) portion and a unit (DU). The MT may connect the IAB node to a donor node. The unit (DU) of an IAB node may serve other terminals or connect to other IAB nodes to provide multi-hop wireless backhaul to the terminal. In other words, an IAB node may correspond to a base station in its relationship to a user-side node, and to a terminal in its relationship to a network-side node.

[0105] In some examples of this specification, the description of a terminal can be equally applied not only to a user-side endpoint, but also to an intermediate point corresponding to a terminal in a relative relationship with a network-side endpoint. Similarly, in some examples of this specification, the description of a base station can be equally applied not only to a network-side endpoint, but also to an intermediate point corresponding to a base station in a relative relationship with a user-side endpoint. However, in most cases where there is no additional description of the operations of three or more entities, the communicating entities in this specification are briefly described as terminals and / or base stations (or first nodes and / or second nodes), and the terms terminal and / or base stations (or first nodes and / or second nodes) are interpreted to include / replace any endpoint or any intermediate point in relation to other nodes.

[0106] That is, in some examples of this specification, for the sake of simplicity of explanation, the subjects of the operation may be referred to as a base station and / or a terminal (or a first node and / or a second node). In addition, the terms base station and / or terminal (or a first node and / or a second node) may also be interpreted / replaced as in the following examples: For example, the base station (or a first node) and the terminal (or a second node) may respectively correspond to the first endpoint and the second endpoint; may respectively correspond to the endpoint and the intermediate point; may respectively correspond to the intermediate point and the endpoint; or may respectively correspond to the first intermediate point and the second intermediate point.

[0107] In this specification, there may be zero or more intermediate points between the base station and the terminal. If intermediate points exist, they may be IAB nodes, relays, RF repeaters, NTN (non-terrestrial network) nodes, or nodes supporting other functions. An intermediate point may be a node with a fixed location or a node with an unfixed location.

[0108] Figure 2 illustrates a communication system applicable to the present disclosure.

[0109] The communication system (100) of FIG. 2 includes a wireless device (110), a network device (120), and a network (130). Here, the wireless device (110) refers to a device that performs communication using a wireless access technology (e.g., LTE, LTE-A, LTE-A pro, NR, 5G, 5G-A, 6G), and may be referred to as a communication / wireless / 5G / 6G device. Although not limited thereto, the wireless device (110) may include a robot (110a), a vehicle (110b-1, 110b-2), an XR (extended reality) device (110c), a hand-held device (110d), a home appliance (110e), an IoT (Internet of Things) device (110f), and an AI (artificial intelligence) device / server (110g). For example, the vehicle may include a vehicle equipped with a wireless communication function, an autonomous vehicle, a vehicle capable of performing vehicle-to-vehicle communication, etc. Here, the vehicle (110b-1, 110b-2) may include an unmanned aerial vehicle (UAV) (e.g., a drone). The XR device (110c) includes an augmented reality (AR) / virtual reality (VR) / mixed reality (MR) device, and may be implemented in the form of a head-mounted device (HMD), a head-up display (HUD) equipped in a vehicle, a television, a smartphone, a computer, a wearable device, a home appliance, a digital signage, a vehicle, a robot, etc. The portable device (110d) may include a smartphone, a smart pad, a wearable device (e.g., a smart watch, smart glasses), a computer (e.g., a laptop, etc.), etc. The home appliance (110e) may include a TV, a refrigerator, a washing machine, etc. The IoT device (110f) may include a sensor, a smart meter, etc. The wireless device (110) may correspond to a terminal (or first node) or an intermediate point.The network device (120) may correspond to a base station (or second node) or another intermediate point. For example, the network device (120) may also be implemented as a wireless device (110), and a specific wireless device (120a) may act as a network device (120) to another wireless device (110).

[0110] Wireless devices (110a to 110f) can be connected to a network (130) via a network device (120). AI technology can be applied to the wireless devices (110a to 110f), and the wireless devices (110a to 110f) can be connected to an AI server (110g) via a network (130). The network (130) can be configured using a 3G network, a 4G (e.g., LTE) network, a 5G (e.g., NR), or a 6G network. The wireless devices (110a to 110f) can communicate with each other via the network device (120) / network (130), but can also communicate directly (e.g., sidelink communication) without going through the network device (120) / network (130). For example, vehicles (110b-1, 110b-2) can communicate directly (e.g., V2V (vehicle to vehicle) / V2X (vehicle to everything) communication). Additionally, IoT devices (110f) (e.g., sensors) can communicate directly with other IoT devices (e.g., sensors) or other wireless devices (110a to 110f).

[0111] Wireless communication / connection (150a, 150b, 150c) can be established between wireless devices (110a to 110f) / network devices (120), network devices (120) / network devices (120). Here, the wireless communication / connection can be established through various wireless access technologies such as uplink / downlink communication (150a), sidelink communication (150b) (or D2D communication), and communication between network devices (150c) (e.g., relay, IAB (integrated access backhaul)). Through the wireless communication / connection (150a, 150b, 150c), the wireless device and the network device / wireless device, and the network device and the network device can transmit / receive wireless signals to each other. For example, the wireless communication / connection (150a, 150b, 150c) can transmit / receive signals through various physical channels. To this end, based on various descriptions of the present disclosure, at least some of various configuration information setting processes for transmitting / receiving wireless signals, various signal processing processes (e.g., channel encoding / decoding, modulation / demodulation, resource mapping / demapping, etc.), resource allocation processes, etc. may be performed.

[0112] FIG. 3 illustrates an example of a wireless device applicable to the present disclosure.

[0113] Referring to FIG. 3, the wireless device (200) can transmit and receive wireless signals via various wireless access technologies (e.g., LTE, LTE-A, LTE-A pro, NR, 5G, 5G-A, 6G). The wireless device (200) includes at least one processor (202) and at least one memory (204), and may additionally include at least one transceiver (206) and / or at least one antenna (208).

[0114] The processor (202) controls the memory (204) and / or the transceiver (206), and may be configured to implement the descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed in this document. For example, the processor (202) may process information in the memory (204) to generate first information / signal, and then transmit a wireless signal including the first information / signal via the transceiver (206). In addition, the processor (202) may receive a wireless signal including second information / signal via the transceiver (206), and then store information obtained from signal processing of the second information / signal in the memory (204). The memory (204) may be connected to the processor (202) and may store various information related to the operation of the processor (202). For example, the memory (204) may store software code including instructions for performing some or all of the processes controlled by the processor (202), or for performing the descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed herein. Here, the processor (202) and the memory (204) may be part of a communication modem / circuit / chip designed to implement wireless communication technology. The transceiver (206) may be connected to the processor (202) and may transmit and / or receive wireless signals via at least one antenna (208). The transceiver (206) may include a transmitter and / or a receiver. The transceiver (206) may be used interchangeably with an RF (radio frequency) unit. In the present disclosure, a wireless device may also mean a communication modem / circuit / chip.

[0115] Hereinafter, the hardware elements of the wireless device (200) will be described in more detail. Although not limited thereto, at least one protocol layer may be implemented by at least one processor (202). For example, at least one processor (202) may implement at least one layer (e.g., a functional layer such as physical (PHY), media access control (MAC), radio link control (RLC), packet data convergence protocol (PDCP), radio resource control (RRC), and service data adaptation protocol (SDAP)). At least one processor (202) may generate at least one Protocol Data Unit (PDU) and / or at least one Service Data Unit (SDU) according to the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. At least one processor (202) may generate a message, control information, data, or information according to the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. At least one processor (202) can generate a signal (e.g., a baseband signal) including a PDU, an SDU, a message, control information, data or information according to the functions, procedures, proposals and / or methods disclosed in this document, and provide the signal to at least one transceiver (206). At least one processor (202) can receive a signal (e.g., a baseband signal) from at least one transceiver (206) and obtain the PDU, SDU, message, control information, data or information according to the descriptions, functions, procedures, proposals, methods and / or operational flowcharts disclosed in this document.

[0116] At least one processor (202) may be referred to as a controller, a microcontroller, a microprocessor, or a microcomputer. The at least one processor (202) may be implemented by hardware, firmware, software, or a combination thereof. For example, at least one application specific integrated circuit (ASIC), at least one digital signal processor (DSP), at least one digital signal processing device (DSPD), at least one programmable logic device (PLD), or at least one field programmable gate array (FPGA) may be included in the at least one processor (202). The descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document may be implemented using firmware or software, and the firmware or software may be implemented to include modules, procedures, functions, etc. The descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document may be included in the at least one processor (202), or may be stored in at least one memory (204) and driven by the at least one processor (202). The descriptions, functions, procedures, suggestions, methods and / or flowcharts disclosed in this document may be implemented using firmware or software in the form of code, instructions and / or sets of instructions.

[0117] At least one memory (204) can be connected to at least one processor (202) and can store various forms of data, signals, messages, information, programs, codes, instructions and / or commands. The at least one memory (204) can be configured as a read only memory (ROM), a random access memory (RAM), an erasable programmable read only memory (EPROM), a flash memory, a hard drive, a register, a cache memory, a computer readable storage medium and / or a combination thereof. The at least one memory (204) can be located internally and / or externally to the at least one processor (202). In addition, the at least one memory (204) can be connected to the at least one processor (202) via various technologies such as a wired or wireless connection.

[0118] At least one transceiver (206) can transmit user data, control information, wireless signals / channels, etc., mentioned in the methods and / or flowcharts of this document to at least one other device. At least one transceiver (206) can receive user data, control information, wireless signals / channels, etc. mentioned in the descriptions, functions, procedures, proposals, methods and / or flowcharts disclosed in this document from at least one other device. For example, at least one transceiver (206) can be connected to at least one processor (202) and can transmit and receive wireless signals. For example, at least one processor (202) can control at least one transceiver (206) to transmit user data, control information, or wireless signals to at least one other device. Furthermore, at least one processor (202) can control at least one transceiver (206) to receive user data, control information, or wireless signals from at least one other device. In addition, at least one transceiver (206) may be connected to at least one antenna (208), and at least one transceiver (206) may be configured to transmit and receive user data, control information, wireless signals / channels, etc. mentioned in the descriptions, functions, procedures, proposals, methods and / or operation flowcharts disclosed in this document through at least one antenna (208). In this document, at least one antenna may be a plurality of physical antennas or a plurality of logical antennas (e.g., antenna ports). At least one transceiver (206) may convert the received wireless signals / channels, etc. from RF band signals to baseband signals in order to process the received user data, control information, wireless signals / channels, etc. using at least one processor (202). At least one transceiver (206) may convert the processed user data, control information, wireless signals / channels, etc. from baseband signals to RF band signals using at least one processor (202).For this purpose, at least one transceiver (206) may include an (analog) oscillator and / or filter.

[0119] The components of the wireless device described with reference to FIG. 3 may be referred to by different terms in terms of functionality. For example, the processor (202) may be referred to as a control unit, the transceiver (206) as a communication unit, and the memory (204) as a storage unit. In some cases, the communication unit may be used to mean at least a portion of the processor (202) and the transceiver (206).

[0120] The structure of the wireless device described with reference to FIG. 3 can be understood as the structure of at least a portion of various devices. For example, the structure of the wireless device illustrated in FIG. 3 can be at least a portion of various devices described with reference to FIG. 2 (e.g., a robot (110a), a vehicle (110b-1, 110b-2), an XR device (110c), a portable device (110d), a home appliance (110e), an IoT device (110f), an AI device / server (110g)). Furthermore, according to various embodiments, in addition to the components illustrated in FIG. 3, the device may further include other components.

[0121] For example, the device may be a portable device such as a smartphone, a smart pad, a wearable device (e.g., a smart watch, smart glasses), or a portable computer (e.g., a laptop, etc.). In this case, the device may further include at least one of a power supply unit that supplies power and includes a wired / wireless charging circuit, a battery, etc., an interface unit that includes at least one port for connection with another device (e.g., an audio input / output port, a video input / output port), and an input / output unit for inputting and outputting image information / signals, audio information / signals, data, and / or information input from a user.

[0122] For example, the device may be a mobile device such as a mobile robot, a vehicle, a train, an aerial vehicle (AV), a ship, etc. In this case, the device may further include at least one of a driving unit including at least one of an engine, a motor, a power train, wheels, brakes, and a steering unit of the device, a power supply unit including a wired / wireless charging circuit, a battery, etc. that supplies power, a sensor unit that senses status information, environmental information, and user information of the device or its surroundings, an autonomous driving unit that performs functions such as path maintenance, speed control, and destination setting, and a position measurement unit that obtains location information of the mobile device through a global positioning system (GPS) and various sensors.

[0123] For example, the device may be an XR device such as an HMD, a head-up display (HUD) installed in a vehicle, a television, a smartphone, a computer, a wearable device, a home appliance, a digital signage, a vehicle, a robot, etc. In this case, the device may further include at least one of a power supply unit that supplies power and includes a wired / wireless charging circuit, a battery, etc., an input / output unit that obtains control information, data, etc. from the outside and outputs the generated XR object, and a sensor unit that senses status information, environmental information, and user information of the device or the surroundings of the device.

[0124] For example, the device may be a robot that can be classified into industrial, medical, household, military, etc. types depending on the purpose or field of use. In this case, the device may further include at least one of a sensor unit that senses status information, environmental information, and user information of the device or its surroundings, and a driving unit that performs various physical actions, such as moving the robot joints.

[0125] For example, the device may be an AI device such as a TV, a projector, a smartphone, a PC, a laptop, a digital broadcasting terminal, a tablet PC, a wearable device, a set-top box (STB), a radio, a washing machine, a refrigerator, digital signage, a robot, a vehicle, etc. In this case, the device may further include at least one of an input unit that acquires various types of data from the outside, an output unit that generates output related to sight, hearing, or touch, a sensor unit that senses status information, environmental information, and user information of the device or its surroundings, and a training unit that trains a model composed of an artificial neural network using learning data.

[0126] The structure of the wireless device illustrated in FIG. 3 may be understood as a part of a terminal (or first node), or as a part of an intermediate point, or as a part of a base station (or second node). If the device illustrated in FIG. 3 is a base station (or second node), the device may further include a wired transceiver for front haul and / or back haul communications. However, if the front haul and / or back haul communications are based on wireless communications, at least one transceiver (206) illustrated in FIG. 3 may be used for front haul and / or back haul communications, and a wired transceiver may not be included.

[0127] FIG. 4 illustrates a communication procedure between a first node (e.g., a terminal) and a second node (e.g., a base station) applicable to the present disclosure.

[0128] The second node of FIG. 4 supports dynamic spectrum sharing (DSS), which can provide connectivity to both nodes implementing 6G technology and nodes implementing pre-6G wireless communication technologies (e.g., 5G, 4G). That is, the first node of FIG. 4 can implement either 6G technology or pre-6G wireless communication technologies (e.g., 5G, 4G). Furthermore, the first node and / or the second node can support full duplex mode as well as non-overlapping full duplex mode.

[0129] In Fig. 4, for the sake of simplicity of explanation, the first node and the second node are assumed to be a terminal and a base station, respectively, and operations of the terminal (110) and the base station (120) transmitting and / or receiving data and operations performed prior thereto are illustrated. However, the operations of Fig. 4 are not limited to operations between the terminal and the base station, and may be interpreted as operations between the first node and the second node. In addition, although Fig. 4 illustrates direct wireless signal transmission and reception operations between the terminal (110) and the base station (120), one or more intermediate points may exist between the terminal (110) and the base station (120), and wireless signals may be transmitted and received via one or more intermediate points.

[0130] Referring to FIG. 4, the terminal (110) and the base station (120) can perform synchronization (401). For example, the terminal (110) performs an initial cell search operation. Specifically, the terminal (110) can detect a synchronization signal for connection to at least one base station transmitted from the base station (120) according to a predefined rule. Here, the synchronization signal can include a plurality of synchronization signals classified according to structure or purpose (e.g., a first synchronization signal (e.g., a primary synchronization signal), a second synchronization signal (e.g., a secondary synchronization signal), etc.). Through this, the terminal (110) can confirm the boundary of a unit (e.g., a frame, a subframe, a slot, and / or a symbol) constituting a wireless signal transmission of the base station (120) and obtain information (e.g., a cell identifier) ​​about the base station (120).

[0131] The terminal (110) can obtain system information transmitted from the base station (120) (403). The system information is information related to the properties, characteristics, and / or capabilities of the base station (120) required to access the base station (120) and use the service, and can be classified according to the content (e.g., whether it is essential for access), transmission structure (e.g., channel used, whether provided on-demand), etc., and can be classified into, for example, first system information (e.g., master information block (MIB), primary system information), second system information (e.g., system information block (SIB), secondary system information), etc. If necessary, the terminal (110) can transmit a signal requesting system information before receiving the system information. However, the request and provision of system information can be performed after the random access procedure described below.

[0132] The terminal (110) and the base station (120) can perform a random access procedure (405). The terminal (110) can transmit and / or receive at least one message (e.g., a random access preamble, a random access response (RAR) message, etc.) for the random access procedure based on information related to a channel for the random access procedure of the base station (120) obtained through system information (e.g., channel location, channel structure, structure of a supported preamble, etc.). For example, the terminal (110) can transmit a first message (e.g., a preamble, MSG1) through the channel for the random access procedure, receive a second message (e.g., an RAR message, MSG2), transmit a third message (e.g., MSG3) including information related to the terminal (110) (e.g., identification information) to the base station (120) using scheduling information included in the second message, and receive a fourth message (e.g., MSG4) for contention resolution and / or connection establishment. As another example, the first and third messages may be sent and received as one message, or the second and fourth messages may be sent and received as one message.

[0133] The terminal (110) and the base station (120) can perform signaling of control information (407). Here, the control information can be defined in various layers, such as a layer that controls a connection (e.g., a radio resource control (RRC) layer), a layer that handles mapping between logical channels and transport channels (e.g., a media access control (MAC) layer), and a layer that handles physical channels (e.g., a physical (PHY) layer). For example, the terminal (110) and the base station (120) can perform at least one of signaling for establishing a connection, signaling for determining settings related to communication, and signaling for indicating allocated resources.

[0134] The terminal (110) and the base station (120) can transmit and / or receive data (409). In other words, the terminal (110) and the base station (120) can process, transmit, and / or receive data based on signaling of control information. For example, when transmitting data, the terminal (110) or the base station (120) can perform at least one of channel encoding, rate matching, scrambling, constellation mapping, layer mapping, waveform modulation, antenna mapping, and resource mapping on the information bits. Conversely, when receiving data, the terminal (110) or the base station (120) can perform at least one of signal extraction from resources, waveform demodulation for each antenna, signal arrangement considering layer mapping, constellation demapping, descrambling, and channel decoding.

[0135] <6G System Core Technologies>

[0136] The 6G (wireless) system aims to provide (i) very high data rates per device, (ii) a very large number of connected devices, (iii) global connectivity, (iv) very low latency, (v) low energy consumption for battery-free Internet of Things (IoT) devices, (vi) ultra-reliable connectivity, and (vii) connected intelligence with machine learning capabilities. The vision of the 6G system can be divided into four aspects: intelligent connectivity, deep connectivity, holographic connectivity, and ubiquitous connectivity.

[0137] As core implementation technologies of the 6G system, technologies such as artificial intelligence (AI), THz (terahertz) communication, optical wireless technology, FSO backhaul network, massive MIMO technology, blockchain, 3D networking, quantum communication, unmanned aerial vehicles, cell-free communication, wireless information and energy transfer (WIET), integration of sensing and communication, integration of access backhaul networks, holographic beamforming, big data analysis, and large intelligent surface (LIS) can be adopted.

[0138] artificial intelligence

[0139] Incorporating AI into communications can streamline and improve real-time data transmission. AI can use numerous analytics to determine how complex target tasks should be performed. This means AI can increase efficiency and reduce processing delays. Time-consuming tasks such as handovers, network selection, and resource scheduling can be performed instantly using AI. AI can also play a crucial role in machine-to-machine (M2M), machine-to-human, and human-to-machine communications. Furthermore, AI can facilitate rapid communication in brain-computer interfaces (BCIs). AI-based communication systems can be supported by metamaterials, intelligent structures, intelligent networks, intelligent devices, intelligent cognitive radios, self-sustaining wireless networks, and machine learning.

[0140] The following describes a functional framework for AI / ML operations.

[0141] Below, to explain AI (or AI / ML) more specifically, the terms can be defined as follows.

[0142] - Data collection: Data collected from network nodes, management entities, or terminals as a basis for AI model training, data analysis, and inference.

[0143] - AI Model: A data-driven algorithm that applies AI technology to generate a set of outputs containing predictive information and / or decision parameters based on a set of inputs.

[0144] - AI / ML Training: An online or offline process of training an AI model by learning features and patterns that best represent the data and obtain a trained AI / ML model for inference.

[0145] - AI / ML Inference: The process of making predictions or inducing decisions based on collected data and the AI ​​model using a trained AI model.

[0146] Life Cycle Management (LCM) procedures for AI / ML models (i.e., model training, model deployment, model inference, model monitoring, model updates, etc.) can be divided into functionality-based LCM and model-based LCM. In functionality-based LCM, AI / ML models may not be identified by the network, and the network can direct the activation / deactivation / fallback / switching of AI / ML functionality. In model-ID (identifier)-based LCM, AI / ML models can be identified by the network, and the network / terminal can activate / deactivate / select / switch AI / ML models based on the model ID.

[0147] Figure 5 illustrates a general functional architecture for an AI / ML model.

[0148] In particular, Figure 5 illustrates a general functional architecture relevant to both Functionality-based LCM and Model-based LCM. Some of the functions or some of the data / information / command flows (i.e., arrows) illustrated in Figure 5 may be omitted.

[0149] Referring to FIG. 5, a general functional framework can be configured to include a data collection function (10), a model training function (20), a management function (30), an inference function (40), and a model storage function (50).

[0150] The Data Collection function (10) is a function that provides input data to the Model Training function (20), Management function (30), and Inference function (40). The Data Collection function (10) can perform data preparation based on raw data and provide input data processed through data preparation. Examples of raw data may include received data / measurement data from terminals or other network entities, inference / output of AI / ML models, etc. The Data Collection function (10) may be performed by a single entity (e.g., terminal, network node, etc.) or may be performed by multiple entities.

[0151] Here, training data (11) refers to data required as input for the AI / ML Model Training function (20). Monitoring data (12) refers to data required as input for the Management (30) of the AI / ML model or AI / ML function. Inference data (13) refers to data required as input for the AI / ML Inference function (30).

[0152] The Model Training function (20) is a function that performs AI / ML model training, validation, and testing, which can generate model performance metrics that can be used as part of the AI / ML model testing procedure. The Model Training function (20) can perform data preparation (e.g., data pre-processing and cleaning, forming, and transformation) based on the Training Data (11) transferred from the Data Collection function (10), if necessary.

[0153] Trained / Updated Model (21): If there is a Model Storage function (50), it is used to pass a trained, validated and tested AI / ML model to the Model Storage function (50) or to pass an updated version of the model to the Model Storage function (50).

[0154] The Management function (30) is a function that supervises the operation of the AI / ML model or AI / ML function. In addition, the Management function (30) may perform decisions to ensure appropriate inference operations based on data received from the Data Collection function (10) (i.e., Monitoring Data (12)) and / or data received from the Inference function (40) (i.e., Inference Output (41)).

[0155] Management Instruction (32) is information required as input to manage the Inference function (40). The relevant information may include selection / (de)activation / switching of an AI / ML model or AI / ML-based function, and may also include fallback to non-AI / ML operations (i.e., not relying on the inference process).

[0156] A Model Transfer / Delivery Request (33) can be used to request model(s) from Model Storage (50).

[0157] A Performance Feedback / Retraining Request (31) refers to information required as input to the Model Training function (20) (e.g., for the purpose of (re)training or updating the model).

[0158] The Inference function (40) is a function that provides output from the process of applying an AI / ML model or AI / ML function using data (i.e., Inference Data (13)) provided by Data Collection (10) as input. Data preparation (e.g., data preprocessing and cleaning, formatting, and transformation) may also be performed based on the Inference Data (13) delivered by Data Collection (10). If necessary, the Inference function (40) may also perform data preparation (e.g., data preprocessing and cleaning, forming, and transformation) based on the Inference Data (13) provided by Data Collection function (10).

[0159] Inference Output (41) is data used in the Management function (30) to monitor the performance of an AI / ML model or AI / ML function. Inference Output (41) may include the inference output of the AI / ML model generated by the Inference function (30), and the details of the inference output may vary depending on the use case.

[0160] The Model Storage function (50) stores a learned / updated model that can be used to perform the Inference function (40). The Model Storage function (50) illustrated in FIG. 5 can be used as a reference point (if any) when applicable to protocol termination, model transmission / delivery, and related processes. Furthermore, the Model Storage function (50) is merely an example and is not intended to limit the storage location of actual AI / ML models, and may be omitted.

[0161] Model Transfer / Delivery (51) is used to transfer AI / ML models to inference functions.

[0162] The level of cooperation can be defined as follows depending on the capability of AI / ML functions between multiple nodes, and variations due to combination of multiple levels or separation of any one level are also possible.

[0163] Cat 0a) No collaboration framework: AI / ML algorithms are purely implementation-based and do not require any changes to the wireless interface.

[0164] Cat 0b) This level corresponds to a framework with a modified wireless interface tailored to efficient implementation-based AI / ML algorithms, but without collaboration.

[0165] Category 1) involves inter-node support to improve the AI / ML algorithms of each node. For example, this applies when a specific node receives support from another node (for training, adaptation, etc.) and vice versa. At this level, model exchange between network nodes is not required.

[0166] Category 2) Joint AI / ML tasks can be performed across multiple nodes. This level requires the exchange of AI / ML model commands or network nodes.

[0167] FIG. 5 is a diagram illustrating an overall functional framework for an AI / ML model, and not all functions and / or all data / information / command signals illustrated in FIG. 5 may be performed within a specific node, but only some of them may be performed.

[0168] AI / ML models can be divided into one-side models and two-side models depending on whether training and / or inference are performed on a single node or jointly / sequentially on multiple nodes.

[0169] A one-side model can refer to an AI / ML model in which inference is performed entirely by a single node (e.g., a terminal or network). Here, AI / ML model training can also be performed entirely by a single node. AI / ML model training and inference can be performed by the same node, or they can be performed by separate nodes.

[0170] A two-side model can refer to an AI / ML model in which joint inference is performed across multiple nodes (e.g., terminals and networks). Joint inference refers to inference being performed jointly across multiple nodes. For example, the first part of the inference may be performed by a first node, and the remaining part by a second node. Two-side models can be categorized into several types depending on the training method of the AI / ML model, as follows:

[0171] - First type: AI / ML models can be trained on a single node. In this case, joint training can be performed. The trained model can then be distributed to other nodes / objects.

[0172] - Second type: Joint training of AI / ML models can be performed on multiple nodes / entities (e.g., networks and terminals). Joint training can mean that model generation (e.g., CSI generation part) and model reconstruction (CSI compression by sub-use case) are trained in the same loop for forward activation and backward gradient. In this type, joint training can include both simultaneous training (i.e., model generation training and model reconstruction training are performed simultaneously) and sequential training (i.e., model reconstruction training is performed after model generation training).

[0173] - Third type: Separate training of AI / ML models can be performed on multiple nodes (e.g., networks and terminals). Separate training may mean that training begins sequentially on one node and continues on other nodes. In this case, the first node first performs the AI / ML model and shares the training data with the second node. The second node can then use the shared training data to perform the AI / ML model. For example, training for the CSI generation part may be performed by the terminal, while CSI reconstruction may be performed by the network.

[0174] Figure 6 illustrates a communication procedure between a first node (e.g., terminal) and a second node (e.g., base station) to which an AI / ML model is applied.

[0175] The operations described below can be described / interpreted based on the AI / ML model proposed in this specification, as shown in Fig. 6 below, even without separate mention (i.e., without explicit mention of being by / based on / for the AI / ML model). In addition, unless specifically limited, the AI / ML model can correspond to a one-side model in which inference is entirely performed by a single node, or a two-side model in which joint inference is performed by multiple nodes.

[0176] First signaling (601): In the description below, the signaling (e.g., information / data / channel / signal, etc.) or set of signaling between a specific node (e.g., terminal, network, etc.) and another node may be interpreted as the signaling or set of signaling of the first signaling (601) used to perform an operation based on an AI / ML model, even if not otherwise mentioned. For example, it may correspond to training data for training (i.e., generation and / or reconstruction) the AI / ML model of FIG. 5, or correspond to inference data used for inference of the AI / ML model, or correspond to feedback for the AI / ML model, etc. If signaling between nodes is not required prior to an operation based on an AI / ML model in the present specification, the first signaling (601) may be omitted. If a one-side model is used in the present specification, the one-way / two-way signaling (set) in the present specification may correspond to the signaling of the first signaling (601). In addition, when a two-side model is used in this specification, the one-way / two-way signaling in this specification may correspond to the first signaling (601), and also, a repetitive signaling operation may correspond to the first signaling (601).

[0177] For example, in AI / ML model-based beam management (BM), if a base station predicts (i.e., infers) beam(s) with good quality based on an AI / ML model, the base station can receive quality / intensity information for multiple beams from a terminal. Furthermore, if a terminal predicts (i.e., infers) beam(s) with good quality based on an AI / ML model, the terminal can receive multiple beams from the base station.

[0178] AI / ML model-based operation (602): In the description below, an operation (e.g., calculation, selection, prediction, etc.) in a specific node (e.g., terminal, network, etc.) or a joint operation (e.g., calculation, selection, prediction, etc.) in multiple nodes (e.g., terminal, network, etc.) may correspond to an AI / ML model-based operation (602) based on one or more functions in the functional framework of the AI / ML model, even if not mentioned separately. For example, it may correspond to training (i.e., generation and / or reconstruction) of the AI / ML model of FIG. 5 or inference of the AI / ML model, etc. When a one-side model is used, an operation performed by a single node in the present specification may correspond to an AI / ML model-based operation (602), and also, when a two-side model is used, a joint operation performed by multiple nodes in the present specification may correspond to an AI / ML model-based operation (602).

[0179] For example, in an AI / ML model-based BM, the base station can use quality / intensity information for multiple beams received from the terminal as inference data to predict (i.e., infer) beam(s) with good quality based on the AI / ML model. Furthermore, the terminal can measure multiple beams received from the base station and use the measurement results as inference data to predict (i.e., infer) beam(s) with good quality based on the AI / ML model.

[0180] Second signaling (603): In the description below, signaling (e.g., information / data / channel / signal, etc.) or a set of signaling between a specific node (e.g., terminal, network, etc.) and another node may be interpreted as a second signaling (603) or a set of signaling generated due to (as a result of) an operation based on an AI / ML model, even if not otherwise mentioned. For example, it may correspond to an output resulting from inference of the AI / ML model in FIG. 5. If signaling between nodes is not required as a result of an operation based on an AI / ML model in this specification, the second signaling (603) may be omitted. If a one-side model is used in this specification, a one-way / two-way signaling (set) in this specification may correspond to the second signaling (603). In addition, when a two-side model is used in this specification, the one-way / two-way signaling in this specification may correspond to the second signaling (603), and also, a repetitive signaling operation may correspond to the second signaling (603).

[0181] For example, in an AI / ML model-based BM, the base station can transmit to the terminal the beam(s) predicted based on the AI / ML model as candidates so that the terminal can determine the optimal beam. Furthermore, the terminal can report to the base station the beam(s) predicted based on the AI / ML model to request the base station to transmit the candidate beams as candidates for determining the optimal beam.

[0182] THz communication (terahertz communication)

[0183] Data rates can be increased by increasing bandwidth. This can be achieved by utilizing sub-THz communications with wide bandwidths and applying advanced massive MIMO technology. THz waves, also known as sub-millimeter waves, typically refer to the frequency range between 0.1 THz and 10 THz, with corresponding wavelengths ranging from 0.03 mm to 3 mm. The 100 GHz to 300 GHz band (sub-THz band) is considered a key part of the THz spectrum for cellular communications. Adding the sub-THz band to the mmWave band will increase the capacity of 6G cellular communications. Among the defined THz bands, 300 GHz to 3 THz lies in the far infrared (IR) frequency band. While part of the optical band, the 300 GHz to 3 THz band lies at the boundary of the optical band, immediately following the RF band. Therefore, this 300 GHz to 3 THz band exhibits similarities to RF.

[0184] Figure 7 illustrates the electromagnetic spectrum according to one embodiment of the present disclosure. The embodiment of Figure 7 can be combined with various embodiments of the present disclosure. Key characteristics of THz communications include (i) a widely available bandwidth to support very high data rates, and (ii) high path loss at high frequencies (highly directional antennas are essential). The narrow beamwidth generated by the highly directional antenna reduces interference. The small wavelength of THz signals allows for a much larger number of antenna elements to be integrated into devices and base stations operating in this band. This enables the use of advanced adaptive array techniques to overcome range limitations.

[0185] Transmitting system information (i.e., information related to the properties, characteristics, and / or capabilities of a BS required to use a service, such as MIB, SIB, etc.) in the THz frequency band may be inefficient because, as the beam width becomes narrower in high frequency bands, more beam sweeps must be performed to cover the entire area of ​​the cell. In particular, transmitting system information in this manner is even more inefficient when there are not many users in the cell. Accordingly, a system information transmission procedure such as that illustrated in FIG. 8 may be used.

[0186] Figure 8 illustrates an example of a procedure for transmitting system information for THz communications to which the present disclosure applies. While this example was developed with THz in mind, it is also applicable to 6G communication environments where THz is not applicable. Furthermore, the procedure illustrated in Figure 8 can be combined with various embodiments of the present disclosure described below. For example, the embodiments described below can be performed based on system information acquired through the procedure illustrated in Figure 8.

[0187] Referring to FIG. 8, the base station can transmit system information of cell #1 through cell #2 (801). That is, the base station provides at least two cells, cell #1 uses a THz frequency band, and cell #2 uses a non-THz frequency band. Here, the system information can include at least one information / state / parameter / setting generated in each of a higher layer and a physical layer. For example, the at least one information / state / parameter / setting generated in the higher layer can include at least one of an SFN, control information setting for SIB1 (e.g., PDCCH configuration for SIB1, etc.), information related to cell selection / entry (e.g., cell barring, cell re-selection, etc.), and subcarrier spacing, and the at least one information / state / parameter / setting generated in the physical layer can include at least one of an SFN, a half frame indicator, and an SSB index. However, this is merely an example, and system information may include information / status / parameters / settings related to Cell #1 / Cell #2 generated from various types of physical layers / upper layers. For this purpose, as an example, Cell #1 and Cell #2 may have a relationship as a secondary cell and a primary cell.

[0188] The UE can acquire synchronization for cell #1 (803). Synchronization can be acquired by detecting a synchronization signal. Typically, synchronization is acquired before receiving system information. However, since the system information for cell #1 is received from cell #2, synchronization acquisition for cell #1 can be performed after receiving the system information. For example, the UE can acquire synchronization based on the system information. However, unlike FIG. 8, in another example, synchronization acquisition can be performed before step 801.

[0189] The UE may transmit a signal for accessing cell #1 (805). For example, the signal may include information for accessing cell #1 (e.g., a random access preamble). The structure of the signal and the resources for transmitting the signal (e.g., a channel) may be identified through system information. Thereafter, the UE and the base station may perform an access procedure for cell #1 and communicate (807). During this process, operations according to various embodiments described below may be performed.

[0190] The procedure described with reference to FIG. 8 may be performed when UE (801) first accesses cell #1 of the base station. Alternatively, a similar procedure may be performed when UE (801) hands over to cell #1 of the base station. However, in the case of handover, the system information of cell #1 may be received from a cell of a base station other than cell #2 of the base station.

[0191] Communications in the THz band are expected to experience extremely severe path loss, and to overcome this, terminals and base stations must use extremely sharp beams. The use of sharp beams means that terminals and base stations must perform beam control in addition to beamforming, and the number of beams used increases significantly. Consequently, it takes a very long time to align the transmit and receive beams between the base station and terminals. Furthermore, if the beam alignment between the base station and terminals is misaligned due to the movement or movement of the terminals, frequent re-alignment of the beams is required, which can lead to link instability. Accordingly, a beam management procedure, as illustrated in FIG. 9 below, may be employed.

[0192] FIG. 9 illustrates a beam management procedure applicable to the present disclosure. FIG. 9 illustrates an example of a procedure for searching and / or selecting beams for THz communication, but is not limited to a THz environment, and the present disclosure is applicable to a 6G communication environment. In addition, the procedure illustrated in FIG. 9 can be combined with various embodiments of the present disclosure described below. Here, a beam may be interpreted as 'spatial (setting) information', 'spatial domain filter', 'spatial domain transmission filter', 'spatial domain reception filter', or / and a term having an equivalent technical meaning that can distinguish the beam (e.g., Reference signal, SSB (Synchronization Signal Block) Index, TRP (transmission reception point), panel, cell, TP (transmission point), base station, control resource related information (e.g., CORESET (control resource set) related information, etc.).

[0193] Referring to FIG. 9, a base station can configure resources for beam management (901). Here, the resources can include at least one of time-frequency resources, channels, and spatial resources (e.g., antenna ports). For example, the base station can utilize a beam search signal (BSS) that is transmitted spatially separated from existing downlink signals / channels for beam search. Here, the BSS can be transmitted based on a dedicated port for beam search. The dedicated port can be a different port from a port for transmitting existing downlink signals / channels (e.g., synchronization signals (e.g., SSB, etc.), data channels (e.g., PDSCH, etc.)). BSS is a term defined for convenience of explanation, and the technical concept according to the present embodiment is not limited to the term BSS itself. That is, a signal transmitted based on a dedicated port defined / configured for beam search can be included in the technical concept according to the present embodiment.

[0194] The base station can transmit measurement signals using multiple transmission beams (903). For example, the measurement signals can include at least one of a reference signal and a synchronization signal. At this time, the measurement signals can be transmitted as many times as the number of beams that require measurement, and can be transmitted using a multi-beam transmission method that forms multiple beams simultaneously to reduce sweeping time. Here, the multi-beam transmission can be performed based on at least one of a multi-panel, a sub-array, and a true time delay (TTD).

[0195] The UE may transmit a feedback signal to the base station (905). The feedback signal indicates at least one beam selected by the UE. The UE may select at least one preferred beam based on the received measurement signals. The UE and the base station may communicate (907). At this time, the UE and the base station may communicate using the previously selected beam. If channel reciprocity is established, the transmission beam of the UE may also be determined through operations 903 and 905, and thus the transmission of the UE may also be performed using the beam selected in operation 905. If channel reciprocity is not established, a procedure including transmission of measurement signals by the UE and transmission of a feedback signal by the base station may be performed first to determine the transmission beam of the UE. In operation 907, operations according to various embodiments described below may be performed.

[0196] Integrated Sensing and Communication (ISAC)

[0197] Wireless sensing is a technology that uses radio frequencies to determine the instantaneous linear velocity, angle, distance (range), etc. of an object, thereby obtaining information about the characteristics of the environment and / or objects within the environment. Because radio frequency sensing does not require a networked device to connect to the object, it can provide a service for object positioning without a device. The ability to obtain range, velocity, and angle information from radio frequency signals can enable a wide range of new capabilities, such as various object detection, object recognition (e.g., vehicles, humans, animals, UAVs), and high-precision localization, tracking, and activity recognition. Wireless sensing services can provide information to a variety of industries (e.g., drones, smart homes, V2X, factories, railways, public safety, etc.), enabling applications such as intruder detection, assisted vehicle steering and navigation, trajectory tracking, collision avoidance, traffic management, and health and traffic management. In some cases, wireless sensing can utilize non-3GPP type sensors (e.g., radar, cameras) to further support 3GPP-based sensing. For example, the operation of wireless sensing services, i.e., sensing operations, may depend on the transmission, reflection, and scattering of wireless sensing signals. Therefore, wireless sensing offers an opportunity to enhance existing communication systems from a communication network to a wireless communication and sensing network.

[0198] FIG. 10 illustrates an example of a sensing operation according to an embodiment of the present disclosure. The embodiment of FIG. 10 can be combined with various embodiments of the present disclosure. Specifically, FIG. 10(a) illustrates an example of sensing using a sensing receiver and a sensing transmitter located at the same location (e.g., monostatic sensing), and FIG. 10(b) illustrates an example of sensing using a separated sensing receiver and sensing transmitter (e.g., bistatic sensing).

[0199] For example, in a wireless communication system based on a 6G network of the present specification, referring to FIG. 10(a), the sensing transmitter and the sensing receiver may be configured to be included in a single base station (i.e., the same base station) or a single terminal (i.e., the same terminal). Alternatively, referring to FIG. 10(b), the sensing transmitter and the sensing receiver may be configured to be included in different base stations, different terminals, or each terminal and base station.

[0200] In this regard, the following six types of sensing modes can be defined based on whether the sensing transmitter and sensing receiver are included in the base station or the terminal, respectively.

[0201] - Mode 1: A mode in which the sensing transmitter and sensing receiver are contained in a single base station (e.g., base station-based sensing mode in monostatic mode).

[0202] - Second mode: A mode in which the sensing transmitter is included in a first base station and the sensing receiver is included in a second base station different from the first base station (e.g., base station-based sensing mode in bistatic mode).

[0203] - Mode 3: A mode in which the sensing transmitter is included in the base station and the sensing receiver is included in the terminal (e.g., base station-terminal sensing mode).

[0204] - Mode 4: A mode in which the sensing transmitter is included in the terminal and the sensing receiver is included in the base station (e.g., terminal-base station sensing mode).

[0205] - Mode 5: A mode in which the sensing transmitter and sensing receiver are contained in a single terminal (e.g., terminal-based sensing mode in monostatic mode).

[0206] - 6th mode: A mode in which the sensing transmitter is included in a first terminal and the sensing receiver is included in a second terminal different from the first terminal (e.g., terminal-based sensing mode in bistatic mode).

[0207] In a wireless communication system based on a 6G network of the present specification, one or more of the six types of sensing modes described above may be utilized independently / in combination.

[0208] In relation to the sensing operation in FIG. 10, the sensing transmitter may transmit a sensing signal for sensing one or more objects (and / or an environment around the objects). For example, the sensing signal may correspond to a radio (frequency) signal defined to be transmittable by a base station / terminal in a wireless communication system based on a 6G network of the present specification. The sensing receiver may receive a signal scattered / reflected by one or more objects (and / or an environment around the objects) from a sensing signal transmitted from the sensing transmitter. In the sensing receiver, sensing data may be derived from the scattered / reflected signals, and sensing results may be generated / obtained through processing of the sensing data. Here, the sensing results may include characteristic information (e.g., location, distance, speed, angle, etc.) about one or more objects (and / or the environment around the objects). The sensing results generated / obtained in this way may be utilized for wireless sensing services (e.g., detection, tracking, etc. of objects and / or environments) provided in the wireless communication system based on the 6G network of the present specification, or may be provided / disclosed to a trusted third party.

[0209] Additionally, the sensing operation in FIG. 10 is described as a representative example of the operation in a wireless communication system based on a 6G network, but can be extended and applied to cases where terminals / base stations / signals based on networks of previous generations (e.g., 4G, 5G, etc.) are utilized.

[0210] Additionally, with respect to the wireless sensing described herein, in a wireless communication system based on a 6G network of the present specification, time / frequency resources for sensing operations and time / frequency resources for general communications (e.g., UL / DL / sidelink-based communications, etc.) may be scheduled / configured separately.

[0211] FIG. 11 illustrates time / frequency resources for sensing operations according to one embodiment of the present disclosure. The embodiment of FIG. 11 may be combined with various embodiments of the present disclosure.

[0212] Referring to FIG. 11, time / frequency resources (hereinafter, sensing resources) for the aforementioned sensing operation (e.g., sensing operation based on FIG. 10) can be set / allocated separately from time / frequency resources (hereinafter, communication resources) for general communication.

[0213] For example, as illustrated in FIG. 11, sensing resources can be set / allocated in units of symbols in the time domain and / or resource blocks in the frequency domain. Resources other than those for which the sensing resources are set / allocated can be utilized as resources for general communication. That is, sensing resources and communication resources can be set / allocated based on a time-division multiplexing (TDM) scheme and / or a frequency-division multiplexing (FDM) scheme in terms of the operation of the base station / terminal. Additionally or alternatively, unlike what is illustrated in FIG. 10, sensing resources can also be set / allocated based on other units in the time domain (e.g., slots, frames, absolute time (ms, us), etc.) and / or other units in the frequency domain (e.g., subcarriers, carriers, absolute frequencies (MHz, GHz), etc.).

[0214] Additionally or alternatively, in connection with the setting / allocation / scheduling of resources for general communication as described herein, the relationship between the resources and the aforementioned sensing resources may need to be considered. For example, when setting / allocating resources for general communication according to the embodiment(s) of the present disclosure, the resources may be set / allocated to rate-match or puncture the resource region corresponding to the sensing resource. For example, when scheduling resources for general communication according to the embodiment(s) of the present disclosure, the resources may be scheduled so as not to overlap with the resource region corresponding to the sensing resource. If the resources for general communication according to the embodiment(s) of the present disclosure and the resource region corresponding to the sensing resource are set / allocated / scheduled to overlap, one or both operations may be dropped, skipped, or postponed based on priorities, predefined rules, etc. That is, in the embodiment(s) of the present specification, it may be desirable that resources related to general communication (e.g., resources for signals / channels related to UL / DL / Sidelink-based data / control, etc.) are set / allocated / scheduled so as not to overlap with the sensing resources described above.

[0215] Additionally, various channel modeling methods may be applied in connection with the wireless sensing described herein. Channel modeling related to sensing may refer to configuring a path for transmitting and receiving sensing signals and / or scattered / reflected signals, taking into account the object being sensed and / or the environment in which the object resides. Channel modeling may be related to the performance / requirements of sensing in wireless communication systems, and thus may be an important factor in validating the sensing function.

[0216] Channels related to sensing can be divided into channels between objects (e.g., targets of interest) and sensing transmitters / receivers, and channels between the environment to which the object belongs and sensing transmitters / receivers. In this regard, channel modeling related to sensing can be divided based on sensing mode (e.g., the six types of modes described above), whether there is an object / environment, and / or sensing scenarios. For example, channel modeling for a target in a base station / terminal-based monostatic sensing mode, channel modeling for a target in a base station / terminal-based bistatic sensing mode, channel modeling for the environment in a base station / terminal-based monostatic sensing mode, and channel modeling for the environment in a base station / terminal-based bistatic sensing mode can be configured and optimized differently. For example, when various sensing scenarios are classified, channel modeling for detection, location, and tracking scenarios, channel modeling for motion recognition, and channel modeling for imaging / environment reconstruction scenarios can be divided, etc. Additionally, channel modeling related to sensing may be based on statistical channel modeling techniques and / or deterministic channel modeling techniques. For example, modeling for sensing in a wireless communication system based on a 6G network of the present disclosure may be based on stochastic geometric channel modeling techniques and / or hybrid with ray tracing channel modeling techniques. Here, the stochastic geometric channel model may be based on various statistical characteristics of the channel state. Furthermore, the hybrid channel model may be based on both ray tracing techniques and stochastic techniques.In a hybrid approach, channels for objects requiring high accuracy and consistency (e.g., targets of interest) can be modeled using ray tracing techniques, while channels for the environment can be modeled using probabilistic techniques.

[0217] FIG. 12 illustrates a procedure related to a sensing operation according to one embodiment of the present disclosure. The embodiment of FIG. 12 may be combined with various embodiments of the present disclosure.

[0218] For example, in a wireless communication system based on a 6G network of the present specification, in the case of a sensing operation in which a terminal participates, the base station may need to confirm (1205) the capability of the terminal for the sensing operation. In this regard, the terminal may be configured to report capability information on whether it supports the sensing operation to the base station. Additionally or alternatively, if the terminal is defined in advance in the standard as supporting the sensing operation, the procedure may be omitted. In addition, in the case of a sensing operation in which only the base station participates, the base station may be configured to report capability information on whether it supports the sensing operation to an entity that configures / controls its sensing operation (e.g., a network entity at an upper level / layer of the base station).

[0219] For example, the base station can perform signaling with the terminal to exchange configuration information related to the sensing operation. For example, the base station can set / instruct the terminal about the mode of the sensing operation (e.g., based on the six types of modes described above), the subject of the sensing operation (e.g., sensing transmitter, sensing receiver), the resource of the sensing operation (e.g., sensing resource as in FIG. 11), the target of utilizing the sensing result (e.g., type of wireless sensing service based on 6G network, trusted third party), channel modeling for sensing (e.g., channel between the base station / terminal and object / environment), etc. (1210). For example, the base station can also set / instruct such information from a network entity at an upper level / layer of the base station.

[0220] For example, the base station and / or the terminal may perform a sensing operation based on the set / instructed information (1215). For example, the base station and / or the terminal may, as a sensing transmitter and / or a sensing receiver, perform procedures such as transmitting a sensing signal, receiving a scattered / reflected signal, deriving sensing data, obtaining a sensing result through processing the sensing data, and providing the sensing result, as in FIG. 9 described above. As an example, in the operation of the base station / terminal described herein, the sensing result provided through the sensing operation may be utilized.

[0221] Channel Coding

[0222] Channel coding is one of the core technologies of wireless communication systems. It is a technology that enables the receiver to detect and correct errors that occur during the process of transmitting and receiving information. It includes the encoding process of the transmitter and the decoding process of the receiver.

[0223] I. 5G NR Channel Coding

[0224] The 5G NR standard introduces and uses various channel coding techniques, including LDPC for transmitting and receiving traffic channels, Polar code for transmitting and receiving control channels, and repetition, simplex, and Reed-Muller techniques to support small block lengths.

[0225] 1. NR LDPC (Low Density Parity Check) code

[0226] Figure 13 illustrates the coding chain of NR LDPC. The TB (transport block) that the transmitter wants to transmit obtains CRC (cyclic redundancy check) bits through the TB CRC attachment step for the purpose of detecting errors that may occur in the TB. If the sum of the TB CRC and the TB length is greater than the maximum CB (Code Block Size) that the transmitter and receiver can support, the TB with the CRC attached is divided into multiple CBs through the segmentation step. If the segmentation step is performed, a CB CRC is added to each CB to provide error detection capability at the CB level. Afterwards, each CRC-attached CB is converted into a coded bit through the LDPC encoding step. Afterwards, the coded bit to be transmitted and received through the actual traffic channel is selected from the entire coded bits through the rate matching step, and the selected coded bit is interleaved and then modulated.

[0227] (Segmentation and CRC attachment)

[0228] Considering efficient operation in LDPC encoder and decoder, if the bit sequence length of TB is long, a segmentation process may be included to equally divide it and generate multiple CBs. The application of segmentation is determined by the length of the bit sequence, and the maximum CB length that can be supported depending on the selected BG (base graph) is K. cb Based on K cb If the length is longer than TB, segmentation operation is performed. (i.e. K cb =8448 for BG-1, K cb =3840 for BG-2)

[0229] To support decoder error detection, CRC attachment is performed before LDPC encoding. By default, CRC attachment is performed on a per-TB basis. If the segmentation process divides a per-TB into two or more CBs, an additional CRC attachment process is performed on each CB.

[0230] (LDPC Encoding)

[0231] According to 3GPP TS 38.212, the base graph (BG) of 5G NR LDPC coding is structured, and the parity check matrix can efficiently support HARQ and rate compatibility. These base graph characteristics allow for flexible support of a wide range of transmission information bit amounts by applying various code rates.

[0232] (Base graph of 5G NR LDPC coding)

[0233] 3GPP TS 38.212 defines two types of base graphs (BGs), called BG-1 and BG-2, respectively. The use of these BGs depends on the required information bit size and code rate. BG-1 has 46 rows and 68 columns (e.g., A+E+O=68), and the information block size is K = 22Zc. On the other hand, BG-2 has 42 rows and 52 columns, and K = 10Zc. Here, Zc represents the size of the lifting matrix, and Table 1 shows the set of lifting sizes defined in 5G NR.

[0234] [Table 1]

[0235]

[0236] Figure 14 is a diagram for explaining the BG structure of 5G NR.

[0237] Referring to Figure 14, columns are composed of information columns, core parity columns, and extension parity columns. Rows are divided into core-check rows and extension-check rows.

[0238] Both BG-1 and BG-2 have the same block structure.

[0239] Table 2 illustrates the BG-1 and BG-2 structures for lifting size 4.

[0240] [Table 2]

[0241]

[0242] Submatrix E is a dual diagonal matrix, which is advantageous for low-complexity encoding of 5G NR LDPC. As shown in Table 1, 51 lifting sizes are defined for each BG, ranging from 2 to 384.

[0243] According to the LDPC encoding procedure, 66Zc (for BG-1) coded bits (e.g., 22Zc*3) are generated, and 50Zc (for BG-2) coded bits (e.g., 10Zc*5) are generated. In BG-1 and BG-2, the coded bits are output in the order of systematic bits, core parity bits, and extended parity bits.

[0244] (Rate matching)

[0245] The N coded bits generated according to the LDPC encoding procedure are subjected to a rate matching process that selects G coded bits to match the size and modulation order of the resources allocated to transport block transmission. The coded bits generated for the rate matching process are stored in a circular buffer, and the initial bit locations of the coded bits to be transmitted are selected based on the redundancy version (RV) index of HARQ.

[0246] Table 3 shows the starting positions of different redundancy versions (RVs).

[0247] [Table 3]

[0248]

[0249] (Interleaving)

[0250] In high-order QAM modulation methods such as 16QAM (order 4) or higher, the transmission reliability of each bit in the n-bit tuple that determines the QAM symbol varies depending on the bit position. Gray mapping is typically applied so that the MSB has higher reliability than the LSB.

[0251] Fig. 15 illustrates an example of a 16QAM interleaver. The interleaver of Fig. 15 may be for LDPC.

[0252] Referring to Fig. 15, in the case of 16QAM modulation, LDPC codeword code bits are written row by row from row 1, and the output of the block interleaver is read column by column from the left column and transmitted after 16QAM modulation. Therefore, the code bits mapped to rows 1 & 2 are located in the MSB of the 4-bit tuple that determines the 16QAM symbol, and are transmitted more reliably in the QAM symbol of Gray mapping. This operation allows the systematic bits with higher priority among the LDPC code bits to be transmitted more reliably.

[0253] (Layer mapping in 5G NR)

[0254] In MIMO 2 codeword transmission, each layer is divided into two sets, and data is transmitted with an independent MCS for each set. That is, a separate TB is allocated for each layer set, and each is channel-encoded to transmit an independent codeword for each layer set. Table 4 shows the codeword-to-layer mapping relationship, with a single codeword transmitted for ranks below 4. In this case, modulation symbols are mapped alternately across each layer to maximize diversity gain.

[0255] [Table 4]

[0256]

[0257] (Modulation mapper)

[0258] For QPSK modulation, a pair of bits is mapped to a complex-valued modulation symbol according to Equation 1.

[0259] [Mathematical Formula 1]

[0260]

[0261] For 16QAM modulation, a quadruplet of bits is mapped to a complex-valued modulation symbol according to Equation 2.

[0262] [Equation 2]

[0263]

[0264] For 64QAM modulation, a hextuplet of bits is mapped to a complex-valued modulation symbol according to Equation 3.

[0265] [Equation 3]

[0266]

[0267] Here, even-numbered input bits are mapped to the in-phase channel, and odd-numbered input bits are mapped to the quadrature channel. In 16QAM modulation, b(4i) and b(4i+1) are transmitted more reliably than b(4i+2) and b(4i+3) in the I-channel and Q-channel, respectively.

[0268] 2. NR Polar code

[0269] Figure 16 illustrates the coding chain of NR Polar code.

[0270] The coding chain of Polar code has a slight difference in situations where transmission and reception are UL and DL.

[0271] Referring to Fig. 16 (a), in the case of UL, segmentation for the uncoded input bit sequence may be given priority, and each segmented bit sequence undergoes the step of CRC attachment. In addition, in the case of UL, a process of adding a parity check bit may be added depending on the condition. Afterwards, the CRC attached bit sequence is converted into a coded bit through a polar encoding process. The generated coded bit is selected as the coded bit to be transmitted and received through the sub-block interleaver and rate matching steps, and the selected coded bit is subjected to interleaving and then modulation.

[0272] Referring to Fig. 16 (b), in the case of DL, segmentation of the uncoded input bit sequence is not supported, and the CRC attachment step is performed immediately. Thereafter, the CRC-attached bit sequence forms a distributed CRC structure through the input bit interleaver step. Afterwards, the CRC-attached bit sequence of the distributed CRC structure is converted into coded bits through the polar encoding process. The generated coded bits are selected as the coded bits to be transmitted and received through the sub-block interleaver and rate matching steps, and modulation is performed on the selected coded bits.

[0273] (Segmentation, CRC attachment and input bit interleaver)

[0274] When applying polar codes in UL transmission and reception, a segmentation process may be included to equally divide long uncoded input bit sequences, taking into account efficient operation in the encoder and decoder. The application of segmentation is determined by the length of the bit sequence, and can be segmented into up to two CBs.

[0275] The CRC attachment process applies to both UL and DL, with some differences in operation.

[0276] In UL, an 11-bit or 6-bit CRC can be selected and applied depending on the length of the information. Additionally, parity check bits can be added for UL, and the number and structure of the added parity check bits are determined by the size of the information and the length of the rate-matching output bit sequence.

[0277] In DL, a 24-bit CRC is always applied regardless of the information length, and a distributed CRC structure is applied to disperse the CRC positions, which is advantageous for early decoding termination or list pruning. The input bit interelaver pattern defined in TS 38.212 is as shown in Table 5. In Table 5, Π IL max (m) The indices corresponding to values ​​140 to 163 (eg, m=65, 106, 127, 137, 141, 143, 145, 147-163) represent the locations where the CRC is placed, and other locations represent the locations of information bits.

[0278] [Table 5]

[0279]

[0280] (Polar encoding)

[0281] The matrix used for polar encoding of the input bit sequence in the Polar code (hereinafter, encoding matrix or mother code matrix) has the form of Kronecker power for the matrix (hereinafter, kernel matrix) as in mathematical expression 4.

[0282] [Equation 4]

[0283]

[0284] For example, when the input bit sequence of a polar encoder is u, the coded bit sequence x can be expressed as in mathematical expression 5 below.

[0285] [Equation 5]

[0286]

[0287] In mathematical expression 5, G^(ⓧn) represents the n-th operation of Kronecker power on kernel matrix G, and x is the 2 generated through the operation. n *2 n It means the encoding matrix of size.

[0288] The matrix in mathematical expression 6 below shows an example of a polar encoding matrix generated when n = 4.

[0289] [Equation 6]

[0290]

[0291] The size of the data to be transmitted, including the CRC bits (e.g., the size of the unencoded information bits), is K (<2 n ) if 2 n The input bit sequence u of length K consists of K information bits and 2 n - It consists of K frozen bits. The method for selecting the position of the information bit within the input bit sequence is based on the NR standard and considers the following factors.

[0292] - Reliability: To improve decoding performance, the location of information bits is determined by prioritizing bits with relatively high reliability. In 5G NR polar code, a nested polar sequence is defined, and a reliability order is defined for each index of the polar sequence, and information bit location is determined based on this.

[0293] - Pre-freezing: The positions of input bits corresponding to the indices of coded bits that are not transmitted by puncturing or shortening are pre-determined as frozen bits and are not selected as information according to reliability conditions.

[0294] - Extra-freezing: Only when puncturing is used for rate matching, some bits are pre-determined as frozen bits in the order of decoding order and are not selected as information according to reliability conditions.

[0295] - Parity bit: In the case of UL, when the position of the parity bit is determined first, the positions of the bits used as the parity bit are determined in advance as frozen bits so that they are not selected as information according to the reliability conditions.

[0296] (Sub-block interleaver and rate matching)

[0297] To overcome the limitations of the limited mother code size supported by the Polar encoding matrix, the NR standard supports rate matching techniques such as puncturing, shortening, and repetition. (In this specification, the mother code size can be replaced with the input bit sequence size.)

[0298] For efficient rate matching, before rate matching is performed, the sub-block interleaving method is applied, and the coded bits for which polar encoding is performed are re-ordered in the order in which rate matching is applied. In sub-block interleaving, the coded bits are sequentially divided into 32 sub-blocks, and the order of the coded bits is rearranged according to the sub-block interleaver pattern for each sub-block. Table 6 shows the sub-block interleaver pattern defined in the NR standard, and based on Table 6, d0, ... d according to the rule of mathematical equation 7 below. N-1 When the coded bit of input is the result y0, ..., y N-1 This is created

[0299] [Equation 7]

[0300]

[0301] [Table 6]

[0302]

[0303] After sub-block interleaving is performed, in the rate matching step, one of the techniques of puncturing, shortening, or repetition is applied depending on the size of the encoded coded bit, the number of REs used for transmission and reception, and the size of the rate matching output bit size, which is determined by the modulation order. The size of the data to be transmitted is K, and the size of the mother code used for polar encoding is N(=2). n ), and when the size of the rate matching output bit sequence is E, the criteria for selecting one of the rate matching techniques are defined as follows in the NR standard.

[0304] - If E≥N: Repetition, The first EN bits are transmitted once again

[0305] - Else if K / E≤7 / 16: Puncturing, The first NE bits are not transmitted

[0306] - Else: Shortening, The last NE bits are not transmitted

[0307] The criteria for selecting the above bits are based on the puncturing order, which refers to the order of the output bit sequence of the sub-block interleaver. Figure 17 is an example schematically showing the structure in which the sub-block interleaver and rate matching are performed.

[0308] (Channel interleaver)

[0309] In the UL of the NR standard, the channel interleaver stage is performed after rate matching to improve performance in high-order modulation (e.g., 16QAM) situations. The interleaver applied to the polar code supports the triangular bit interleaving method to form a random-like spreading structure. The size of the triangle for the interleaver operation, T, is determined as the smallest integer satisfying T(T+1) / 2≥E, and the interleaver input bits are mapped row-wise in a structure as shown in Figure 18, and the interleaver output bits are selected column-wise.

[0310] 3. Channel coding of small block lengths

[0311] The NR standard uses separate channel coding techniques to support transmissions of 12 bits or less. When channel coding is applied to support small block lengths, CRC is not used.

[0312] Repetition code is used as a coding technique for transmitting 1 bit of data, and it operates in a structure where the same data is repeated according to the modulation order.

[0313] Simplex code is used as a coding technique for transmitting 2 bits of data. When the 2 bits of information are c0 and c1, it generates c2 = (c0 + c1) mod 2 and operates by repeatedly transmitting c0, c1, and c2 according to the modulation order.

[0314] The Reed-Muller code is used as a coding technique for transmitting data of 3 to 11 bits, and a 32-bit output sequence is generated as a result of encoding. Specifically, for i=0, ...31, the output sequence d0, ..., d 31 is determined based on mathematical formula 8.

[0315] [Equation 8]

[0316]

[0317] In mathematical expression 8, K is the size of data bits and c0, ..., c K-1 It refers to the sequence of data bits that are input to the encoder of the Reed-Muller code. Also, in the NR standard, the M used i,k The values ​​are defined as in Table 7.

[0318] [Table 7]

[0319]

[0320] II. Channel coding candidates for 6G

[0321] 1. Polar code and HARQ process

[0322] In wireless communication systems, retransmission of identical data can be supported to prepare for data transmission or reception failures due to a single transmission. Various techniques can be employed to enhance decoding performance by increasing channel coding efficiency during the retransmission process. Recent research trends supporting retransmission of polar codes include the Chase Combining perspective (CC-polar), the Incremental Redundancy perspective (IR-polar), and the Incremental Freezing perspective (IF-polar).

[0323] CC-polar

[0324] Chase combining is a technique that retransmits the coded bits of a channel where an error occurred identically, which can be viewed as similar to a form of repeated transmission in which each transmission is identical. The CC-polar method provides a transmission-reception form that allows the receiver to perform maximum-ration combining (MRC) through repeated transmissions, and also offers the advantage of relatively low complexity at both the transmitter and receiver.

[0325] IR-polar

[0326] Incremental Redundancy is a retransmission technique that increases the gain of channel coding with each retransmission, and it is a technique that supports combining each coded bit transmitted and received across multiple retransmissions to form a longer coded bit. This structure can be viewed as a structure in which some punctured coded bits based on the entire coded bit are transmitted and received differently for each retransmission, which can be viewed as different Redundancy Versions (RVs).

[0327] A representative structure of IR-polar, the mother code size increases in powers of 2 (e.g., the size of the input bit sequence of the encoding matrix, or the Kronecker Power 2 for generating the encoding matrix). n ) is a method of generating coded bits. If the initial transmission is 2 n If encoding is performed considering the mother code size, the retransmission step is 2 n+1 This is a method of generating additional coded bits and transmitting and receiving them by considering the mother code size. At this time, 2 n+1The coded bits of the size are 2 n It can be seen as a relationship that includes coded bits of the size of the polar encoder, and this is a method that utilizes the characteristic that the matrix of the polar encoder has the form of Kronecker power. When the mother code size is doubled, the most reliable bit position can be newly determined from the perspective of the encoder input bit (e.g., input bit sequence of doubled length), and especially the newly added 2 n A more reliable bit position can be generated at the location of a sub-block of the same size. Considering this, in IR-polar, a structure can be considered that copies some bits with low reliability among the information bit positions selected based on the previous mother code size to the newly selected information bit positions from the perspective of a higher mother code size. The newly selected bits have a faster decoding order and higher reliability in a structure that performs sequential decoding, such as SC / SCL (Successive Cancellation / Successive Cancellation List) decoding. Consequently, when retransmission occurs in the IR-polar structure, the mother code size increases while the information size is fixed, which has the effect of reducing the code rate.

[0328] Fig. 19 illustrates an example of an IR-polar structure. In Fig. 19, when only the 1st code block is transmitted and received, the receiver can perform decoding corresponding to the 1st info block, and the code rate at this time is 5 / 8 (e.g., K=10, N=16). If the 2nd code block is transmitted and received after the 1st code block is transmitted and received, the receiver can perform decoding corresponding to the 1st and 2nd info blocks, and at this time, since 3 bits are copied information from the previous info block, the actual code rate is lowered to 5 / 16 (e.g., K=10, N=32). In the same process, when the 3rd and 4th code blocks are transmitted and received, the actual code rate can be lowered to 5 / 32 by utilizing the characteristics of the copied bits (e.g., K=10, N=64).

[0329] IF-polar

[0330] The IF-polar technique is a method of transmitting and receiving coded bits with only a portion of the K bits applied during the retransmission phase when the size of the information bits in the initial transmission is K. From the receiver's perspective, if the coded bits transmitted and received during the retransmission phase are successfully decoded, the successful result is used to decode other coded bits, thereby improving the coding gain. In the case of information transmitted and received in the retransmission and successfully decoded, the same information bits transmitted and received in the previous transmission can be treated as frozen bits, which ultimately has the effect of lowering the code rate.

[0331] Figure 20 schematically illustrates an example of the arrangement of information bits used to generate each transmitted and received coded bit when IF-polar is applied. In the example of Figure 20, a total of nine information bits are encoded and transmitted and received during the initial transmission phase, but in subsequent retransmission phases, only some of the nine information bits are encoded and transmitted and received. In this case, the information bits included in the retransmission transmission and reception can be determined to be in positions with relatively low reliability among the previously transmitted and received information bits, which can ensure greater gains from a polar decoding perspective. If three transmissions and receptions are performed as in the example in the figure, and the terminal succeeds in decoding the information in the 3rd transmission stage, the terminal performs decoding of the 2nd transmitted coded bit using the information that succeeded in decoding (7, 8 in the figure), and if this is successful, the terminal can perform decoding of the initial transmission using the information (4, 5, 7, 8 in Fig. 20).

[0332] Encoding basic structure for channel coding

[0333] The 5G NR standard uses polar codes for transmission and reception of UL / DL control channels. Since the 5G NR standard does not consider retransmission procedures for UL / DL control channels (i.e., PDCCH, PUCCH) in case of receiver decoding failure, the polar code operational design only considered situations where information transmission and reception are completed in a single transmission.

[0334] Even when repetition is performed on the Physical Downlink Control Channel (PDCCH) for purposes such as coverage enhancement, the redundancy version (RV) information of the transmitted coded bits is not changed / increased because the same coded bits are repeatedly transmitted.

[0335] Therefore, functions supporting polar code, such as setting information and frozen bit locations, rate matching, and interleaver operation, are designed to complete information transmission and reception in a single transmission. On the other hand, in next-generation wireless communication systems such as 6G, the introduction of traffic channels (e.g., PDSCH and / or PUSCH) to which polar codes are applied may be newly considered. In the case of traffic channels, a procedure for retransmitting the same information is needed in case the receiver fails to decode. However, the existing 5G NR polar code structure, which does not consider retransmission procedures, may not efficiently support these retransmission procedures.

[0336] In next-generation wireless communication systems such as 6G, when polar codes are applied to traffic channels, a polar code structure (e.g., IR-polar) that supports IR (Incremental Redundancy) retransmission can be considered as one method of determining the coded bits included in the retransmitted physical channel to support retransmission situations. Channel coding that supports IR provides a structure in which the transmitted coded bits can be concatenated and used as a single coded bit when transmitting a single piece of information more than once. This can be viewed as a structure in which the entire coded bit is generated at the transmitter and a portion of the entire coded bit is transmitted for each transmission. Since the receiver decodes the long coded bits generated by concatenating the coded bits included in different transmissions, it can gain the advantage of gradually lowering the code rate when retransmission occurs, thereby increasing the decoding probability.

[0337] Fig. 21 schematically shows an example of a process for handling coded bits from a channel coding perspective when an IR structure is applied. When there is information (FG 101) to be transmitted at a transmitter, it is encoded (FG 102) to generate the entire coded bit (FG 103), and a portion of the generated entire coded bit is cut out and the coded bit(s) are mapped to each transmission block and transmitted to the receiver. At this time, the transmission of each coded bit (FG 104, FG 105) can generally be designed to be self-decodable (i.e., each transmitted coded bit can be decoded without the help of other coded bits). On the receiver side, when different coded bits (FG 104, FG 105) are received, the received coded bits can be processed (e.g., concatenated) (FG 106) to become one long coded bit according to a rule, and the received information can be estimated by decoding (FG 107) this (FG 108).

[0338] Likewise, in structures that support IR-polar, each partially coded bit transmitted and received during the initial / re-transmission phase can be used as a single long coded bit at the receiver side and decoded. To achieve this, the transmitter must perform the transmission process so that each partially coded bit becomes part of the entire coded bit that can be obtained through a single encoding process, and the receiver must be able to assume that each received coded bit was generated through a single encoding process. From a Polar code perspective, the fact that the receiver can expect a single encoding process for each partially coded bit can mean that it can expect the same information / frozen bit position to be set. The method of determining the information position at the encoder input of a Polar code can be viewed as a process of encoding, and a single encoding process must be presupposed to generate a long coded bit by combining each partially coded bit and assuming it to be part of the entire coded bit.

[0339] However, the current 5G NR polar code structure has limitations in directly applying this IR-polar. Typically, traffic / data channels (e.g., PDSCH / PUSCH) have variable sizes of available radio resources and information to be transmitted, requiring channel coding techniques that support coded bits of various lengths. To support rate-compatible polar codes, 5G NR has designed a rate-matching operation that includes puncturing, shortening, and repetition techniques. Due to the nature of polar codes, to maximize the channel polarization effect experienced by each information bit, the positions of the selected information and frozen bits must be carefully selected, especially considering cases where some coded bits are not transmitted or received, such as during puncturing and shortening. To this end, a pre-freezing technique is applied that prevents some encoder input bits from being used for information bit purposes. Pre-freezing technique can provide high transmission / reception performance (e.g., support lower BLER at the same SNR and / or lower required SNR for target BLER) considering the given code rate and the size of available radio resources, so the same / similar idea can be applied to next-generation wireless communication systems such as 6G.

[0340] If we consider a situation where PDSCH / PUSCH with polar code applied based on DCI is dynamically scheduled, the form in which this pre-freezing is applied to PDSCH / PUSCH can be determined based on parameters indicated by DCI (e.g., MCS and resource allocation in the time / frequency domain, etc.). However, many wireless communication systems do not support a separate procedure to provide feedback on whether the UE has successfully detected a control channel such as DCI due to considerations of radio resource efficiency and latency. 6G is likely to be designed similarly. Therefore, a situation may arise where the base station does not accurately know whether the UE has failed to receive the DL control channel (e.g., DCI missing). If the terminal fails to receive the DL control channel that schedules the PDSCH of the initial transmission (e.g., when a DCI is missing), even if it succeeds in detecting the scheduling DCI for subsequent retransmission, it cannot know the pre-freezing form set by the previous DCI (initial transmission scheduling), and thus cannot know the structure in which the entire coded bit is generated, which may cause a situation in which transmission and reception of the traffic channel fail.

[0341] Fig. 22 is a diagram for explaining the results when applying / assuming different rate matching methods when the structure of IR-polar with the existing pre-freezing technique is used. For example, assuming that initial transmission / retransmission is performed and looking at Fig. 22, if the rate matching applied in the initial transmission stage is different in the retransmission (e.g., change in rate matching output sequence length E and / or shortening / puncturing / repetition method application, etc.), the difference in the pre-freezing result and the resulting influence can be explained through Fig. 22. Fig. 22 (a) and Fig. 22 (b) assume transmission and reception of the same information, and the rate matching size in the initial transmission (1st transmission) stage is E1 (FG 205) in the example of (a) and E3 (FG 215) in the example of (b), and E1 and E3 show a situation in which different values ​​are set / indicated. Due to the positions of the bits to which pre-freezing is applied, the shapes of the input sequences (FG 201 and FG 203) determined based on the result of the rate matching size of E1 being applied to the initial transmission may be different from the shapes of the input sequences (FG 211 and FG 213) determined based on the result of the rate matching size of E3 being applied to the initial transmission. Therefore, the coded bits (FG 202 and FG 204) in (a) and the coded bits (FG 212 and FG 214) in (b) may be different from each other.In this situation, if the receiver is missing scheduling information for the initial transmission and does not know what rate matching was applied in the initial transmission phase, the receiver cannot determine the structure of the entire input sequence in the retransmission phase, which causes a decoding failure.

[0342] In this example, the problem of not knowing the structure / rate matching structure in which the coded bits are generated in a retransmission situation is mentioned, but the application of the proposals described below does not necessarily assume a retransmission situation and can also be applied to initial transmission.

[0343] This specification proposes a method to address the aforementioned issues and support retransmission techniques, such as IR-polar, in next-generation wireless communication systems, including 6G. The proposed method prevents variations in the pre-freezing structure caused by specific conditions, such as the size of scheduled rate matching, while simultaneously providing significant benefits in terms of performance metrics, such as decoding performance.

[0344] Unless otherwise specified, the proposed methods are described based on situations where retransmission is supported, such as general traffic / data channels. However, the proposed methods can also be applied to traffic channels or control channels that do not support retransmission.

[0345] Unless otherwise specified, the proposed methods are described below assuming the IR-polar architecture. However, the proposed methods can also be applied to other channel coding schemes, provided they operate in a similar manner to IR-polar and / or maintain the operational principles / idea of ​​the proposed method.

[0346] Below, we explain the terminology and operating principles of a 6G wireless communication system. However, the proposed method is not limited to this system and can be applied to general wireless communication systems.

[0347] The present disclosure proposes a method in which an encoding basic structure (e.g., encoding basic settings / information) is determined based on a specific condition (hereinafter, a first condition) and an input sequence of an encoder is determined based on the determined encoding basic structure. In this case, the first condition (or information regarding the first condition) may be composed of one or more elements, and when applied and / or provided identically to a transmitter and a receiver, the transmitter and the receiver may have the same encoding basic structure and the same input sequence.

[0348] The above encoding basic structure may refer to the structure / setting / information used as a basis for the transmitter and receiver to perform encoding. More specifically, the encoding basic structure is the size (hereinafter E) of the basic rate matching (e.g., the basic rate matching output sequence) determined based on the first condition. base ), the size of the basic mother code (e.g., basic input bit sequence) (hereinafter, N base) and / or at least one of the basic rate matching methods may be included as a component. In this case, the encoding basic structure is maintained even if repetition and / or retransmission occurs for the same TB (or CB) as long as the first condition is maintained, and the transmitter and receiver may assume this. For example, the same encoding basic structure may be maintained within the same HARQ process. According to one embodiment, the encoding basic structure may be viewed as an encoding structure applied to a situation in which the highest code rate that can be supported is generated when transmission and reception occur under the first condition. This may mean an encoding structure composed of the slowest-order bits when applying the puncturing order (i.e., the order in which puncturing and / or shortening are performed first during rate matching) from the perspective of the entire coded bit. When the proposed method for Polar code-based encoding is used, the basic characteristics of the elements that may be included in the encoding basic structure referred to in this embodiment are as follows.

[0349] - E base The encoded coded bit can be one of the possible sizes of the partial coded bit selected for transmission at a later stage after rate matching has been performed.

[0350] - N base is one of the possible sizes of the polar encoding matrix, and has a size in powers of 2.

[0351] - The basic rate matching method can be selected from among puncturing, shortening, and repetition, which are the methods by which rate matching can be performed.

[0352] The above input bit sequence (hereinafter simply referred to as the input sequence) refers to the bit sequence input to the encoder, and may be a sequence processed based on the information to be transmitted and received, or may be in the form of a pattern in which information is input to the encoder. Determining the input sequence based on the Polar code may include determining the positions of information bits and frozen bits. In this case, a structure in which some information bits are copied / repeated in one or more positions may also be supported.

[0353] According to the method proposed in the present disclosure, when a first condition is configured, an encoding basic structure is determined based on this, and an input sequence of an encoder stage is determined based on this, the transmitter and receiver can perform an actual transmission and reception procedure of information based on these results.

[0354] For example, when a traffic channel of an IR-polar structure is transmitted and received, the entire coded bit is generated using the above-determined and determined information, and the entire coded bit creates a partial coded bit through a rate matching method determined based on the above-determined and determined information, and the determined rate matching and the partial coded bit derived therefrom can be determined to be different for each initial- / re-transmission(s). As an example of another operation to achieve the same effect, each partial coded bit for transmission and reception of each initial- / re-transmission(s) can be generated independently using the above-determined and determined information.

[0355] Figure 23 schematically shows an example of the process of converting information into coded bits and performing rate matching to generate partial coded bits when polar code is applied.

[0356] Referring to Fig. 23, the encoding basic structure (FG 302) is determined based on the first condition (FG 301), and based on the encoding basic structure, input sequence generation (FG 303), operation through encoding matrix (FG 304), and rate matching (FG 305) are sequentially performed for information to be transmitted and received. As an example of a specific process, when there is K bit information (FG 306) to be transmitted and received, after the first condition (FG 301) is configured and the encoding basic structure (FG 302) is determined according to the proposed methods, the K bit information (FG 306) is converted / output into an N bit long input sequence (FG 307) based on this through the input sequence generation process (FG303). The above input sequence (FG 307) is converted / output into a coded bit (FG 308) of N bit length through an operation (FG304) using an encoding matrix of size NxN determined based on the first condition and the encoding basic structure. The coded bit (FG 308) goes through a rate matching step (FG 305) determined based on the first condition and the encoding basic structure, and as a result, a partial coded bit (FG 309) of size E bit is generated.

[0357] If the structure of Fig. 23 supports a form such as IR-Polar and initial transmission and retransmission(s) occur, the configured first condition (FG 301) and the determined encoding basic structure (FG 302) are commonly applied to the process of generating partial coded bits for all transmissions. If the transmitter is implemented in a form in which the entire coded bit is generated and then the partial coded bit is generated by cutting it out at each transmission stage, the rate matching step (FG 305) may be applied differently for each transmission. Alternatively, if the transmitter is implemented in a form in which the partial coded bit is generated separately for each transmission, the steps of input sequence generation (FG 303), encoding matrix operation (FG 304), and / or rate matching (FG 305) may be applied differently for each transmission.

[0358] The method by which each element of the first condition and encoding basic structure is determined, and the specific method by which the determination of the input sequence is performed, may follow at least one of the methods below.

[0359] In the following description, the index assigned to each [Method] is merely a distinction for convenience of explanation and is not necessarily interpreted as meaning that each [Method] is implemented independently. Accordingly, [Methods] assigned different indices may be implemented at least partially in a combined form, or each [Method] may be implemented individually.

[0360] [Method 1] Basic Rate matching out sequence length (E base )decision

[0361] E baseA method for decision making is proposed. For example, E, one of the elements of the basic structure of encoding base Determine the elements of the first condition that form the basis for the decision, and based on the first condition, E base A specific method is proposed to determine E base One or a combination of the options below may be used to make the decision.

[0362] (Option 1-1)

[0363] In the case of a transmission / reception channel where the size of the available radio resources increases in multiples of a specific transmission unit (hereinafter referred to as the first unit), the first condition includes the size of the first unit, and based on this, E base can be decided.

[0364] For example, in the case of PDCCH that transmits and receives DL control information, the basic unit that configures the transmission of PDCCH, such as CCE, can be used as the first unit. Specifically, E base The size of can be determined based on the smallest number of CCEs that can be applied when a specific PDCCH is transmitted and received (e.g., the size of the smallest applicable AL). In this case, the size of the smallest AL can be set as a unit of the DCI format and RNTI that the terminal will monitor, such as a search space, or as a unit of a group of multiple search spaces (e.g., a unit of search space set or CSS / USS).

[0365] E based on the smallest AL size set baseAs an example of a specific method for determining, it can be determined based on the number of REs available in one CCE, the applied modulation order, and the size of the minimum AL. For example, considering the CCE structure of NR and the QPSK modulation applied to the PDCCH, 54 (e.g., the number of available REs) * 2 (e.g., the number of bits that can be expressed by one QPSK symbol) = 108 bits can be the first unit, and the size of the smallest AL set / indicated for a specific search space is AL min When, E base =AL min *Can be set to 108.

[0366] E based on the size of the first unit base The method of determining the allocation of wireless resources provides an advantageous effect in terms of signaling overhead because it is based on the configuration / instruction information provided in association with the first unit without separate signaling in situations where the selection is made from among limited candidates.

[0367] (Option 1-2)

[0368] In the case of a transmission / reception channel in which the size of information to be transmitted / received and / or the code rate can be set and / or indicated, the size of information to be transmitted / received (hereinafter K) and / or the basic code rate (hereinafter R) base ) may be included in the first condition, and based on such first condition, E base can be decided.

[0369] As a specific example, E base The size of K is R base It can be determined to be the smallest value among natural numbers greater than or equal to the value divided by , and this can be expressed as in mathematical expression 9. (In this specification, the symbol ┌x┐ means a ceiling operation that finds the smallest natural number greater than or equal to x.)

[0370] [Equation 9]

[0371]

[0372] In the specific example above, if E base If there are constraints in determining the size of E, base The size of K is R base It can be determined to be the smallest natural number that satisfies the constraint among natural numbers that are equal to or greater than the value divided by . For example, in transmission and reception (2 m )-QAM modulation is used and E base If there is a constraint that the size of E must be determined in units of m bits, base The mathematical expression for determining can be as shown in mathematical expression 10 below.

[0373] [Equation 10]

[0374]

[0375] K and R base E based on base The setting method is to set E suitable for each code rate in cases where the size of available radio resources (e.g. number of REs) and code rate can be variably scheduled for the same K, such as traffic channels such as PDSCH / PUSCH. base It provides an advantageous effect in that it can provide the size of .

[0376] R base The method of determining may be one of the sub-options below or a combination of more than one method.

[0377] (Sub-Option 1-2-1)

[0378] R baseThe value of can be defined as a fixed constant. For example, a fixed constant cannot be changed by a separate setting or instruction, and can be set to a pre-agreed value, and for example, it can be a value supported by the standard of a wireless communication system that supports the proposed method.

[0379] Fixed R base The constant value of can be set to the maximum code rate that can be supported in the wireless communication system where the proposed method is supported. This is because, when considering the IR-polar structure, the information sequence generation result based on a higher code rate can be easily used for actual transmission and reception based on a lower code rate. Conversely, when the information sequence generation result based on a lower code rate is used for actual transmission and reception based on a higher code rate, there is a problem that restrictions occur due to issues such as pre-freezing. In order to prevent this problem, the basic code rate (R) used / assumed for the encoding basic structure is base ) can be defined as the maximum code rate.

[0380] R base When defined as a fixed constant with a value of , it provides an advantageous effect in that no separate signaling overhead is required for setting / instruction. In addition, in a transmission / reception situation where retransmission is required, the same R is always used regardless of other scheduling parameters. base Since it is applied, there is no restriction on the selection of scheduling parameters for each initial transmission and retransmission(s).

[0381] (Sub-Option 1-2-2)

[0382] R baseThe value may be a value set or indicated by the base station, or may be determined based on base station explicit / implicit signaling.

[0383] For example, the above R base The value of can be a value explicitly set through RRC signaling, in which case the terminal sets R according to the setting information. base can be applied and transmission and reception operations can be performed based on this.

[0384] For example, the above R base The value of may be a value explicitly indicated through the MAC CE (control element). In this case, the terminal may apply the R through the MAC CE. base A setting or change instruction for a value can be received, and after the terminal receives it, the R that is set or changed is set from the time when the HARQ-ACK corresponding to the PDSCH transmitted by the corresponding MAC CE is reported (or from the time when the application time has passed from the time of HARQ-ACK reporting). base You can decide to apply the value.

[0385] For example, the above R base The value of may be a value explicitly indicated through the DCI. In this case, the DCI will be applied with R base An independent field for indicating a value can be configured, and when the terminal receives the corresponding DCI, it indicates the R for the PDSCH reception and / or PUSCH transmission corresponding to the corresponding DCI (or for the corresponding section). base can be decided to follow.

[0386] For example, a combination of RRC signaling, / MAC CE and / or DCI may be used. Specifically, multiple R base Candidate values ​​are set, and candidate R base Among the values, R is used as the actual basic encoding structure. baseDCI / MAC CE may be provided to indicate / activate values.

[0387] R base In a transmission and reception situation where retransmission is required, if the value of is set or indicated by the base station, the base station shall use the same R during initial transmission and retransmission for a single piece of information (e.g. TB). base It must be ensured that this is maintained, and the terminal is set up to assume this.

[0388] R base When the value of R is set or indicated by the base station, the base station considers the wireless channel environment and the status of the terminal. base It provides an advantageous effect in that the base station can control the efficient use of wireless resources and improve transmission and reception performance because it can determine the .

[0389] (Sub-Option 1-2-3)

[0390] R base The value of may be implicitly determined based on other scheduling parameters that are set or indicated. In this case, the scheduling parameters refer to parameters for determining the size and transmission method of wireless transmission resources of a specific channel (e.g., PDCCH, PDSCH, PUCCH, and / or PUSCH), and may be set or indicated by the base station.

[0391] For example, R base The value of may be determined based on at least one of the size of the information to be transmitted and received, the K value, and / or the (actual) code rate applied. For example, the K value may be related to the transport block size (TBS).

[0392] Meanwhile, R baseAs a specific example of determining the (actually scheduled) K value prior to decision, the terminal can determine the (actual) code rate and total allocated resource amount through the MCS (modulation and coding scheme) information and frequency / time resource allocation information included in the DCI, and determine the K value based on the total allocated resource amount and the (actual) code rate.

[0393] R based on K value and / or (actual) code rate base As an example for determining the value of , we define segmented intervals based on the K value and / or code rate, and apply R to each interval. base The values ​​of each can be set / defined individually.

[0394] As a specific example, R is determined according to the interval based on the scheduled K value. base When is determined, a specific K value is set as a boundary value (hereinafter referred to as K th ) For the actual scheduled K value, K≤K th In this case, the first R base Applying, K>K th In this case, the second R base can be determined to apply. This example shows R that can be selected base It shows a case where there are two candidates, but two or more boundary values ​​are used, so three or more intervals and corresponding R base The proposal may also apply even if each exists.

[0395] As a specific example, R is determined according to the scheduled code rate and the set interval. base When is determined, a specific code rate value is set as the boundary value (hereinafter R th ) For the actual scheduled R value, R≤R th In this case, the first R base Applying, R>Rth In this case, the second R base can be determined to apply. This example shows R that can be selected base It shows a case where there are two candidates, but two or more boundary values ​​are used, so three or more intervals and corresponding R base The proposal may also apply even if each exists.

[0396] As a specific example, R is determined based on a section determined by simultaneously considering the scheduled K value and code rate. base When is determined, the first R is based on the boundary determined by the combination of K and code rate. base Wow, the 2nd R base One of them can be determined to be selected. For example, the boundary value K for K th-1 , K th-2 and the boundary value R for the code rate th-1 , R th-2 This is determined, K≤K th-1 , or K≤K th-2 and R≤R th-1 , or R≤R th-2 In this case, the first R base applies, otherwise the 2nd R base can be set to be used. In this example, R can be selected base It shows a case where there are two candidates, but there are three or more sections and the corresponding R base Even if each exists, the proposed proposal may be applied.

[0397] R base In a transmission and reception situation where retransmission is required, if the value of is implicitly determined based on other scheduling parameters set or indicated by the base station, the base station may use the same R during initial transmission and retransmission for a single piece of information (e.g. TB).base It is necessary to ensure that this is maintained and select scheduling parameters that take this into account, and the terminal is set to be able to assume this.

[0398] In general, for the same code rate, the larger the information size, the higher the decoding performance. Since the code rate selected during initial transmission is determined by the wireless channel environment of the terminal and the characteristics of the service, it can be assumed that it will not change significantly in most cases. Therefore, R base If the value of R is implicitly determined based on other scheduling parameters set or indicated by the base station, R is determined based on other parameters set by the base station in consideration of the wireless channel environment and the status of the terminal. base It has the advantage of reducing signaling overhead while providing an advantageous effect in that the base station can control efficient use of wireless resources and improvement of transmission and reception performance because it can determine.

[0399] (Sub-Option 1-2-4)

[0400] Maximum (or minimum) R supported depending on the terminal's capability base The value of may be different. In this case, the terminal reports its capability to the upper node, and based on its capability, R base It can determine values ​​and perform actions that accompany them.

[0401] R supported depending on the terminal's capability base If the values ​​are different, R is applied according to the characteristics of the channel being transmitted and received. base can be different, for example, R for a common channel where multiple terminals commonly transmit and receive baseR for a dedicated channel that is transmitted and received only for a specific terminal (or a set of terminals with the same capability) base The values ​​may be different.

[0402] The terminal may have different implementations depending on its purpose and features, and R according to the terminal's capabilities base This distinction provides an advantageous effect in that it enables differentiated implementation of these terminals. Furthermore, when the channel being transmitted and received is a common channel targeting multiple terminals, it provides an advantageous effect in that it reduces signaling overhead on the base station side by allowing all terminals with various capabilities that wish to transmit and receive to use a single common channel in common.

[0403] (Sub-Option 1-2-5)

[0404] R base The value may be applied differently depending on the type and characteristics of the channel that a single terminal transmits and receives.

[0405] For example, R base In order to ensure that the value of R is applied differently depending on the type and characteristics of the traffic channel, the R is applied according to the RNTI of the control channel on which the traffic channel is scheduled. base The value of can be determined to be different. For example, when a set consisting of one or more RNTIs is called an RNTI group, the first RNTI group and the second RNTI group are divided and R corresponding to each RNTI group is baseThe values ​​can be set to be different. In this case, the number of RNTI groups is only an example for explanation, and the proposed method can be applied even when there are three or more RNTI groups. As a specific example, the terminal receives two or more C-RNTI values ​​from the base station, and R of the traffic channel scheduled according to each C-RNTI base It can be assumed that the values ​​will be applied differently. In this case, R corresponding to different C-RNTIs base The value of can be a value that follows a pre-agreed rule or is set by the base station. R by RNTI base As another concrete example where the values ​​of are distinguished, the terminal uses R applied to the C-RNTI. base R applied to values ​​other than RNTIs (e.g. P-RNTI, SI-RNTI, etc.) base The values ​​of can be determined differently.

[0406] Another example is R base The value of can be set differently depending on the search space (or search space set). For this, the base station can individually set R according to the search space (or search space set). base The value of can be set. Based on this, the terminal performs PDCCH decoding for the set search space. base Apply the value of , or R set to the traffic channel corresponding to the search space base The value can be applied to perform the transmission and reception procedure.

[0407] A single terminal may have various purposes for transmitting and receiving channels. For example, a transmission / reception channel targeting high reliability and a transmission / reception channel targeting high data rates may be set or instructed to the terminal depending on the situation. To satisfy these differences in target requirements, different Rs may be applied to channels for different purposes. base The application of the value of may be required. The proposed method takes these differences into account and, even for a single terminal, R depending on the situation. base It provides an advantageous effect in that it supports the application of different values.

[0408] [Method 2]N base decision

[0409] N base may be referred to as the base encoding matrix size or as the length of the base input bit sequence.

[0410] N base A method for decision making is proposed. For example, N, one of the elements of the encoding basic structure base Determine the elements of the first condition that form the basis for the decision, and based on the first condition, N base can be decided.

[0411] For example, N base is E base can be determined based on. Specifically, N base The size of E is determined base It can be the smallest number among the powers of 2 that are greater than or equal to the size of .

[0412] Or conversely, N base The size of E is determined and based on this base The size of can be determined. For example, the selectable N base If there is a minimum size of (hereinafter N base-min ), and Ebase N is selected based on base The size of N base-min If less than, N base The size of N base-min This is determined to be E base The size of N is also base-min can be set to match. As an example of the opposite situation, the selectable N base If there is a maximum size of (hereinafter N base-max ), and E base N is selected based on base The size of N base-max If greater than N base The size of N base-max It is determined to be E base The size of N is also base-max It can be set to fit.

[0413] Like this N base-min and / or N base-max The method being considered has the advantageous effect of preventing degradation in the target performance requirement due to selecting an excessively low mother code size, and can also provide the advantageous effect of preventing the phenomenon of increasing the implementation complexity and decoding latency of the terminal when an excessively high mother code size is introduced.

[0414] In the proposed method, N base The structure in which the decision is made is not limited to a power of 2 and can be extended to other sizes. This can vary depending on the base kernel matrix of the polar code used in next-generation wireless communication systems such as 6G, and can be determined based on the use of a kernel matrix of a different size (e.g., a 3x3 kernel matrix as in Equation 11) or a combination of kernel matrices of various sizes (e.g., 2 n2 *3 n3 *5n5 )

[0415] [Equation 11]

[0416]

[0417] [Method 3] Determining the default rate matching method

[0418] A method for determining a basic rate matching method is proposed. For example, the elements of the first condition, which serve as the basis for determining the method of basic rate matching, one of the elements of the encoding basic structure, are determined, and the basic rate matching method can be determined based on the first condition.

[0419] The basic rate matching method (candidate) may include at least one of i) a puncturing method (hereinafter, basic puncturing) and / or ii) a shortening method (hereinafter, basic shortening).

[0420] i) The basic puncturing method is E, which is the basic encoding structure. base Wow N base When given, N in the order of puncturing order base -E base Consider a situation where puncturing can be applied to the bits of the dog (hereinafter, basic punctured bits), and the remaining E (not punctured) base It refers to a method for determining the structure in which the information location is arranged within the bits. If the (actual) size (E) of the rate matching set / indicated by the actual scheduling is E base In larger cases, some or all of the positions of the punctured bits may be included in the transmitted bits, and if the condition is satisfied, for the purpose of copy bits (E base -The use of (E bits) may be permitted.

[0421] Figure 24 schematically shows an example in which the basic puncturing method is applied. In Figure 24, E is applied according to the first condition. base (FG 401) and N base (FG 403) is determined, and E is in reverse order of puncturing order. base The most reliable K bit positions are mapped to information bits (FG 402) in the order of puncturing order. base -E base (=P base ) bit positions (FG 404, basic punctured bits) can be viewed as having puncturing applied, and may be considered for transmission / reception depending on the actual scheduling settings / instructions, and may also play the role of a copy bit (FG 405) if the conditions are satisfied.

[0422] Meanwhile, N base -E base Based on P base When N is determined, base and E base At least one of the methods described above may be used for decision making.

[0423] ii) The basic shortening method is E, which is the basic encoding structure. base Wow N base When given (according to at least one of the previously described Methods), N is in reverse order of puncturing order. base -E base A number less than or equal to (hereinafter S) base ) in which shortening can be applied to the bits (hereinafter referred to as shortened bits). In addition, E is applied in the reverse order of the puncturing bits in the positions of the remaining bits excluding the shortened bit positions. baseThe most reliable K bit positions in the bit positions are mapped to information bits. In this case, if N base >E base +S base If the condition is satisfied, N is the order of the puncturing bits. base -E base -S base The position of can be set to be a puncturing bit. If the size of rate matching set / indicated by actual scheduling is E base In larger cases, some or all of the positions of the punctured bits may be included in the transmitted bits and, if the conditions are met, the bits may be allowed to be used for copy bit purposes, while the positions of the shortened bits may be determined not to be included in the transmitted bits at all and not to be used for copy bit purposes.

[0424] Figure 25 schematically shows an example in which the basic shortening method is applied. In Figure 25, E according to the first condition base (FG 501) and N base (FG 502) is determined, and S is in reverse order of puncturing order. base The bit position of the dog (FG 503) is determined by the shortened bit position (FG 504). In addition, E is determined in the reverse order of the puncturing order, excluding the shortened bit position. base The most reliable K bit positions are mapped to information bits (FG 505) in the order of puncturing order. base -E base -S base (=P base) bit positions can be seen as having puncturing applied (FG 506), and may be considered for transmission / reception depending on the actual scheduled settings / instructions, and may also act as copy bits (FG 507) if the conditions are satisfied. On the other hand, the shortened bit (FG 504) can be assumed not to be transmitted / received at all times regardless of the actual scheduled settings / instructions, and can also be determined not to act as copy bits.

[0425] i) Basic puncturing and ii) Basic shortening may have different benefits depending on the conditions under which transmission and reception are performed. For example, when i) Basic puncturing is applied, it can generally show higher performance at low code rates. Furthermore, if retransmission based on the IR-polar structure is supported, it can be expected to have a performance benefit in that the positions of bits with higher reliability can be utilized when retransmission(s) occur. On the other hand, ii) Basic shortening may show higher performance at high code rates and may be advantageous when the transmission and reception channel environment is suitable for supporting high code rates or when the retransmission process is not supported.

[0426] Accordingly, according to one embodiment, a method for selecting / applying i) a basic puncturing method / ii) a basic shortening method is proposed.

[0427] (Alt 3-1) Single application of basic puncturing method

[0428] When determining the basic encoding structure, the basic rate matching method can be set to apply a single basic puncturing scheme. This provides a structure advantageous for low-code-rate transmissions requiring high reliability. It can also provide higher decoding performance in situations where retransmissions occur, without requiring separate signaling overhead.

[0429] (Alt 3-2) Single application of the basic shortening method

[0430] When determining the basic encoding structure, the default rate matching method can be set to apply a single default shortening method. This can be used to ensure high decoding performance in initial transmission situations where a high code rate is applied to support the target requirement of high data rates, without requiring separate signaling overhead.

[0431] (Alt 3-3) Supports both basic puncturing and basic shortening methods.

[0432] When determining the basic encoding structure, the default rate matching method can be determined by supporting both the default puncturing method and the default shortening method, and the method applied can be determined based on the first condition. This can be intended to enhance the operational efficiency and performance of the transmitter and receiver by applying the appropriate default rate matching technique for the appropriate situation. For example, the first condition for determining the default rate matching method can use one or more of the following options in combination.

[0433] (Option 3-3-1)

[0434] The default rate matching method can be set or specified by the base station. For example, either the default puncturing method or the default shortening method can be explicitly configured / specified by the base station via RRC, MAC CE, and / or DCI, and the terminal can determine and apply the default rate matching method based on the received information. This is advantageous in that it allows the base station to select an appropriate default rate matching method, thereby providing the ability to control the wireless communication channel environment and the characteristics and requirements of the data to be transmitted and received.

[0435] (Option 3-3-2)

[0436] The basic rate matching method is R base It can be determined based on the method(s) suggested in option 1-2 of Method 1. Specifically, R base If it is determined, the determined R base The basic rate matching method applied to transmission and reception can be determined based on this. For example, two R base If one of the values ​​can be selected, the first R for a particular transmission base If the use of R2 is decided, the basic puncturing method is applied. base If the use of R is decided, the application of the basic shortening method can be determined. Or, the decided R base The value of R is a specific threshold value set / defined to determine the default rate matching. RM-th) can be determined to apply the default puncturing method, otherwise the default shortening method is applied. This is determined by other elements (i.e. E) that make up the encoding basic structure. base and N base ) to increase mutual efficiency by applying the same criteria as R base When determined based on the code rates that can be supported for the target transmission and reception, it provides an advantageous effect in that a rate matching method that is advantageous to the code rate situation considered in the design can be set as the default rate matching method. In addition, the benefit of signaling overhead reduction can be obtained in that separate explicit signaling is not required.

[0437] [Method 4] The input sequence is determined based on the first condition and encoding basic structure.

[0438] The proposed method may include a specific method for determining the elements of the first condition and the encoding basic structure that serve as the basis for determining the input sequence for generating the entire coded bit and each partial coded bit, and generating the input sequence based on the method. For example, the input sequence determination in Method 4 may be performed based on the determination of the basic encoding structure according to at least one of Methods 1 to 3 described above.

[0439] The method of determining the input sequence proposed below considers a method of determining the input sequence input to the encoder to generate the entire coded bit in a structure such as IR-polar. Specifically, the size of the entire coded bit is N T When the length of the input sequence is NT , and each bit of the input sequence is composed of a bit position where information is placed (hereinafter referred to as information bit), a bit position where information is copied (or repeated) and placed (hereinafter referred to as copy bit), and other bit positions (hereinafter referred to as frozen bit). The method for determining the input sequence may include a method for determining the positions of the information bit, frozen bit, and copy bit.

[0440] The proposed input sequence determination method may have different detailed operations depending on the determination of the basic rate matching method, which is one of the elements of the encoder's basic structure.

[0441] When the basic puncturing method described in Method 3 is used as the basic rate matching method, E base The input sequence can be determined by determining the basic information bit position based on the determined basic information bit position and sequentially considering the larger mother code sizes to determine the copy bit position. As a specific example, based on the set / indicated first condition and the determined encoding basic structure, the method for determining the input sequence can follow the sequential steps below. The steps below are a structure for explaining the proposed method, and can be applied in other forms (e.g., sequential steps of other expressions that produce the same effect) as long as the idea of ​​the proposed method is maintained.

[0442] - Step 0: N base E in reverse order of puncturing order in the size mother code base Mapping information to K best reliable locations based on input locations

[0443] - Step 1: N1=E base & N2=N base set up

[0444] - Step 2: Based on the N1 value, K best reliable bit indices are selected in reliability order as a0, a1, ..., a K-1 is set to (e.g., a i is a i+1 bit) with higher reliability

[0445] - Step 3: Based on N2, K best reliable bit indices are selected in puncturing order b0, b1, ..., b K-1 is set to (e.g., b i is b i+1 bits that can be punctured earlier)

[0446] - Step 4: b0, b1, ..., b K-1 belongs to a0, a1, ..., a K-1 Let Q be the number of indices that do not belong to b0, ..., b Q-1 a sequentially at the bit index of K-Q , ..., a K-1 Mapping information (e.g., the default rate matching size E base By following {a0, a1, ..., a}, there are Q bit positions that can potentially be punctured. K-1} Among them, Q bits with the lowest reliability are a K-Q , ..., a K-1 Select and copy and map again)

[0447] - Step 5: If 2*N2≤ N T In this case, update N1=2*N1, N2=2*N2 and repeat the operation from Step 2.

[0448] If 2*N2> N T If so, the input sequence decision process is terminated.

[0449] Figure 26 schematically shows an example of input sequence determination when the basic puncturing method is applied. In Figure 26, the transmitter and receiver are in the reverse order of the puncturing order. base Within the scope of (FG 603) E base Among the positions of input bits (FG 601) determined based on the highest reliability criterion, the information bit position(s) are determined and the information bit(s) are placed there (FG 602). After that, N base Based on (FG 603), the location(s) of the copy bit are determined and a portion of the copied / repeated information bit is placed in these locations (FG 604). After that, the transmitting and receiving end N base Based on the mother code size that increases by two times from , the location(s) of the new copy bit(s) are determined, and the appropriate information bit(s) are copied / repeatedly placed in the location of each copy bit(s) (FG 605). The above processes are performed when the mother code size is N. T It is performed until it reaches .

[0450] Meanwhile, there may be various ways to implement encoding of a sequence such as Fig. 26. As an example, for a given information bit K, the mother code size N is N. T It is possible to generate an input bit sequence containing copy (redundancy) bits until reaching N . For example, depending on the given redundancy level, T can be determined, for example, as in Fig. 26, N base , 2 1 * N base , 22 *N base There can be a total of three coded bits of RV. For example, N T After performing one encoding through the input bit sequence and encoding matrix corresponding to , a method of transmitting (self-decodable) partial coded bits as in Fig. 21 may be used. Or, N T After generating the input bit sequence corresponding to N base After performing the initial transmission by selecting and encoding, N if necessary T 2 in the input bit sequence corresponding to 1 * N base A method may be used to perform retransmission by selecting and encoding, but retransmitting the remaining coded bits excluding the part that was already transmitted in the initial transmission. For example, N T The entire input bit sequence may be encoded at once or encoded separately for each RV portion, which may vary depending on the implementation. Such implementation details may also be applied to FIG. 27 described below.

[0451] When the basic shortening method described in Method 3 is used as the basic rate matching method, the shortened bit position is first fixed to the position of the frozen bit, and E is set on the positions of the remaining bits. baseThe input sequence can be determined by determining the basic information bit position based on the determined basic information bit position and sequentially considering the larger mother code sizes to determine the copy bit position. As a specific example, based on the set / indicated first condition and the determined encoding basic structure, the method for determining the input sequence can follow the sequential steps below. The steps below are a structure for explaining the proposed method, and can be applied in other forms (e.g., sequential steps of other expressions that produce the same effect) as long as the idea of ​​the proposed method is maintained.

[0452] - Step 0A: N base S in reverse order of puncturing order in the mother code of size base Set the input position of the dog to shortened bits

[0453] - Step 0B: N base E in reverse order of puncturing order in the size mother code base +S base Information is mapped to the K best reliable locations based on the bits that were not designated as shortened bits in the previous step among the input locations.

[0454] - Step 1: N1=E base & N2=N base set up

[0455] - Step 2: Based on the N1 value, among the bits that were not designated as shortened bits in the previous step, K best reliable bit indices are selected in reliability order as a0, a1, ..., a K-1 is set to (e.g., a i is a i+1bit) with higher reliability

[0456] - Step 3: Based on N2, among the bits that were not designated as shortened bits in the previous step, K best reliable bit indices are selected in puncturing order as b0, b1, ..., b K-1 is set to (e.g., b i is b i+1 bits that can be punctured earlier)

[0457] - Step 4: b0, b1, ..., b K-1 belongs to a0, a1, ..., a K-1 Let Q be the number of indices that do not belong to b0, ..., b Q-1 a sequentially at the bit index of K-Q , ..., a K-1 Mapping information (e.g., applying shortening and matching the default rate size E) base By following {a0, a1, ..., a}, there are Q bit positions that can potentially be punctured. K-1} Among them, Q bits with the lowest reliability are a K-Q , ..., a K-1 Select and copy and map again)

[0458] - Step 5: If 2*N2≤ N T In this case, update N1=2*N1, N2=2*N2 and repeat the operation from Step 2.

[0459] If 2*N2> N T If so, the input sequence decision process is terminated.

[0460] Figure 27 schematically shows an example of input sequence determination when the basic shortening method is applied. In Figure 27, the transmitter and receiver are S baseThe positions of the shortened bits (FG701) determined based on the shortened bits are set as shortened bits (FG702). Afterwards, the transmitting and receiving end puncture N in reverse order of the puncturing order, excluding the shortened bit positions. base Within the scope of (FG 705) E base Among the positions of input bits determined based on (FG 703), the information bit position(s) are determined based on the highest reliability criterion and the information bit(s) are placed there (FG 704). After that, N base Based on (FG 705), the location(s) of the copy bit are determined and a portion of the copied / repeated information bit is placed in these locations (FG 706). After that, the transmitting and receiving end N base Based on the mother code size that increases by two times, the location(s) of the new copy bit are determined, and the appropriate information bits are copied / repeatedly placed in the location of each copy bit(s) (FG 707). The above processes are performed when the mother code size is N. T It can be performed until it reaches .

[0461] In the above examples, for convenience, it is assumed that the decoding order and puncturing order are the same, but the proposed method can be applied even in cases where they are different (for example, when the coded bits generated through the encoding process are subjected to an interleaving process prior to the rate matching operation). In this case, E is considered for selecting the information bit. base The section corresponding to the bit may show a non-contiguous arrangement in the decoding order.

[0462] The proposed method is expected to have an advantageous effect as a technology that can judge and decide the structure in which the entire coded bit is generated without ambiguity between the transmitter and receiver in the initial transmission and all retransmission(s) stages by fixing the form of the input sequence when a retransmission situation may occur, such as a traffic channel using the structure of IR-polar, and the generation of the entire coded bit is affected by the rate matching pattern of the initial transmission (i.e., transmission of bits that are first selected in the reverse order of the puncturing order).

[0463] When the proposed methods are applied to a wireless communication system, such as 6G, where transmission and reception between a base station and a terminal are controlled by an upper node (e.g., a base station), examples of the operations of the terminal and the base station are described. In the following description, the entity controlling transmission and reception between two nodes is described using the term "base station." However, even if the entity is not a base station, for example, if a specific node performs the role of controlling transmission and reception between two nodes, the operations described in the examples below can be applied.

[0464] Figure 28 is a drawing for explaining terminal operation according to one embodiment.

[0465] Referring to FIG. 28, the terminal can acquire configuration information related to transmission and reception of a channel to which the proposed methods are applied from the base station (FG 801). At this time, the configuration information may include all or part of the information of the first condition. Thereafter, the terminal can receive instruction information for DL ​​reception or UL transmission from the base station through a scheduling grant (FG 802 or FG 812). At this time, the scheduling grant may include all or part of the information of the first condition. If transmission and reception resources are semi-statically configured based on the configuration information (FG 801) without a scheduling grant and periodic or semi-persistent transmission and reception is performed (e.g., CG / SPS), the scheduling grant acquisition procedure (FG 802 and FG 812) may be omitted.

[0466] When DL reception of a terminal is scheduled, the terminal can perform reception of a DL traffic channel (e.g., PDSCH) based on the scheduling information (FG 803). The terminal performs decoding on the received DL traffic channel, and the decoding is performed based on an encoding base structure, and the encoding base structure can be determined based on the received configuration information and / or a first condition provided through a DL grant (FG 804). The decoding result, if configured / instructed, can be reported to the base station via a UL feedback channel (FG 805).

[0467] When the UL transmission of the terminal is scheduled, the terminal performs an encoding process on the data in order to perform the UL transmission, and at this time, the encoding is performed based on an encoding basic structure (base encoding structure), and at this time, the encoding basic structure can be determined based on the first condition provided through the above-described received configuration information and / or UL grant (FG 813). Thereafter, the terminal can transmit the coded bit generated through the encoding process through a UL traffic channel (e.g., PUSCH) based on the scheduling information received by the terminal (FG 814).

[0468] The method described in the example of FIG. 28 may be performed by the device (200) of FIG. 3. For example, one or more processors (202) of the device (200) of FIG. 3 may be configured to perform the operation according to FIG. 28. Furthermore, one or more memories (204) of the device (200) may store instructions for performing the method in the example of FIG. 28 or in various examples of the present specification described above when executed by one or more processors (202).

[0469] Figure 29 is a diagram for explaining the operation of a base station according to one embodiment.

[0470] The base station can provide the terminal with configuration information related to transmission and reception of a channel to which the proposed methods are applied (FG 901). At this time, the configuration information may include all or part of the information of the first condition. Thereafter, the base station can transmit instruction information for DL ​​reception or UL transmission to the terminal through a scheduling grant (FG 902 or FG 912). At this time, the scheduling grant may include all or part of the information of the first condition. If the transmission and reception resources are semi-statically configured based on the configuration information (FG901) without a scheduling grant and periodic or semi-persistent transmission and reception are performed (e.g., CG / SPS), the scheduling grant transmission procedure (FG 902 and FG 912) may be omitted.

[0471] When a base station schedules a terminal for DL ​​reception, the base station performs an encoding process on the data in order to perform DL transmission. At this time, encoding is performed based on an encoding basic structure (base encoding structure). At this time, the encoding basic structure can be determined based on the first condition provided through the above-described received configuration information and / or DL ​​grant (FG 903). Thereafter, the base station can transmit the coded bit generated through the encoding process through a DL traffic channel (e.g., PDSCH) based on the scheduling information transmitted by the base station (FG 904). Thereafter, if the base station has configured / instructed the terminal, the base station can report the decoding result from the terminal through a UL feedback channel (FG 905).

[0472] When a base station schedules UL transmission to a terminal, the base station can perform reception of a UL traffic channel (e.g., PUSCH) based on the transmitted scheduling information (FG 913). Thereafter, the base station performs decoding on the received UL traffic channel, and the decoding is performed based on an encoding base structure, and the encoding base structure can be determined based on the transmitted configuration information and / or a first condition provided through a DL grant (FG 914).

[0473] The method described in the example of FIG. 29 may be performed by the device (200) of FIG. 3. For example, one or more processors (202) of the device (200) of FIG. 3 may be configured to perform the operation according to FIG. 29. Furthermore, one or more memories (204) of the device (200) may store instructions for performing the method in the example of FIG. 29 or in various examples of the present specification described above when executed by one or more processors (202).

[0474] FIG. 30 is a diagram for explaining signal transmission and reception between terminal base stations according to one embodiment.

[0475] Figure 30 illustrates a situation in which the proposed method is applied to DL traffic transmission with retransmission support. If a base station has DL data to transmit, it can determine an encoding basic structure (FG 1001) based on the first condition, and perform an encoding process for transmission based on the encoding basic structure (FG 1003). Thereafter, the base station can perform an initial transmission operation to transmit the encoded coded bits to the terminal via the PDSCH (FG 1004). The terminal can receive the PDSCH (FG 1004) transmitted by the base station and perform decoding (FG 1005) based on the encoding basic structure (FG 1002). At this time, the encoding basic structure (FG 1002) used by the terminal is generated based on the same first condition as that of the base station, and therefore, the base station and the terminal can have the same encoding basic structure. If the terminal's decoding (FG 1005) fails, the terminal can report NACK information to the base station (FG 1006). The base station, which receives the NACK reporting (FG 1006) from the terminal, can retransmit the previously transmitted DL data to the terminal. In the retransmission step, the base station can perform encoding (FG 1007) for retransmission by applying the same encoding basic structure (FG 1001) used in the initial transmission. Thereafter, the base station can perform a retransmission operation to transmit the encoded coded bits to the terminal via the PDSCH (FG 1008).The terminal can receive the PDSCH (FG 1008) transmitted by the base station and perform decoding (FG 1009) based on the encoding basic structure (FG 1002) used in the initial transmission phase. If the terminal's decoding (FG 1009) is successful, the terminal can report ACK information to the base station (FG 1010).

[0476] In the exemplary operation of Fig. 20, the process of determining the encoding basic structure and performing encoding for transmission may include the processes described in Fig. 23.

[0477] When the proposed methods are applied to transmission and reception that support the retransmission process, they show an advantage in that they prevent ambiguity between the transmitting and receiving ends, thereby always supporting encoding and decoding even when a situation occurs in which the terminal does not recognize the scheduling information of one or more of the initial transmission or retransmission(s). More specifically, as in the existing polar code, the constraints on the selection of selectable information bit positions may vary depending on the rate matching applied to each transmission. Therefore, decoding constraints may occur in situations in which the terminal cannot acquire the rate matching status of the privileged transmission, such as DCI missing. On the other hand, when the proposed method is applied, it provides a criterion independent of each rate matching actually applied, and the information bit positions are determined based on this, thereby ensuring robust performance in situations such as DCI missing.

[0478] Fig. 31 is a schematic illustration to illustrate the impact of different rate matching applied in the initial transmission stage when the IR-polar structure to which the proposed methods are applied is used. In Fig. 31, (a) and (b) assume the transmission and reception of the same information, and the rate matching size in the initial transmission (1st transmission) stage is E1 (FG 1105) in the example of (a) and E3 (FG 1115) in the example of (b), and E1 and E3 show situations where different values ​​are set / indicated. In this way, the determined input sequence form of the initial transmission to which the rate matching size of E1 is applied (i.e., FG 1101 and FG 1103) and the determined input sequence form of the initial transmission to which the rate matching size of E3 is applied (i.e., FG 1111 and FG 1113) can be determined identically. Therefore, regardless of the actual rate matching applied, in other words, the coded bits (FG 1102 and FG 1104) in situation (a) and the coded bits (FG 1112 and FG 1114) in situation (b) have the same result. In this situation, even if the receiver is missing the scheduling information for the initial transmission and does not know which rate matching was applied in the initial transmission phase, the receiver can figure out the structure of the entire input sequence in the retransmission phase, which can provide a structure advantageous for decoding.

[0479] Figure 32 illustrates a flowchart of a method performed by a terminal according to one embodiment. Since Figure 32 is an implementation example of at least some of the aforementioned Methods 1 to 4, the previously described description may be referred to to aid in understanding Figure 32, even without separate mention.

[0480] Referring to FIG. 32, a terminal may receive scheduling information for uplink scheduling or downlink scheduling (3205). The scheduling information may be configured in, for example, a downlink control information (DCI) format and may be received from a base station via a physical downlink control channel (PDCCH).

[0481] The terminal may perform transmission or reception on a data channel based on the scheduling information (3210). For example, the terminal may transmit an uplink data channel (e.g., PUSCH) based on the uplink scheduling information or receive a downlink data channel (e.g., PDSCH) based on the downlink scheduling information. However, the target of transmission and reception is not limited to the DL / UL data channel, and may include at least one of the DL / UL control channel and / or the DL / UL reference signal. For example, the DL / UL data channel may be transmitted and received together with the DL / UL DMRS.

[0482] The terminal can assume / determine the basic coding structure / setting as described above and perform transmission / reception of data channels based on it.

[0483] The above data channel may include coded bits encoded based on polar coding for an input bit sequence including K information bits. The input bit sequence may include N bits, and N may be an integer greater than or equal to K.

[0484] For example, the positions where the K information bits among the N bits are to be mapped are the basic coding rate (R) set for the polar coding. base ) can be determined based on.

[0485] The above basic coding rate (R base ) can be determined based on the above scheduling information.

[0486] The terminal determines the basic coding rate (R) based on the MCS (modulation and scheme) information and resource allocation information included in the scheduling information. base ) can be determined.

[0487] The above terminal has the basic coding rate (R base ) is set for the polar coding based on the basic rate matching output sequence length (E base ) and determine the basic rate matching output sequence length (E base ) can determine the locations to which the K information bits among the N bits are to be mapped.

[0488] The above terminal has the basic coding rate (R base ) is set for the polar coding based on the basic rate matching output sequence length (E base ) and determine the basic rate matching output sequence length (E base ) is set for the polar coding based on the basic input sequence length (N base ) is determined, but the basic input sequence length (N base ) is the basic rate matching output sequence length (E base ) can be the smallest number among the powers of 2.

[0489] The above terminal has the basic coding rate (R base) can be determined as puncturing or shortening for the basic rate matching method set for the polar coding.

[0490] The terminal may perform retransmission or rereception for the data channel. The same basic coding settings may be used for transmission and retransmission for the data channel, or for reception and rereception for the data channel.

[0491] The same basic coding settings as above are applied to the basic rate matching output sequence length (E base ), the basic input bit sequence length (N base ) or may include at least one of the basic rate matching methods.

[0492] Transmission or reception on the above data channel may relate to a first redundancy version, and retransmission or rereception on the above data channel may relate to a second redundancy version.

[0493] Figure 33 illustrates a flowchart of a method performed by a base station according to one embodiment. Since Figure 33 is an implementation example of at least some of Methods 1 to 4 described above, the previously described description may be referred to to aid in understanding Figure 33, even if not otherwise stated.

[0494] Referring to FIG. 33, a base station can transmit scheduling information for uplink scheduling or downlink scheduling (3305). The scheduling information can be configured in, for example, a downlink control information (DCI) format and transmitted to a terminal via a physical downlink control channel (PDCCH).

[0495] The base station may perform transmission or reception for a data channel based on the scheduling information (3310). For example, the base station may receive an uplink data channel (e.g., PUSCH) based on the uplink scheduling information, or transmit a downlink data channel (e.g., PDSCH) based on the downlink scheduling information. However, the target of transmission and reception is not limited to the DL / UL data channel, and may include at least one of the DL / UL control channel and / or the DL / UL reference signal. For example, the DL / UL data channel may be transmitted and received together with the DL / UL DMRS.

[0496] The base station can assume / determine the basic coding structure / setting as described above and perform transmission / reception of data channels based on it.

[0497] The above data channel may include coded bits encoded based on polar coding for an input bit sequence including K information bits. The input bit sequence may include N bits, and N may be an integer greater than or equal to K.

[0498] For example, the positions where the K information bits among the N bits are to be mapped are the basic coding rate (R) set for the polar coding. base ) can be determined based on.

[0499] The above basic coding rate (R base ) can be directed based on the above scheduling information.

[0500] The base station determines the basic coding rate (R) based on the MCS (modulation and scheme) information and resource allocation information included in the scheduling information. base ) can be instructed to the terminal.

[0501] The above base station, the basic coding rate (R base) is set for the polar coding based on the basic rate matching output sequence length (E base ) and determine the basic rate matching output sequence length (E base ) can determine the locations to which the K information bits among the N bits are to be mapped.

[0502] The above base station, the basic coding rate (R base ) is set for the polar coding based on the basic rate matching output sequence length (E base ) and determine the basic rate matching output sequence length (E base ) is set for the polar coding based on the basic input sequence length (N base ) is determined, but the basic input sequence length (N base ) is the basic rate matching output sequence length (E base ) can be the smallest number among the powers of 2.

[0503] The above base station has the basic coding rate (R base ) can be determined as puncturing or shortening for the basic rate matching method set for the polar coding.

[0504] The base station may perform retransmission or rereception for the data channel. The same basic coding settings may be used for transmission and retransmission for the data channel, or for reception and rereception for the data channel.

[0505] The same basic coding settings as above are applied to the basic rate matching output sequence length (E base ), the basic input bit sequence length (N base ) or may include at least one of the basic rate matching methods.

[0506] Transmission or reception on the above data channel may relate to a first redundancy version, and retransmission or rereception on the above data channel may relate to a second redundancy version.

[0507] The embodiments described above are combinations of components and features of the present disclosure in a predetermined form. Each component or feature should be considered optional unless explicitly stated otherwise. Each component or feature may be implemented without being combined with other components or features. Furthermore, it is also possible to form embodiments of the present disclosure by combining some components and / or features. The order of operations described in the embodiments of the present disclosure may be changed. Some components or features of one embodiment may be included in another embodiment or may be replaced with corresponding components or features of another embodiment. It is self-evident that claims that do not have an explicit citation relationship in the patent claims may be combined to form embodiments or incorporated as new claims through post-application amendments.

[0508] It will be apparent to those skilled in the art that the present disclosure may be embodied in other specific forms without departing from the scope of the present disclosure. Therefore, the above detailed description should not be construed as limiting in any respect, but rather as illustrative. The scope of the present disclosure should be determined by a reasonable interpretation of the appended claims, and all modifications within the scope of equivalents of the present disclosure are intended to be included within the scope of the present disclosure.

[0509] The present disclosure may be used in a terminal, base station, or other equipment of a wireless mobile communication system.

Claims

In a method performed by a terminal, Receiving scheduling information for uplink scheduling or downlink scheduling; and Including performing transmission or reception on a data channel based on the above scheduling information, The above data channel comprises coded bits encoded based on polar coding for an input bit sequence containing K information bits, The above input bit sequence contains N bits, wherein N is an integer greater than or equal to K, The positions where the K information bits among the N bits are to be mapped are the basic coding rate (R) set for the polar coding. base ) is determined based on the method. In the first paragraph, The above basic coding rate (R base ) is determined based on the above scheduling information. In the second paragraph, The terminal determines the basic coding rate (R) based on the MCS (modulation and scheme) information and resource allocation information included in the scheduling information. base ) to determine the method. In the first paragraph, the terminal, The above basic coding rate (R base ) is set for the polar coding based on the basic rate matching output sequence length (E base ) and decide, The above basic rate matching output sequence length (E base ) to determine the locations to which the K information bits among the N bits are to be mapped. In the first paragraph, the terminal, The above basic coding rate (R base ) is set for the polar coding based on the basic rate matching output sequence length (E base ) and decide, The above basic rate matching output sequence length (E base ) is set for the polar coding based on the basic input sequence length (N base ) to decide, The above basic input sequence length (N base ) is the basic rate matching output sequence length (E base ) is the smallest number among the powers of 2. In the first paragraph, The above terminal has the basic coding rate (R base ) to determine the basic rate matching method set for the polar coding as puncturing or shortening. In the first paragraph, Further comprising performing retransmission or rereception for the above data channel, A method wherein the same basic coding settings are used in transmission and retransmission for the data channel or in reception and rereception for the data channel. In paragraph 7, The same basic coding settings as above are applied to the basic rate matching output sequence length (E base ), the basic input bit sequence length (N base ) or at least one of the basic rate matching methods. In paragraph 7, A method wherein transmission or reception on the data channel relates to a first redundancy version, and retransmission or rereception on the data channel relates to a second redundancy version. A non-transitory computer-readable recording medium having recorded thereon a program for performing the method described in claim 1. In the device, at least one processor; and At least one memory configured to store instructions that are executed by said at least one processor to cause said at least one processor to perform operations, The operations of the above processor are: Receiving scheduling information for uplink scheduling or downlink scheduling; and Including performing transmission or reception on a data channel based on the above scheduling information, The above data channel comprises coded bits encoded based on polar coding for an input bit sequence containing K information bits, The above input bit sequence contains N bits, wherein N is an integer greater than or equal to K, The positions where the K information bits among the N bits are to be mapped are the basic coding rate (R) set for the polar coding. base ) is determined based on the device. In paragraph 11, Including a transmitter and receiver, The above device is a terminal operating in a wireless communication system. In paragraph 11, The above device is a processing device configured to control a terminal operating in a wireless communication system. In a method performed by a base station, Transmitting scheduling information for uplink scheduling or downlink scheduling; and Including performing transmission or reception on a data channel based on the above scheduling information, The above data channel comprises coded bits encoded based on polar coding for an input bit sequence containing K information bits, The above input bit sequence contains N bits, wherein N is an integer greater than or equal to K, The positions where the K information bits among the N bits are to be mapped are the basic coding rate (R) set for the polar coding. base ) is determined based on the method. At the base station, at least one processor; and At least one memory configured to store instructions that are executed by said at least one processor to cause said at least one processor to perform operations, The operations of the above processor are: Transmitting scheduling information for uplink scheduling or downlink scheduling; and Including performing transmission or reception on a data channel based on the above scheduling information, The above data channel comprises coded bits encoded based on polar coding for an input bit sequence containing K information bits, The above input bit sequence contains N bits, wherein N is an integer greater than or equal to K, The positions where the K information bits among the N bits are to be mapped are the basic coding rate (R) set for the polar coding. base ) is determined based on the base station.

Images