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

Abstract

An apparatus according to an embodiment of the present disclosure may: determine an index of a start bit of a first redundancy version (RV) from among a plurality of RVs in a bit sequence coded on the basis of polar coding; and transmit a signal including coded bits related to the first RV on the basis of the index of the start bit of the first RV, wherein the index of the start bit of the first RV may be determined on the basis of at least one of the length (Ebase) of a base rate matching output sequence for polar coding or the length (NT) of the coded bit sequence.

Description

A method performed by a terminal or network in a wireless communication system and an apparatus for the same

[0001] The present disclosure relates to a wireless communication system, and more specifically, to a method for transmitting or receiving uplink / downlink signals between terminals or networks in a wireless communication system and an apparatus for the same.

[0002] The 5G mobile communication system is a successor technology to LTE (Long Term Evolution) and is a new clean-slate type of mobile communication system characterized by high performance, low latency, and high availability. In the case of 5G NR, all available spectrum resources can be utilized, ranging 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. Based on the underlying technology of 5G mobile communication, 6G mobile communication systems are being developed.

[0003] In 5G NR (New Radio) systems, various channel coding schemes have been introduced to ensure the reliability of wireless transmission. Polar Coding has been applied to the control channel, and LDPC (Low Density Parity Check) Coding has been applied to the data channel. As such, the Polar code applied to the 5G NR control channel is designed with a structure that supports only single transmission without retransmission.

[0004] In next-generation wireless communication systems including 6G, polar codes can be introduced not only to control channels but also to various other DL / UL channel signals.

[0005] The technical problem to be solved in the present disclosure is to provide a method for efficiently performing a wireless signal transmission and reception process and an apparatus for doing so. A more efficient channel coding structure may be provided for the transmission and reception of wireless signals. For example, a polar coding scheme that supports incremental redundancy (IR) for various DL / UL channel signals (e.g., data channel and / or PBCH) and a scheme for determining coded bits corresponding to each redundancy version (RV) may be provided.

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

[0007] A method performed in a first device according to one aspect of the present disclosure comprises: determining an index of a start bit of a first RV among a plurality of redundancy versions (RVs) within a bit sequence coded based on polar coding; and transmitting a signal comprising coded bits associated with the first RV based on the index of the start bit of the first RV, wherein the index of the start bit of the first RV is the length (E) of a base rate matching output sequence for polar coding. base ) or the length of the above-mentioned coded bit sequence (N T It can be determined based on at least one of ).

[0008] The index of the start bit of the first RV above is N T It is determined based on an integer multiple of / M, where M may represent the number of the plurality of RVs.

[0009] The index of the start bit of the first RV above is the E base or the above N T It can be determined by applying a shifting value to a specific bit index calculated based on.

[0010] The above shifting value may be a shifting value specific to the first RV or a shifting value common to the plurality of RVs.

[0011] The above shifting value may be related to the shortening length in the rate matching process.

[0012] Length of the above coded bit sequence (N T ) is the length (E) of the above basic rate matching output sequence. base ), basic input bit sequence length (N base It can be determined based on at least one of the length of the information bit sequence (K) or the code rate before coding.

[0013] The index of the start bit of the first RV above is the E base It can be determined as an integer multiple of the Q value determined based on.

[0014] The above Q value is the above E base Same as, or the above E base A specific offset (Δ) in RV RV It is the sum of ), or among multiple candidate Q values, the above E base It can be a Q value linked to.

[0015] In the above coded bit sequence, the index (k1) of the last bit of the first RV is determined based on min (k0+E-1, k2), where k0 is the index of the start bit, E is the length of the rate-matching output sequence of the coded bits related to the first RV, and k2 is the length of the basic input bit sequence (N base It may be a boundary value calculated based on ).

[0016] The above signal may include a PBCH (physical broadcast channel).

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

[0018] According to another aspect of the present disclosure, a method performed in a second device comprises: receiving a signal comprising coded bits associated with a first RV among a plurality of redundancy versions (RVs); and decoding said coded bits based on polar coding, wherein the index of a start bit at which the coded bits associated with the first RV begin within a sequence of coded bits associated with the plurality of RVs is the length (E) of a base rate matching output sequence for said polar coding. base ) or the length of the above-mentioned coded bit sequence (N T It can be determined based on at least one of ).

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

[0020] A first device according to another aspect of the present disclosure comprises: at least one processor; and at least one memory configured to store instructions that cause the at least one processor to perform operations by being executed by the at least one processor, wherein the operations of the processor include determining the index of a start bit of a first RV among a plurality of redundancy versions (RVs) within a bit sequence coded based on polar coding; and transmitting a signal comprising coded bits associated with the first RV based on the index of the start bit of the first RV, wherein the index of the start bit of the first RV is the length (E) of a base rate matching output sequence for the polar coding. base) or the length of the above-mentioned coded bit sequence (N T It can be determined based on at least one of ).

[0021] The first device may further include a transmitter and receiver.

[0022] The first device mentioned above may be a terminal or a base station.

[0023] A second device according to another aspect of the present disclosure comprises: at least one processor; and at least one memory configured to store instructions that cause the at least one processor to perform operations by being executed by the at least one processor, wherein the operations of the processor include receiving a signal comprising coded bits associated with a first RV among a plurality of redundancy versions (RVs); and decoding the coded bits based on polar coding, and the index of the start bit at which the coded bits associated with the first RV begin within the sequence of coded bits associated with the plurality of RVs is the length (E) of the base rate matching output sequence for the polar coding. base ) or the length of the above-mentioned coded bit sequence (N T It can be determined based on at least one of ).

[0024] According to the present disclosure, signal transmission and reception can be performed efficiently in a wireless communication system. According to one embodiment, polar coding may be applied to various DL / UL channel signals (e.g., data channel and / or PBCH), and by supporting incremental redundancy (IR), channel coding performance and DL / UL channel transmission and reception performance may be improved. In addition, the starting point of the coded bit corresponding to each redundancy version (RV) may be determined to maximize the gain according to rate matching characteristics.

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

[0026] FIG. 1 illustrates an exemplary flexible network topology to which some of the examples of the present specification may be applied.

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

[0028] FIG. 3 illustrates an example of a wireless device that can be applied to the present disclosure.

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

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

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

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

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

[0034] FIG. 9 illustrates a beam management procedure applicable to the present disclosure.

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

[0036] FIG. 11 illustrates a time / frequency resource for a sensing operation according to one embodiment of the present specification.

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

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

[0039] Figure 14 is a diagram illustrating the BG structure of 5G NR.

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

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

[0042] Figure 17 is a diagram illustrating the structure in which sub-block interleavers and rate matching of a polar code are performed.

[0043] Figure 18 is a diagram illustrating the channel interleaver of a polar code.

[0044] Figure 19 is a diagram illustrating the concept of IR (Incremental Redundancy)-polar coding.

[0045] Figure 20 is a diagram illustrating the concept of IF (Incremental Freezing)-polar coding.

[0046] Figure 21 illustrates an example of channel encoding / decoding based on a PAC code.

[0047] Figure 22 is a diagram illustrating a GCC-based polar code.

[0048] FIG. 23 illustrates a brief example of an encoding structure to which the present disclosure may be applied.

[0049] Fig. 24 shows the total coded bits (N T ) An example of determining each RV starting point based on length is illustrated.

[0050] FIG. 25 illustrates examples of methods for determining the RV starting point when additional shifting is applied.

[0051] FIG. 26 shows the basic rate matching output sequence length (E base An example of determining each RV starting point based on ) is illustrated.

[0052] FIG. 27 illustrates another example of a method for determining the RV starting point when additional shifting is applied.

[0053] FIG. 28 illustrates examples of applying different RV starting point determination methods depending on the RV.

[0054] FIG. 29 illustrates an example of coded bit selection according to RV.

[0055] Figure 30 illustrates examples of W-boundary determination.

[0056] FIGS. 31 and 32 illustrate various examples of coded bit configurations based on partial wrap-around repetition.

[0057] FIGS. 33 and FIGS. 34 illustrate implementation examples using a circular buffer.

[0058] FIG. 35 illustrates an example of terminal operation according to the present disclosure.

[0059] FIG. 36 illustrates an example of base station operation according to the present disclosure.

[0060] FIG. 37 illustrates the flow of a method performed by a first device according to one embodiment of the present disclosure.

[0061] FIG. 38 illustrates the flow of a method performed by a second device according to one embodiment of the present disclosure.

[0062] In this specification, "A or B" may mean "only A," "only B," or "both A and B." Alternatively, in this specification, "A or B" may be interpreted as "A and / or B." For example, in this specification, "A, B or C" may mean "only A," "only B," "only C," or "any combination of A, B and C."

[0063] A slash ( / ) or a comma used in this specification may mean "and / or." For example, "A / B" may mean "A and / or B." Accordingly, "A / B" may mean "only A," "only B," or "both A and B." For example, "A, B, C" may mean "A, B or C."

[0064] In this specification, "at least one of A and B" may mean "only A," "only B," or "both A and B." Additionally, in this specification, the expressions "at least one of A or B" or "at least one of A and / or B" may be interpreted as synonymous with "at least one of A and B."

[0065] Additionally, in this specification, "at least one of A, B and C" may mean "only A," "only B," "only C," or "any combination of A, B and C." Also, "at least one of A, B or C" or "at least one of A, B and / or C" may mean "at least one of A, B and C."

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

[0067] In addition, terms such as "first," "second," etc. in this specification are used solely for the purpose of distinguishing one component from another and are not used to limit the components, nor are they used to limit the order or importance of the components unless specifically limited. Accordingly, a first component in one embodiment of this specification may be referred to as a second component in another embodiment, and likewise, a second component in one embodiment may be referred to as a first component in another embodiment.

[0068] In the following explanation, 'when, if, in case of' can be replaced with 'based on'.

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

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

[0071] In this specification, a Base Station (BS) is a device on the network side and may also be referred to as a second node / IAB node / x-NodeB (x-NodeB, where x may be an abbreviation related to Radio Access Technology (RAT)) / Transmission-Reception Point (TRP). A Base Station may correspond to a physical node or a logical node. A Base Station may correspond to an endpoint on the network side or an intermediate point between other endpoints. In communication between two points not limited to endpoints (including one-to-one / many-to-one / one-to-many / many-to-many communication), a Base Station may correspond to a serving node. A Base Station may be a node with a fixed location or a node with an indefinite location.

[0072] In this specification, higher layer parameters may be set for the terminal, pre-set, or pre-defined. For example, a base station may transmit higher layer parameters to the terminal. For example, the terminal may transmit parameters such as capability to the base station as higher layer parameters. For example, higher layer parameters may be transmitted via RRC (radio resource control) signaling or MAC (medium access control) signaling.

[0073] In this specification, information / state / parameters being "configured" or "pre-configured" may be interpreted as the information / state / parameters being provided / pre-provided to the terminal through pre-defined signaling (e.g., SIB, MAC, RRC) from the base station. In this specification, information / state / parameters being "defined" or "pre-defined" may be interpreted as being known or stored in advance by the base station and the terminal without signaling between the base station and the terminal.

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

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

[0076] <Symbols, Abbreviations, Terms>

[0077] - UL: Uplink

[0078] - DL: Downlink

[0079] - PDCCH: Physical Downlink Control CHannel

[0080] - PUCCH: Physical Uplink Control CHannel

[0081] - PDSCH: Physical Downlink Shared CHannel

[0082] - PUSCH: Physical Uplink Shared Channel

[0083] - TB: Transport Block

[0084] - CB: Code Block

[0085] - CBG: Code Block Group

[0086] - HARQ: Hybrid ARQ

[0087] - ACK: ACKnowledgement

[0088] - NACK: Negative ACKnowledgement

[0089] - RV: Redundancy Version

[0090] - DCI: Downlink Control Information

[0091] - UCI: Uplink Control Information

[0092] - IR: Incremental Redundancy

[0093] - IF: Incremental Freezing

[0094] - SC: Successive Cancelation

[0095] - SCL: Successive Cancelation List

[0096] - RE: Resource Element

[0097] - REG: Resource Element Group

[0098] - CCE: Control Channel Element

[0099] - AL: Aggregation Level

[0100] - RNTI: Radio Network Temporary Identifier

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

[0102] - Puncturing order: The order in which puncturing is performed first during rate matching

[0103] - Reliability order: The order in which the polarization effect is highest at the input of a polar matrix, or the order of priority in which information bits are placed.

[0104] FIG. 1 illustrates an exemplary flexible network topology to which some of the examples of the present specification may be applied.

[0105] To compensate for incomplete areas of network coverage, a network topology in which the Split Radio Access Network (RAN) is configured more flexibly and resiliently may be considered. To this end, various nodes such as IAB nodes, relays, and RF repeaters, as exemplified in Fig. 1, may be applied, and NTN may be integrated. For example, an IAB node may correspond to a node that provides wireless backhaul. For example, a relay may refer to any intermediate point, and in the case of a sidelink relay where a terminal functions as a relay, it may collectively refer to a terminal-to-network (U2N) relay and a terminal-to-terminal (U2U) relay. For example, an RF repeater may correspond to a node that performs simple signal amplification and forwarding functions, and in the case of a network-controlled repeater, it may adjust transmit / receive settings based on information provided by the network as well as signal amplification and forwarding. For example, an NTN node may correspond to a satellite or aircraft that provides NTN coverage that is difficult for a terrestrial network to provide. In addition to these examples, various intermediate points can be introduced to improve network topology.

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

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

[0108] In some examples of this specification, the description of a terminal may apply equally to an intermediate point corresponding to a terminal in relation to a network-side endpoint as well as to a user-side endpoint. Similarly, in some examples of this specification, the description of a base station may apply equally to an intermediate point corresponding to a base station in relation to a user-side endpoint as well as to a network-side endpoint. However, in most cases where there is no additional description of the operation of three or more entities, the communication entities in this specification are briefly described by the term terminal and / or base station (or first node and / or second node), wherein the term terminal and / or base station (or first node and / or second node) is interpreted to include or replace any endpoint or any intermediate point in relation to other nodes.

[0109] That is, for the sake of brevity of description in some examples of this specification, the subject of the operation may be referred to as a base station and / or terminal (or a first node and / or a second node). Additionally, the term base station and / or terminal (or a first node and / or a second node) may be interpreted or substituted as in the following examples: for example, the base station (or the first node) and the terminal (or the second node) may correspond to a first endpoint and a second endpoint, respectively; may correspond to an endpoint and an intermediate point, respectively; may correspond to an intermediate point and an endpoint, respectively; or may correspond to a first intermediate point and a second intermediate point, respectively.

[0110] In this specification, there may be no intermediate points between the base station and the terminal, or there may be one or more. If intermediate points exist, the intermediate points may correspond to IAB nodes, relays, RF repeaters, NTN (non-terrestrial network) nodes, or nodes supporting other functions. The intermediate points may be nodes with a fixed location or nodes with an indefinite location.

[0111] FIG. 2 illustrates a communication system applicable to the present disclosure.

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

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

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

[0115] FIG. 3 illustrates an example of a wireless device that can be applied to the present disclosure.

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

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

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

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

[0120] At least one memory (204) may be connected to at least one processor (202) and may store various forms of data, signals, messages, information, programs, codes, instructions, and / or commands. At least one memory (204) may be composed of ROM (read-only memory), RAM (random access memory), EPROM (erasable programmable read-only memory), flash memory, hard drive, registers, cache memory, computer read storage media, and / or combinations thereof. At least one memory (204) may be located inside and / or outside of at least one processor (202). Additionally, at least one memory (204) may be connected to at least one processor (202) via various technologies, such as wired or wireless connections.

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

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

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

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

[0125] For example, the device may be a mobile device such as a mobile robot, vehicle, train, manned / unmanned aerial vehicle (AV), or ship. In this case, the device may further include at least one of a drive unit comprising at least one of an engine, motor, power train, wheel, brake, and steering device of the device; a power supply unit that supplies power and includes a wired / wireless charging circuit, battery, etc.; a sensor unit that senses state information, environmental information, and user information of the device or its surroundings; an autonomous driving unit that performs functions such as path maintenance, speed control, and destination setting; and a position measurement unit that acquires position information of the moving body through a GPS (global positioning system) and various sensors.

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

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

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

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

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

[0131] The second node of FIG. 4 supports dynamic spectrum sharing (DSS) and can provide connectivity to both nodes where 6G technology is implemented and nodes where pre-6G wireless communication technology (e.g., 5G, 4G) is implemented. That is, the first node of FIG. 4 may have 6G technology implemented or pre-6G wireless communication technology (e.g., 5G, 4G) implemented. Additionally, the first node and / or the second node may support full duplex mode as well as non-overlapping full duplex mode.

[0132] In FIG. 4, for the sake of simplicity of explanation, the first node and the second node are assumed to be a terminal and a base station, respectively, and the operation of the terminal (110) and the base station (120) transmitting and / or receiving data, and the operation performed prior to this, are illustrated. However, the operation of FIG. 4 is not limited to the operation between the terminal and the base station, but can be interpreted as the operation between the first node and the second node. Additionally, FIG. 4 illustrates the operation of direct transmission and reception of wireless signals between the terminal (110) and the base station (120), but there may be one or more intermediate points between the terminal (110) and the base station (120), and wireless signals may be transmitted and received via one or more intermediate points.

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

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

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

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

[0137] 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 data based on the signaling of control information and transmit and / or receive data. For example, when transmitting data, the terminal (110) or the base station (120) can perform at least one of channel encoding, rate matching, scrambling, constellation mapping, layer mapping, waveform modulation, antenna mapping, and resource mapping on the information bits. Conversely, when receiving data, the terminal (110) or the base station (120) can perform at least one of signal extraction from resources, antenna-specific waveform demodulation, signal placement considering layer mapping, constellation demapping, descrambling, and channel decoding.

[0138] 6G System Core Technology

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

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

[0141] artificial intelligence

[0142] The introduction of AI into communications can streamline and enhance real-time data transmission. AI can determine how complex target tasks are performed using numerous analyses. In other words, AI can increase efficiency and reduce processing latency. Time-consuming tasks such as handover, network selection, and resource scheduling can be performed instantly using AI. AI can also play a significant role in M2M, machine-to-human, and human-to-machine communication. Furthermore, AI can enable rapid communication in Brain-Computer Interfaces (BCI). 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.

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

[0144] Below, to provide a more specific explanation of AI (or AI / ML), terms may be defined as follows.

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

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

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

[0148] - AI / ML Inference: A process of making predictions or deriving decisions based on collected data and AI models using trained AI models.

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

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

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

[0152] Referring to FIG. 5, a general functional framework may 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).

[0153] 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) performs data preparation based on raw data and can 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.) but may also be performed by multiple entities.

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

[0155] 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. If necessary, 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) delivered from the Data Collection function (10).

[0156] Trained / Updated Model (21): If there is a Model Storage function (50), it is used to transfer trained, validated, and tested AI / ML models to the Model Storage function (50) or to transfer updated versions of the models to the Model Storage function (50).

[0157] The Management function (30) is a function that supervises the operation of an AI / ML model or an AI / ML function. Additionally, the Management function (30) may make 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)).

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

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

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

[0161] 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 the 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 the data collection (10). If necessary, the inference function (40) may also perform data preparation (e.g., data pre-processing and cleaning, forming and transformation) based on the inference data (13) provided by the data collection function (10).

[0162] 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 an AI / ML model generated by the Inference function (30), and the details of the inference output may vary depending on the use case.

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

[0164] Model Transfer / Delivery (51) is used to transfer an AI / ML model to an inference function.

[0165] Cooperation levels can be defined as follows based on the capability of AI / ML functions among multiple nodes, and variations resulting from the combination of multiple levels or the separation of any one level are also possible.

[0166] Cat 0a) No collaboration framework: AI / ML algorithms are based on pure implementation and do not require changes to the wireless interface.

[0167] Cat 0b) This level corresponds to a framework that involves a wireless interface modified to fit efficient implementation-based AI / ML algorithms but without cooperation.

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

[0169] Cat 2) Collaborative AI / ML tasks can be performed among multiple nodes. This level requires the exchange of AI / ML model commands or network nodes.

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

[0171] AI / ML models can be classified 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.

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

[0173] 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 means that inference is performed collaboratively across multiple nodes; for example, the first part of the inference may be performed by the first node, and the remainder by the second node. Two-side models can be classified into various types as follows, depending on the training method of the AI / ML model.

[0174] - First type: An AI / ML model 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 / entities.

[0175] - 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) and model reconstruction (CSI compression by sub-use cases) 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).

[0176] - Third Type: Separate training of AI / ML models can be performed at multiple nodes (e.g., networks and terminals). Separate training may mean that training starts sequentially at one node and continues at another node. In this case, if the first node performs the AI / ML model first and shares the training data with the second node, the second node can perform the AI / ML model using the shared training data. For example, training for the CSI generation part may be performed by the terminal, while CSI reconstruction may be performed by the network.

[0177] FIG. 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.

[0178] The operations described below may be explained / interpreted based on an AI / ML model as shown in FIG. 6 below, even without separate mention (i.e., without explicit mention of being by / based on / for an AI / ML model). Furthermore, unless specifically limited, the AI / ML model may correspond to a one-side model in which inference is performed entirely by a single node or a two-side model in which joint inference is performed by multiple nodes.

[0179] First signaling (601): In the following description, 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., creation and / or reconstruction) of the AI / ML model of FIG. 5, or to inference data used for inference of the AI / ML model, or to feedback for the AI / ML model. If, in this specification, signaling between nodes is not required prior to an operation based on an AI / ML model, the first signaling (601) may be omitted. In this specification, if a one-side model is used, the unidirectional / bidirectional signaling (set) in this specification may correspond to the signaling of the first signaling (601). Additionally, when a two-side model is used in the present specification, unidirectional / bidirectional signaling in the present specification may correspond to the first signaling (601), and repetitive signaling operation may also correspond to the first signaling (601).

[0180] For example, in AI / ML model-based beam management, when a base station predicts (i.e., infers) high-quality beam(s) based on an AI / ML model, the base station can receive quality / intensity information for multiple beams from the terminal. Additionally, when a terminal predicts (i.e., infers) high-quality beam(s) based on an AI / ML model, the terminal can receive multiple beams from the base station.

[0181] AI / ML model-based operation (602): In the following description, an operation (e.g., computation, selection, prediction, etc.) at a specific node (e.g., terminal, network, etc.) or a common operation (e.g., computation, selection, prediction, etc.) at 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 without separate mention. For example, it may correspond to the training (i.e., creation and / or reconstruction) of the AI / ML model of FIG. 5 or to the inference of the AI / ML model. When a one-side model is used, an operation performed by a single node in this specification may correspond to an AI / ML model-based operation (602), and when a two-side model is used, a common operation performed by multiple nodes in this specification may correspond to an AI / ML model-based operation (602).

[0182] For example, in an AI / ML model-based BM, a base station can predict (i.e., infer) high-quality beam(s) based on an AI / ML model by using quality / intensity information for multiple beams received from a terminal as inference data. Additionally, a terminal can measure multiple beams received from a base station and predict (i.e., infer) high-quality beam(s) based on an AI / ML model by using the measurement results as inference data.

[0183] Second signaling (603): In the following description, 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 the second signaling (603) or a set of signaling generated as a result of an operation based on an AI / ML model, even without separate mention. For example, it may correspond to the output resulting from the inference of the AI / ML model of 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, the unidirectional / bidirectional signaling (set) in this specification may correspond to the second signaling (603). Additionally, when a two-side model is used in this specification, unidirectional / bidirectional signaling in this specification may correspond to the second signaling (603), and repetitive signaling operation may also correspond to the second signaling (603).

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

[0185] THz communication

[0186] Data transmission rates can be increased by expanding bandwidth. This can be achieved by using sub-THz communication with wide bandwidth and applying advanced large-scale MIMO technology. THz waves, also known as sub-millimeter radiation, generally refer to a frequency band between 0.1 THz and 10 THz with corresponding wavelengths ranging from 0.03 mm to 3 mm. The 100 GHz–300 GHz band range (Sub-THz band) is considered the primary portion of the THz band for cellular communication. Adding the Sub-THz band to the mmWave band increases 6G cellular communication capacity. Among the defined THz bands, the 300 GHz–3 THz band is located in the far-infrared (IR) frequency band. Although the 300 GHz–3 THz band is part of the broadband, it lies at the boundary of the broadband and immediately following the RF band. Therefore, this 300 GHz–3 THz band exhibits similarities to RF.

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

[0188] Transmitting system information (i.e., information related to the attributes, characteristics, and / or capabilities of the BS required to use the service, etc.) (e.g., MIB, SIB, etc.) in the THz frequency band can be inefficient because, in the case of high frequency bands, beam sweeping must be performed more frequently to cover the entire area of ​​the cell as the beam width becomes narrow. 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 as shown in FIG. 8 below may be used.

[0189] FIG. 8 illustrates an example of a procedure for transmitting system information for THz communication to which the present disclosure applies. Although this example is written with THz conditions in mind, it is also applicable to 6G communication environments where THz is not applied. Furthermore, the procedure exemplified in FIG. 8 can be combined with various embodiments of the present disclosure described below. For example, the embodiments described below may be performed based on the system information obtained by the procedure exemplified in FIG. 8.

[0190] 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 the THz frequency band, and cell #2 uses a frequency band other than the THz frequency band. Here, the system information may include at least one information / state / parameter / setting generated at the higher layer and the physical layer, respectively. For example, at least one information / state / parameter / setting generated at the higher layer may include at least one of 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 at least one information / state / parameter / setting generated at the physical layer may include at least one of SFN, half frame indicator, and SSB index. However, this is merely an example, and system information may include information, status, parameters, and settings related to Cell #1 / Cell #2 generated at various types of physical layers / upper layers. To this end, as an example, Cell #1 and Cell #2 may have a secondary cell and primary cell relationship.

[0191] The UE can obtain synchronization for cell #1 (803). Synchronization can be obtained by detecting a synchronization signal. Generally, synchronization is obtained prior to receiving system information, but since the system information for cell #1 is received in cell #2, synchronization for cell #1 can be obtained after receiving system information. For example, the UE can obtain synchronization based on system information. However, unlike FIG. 8, synchronization may be obtained before step 801 according to other examples.

[0192] The UE can transmit a signal to connect to Cell #1 (805). For example, the signal may include information for connecting to Cell #1 (e.g., a random access preamble). The structure of the signal and the resources for transmitting the signal (e.g., a channel) can be identified through system information. Subsequently, the UE and the base station can perform a connection procedure to Cell #1 and perform communication (807). In this process, operations according to various embodiments described below may be performed.

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

[0194] Communication in the THz band is expected to experience severe path loss, and to overcome this, terminals and base stations must use very sharp beams. The use of sharp beams means that terminals and base stations must perform beam control along with beamforming, and the number of beams used becomes very large. Therefore, it takes a very long time to align the transmit and receive beams between the base station and the terminal. In addition, if the beam alignment between the base station and the terminal is misaligned due to the movement of the terminal, time is frequently required to realign the beams, which may result in an unstable link. Accordingly, a beam management procedure as shown in Fig. 9 below may be used.

[0195] 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 is applicable to a 6G communication environment. Additionally, the procedure exemplified in FIG. 9 may be combined with various embodiments of the present disclosure described below. Here, a beam may be interpreted as 'spatial (configuration) information', 'spatial domain filter', 'spatial domain transmit filter', 'spatial domain receive filter', or / and a term having an equivalent technical meaning capable of distinguishing a 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.).

[0196] Referring to FIG. 9, the base station can configure resources for beam management (901). Here, the resources may include at least one of time-frequency resources, channels, and spatial resources (e.g., antenna ports). For example, the base station may utilize a beam search signal (BSS) that is spatially separated from existing downlink signals / channels for beam search. Here, the BSS may be transmitted based on a dedicated port for beam search. The dedicated port may be a port different from the 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 may be included in the technical concept according to the present embodiment.

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

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

[0199] Integrated Sensing and Communication (ISAC)

[0200] Wireless sensing is a technology that utilizes radio frequencies to determine the instantaneous linear velocity, angle, and distance (range) of an object, thereby obtaining information about the characteristics of the environment and / or objects within that environment. Since radio frequency sensing capabilities do not require connecting to objects via devices within a network, they can provide services for determining object locations without the need for devices. The ability to obtain range, velocity, and angle information from radio frequency signals can provide a wide range of new functions, 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 various industries (e.g., unmanned aerial vehicles, smart homes, V2X, factories, railways, public safety, etc.) that enable 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 may utilize non-3GPP type sensors (e.g., radar, cameras) to further support 3GPP-based sensing. For example, the operation of a wireless sensing service, that is, the sensing operation, may depend on the transmission, reflection, and scattering processing of wireless sensing signals. Therefore, wireless sensing can provide an opportunity to enhance existing communication systems from communication networks into wireless communication and sensing networks.

[0201] FIG. 10 illustrates an example of a sensing operation according to an embodiment of the present disclosure. The embodiment of FIG. 10 may 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 position (e.g., monostatic sensing), and FIG. 10(b) illustrates an example of sensing using a separated sensing receiver and a sensing transmitter (e.g., bistatic sensing).

[0202] 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, in different terminals, or in a terminal and a base station, respectively.

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

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

[0205] - Second mode: A mode in which the sensing transmitter is included in the 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)

[0206] - 3rd Mode: 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)

[0207] - 4th Mode: 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)

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

[0209] - 6th mode: A mode in which the sensing transmitter is included in the 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)

[0210] 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 or in combination.

[0211] 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 the environment surrounding 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 that is scattered / reflected by one or more objects (and / or the environment surrounding the objects) from the sensing signal transmitted from the sensing transmitter. In the sensing receiver, sensing data may be derived from the scattered / reflected signal, and sensing results may be generated / obtained through processing of the sensing data. Here, the sensing result may include characteristic information (e.g., location, distance, speed, angle, etc.) about one or more objects (and / or the environment surrounding the objects). The sensing result thus generated / acquired may be utilized for wireless sensing services (e.g., detection, tracking, etc. of objects and / or environments) provided by a wireless communication system based on a 6G network of the present specification, or may be provided / disclosed to a trusted third party.

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

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

[0214] FIG. 11 illustrates a time / frequency resource for a sensing operation according to one embodiment of the present specification. The embodiment of FIG. 11 may be combined with various embodiments of the present disclosure.

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

[0216] For example, as illustrated in FIG. 11, sensing resources may be configured / assigned in units of symbols in the time domain and / or in units of resource blocks in the frequency domain. Resources other than those configured / assigned to the sensing resources may be utilized as resources for general communication. That is, sensing resources and communication resources may be configured / assigned based on time-division multiplexing (TDM) and / or frequency-division multiplexing (FDM) methods in terms of base station / terminal operation. Additionally or alternatively, unlike that illustrated in FIG. 10, sensing resources may be configured / assigned based on other units in the time domain (e.g., slot, frame, absolute time (ms, us), etc.) and / or other units in the frequency domain (e.g., subcarrier, carrier, absolute frequency (MHz, GHz), etc.).

[0217] Additionally or alternatively, in relation to the setup / allocation / scheduling of resources for general communication described herein, it may be necessary to consider the relationship between said resources and the aforementioned sensing resources. For example, when setting / allocating resources for general communication according to the embodiments of the present disclosure, said resources may be set / allocated to rate-match or puncturing resource areas corresponding to the sensing resources. For example, when scheduling resources for general communication according to the embodiments of the present disclosure, said resources may be scheduled so as not to overlap with resource areas corresponding to the sensing resources. If resources for general communication and resource areas corresponding to the sensing resources are set / allocated / scheduled to overlap according to the embodiments of the present disclosure, either one or both operations may be dropped, skipped, or postponed based on priority, predefined rules, etc. That is, in the embodiments of this specification, resources related to general communication (e.g., resources for signals / channels related to UL / DL / Sidelink-based data / control, etc.) may be configured / assigned / scheduled so as not to overlap with the aforementioned sensing resources.

[0218] Additionally, various channel modeling methods may be applied in relation to the wireless sensing described herein. Channel modeling related to sensing may mean constructing a path for transmitting and receiving sensing signals and / or scattered / reflected signals by considering the object to be sensed and / or the environment to which the object belongs. Since channel modeling may be related to the performance / requirements of sensing in a wireless communication system, it may be an important matter for verifying the validity of the sensing function.

[0219] Channels related to sensing can be classified into channels between an object (e.g., target of interest) and a sensing transmitter / receiver, and channels between the environment to which the object belongs and a sensing transmitter / receiver. In this regard, channel modeling related to sensing can be classified based on the sensing mode (e.g., the six types of modes mentioned above), whether it is an object or an 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 an environment in a base station / terminal-based monostatic sensing mode, and channel modeling for an environment in a base station / terminal-based bistatic sensing mode can be optimized and configured differently. For example, when various sensing scenarios are classified, they can be divided into channel modeling for detection, location, and tracking scenarios, channel modeling for motion recognition, and channel modeling for imaging / environment reconstruction scenarios. 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 this specification may be based on stochastic geometry channel modeling techniques and / or hybrid with ray tracing channel modeling techniques. Here, the stochastic geometry 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 the case of 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.

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

[0221] 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 verify (1205) the terminal's capability for the sensing operation. In this regard, the terminal may be configured to report capability information to the base station regarding whether it supports the sensing operation. Additionally, or alternatively, if the terminal is defined in advance in the specification as supporting the sensing operation, the procedure may be omitted. Furthermore, in the case of a sensing operation in which only the base station participates, the base station may be configured to report capability information regarding whether it supports the sensing operation to the entity setting / controlling its sensing operation (e.g., a network entity at the upper level / layer of the base station).

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

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

[0224] Channel Coding

[0225] Channel coding is one of the core technologies of a wireless communication system, and it is a technology that enables the receiving end to detect and correct errors when errors occur during the process of transmitting and receiving information, and includes the encoding process of the transmitting end and the decoding process of the receiving end.

[0226] I. 5G NR Channel Coding

[0227] Various channel coding techniques have been introduced and are being used in the 5G NR standard, 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.

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

[0229] Figure 13 illustrates the coding chain of NR LDPC. The transport block (TB) to be transmitted by the transmitter obtains CRC bits for the purpose of detecting errors that may occur in the TB through the TB CRC (cyclic redundancy check) attachment step. If the sum of the TB CRC and the TB length is greater than the maximum Code Block Size (CB) supported by the transmitter and receiver, the TB with attached CRC 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. Subsequently, each CRC-attached CB is converted into coded bits through the LDPC encoding step. Afterward, through the rate matching step, the coded bits to be transmitted and received through the actual traffic channel are selected from the total coded bits, and the selected coded bits undergo interleaving followed by modulation.

[0230] (Segmentation and CRC attachment)

[0231] Considering efficient operation in the LDPC encoder and decoder, a segmentation process may be included to generate multiple CBs by dividing the bit sequence length of a TB into equal parts when the length is long. The application of segmentation is determined by the length of the bit sequence, and K, which is the maximum CB length supported depending on the selected base graph (BG), is used. cb Based on K cb Segmentation is performed for TBs of longer length. (i.e., K cb =8448 for BG-1, K cb =3840 for BG-2)

[0232] To support error detection in the decoder, CRC attachment is performed before LDPC encoding. By default, CRC attachment is performed based on TB, and if the segmentation process is performed and the TB is divided into two or more CBs, an additional CRC attachment process is performed on each CB.

[0233] (LDPC Encoding)

[0234] 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. Due to these characteristics of the base graph, it is possible to flexibly support a wide range of transmitted information bits by applying various code rates.

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

[0236] 3GPP TS 38.212 defines two types of base graphs (BG), referred to as BG-1 and BG-2, respectively. The use of these BGs is determined by 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, with K = 10Zc. Here, Zc represents the size of the lifting matrix, and Table 1 shows the set of lifting sizes defined in 5G NR.

[0237] [Table 1]

[0238]

[0239] Figure 14 is a diagram illustrating the BG structure of 5G NR.

[0240] Referring to Fig. 14, the columns consist of information columns, core parity columns, and extension parity columns. The rows are divided into core-check rows and extension-check rows.

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

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

[0243] [Table 2]

[0244]

[0245] Submatrix E is a dual diagonal matrix 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.

[0246] According to the LDPC encoding procedure, 66Zc (for BG-1) coded bits (e.g., 22Zc*3) 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.

[0247] (Rate matching)

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

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

[0250] [Table 3]

[0251]

[0252] (Interleaving)

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

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

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

[0256] (Layer mapping in 5G NR)

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

[0258] [Table 4]

[0259]

[0260] (Modulation mapper)

[0261] In the case of QPSK modulation, a pair of bits is mapped to a modulation symbol of a complex value according to Equation 1.

[0262] [Mathematical Formula 1]

[0263]

[0264] In the case of 16QAM modulation, a quadruple of bits is mapped to a modulation symbol of a complex value according to Equation 2.

[0265] [Mathematical Formula 2]

[0266]

[0267] In the case of 64QAM modulation, a hextuplet of bits is mapped to a modulation symbol of a complex value according to Equation 3.

[0268] [Mathematical Formula 3]

[0269]

[0270] 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 in the I-channel and Q-channel, respectively, than b(4i+2) and b(4i+3).

[0271] 2. NR Polar code

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

[0273] The coding chain of the polar code has slight differences depending on whether the transmission and reception are UL or DL.

[0274] Referring to Fig. 16 (a), for UL, segmentation of the uncoded input bit sequence may be considered first, and each segmented bit sequence performs a CRC attachment step. Additionally, for UL, a process of adding a parity check bit may be added depending on the conditions. Subsequently, the CRC-attached bit sequence is converted into a coded bit through a polar encoding process. The generated coded bits are selected as coded bits to be transmitted and received through a sub-block interleaver and rate matching step, and the selected coded bits undergo interleaving followed by modulation.

[0275] 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. Subsequently, the CRC attached bit sequence forms a distributed CRC structure through the input bit interleaver step. Then, the CRC attached bit sequence of the distributed CRC structure is converted into coded bits through a polar encoding process. The generated coded bits are selected as 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.

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

[0277] When polar codes are applied in UL transmission and reception, a segmentation process may be included to divide the uncoded input bit sequence into equal parts when the length is long, considering the efficient operation of 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.

[0278] The CRC attachment process applies to both UL and DL, but there are some differences in operation.

[0279] In UL, an 11-bit or 6-bit CRC can be selected and applied depending on the length of the information. Additionally, in the case of UL, parity check bits may be added, 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.

[0280] In DL, a 24-bit CRC is always applied regardless of the information length, and a distributed CRC structure is used to distribute the CRC positions, which is advantageous for the effects of early decoding termination or list pruning. The input bit interelaver patterns defined in TS 38.212 are as shown in Table 5. In Table 5, Π IL max (m) Indices corresponding to values ​​from 140 to 163 (e.g., 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 the information bits.

[0281] [Table 5]

[0282]

[0283] (Polar encoding)

[0284] The matrix used for polar encoding of an input bit sequence in a polar code (hereinafter referred to as the encoding matrix or mother code matrix) has the form of a Kronecker power for a matrix (hereinafter referred to as the kernel matrix) as shown in Equation 4.

[0285] [Mathematical Formula 4]

[0286]

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

[0288] [Mathematical Formula 5]

[0289]

[0290] In mathematical equation 5, G^(ⓧn) represents n operations of Kronecker power on the kernel matrix G, and x is the 2 generated through that operation n *2 n It refers to an encoding matrix of size.

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

[0292] [Mathematical Formula 6]

[0293]

[0294] The size of the data to be transmitted including the CRC bit (e.g., size of unencoded information bits) is K (<2 n In the case of ), 2 n An input bit sequence u of length 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 considers the following factors based on the NR standard.

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

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

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

[0298] - Parity bit: In the case where the position of the parity bit is determined first in the UL situation, the positions of the bits used as parity bits are predetermined as frozen bits and are set so that they are not selected as information according to the reliability condition.

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

[0300] To overcome the limitations of the restricted mother code size supported by polar encoding matrices, the NR standard supports rate matching techniques of puncturing, shortening, and repetition. (In this specification, mother code size may be substituted for the input bit sequence size.)

[0301] For efficient rate matching, sub-block interleaving is applied prior to rate matching, reordering the polar-encoded coded bits according to 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 for each sub-block according to the sub-block interleaver pattern. Table 6 shows the sub-block interleaver patterns defined in the NR standard, and based on Table 6, d0, ... d according to the rule of Equation 7 below N-1 The result y0, ..., y when the coded bits of are the input N-1 This is generated

[0302] [Mathematical Formula 7]

[0303]

[0304] [Table 6]

[0305]

[0306] After sub-block interleaving is performed, during the rate matching stage, one of the techniques—puncturing, shortening, or repetition—is applied depending on the size of the rate matching output bit, which is determined by the size of the encoded coded bits, the number of REs used for transmission and reception, and the modulation order. Where K is the size of the data to be transmitted and N is the size of the mother code used for polar encoding (=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 in the NR standard as follows.

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

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

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

[0310] The criteria for selecting the above bits follow 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 sub-block interleaver and rate matching are performed.

[0311] (Channel interleaver)

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

[0313] 3. Channel coding of small block lengths

[0314] In the NR standard, separate channel coding techniques are used to support transmission of 12 bits or less. When channel coding is applied to support small block lengths, CRC is not used.

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

[0316] Simplex code is used as a coding technique for transmitting 2 bits of data. It operates in a structure where, when the 2 bits of information are c0 and c1, c2 = (c0 + c1) mod 2 is generated and c0, c1, and c2 are transmitted repeatedly according to the modulation order.

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

[0318] [Mathematical Formula 8]

[0319]

[0320] In mathematical equation 8, K is the size of the data bits and c0, ..., c K-1 refers to the sequence of data bits input into the Reed-Muller code encoder. Additionally, M used in the NR standard. i,k The value of is defined as in Table 7.

[0321] [Table 7]

[0322]

[0323] II. Channel coding candidates for 6G

[0324] 1. Polar code and HARQ process

[0325] In wireless communication systems, the operation of retransmitting the same data can be supported to prepare for failures in data transmission and reception caused by a single transmission. At this time, various techniques can be used to improve decoding performance by increasing efficiency from a channel coding perspective during the retransmission process. Recent research trends to support the retransmission operation of polar codes include the Chase Combining perspective (hereinafter CC-polar), the Incremental Redundancy perspective (hereinafter IR-polar), and the Incremental Freezing perspective (IF-polar).

[0326] CC-polar

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

[0328] IR-polar

[0329] Incremental Redundancy is a technique that enables retransmissions that increase the gain of channel coding with each retransmission, and supports the combination of each coded bit transmitted and received over multiple retransmissions to form a long coded bit. This can be viewed as a structure in which some punctuated coded bits are transmitted and received differently for each retransmission based on the total coded bits, and this can be seen as different Redundancy Versions (RVs).

[0330] As a representative structure of IR-polar, the mother code size increases by a power 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 There is a method for generating coded bits that considers ). If the initial transmission is 2 n If encoding is performed considering the mother code size, 2 in the retransmission step n+1 This is a method of generating additional coded bits considering the size of the mother code and transmitting and receiving them. In this case, 2 n+1The coded bits of the size are the previously transmitted and received 2 n It can be viewed as a relationship involving coded bits of a certain size, and this is a method that utilizes the characteristic that the polar encoder matrix takes the form of Kronecker power. If the mother code size doubles, the most reliable bit position can be newly determined from the perspective of the encoder input bits (e.g., an input bit sequence of doubled length), and in particular, the newly added 2 n More reliable bit locations may arise at the position of a sub-block of a certain size. Considering this, IR-polar structures may be considered in which some bits with low reliability among the information bit positions selected based on the previous mother code size are copied to newly selected information bit positions based on a higher mother code size. These newly selected bits possess a faster decoding order and higher reliability in structures where sequential decoding is performed, such as SC / SCL (Successive Cancellation / Successive Cancellation List) decoding. Consequently, in the case of retransmission in an IR-polar structure, the mother code size increases while the information size remains fixed, thereby achieving the effect of reducing the code rate.

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

[0332] IF-polar

[0333] The IF-polar technique is a method in which, when the size of the information bits in the initial transmission is K, only a portion of K is applied to the coded bits during the retransmission phase and the bits are transmitted and received. From the perspective of the receiver, if the decoding of the coded bits transmitted and received during the retransmission phase is successful, the successful result is utilized for the decoding of other coded bits, thereby improving the coding gain. In the case of information transmitted and received during retransmission that is successfully decoded, the same information bits transmitted and received in the previous transmission can be treated as frozen bits, which consequently results in a reduction of the code rate.

[0334] FIG. 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 FIG. 20, a total of 9 information bits are encoded and transmitted / received during the initial transmission stage, while only some of the 9 information bits are encoded and transmitted / received during subsequent retransmission stages. In this case, the information bits included in the retransmission transmission / reception can be selected from positions with relatively low reliability among the previously transmitted / received information bits, which can guarantee greater gains from the perspective of polar decoding. If three transmissions / receptions are performed as in the example of the figure, and the terminal succeeds in decoding the information during the 3rd transmission stage, the terminal uses the successfully decoded information (7, 8 in FIG. 20) to perform decoding of the 2nd transmitted coded bits, and if this is successful, the terminal can use those information (4, 5, 7, 8 in FIG. 20) to perform decoding of the initial transmission.

[0335] 2. Extension of Polar code

[0336] PAC (Polarization-adjusted convolutional) Code

[0337] PAC code is one of the concatenation schemes of polar code and is known to exhibit advantageous performance within a limited length (Incorporated by a reference: E. Arıkan, “From sequential decoding to channel polarization and back again,” arXiv preprint arXiv:1908.09594, 2019). The basic structure of PAC is to apply a convolutional pre-transform process to uncoded bits prior to performing polar encoding.

[0338] Figure 21 illustrates an example of a transmission and reception process (channel coding) based on a PAC code. In the process of Figure 21, the first step, rate profiling, involves converting the input information bit into an N-bit vector; this operation can be viewed as similar to the method used to determine the position of the information bit in conventional polar codes. The rate-profiled output vector undergoes a polar transform process in which operations on the polar encoding matrix are performed after the convolutional encoding process is executed. The coded bit generated through the above process passes through the channel and is received by the receiver. The receiver can detect an N-bit sequence to which rate profiling has been applied through a decoding process of the received coded bit, and the process of acquiring the original information based on the form of the rate profiling is finally performed.

[0339] GCC (Generalized Concatenated Code) based on polar code

[0340] GCC refers to a code that combines multiple outer codes through a single inner code, wherein the multiple outer codes are allowed to have the same length and different dimensions. Polar codes can be viewed as a type of GCC-family code considering the structural characteristics that cause polarization effects. Furthermore, a modified application may be used by extending the basic polar code structure (e.g., a structure that expands a single base kernel matrix into the form of Kronecker power) to a structure where coded bits from different outer codes are expanded using the polar code structure as an inner code (Incorporated by a reference: P. Trifonov, "Efficient design and decoding of polar codes," IEEE Trans. Communications, vol. 60, no. 11, pp. 3221-3227, Nov. 2012).

[0341] Figure 22 is a diagram illustrating a GCC-based polar code.

[0342] In the example of Fig. 22, four outer codes are used, and the input vectors of each outer code, u'1, u'2, u'3, and u'4, have dimensions of K1, K2, K3, and K4, respectively, and their values ​​may be the same or different. The outer coded bits, which are the outer vectors of each outer code, have the same dimension. Subsequently, the generated outer coded bits undergo a polar encoding process based on the kernel matrix form of the polar code.

[0343] In the basic form of polar code, the application of an outer code structure other than a polar kernel matrix to the outer code portion can be designed differently depending on the objective, such as improving decoding success performance or reducing decoding complexity.

[0344] Transmission and reception using RVs for polar coding

[0345] Channel coding involves the operation of encoding a signal at the transmitting end and decoding the original signal from the encoded signal at the receiving end to enable error detection and error correction during transmission and reception over a channel. Polar code is one of the channel coding techniques and was first introduced and used in the 5G NR standard for the transmission and reception of the UL / DL control channel. Therefore, the operations of polar code defined in the 5G NR standard were designed specifically for the transmission and reception of the control channel, and the functions required for the transmission and reception of the traffic channel were not considered.

[0346] The design of next-generation wireless communication systems considers objectives such as achieving higher KPIs than current levels, like higher data rates and lower latency, as well as supporting new use cases. In particular, for 6G, which has recently begun to be discussed, requirements for peak data rate, reliability, and latency are expected to be set higher than those for 5G, and new use cases such as ISAC, AI, and communication are also being considered. To satisfy these new requirements and use cases, channel coding techniques also need to evolve. Specifically, to meet requirements such as data rate and reliability demanded by next-generation wireless communication systems like 6G, channel coding techniques used in traffic channels must be able to support them. Polar code can be considered as a candidate technology to satisfy these requirements in terms of decoding performance and error floor during transmission and reception in various channels, such as PBCH (MIB) (or SSB) and / or traffic channels, as well as in control channels.

[0347] In general, retransmission techniques based on the HARQ process may be supported in traffic channels to ensure stable data transmission and reception. In this retransmission process, Incremental Redundancy (IR) techniques can be usefully employed from the perspective of channel coding to improve decoding performance and resource efficiency.

[0348] In addition, for the transmission of PBCH(MIB) (or SSB), an IR technique may be used that applies different RVs between PBCH(MIB) (or SSB) transmitted from different time (and / or frequency) resources.

[0349] The IR technique is a method of retransmitting data by increasing the channel coding gain with each retransmission by transmitting different additional redundancy when retransmission is applied to the same data. The coded bits included in each (re)transmission to which the IR technique is applied can be viewed as coded bits generated according to different criteria for each (re)transmission, or they can be viewed as the coded bits transmitted and received in each (re)transmission by truncating a portion of the entire coded bit set. In this case, the receiver must know the coded bit generation rule or truncation rule used by the transmitter for each (re)transmission, and a Redundancy Version (RV) can be used for this purpose. An RV can consist of multiple states (e.g., RV0, RV1, RV2, RV3), and the coded bit generation rule applied according to each state, or the rule for selecting a portion of the coded bits from the entire coded bit set, can be agreed upon and used between the transmitter and the receiver. The RV used in each (re)transmission can be pre-set / instructed and applied.

[0350] In order to support efficient IR techniques and RV-based operations, the characteristics of channel coding that generates coded bits need to be considered. Therefore, in order for polar codes to be applied and used for transmission and reception on various channels (e.g., PBCH / traffic channel) in next-generation wireless communication systems such as 6G, the application methods of these IR techniques and RV need to be appropriately designed.

[0351] In this disclosure, an RV structure is proposed to support a rule for generating a suitable coded bit in each (re)transmission and / or a rule for selecting some coded bits from the entire coded bit in order to obtain high decoding performance by considering the characteristics of a polar code, and a method and apparatus for operating a base station and a terminal are proposed for this purpose.

[0352] In the following specification, the main concepts of the proposed methods are explained based on polar codes, but they can also be applied to other channel coding techniques that have a structure in which information is decoded sequentially, such as sequential decoding or successive cancellation decoding, during the decoding process.

[0353] Unless otherwise noted, the proposed methods are described based on SC or SCL decoding. However, the proposed methods are not limited to SC or SCL decoding and may also be applicable to other decoding methods where decoding of specific or partial information can be performed relatively faster than that of other information.

[0354] To illustrate the specific forms in which the proposed methods are applied, some specific embodiments to which the proposed methods are applied are described below, but they can also be applied to other transmission and reception structures and forms.

[0355] The following description explains the terms and operating principles of the system based on a 6G wireless communication system. However, the proposed method is not limited to this and may be applied to other wireless communication systems.

[0356] FIG. 23 illustrates an example of a simple encoding structure to which the present disclosure can be applied.

[0357] For convenience, the proposed methods are described below with reference to the encoding structure and representation exemplified in FIG. 23, but FIG. 23 is an example of implementation to aid in understanding the proposed method and device, and the proposed method and device are not limited thereto.

[0358] Referring to FIG. 23, FG 101 represents an information bit sequence of size K; if the transmission and reception include a CRC, it can be defined as a sequence containing the CRC. FG 102 is an info-bit allocation process, which may also be referred to as a process for generating an input bit sequence for polar coding. FG 102 receives an information bit sequence of length K as input and outputs a sequence of length N (FG103). At this time, the device performing the encoding determines the positions of the information bit and the frozen bit on the sequence of length N, maps the information bit and the frozen bit, and outputs them as the output sequence (FG 103). The output sequence (FG 103) (hereinafter referred to as the encoder input (bit) sequence) produced in the info-bit allocation process (FG102) is provided as the input to the polar encoding process (FG 104). In the polar encoding process (FG104), an operation is performed between the input encoder input sequence (FG103) and a polar encoding matrix of size N by N, and as a result, a coded bit sequence of length N (FG105) is output. In the following description, the length N of the encoder input sequence (FG103) may be referred to as the mother code size. Subsequently, if necessary, the output coded bit sequence (FG105) may undergo a process such as sub-block interleaving (FG106) to rearrange the order of the bits, and sub-block interleaving (FG106) may be intended to create an array of coded bit sequences that is advantageous for rate matching.If sub-block interleaving (FG 106) is included, an interleaved coded bit sequence of length N is generated as the output and passed to the rate matching process (FG108); if sub-block interleaving (FG 106) is omitted, the coded bit sequence (FG105) generated in the previous step is used as the input to the rate matching process (FG108). In the rate matching process (FG108), a rate matching operation is performed to convert the input coded bit sequence of length N into the required length, and as a result, a rate-matched coded bit sequence (FG109) of length E is output.

[0359] The key terms used to explain the proposed methods based on polar codes are defined and used as follows.

[0360] - Single Transmission: Refers to a unit of transmission to which a single RV is applied. In situations where retransmission is supported, it can be defined as a single transmission if a single RV is applied to each (re)transmission; additionally, if the RV cycling technique is applied by repeating PDSCH / PUSCH units, each repeated PDSCH / PUSCH unit can be defined as a single transmission.

[0361] - E: Represents the length of the rate-matched coded bit sequence output as a result of rate matching for a single transmission. If retransmission is supported, different E values ​​may be scheduled for each single transmission.

[0362] - E base : One of the selectable E values, representing a value that can be assumed to be the same for single transmissions of all (re)transmissions for the same TB when retransmission is supported. E basemay differ from the actual scheduled E value. E base The value of may be determined based on other scheduling parameters, e.g., E, the size of the information to be transmitted and / or received, and / or the code rate, or it may be a value directly set or directed by the base station. For example, the same E between the transmitting and receiving devices prior to a single transmission actually being performed base It can be predefined / agreed upon / set, and the same E base A single transmission can be performed by assuming a value. E base can be referred to as the basic rate matching output sequence length.

[0363] - N base : Refers to the basic unit mother code size applicable to a single transmission among the selectable polar code mother code sizes for a specific TB transmission. For example, characteristically N base can be set as the mother code size applied to a single transmission of RV0. In the case of a polar code based on a 2 by 2 kernel matrix, N is one of the powers of 2. base can be determined. N base is E base and / or can be calculated based on E, and specifically selectable E base and / or divide the range of E values ​​into multiple intervals and N corresponding to each interval base A method for setting the value is used, or N base may be a value directly set / instructed by the base station. For example, the same N between the transmitting device and the receiving device prior to a single transmission actually being performed base g can be predefined / promised / set, and the same N base A single transmission can be performed by assuming a value. Such an identical N baseFor the assumption of the value, one device has N on another device base Explicitly signal the value, and / or the same E described above base Same N through the value base The value may be determined.

[0364] - N T : Refers to the size of the mother code size constituting the total coded bits among the selectable mother code sizes of a polar code for the transmission of a specific TB. In the case of a polar code based on a 2x2 kernel matrix, it can be determined as one of the powers of 2. For example, the total coded bits may refer to the total length of the coded bits related to or capable of covering multiple RVs. As described below, the transmitting device is N T After generating the entire coded bit of length, the coded bits corresponding to the RV of the current single transmission may be selected and transmitted from the entire coded bit, or the transmitting device may determine the position / bit index corresponding to the coded bit corresponding to the RV of the current single transmission from the entire coded bit index and instantaneously generate and transmit the coded bit corresponding to the RV of the current single transmission.

[0365] The criteria for determining the coded bits included in each single transmission (hereinafter referred to as 'partially coded bits') based on the total coded bits can be determined based on a set / instructed RV. At this time, the specific method for determining the partially coded bits of each single transmission may include, as components, a method for determining the RV starting point and / or a method for selecting coded bits from the RV starting point.

[0366] [Proposal 1] Determining the RV starting point

[0367] According to one embodiment, a method for determining the RV starting point in terms of the entire coded bit is proposed.

[0368] The RV starting point may refer to a coded bit index that serves as a reference point when selecting a partial coded bit for a single transmission within the entire coded bit. As a specific example, when the entire coded bit is aligned according to a specific criterion and the partial coded bit is selected sequentially according to a specific rule within the aligned entire coded bit, it can be set as the coded bit index that serves as the criterion for applying the specific rule.

[0369] For example, a specific criterion for aligning the entire coded bit may be a puncturing order. For example, the entire coded bit may be aligned according to the ascending or descending order of the puncturing order.

[0370] For example, a specific rule for sequentially selecting partial coded bits may be based on at least one of an ascending / descending order rule of index and / or a rate matching pattern (e.g., repetition / puncturing / shortening). For example, the coded bit index that serves as the reference may be the index at which (partial) coded bits begin to be selected on the circular buffer when a structure such as a circular buffer is used.

[0371] Proposal 1 proposes the following options to determine the RV starting point, and one option or a combination of options may be used.

[0372] [Option 1-1] N T Determine the RV starting point based on

[0373] For example, N, the length of the total coded bits. T When is determined, N T We propose a method for determining the RV starting point based on the length of . Specifically, in the case where M RVs are in operation, N from the reference point T The RV starting point can be determined at intervals of / M. In this case, the reference point for determining the RV starting point is the position where the entire coded bit begins, for example, where the index of the entire coded bit is from 0 to N T When the range is -1, it can be set to the value of index 0. For example, the index of the entire coded bit is from 0 to N T When M RV values ​​have a range of -1 and are 0, 1, ..., M-1 respectively, k0, which is the index of the RV starting point determined on the entire coded bit index based on the set / instructed RV value (rv_id), can be expressed as Equation 9.

[0374] [Mathematical Formula 9]

[0375] k0=N T / M *rv_id

[0376] The example of mathematical formula 9 is merely an example for illustrative purposes, and the present disclosure may also be applied when the index of the entire coded bit is agreed upon in a different way, for example, in reverse order, or when the RV starting point is determined based on equal intervals relative to the agreed reference point.

[0377] Fig. 24 is N T An example of determining the RV starting point based on [the criteria] is illustrated. Specifically, FIG. 24 is an example in which the RV starting point is determined according to Equation 9 when four RVs are in operation.

[0378] Referring to FIG. 24, FG 201 is N TIt refers to the total coded bits of the length, with indices ranging from 0 to N in order from left to right. T It is assigned to -1. When four distinct RVs are designated as RV0, RV1, RV2, and RV3, and their rv_id values ​​are set to 0, 1, 2, and 3, the starting point for each RV is 0 in ascending order of rv_id (FG 202), N T / 4 (FG 203), 2*N T / 4 (FG 204), and 3* N T It is set to the position of / 4 (FG 205). FG 206, FG 207, FG 208, and FG 209 represent the range of the coded bits to which each RV is applied when the RV starting point is determined according to each rv_id. FIG. 24 is one embodiment for convenience of explanation and the application of the proposed method is not limited to the example of FIG. 24.

[0379] N as in the proposed method above T When the RV starting point is determined based on [this], it provides an advantage in that it offers a structure where coded bits at all locations can be transmitted and received as uniformly as possible in terms of the total coded bits. Additionally, considering the structure of a polar code using a 2 x 2 kernel matrix, and when the number of RVs in operation is a multiple of 2, all or part of the RV starting points may be determined to indices that are the same (or adjacent) to powers of 2. This can result in cases where more favorable decoding performance is guaranteed when considering the uneven reliability characteristics of polar codes, and it can also be advantageous as it provides an opportunity for self-decodable single transmission.

[0380] (N T Calculation method)

[0381] For the method proposed in Option 1-1 to be applied, N T The understanding of the criteria for determining must be identical between the transmitting and receiving ends, and a method for this is required. T Since the length determines the total coded bit length, it must be determined by considering the decoding performance of the total coded bits; furthermore, the length of the code rate supported by the channel coding used, as well as the impact of decoding complexity and latency, need to be considered. Taking these conditions into account, N T At least one of the following options may be considered as a specific example for determining / calculating.

[0382] (Option 1-1A-1) N, the mother code size determined based on a single transmission base N multiples of M T Decided to

[0383] According to Option 1-1A-, N T =N base It is determined as *M, and k0, the index of the RV starting point, is k0=N base It can be *rv_id. Due to the structural characteristics of polar codes, this method can support a structure where individual transmissions for all RVs are self-decodable (e.g., decoding is possible with only a single transmission). In addition, by providing a relatively long total mother code size in terms of the total coded bit length, it offers an advantage in improving coding gain due to retransmission.

[0384] (Option 1-1A-2) N, the mother code size determined based on a single transmission base N is a multiple of M / 2 T Decided to

[0385] According to Option 1-1A-2, N T =N base It is set to *M / 2, and k0, the index of the RV starting point, is k0=N base It can be / 2*rv_id. This method can provide a self-decodable structure for single transmissions of some RVs. For example, when M=4, self-decodable transmission and reception may be possible in a single transmission where RV0 and RV2 are set / indicated. Additionally, a structure may occur where the regions of the partially coded bits transmitted and received in each single transmission overlap, providing the benefits of repeated transmissions. Furthermore, a relatively short overall mother code size can be determined in terms of the total coded bits, which offers advantages in terms of decoding complexity and latency.

[0386] For example, referring to the example in Fig. 24, there may be bits that are not transmitted to any RV because the partial coded bits corresponding to different RVs are spaced apart. However, if the regions of the partial coded bits transmitted and received in each single transmission are configured to overlap as in Option 1-1A-2, the problem of bits located between RVs not being transmitted can be resolved, and the benefit of repeated transmission can also be obtained for the overlapped bits.

[0387] (Option 1-1A-3) N based on multiples of K, the size of the transmitted information T Method of determining

[0388] According to Option 1-1A-3, N is based on the value obtained by multiplying the information size K of the transmitting and receiving targets by a specific value L. T The size of can be determined. As a specific example of Option 1-1A-3, N TThe size of can be selected from powers of 2 adjacent to K*L, which may be the smallest value among powers of 2 greater than K*L (e.g., Equation 10) or the largest value among powers of 2 smaller than K*L (e.g., Equation 11).

[0389] [Mathematical Formula 10]

[0390]

[0391] [Mathematical Formula 11]

[0392]

[0393] N determined according to the above criteria T K0, the index of the RV starting point determined by the value, is k0=N T It can be / M*rv_id. The value of L can be designed considering the minimum code rate to be supported when retransmission is performed; for example, when considering a maximum code rate of 1 / 8, L can be set to 8. The proposed method is based on the value of K, which is the basic scheduling information of the transmission information, N T Since it determines the size of, a separate parameter (e.g., E) base or N base It can be applied even when ) is not defined, and also N suitable for the target code rate T It is advantageous in terms of using values.

[0394] The N proposed above T The options determining can be used in a single selected form or in a combined form. As one specific example of multiple options being combined, N by multiple options is T A method may be used in which candidate values ​​are calculated for each, and the larger (or smaller) value among them is selected. For example, Option 1-1A-1 (or Option 1-1A-2) is combined with Option 1-1A-3 to NT You can determine the value, and N is the larger or smaller value among the results calculated through each Option. T It can be determined by the value.

[0395] (N T Determination of calculation method)

[0396] A wireless communication system or terminal that supports the proposed method is a plurality of N T It can support calculation options (or combined options) and one N based on specific conditions T Select the calculation option N T It can be determined to decide the value. Multiple N T N of one of the calculation options T The specific method for selecting the calculation option may be one of the following Option 1-1B-1 to Option 1-1B-3 or a combination thereof.

[0397] (Option 1-1B-1) E base (or E) and / or N base Based on N T Determine the calculation method

[0398] According to Option 1-1B-1, E base The section where (or E) is located, or E base (or E) and N base Based on the relationship of N T The calculation method of can be determined. As a specific example, E base / N base The size of (or E / N base If it is above a specific threshold, the method of Option 1-1A-1 is used, and if it is below the threshold, the method of Option 1-1A-2 is used, so N T The value can be determined. In this case, the threshold value may be a value that is pre-agreed upon and used, or a value set or instructed by the base station. This involves the determined RV starting point and E baseWhen considering the value of (or E), it provides a favorable effect in reducing the rate of occurrence of missing coded bits (e.g., coded bits missing in transmission and reception when the value of E is relatively small compared to the interval of the RV starting point) or duplicate coded bits (coded bits duplicated between different single transmissions (re)transmissions when the value of E is relatively large compared to the interval of the RV starting point) in combinations of transmitted and received coded bits during the retransmission process, which can provide an advantage in improving decoding performance.

[0399] (Option 1-1B-2) N based on the code rate T Determine the calculation method

[0400] According to Option 1-1B-2, N based on the set / instructed code rate T The calculation method of can be determined. As a specific example, when Option 1-1A-3 is used, the value of L, which is a multiple multiplied by K based on the set / instructed code rate, can be determined. For instance, if the value of L corresponding to the code rate is predetermined, and the code rate is set / instructed for each scheduled (re)transmission, N is determined based on the value of L corresponding to the set / instructed code rate. T The value of can be determined. In this case, a relatively high L value corresponds to a relatively low code rate, and conversely, a relatively low L value corresponds to a relatively high code rate. This means that for the same amount of information, a relatively high E value is derived when the applied code rate is relatively low, and N considering this TSelecting a high value results in a relatively wider interval between RV starting points, and conversely, if the applied code rate is relatively high for the same amount of information, a relatively low E value is derived; considering this, N T By selecting a low value, it is possible to induce a result where the interval between RV starting points is relatively narrowed. This provides a favorable effect in reducing the rate of duplicate coded bits occurring between different single transmissions (re)transmissions, which can provide an advantage in improving decoding performance.

[0401] (Option 1-1B-3) N based on explicit settings / instructions of the base station T Determine the calculation method

[0402] According to Option 1-1B-3, N T The base station may explicitly set / instruct the method by which is calculated. In this case, the aforementioned explicit setting / instruction is that one of the pieces of information included in the signaling provided by the base station to the terminal is N T It may imply that it is used for the purpose of indicating the calculation method of. Specifically, the base station may set / instruct the terminal to one of Option 1-1A-1 or Option 1-1A-2, or set / instruct the L value used when Option 1-1A-3 is applied. For example, the base station may use N, which the terminal can apply to perform encoding or decoding through semi-static information such as RRC signaling. T The calculation method can be set. As another example, a base station uses signaling such as MAC CE to specify N T It can indicate whether to activate or deactivate the calculation method. As another example, the base station, through dynamic signaling such as DCI, [indicates] the N that the terminal applies.T The calculation method may be specified. The information set / specified above may be information commonly applied to the scheduling of all single transmissions that the terminal expects to transmit and receive, or information applied to single transmissions having certain characteristics. As an example of the above characteristics, N is the unit of wireless resources (e.g., carrier, BWP, etc.) that the terminal expects to transmit and receive. T A calculation method may be applied. Alternatively, N depending on the identifier (e.g., RNTI) used during the transmission and reception process. T Calculation methods may be applied differently. Alternatively, in the case of DCI-based scheduling grant-based transmission and reception, a method temporarily applied to a single transmission scheduled by the corresponding DCI may be used based on the DCI format used or the information contained in the DCI format. The proposed method involves a base station N T It provides an advantage in that it can increase the base station's scheduling flexibility by freely determining the calculation method and setting / instructing it to the terminal.

[0403] (N T (range of maximum / minimum values)

[0404] N proposed in the present disclosure T When an RV starting point determination method based on is used, N T The value of is the minimum value (hereinafter N Tmin ) and maximum value (hereinafter N Tmax It can be selected within the range of ). Specifically, N calculated based on one (or a combination of one or more) of the proposed methods above. T The value is N Tmin If smaller than N Tmin It is determined so that this is selected, or conversely, N calculated. T The value is N Tmax If greater than N Tmax can be selected. N TminIt can be determined for the purpose of using the minimum mother code size to guarantee minimum performance, considering the general characteristic that performance degrades when the coded bit length is short from the perspective of channel coding. Tmax can be set to a value configured to prevent an increase in the buffer size and decoding complexity required during the terminal's transmission and reception process. N Tmax The value can be set to a predetermined value, or it can be determined based on the capability considering the terminal's buffer size. For example, the maximum buffer size determined by the terminal's capability is B max-size When, N satisfies mathematical equation 12 Tmax It can be decided.

[0405] [Mathematical Formula 12]

[0406]

[0407] Or N to satisfy mathematical formula 13 Tmax is determined, and the size of the total coded bits that can actually be transmitted and received is B max-size It can be determined as.

[0408] [Mathematical Formula 13]

[0409]

[0410] (RV starting point shifting based on conditions)

[0411] According to one embodiment, from a reference point N TWe propose a method for determining the RV starting point by applying additional shifting when the RV starting point is determined at intervals of / M. This shifting operation can be configured to be applied only when specific situations occur; for example, the aforementioned specific situation may be one in which shortening is applied by scheduling parameters set or instructed for a single transmission. For example, the index of the entire coded bit is 0 to N T When M RV values ​​have a range of -1 and are 0, 1, ..., M-1 respectively, k0, which is the index of the RV starting point determined on the entire coded bit index based on the set / instructed RV value rv_id, can be expressed as Equation 14.

[0412] [Mathematical Formula 14]

[0413] k0=N T / M*rv_id+s_rv(rv_id)

[0414] Mathematical formula 14 is merely an example for illustrative purposes, and the present disclosure may also apply when the index of the entire coded bit is agreed upon in a different way, for example, in reverse order, and when the RV starting point is determined by considering additional shifting based on equal intervals relative to the agreed reference point.

[0415] In Equation 14, s_rv(rv_id) may be a factor that determines an additional shifting value determined by the set / instructed rv_id. When the additional shifting is determined based on whether shortening occurs, if shortening is not applied, the value of s_rv(rv_id) may be determined to be 0 for all rv_ids, and if shortening is applied, the size of the shortening applied based on RV0 may be determined as the value of s_rv(rv_id) for all or some rv_ids.

[0416] Whether additional shifting is applied and the magnitude thereof may be determined to be applied differently for each RV, and the specific form thereof may be at least one of the following Option 1-1C-1 to Option 1-1C-3.

[0417] (Option 1-1C-1) Apply additional shifting only to RV0

[0418] When the method proposed in Option 1-1C-1 is applied, additional shifting may be applied only to RV0 (e.g., RV with rv_id 0 based on Equation 14 in the entire coded bit), and additional shifting may not be applied to the remaining RVs. This can provide an advantage due to retransmission, considering that when RV0 is used for the initial transmission, applying shortening is advantageous when considering the decoding performance in a situation where only RV0 is received, and when RV0 is received but retransmission occurs and other RVs are additionally received, the effective code rate at the receiving end decreases, which may result in a coded bit transmission method (e.g., puncturing or repetition) that is more advantageous than shortening.

[0419] FIG. 25 illustrates examples of methods for determining the RV starting point when additional shifting is applied.

[0420] FIG. 15 (A) schematically illustrates an example of how the RV starting point is determined by applying the method proposed in Option 1-1C-1 when four RVs are in operation. In FIG. 15 (A), FG301A is N T It refers to the total coded bits of the length, with indices ranging from 0 to N in order from left to right. T Consider the case where it is set to -1. Additionally, FG 302A indicates a coded bit section that is not transmitted or received due to shortening, and is represented by the length of s_rv. When four distinct RVs are designated as RV0, RV1, RV2, and RV3 respectively, and the rv_id values ​​are set to 0, 1, 2, and 3, the RV starting point is 0 + s_rv (FG 303A), N, in ascending order of rv_id. T / 4 (FG 304A), 2*N T / 4 (FG 305A), and 3* N T It is determined at the position of / 4 (FG 306A). FG 307A, FG 308A, FG 309A, and FG 310A represent the range of the coded bits to which each RV is applied when the RV starting point is determined according to each rv_id. The example in FIG. 15 (A) is one embodiment for convenience of explanation and the application of the proposed method is not limited to the example in FIG. 15 (A).

[0421] (Option 1-1C-2) Apply additional shifting to all RVs

[0422] When the method proposed in Option 1-1C-2 is applied, additional shifting may be applied equally to all RV values. In this case, if the application of additional shifting is determined by whether shortening is applied, the size of the additional shifting applied can be set to be the same for all values ​​that take shortening into account. This may be advantageous in that it provides the same decoding gain due to shortening when considering a self-decodable single transmission, provided that the E value set / instructed for each (re)transmission is the same or similar.

[0423] FIG. 25 (B) schematically illustrates an example of how the RV starting point is determined by applying the method proposed in Option 1-1C-2 when four RVs are in operation. In FIG. 25 (B), FG301B is N T It refers to the total coded bits of the length, with indices ranging from 0 to N in order from left to right. T Consider the case where it is set to -1. Additionally, FG 302B indicates a coded bit section that is not transmitted or received due to shortening, and is represented by the length of s_rv. When four distinct RVs are designated as RV0, RV1, RV2, and RV3 respectively, and the rv_id values ​​are set to 0, 1, 2, and 3, the RV starting point is 0 + s_rv (FG 303B), in ascending order of rv_id. T / 4+s_rv (FG 304B), 2*N T / 4+s_rv (FG 305B), and 3* N TIt is determined at the position of / 4+s_rv (FG 306B). FG 307B, FG 308B, FG 309B, and FG 310B represent the range of the coded bits to which each RV is applied when the RV starting point is determined according to each rv_id. The example in FIG. 25 (B) is one embodiment for convenience of explanation and the application of the proposed method is not limited to the case of the example in FIG. 25 (B).

[0424] (Option 1-1C-3) Apply additional shifting to certain RVs

[0425] When the method proposed in Option 1-1C-3 is applied, additional shifting can be applied to some RVs while not applied to the remaining RVs (e.g., the value of s_rv is set to 0). For instance, the RVs to which additional shifting is applied can be designated as those with even rv_id, while those with odd rv_id can be designated as those to which additional shifting is not applied. In this case, if the application of additional shifting is determined by whether shortening is applied, the magnitude of the additional shifting applied to the RVs to which additional shifting is applied can be set to be the same for all, taking shortening into account. This provides a structure advantageous for guaranteeing self-decodable characteristics for some RVs and providing decoding performance gains that consider the effect of reducing the effective code rate through retransmission for the remaining RVs. It also offers the effect of increasing the freedom of the base station to support self-decodable RVs as needed or to select RVs that are advantageous for retransmission decoding performance.

[0426] FIG. 25 (C) schematically illustrates an example of how the RV starting point is determined by applying the method proposed in Option 1-1C-3 when four RVs are in operation. In FIG. 25 (C), FG301C is N T It refers to the total coded bits of the length, with indices ranging from 0 to N in order from left to right. T Consider the case where it is set to -1. Additionally, FG 302C indicates a coded bit section that is not transmitted or received due to shortening, and is represented by the length of s_rv. When four distinct RVs are designated as RV0, RV1, RV2, and RV3 respectively, and the rv_id values ​​are set to 0, 1, 2, and 3, the RV starting point is 0 + s_rv (FG 303C), N, in ascending order of rv_id. T / 4 (FG 304C), 2*N T / 4+s_rv (FG 305C), and 3* N T It is determined at the position of / 4 (FG 306C). FG 307C, FG 308C, FG 309C, and FG 310C represent the range of the coded bits to which each RV is applied when the RV starting point is determined according to each rv_id. The example in FIG. 25 (C) is one embodiment for convenience of explanation and the application of the proposed method is not limited to the case of the example in FIG. 25 (C).

[0427] ***

[0428] [Option 1-2] E base Determine the RV starting point based on

[0429] E that applies commonly to all single transfers of the same TB base When the value is defined, E base We propose a method for determining the RV starting point based on the size of . Specifically, the above E baseis a value commonly applied to each and every single transmission when (re)transmission is performed for the same TB, and can be determined based on scheduling parameters; for example, it can be determined based on the amount of information K to be transmitted and received, the code rate R applied to each single transmission, and / or the length E of the rate-matched coded bit applied to each single transmission. For example, based on the value of E, E base When this is determined, as a specific example, the scheduleable E values ​​are divided into intervals, and the E corresponding to each interval base A method of determining the value according to the agreement can be used.

[0430] The RV starting point is E base As a specific example determined based on, E base A Q value calculated based on [this] is defined, and an RV starting point can be determined at intervals of Q values ​​from a reference point. In this case, the reference point determining the RV starting point is the position where the entire coded bit begins, for example, where the index of the entire coded bit is from 0 to N T When the range is -1, it can be set to the value of index 0. For example, the index of the entire coded bit is from 0 to N T When M RV values ​​have a range of -1 and are 0, 1, ..., M-1 respectively, k0, which is the index of the RV starting point determined on the entire coded bit index based on the set / instructed RV value rv_id, can be expressed as Equation 15.

[0431] [Mathematical Formula 15]

[0432] k0=Q*rv_id

[0433] The example of mathematical formula 15 is merely an example for illustrative purposes, and the present disclosure may be applied when the index of the entire coded bit is agreed upon in a different way, for example, in reverse order, and the RV starting point is determined based on equal intervals relative to the agreed reference point.

[0434] FIG. 26 shows the basic rate matching output sequence length (E base An example of determining each RV starting point based on ) is illustrated. Specifically, FIG. 26 schematically shows an example of how the RV starting point is determined according to Equation 15 when four RVs are in operation.

[0435] Referring to Fig. 26, FG 401 is N T It refers to the total coded bits of the length, with indices ranging from 0 to N in order from left to right. T Consider the case where it is set to -1. When four different RVs are designated as RV0, RV1, RV2, and RV3, and each rv_id value is set to 0, 1, 2, and 3, the RV starting points are set to positions 0 (FG 402), Q (FG 403), 2*Q (FG 404), and 3*Q (FG 405) in ascending order of rv_id. The example in FIG. 26 is one embodiment for convenience of explanation, and the application of the proposed method is not limited to the case of the example in FIG. 26.

[0436] In this way, E base When the RV starting point is determined based on Q derived from, the occurrence of missing coded bits between each single transmission in situations where retransmission occurs can be reduced, which can provide advantageous effects in terms of improving encoding / decoding complexity and decoding performance. In particular, E baseIf it is designed to be similar to the actual scheduled E value, a higher gain through this effect can be expected.

[0437] (Q decision)

[0438] For the method proposed in Option 1-2 to be applied, the understanding of the criteria for determining the value of Q must be the same between the transmitting and receiving ends, and a method for this is required. As specific examples for determining the value of Q, at least one of the following Options 1-2Q-1 to 1-2Q-3 may be considered.

[0439] (Option 1-2Q-1) Q = E base Decided to

[0440] If Option 1-2Q-1 is used, Q=E base It is determined as such, and k0, the index of the RV starting point, is k0=E base *rv_id can be. This is E base If designed for the purpose of determining the RV starting point or designed with the determination of the RV starting point in mind, it provides an advantageous effect in that the RV starting point can be determined without separate additional calculations.

[0441] (Option 1-2Q -2) Q = E base +Δ RV Decided to

[0442] If Option 1-2Q-2 is used, Q is E base Δ RV can be set as the value to be added. If the magnitude of Q is determined to be uniform, Δ RV has a common value for all RVs, and in this case, k0, the index of the RV starting point, is k0=(E base +Δ RV It can be )*rv_id. Common Δ RVWhen used, the transmitting and receiving ends have the advantage of simplifying the process of calculating the RV starting point. Alternatively, to support structures with different Q magnitudes, Δ RV The value of can be set differently for each RV (e.g., if rv_id is set / instructed, Δ RV (rv_id is applied), and k0, which is the index of the RV starting point, can satisfy Equation 16.

[0443] [Mathematical Formula 16]

[0444]

[0445] Different Δ RV The application of may be useful for the purpose of applying different RV starting points advantageous for each single transmission. The method proposed in Option 1-2Q-2 is E used for other purposes. base If you intend to determine the Q value using this, it may be suitable for the purpose of setting the RV starting point to a position advantageous for decoding performance in (re)transmission.

[0446] As an example of how Option 1-2Q-2 is used, if the above E base If the size is set to the relatively smaller value among the lengths of the rate-matched coded sequences applicable to each single transmission, Δ RV It may be useful to set the value of to a positive integer. This can be advantageous for reducing the overlap of coded bits between single transmissions with different RVs, thereby increasing the length of the coded bits actually transmitted and received during retransmission, and thereby lowering the effective code rate.

[0447] As an example of how Option 1-2Q-2 is used, if the above E baseIf the size is set to the relatively larger value among the lengths of the rate-matched coded sequences applicable to each single transmission, Δ RV It may be useful to set the value of to a negative integer. This can be advantageous in preventing the degradation of decoding performance by reducing the proportion of coded bits that are not transmitted or received out of the total coded bits, even after all (re)transmissions have been performed.

[0448] (Option 1-2Q-3) E base Select one from the candidates for the promised Q value based on

[0449] When Option 1-2Q-3 is used, there are multiple candidates for the agreed-upon Q value between the transmitter and receiver, and when the actually applied Q value is selected from the candidates, E base A selection can be made based on . As a specific example, E base A method can be used to select the minimum value among candidates with Q values ​​greater than or equal to the value. This has the advantage of indicating an RV starting point favorable for retransmission by pre-selecting Q values ​​favorable for retransmission as candidates and selecting a Q value from among the selected candidates. For example, to select a structure favorable for retransmission, the Q value is selected from powers of 2 (or for any multiple of 2 D, N base It can be determined (to be selected from multiples of / D). When the method of Option 1-2Q-3 is used, E base The role of can be replaced by E (e.g., the length of the rate-matched coded sequence actually applied to the single transmission), and this can be a method in which there are multiple candidates for the Q value agreed upon between the transmitting and receiving ends, and when the actual applied Q value is selected among the candidates, the selection is made based on E.

[0450] (NT (Calculation of)

[0451] For the method proposed in Option 1-2 to be applied, N T The understanding of the criteria for determining must be identical between the transmitting and receiving ends, and a method for this is required. T Since the length determines the total coded bit length, it must be determined by considering the decoding performance of the total coded bits; furthermore, the length of the code rate supported by the channel coding used, as well as the impact of decoding complexity and latency, need to be considered. Taking these conditions into account, N T As specific examples for determining , at least one of the following Options 1-2A-1 to 1-2A-4 may be considered.

[0452] (Option 1-2A-1) N, the mother code size determined based on a single transmission base N multiples of M T Decided to

[0453] N when Option 1-2A-1 is used T =N base It can be set to *M. This increases the length of the total coded bits, providing an effect that is advantageous for lowering the effective code rate in terms of the total coded bits, and this provides a structure that is advantageous for improving decoding performance when the number of actual transmitted and received coded bits in the total coded bits is sufficient.

[0454] (Option 1-2A-2) N, the mother code size determined based on a single transmission base N is a multiple of M / 2 T Decided to

[0455] N when Option 1-2A-2 is used T =N baseIt can be set to *M / 2. This provides an advantageous effect in reducing the complexity of the terminal required for encoding and decoding by setting the total coded bit length short, and at the same time, provides an advantageous structure in that it can reduce the proportion of bits that are not transmitted (e.g., included in puncturing intervals) during the actual transmission and reception process.

[0456] (Option 1-2A-3) N based on multiples of K, the size of the transmitted information T Decide

[0457] When Option 1-2A-3 is used, N is based on the value obtained by multiplying the information size K of the transmitting and receiving targets by a specific value L. T It can be set to determine the size of. As a specific example of Option 1-2A-3, N T The size of can be selected from powers of 2 adjacent to K*L, which may be the smallest power of 2 greater than K*L (e.g., Equation 17) or the largest power of 2 smaller than K*L (e.g., Equation 18).

[0458] [Mathematical Formula 17]

[0459]

[0460] [Mathematical Formula 18]

[0461]

[0462] The value of L can be designed by considering the minimum code rate to be supported when retransmission is performed; for example, when considering a maximum code rate of 1 / 8, L can be set to 8. The proposed method is based on the value of K, which is the basic scheduling information of the transmission information, and N T Since it determines the size of, a separate parameter (e.g., E) baseor N base It can be applied even when ) is not defined, and also N suitable for the target code rate T It is advantageous in terms of using values.

[0463] (Option 1-2A-4) N multiplied by M of Q T Decided to

[0464] When Option 1-2A-4 is used, and the Q value is uniform, N based on Q*M T The value can be set. If the Q value is set differently (e.g., the interval between RV starting points is not uniform), one Q value is designated as the representative value, Q. A Based on Q A N based on *M T The value can be determined. In the following explanation, since the Q value is uniform, N is based on Q*M. T Although the proposed methods are explained primarily focusing on how Q is determined, the proposed methods also address cases where Q values ​​are non-uniform (e.g., Q A N based on *M T (If determined) that concept may be maintained and applied identically. As a specific example of Option 1-2A-4, N T The size of can be selected from powers of 2 adjacent to Q*M, which may be the smallest power of 2 greater than Q*M (e.g., Equation 19) or the largest power of 2 smaller than Q*M (e.g., Equation 20).

[0465] [Mathematical Formula 19]

[0466]

[0467] [Mathematical Formula 20]

[0468]

[0469] Q is E baseConsidering the case where the value is determined based on, the method proposed in Option 1-2A-4 sets Q to E base It can be applied by replacing it with. Specifically, N T The value is E base It can be determined based on *M, for example, N T The size of is E base It can be decided to select a power of 2 adjacent to *M, which is E base It can be the smallest power of 2 greater than *M (e.g., Equation 21) or the largest power of 2 smaller than Q*M (e.g., Equation 22).

[0470] [Mathematical Formula 21]

[0471]

[0472] [Mathematical Formula 22]

[0473]

[0474] In terms of determining the value by considering the length of the rate-matched coded sequence, the proposed method is N, with a size adjacent to the number of coded bits actually transmitted and received when all (re)transmissions are performed. T In terms of determining the size of the mother code required for actual transmission and reception, it has an advantageous effect in that it can determine the size of the mother code required for actual transmission and reception.

[0475] The N proposed above T The options determining can be used in a single selected form or in a combined form. As one specific example of multiple options being combined, N by multiple options is T A method may be used in which candidate values ​​are calculated for each, and the larger (or smaller) value among them is selected. For example, Option 1-2A-1 (or Option 1-2A-2) is combined with Option 1-2A-3 (or Option 1-2A-4) to N TYou can determine the value, and N is the larger or smaller value among the results calculated through each Option. T It can be determined by the value.

[0476] (N T Determination of calculation method)

[0477] A wireless communication system or terminal that supports the proposed method is a plurality of N T It supports calculation options (or combined options) and one N based on specific conditions. T Select the calculation option N T It can be determined to decide the value. Multiple N T N of one of the calculation options T The specific method for selecting the calculation option may be one of the following Option 1-2B-1 to Option 1-2B-3 or a combination thereof.

[0478] (Option 1-2B-1) E base (or E) and / or N base Based on N T Determine the calculation method

[0479] If Option 1-2B-1 is used, E base The section where (or E) is located, or E base (or E) and N base Based on the relationship of N T The calculation method of can be determined. As a specific example, E base / N base The size of (or E / N base If it is above a specific threshold, the method of Option 1-2A-1 is used, and if it is below, the method of Option 1-2A-2 is used, so N T A method for determining the value may be used. In this case, the threshold value may be a value that is pre-agreed upon and used, or a value that is set or instructed by the base station. This involves the determined RV starting point and E baseWhen considering the value of (or E), it provides a favorable effect in reducing the rate of occurrence of missing coded bits (e.g., coded bits missing in transmission and reception when the value of E is relatively small compared to the interval of the RV starting point) or duplicate coded bits (coded bits duplicated between different single transmissions (re)transmissions when the value of E is relatively large compared to the interval of the RV starting point) in combinations of transmitted and received coded bits during the retransmission process, which can provide an advantage in improving decoding performance.

[0480] Q is E base Considering the case where the value is determined based on, the method proposed in Option 1-2B-1 is E base It can be applied by replacing it with Q. A specific example is Q / N base If the size of is above a specific threshold, the method of Option 1-2A-1 is used, and if it is below, the method of Option 1-2A-2 is used so that N T A method in which the value is determined may be used. Or, when the method of Option 1-2A-4 is used, Q / N base If the size of is greater than or equal to a specific threshold, the smallest power of 2 greater than Q*M (e.g., Equation 19) is used, and if it is less than, the largest power of 2 smaller than Q*M (e.g., Equation 20) is used, so N T A method for determining the value can be used.

[0481] (Option 1-2B-2) N based on the code rate T Determine the calculation method

[0482] If Option 1-2B-2 is used, N based on the set / instructed code rate T The calculation method can be determined.

[0483] When Option 1-2A-3 is used as a specific example for Option 1-2B-2, a value of L, which is a multiple multiplied by K, can be determined based on the set / instructed code rate. For example, if a value of L corresponding to a code rate is predetermined, and when a code rate is set / instructed for each scheduled (re)transmission, N is determined based on the value of L corresponding to the set / instructed code rate. T The value of can be determined. In this case, a relatively high L value corresponds to a relatively low code rate, and conversely, a relatively low L value corresponds to a relatively high code rate. This means that for the same amount of information, a relatively high E value is derived when the applied code rate is relatively low, and N considering this T Selecting a high value results in a relatively wider interval between RV starting points, and conversely, if the applied code rate is relatively high for the same amount of information, a relatively low E value is derived; considering this, N T By selecting a low value, it is possible to induce a result where the interval between RV starting points is relatively narrowed. This provides a favorable effect in reducing the rate of duplicate coded bits occurring between different single transmissions (re)transmissions, which can provide an advantage in improving decoding performance.

[0484] (Option 1-2B-3) N based on explicit settings / instructions of the base station T Determine the calculation method

[0485] If Option 1-2B-3 is used, N T A method may be used in which the base station explicitly sets / instructs the method by which is calculated, wherein the said explicit setting / instruction is one of the pieces of information included in the signaling provided by the base station to the terminal, NT It means that it is used for the purpose of indicating the calculation method of. Specifically, the base station may set / instruct the terminal to one of Option 1-2A-1 or Option 1-2A-2, or may set / instruct the L value used when Option 1-2A-3 is applied. For example, by providing semi-static information such as RRC signaling, the base station provides N that the terminal can apply to perform encoding or decoding. T The calculation method can be set. As another example, a base station uses signaling such as MAC CE to specify N T It can indicate whether to activate or deactivate the calculation method. As another example, the base station, through dynamic signaling such as DCI, [indicates] the N that the terminal applies. T The calculation method may be specified. The information set / specified above may be information commonly applied to the scheduling of all single transmissions that the terminal expects to transmit and receive, or information applied to single transmissions having certain characteristics. As an example of the above characteristics, N is the unit of wireless resources (e.g., carrier, BWP, etc.) that the terminal expects to transmit and receive. T It can be determined that a calculation method is applied, or that the NT calculation method is applied differently depending on the identifier (e.g., RNTI) used during the transmission and reception process, or, in the case of DCI-based scheduling grant-based transmission and reception, a method may be used that is temporarily applied to a single transmission scheduled by the corresponding DCI based on the DCI format used or the information contained in the DCI format. The proposed method is for the base station N T It provides an advantage in that it can increase the base station's scheduling flexibility by freely determining the calculation method and setting / instructing it to the terminal.

[0486] (N T (range of maximum / minimum values)

[0487] As an example of when the above proposed measures are used, N T The value of is the minimum value (hereinafter N Tmin ) and maximum value (hereinafter N Tmax It can be selected within the range of ). Specifically, N calculated based on one (or a combination of one or more) of the proposed methods above. T The value is N Tmin If smaller than N Tmin It is determined so that this is selected, or conversely, N calculated. T The value is N Tmax If greater than N Tmax Ga N T Can be selected as a value. N Tmin It can be determined for the purpose of using the minimum mother code size to guarantee minimum performance, considering the general characteristic that performance degrades when the coded bit length is short from the perspective of channel coding. Tmax can be set to a value configured to prevent an increase in the buffer size and decoding complexity required during the terminal's transmission and reception process. N Tmax The value can be set to a predetermined value, or it can be determined based on the capability considering the terminal's buffer size. For example, the maximum buffer size determined by the terminal's capability is B max-size When, it can be determined to satisfy Equation 12. Or N to satisfy Equation 13. Tmax is determined, and the size of the total coded bits that can actually be transmitted and received is B max-size It can be determined as.

[0488] If N Tmin or N Tmax Ga N TIf determined by the value, the size of Q determining the RV starting point in Option 1-2 is the determined N T It can be determined based on the value. For example, N Tmin This N T If determined as Q=N Tmin It is determined by the size of / M, and N Tmax Ga N T If determined as Q=N Tmax It can be determined by the size of / M.

[0489] (RV starting point shifting based on conditions)

[0490] According to one embodiment, a method is proposed for determining the RV starting point by applying additional shifting when the RV starting point is determined at an interval of Q from a reference point. This shifting operation may be configured to be applied only when a specific situation occurs; for example, the specific situation may be a situation in which shortening is applied by a scheduling parameter set / instructed for a single transmission. For example, the index of the entire coded bit is 0 to N T When M RV values ​​have a range of -1 and are 0, 1, ..., M-1 respectively, k0, which is the index of the RV starting point determined on the entire coded bit index based on the set / instructed RV value rv_id, can be expressed as Equation 23.

[0491] [Mathematical Formula 23]

[0492] k0=Q*rv_id+s_rv(rv_id)

[0493] The example of mathematical formula 23 is merely an example for illustrative purposes, and the present disclosure may be applied when the index of the entire coded bit is agreed upon in a different way, for example, in reverse order, and when the RV starting point is determined by considering additional shifting based on equal intervals relative to the agreed reference point.

[0494] In Equation 23, s_rv(rv_id) can be set as a factor that determines an additional shifting value determined according to the set / instructed rv_id. When the additional shifting is determined based on whether shortening occurs, if shortening is not applied, the value of s_rv(rv_id) can be determined as 0 for all rv_ids, and if shortening is applied, the size of the shortening applied based on RV0 can be determined as the value of s_rv(rv_id) for all or some rv_ids.

[0495] Whether additional shifting is applied and the magnitude thereof may be determined to be applied differently for each RV, and the specific form thereof may be at least one of the following Options 1-2C-1 to 1-2C-3.

[0496] (Option 1-2C-1) Apply additional shifting to all RVs

[0497] When the method proposed in Option 1-1C-2 is applied, additional shifting may be applied equally to all RV values. In this case, if the application of additional shifting is determined by whether shortening is applied, the size of the additional shifting applied can be set to be the same for all, taking shortening into account. This may be intended to equally reflect the effect of the additional shifting applied in RV0 to the remaining RVs, considering that when the method of Option 1-2 is applied, the reference point of the RV starting point of each single transmission is determined by its position relative to the single transmission of the previous RV.

[0498] FIG. 27 illustrates another example of a method for determining the RV starting point when additional shifting is applied. Specifically, FIG. 27 schematically shows an example of a method for determining the RV starting point by applying the method proposed in Option 1-2C-1 when four RVs are in operation.

[0499] Referring to Fig. 27, FG 501 is N T It refers to the total coded bits of the length, with indices ranging from 0 to N in order from left to right. T Consider the case where it is set to -1. Additionally, FG 502 indicates a coded bit section that is not transmitted or received due to shortening, and is represented by the length of s_rv. When four distinct RVs are designated as RV0, RV1, RV2, and RV3 respectively, and the rv_id values ​​are set to 0, 1, 2, and 3, the RV starting point is 0 + s_rv (FG 503), N, in ascending order of rv_id. T / 4+s_rv (FG 504), 2*N T / 4+s_rv (FG 505), and 3* N TIt is set to the position of / 4+s_rv (FG 506). The example in FIG. 27 is one embodiment for convenience of explanation and the application of the proposed method is not limited to the case of the example in FIG. 27.

[0500] ***

[0501] [Option 1-3] Apply different methods for determining the RV starting point depending on the RV

[0502] According to one embodiment, the RV starting point determination method may be applied differently depending on the RV. Specifically, the different RV starting point determination methods may be the methods of Option 1-1 and Option 1-2 proposed above.

[0503] As a specific example, in the case where 4 RVs are applied and used, RV0 and RV2 apply the method of Option 1-1 and N T The RV starting point is determined based on / 4, and the method of Option 1-2 is applied to RV1 and RV2, so that the RV starting point considering the Q interval can be determined using RV0 and RV1 as reference points, respectively. For example, the index of the entire coded bit is from 0 to N T When the four RV values ​​are 0, 1, 2, and 3, respectively, k0, which is the index of the RV starting point determined on the entire coded bit index based on the set / instructed RV value rv_id, can be expressed as in Equation 24.

[0504] [Mathematical Formula 24]

[0505]

[0506] The example of mathematical formula 24 is merely an example for illustrative purposes, and the present disclosure may be applied when the index of the entire coded bit is agreed upon in a different way, for example, in reverse order, and when the RV starting point is determined by considering additional shifting based on equal intervals relative to the agreed reference point.

[0507] FIG. 28 illustrates examples of applying different RV starting point determination methods depending on the RV. Specifically, FIG. 28 schematically shows an example in which Option 1-3 above is applied.

[0508] First, Figure 28 (A) shows the case where the s_rv value is applied as 0 for all RVs, and this may correspond to, for example, the case where shortening is not applied (e.g., when repetition or puncturing is applied to a single transmission). FG 601A is N T It refers to the total coded bits of the length, with indices ranging from 0 to N in order from left to right. T Consider the case where it is set to -1. When four distinct RVs are designated as RV0, RV1, RV2, and RV3, and their rv_id values ​​are set to 0, 1, 2, and 3, the RV starting points are 0 (FG 603A), Q (FG 604A), and 2*N in ascending order of rv_id. T / 4 (FG 605A), and 2*N T It is determined to the position of / 4+Q (FG 606A). Example (A) of FIG. 28 is one embodiment for convenience of explanation and the application of the proposed method is not limited to the case of said example.

[0509] Next, Figure 28 (B) shows the case where a common non-zero value is applied as the s_rv value for all RVs, for example, when shortening is applied (e.g., when repetition or puncturing is not applied to the entire / partial single transmission). FG 601B is N T It refers to the total coded bits of the length, with indices ranging from 0 to N in order from left to right. T Consider the case where it is set to -1. FG 602B refers to coded bits that are not transmitted or received due to shortening. When four distinct RVs are designated as RV0, RV1, RV2, and RV3 respectively, and the rv_id values ​​are set to 0, 1, 2, and 3, the RV starting points are s_rv (FG 603B), Q+s_rv (FG 604B), and 2*N in ascending order of rv_id. T / 4+s_rv (FG 605B), and 2*N T It is determined to the position of / 4+Q+s_rv (FG 606B). Example (B) of FIG. 28 is one example for convenience of explanation and the application of the proposed method is not limited to the case of said example.

[0510] The method of Option 1-3 provides a structure that facilitates self-decodability for the transmission of some RVs, which can be expected for single transmissions reflecting the structure of Option 1-1. Additionally, the method of Option 1-3 provides a structure that facilitates the transmission of coded bits contiguous (or adjacent) to the transmission of the previous RV through the transmission of some RVs, which can be expected for single transmissions reflecting the structure of Option 1-2. The base station can select and set / instruct an RV suitable for the terminal by considering these structural features and different benefits, and this provides benefits in terms of scheduling flexibility in that it allows the base station to apply an RV starting point appropriate to the situation.

[0511] ***

[0512] [Proposal 2] Conditional partial wrap-around repetition

[0513] In Proposal 2 below, for the convenience of explanation, the length of the total coded bits is N T and 0 to N T It is assumed that the structure is represented by an index of -1, and that when a coded bit included in a single transmission is selected, a sequential selection is performed based on the index of the entire coded bit. However, the structure assumed in the description is merely one example that can express the proposed method, and the present disclosure is not limited thereto and can be applied to a coded bit representation method of another structure.

[0514] Proposal 2 proposes a method for determining the range of coded bits selected from an RV starting point to select coded bits included in a single transmission, and / or a method for performing rate matching on each single transmission unit in consideration of this. In this case, the range of partial coded bits included in a single transmission can be set from an RV starting point (k0), which is determined based on an RV value set / instructed for the corresponding single transmission, to an RV ending point (k1), which is the index of the coded bit determined by a specific rule. In this case, the number of partial coded bits included in a single transmission may be equal to or less than the length (E) of the rate-matched coded sequence assigned to the single transmission. If the number of partial coded bits included in a single transmission is less than E, a repetition structure in which some of the partial coded bits are repeated may be used.

[0515] As a specific example, we propose a method for determining whether to apply partial wrap-around repetition of coded bits based on the RV starting point (k0) applied to a single transmission and the length (E) of the rate-matched coded sequence.

[0516] For example, one or more candidate boundary values ​​(W-boundaries) are defined, and a specific threshold (W-threshold) corresponding to each candidate W-boundary is defined. If the value of k0+E-1 exceeds the specific W-threshold, the W-boundary corresponding to the specific W-threshold is deactivated and is not considered; if the value of k0+E-1 is less than or equal to the specific W-threshold, the W-boundary corresponding to the specific W-threshold may be activated. The device may select the smallest W-boundary among the activated W-boundary(s) and perform a partial wrap-around repetition operation based thereon.

[0517] For example, for a W-boundary selected in this way, if the value of k0+E-1 is less than or equal to the W-boundary, k1 can be determined as k0+E-1, and if the value of k0+E-1 exceeds the W-boundary, k1 is determined as the index of the W-boundary and partial wrap-around repetition can be performed. For example, this process can be expressed as Equation 25.

[0518] [Mathematical Formula 25]

[0519] k1=min (k0+E-1, k2)

[0520] In mathematical formula 25, k2 represents the index of the coded bit corresponding to the W-boundary.

[0521] k1 according to the above process <k0+E-1의 조건이 만족되는 경우, 다시 말해, partial warp around repetition이 수행되는 경우, 단일전송에 포함되도록 선택된 일부 coded bit이 E보다 작은 길이를 갖게 되며, 단일전송을 구성하기 위하여 일부 coded bit이 추가로 선택되는 repetition이 수행될 수 있다. 상기 repetition의 과정은, 전체 coded bit 내에서 상기 결정에 사용된 W-boundary에 대응되는 특정 coded bit 구간 (W-block)에 속한 bit들 중 일부를 추가 선택하는 동작이 포함되며, 이 때 추가 선택되는 bit의 개수는 E-(k1-k0+1)개의 bit일 수 있다.

[0522] FIG. 29 illustrates an example of coded bit selection for a single transmission according to RV based on partial wrap-around repetition. Specifically, it schematically shows an example in which k1, the RV ending point, is selected according to the above proposal.

[0523] Referring to FIG. 29, the entire coded bit is arranged in index order, and one grid represents one coded bit. FIG. 29 (A) and (B) illustrate examples of two different situations. In both FIG. 29 (A) and (B), FG 701 and FG 703 show the location corresponding to the W-threshold, and FG 702 and FG 704 show the location of the W-boundary corresponding to FG 701 and FG 703, respectively. Additionally, FG 705 shows the location of k0, which is the RV starting point.

[0524] Figures 29 (A) and (B) both consider a situation where the value of k0+E-1 calculated according to the set / directed scheduling parameter is greater than W-threshold #n-1 (FG 701), and as a result, W-boundary #n-1 (FG 702) is disabled and no longer considered. Additionally, the situation considers where the value of k0+E-1 is smaller than W-threshold #n (FG 703), so W-boundary #n (FG 704) is enabled and selected.

[0525] In this case, Figure 29 (A) shows a case where the calculated value of k0+E-1 (FG 706) is smaller than the W-boundary (FG 704) currently selected and considered by the device, and as a result, k1 is determined to be k0+E-1.

[0526] On the other hand, the example in (B) of FIG. 29 shows a case where the calculated value of k0+E-1 (FG 707) is greater than the W-boundary (FG 704) selected and considered by the current device, and thus the value of k1 is determined to be the W-boundary (FG 708).

[0527] The example in FIG. 29 is one embodiment for convenience of explanation, and the application of the proposed method is not limited to the case of the example in FIG. 29.

[0528] The method proposed in Proposal 2 provides a structure that is advantageous for improving decoding performance gains when considering the structure in which encoding is performed through polar codes and the self-decodable characteristics of each single transmission. Characteristically, when a polar code based on a 2x2 kernel matrix / polar encoding matrix is ​​used, the size of the mother code is determined as a power of 2. In this case, if a specific E value is set / indicated, the mother code size to be used can be selected from Equation 26 and Equation 27.

[0529] [Mathematical Formula 26]

[0530]

[0531] [Mathematical Formula 27]

[0532]

[0533] It is desirable for the device to determine the mother code size that is advantageous for decoding performance between Equation 26 and Equation 27. In this case, if the difference between Equation 26 and E is insufficient, repeatedly transmitting coded bits generated based on the mother code size of Equation 26 generally yields better performance compared to transmitting additional coded bits using Equation 27; conversely, if the difference between Equation 26 and E is large, it may be advantageous to utilize the effect of reducing the code rate by transmitting additional coded bits using Equation 27. Furthermore, when aiming to support a self-decodable structure for each single transmission, the proposed method has an advantage in that it provides a favorable structure that prioritizes the decoding performance of the transmitted and received single transmissions.

[0534] (Determination of W-boundary)

[0535] For example, the locations of the candidate W-boundaries are N base (or N T It can be determined based on ). The specific method may be used by applying at least one of the following Option 2-1-1 and 2-1-2.

[0536] (Option 2-1-1) The location of the candidate W-boundary is N base Determined based on multiples of

[0537] The locations of the candidate W-boundaries are N base It can be determined based on multiples of . For example, the total length of the coded bits is N Tand the index of each coded bit is from 0 to N T It is expressed in the range of -1 and N T / N base When =L, the coded bit index corresponding to the position of the candidate W-boundary is w*N for natural numbers w from 1 to L. base It can be determined by numbers satisfying -1. As a specific example, when L=4, N base -1, 2*N base -1, 3*N base -1 and 4*N base -1 can be set as candidate W-boundaries. If N T Ga N base If it is not a multiple of , L can be determined based on Equation 28, candidates for the W-boundary are determined based on the corresponding L value, and N T It can be decided to add the location of -1 to the candidate W-boundary.

[0538] [Mathematical Formula 28]

[0539]

[0540] or N base In another way that produces a similar effect to the method using multiples of, the locations of candidate W-boundaries are N T A method based on the number of RVs can be used for determination. For example, the total length of the coded bits is N T and the index of each coded bit is from 0 to N T In the case where it is expressed in the range of -1 and M RVs can be set / indicated, the index of the coded bit corresponding to the position of the candidate W-boundary is w*(N for natural numbers w from 1 to M T They can be determined by numbers satisfying / M)-1. As a specific example, in the case where M=4 (N T / M)-1, 2*(N T / M)-1, 3*(N T / M)-1 and 4*(N T / M)-1 can be designated as candidate W-boundaries. If N T If is not a power of 2 (e.g., not a power that can be calculated based on the basis size of the kernel matrix), N T The smallest power of 2 greater than N T+1 When saying N T+1 Based on , the coded bit index corresponding to the position of the candidate W-boundary is w*(N for natural numbers w from 1 to M-1). T+1 Numbers satisfying / M)-1 and N T It can be set to -1.

[0541] The proposed method has an advantage in that it provides an opportunity for warp-around repetition to occur for every RV transmission, thereby allowing each individual transmission to gain decoding performance benefits from a self-decodable perspective.

[0542] (Option 2-1-2) The location of the candidate W-boundary is N base Determined based on powers of 2 greater than or equal to

[0543] The location of the candidate W-boundary is N base It can be determined based on powers of 2 greater than or equal to it. For example, the total length of the coded bits is N T and the index of each coded bit is from 0 to N T It is expressed in the range of -1 and N T / N base =2 L In this case, the index of the coded bit corresponding to the position of the candidate W-boundary is 2 for integers w from 0 to L. w *N base It can be determined by numbers satisfying -1. As a specific example, when L=4, N base-1, 2*N base -1 and 4*N base -1 can be set as candidate W-boundaries. If N T Ga N base If it is not a multiple of , the coded bit index corresponding to the position of the candidate W-boundary is 2 for integers w from 0 to L-1. w *N base Numbers satisfying -1 and N T It can be set to -1.

[0544] or N base In another way that produces a similar effect to the method using multiples of, the locations of candidate W-boundaries are N T A method based on the number of RVs can be used for determination. For example, the total length of the coded bits is N T and the index of each coded bit is from 0 to N T In the case where it is expressed in the range of -1 and M RVs can be set / indicated, the index of the coded bit corresponding to the position of the candidate W-boundary is 2 for integers w from 0 to log2M w *(N T They can be determined by numbers satisfying / M)-1. As a specific example, in the case where M=4 (N T / M)-1, 2*(N T / M)-1 and 4* (N T / M)-1 can be designated as candidate W-boundaries. If N T If is not a power of 2 (e.g., not a power that can be calculated based on the kernel matrix basis size), the coded bit index corresponding to the position of the candidate W-boundary is 2 for integers w from 0 to log2M-1. w *(N T Numbers satisfying / M)-1 and N T It can be set to -1.

[0545] The proposed method considers the structural gains associated with the increase in the mother code size of a polar code by considering a structure in which the mother code size of the polar code increases by a power of 2 and setting a W-boundary only at the boundary where the mother code size increases. This provides an advantage in that it can offer higher coding gain for some RVs where an improvement in the effective code rate can be expected due to retransmission.

[0546] FIG. 30 illustrates examples of W-boundary determination. Specifically, FIG. 30 (A) and (B) schematically show an example in which the W-boundary is determined by applying Option 2-1-1 and Option 2-1-2, respectively. The examples in FIG. 30 are 4*N base = N T This is an application example where the number of RVs that can be set / instructed has a relationship and is 4.

[0547] Referring to FIG. 30, FG 801 has a total of coded bits of length N T It means that the index ranges from 0 to N in order from left to right. T Consider the case where it is set to -1. In (A) of Fig. 30, N base (=N T A W-boundary is generated in units of / 4), showing a structure defined as FG 802, FG 803, FG 804, and FG 805. In (B) of Fig. 30, N base (=N T A W-boundary is generated with locations that can be calculated by multiplying / 4) by a power of 2, and shows a structure defined as FG 806, FG 807, and FG 808. The example in FIG. 30 is one embodiment for convenience of explanation, and the application of the proposed method is not limited to the case of the example in FIG. 30.

[0548] (Determination of W-threshold)

[0549] In the proposed method, the position of the W-threshold can be determined as a position relative to the position of each W-boundary. The specific method may be applied using at least one of the following Option 2-2-1 and 2-2-2.

[0550] (Option 2-2-1) Determine the W-threshold by relative positions of the same size for all W-boundaries

[0551] For example, the value of the W-threshold can be determined by adding a specific constant to the value of the W-boundary, and the said specific constant may be a common value applied to all W-boundaries. For example, there exist L W-boundaries distinguished by indices i∈{0,1,...,L-1}, and the value of the i-th W-boundary is k b(i) When expressed as such, for all i, the W-threshold value corresponding to the i-th W-boundary is a non-negative integer value Δ thr through k b(i) +Δ thr This can be.

[0552] The method proposed in Option 2-2-1 provides a structure that is advantageous for supporting the same level of self-decodable capability for each single transmission when the goal is to support self-decodable single transmissions by setting the W-threshold value applied to all W-boundaries to be the same.

[0553] (Option 2-2-2) For each W-boundary, determine the W-threshold by relative positions of equal or different sizes.

[0554] For example, the value of the W-threshold can be determined by adding a specific constant to the value of the W-boundary, and the said specific constant may be allowed to have a different value for each W-boundary. For example, there exist L W-boundaries distinguished by indices i∈{0,1,...,L-1}, and the value of the i-th W-boundary is k b(i) When expressed as such, the corresponding W-threshold value is k b(i) +Δ thr(i) It can be determined as, in this case Δ thr(i) The value of can be set to a non-negative integer value, and different values ​​can be set for different i.

[0555] Alternatively, the value of the W-threshold may be determined as a specific ratio to the value of the W-boundary, and said specific ratio may be common to all W-boundaries or may be set to allow different values ​​for each. For example, there exist L W-boundaries distinguished by indices i∈{0,1,...,L-1}, and the value of the i-th W-boundary is k b(i) When expressed as such, the corresponding W-threshold value is k b(i) *(1+Δ thr(i) It can be determined as ), in this case Δ thr(i) The value of can be set to a real value that satisfies the conditions greater than or equal to 0 and less than 1, and different values ​​can be set for different i.

[0556] Option 2-2-2 can provide a structure that is advantageous for obtaining optimized decoding performance by considering the difference in ratios caused by the W-threshold as the mother code size increases, while simultaneously considering the occurrence rate of information bits corresponding to the position of the coded bits, when considering the structural characteristics of polar codes that increase the effective code rate through retransmission.

[0557] In addition, when Option 2-2-2 is applied, the W-threshold corresponding to the position of the last W-boundary (e.g., the W-boundary corresponding to the last index on the entire coded bit) can be set to an infinite value (e.g., so that partial warp around repetition always occurs), which can be used to support repetition within the coded bit when there are no longer any coded bits that can be expanded through the (re)transmission process.

[0558] (W-block determination and bit selection)

[0559] In the proposed method, when partial wrap-around repetition is activated and applied, it is necessary to consider a method for selecting coded bits to determine the region of coded bits that are repeatedly transmitted when repetition is applied. To this end, a set of candidates for coded bits that can be selected when partial wrap-around repetition occurs corresponding to each W-boundary is explained by introducing the concept of a W-block.

[0560] The range of the W-block corresponding to each W-boundary can be defined as the range between two different W-boundaries. Specifically, the range of the W-block corresponding to a specific W-boundary (hereinafter referred to as the first W-boundary) can be defined as the range from the immediately preceding W-boundary (hereinafter referred to as the second W-boundary) to the first W-boundary. In this case, the order of the W-boundaries may be the order of the W-boundaries' sizes and / or may correspond to the index of the coded bit corresponding to the W-boundary.

[0561] When partial wrap-around repetition is performed, the coded bit index selected for the purpose of repetition within the W-block can be selected sequentially from the index of the coded bit where the W-block starts (or ends). For example, N P A specific W-block consisting of n coded bits has p+N coded bits starting from the p-th coded bit on the entire coded bit set. P-1 When composed of coded bits having the index of the i-th coded bit, if there are q coded bits to which repetition is applied by partial wrap-around repetition, the selected coded bits satisfy the conditions greater than or equal to p and less than p + q (or N P-1 -q Excess N P-1 It can be determined by coded bits having an index that satisfies the following conditions.

[0562] The proposed method provides a structure that is advantageous in that it can provide a structure in which different coded bits can be repeated for each single transmission when supporting a self-decodable (re)transmission structure, while simultaneously improving the decoding performance gain from the perspective of self-decodable for each single transmission.

[0563] FIGS. 31 and 32 illustrate various examples of coded bit configurations based on partial wrap-around repetition. Specifically, FIGS. 31 and 32 schematically show examples where the method proposed in Proposal 2 is applied when four RVs can be set / indicated. In common to FIGS. 31 and 32, the total length of the coded bit is N T We are assuming a situation where the index ranges from 0 to N in order from left to right. TConsider the case where it is set to -1. The examples in FIGS. 31 / 32 are examples for convenience of explanation and the application of the proposed method is not limited to the cases of the examples in FIGS. 31 / 32.

[0564] Figure 31 (A) shows an example where the determination of the RV starting point follows the method proposed in Option 1-1 and the configuration of the W-boundary follows Option 2-1-1. FG 901A, FG 902A, FG 903A, and FG 904A represent the W-boundaries, and their corresponding W-thresholds are represented as FG 905A, FG 906A, FG 907A, and FG 908A, respectively. FG 909A and FG 911A show that partial warp around repetition is performed according to the W-threshold condition, and repetition is applied to some coded bits within the W-block. FG 910A shows that partial warp around repetition does not occur according to the W-threshold condition, and therefore, coded bits are selected up to a section beyond the W-boundary. FG 912A shows a case where the W-threshold condition for partial warp around repetition to be performed is satisfied, but repetition does not occur because the length of the rate-matched coded sequence is insufficient.

[0565] Figure 31 (B) shows an example where the determination of the RV starting point follows the method proposed in Option 1-1 and the configuration of the W-boundary follows Option 2-1-2. FG 901B, FG 902B, and FG 904B represent the W-boundaries, and their corresponding W-thresholds are represented as FG 905B, FG 906B, and FG 908B, respectively. FG 909B shows that partial warp around repetition is performed according to the W-threshold condition, and repetition is applied to some coded bits within the W-block. FG 910B shows that partial warp around repetition does not occur according to the W-threshold condition, and therefore, coded bits are selected up to a section beyond the W-boundary. FG 911B and FG 912B refer to cases where the W-threshold condition for partial warp around repetition to be performed is satisfied, but repetition does not occur because the length of the rate-matched coded sequence is insufficient.

[0566] Figure 32 (C) shows an example where the determination of the RV starting point follows the method proposed in Option 1-2 and the configuration of the W-boundary follows Option 2-1-1. FG 901C, FG 902C, FG 903C, and FG 904C represent the W-boundaries, and their corresponding W-thresholds are represented as FG 905C, FG 906C, FG 907C, and FG 908C, respectively. FG 909C and FG 911C show that partial warp around repetition is performed according to the W-threshold condition, and repetition is applied to some coded bits within the W-block. FG 910C shows that partial warp around repetition does not occur according to the W-threshold condition, and therefore, coded bits are selected up to a section beyond the W-boundary. FG 912C refers to a case where the W-threshold condition for partial warp around repetition to be performed is satisfied, but repetition does not occur because the length of the rate-matched coded sequence is insufficient.

[0567] Figure 32 (D) shows an example where the determination of the RV starting point follows the method proposed in Option 1-2 and the configuration of the W-boundary follows Option 2-1-2. FG 901D, FG 902D, and FG 904D represent the W-boundaries, and their corresponding W-thresholds are represented as FG 905D, FG 906D, and FG 908D, respectively. FG 909D shows that partial warp around repetition is performed according to the W-threshold condition, and repetition is applied to some coded bits within the W-block. FG 910D shows that partial warp around repetition does not occur according to the W-threshold condition, and therefore, coded bits are selected up to a section beyond the W-boundary. FG 911D and FG 912D represent cases where the W-threshold condition for partial warp around repetition to be performed is satisfied, but repetition does not occur because the length of the rate-matched coded sequence is insufficient.

[0568] (Various implementation examples)

[0569] Examples of implementations and representations are described when the methods proposed in this disclosure are applied to next-generation wireless communication systems such as 6G. The following examples are some examples where the proposed methods may be used and can be viewed as other implementations and representations that perform the same operation and concept. The application of the methods proposed in this disclosure is not limited to the following examples.

[0570] Implementation Example 1

[0571] As an example, this explanation assumes a terminal that supports a single circular buffer structure.

[0572] From the perspective of generating the total coded bits, the encoder input sequence fed into the polar encoding stage is b=[b0, b1,...,b NT-1 ] and the entire coded bit sequence generated through the polar encoding process is c=[c0, c1,...,c NT-1 It is assumed that ]. In this case, the polar encoding matrix P on which polar encoding is performed is calculated by the Kronecker power operation on G in Equation 4, which is a 2x2 kernel matrix, so P=G^(ⓧn T ) (at this time n T = log2N T Consider a structure having the relationship c=bP when ) is satisfied. In this case, the selection of the coded bits included in each single transmission can be determined based on the index of c, or if a separate (sub-block) interleaving process is involved prior to the rate matching stage, resulting in d=[d0, d1,.., d NT-1 When a sequence of ] is generated, it can be determined based on the index of d. For convenience, the following description explains methods proposed based on c, but it can also be applied to methods that perform rate matching based on the index of d.

[0573] In the above structure, the structure in which the RV starting point is determined according to the proposed method and rate matching considering partial warp around repetition is performed is as follows. For the RV starting point, the reference point is set as the index of c0 in terms of the entire coded bit, and the position of the RV starting point calculated from the reference point can be determined according to the method proposed in this disclosure. For example, when Option 1-1 is used, the index of the RV starting point for a specific RV is k0=N T It can be calculated as / M*rv_id+s_rv(rv_id), and the coded bit corresponding to the RV starting point is c k0 It becomes.

[0574] In the assumed structure above, when E coded bits are included in a single transmission where the coded bit index of k0 is determined as the RV starting point, the coded bit index is set to the coded bits satisfying the condition k0 or greater and k1 or less, wherein the value of k1 can be determined based on the condition of partial wrap-around repetition. For example, if the method of Option 2-1-1 is used and the number of configurable / directable RVs is 4, the coded bit indices corresponding to the W-boundaries are N T / 4 -1, 2*N T / 4 -1, 3*N T / 4 -1, 4*N T / 4Each is determined to be -1, and if the magnitude of k0+E for a specific single transmission is less than or equal to the W-threshold used in the calculation of k1, k1 is determined as min(k0+E-1, k2), where k2 can be determined as the coded bit index of the W-boundary corresponding to the W-threshold used in the calculation of k1. Conversely, if the magnitude of k0+E exceeds the W-threshold used in the calculation of k1, k1 is determined as k0+E-1.

[0575] FIG. 33 illustrates how a single circular buffer operates based on the described implementation example 1. In FIG. 33, the length of the total coded bits is N T And 4 RVs can be set / directed, and the RV starting point is N T Consider the case determined based on / 4. FG 1000 represents the order in which the entire coded bit is input into a single circular buffer, while FG 1001, FG 1005, FG 1008, and FG 1011 represent the method of reading coded bits from the circular buffer according to a single transmission for RV0, RV1, RV2, and RV3, respectively. RV0 (FG 1001) shows that a rate-matched coded bit sequence of length E0 is included in the single transmission and that shortening has been applied. In this case, depending on the size of the shortening applied (FG 1002), additional shifting is applied to the RV starting point of RV0 to determine it (FG 1003), and c NT / 4-E0 from c NT / 4-1The coded bits up to are included in a single transmission of RV0. RV1 (FG 1005) includes a rate-matched coded bit sequence of length E1 in a single transmission and shows that partial warp around repetition is applied. In this case, the RV starting point is N without additional shifting. T The index of / 4 is selected (FG 1004), c NT / 4 from c 2*NT / 4-1 The coded bits up to are included in the single transmission of RV1, and the last sequence E 1- N T / 4 coded bits (FG 1007), i.e., from c3*NT / 4-(E1-NT / 4) c 3*NT / 4-1 The coded bits up to are repeated and included in a single transmission. RV2 (FG 1008) shows that a rate-matched coded bit sequence of length E2 is included in a single transmission, and that the single transmission is performed with an expanded selection range of the coded bits and without partial warp-around repetition being applied. In this case, the RV starting point is 2*N without additional shifting. T The index of / 4 is selected (FG 1006), c 2*NT / 4 from c 3*NT / 4-1 The coded bits up to are included in the single transmission of RV2, and additionally 3*N T E2-N beyond the W-boundary (FG 1010) at position / 4-1 T / 4 coded bits (FG 1009), i.e., c 3*NT / 4The coded bits from to c3*NT / 4+(E2-NT / 4)-1 are included in a single transmission of RV2. RV3 (FG 1011) shows that a rate-matched coded bit sequence of length E3 is included in a single transmission and that puncturing is applied. In this case, the RV starting point is 3*N without additional shifting. T An index of / 4 is selected (FG 1010), and depending on the size to which puncturing is applied (FG 1012), c 3*NT / 4 The coded bits from c3*NT / 4+E3-1 are included in a single transmission of RV3.

[0576] Implementation Example 2

[0577] Implementation Example 2 is also explained under the assumption of a terminal that supports a single circular buffer structure. However, unlike Implementation Example 1, Implementation Example 2 covers the case where the index of the coded bit is sorted in reverse. This is a different representation method that produces the same function and result, and those skilled in the art will understand that there is no difference in the actual transmitted and received coded bits and decoding performance when the same scheduling parameters are set / instructed.

[0578] From the perspective of generating the total coded bits, the encoder input sequence fed into the polar encoding stage is b=[b0, b1,..,b NT-1 ] and the entire coded bit sequence generated through the polar encoding process is c=[c0, c1,..,c NT-1 It is expressed as ]. In this case, the polar encoding matrix on which polar encoding is performed is calculated by the Kronecker power operation on G in Equation 4, where G is a 2x2 kernel matrix, so P=G^(ⓧn T ) (at this time n T =log2N TConsider a structure having the relationship c=Pb when ). In this case, the selection of the coded bits included in each single transmission can be determined based on the index of c, or if a separate (sub-block) interleaving process is involved prior to the rate matching stage, resulting in d=[d0, d1,..,d NT-1 When a sequence of ] is generated, it can be determined based on the index of d. For convenience, the following description explains methods proposed based on c, but it can also be applied to methods that perform rate matching based on the index of d.

[0579] In the above structure, the structure in which the RV starting point is determined according to the method proposed in this disclosure and rate matching considering partial warp around repetition is performed is as follows. For the RV starting point, the reference point is set as the index of c0 in terms of the entire coded bit, and the positions of the RV starting point and RV ending point calculated from the reference point can be determined according to the method proposed in this disclosure. However, since Implementation Example 2 considers a representation method in reverse order of the coded bit index assumed in the description in this disclosure, the method for determining the RV starting point described in this disclosure can be used as the method for determining the RV ending point in Implementation Example 2 in consideration of this (e.g., application of the above-described mathematical formulas (e.g., mathematical formulas 9, 14, 15, 23, 24 and / or 25)), and also the method for determining the RV ending point described in this disclosure can be used as the method for determining the RV starting point in Implementation Example 2 (e.g., mathematical formula 25). For convenience, in the following description of Implementation Example 2, the index of the RV starting point is referred to as k1 and the index of the RV ending point as k0. As an example of how the RV ending point is determined, when Option 1-1 is used, the index of the RV ending point for a specific RV is k0=N T It can be calculated as / M*(M-rv_id)-1-s_rv(rv_id), and the coded bit corresponding to the RV ending point is c k0 It becomes.

[0580] In the assumed structure above, when E coded bits are included in a single transmission where the coded bit index of k0 is determined as the RV ending point, the included coded bit indices are defined as coded bits satisfying the condition k1 or greater and k0 or less, wherein the value of k1 can be determined based on the condition of partial wrap-around repetition. For example, if the method of Option 2-1-1 is used and the number of configurable / indicable RVs is 4, the coded bit indices corresponding to the W-boundary are 3*N T / 4 , 2*N T / 4 , N T / 4 , is determined to be 0, and if the magnitude of k0-E for a specific single transmission is greater than or equal to the W-threshold used in the calculation of k1, k1 is determined as k1=min(k0-E+1, k2), where k2 can be determined as the coded bit index of the W-boundary corresponding to the W-threshold used in the calculation of k1. Conversely, if the magnitude of k0+E is less than the W-threshold used in the calculation of k1, k1 is determined as k1=k0-E+1.

[0581] FIG. 34 illustrates how a single circular buffer operates based on the implementation example 2 described above. In FIG. 34, the length of the total coded bits is N T And 4 RVs can be set / directed, and the RV ending point is N TConsider the case determined based on / 4. FG 1100 shows the order in which the entire coded bit is input into a single circular buffer, while FG 1101, FG 1105, FG 1108, and FG 1111 show the method of reading coded bits from the circular buffer according to a single transmission for RV0, RV1, RV2, and RV3, respectively. RV0 (FG 1101) shows that a rate-matched coded bit sequence of length E0 is included in the single transmission and that shortening has been applied. In this case, additional shifting is applied to the RV ending point of RV0 according to the size of the shortening applied (FG 1102) to determine it (FG 1103), and c 3*NT / 4 The coded bits from c3*NT / 4+E0-1 are included in a single transmission of RV0. RV1 (FG 1105) shows that a rate-matched coded bit sequence of length E1 is included in a single transmission, with partial warp-around repetition applied. In this case, the RV ending point is 3*N without additional shifting. T The index of / 4 is selected (FG 1104), c 2*NT / 4 from c 3*NT / 4-1 The coded bits up to are included in a single transmission of RV1, and E in fast order 1- N T / 4 coded bits (FG 1107), i.e., c 2*NT / 4The coded bits from c2*NT / 4+(E1-NT / 4)-1 are repeated and included in a single transmission. RV2 (FG 1108) shows that a rate-matched coded bit sequence of length E2 is included in a single transmission, and that the single transmission is performed with an expanded selection range of coded bits and without partial warp-around repetition being applied. In this case, the RV ending point is 2*N without additional shifting. T The index of / 4 is selected (FG 1106), c NT / 4 from c 2*NT / 4-1 The coded bits up to are included in the single transmission of RV2, and additionally N T E2-N beyond the W-boundary (FG 1110) at position / 4-1 T / 4 coded bits (FG 1109), i.e., from cNT / 4-(E2-NT / 4) to c NT / 4-1 The coded bits up to are included in a single transmission of RV2. RV3 (FG 1111) shows that a rate-matched coded bit sequence of length E3 is included in a single transmission and that puncturing is applied. In this case, the RV ending point is N without additional shifting. T An index of / 4 is selected (FG 1110), and depending on the size to which puncturing is applied (FG 1112), c NT / 4-E3 from c 3*NT / 4-1 The coded bits up to are included in a single transmission of RV3.

[0582] Implementation Example 3

[0583] The proposed methods can be applied and used in the transmission and reception of physical channels (e.g., PUSCH or PDSCH) for the transmission of various information / channels / signals, e.g., PBCH or traffic data, on wireless communication systems such as 6G. Specifically, RV is applied to the transmission and reception of each SSB / PBCH and each PUSCH and / or PDSCH, and the method of configuring coded bits when the (re)transmission process is performed through the HARQ feedback process can be performed based on the proposed methods.

[0584] As a specific example of how the proposed methods are applied to the transmission and reception of a physical channel (e.g., PBCH) for the transmission of a Master Information Block (MIB) on a wireless communication system such as 6G, when there is a time interval in which a PBCH is repeatedly transmitted while MIB information is maintained, a structure can be used that enables improved decoding performance by utilizing long coded bits by using one or more PBCH transmission blocks while allowing self-decodable decoding for the transmission of each PBCH.

[0585] [Example of Terminal and Base Station Operation]

[0586] Examples of procedures and operations for the terminal and the base station to perform the proposed methods are described when the methods proposed in this disclosure 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). In the following description, the entity controlling transmission and reception between two nodes is described using the term "base station," but 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 following examples may be applied.

[0587] FIG. 35 illustrates an example of terminal operation.

[0588] FIG. 35 (A) shows an example of how the proposed method is applied to a terminal reception operation for a DL channel (e.g., PBCH and / or DL ​​traffic channel). The terminal may receive configuration information from a base station for receiving a DL channel (e.g., PBCH and / or DL ​​traffic channel) (FG 1201). At this time, the configuration information may include, if necessary, information related to the operation of an RV starting point, an RV ending point, and / or a partial wrap-around repetition. For example, the configuration information may be provided to the terminal via SIB or dedicated RRC signaling and a higher layer signal. After receiving the configuration information, the terminal may perform monitoring to receive DL control information (e.g., DCI or MAC CE) (FG 1202). If the reception of DL control information is successful, scheduling information for a DL traffic channel (e.g., PDSCH) is obtained through it. At this time, the terminal may receive the RV starting point, RV ending point, and / or partial wrap-around repetition applied to the scheduled DL traffic channel based on the above scheduling information. If the scheduling of the DL channel does not include the reception process of a separate DL control channel (e.g., SPS, PBCH), step FG 1202 may be omitted. In the case of SPS, scheduling information may be provided to the terminal through another DL channel, for example, through the configuration information received in step FG 1201. Subsequently, the terminal (based on the received scheduling information) DL channel (e.g.The terminal receives a DL channel (e.g., PBCH and / or DL ​​traffic channel) (FG 1203). Subsequently, the terminal performs a demodulation process on the received DL channel (e.g., PBCH and / or DL ​​traffic channel) (FG 1204). Subsequently, the terminal performs a rate matching operation based on conditions such as an RV starting point, an RV ending point, and / or partial wrap-around repetition applied to the received DL channel (e.g., PBCH and / or DL ​​traffic channel) (FG 1205). In the rate matching step, the terminal may perform a process of storing the demodulated LLR value in a buffer based on the above information. Subsequently, the terminal performs decoding on the result of the rate matching (FG 1206).

[0589] FIG. 35 (B) shows an example of how the proposed method is applied to a terminal transmission operation for a UL channel (e.g., UL traffic channel). The terminal may receive configuration information for receiving the UL channel from a base station (FG 1211). At this time, the configuration information may include, if necessary, information related to the operation of the RV starting point, RV ending point, and / or partial wrap-around repetition. For example, the configuration information may be provided to the terminal via SIB or dedicated RRC signaling and a higher layer signal. After receiving the configuration information, the terminal performs monitoring to receive DL control information (e.g., DCI or MAC CE) (FG 1212), and if successful in receiving the DL control information, obtains scheduling information for the UL traffic channel (e.g., PUSCH) through it. At this time, the terminal may receive the RV starting point, RV ending point, and / or partial wrap-around repetition applied to the UL traffic channel scheduled based on the scheduling information. If the scheduling of the UL traffic channel does not include the reception process of a separate DL control channel (e.g., CG), the step of FG 1212 may be omitted, and instead, the scheduling information may be provided to the terminal through another DL channel, for example, the configuration information received in the step of FG 1211. Subsequently, the terminal performs an encoding process to generate coded bits based on the received scheduling information (FG 1213).Subsequently, the terminal performs a rate matching process on the generated coded bits to select the coded bits to be included in the transmission and, if necessary, performs a partial warp around repetition operation (FG 1214). Subsequently, the terminal generates an UL traffic channel to be transmitted through a modulation process (FG 1215) and performs the operation of transmitting it (FG 1216).

[0590] The terminal operation of FIG. 35 can 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. 35. Furthermore, one or more memories (204) of the device (200) may store instructions for performing the method in the example of FIG. 35 or in various examples of the foregoing specification when executed by one or more processors (202).

[0591] FIG. 36 illustrates an example of base station operation.

[0592] FIG. 36 (A) shows an example of how the proposed method is applied to base station transmission operations for a DL channel (e.g., PBCH and / or DL ​​traffic channel). The base station may transmit configuration information to a terminal for transmitting the DL channel (e.g., PBCH and / or DL ​​traffic channel) (FG 1301). At this time, the configuration information may include, if necessary, information related to the operation of the RV starting point, RV ending point, and / or partial wrap-around repetition. For example, the configuration information may be provided to the terminal via SIB or dedicated RRC signaling and a higher layer signal. After transmitting the configuration information, the base station performs the transmission of DL control information (e.g., DCI or MAC CE) (FG 1302). At this time, the DL control information may include scheduling information for the DL traffic channel (e.g., PDSCH), and the scheduling information may explicitly / implicitly include information on the RV starting point, RV ending point, and / or partial wrap-around repetition applied to the scheduled DL traffic channel. If the scheduling / transmission of a DL channel (e.g., PBCH and / or DL ​​traffic channel) does not involve the transmission process of a separate DL control channel (e.g., SPS and / or PBCH), step FG 1302 may be omitted. In the case of SPS, scheduling information may be provided to the terminal through another DL channel, for example, through the configuration information transmitted in step FG 1301.Subsequently, the base station performs an encoding process to generate coded bits based on the transmission scheduling information (FG 1303). Subsequently, the base station performs a rate matching process on the generated coded bits to select the coded bits to be included in the transmission and, if necessary, performs a partial warp around repetition operation (FG 1304). Subsequently, the base station generates a DL channel to be transmitted (e.g., PBCH and / or DL ​​traffic channel) through a modulation process (FG 1305) and performs an operation to transmit it (FG 1306). In the process described above, the step of FG 1302 may not follow the order described above and may be transmitted within a time interval after the step of FG 1301 and before the step of FG 1306.

[0593] FIG. 36 (B) shows an example of how the proposed method is applied to base station reception operations for a UL channel (e.g., UL traffic channel). The base station may transmit configuration information for the UL channel to the terminal (FG 1311). At this time, the configuration information may include, if necessary, information related to the operation of the RV starting point, RV ending point, and / or partial wrap-around repetition. For example, the configuration information may be provided to the terminal via SIB or dedicated RRC signaling and a higher layer signal. After transmitting the configuration information, the base station transmits DL control information (e.g., DCI or MAC CE) (FG 1312). At this time, the DL control information may include scheduling information for the UL traffic channel (e.g., PUSCH), and the scheduling information may explicitly / implicitly include information regarding the RV starting point, RV ending point, and / or partial wrap-around repetition applied to the scheduled UL traffic channel. If the scheduling of the UL traffic channel does not involve the reception process of a separate DL control channel (e.g., SPS), the step of FG 1312 may be omitted, and instead, the scheduling information may be provided to the terminal through another DL channel, for example, the configuration information transmitted in the step of FG 1311. Subsequently, the base station receives the UL traffic channel based on the scheduling information (FG 1313).Subsequently, the base station performs a demodulation process of the received UL traffic channel (FG 1314). Subsequently, the base station performs a rate matching operation based on conditions such as the RV starting point, RV ending point, and / or partial wrap-around repetition applied to the received UL traffic channel (FG 1315). In the rate matching step, the base station may perform a process of storing the demodulated LLR value in a buffer based on the information. Subsequently, the base station performs decoding on the result of the rate matching (FG 1316). In the process described above, the step of FG 1312 may not follow the order described above and may be transmitted within a time interval after the step of FG 1311 and before the step of FG 1316.

[0594] The base station operation of FIG. 36 can 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. 36. Furthermore, one or more memories (204) of the device (200) may store instructions for performing the method in the example of FIG. 36 or in various examples of the foregoing specification when executed by one or more processors (202).

[0595] The method proposed in this disclosure offers an advantage in that it can provide an RV structure advantageous for decoding by considering the characteristic structure of a polar code. For example, some parts of the proposed method provide a structure advantageous for improving coding gain in each transmission by considering the self-decodable characteristics of each unit transmission, and some parts provide a structure advantageous for improving coding gain in combinations of accumulated (re)transmissions when (re)transmissions for the same TB are performed one or more times.

[0596] In addition, the proposed method provides a method for selecting a mother code size that increases coding gain by considering the characteristic structure of polar codes, or a mother code size that is advantageous for reducing terminal complexity.

[0597] FIG. 37 illustrates the flow of a method performed by a first device according to one embodiment of the present disclosure. Since FIG. 37 is an example of implementation for at least some of the embodiments described above, the description described above may be referenced unless otherwise noted. The first device may be a base station performing DL transmission or a terminal performing UL transmission.

[0598] Referring to FIG. 37, the first device can determine the index of the start bit of the first RV among a plurality of redundancy versions (RV) within a bit sequence coded based on polar coding (3705).

[0599] The first device can transmit a signal including coded bits related to the first RV based on the index of the start bit of the first RV (3710).

[0600] The index of the start bit of the first RV above is the length (E) of the basic rate matching output sequence for the polar coding above. base) or the length of the above-mentioned coded bit sequence (N T It can be determined based on at least one of ).

[0601] The index of the start bit of the first RV above is N T It is determined based on an integer multiple of / M, where M may represent the number of the plurality of RVs.

[0602] The index of the start bit of the first RV above is the E base or the above N T It can be determined by applying a shifting value to a specific bit index calculated based on.

[0603] The above shifting value may be a shifting value specific to the first RV or a shifting value common to the plurality of RVs.

[0604] The above shifting value may be related to the shortening length in the rate matching process.

[0605] Length of the above coded bit sequence (N T ) is the length (E) of the above basic rate matching output sequence. base ), basic input bit sequence length (N base It can be determined based on at least one of the length of the information bit sequence (K) or the code rate before coding.

[0606] The index of the start bit of the first RV above is the E base It can be determined as an integer multiple of the Q value determined based on.

[0607] The above Q value is the above E base Same as, or the above E base A specific offset (Δ) in RV RV It is the sum of ), or among multiple candidate Q values, the above E base It can be a Q value linked to.

[0608] In the above coded bit sequence, the index (k1) of the last bit of the first RV is determined based on min (k0+E-1, k2), where k0 is the index of the start bit, E is the length of the rate-matching output sequence of the coded bits related to the first RV, and k2 is the length of the basic input bit sequence (N base It may be a boundary value calculated based on ).

[0609] The above signal may include a PBCH (physical broadcast channel).

[0610] FIG. 38 illustrates the flow of a method performed by a second device according to one embodiment of the present disclosure. Since FIG. 38 is an example of implementation for at least some of the embodiments described above, the description described above may be referenced unless otherwise noted. The second device may be a terminal performing DL reception or a base station performing UL reception.

[0611] Referring to FIG. 38, the second device can receive a signal containing coded bits related to the first RV among a plurality of RVs (redundancy versions) (3805).

[0612] The second device can decode the coded bits based on polar coding (3810).

[0613] The index of the start bit where the coded bits related to the first RV begin within the coded bit sequence related to the plurality of RVs is the length (E) of the basic rate matching output sequence for polar coding. base ) or the length of the above-mentioned coded bit sequence (N T It can be determined based on at least one of ).

[0614] The index of the start bit of the first RV above is N TIt is determined based on an integer multiple of / M, where M may represent the number of the plurality of RVs.

[0615] The index of the start bit of the first RV above is the E base or the above N T It can be determined by applying a shifting value to a specific bit index calculated based on.

[0616] The above shifting value may be a shifting value specific to the first RV or a shifting value common to the plurality of RVs.

[0617] The above shifting value may be related to the shortening length in the rate matching process.

[0618] Length of the above coded bit sequence (N T ) is the length (E) of the above basic rate matching output sequence. base ), basic input bit sequence length (N base It can be determined based on at least one of the length of the information bit sequence (K) or the code rate before coding.

[0619] The index of the start bit of the first RV above is the E base It can be determined as an integer multiple of the Q value determined based on.

[0620] The above Q value is the above E base Same as, or the above E base A specific offset (Δ) in RV RV It is the sum of ), or among multiple candidate Q values, the above E base It can be a Q value linked to.

[0621] In the above coded bit sequence, the index (k1) of the last bit of the first RV is determined based on min (k0+E-1, k2), where k0 is the index of the start bit, E is the length of the rate-matching output sequence of the coded bits related to the first RV, and k2 is the length of the basic input bit sequence (Nbase It may be a boundary value calculated based on ).

[0622] The embodiments described above are combinations of the components and features of the present disclosure in a specific form. Each component or feature should be considered optional unless otherwise explicitly stated. Each component or feature may be implemented in a form not combined with other components or features. Additionally, it is possible to construct embodiments of the present disclosure by combining some components and / or features. The order of operations described in the embodiments of the present disclosure may be changed. Some components or features of one embodiment may be included in another embodiment, or may be replaced with corresponding components or features of another embodiment. It is obvious that embodiments may be constructed by combining claims that are not explicitly related in the claims, or that they may be included as new claims by amendment after filing.

[0623] It is obvious to those skilled in the art that the present disclosure may be embodied in other specific forms without departing from the features of the present disclosure. Accordingly, the foregoing detailed description should not be interpreted restrictively in all respects and should be considered exemplary. The scope of the present disclosure shall be determined by a reasonable interpretation of the appended claims, and all modifications within the equivalent scope of the present disclosure are included within the scope of the present disclosure.

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

Claims

1. In a method performed in the first device, Determining the index of the start bit of the first RV among a plurality of redundancy versions (RVs) within a bit sequence coded based on polar coding; and It includes transmitting a signal including coded bits related to the first RV based on the index of the start bit of the first RV, and The index of the start bit of the first RV above is the length (E) of the basic rate matching output sequence for the polar coding above. base ) or the length of the above-mentioned coded bit sequence (N T A method determined based on at least one of ).

2. In Paragraph 1, The index of the start bit of the first RV above is N T A method determined based on an integer multiple of / M, wherein M represents the number of the plurality of RVs.

3. In Paragraph 1, The index of the start bit of the first RV above is the E base or the above N T A method determined by applying a shifting value to a specific bit index calculated based on 4. In Paragraph 3, The above shifting value is a shifting value specific to the first RV or a shifting value common to the plurality of RVs.

5. In Paragraph 3, The above shifting value is a method related to the shortening length in the rate matching process.

6. In Paragraph 1, Length of the above coded bit sequence (N T ) is the length (E) of the above basic rate matching output sequence. base ), basic input bit sequence length (N base A method determined based on at least one of the length of the pre-coding information bit sequence (K) or the code rate.

7. In Paragraph 1, The index of the start bit of the first RV above is the E base A method determined as an integer multiple of the Q value determined based on.

8. In Paragraph 7, The above Q value is the above E base Same as, or the above E base A specific offset (Δ) in RV RV It is the sum of ), or among multiple candidate Q values, the above E base Method, which is the Q value associated with.

9. In Paragraph 1, In the above coded bit sequence, the index (k1) of the last bit of the first RV is determined based on min (k0+E-1, k2), where k0 is the index of the start bit, E is the length of the rate-matching output sequence of the coded bits related to the first RV, and k2 is the length of the basic input bit sequence (N base A method, which is a boundary value calculated based on ).

10. In Paragraph 1, The above signal includes a PBCH (physical broadcast channel), a method.

11. In a method performed in a second device, Receiving a signal including coded bits related to a first RV among a plurality of redundancy versions; and It includes decoding the coded bits based on polar coding, and The index of the start bit where the coded bits related to the first RV begin within the coded bit sequence related to the plurality of RVs is the length (E) of the basic rate matching output sequence for polar coding. base ) or the length of the above-mentioned coded bit sequence (N T A method determined based on at least one of ).

12. A computer-readable non-transitory recording medium storing a program for performing the method described in claim 1 or 11.

13. In the first device, At least one processor; and It includes at least one memory configured to store instructions that cause the at least one processor to perform operations by being executed by the at least one processor, and The operations of the above processor are, Determining the index of the start bit of the first RV among a plurality of redundancy versions (RVs) within a bit sequence coded based on polar coding; and It includes transmitting a signal including coded bits related to the first RV based on the index of the start bit of the first RV, and The index of the start bit of the first RV above is the length (E) of the basic rate matching output sequence for the polar coding above. base ) or the length of the above-mentioned coded bit sequence (N T A first device determined based on at least one of ).

14. In Paragraph 13, It further includes a transmitter and receiver, The first device above is a terminal or a base station.

15. In the second device, At least one processor; and It includes at least one memory configured to store instructions that cause the at least one processor to perform operations by being executed by the at least one processor, and The operations of the above processor are, Receiving a signal including coded bits related to a first RV among a plurality of redundancy versions; and It includes decoding the coded bits based on polar coding, and The index of the start bit where the coded bits related to the first RV begin within the coded bit sequence related to the plurality of RVs is the length (E) of the basic rate matching output sequence for polar coding. base ) or the length of the above-mentioned coded bit sequence (N T A second device determined based on at least one of ).

Images