Transport block transmission method in wireless communication system, and device using same

Abstract

Provided are an operation method of a device in a wireless communication system, and a device using same. The method comprises: generating a plurality of transport blocks; generating code blocks by segmenting the respective plurality of transport blocks; generating aligned code blocks by performing zero padding on a group of code blocks included in mutually different transport blocks among the plurality of transport blocks; generating a parity code block by encoding the aligned code blocks; and transmitting the plurality of transport blocks and the parity code block to a base station, wherein the aligned code blocks all have the same bit length through the zero padding, and the zero padding minimizes the overlapping of the positions of zero-padded bits in mutually different aligned code blocks.

Description

Method for transmitting a transmission block in a wireless communication system and a device using the method

[0001] The present disclosure relates to a method for transmitting a transmission block of a device in a wireless communication system and a device using the method.

[0002] As more and more communication devices demand greater communication capacity, the need for improved mobile broadband communications over existing radio access technology (RAT) is emerging. Furthermore, massive Machine Type Communications (MTC), which connects numerous devices and objects to provide diverse services anytime, anywhere, is also a key issue to be considered in next-generation communications. Furthermore, communication system design that considers reliability and latency-sensitive services / terminals is being discussed. The introduction of next-generation radio access technologies that take into account enhanced mobile broadband communications, massive MTC, and URLLC (Ultra-Reliable and Low Latency Communication) is being discussed, and for convenience, these technologies are referred to as new RAT or NR in this disclosure.

[0003] In NR or later wireless communication systems, if the actual transmission channel environment is not good compared to the modulation and coding scheme (MCS) targeted by the base station in some time resources, transmission of a transport block (TB) or code block (CB) transmitted in the time resources may fail.

[0004] For example, in a TDD (time division duplex) environment, if decoding of a TB fails, the delay time until receiving the retransmitted TB increases, which may result in the TB not being received within the required time. Therefore, there is a need to support more reliable transmission without retransmission through HARQ (Hybrid automatic repeat request).

[0005] That is, in NR or post-NR wireless communication systems, lower latency and higher reliability may be required compared to conventional systems, and for this purpose, forward error correction (FEC) may play an important role.

[0006] FEC is a technology that adds extra information, i.e., an error correction code (e.g., a parity bit), to transmitted data so that the receiver can automatically correct errors that occur in digital communication. A codeword composed of the data and parity bits can be transmitted, and the receiver can detect errors in the received codeword and use the parity bit to repair the errors.

[0007] Conventionally, a method has been proposed to generate a parity code block by applying outer coding between multiple code blocks (CBs) included in a single transmission block (TB), and to additionally transmit this parity code block to restore the data of code blocks that were not successfully received. However, this method has the limitation that it is effective only in environments where the difference in channel conditions between code blocks is large during transmission of a single physical downlink shared channel (PDSCH), and thus there is a high possibility that errors will occur concentrated in some code blocks.

[0008] To overcome these issues, one could consider applying external coding to multiple CBs within multiple TBs to generate a parity code block and transmit it to the receiver. However, since the multiple CBs within multiple TBs may have different bit lengths, generating the parity code block can be problematic.

[0009] A block transmission method that can overcome these problems is needed.

[0010] The technical problem to be solved by the present disclosure is to provide a method for transmitting a transmission block of a device in a wireless communication system and a device using the method.

[0011] A method for transmitting a transport block of a terminal in a wireless communication system is provided. According to the method, the terminal generates a plurality of transport blocks, divides each of the plurality of transport blocks to generate code blocks, performs zero padding on groups of code blocks included in different transport blocks among the plurality of transport blocks to generate alignment code blocks, performs encoding on the alignment code blocks to generate parity code blocks, and transmits the plurality of transport blocks and the parity code blocks to a base station, wherein the alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

[0012] In another aspect, a terminal, device, or computer-readable medium for executing the above method is provided.

[0013] In another aspect, a method of operating a base station and a base station using the method are provided. According to the method of operating the base station, the base station generates a plurality of transport blocks, divides each of the plurality of transport blocks to generate code blocks, performs zero padding on groups of code blocks included in different transport blocks among the plurality of transport blocks to generate alignment code blocks, performs encoding on the alignment code blocks to generate parity code blocks, and transmits the plurality of transport blocks and the parity code blocks to a terminal, wherein the alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes overlap of positions of zero-padded bits in different alignment code blocks.

[0014] According to the method according to the present disclosure, in the process of generating a parity CB by performing external coding on a plurality of CBs belonging to a plurality of TBs, the parity CB can be generated even when the lengths of the plurality of CBs are different.

[0015] Additionally, if there are code blocks among multiple CBs where zero padding is performed, the overhead of parity can be reduced while maintaining the performance of the external code by performing puncturing on some parity code blocks.

[0016] Figure 1 illustrates the system architecture of a New Generation Radio Access Network (NG-RAN) to which NR is applied.

[0017] Figure 2 is a block diagram showing a radio protocol architecture for a user plane.

[0018] Figure 3 is a block diagram showing the wireless protocol structure for the control plane.

[0019] Figure 4 illustrates the functional division between NG-RAN and 5GC.

[0020] Figure 5 illustrates a frame structure that can be applied in NR.

[0021] Figure 6 shows an example of a resource grid in NR.

[0022] Figure 7 shows an example of a physical resource block in NR.

[0023] Figure 8 illustrates the slot structure of an NR frame.

[0024] Figure 9 illustrates a core set.

[0025] Figure 10 illustrates an example of a frame structure for a new wireless access technology.

[0026] Figure 11 illustrates the structure of a self-contained slot.

[0027] Figure 12 illustrates physical channels and typical signal transmission.

[0028] Figure 13 illustrates the structure of the basic graph of NR.

[0029] Figure 14 illustrates the output of an interleaver in the case of 16QAM modulation.

[0030] Figure 15 shows an example of transmitting a parity code block.

[0031] Figure 16 illustrates a unit to which an external code is applied.

[0032] Figure 17 illustrates a process of obtaining parity CBs from multiple CBs contained within multiple TBs.

[0033] Figure 18 illustrates the process of generating parity CB(s).

[0034] Figure 19 illustrates the positions of bits where zero padding is performed.

[0035] Figure 20 is another example of bit positions where zero padding is performed.

[0036] Figure 21 illustrates the positions of bits where puncturing is performed.

[0037] Figure 22 illustrates a method for re-mapping information CB.

[0038] Figure 23 illustrates the arrangement order of Info-CB according to Method 1.

[0039] Figure 24 illustrates the arrangement order of Info-CB according to method 2.

[0040] Figure 25 illustrates a parity CB in which puncturing is performed.

[0041] Figure 26 is another example of a parity CB in which puncturing is performed.

[0042] Figure 27 illustrates an operation method of a terminal according to the present disclosure.

[0043] Figure 28 illustrates an operation method of a base station according to the present disclosure.

[0044] Figure 29 illustrates the signaling process and operation between a base station and a terminal.

[0045] Figure 30 illustrates a wireless device applicable to the present specification.

[0046] Figure 31 illustrates another example of a wireless device.

[0047] Figure 32 illustrates an example of a signal processing module structure.

[0048] Figure 33 illustrates another example of the structure of a signal processing module within a transmission device.

[0049] FIG. 34 illustrates an example of a wireless communication device according to an implementation example of the present disclosure.

[0050] Fig. 35 illustrates a communication system (1) applicable to this specification.

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

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

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

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

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

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

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

[0058] Technical features individually described within a single drawing in this specification may be implemented individually or simultaneously. The following drawings are designed to illustrate specific examples of this specification. The names of specific devices and the names of specific signals, messages, and fields depicted in the drawings are provided for illustrative purposes only, and therefore, the technical features of this specification are not limited to the specific names used in the drawings.

[0059] In this specification, a terminal is a 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 / TRP (Transmission-Reception Point). A terminal may correspond to a physical node or a logical node. A terminal may correspond to an endpoint on the user side, or may correspond to an intermediate point between other endpoints. In communication between two points that are not limited to endpoints (including one-to-one / many-to-one / one-to-many / many-to-many communication), a terminal may correspond to a served node. A terminal may be a node with a fixed location, or a node with an unfixed location (or mobile).

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

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

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

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

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

[0065] Hereinafter, downlink (DL) refers to communication from a base station to a terminal, and uplink (UL) refers to communication from a terminal to a base station. In downlink, a transmitter may be part of a base station, and a receiver may be part of a terminal. In uplink, a transmitter may be part of a terminal, and a receiver may be part of a base station. A base station may be expressed as a first communication device, and a terminal may be expressed as a second communication device. A base station (BS) may be replaced by terms such as a fixed station, Node B, eNB (evolved-NodeB), gNB (Next Generation NodeB), BTS (base transceiver system), access point (AP: Access Point), network (5G network), AI (Artificial Intelligence) system / module, RSU (road side unit), robot, drone (Unmanned Aerial Vehicle, UAV), AR (Augmented Reality) device, VR (Virtual Reality) device, etc.In addition, the terminal may be fixed or mobile, and may be replaced with terms such as UE (User Equipment), MS (Mobile Station), UT (user terminal), MSS (Mobile Subscriber Station), SS (Subscriber Station), AMS (Advanced Mobile Station), WT (Wireless terminal), MTC (Machine-Type Communication) device, M2M (Machine-to-Machine) device, D2D (Device-to-Device) device, vehicle, RSU (road side unit), robot, AI (Artificial Intelligence) module, drone (Unmanned Aerial Vehicle, UAV), AR (Augmented Reality) device, VR (Virtual Reality) device, etc.

[0066] The following technologies can be used in various wireless access systems, such as CDMA, FDMA, TDMA, OFDMA, and SC-FDMA. UTRA is part of UMTS (Universal Mobile Telecommunications System). 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution) is part of E-UMTS (Evolved UMTS) that uses E-UTRA, and LTE-A (Advanced) / LTE-A pro is an evolved version of 3GPP LTE. 3GPP NR (New Radio or New Radio Access Technology) is an evolved version of 3GPP LTE / LTE-A / LTE-A pro.

[0067] For clarity, the description is based on the 3GPP communication system (e.g., LTE-A, NR), but the technical idea of ​​the present disclosure is not limited thereto. LTE refers to technology after 3GPP TS 36.xxx Release 8. Specifically, LTE technology after 3GPP TS 36.xxx Release 10 is referred to as LTE-A, and LTE technology after 3GPP TS 36.xxx Release 13 is referred to as LTE-A pro. 3GPP NR refers to technology after TS 38.xxx Release 15. LTE / NR may be referred to as a 3GPP system. "xxx" refers to a standard document detail number. LTE / NR may be collectively referred to as a 3GPP system. For background technology, terms, abbreviations, etc. used in the description of the present disclosure, reference may be made to matters described in standard documents published prior to the present disclosure. For example, reference may be made to the following documents:

[0068] 3GPP LTE

[0069] - 36.211: Physical channels and modulation

[0070] - 36.212: Multiplexing and channel coding

[0071] - 36.213: Physical layer procedures

[0072] - 36.300: Overall description

[0073] - 36.331: Radio Resource Control (RRC)

[0074] 3GPP NR

[0075] - 38.211: Physical channels and modulation

[0076] - 38.212: Multiplexing and channel coding

[0077] - 38.213: Physical layer procedures for control

[0078] - 38.214: Physical layer procedures for data

[0079] - 38.300: NR and NG-RAN Overall Description

[0080] - 36.331: Radio Resource Control (RRC) protocol specification

[0081] 이하에서, 아래의 정의 및 약어(Definition and Abbreviations)를 사용할 수 있다.

[0082] BM: beam management

[0083] CQI: channel quality indicator

[0084] CRI: CSI-RS (channel state information - reference signal) resource indicator

[0085] CSI: channel state information

[0086] CSI-IM: channel state information - interference measurement

[0087] CSI-RS: channel state information - reference signal

[0088] DMRS: demodulation reference signal

[0089] FDM: frequency division multiplexing

[0090] FFT: fast Fourier transform

[0091] IFDMA: interleaved frequency division multiple access

[0092] IFFT: inverse fast Fourier transform

[0093] L1-RSRP: Layer 1 reference signal received power

[0094] L1-RSRQ: Layer 1 reference signal received quality

[0095] MAC: medium access control

[0096] MCS: Modulation and coding scheme

[0097] NZP: non-zero power

[0098] OFDM: orthogonal frequency division multiplexing

[0099] PDCCH: physical downlink control channel

[0100] PDSCH: physical downlink shared channel

[0101] PMI: precoding matrix indicator

[0102] PUCCH: Physical uplink control channel

[0103] PUSCH: Physical uplink shared channel

[0104] RE: resource element

[0105] RI: Rank indicator

[0106] RRC: radio resource control

[0107] RSSI: received signal strength indicator

[0108] Rx: Reception

[0109] QCL: quasi co-location

[0110] SINR: signal to interference and noise ratio

[0111] SSB (or SS / PBCH block): synchronization signal block (including primary synchronization signal, secondary synchronization signal and physical broadcast channel)

[0112] TDM: time division multiplexing

[0113] TRP: transmission and reception point

[0114] TRS: tracking reference signal

[0115] Tx: transmission

[0116] UE: user equipment

[0117] ZP: zero power

[0118] As more and more communication devices demand greater communication capacity, the need for improved mobile broadband communication compared to existing radio access technologies is emerging. Furthermore, massive Machine Type Communications (MTC), which connects numerous devices and objects to provide various services anytime, anywhere, is also a key issue to be considered in next-generation communications. Furthermore, communication system design that considers reliability and latency-sensitive services / terminals is being discussed. Accordingly, the introduction of next-generation wireless access technologies such as enhanced mobile broadband communication (eMBB), massive MTC (MMTC), and Ultra-Reliable and Low Latency Communication (URLLC) is being discussed, and for convenience, these technologies are referred to as NR in this specification. NR is an expression representing an example of 5G radio access technology (RAT).

[0119] A new RAT system, including NR, uses OFDM transmission scheme or a similar transmission scheme. The new RAT system may follow OFDM parameters different from those of LTE. Alternatively, the new RAT system may follow the existing LTE / LTE-A numerology but have a larger system bandwidth (e.g., 100 MHz). Alternatively, a single cell may support multiple numerologies. That is, terminals operating under different numerologies can coexist within a single cell.

[0120] A numerology corresponds to a single subcarrier spacing in the frequency domain. Different numerologies can be defined by scaling the reference subcarrier spacing by an integer N.

[0121] The three key requirement areas for 5G include (1) Enhanced Mobile Broadband (eMBB), (2) Massive Machine Type Communication (mMTC), and (3) Ultra-reliable and Low Latency Communications (URLLC).

[0122] Some use cases may require optimization across multiple domains, while others may focus on just one Key Performance Indicator (KPI). 5G supports these diverse use cases in a flexible and reliable manner.

[0123] eMBB extends far beyond basic mobile internet access, encompassing rich interactive tasks, cloud computing, and augmented reality media and entertainment applications. Data is a key driver of 5G, and dedicated voice services may not be the first to emerge in the 5G era. In 5G, voice is expected to be handled as an application, simply using the data connection provided by the communication system. The primary drivers of increased traffic volume are the increasing size of content and the growing number of applications requiring high data rates. Streaming services (audio and video), interactive video, and mobile internet connectivity will become more prevalent as more devices connect to the internet. Many of these applications require always-on connectivity to push real-time information and notifications to users. Cloud storage and applications are rapidly growing on mobile communication platforms, applicable to both work and entertainment. Cloud storage is a particular use case driving the growth of uplink data rates. 5G is also used for remote work in the cloud, requiring significantly lower end-to-end latency to maintain a superior user experience when tactile interfaces are used. Entertainment, for example, cloud gaming and video streaming are other key factors driving the demand for mobile broadband. Entertainment is essential on smartphones and tablets, regardless of location, including in highly mobile environments such as trains, cars, and airplanes. Another use case is augmented reality and information retrieval for entertainment, where augmented reality requires extremely low latency and instantaneous data volumes.

[0124] Additionally, one of the most anticipated 5G use cases concerns mMTC, the ability to seamlessly connect embedded sensors across all sectors. The number of potential IoT devices is projected to reach 20.4 billion by 2020. Industrial IoT is one area where 5G will play a key role, enabling smart cities, asset tracking, smart utilities, agriculture, and security infrastructure.

[0125] URLLC encompasses new services that will transform industries through ultra-reliable, low-latency links, such as remote control of critical infrastructure and self-driving vehicles. Reliability and latency are essential for smart grid control, industrial automation, robotics, and drone control and coordination.

[0126] Let's take a more specific look at several use cases.

[0127] 5G can complement fiber-to-the-home (FTTH) and cable-based broadband (or DOCSIS) by delivering streams rated at hundreds of megabits per second to gigabits per second. These high speeds are required to deliver TV at resolutions beyond 4K (6K, 8K, and beyond), as well as virtual and augmented reality. Virtual reality (VR) and augmented reality (AR) applications include near-immersive sports events. Certain applications may require specialized network configurations. For example, for VR games, game companies may need to integrate their core servers with the network operator's edge network servers to minimize latency.

[0128] Automotive is expected to be a significant new driver for 5G, with numerous use cases for in-vehicle mobile communications. Passenger entertainment, for example, demands simultaneous high-capacity and high-mobility mobile broadband. This is because future users will expect high-quality connectivity regardless of their location or speed. Another automotive application is an augmented reality dashboard, which overlays information on what the driver sees through the windshield, identifying objects in the dark and informing the driver about their distance and movement. In the future, wireless modules will enable communication between vehicles, the exchange of information between vehicles and supporting infrastructure, and between vehicles and other connected devices (e.g., devices accompanying pedestrians). Safety systems can guide drivers on alternative courses of action to reduce the risk of accidents, enabling safer driving. The next step will be remotely controlled or self-driving vehicles, which will require highly reliable and fast communication between different self-driving vehicles and between vehicles and infrastructure. In the future, self-driving cars will perform all driving tasks, leaving drivers to focus solely on traffic anomalies that the vehicles themselves cannot detect. The technological requirements for self-driving cars will require ultra-low latency and ultra-high-speed reliability, increasing traffic safety to levels unattainable by humans.

[0129] Smart cities and smart homes, often referred to as "smart societies," will be embedded with dense wireless sensor networks. A distributed network of intelligent sensors will identify conditions for cost- and energy-efficient maintenance of cities or homes. A similar setup can be implemented for each home. Temperature sensors, window and heating controllers, burglar alarms, and appliances will all be connected wirelessly. Many of these sensors typically have low data rates, low power, and low cost. However, for example, real-time HD video may be required for certain types of devices for surveillance purposes.

[0130] The consumption and distribution of energy, including heat and gas, are becoming increasingly decentralized, requiring automated control of distributed sensor networks. Smart grids interconnect these sensors using digital information and communication technologies to collect and act on information. This information can include the behavior of suppliers and consumers, enabling smart grids to improve efficiency, reliability, economic efficiency, sustainable production, and automated distribution of fuels like electricity. Smart grids can also be viewed as another low-latency sensor network.

[0131] The health sector has numerous applications that can benefit from mobile communications. Telecommunications systems can support telemedicine, which provides clinical care in remote locations. This can help reduce distance barriers and improve access to health services that are otherwise unavailable in remote rural areas. It can also be used to save lives in critical care and emergency situations. Mobile-based wireless sensor networks can provide remote monitoring and sensors for parameters such as heart rate and blood pressure.

[0132] Wireless and mobile communications are becoming increasingly important in industrial applications. Wiring is expensive to install and maintain. Therefore, the potential to replace cables with reconfigurable wireless links presents an attractive opportunity for many industries. However, achieving this requires wireless connections to operate with similar latency, reliability, and capacity to cables, while simplifying their management. Low latency and extremely low error rates are new requirements for 5G connectivity.

[0133] Logistics and freight tracking are important use cases for mobile communications, enabling the tracking of inventory and packages anywhere using location-based information systems. Logistics and freight tracking typically require low data rates but wide coverage and reliable location information.

[0134] Multi-Input Multi-Output (MIMO) technology in NR systems provides a scalable and flexible MIMO framework. Basically, it includes beam-based operation, scalable and flexible Channel State Information (CSI) codebook, reference signal (RS) design, and codebook design for CSI Type I and CSI Type II. Additionally, improvements have been introduced to support a CSI Type II codebook for multi-user (MU)-MIMO, multiple transmit / receive points (TRPs) or multiple panel transmission operations depending on backhaul conditions, multi-beam operation, high uplink transmit power support, and reference signals with low Peak-to-Average Power Ratio (PAPR) characteristics. Furthermore, beam management methods to reduce beam failure for wireless devices moving at high frequencies, expansion of multi-TRP transmission in uplink and downlink, sounding reference signals (SRSs) for capacity and coverage expansion, and improvements to Type II CSI-RSs can be supported.

[0135] Describes a conventional wireless communication system. This may also be called the Evolved-UMTS Terrestrial Radio Access Network (E-UTRAN) or the Long Term Evolution (LTE) / LTE-A system.

[0136] E-UTRAN includes a base station (BS), which provides a control plane and a user plane to user equipment (UE). A UE may be fixed or mobile, and may be referred to by other terms such as a mobile station (MS), a user terminal (UT), a subscriber station (SS), a mobile terminal (MT), a wireless device, or a terminal. A base station (BS) is a fixed point that communicates with a UE, and may be referred to by other terms such as an evolved-NodeB (eNB), a gNodeB (gNB), a base transceiver system (BTS), or an access point.

[0137] Base stations can be interconnected via the X2 interface. Base stations are connected to the Evolved Packet Core (EPC) via the S1 interface, more specifically, to the Mobility Management Entity (MME) via the S1-MME, and to the Serving Gateway (S-GW) via the S1-U.

[0138] The EPC consists of an MME, an S-GW, and a P-GW (Packet Data Network Gateway). The MME holds information about terminal access and capabilities, and this information is primarily used for terminal mobility management. The S-GW is a gateway that terminates on the E-UTRAN, and the P-GW is a gateway that terminates on the PDN.

[0139] Figure 1 illustrates the system architecture of a New Generation Radio Access Network (NG-RAN) to which NR is applied.

[0140] Referring to Fig. 1, the NG-RAN may include gNBs and / or eNBs that provide user plane and control plane protocol termination to the UE. Fig. 1 exemplifies a case including only gNBs. The gNBs (eNBs) are connected to each other via Xn interfaces. The gNBs and eNBs are connected to the 5th generation core network (5G Core Network: 5GC) via the NG interface. More specifically, they are connected to the access and mobility management function (AMF) via the NG-C interface, and to the user plane function (UPF) via the NG-U interface.

[0141] The layers of the radio interface protocol between the terminal and the network can be divided into L1 (layer 1), L2 (layer 2), and L3 (layer 3) based on the three lower layers of the Open System Interconnection (OSI) standard model, which is widely known in communication systems. Among these, the physical layer belonging to layer 1 provides information transfer service using physical channels, and the RRC (Radio Resource Control) layer located in layer 3 controls radio resources between the terminal and the network. To this end, the RRC layer exchanges RRC messages between the terminal and the base station.

[0142] Figure 2 is a block diagram illustrating the radio protocol architecture for the user plane. Figure 3 is a block diagram illustrating the radio protocol architecture for the control plane. The user plane is a protocol stack for transmitting user data, and the control plane is a protocol stack for transmitting control signals.

[0143] Referring to Figures 2 and 3, the physical layer (PHY layer) provides information transfer services to upper layers using physical channels. The PHY layer is connected to its upper layer, the Medium Access Control (MAC) layer, through a transport channel. Data is transferred between the MAC layer and the PHY layer via the transport channel. Transport channels are classified based on how and with what characteristics data is transmitted over the wireless interface.

[0144] Data travels between different physical layers, i.e., between the physical layers of a transmitter and receiver, via a physical channel. This physical channel can be modulated using Orthogonal Frequency Division Multiplexing (OFDM) and utilizes time and frequency as radio resources.

[0145] The MAC layer's functions include mapping between logical channels and transport channels, and multiplexing / demultiplexing MAC service data units (SDUs) belonging to logical channels into transport blocks provided as physical channels on the transport channels. The MAC layer provides services to the RLC (Radio Link Control) layer through logical channels.

[0146] The functions of the RLC layer include concatenation, segmentation, and reassembly of RLC SDUs. To guarantee the various Quality of Service (QoS) required by radio bearers (RBs), the RLC layer provides three operating modes: Transparent Mode (TM), Unacknowledged Mode (UM), and Acknowledged Mode (AM). AM RLC provides error correction through automatic repeat request (ARQ).

[0147] The RRC (Radio Resource Control) layer is defined only in the control plane. The RRC layer is responsible for controlling logical, transport, and physical channels, including the configuration, reconfiguration, and release of radio bearers. An RB is a logical path provided by Layer 1 (PHY layer) and Layer 2 (MAC layer, RLC layer, PDCP layer) for data transmission between a terminal and the network.

[0148] The functions of the Packet Data Convergence Protocol (PDCP) layer in the user plane include the transmission of user data, header compression, and ciphering. The functions of the Packet Data Convergence Protocol (PDCP) layer in the control plane include the transmission of control plane data and encryption / integrity protection.

[0149] Establishing an RB refers to the process of defining the characteristics of the radio protocol layer and channel to provide a specific service, and setting specific parameters and operating methods for each. RBs can be further divided into two types: signaling RBs (SRBs) and data RBs (DRBs). SRBs are used as a conduit for transmitting RRC messages in the control plane, while DRBs are used as conduits for transmitting user data in the user plane.

[0150] When an RRC connection is established between the RRC layer of the terminal and the RRC layer of the E-UTRAN, the terminal is in an RRC connected state, otherwise it is in an RRC idle state.

[0151] Downlink transmission channels that transmit data from the network to the terminal include the Broadcast Channel (BCH), which transmits system information, and the downlink Shared Channel (SCH), which transmits user traffic or control messages. Traffic or control messages for downlink multicast or broadcast services may be transmitted through the downlink SCH or a separate downlink Multicast Channel (MCH). Meanwhile, uplink transmission channels that transmit data from the terminal to the network include the Random Access Channel (RACH), which transmits initial control messages, and the uplink Shared Channel (SCH), which transmits user traffic or control messages.

[0152] Logical channels that are located above the transport channel and are mapped to the transport channel include BCCH (Broadcast Control Channel), PCCH (Paging Control Channel), CCCH (Common Control Channel), MCCH (Multicast Control Channel), and MTCH (Multicast Traffic Channel).

[0153] A physical channel consists of multiple OFDM symbols in the time domain and multiple subcarriers in the frequency domain. A single subframe consists of multiple OFDM symbols in the time domain. A resource block is a resource allocation unit and consists of multiple OFDM symbols and multiple subcarriers. Additionally, each subframe can use specific subcarriers of specific OFDM symbols (e.g., the first OFDM symbol) of the subframe for the Physical Downlink Control Channel (PDCCH), for example, the L1 / L2 control channel. A Transmission Time Interval (TTI) is a unit time for subframe transmission.

[0154] Figure 4 illustrates the functional division between NG-RAN and 5GC.

[0155] Referring to FIG. 4, the gNB can provide functions such as inter-cell radio resource management (Inter Cell RRM), radio bearer management (RB control), connection mobility control (Connection Mobility Control), radio admission control (Radio Admission Control), measurement configuration and provision, and dynamic resource allocation. The AMF can provide functions such as NAS security and idle state mobility processing. The UPF can provide functions such as mobility anchoring and PDU processing. The SMF (Session Management Function) can provide functions such as terminal IP address allocation and PDU session control.

[0156] Figure 5 illustrates a frame structure that can be applied in NR.

[0157] Referring to FIG. 5, a radio frame (hereinafter abbreviated as a frame) can be used for uplink and downlink transmission in NR. A frame has a length of 10 ms and can be defined as two 5 ms half-frames (Half-Frames, HF). A half-frame can be defined as five 1 ms sub-frames (Subframes, SF). A frame can include 10 sub-frames. A sub-frame can be divided into one or more slots, and the number of slots in a sub-frame depends on the Subcarrier Spacing (SCS). Each slot includes 12 or 14 OFDM (A) symbols depending on the cyclic prefix (CP). When a normal CP is used, each slot includes 14 symbols. When an extended CP is used, each slot includes 12 symbols. Here, the symbol may include an OFDM symbol (or CP-OFDM symbol), an SC-FDMA symbol (or a DFT-s-OFDM symbol). A mini-slot may include, for example, 2, 4, or 7 symbols, or may include more or fewer symbols.

[0158] NR systems can support multiple numerologies. Numerologies can be defined by subcarrier spacing and cyclic prefix (CP) overhead. Multiple subcarrier spacings can be derived by scaling the basic subcarrier spacing by an integer N. Furthermore, even if it is assumed that very low subcarrier spacing is not utilized at very high carrier frequencies, the numerologies utilized can be selected independently of the frequency band. Furthermore, NR systems can support various frame structures corresponding to multiple numerologies.

[0159] Below, we examine the Orthogonal Frequency Division Multiplexing (OFDM) numerologies and frame structures that can be considered in NR systems. Table 1 lists the various OFDM numerologies supported in NR systems.

[0160] Table 1 below illustrates the subcarrier spacing configuration μ (also referred to as subcarrier spacing configuration).

[0161] [Table 1]

[0162]

[0163] Regarding the frame structure in the NR system, the sizes of the various fields in the time domain are T s =1 / (Δf max· N f ) can be expressed as a multiple of the time unit. Here, Δf max =480 · 10 3 and N f =409. Downlink and uplink transmissions are T f =(Δf max· N f / 100) · T s = It consists of a radio frame with a duration of 10ms. Here, each radio frame is T sf =(Δf max· N f / 1000) · T s = It consists of 10 subframes with a duration of 1ms. In this case, there may be one set of frames for uplink and one set of frames for downlink. In addition, the transmission of uplink frame number i from a terminal (User Equipment, UE) is T earlier than the start of the corresponding downlink frame from the terminal. TA =NTA· T s It must start before. For numerology μ, slots are n within a subframe. μ s ∈{0, ..., N slots,μ subframe -1} are numbered in increasing order, and n within a radio frame μ s,f ∈{0, ..., N slots,μ frame -1} are numbered in increasing order. One slot is N μ symb It consists of consecutive OFDM symbols, and N μ symb is determined by the numerology and slot configuration used. Slot n in a subframe μ s The start of OFDM symbol n in the same subframe μ s N μ symb are aligned temporally with the start of the OFDM signal. Not all terminals can transmit and receive simultaneously, which means that not all OFDM symbols in a downlink slot or uplink slot can be utilized.

[0164] Table 2 below shows the number of slots (N) in a frame according to the subcarrier spacing setting μ. frame,μ slot ), number of slots in a subframe (N subframe,μ slot ), number of symbols in the slot (N slot symb ) are examples.

[0165] [Table 2]

[0166]

[0167] Table 2-1 below illustrates that when extended CP is used, the number of symbols per slot, the number of slots per frame, and the number of slots per subframe change depending on the SCS.

[0168] [Table 2-1]

[0169]

[0170] In an NR system, OFDM(A) numerologies (e.g., SCS, CP length, etc.) may be set differently between multiple cells that are merged into a single terminal. Accordingly, the (absolute time) interval of a time resource (e.g., SF, slot, or TTI) (conveniently referred to as TU (Time Unit)) consisting of the same number of symbols may be set differently between the merged cells.

[0171] In relation to physical resources in an NR system, antenna ports, resource grids, resource elements, resource blocks, and carrier parts can be considered. Hereinafter, the physical resources that can be considered in an NR system will be described in detail. First, with respect to antenna ports, an antenna port is defined such that the channel through which a symbol on the antenna port is carried can be inferred from the channel through which another symbol on the same antenna port is carried. If the large-scale properties of the channel through which a symbol on one antenna port is carried can be inferred from the channel through which a symbol on another antenna port is carried, then the two antenna ports can be said to be in a QC / QCL (quasi co-located or quasi co-location) relationship. Here, the large-scale properties include one or more of delay spread, Doppler spread, frequency shift, average received power, and received timing.

[0172] Figure 6 shows an example of a resource grid in NR.

[0173] Referring to Figure 6, the resource grid is N in the frequency domain. μ RB N RB sc It consists of subcarriers, and one subframe is 14·2 μ It is described as an example, but not limited to, that it consists of OFDM symbols. In an NR system, the transmitted signal is N μ RB N RBsc One or more resource grids consisting of subcarriers and 2 μ N (μ) symb is described by OFDM symbols. Here, N μ RB≤ N max,μ RB is. The above N max,μ RB represents the maximum transmission bandwidth, which may vary between numerologies as well as between uplink and downlink. In this case, one resource grid may be configured for each numerology μ and each antenna port p. Each element of the resource grid for numerology μ and each antenna port p is referred to as a resource element and is uniquely identified by an index pair {index in the frequency domain, position of the symbol within the subframe}. If there is no risk of confusion or if a particular antenna port or numerology is not specified, the indices p and μ may be dropped. In addition, a resource block (RB) is defined as N in the frequency domain. RB sc =12 is defined as a series of consecutive subcarriers.

[0174] Point A serves as a common reference point of the resource block grid and is obtained as follows.

[0175] offsetToPointA for primary cell (Pcell) downlink represents the frequency offset between the lowest subcarrier of the lowest resource block overlapping the SS / PBCH block used by the terminal for initial cell selection and point A, expressed in resource block units assuming 15 kHz subcarrier spacing for FR1 and 60 kHz subcarrier spacing for FR2, and absoluteFrequencyPointA represents the frequency-location of point A expressed as in absolute radio-frequency channel number (ARFCN).

[0176] Common resource blocks (CRBs) are numbered from 0 upwards in the frequency domain for a subcarrier spacing setting μ. The center of subcarrier 0 of CRB 0 for a subcarrier spacing setting μ coincides with 'point A'. CRB number n in the frequency domain μ CRB The resource elements (k,l) for the subcarrier spacing setting μ are given by the following equation.

[0177] [Formula 1]

[0178]

[0179] k is defined relative to point A so that k=0 corresponds to the subcarrier centered at point A. Physical resource blocks are numbered from 0 to N within the bandwidth part (BWP). size BWP,i - Numbered from 1 to 1, where i is the number of BWP. Physical resource block n in BWP i PRB and common resource block n CRB The relationship between them is given by the equation below.

[0180] [Formula 2]

[0181]

[0182] N start BWP,i is a common resource block where BWP starts relative to common resource block 0.

[0183] Figure 7 shows an example of a physical resource block in NR.

[0184] Referring to FIG. 7, a physical resource block (PRB) may be composed of different frequency resources and time resources depending on the subcarrier spacing.

[0185] Figure 8 illustrates the slot structure of an NR frame.

[0186] Referring to FIG. 8, a slot may include multiple symbols in the time domain. For example, in the case of a normal CP, one slot may include 14 symbols, but in the case of an extended CP, one slot may include 12 symbols. A carrier may include multiple subcarriers in the frequency domain. A Resource Block (RB) may be defined as multiple (e.g., 12) consecutive subcarriers in the frequency domain. A Bandwidth Part (BWP) may be defined as multiple consecutive (P)RBs in the frequency domain, and may correspond to a single numerology (e.g., SCS, CP length, etc.). A carrier may include up to N BWPs (e.g., 4 or 5). Data communication is performed through activated BWPs, and only one BWP may be activated for one terminal. In the resource grid, each element is referred to as a Resource Element (RE), to which one complex symbol can be mapped.

[0187] As another example, in the time domain, a slot for a normal CP contains 7 symbols, but in the case of an extended CP, a slot contains 6 symbols. A carrier contains multiple subcarriers in the frequency domain. A Resource Block (RB) is defined as multiple (e.g., 12) consecutive subcarriers in the frequency domain. A Bandwidth Part (BWP) is defined as multiple consecutive (P)RBs in the frequency domain, and can correspond to a single numerology (e.g., SCS, CP length, etc.). A carrier can contain up to N (e.g., 5) BWPs. Data communication is performed through activated BWPs, and only one BWP can be activated for a single terminal. Each element in the resource grid is referred to as a Resource Element (RE), to which one complex symbol can be mapped.

[0188] A PDCCH (physical downlink control channel) may be composed of one or more CCEs (control channel elements) as shown in Table 3 below.

[0189] [Table 3]

[0190]

[0191] For example, a PDCCH can be transmitted via a resource consisting of 1, 2, 4, 8, or 16 CCEs, where a CCE is composed of 6 resource element groups (REGs), and one REG is composed of one resource block in the frequency domain and one orthogonal frequency division multiplexing (OFDM) symbol in the time domain.

[0192] Monitoring refers to decoding each PDCCH candidate according to the DCI (downlink control information) format. The terminal monitors a set of PDCCH candidates in one or more core sets (CORESETs, described below) on the active DL BWP of each activated serving cell for which PDCCH monitoring is configured, according to the corresponding search space set.

[0193] In NR, a new unit called a control resource set (CORESET) can be introduced. A terminal can receive PDCCHs in a CORESET.

[0194] Figure 9 illustrates a core set.

[0195] Referring to Figure 9, the core set is N in the frequency domain. CORESET RB It consists of N resource blocks and is in the time domain. CORESET symb ∈ {1, 2, 3} symbols. N CORESET RB , N CORESET symb can be provided by the base station via upper layer signals. As illustrated in Fig. 9, a core set may include multiple CCEs (or REGs).

[0196] A terminal may attempt PDCCH detection in units of 1, 2, 4, 8, or 16 CCEs within a core set. One or more CCEs for which PDCCH detection can be attempted may be referred to as PDCCH candidates.

[0197] A terminal can be configured with multiple core sets.

[0198] In conventional wireless communication systems (e.g., LTE / LTE-A), the control domain spans the entire system bandwidth used by the base station. Except for some terminals that support only narrow bandwidths (e.g., eMTC / NB-IoT terminals), all terminals must be able to receive radio signals across the entire system bandwidth of the base station to properly receive / decode the control information transmitted by the base station.

[0199] In contrast, NR introduces the aforementioned core set. A core set is a radio resource for control information that a terminal must receive. It can utilize only a portion of the system bandwidth in the frequency domain, rather than the entire bandwidth. Furthermore, it can utilize only a portion of the symbols within a slot in the time domain. The base station can assign a core set to each terminal and transmit control information through the assigned core set. In NR, a terminal can receive control information from the base station without necessarily receiving the entire system bandwidth.

[0200] The core set may include a terminal-specific core set for transmitting terminal-specific control information and a common core set for transmitting control information common to all terminals.

[0201] Meanwhile, in NR, depending on the application field, high reliability may be required, and in such a situation, the target block error rate (BLER) for downlink control information (DCI) transmitted through a downlink control channel (e.g., physical downlink control channel: PDCCH) may be significantly lower than in the prior art. One example of a method for satisfying such a requirement requiring high reliability is to reduce the amount of content included in the DCI and / or increase the amount of resources used when transmitting the DCI. In this case, the resources may include at least one of time domain resources, frequency domain resources, code domain resources, and spatial domain resources.

[0202] The following technologies / features can be applied in NR:

[0203] Self-contained subframe structure

[0204] Figure 10 illustrates an example of a frame structure for a new wireless access technology.

[0205] In NR, for the purpose of minimizing latency, a structure in which a control channel and a data channel are time-division multiplexed (TDM) within one TTI, as shown in Fig. 10, can be considered as one of the frame structures.

[0206] FIG. 10 illustrates an example in which a downlink control region is located at the front of the TTI and an uplink control region is located at the back of the TTI. The region between the downlink control region and the uplink control region can be used for downlink data (DL data) transmission or uplink data (UL data) transmission. A characteristic of this structure is that downlink (DL) reception and uplink (UL) transmission are sequentially performed within a single subframe / slot, so that DL data can be received and UL ACK / NACK (Acknowledgement / Not-acknowledgement) can be transmitted within a single subframe / slot. As a result, the time required for data retransmission when a data transmission error occurs is reduced, thereby minimizing the latency of the final data transmission.

[0207] In this way, in a data and control TDMed subframe structure, a time gap is required for the base station and terminal to transition from transmission mode to reception mode or from reception mode to transmission mode. To this end, some OFDM symbols at the point of transition from DL to UL in a self-contained subframe structure can be set as a guard period (GP).

[0208] Figure 11 illustrates the structure of a self-contained slot.

[0209] In an NR system, a single slot may contain a DL control channel, DL or UL data, and a UL control channel. For example, the first N symbols in a slot may be used to transmit a DL control channel (hereinafter, referred to as a DL control region), and the last M symbols in the slot may be used to transmit a UL control channel (hereinafter, referred to as a UL control region). N and M are each integers greater than or equal to 0. A resource region (hereinafter, referred to as a data region) between the DL control region and the UL control region may be used for DL ​​data transmission or UL data transmission. As an example, the following configuration may be considered. Each section is listed in chronological order.

[0210] 1. DL only configuration

[0211] 2. UL only configuration

[0212] 3. Mixed UL-DL configuration

[0213] - DL area + GP (Guard Period) + UL control area

[0214] - DL control area + GP + UL area

[0215] DL area: (i) DL data area, (ii) DL control area + DL data area

[0216] UL domain: (i) UL data domain, (ii) UL data domain + UL control domain

[0217] In the DL control region, a PDCCH can be transmitted, and in the DL data region, a PDSCH (physical downlink shared channel) can be transmitted. In the UL control region, a PUCCH (physical uplink control channel) can be transmitted, and in the UL data region, a PUSCH (physical uplink shared channel) can be transmitted. In the PDCCH, downlink control information (DCI), such as DL data scheduling information and UL data scheduling information, can be transmitted. In the PUCCH, uplink control information (UCI), such as ACK / NACK (Positive Acknowledgement / Negative Acknowledgement) information for DL ​​data, CSI (Channel State Information) information, and SR (Scheduling Request), can be transmitted. GP provides a time gap when a base station and a terminal switch from transmission mode to reception mode or from reception mode to transmission mode. Some symbols at the time of switching from DL to UL within a subframe can be set as GP.

[0218] System information of an NR system can be transmitted in a broadcasting manner. At this time, analog beams belonging to different antenna panels within one symbol can be transmitted simultaneously, and a method of introducing a beam reference signal (BRS), which is a reference signal (RS) transmitted by applying a single analog beam (corresponding to a specific antenna panel) to measure a channel for each analog beam, is being discussed. The BRS can be defined for multiple antenna ports, and each antenna port of the BRS can correspond to a single analog beam. At this time, unlike the BRS, a synchronization signal or xPBCH can be transmitted by applying all analog beams within an analog beam group so that any terminal can receive it well.

[0219] In NR, a synchronization signal block (SSB, or may be referred to as a synchronization signal and physical broadcast channel (SS / PBCH) in the time domain) may be composed of four OFDM symbols numbered in ascending order from 0 to 3 within the synchronization signal block, and a primary synchronization signal (PSS), a secondary synchronization signal (SSS), and a PBCH associated with a demodulation reference signal (DMRS) may be mapped to the symbols. As described above, the synchronization signal block may also be referred to as an SS / PBCH block.

[0220] In NR, multiple synchronization signal blocks can be transmitted at different times, and SSB can be used to perform initial access (IA), serving cell measurement, etc. Therefore, when the transmission time and resources overlap with other signals, it is desirable to transmit SSB preferentially. To achieve this, the network can broadcast SSB transmission time and resource information or indicate it through UE-specific RRC signaling.

[0221] NR can perform beam-based transmission and reception operations. If the reception performance of the current serving beam degrades, a process called beam failure recovery (BFR) can be used to find a new beam.

[0222] Since BFR is not a process for declaring an error / failure in the link between the network and the terminal, it can be assumed that the connection with the current serving cell is maintained even when the BFR process is performed. During the BFR process, measurements are performed on different beams set by the network (a beam can be expressed as a CSI-RS port or an SSB (synchronization signal block) index, etc.) and the best beam for the terminal is selected. The terminal can proceed with the BFR process by performing the RACH process associated with the beam with the best measurement result.

[0223] Now, we will describe the Transmission Configuration Indicator (TCI) state. The TCI state can be set for each core set of the control channel, and parameters for determining the terminal's receive (Rx) beam can be determined based on the TCI state.

[0224] For each downlink bandwidth portion (DL BWP) of a serving cell, a terminal may be configured with up to three core sets. Additionally, for each core set, the terminal may be provided with the following information:

[0225] 1) Coreset index p (e.g., one from 0 to 11, where the index of each coreset can be uniquely determined among the BWPs of a serving cell),

[0226] 2) PDCCH DM-RS scrambling sequence initialization value,

[0227] 3) Interval in the time domain of the core set (can be given in symbol units),

[0228] 4) A set of resource blocks,

[0229] 5) CCE-to-REG mapping parameters,

[0230] 6) Antenna port quasi co-location (QCL) information indicating quasi co-location (QCL) information of DM-RS antenna ports for PDCCH reception in each core set (from a set of antenna port quasi co-locations provided by a higher layer parameter called 'TCI-State');

[0231] 7) Indicating the presence or absence of a transmission configuration indication (TCI) field for a specific DCI format transmitted by PDCCH in the core set, etc.

[0232] Let's explain QCL. If the characteristics of the channel through which a symbol on one antenna port is transmitted can be inferred from the characteristics of the channel through which a symbol on another antenna port is transmitted, then the two antenna ports are said to be in quasi-co-location (QCL). For example, if two signals (A and B) are transmitted from the same transmit antenna array with identical / similar spatial filters applied, the two signals may experience identical / similar channel conditions. From the receiver's perspective, if one of the two signals is received, the channel characteristics of the received signal can be used to detect the other signal.

[0233] In this sense, the fact that A and B are QCL may mean that A and B experienced similar channel conditions, and thus, the channel information estimated to detect A is also useful for detecting B. Here, the channel conditions may be defined by, for example, Doppler shift, Doppler spread, average delay, delay spread, spatial reception parameters, etc.

[0234] The 'TCI-State' parameter associates one or two downlink reference signals with a corresponding QCL type (there are QCL types A, B, C, and D, see Table 4).

[0235] [Table 4]

[0236]

[0237] Each 'TCI-State' may include parameters for establishing a quasi-colocation (QCL) relationship between one or two downlink reference signals and a DM-RS port of a PDSCH (or PDCCH), or a CSI-RS port of a CSI-RS resource.

[0238] Meanwhile, in each DL BWP configured for a terminal in a serving cell, the terminal may be provided with up to 10 search space sets. For each search space set, the terminal may be provided with at least one of the following pieces of information.

[0239] 1) Search space set index s (0≤s<40), 2) Association between core set P and search space set s, 3) PDCCH monitoring period and PDCCH monitoring offset (slot unit), 4) PDCCH monitoring pattern within a slot (e.g., indicating the first symbol of the core set within a slot for PDCCH monitoring), 5) Number of slots in which search space set s exists, 6) Number of PDCCH candidates per CCE aggregation level, 7) Information indicating whether search space set s is CSS (common search space) or USS (UE-specific search space), etc.

[0240] In NR, core set #0 can be configured by PBCH (or terminal-specific signaling for handover, PSCell configuration, or BWP configuration). The search space (SS) set #0 configured by PBCH can have different monitoring offsets (e.g., slot offset, symbol offset) for each associated SSB. This may be necessary to minimize the search space occasions that the terminal must monitor. Alternatively, it may also be necessary to provide a beam sweeping control / data area that can transmit control / data for each beam so that communication with the terminal can be continuously performed in a situation where the best beam of the terminal dynamically changes.

[0241] Figure 12 illustrates physical channels and typical signal transmission.

[0242] Referring to Figure 12, in a wireless communication system, a terminal receives information from a base station via the downlink (DL), and the terminal transmits information to the base station via the uplink (UL). The information transmitted and received between the base station and the terminal includes data and various control information, and various physical channels exist depending on the type and purpose of the information they transmit and receive.

[0243] When a terminal is powered on again from a powered-off state or newly enters a cell, it performs an initial cell search operation, such as synchronizing with the base station (S11). To this end, the terminal receives the PSCH (Primary Synchronization Channel) and SSCH (Secondary Synchronization Channel) from the base station to synchronize with the base station and obtain information such as the cell ID (cell identity). In addition, the terminal can obtain broadcast information within the cell by receiving the PBCH (Physical Broadcast Channel) from the base station. In addition, the terminal can receive the DL RS (Downlink Reference Signal) during the initial cell search phase to check the downlink channel status.

[0244] (Initial) cell search can be defined as a procedure in which a terminal acquires time and frequency synchronization with a cell and detects the cell ID of the cell. Cell search can be based on the primary synchronization signal and secondary synchronization signal of the cell, and the PBCH DMRS.

[0245] A terminal that has completed initial cell search can obtain more specific system information by receiving a PDCCH (Physical Downlink Control Channel) and a corresponding PDSCH (Physical Downlink Control Channel) (S12).

[0246] Thereafter, the terminal may perform a random access procedure (Random Access Procedure) to complete connection to the base station (S13-S16). Specifically, the terminal may transmit a preamble through a Physical Random Access Channel (PRACH) (S13) and receive a Random Access Response (RAR) for the preamble through a PDCCH and a corresponding PDSCH (S14). Thereafter, the terminal may transmit a Physical Uplink Shared Channel (PUSCH) using scheduling information in the RAR (S15) and perform a contention resolution procedure (Contention Resolution Procedure) such as a PDCCH and a corresponding PDSCH (which may be considered a process of receiving a contention resolution message) (S16).

[0247] When accessing a base station for the first time or when there is no radio resource for signal transmission, a terminal may perform a random access procedure (RACH) for the base station. At this time, a 4-step contention-based or type-1 random access may include a first step in which the terminal transmits a random access preamble (or Msg1) to the base station, a second step in which the terminal receives a random access response (RAR) (or Msg2) from the base station, a third step in which the terminal transmits an uplink message (or Msg3) to the base station, and a fourth step in which the terminal receives a contention resolution message (or Msg4) from the base station. Alternatively, a 2-step contention-based or type-2 random access may include a step A in which the terminal transmits a random access preamble and an uplink message to the base station, and a step B in which the terminal receives a random access response and a contention resolution message from the base station. A contention-free random access procedure may only include steps 1 and 2 of a contention-based access procedure, and steps 3 and 4 are not required because no contention occurs between terminals.

[0248] The terminal can transmit a random access preamble or PRACH to the base station based on the random access opportunity (RO), preamble transmission power, etc. provided through SIB1 or dedicated RRC signaling. Here, the terminal can select an optimal SSB or CSI-RS (Channel Status Information-Reference Signal) and determine an RO and / or preamble index group associated with the selected SSB or CSI-RS. The terminal can select an optimal SSB and a corresponding reception beam from among a plurality of SSBs corresponding to the multi-beam sweeping of the base station during the initial access process. Meanwhile, after the initial access, the terminal can perform transmission beam and / or reception beam selection or change through a CSI measurement and reporting process based on the CSI-RS from the base station in an RRC connection state.

[0249] After the terminal transmits the preamble, the terminal can monitor RAR reception for a predetermined period of time. For example, the terminal can monitor the PDCCH scrambled with RA-RNTI and receive the RAR through the PDSCH transmitted in the resource scheduled by the DCI in the PDCCH. The RAR may include a Random Access Preamble Identifier (RAPID), an uplink grant (UL Grant) for Msg3 scheduling, a temporary cell identifier (Temporary C(Cell)-RNTI), and a Timing Advance Command (TAC) determined based on the preamble reception timing.

[0250] If the terminal fails to successfully receive the RAR, the preamble can be retransmitted by applying power ramping, etc.

[0251] If the terminal successfully receives the RAR, it can transmit Msg3 based on the UL grant within the RAR. Once Msg3 is transmitted, the terminal can start the contention resolution timer (CR timer) and perform PDCCH monitoring based on the C-RNTI for Msg4 reception. If Msg4 is received while the CR timer is running, the terminal can determine that contention resolution has been successfully completed.

[0252] A terminal that has performed the above-described procedure can then perform PDCCH / PDSCH reception (S17) and PUSCH / PUCCH (Physical Uplink Control Channel) transmission (S18) as general uplink / downlink signal transmission procedures. Control information that the terminal transmits to the base station is referred to as UCI (Uplink Control Information). UCI includes HARQ ACK / NACK (Hybrid Automatic Repeat and reQuest Acknowledgement / Negative-ACK), SR (Scheduling Request), CSI (Channel State Information), etc. CSI includes CQI (Channel Quality Indicator), PMI (Precoding Matrix Indicator), RI (Rank Indication), etc. UCI is generally transmitted through PUCCH, but can be transmitted through PUSCH when control information and data must be transmitted simultaneously. In addition, the terminal can aperiodically transmit UCI through PUSCH according to a request / instruction of the network. UCI can be repeatedly transmitted over PUCCH.

[0253] Meanwhile, the control information that the terminal transmits to the base station via the uplink (or that the terminal receives from the base station) may include downlink / uplink ACK / NACK signals, CQI (Channel Quality Indicator), PMI (Precoding Matrix Index), RI (Rank Indicator), etc. For example, in the case of a 3GPP LTE system, the terminal may transmit the above-described control information such as CQI / PMI / RI via PUSCH and / or PUCCH.

[0254] The table below shows an example of the DCI format.

[0255] [Table 5]

[0256]

[0257] Referring to Table 5 above, DCI formats 0_0, 0_1, and 0_2 may include resource information related to scheduling of PUSCH (e.g., UL / SUL (Supplementary UL), frequency resource allocation, time resource allocation, frequency hopping, etc.), transport block (TB) related information (e.g., MCS, NDI, RV, etc.), HARQ related information (e.g., process number, DAI, PDSCH-HARQ feedback timing, etc.), multi-antenna related information (e.g., DMRS sequence initialization information, antenna port, CSI request, etc.), power control information (e.g., PUSCH power control, etc.), and the control information included in each DCI format may be predefined.

[0258] DCI format 0_0 is used for scheduling PUSCH in a single cell. The information contained in DCI format 0_0 is CRC-scrambled and transmitted using C-RNTI, CS-RNTI, or MCS-C-RNTI.

[0259] DCI format 0_1 ​​is used to schedule one or more PUSCHs in a single cell, or to indicate configured grant (CG) downlink feedback information to the UE. The information contained in DCI format 0_1 ​​is CRC-scrambled and transmitted using the C-RNTI, CS-RNTI, SP-CSI-RNTI, or MCS-C-RNTI.

[0260] DCI format 0_2 is used for scheduling PUSCH in a single cell. The information contained in DCI format 0_2 is CRC-scrambled and transmitted using C-RNTI, CS-RNTI, SP-CSI-RNTI, or MCS-C-RNTI.

[0261] Next, DCI formats 1_0, 1_1, and 1_2 may include resource information related to scheduling of PDSCH (e.g., frequency resource allocation, time resource allocation, VRB-PRB mapping, etc.), transport block (TB) related information (e.g., MCS, NDI, RV, etc.), HARQ related information (e.g., process number, DAI, PDSCH-HARQ feedback timing, etc.), multi-antenna related information (e.g., antenna port, TCI, SRS request, etc.), PUCCH related information (e.g., PUCCH power control, PUCCH resource indicator, etc.), and control information included in each DCI format may be predefined.

[0262] DCI format 1_0 is used for scheduling PDSCH in a DL cell. The information contained in DCI format 1_0 is CRC-scrambled and transmitted using C-RNTI, CS-RNTI, or MCS-C-RNTI.

[0263] DCI format 1_1 is used for scheduling PDSCH in a single cell. Information included in DCI format 1_1 is CRC-scrambled and transmitted using C-RNTI, CS-RNTI, or MCS-C-RNTI.

[0264] DCI format 1_2 is used for scheduling PDSCH in a single cell. The information contained in DCI format 1_2 is CRC-scrambled and transmitted using C-RNTI, CS-RNTI, or MCS-C-RNTI.

[0265] <LDPC 코드>

[0266] A key component of the 5G NR standard is the use of advanced error correction codes, such as LDPC codes, to ensure reliable transmission over wireless channels. 5G must support high throughputs of up to 20 Gbps, various block sizes with different code rates on the data channel, and Hybrid Automatic Repeat Request (HARQ).

[0267] LDPC codes offer a good solution that meets all the requirements set by 3GPP. The base graph of 5G NR LDPC codes is structured, and the parity check matrix can efficiently support HARQ and rate compatibility. This base graph characteristic allows it to support an arbitrary number of transmitted information bits at various code rates over a wide range.

[0268] <Base Graphs of 5G NR LDPC Codes>

[0269] Figure 13 illustrates the structure of the basic graph of NR.

[0270] Referring to Figure 13, two types of base graphs (BGs), BG-1 and BG-2, can be defined. The use of these BGs can be determined based on the size of the required information bits and the code transmission rate. For example, BG-1 consists of 46 rows and 68 columns, and the size of the information block is K = 22Z. c , BG-2 consists of 42 rows and 52 columns, and K = 10Z c It can be. Here, Z cis the size of the lifting matrix, and Table 6 below illustrates a set of lifting sizes defined for 5G NR.

[0271] [Table 6]

[0272]

[0273] The block structure of BG-1 and BG-2 is identical. Columns include Information Columns, Core Parity Columns, and Extension Parity Columns. Rows are divided into Core Check Rows and Extension Check Rows.

[0274] [Table 7]

[0275]

[0276] Submatrix E is a dual diagonal matrix useful for low-complexity encoding of LDPC. Each basic graph has 51 lifting sizes, ranging from 2 to 384.

[0277] According to the LDPC encoding procedure, 66Z c Generate coded bits (for BG-1) and 50Z c Generates coded bits (for BG-2). The coded bits in BG-1 and BG-2 are output in the order of systematic bits, core parity bits, and extended parity bits.

[0278] <NR LDPC 코드에서 레이트 매칭(Rate Matching in NR LDPC Codes)>

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

[0280] [Table 8]

[0281]

[0282] <NR LDPC 코드에서 인터리빙(Interleaving in NR LDPC Codes)>

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

[0284] Figure 14 illustrates the output of an interleaver in the case of 16QAM modulation.

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

[0286] <NR에서 레이어 맵핑(Layer mapping in NR)>

[0287] In MIMO 2 codeword transmission, each layer is divided into two sets, and data is transmitted with independent MCS for each set. That is, a separate TB is allocated for each layer set, and each is channel-encoded to transmit an independent codeword for each layer set.

[0288] The table below shows the codeword-to-layer mapping relationship. A single codeword is transmitted for ranks below 4. In this case, modulation symbols are mapped alternately across each layer to maximize diversity gains.

[0289] [Table 9]

[0290]

[0291] <NR에서 변조 맵퍼(modulation mapper)>

[0292] In QPSK modulation, pairs of bits, b(2i), b(2i+1), are mapped to complex-valued modulation symbols d(i) as follows:

[0293] [Formula 3]

[0294]

[0295] In 16QAM modulation, 4 bits, b(4i), b(4i+1), b(4i+2), b(4i+3), are mapped to complex value modulation symbols d(i) as shown below.

[0296] [Formula 4]

[0297]

[0298] In 64QAM modulation, 6 bits, b(6i), b(6i+1), b(6i+2), b(6i+3), b(6i+4), b(6i+5), are mapped to complex value modulation symbols d(i) as shown below.

[0299] [Formula 5]

[0300]

[0301] Here, even-numbered input bits are mapped to the I-channel (in phase channel), and odd-numbered input bits are mapped to the Q-channel (quadrature channel).

[0302] In 16QAM modulation, b(4i) and b(4i+1) are transmitted more reliably than b(4i+2) and b(4i+3) in the I-channel and Q-channel, respectively.

[0303] To enable reasonable battery consumption when BA (bandwidth adaptation) is configured, only one uplink BWP and one downlink BWP, or only one downlink / uplink BWP pair, for each uplink carrier can be activated at a time within an active serving cell, while all other BWPs configured in the UE are deactivated. In deactivated BWPs, the UE does not monitor the PDCCH and does not transmit on the PUCCH, PRACH, and UL-SCH.

[0304] For BA, the receive and transmit bandwidth of the terminal need not be as wide as the cell bandwidth and can be adjusted: the width can be commanded to change (e.g., shrinking during periods of low activity to save power), the location in the frequency domain can be moved (e.g., to increase scheduling flexibility), and the subcarrier spacing can be commanded to change (e.g., to allow different services). A subset of the total cell bandwidth of a cell is referred to as a bandwidth part (BWP), and a BA is obtained by setting BWP(s) to the terminal and notifying the terminal which of the set BWPs is currently active. Once a BA is set, the terminal only needs to monitor the PDCCH on one active BWP. For example, there is no need to monitor the PDCCH on the entire downlink frequency of the cell. A BWP inactive timer (independent of the DRX inactive timer described above) is used to switch an active BWP to a default BWP: the timer is restarted upon successful PDCCH decoding, and a switch to the default BWP occurs when the timer expires.

[0305] Below, we describe the integrated access and backhaul link (IAB). For convenience, the proposed approach is based on the new RAT (NR) system. However, the scope of the proposed approach can be expanded to include other systems, such as 3GPP LTE / LTE-A systems, in addition to NR systems.

[0306] One potential technology that aims to enable future cellular network deployment scenarios and applications is support for wireless backhaul and relay links, enabling flexible and very dense deployment of NR cells without the need to proportionally densify the transport network.

[0307] The expected availability of greater bandwidth in NR compared to LTE (e.g., in the mmWave spectrum), along with the native deployment of massive MIMO or multi-beam systems, creates opportunities for the development and deployment of integrated access and backhaul links. This allows for easier deployment of dense networks of self-backhauled NR cells in a more integrated manner by establishing multiple control and data channels / procedures defined to provide connectivity or access to terminals. Such systems are referred to as integrated access and backhaul links (IAB).

[0308] In this disclosure, the following are defined:

[0309] - AC(x): Access link between node(x) and terminal(s).

[0310] - BH(xy): Backhaul link between node(x) and node(y).

[0311] At this time, the node may refer to a DgNB (donor gNB) or a relay node (RN). Here, the DgNB or donor node may be a gNB that provides a function to support backhaul for IAB nodes.

[0312] When relay node 1 and relay node 2 exist, and relay node 1 is connected to relay node 2 via a backhaul link and relays data transmitted and received to relay node 2, relay node 1 is called the parent node of relay node 2, and relay node 2 is called the child node of relay node 1.

[0313] <Application layer forward error correction (AL-FEC)>

[0314] Application-layer forward error correction (FEC) is a technique used at the application layer of a network protocol stack to detect and correct errors without retransmission, ensuring data integrity. This section explains application-layer FEC.

[0315] Application-layer FEC is an innovative approach to providing robustness in mobile broadcasting systems. Existing data, such as multimedia files or streams, is augmented with recovery information that can be used to recover lost data at the receiver. AL-FEC can be integrated into the content delivery protocol (CDP) to support robust transmission. Recognizing the importance of AL-FEC, several standards bodies, such as 3GPP and DVB, have standardized Raptor codes as the most robust AL-FEC codes available for these applications. Key features of Raptor codes include channel efficiency, low complexity, and flexibility. System integration is a key consideration when using AL-FEC. Proper system design, including AL-FEC, can significantly improve the efficiency and / or quality of delivery services.

[0316] Use Cases

[0317] 1) Video streaming: Application layer FEC can correct errors immediately to ensure smooth playback without interruption due to data loss or errors.

[0318] 2) VoIP and real-time communications: Reducing latency and preventing retransmissions are critical to maintaining call quality and real-time interaction.

[0319] 3) Data transmission on unstable networks: In scenarios with high network error rates, such as wireless networks and satellite communications, application-layer FEC improves data reliability.

[0320] Although application-layer FEC has several advantages, it also has some disadvantages compared to physical-layer FEC.

[0321] 1) Increased latency: Application-layer FEC typically operates at a higher level of the protocol stack, which can introduce additional processing delays. This is particularly important for time-sensitive applications where every millisecond counts.

[0322] 2) Higher overhead: Adding error correction codes at the application layer can significantly increase the amount of data transmitted. This can lead to increased bandwidth usage and longer transmission times.

[0323] 3) Complexity: Implementing FEC at the application layer can be more complex than at the physical layer. Developers must design and integrate FEC algorithms within their applications, which can be resource-intensive and time-consuming.

[0324] 4) Redundancy: Since many lower layers, such as the physical and data link layers, already implement their own forms of error correction, adding FEC to the application layer can create redundancy. This can be inefficient and consume unnecessary resources.

[0325] 5) Inefficient hardware utilization: Application-layer FEC is typically implemented in software, which may not be as fast or efficient as hardware-based implementations at the physical layer. Hardware implementations can utilize specialized processors to handle error correction more efficiently.

[0326] 6) Scalability Issues: As data rates and volumes increase, the computational load of software-based FEC at the application layer also increases. This can become a bottleneck, especially for high-throughput applications.

[0327] 7) Delayed error detection: Errors corrected at the application layer are detected later in the transmission process compared to physical layer FEC, so errors may propagate through multiple layers before being corrected, causing problems in intermediate stages.

[0328] <Outer coding across code blocks>

[0329] For stable transmission of transport blocks for FEC in the physical layer, a turbo code was used in conventional systems (e.g., LTE systems), and an LDPC code was used in NR systems.

[0330] Among error correction techniques for transmitting transmission blocks with a lower error rate and higher reliability, there is a method of transmitting and receiving by sequentially applying multiple channel codes (typically two) instead of a single channel code. In this case, the channel code located outside the transmission process (i.e., performed relatively early in encoding and relatively late in decoding) among the two channel codes is generally called an outer code, and the channel code located inside the transmission process (i.e., performed relatively late in encoding and relatively early in decoding) is called an inner code. Hereinafter, coding using an outer code is called outer coding, and coding using an inner code is called inner coding.

[0331] Various channel codes can be used for both the outer and inner codes. For example, single parity codes (SPC), Hamming codes, BCH codes, Reed-Solomon (RS) codes, and Reed-Muller (RM) codes can be used as outer codes, while convolution codes, Turbo codes, LDPC codes, and polar codes can be used as inner codes.

[0332] For example, SPC may mean a code that performs an XOR operation on each bit of information bits (e.g., d1, d2, ..., dn) (e.g., d1 XOR d2 XOR, ..., XOR dn) to obtain a 1-bit parity bit.

[0333] Hamming code can be defined as a code that inserts parity bits at appropriate locations between data bits, so that when an error occurs, the location of the faulty bit can be identified and corrected.

[0334] One method of applying external coding is to apply external coding between different code blocks (CBs) to generate parity code blocks, and to additionally transmit these parity code blocks so as to restore data of code blocks that were not successfully received.

[0335] Figure 15 shows an example of transmitting a parity code block.

[0336] Referring to Fig. 15, when a transmission block (TB) to be transmitted exists, the transmission block is segmented into one or more (e.g., K) code blocks (CB). When these K code blocks are called systematic code blocks or information code blocks, P parity code blocks can be obtained by encoding the systematic code blocks using an external code.

[0337] Channel coding (internal code encoding) can be performed on each of the K+P code blocks obtained in this way. This adds parity bits to each code block.

[0338] Parity code blocks generated through channel coding may be transmitted together with the systematic code block during initial transmission of the systematic code block, and / or may be transmitted when an error occurs in reception of the systematic code block and retransmission is required.

[0339] The receiver can recover transmission errors in some systematic CBs through the received parity CBs, thereby improving the transmission performance of the entire transmission block.

[0340] Figure 16 illustrates a unit to which an external code is applied.

[0341] Referring to Fig. 16, when obtaining P parity code blocks using an external code from K systematic code blocks, the units to which the external code is applied can be as follows.

[0342] When a bit unit to which an external code is applied is called a bit block, as illustrated in Fig. 16, one code block can be divided into multiple (e.g., M) bit blocks. At this time, external code encoding can be performed on a total of K bit blocks, one bit block per code block, to obtain P parity bit blocks.

[0343] Each parity bit block is contained in a different parity code block. For example, the m-th bit blocks of each code block (a total of K bit blocks) are outer-coded to obtain the m-th bit block of each parity code block (a total of P parity bit blocks). Therefore, in general, a total of M outer-code encoding processes are performed to obtain P parity code blocks from K code blocks.

[0344] At this time, the number of information bits that constitute one bit block may be as follows.

[0345] 1) single bit

[0346] One bit can constitute one bit block. In this case, P outer code parity bits are generated using a total of K bits, one bit from each code block, and the P parity bits can belong to a total of P parity code blocks, each one bit.

[0347] 2) Multiple bits

[0348] Multiple bits can form a bit block. In this case, P*b outer code parity bits can be generated using K*b bits, with b bits from each code block. The P*b parity bits can belong to P parity code blocks, each with b bits.

[0349] Multiple (e.g., a) bits are 2 a having a size of (0 ~ 2 a A non-binary value having one of the values ​​-1 can be constructed. In this case, P outer code parity non-binary values ​​can be generated using a total of K non-binary values, one non-binary value (e.g., a bits) from each code block. The P parity non-binary values ​​can belong to a total of P parity code blocks, each of which has one non-binary value.

[0350] Multiple (e.g., a) bits are 2 a (0 ~ 2) with a size of a -1) can be constructed as a non-binary value. In this case, P*b outer code parity non-binary values ​​can be generated using a total of K*b non-binary values, with b non-binary values ​​(e.g., a*b bits in total) from each code block. The P*b parity non-binary values ​​can belong to a total of P parity code blocks, each with b non-binary values.

[0351] This transmission method uses parity CBs to recover when errors occur in a small number of systematic CBs. However, there is a limitation in that it cannot be effectively used in an environment where there is a large difference in channel status between multiple code blocks that constitute a transmission block, and errors are likely to occur concentrated in some code blocks.

[0352] In addition, when generating P parity CBs by encoding K systematic CBs using an external code, there is a problem that the overhead of the parity CBs increases when the length of the transmission block is small and the number of systematic CBs is too small.

[0353] Considering the above points, the present disclosure proposes an operation of applying the outer code across different transmission blocks to overcome the disadvantages of 'outer coding across code blocks' while applying the outer code at the physical layer.

[0354] The present disclosure proposes an operation of generating and transmitting parity by applying an external code between a plurality of information transmission blocks (hereinafter, may be denoted as information TB, Info-TB, I-TB, or simply transmission blocks), thereby recovering an error occurring in the information TB.

[0355] As described above, an operation of obtaining parity by applying external coding between different transmission blocks can be considered to overcome the limitations of the above-mentioned 'external coding across code blocks' while performing external coding at the physical layer.

[0356] More specifically, when there are multiple information TB(s) transmitted from a transmitter to a receiver, external code encoding is performed on the multiple information TB(s) to generate parity transmission blocks (hereinafter, parity TB, which may be denoted as p-TB), and these information TB(s) and parity TB(s) are transmitted from the transmitter to the receiver, so that the receiver can use the received information TB(s) and parity TB(s) to recover errors that occurred in the information TB(s).

[0357] These parity TB(s) may be additionally transmitted from the transmitter to the receiver after determining whether the transmission of the information TB(s) was successful or not, in case an error occurs in the information TB(s). Alternatively, these parity TB(s) may be transmitted from the transmitter to the receiver before the transmitter receives feedback from the receiver regarding whether the transmission of the information TB(s) was successful or not, regardless of whether the transmission of the information TB(s) was successful or not.

[0358] Applying these actions can yield the following advantages:

[0359] 1) In order to retransmit an information TB with an error, the transmitter must know the location of the information TB where the error occurred. On the other hand, if a parity TB is transmitted instead of retransmitting the information TB when an error occurs in the information TB, the transmitter can transmit the required parity TB with only information about the number of information TBs where the error occurred. Therefore, applying the proposed operation has an advantage in terms of HARQ-ACK feedback overhead compared to the operation of performing information TB retransmission.

[0360] 2) If parity TB(s) are transmitted from the transmitter to the receiver regardless of whether the transmission of the information TB(s) was successful or not, that is, before the transmitter receives feedback from the receiver on whether the transmission of the information TB(s) was successful or not, there is an advantage of reducing latency compared to the operation of retransmitting the information TB when an error occurs in the information TB.

[0361] 3) When applying the proposed method, since external coding can be applied between information TBs with different channel conditions, a performance gain can be expected compared to the operation of generating and transmitting parity CB(s) using multiple information CBs within a single information TB. In environments where interference differences are large for each transmission resource, such as dynamic TDD or full duplex environments, the effect of applying the proposed external code can be further enhanced.

[0362] However, when applying these actions, the following limitations may exist:

[0363] 1) The TB sizes may differ between information TBs.

[0364] When the bit unit to which the outer code is applied is called a bit block, then outer code encoding is performed on a total of K bit blocks, each bit block consisting of b bits (e.g., b = 1) from each information TB, to obtain P parity bit blocks. Each of these parity bit blocks is included in a different parity code block. For example, the m-th bit blocks of each code block (a total of K bit blocks) are outer code encoded to obtain the m-th bit block of each parity code block (a total of P parity bit blocks). Therefore, when the information TB is composed of M bit blocks, in general, a total of M outer code encoding processes are performed to obtain P parity TBs from K code blocks.

[0365] However, if the TB sizes of the information TBs are different, the number of bit blocks in each TB may differ. In such cases, a method for obtaining parity TBs is required.

[0366] 2) The number of information TB may not be sufficient.

[0367] When using an external code that generates P parity bits from K inputs, K information TBs are required to perform the external coding. However, if the number of information TBs transmitted to a specific receiver is small, external coding may not be possible, or the number of information TBs may be too small relative to the number of parity TBs generated, preventing meaningful external coding effects.

[0368] Considering the problem of obtaining parity by applying external coding between different transmission blocks as described above, the present disclosure proposes a method of effectively applying external coding even when the sizes of the information TB(s) to which the external coding is applied are different and the number of information TBs is insufficient.

[0369] <Code block level outer coding across multiple transport blocks>

[0370] Considering the problem of the operation of obtaining parity by applying external coding between different transmission blocks as described above, the present disclosure proposes an operation of generating parity by applying external coding between a plurality of information TB(s), and generating and transmitting a parity code block (hereinafter, may be expressed as parity CB, P-CB) by applying external coding between a plurality of information code blocks (hereinafter, may be expressed as information CB, info-CB, I-CB, or simply code block) included in the plurality of information TB(s), thereby recovering an error occurring in the information CB.

[0371] Hereinafter, information TB may be simply referred to as a transmission block or TB, and information CB may be simply referred to as a code block or CB.

[0372] In the present disclosure, a parity CB can be generated using information CBs belonging to multiple information TBs as follows.

[0373] Step 1. N transmitted from transmitter to receiver I-TB About the dog information TB(s), N I-TB N included in the dog information TB(s) I-CB N through external code encoding from dog information CB(s) P-CB Dog parity CB(s) are generated. At this time, when each information TB is composed of one or more information CB(s), N I-CB is N I-TB It means the total number of information CB(s) included in the dog information TB(s).

[0374] For this, the transmitter transmits N to the receiver. I-TB N included in the dog information TB(s) I-CB N through external code encoding process using dog information CB(s) P-CB Generates a dog parity CB(s).

[0375] Step 2. These N I-TB Dog Information TB(s) and N P-CB The parity CB(s) are transmitted from the transmitter to the receiver. At this time, these parity CB(s) are transmitted from the transmitter to the receiver in the form of parity CB or N P-TB The parity TB(s) can be concatenated and included within the parity TB and transmitted from the transmitter to the receiver.

[0376] To do this, the transmitter tells the receiver N I-TB Dog Information TB(s) and N P-CB Transmits the dog parity CB(s).

[0377] The receiver receives N from the transmitter. I-TB Dog Information TB(s) and N P-CB Receives dog parity CB(s).

[0378] Step 3. If an error occurs in some of the information CB(s) included in the transmitted information TB(s), the information CB(s) with the error are recovered through an external code decoding process using the transmitted parity CB(s).

[0379] To do this, the receiver uses the received information TB(s) and parity CB(s) to I-CB Decoding of the dog information CB(s) is performed. If an error occurs in the reception of the information CB(s), the receiver uses the parity CB(s) to recover the error that occurred in the information CB(s) through an external code decoding process.

[0380] Figure 17 illustrates a process of obtaining parity CBs from multiple CBs included in multiple TBs.

[0381] Referring to FIG. 17, for example, three parity CBs can be obtained through external code encoding from a total of 11 information CBs contained within four information TBs (Info-TB 0 to Info-TB 3). At this time, the three parity CBs can be concatenated into one parity TB. In this case, in addition to the four information TBs, the one parity TB can be transmitted from the transmitter to the receiver.

[0382] In some embodiments, the number of parity TBs is N P-TB may always be equal to 1. That is, the proposal of the present disclosure includes an operation of generating a parity CB using a plurality of information CBs belonging to a plurality of information TBs, and concatenating these parity CBs to obtain one parity TB.

[0383] In some embodiments, the number of information TB, N I-TBmay always be equal to 1. That is, the proposal of the present disclosure includes generating a parity CB using a plurality of information CBs belonging to one information TB, transmitting these information CB(s) and parity CB(s) from a transmitter to a receiver, and applying the receiver to an operation of recovering an error that occurred in the information CB(s).

[0384] For downlink (DL) data transmission, the transmitter and receiver can be, in turn, a base station (BS) and a terminal (UE). The BS can be interpreted as a Transmission-Reception Point (TRP), a Base Station (BS), or a Distribution Unit (DU).

[0385] At this time, multiple information TBs may be transmitted to the terminal from the same base station. Alternatively, multiple information TBs may be transmitted to the same terminal from different base stations.

[0386] At this time, the parity CB(s) can be transmitted from the base station to the terminal via a DL channel (e.g., PDSCH).

[0387] For uplink (UL) data transmission, the transmitter and receiver can be, respectively, a terminal and a base station. The base station can be interpreted as a Transmission-Reception Point (TRP), a Base Station (BS), or a Distribution Unit (DU).

[0388] At this time, the parity CB(s) can be transmitted from the terminal to the base station via a UL channel (e.g., PUSCH).

[0389] For sidelink data transmission, the transmitter and receiver can be different terminals.

[0390] At this time, parity CB(s) can be transmitted from terminal to terminal via a sidelink channel (e.g., PSSCH).

[0391] In this disclosure, N is as follows: I-TB About the dog information TB(s), N I-TB N included in the dog information TB(s) I-CB N through external code encoding from dog information CB(s) P-CB A specific method for generating dog parity CB(s) is proposed. The contents of the present disclosure may include only some of the following processes.

[0392] Figure 18 illustrates the process of generating parity CB(s).

[0393] Referring to Figure 18, the transmitter is N I-TB The dog information TBs are divided into information CBs. After that, the information CB grouping is performed, and the information CB length alignment process is performed. After that, parity CB generation is performed to generate N P-CB Generate parity CBs.

[0394] Now, each step of Fig. 18 will be explained.

[0395] A. Information CB segmentation

[0396] N I-TB For each of the information TBs, each information TB is segmented into one or more information CBs. This allows N I-TB Total N from TB(s) of information I-CB Obtain the information CB(s) of the dog. The information CB included in the t-th information TB is N I-TB,t I-CB It is indicated as .

[0397] B. Information CB grouping

[0398] N I-TB Total N contained in TBs of information I-CBDog information CBs N G The dogs are grouped into info-CB group(s).

[0399] Through this N I-CB N from dog information CBs G Get the info-CB group(s) of the dog.

[0400] The number of information CBs included in the gth info-CB group is N G,g I-CB It is indicated as .

[0401] C. Information CB length alignment

[0402] N G For each info-CB group included in the info-CB group(s), the lengths of the information CBs included in the info-CB group are adjusted to be the same. This ensures that the information CBs included in each info-CB group have the same length as N. G Get the info-CB group(s) of the dog.

[0403] D. Parity CB generation

[0404] N G For each info-CB group included in the info-CB group(s), one or more parity CB(s) are generated through external code encoding using the information CBs included in the info-CB group as input.

[0405] Through this N G A total of N from the info-CB group(s) P-CB Obtain the parity CB(s) of the dog.

[0406] Below, the following notations may be used:

[0407] N G,g P-CB : Number of parity CBs generated through the gth info-CB group

[0408] NI-TB : Number of TB of information to which external coding is applied

[0409] N I-TB,t I-CB : The number of information CBs included in the t-th information TB

[0410] N I-CB : N I-TB The total number of information CBs contained in the information TB of the dog.

[0411] N I-CB can be expressed as follows.

[0412] [Formula 6]

[0413]

[0414] N G : Number of Info-CB groups

[0415] N G,g I-CB : Number of information CBs included in the gth info-CB group

[0416] N P-CB : N I-CB From the information CB of the dog (N G The total number of parity CBs generated (from the info-CB group).

[0417] N P-CB can be expressed as follows.

[0418] [Formula 7]

[0419]

[0420] Now, we will explain the length alignment of information CBs.

[0421] <Information CB length alignment>

[0422] The information CB grouping process can specifically work as follows.

[0423] In order to obtain a parity CB by encoding Info-CBs belonging to the same Info-CB group, the lengths (e.g., number of bits) between Info-CBs must be the same.

[0424] To align the lengths of Info-CBs belonging to the same Info-CB group, we propose the following method.

[0425] A. Zero padding

[0426] To align the lengths of Info-CBs belonging to the same Info-CB group, zero bits can be added to the bits constituting each Info-CB to make the lengths of the Info-CBs the same. The number of zero bits added to each Info-CB may vary. Some Info-CBs may not have zero bits added.

[0427] All Info-CBs belonging to the same Info-CB group after applying zero padding can have the same length. In this case, the length of Info-CBs belonging to the gth Info-CB group after applying zero padding is referred to as L G,g I-CB It is said.

[0428] When using the zero padding method, all bits that make up the information CB can be used to generate the parity CB, so there is an advantage in that an information CB in which an error has occurred can be recovered regardless of the location of the bit in which the error has occurred.

[0429] A.1. Information CB length after zero padding

[0430] L is the length of Info-CB after applying zero padding to Info-CB. G,g I-CB The value of can be determined as follows:

[0431] Method 1. L G,g I-CBThe value may be equal to the length of the longest Info-CB among the Info-CBs belonging to the g-th Info-CB group before performing zero padding.

[0432] Method 2. L G,g I-CB The value of N before performing zero padding I-CB It may be equal to the length of the longest Info-CB among all Info-CBs of the dog. In this case, L G,g I-CB The value of Info-CB may be equal to the length of the longest Info-CB among all Info-CBs included in the Info-CB group to which Info-CB belongs, as well as among all Info-CBs included in the entire Info-CB group. In this case, L G,g I-CB The value can be determined equally for all Info-CB groups.

[0433] Method 3. L G,g I-CB The value can be set / instructed from the base station to the terminal through RRC, MAC-CE, DCI signaling, etc. In this case, different L for each Info-CB group G,g I-CB The value can be set to L for all Info-CB groups. G,g I-CB The values ​​can be set identically.

[0434] For each Info-CB, L G,g I-CB And zero bits equal to the difference in length of the corresponding Info-CB can be added to the Info-CB. If the length of the Info-CB is L G,g I-CB In such cases, zero padding may not be performed on the corresponding Info-CB.

[0435] A.2. Position of bits where zero padding is performed

[0436] Zero padding may occur within Info-CB at the following locations:

[0437] Method 1.

[0438] Method 1-1. Zero bits can be positioned consecutively after the last bit of the bits that constitute the Info-CB. In other words, for each Info-CB configuration after zero padding, a total of L G,g I-CB For the bits of the dog, the bits that make up the existing Info-CB can be mapped in order from the very beginning and the remaining bits can be filled with zero bits.

[0439] Figure 19 illustrates the positions of bits where zero padding is performed.

[0440] Referring to Fig. 19, when, for example, 4 Info-CBs belong to the gth Info-CB group (Info-CB group g), the lengths of each Info-CB may be different, as in (a) of Fig. 19. In this case, as in (b) of Fig. 19, each Info-CB may be L G,g I-CB Zero bits may be added / padding at the end of each Info-CB to make it as long as .

[0441] Hereinafter, an Info-CB that is aligned to a specific bit length by performing zero padding on the Info-CBs included in an Info-CB group may be conveniently referred to as an aligned Info-CB. In other words, a code block that is aligned to a specific bit length by performing zero padding on the code blocks included in a code block group may be conveniently referred to as an aligned code block. In the example of Fig. 19, the length of the aligned code block is L G,g I-CB . And, zero padding does not necessarily have to be performed on all code blocks included in a code block group. For example, in the example of Fig. 19, zero padding is not performed (skipped) on I-CB a and I-CB c.

[0442] In an Info-CB group, the leftmost (front) bit may be the MSB (most significant bit) and the rightmost (back) bit may be the LSB (least significant bit).

[0443] Method 1-2. Zero bits can be placed consecutively before the first bit of the bits that constitute the Info-CB (code block). In other words, for each Info-CB configuration after zero padding, a total of L G,g I-CB For each bit, the bits that constitute the existing Info-CB can be mapped in reverse order from the last bit, starting from the last bit, and the remaining bits can be filled with zero bits. That is, the number of bits (L) that perform zero padding for a specific Info-CB G,g I-CB When the difference in length of Info-CB is z and the bits constituting the existing Info-CB are c0, c1, c2, c3..., z zero bits are located in the front of the Info-CB after zero padding is applied, and the bits constituting the existing Info-CB (c0, c1, c2, c3...) can be located thereafter.

[0444] Method 2.

[0445] The positions of the bits to which zero padding is performed can be determined so that the positions of the bits to which zero padding is performed between Info-CBs included in the Info-CB group do not overlap each other as much as possible.

[0446] In general, if T errors out of K pieces of information can be recovered through P parities using a specific outer code, and if a known bit (e.g., zero) is transmitted for some of the K pieces of information, the receiver can recover up to T errors in the remaining pieces of information because the bit is already known to the receiver. More specifically, if one error out of four pieces of information can be recovered, transmitting the known bit for one piece of information can recover one error that occurred in the remaining three pieces of information. Therefore, the probability of successfully transmitting all the information increases.

[0447] Considering this, distributing the bit positions where zero padding is applied across Info-CBs may help increase the probability of successfully receiving all Info-CBs.

[0448] Taking this into account, more specifically, N included within the Info-CB group G,g I-CB For each Info-CB, the number of bits of zero padding applied to the i-th Info-CB is z i When , the positions of the bits where zero padding is performed for each Info-CB can be determined as follows.

[0449] Method 2-1. For the i-th Info-CB, consecutive z from the back of the Info-CB i Map the zero bits of the previous Info-CB, starting from the bit position where zero padding was not performed in the previous Info-CB. i Zero bits are added to the bit positions of the dog.

[0450] For example, for each Info-CB configuration after zero padding, the total L G,g I-CB From the last bit position of the dog's bits in reverse order Burn bit ( consecutive z bits starting from the th biti Zero padding can be performed on the bits of the dog, and the bits that constitute the existing Info-CB can be mapped in order to the remaining bit positions except for the corresponding position. That is, Burn bit ( consecutive z bits starting from the th bit i Zero padding can be performed on the bits of the dog, and the bits that constitute the existing Info-CB can be mapped in order to the remaining bit positions excluding the corresponding positions.

[0451] At this time, The value of or The value of L G,g I-CB If it becomes greater than the value, and Instead, each and can be applied. In this case, zero padding can be performed on two or more Info-CBs for the same bit position.

[0452] Figure 20 is another example of bit positions where zero padding is performed.

[0453] Referring to Fig. 20, when, for example, 4 Info-CBs belong to the gth Info-CB group (Info-CB group g), the lengths of each Info-CB may be different, as in (a) of Fig. 20. In this case, as in (b) of Fig. 20, each Info-CB may be L G,g I-CB Zero bits may be added to each Info-CB to make it of the same length (i.e., zero padding is performed).

[0454] At this time, for example, zero padding is not performed on Info-CB a (i.e., I-CB a) and Info-CB c (i.e., I-CB c) in (a) of FIG. 20, and zero padding is performed only on Info-CB b (i.e., I-CB b) and Info-CB d (i.e., I-CB d).

[0455] The code block after zero padding is performed can be called an alignment code block, and referring to (b) of Fig. 20, in the case of Info-CB b, L G,g I-CB Zero padding is performed on consecutive bits in reverse order starting from the last bit among the dog bits. Then, for Info-CB d, L G,g I-CB Among the bits in Info-CB b, zero padding is performed on consecutive bits in reverse order starting from the last bit among the bits for which zero padding is not performed.

[0456] For example, a transmitter (base station or terminal) performs zero padding to minimize the overlap of zero bits in a group of code blocks (e.g., Info-CB group g) included in different transmission blocks among multiple transmission blocks, thereby generating aligned code blocks as shown in (b) of Fig. 20. The bit length of the aligned code block is L G,g I-CB An example of this case is shown in Figure 20.

[0457] As seen in (b) of Figure 20, all of the above alignment code blocks are L G,g I-CB In other words, the alignment code blocks have the same bit length due to the zero padding. In addition, the zero padding is performed in a manner that minimizes the overlap of the positions of zero-padded bits in different alignment code blocks.

[0458] Method 2-2. For the i-th Info-CB, consecutive z from the beginning of the Info-CB i Map the zero bits of the previous Info-CB, starting from the bit position where zero padding was not performed in the previous Info-CB. i Zero bits are added to the bit positions of the dog.

[0459] For example, for each Info-CB configuration after zero padding, the total L G,g I-CB Among the bits of the dog Burn bit ( consecutive z bits starting from the th bit i Zero padding can be performed on the bits of the dog, and the bits that constitute the existing Info-CB can be mapped in order to the remaining bit positions excluding the corresponding positions.

[0460] At this time, The value of L G,g I-CB If it becomes greater than the value, instead can be applied. In this case, zero padding can be performed on two or more Info-CBs for the same bit position.

[0461] Method 2-2 is also an example of a method to minimize the overlap of positions of zero-padded bits in different alignment code blocks.

[0462] When LDPC codes are applied for inner channel coding (inner coding) of information CB, systematic bits are located in the positions of bits located earlier (e.g., bits that are input to the encoder first) due to the characteristics of LDPC codes, and in general, these bits are connected to more check nodes than parity bits, so there is a possibility that they can be decoded more stably. Considering this, it may be considered to preferentially perform zero padding on the bits located at the rear of Info-CB so that the bits located at the rear of Info-CB can be transmitted more stably.

[0463] That is, when an LDPC code is applied for internal channel coding of information CB, zero padding can be performed from the bits at the rear (least significant bit: LSB) of Info-CB as in method 1-1 or method 2-1.

[0464] Meanwhile, when polar codes are applied for internal channel coding of information CB, transmission reliability may vary depending on the position of the transmitted bit due to the characteristics of polar codes. In general, bits located further back (e.g., bits that are input to the encoder later) are transmitted more reliably. Considering this, zero-padding may be performed preferentially on the bits located at the front of the Info-CB to ensure more stable transmission of the bits located at the front of the Info-CB.

[0465] That is, when a polar code is applied for internal channel coding of information CB, zero padding can be performed from the front bits of Info-CB as in method 1-2 or method 2-2.

[0466] A.3. Padding bits

[0467] Although the operation of adding zero bits to zero padding positions for zero padding has been described, the bit values ​​added to zero padding positions may not be limited to zero. For example, bits comprising specific known information may be added to zero padding positions. Or, for example, some of the bits constituting the information CB may be added by repetition / copying.

[0468] B. Puncture

[0469] In order to align the lengths of Info-CBs belonging to the same Info-CB group, some bits constituting each Info-CB may be punctured (excluded) to make the lengths of the Info-CBs the same. At this time, the number of bits punctured in each Info-CB may be different. At this time, puncturing may not be applied to some Info-CBs.

[0470] All Info-CBs belonging to the same Info-CB group after applying puncturing can have the same length. In this case, the length of Info-CBs belonging to the gth Info-CB group after applying puncturing is L G,g I-CB It could be.

[0471] When using a puncturing method, some of the bits that make up the information CB are not used to generate the parity CB. Therefore, if an error occurs in these punctured bits, the information CB with the error cannot be recovered. However, this method has the advantage of reducing the length of the parity CB. Selectively using puncturing for bits with a low error probability can reduce performance loss.

[0472] B.1. Information CB length after puncturing

[0473] The length of Info-CB after applying puncturing to Info-CB is L G,g I-CB When L G,g I-CB The value of can be determined as follows:

[0474] Method 1. L G,g I-CB The value may be equal to the length of the shortest Info-CB among the Info-CBs belonging to the g-th Info-CB group before performing zero padding.

[0475] Method 2. L G,g I-CBThe value of N before performing zero padding I-CB It may be equal to the length of the shortest Info-CB among all Info-CBs of the dog. In this case, L G,g I-CB The value of Info-CB may be equal to the length of the shortest Info-CB among all Info-CBs included in the Info-CB group to which Info-CB belongs, as well as among all Info-CBs included in the entire Info-CB group. In this case, L G,g I-CB The value can be determined equally for all Info-CB groups.

[0476] Method 3. L G,g I-CB The value can be set / instructed from the base station to the terminal through RRC, MAC-CE, DCI signaling, etc. In this case, different L for each Info-CB group G,g I-CB The value can be set to L for all Info-CB groups. G,g I-CB The values ​​can be set identically.

[0477] For each Info-CB, the length of that Info-CB and L G,g I-CB Bits of the same length as L can be punctured in the Info-CB. If the length of the Info-CB is L G,g I-CB In such cases, puncturing may not be performed on the corresponding Info-CB.

[0478] B.2. Position of bit where puncturing is performed

[0479] Locations where puncturing is performed within Info-CB may include:

[0480] Method 1.

[0481] It is possible to puncture consecutive bits in reverse order from the last bit of the bits that constitute the Info-CB. For example, for the bits that constitute the existing Info-CB, consecutive L bits from the beginning can be punctured. G,g I-CB The bits of the dog can be judged as the bits that constitute the Info-CB after puncturing is applied. That is, the number of bits that perform puncturing for a specific Info-CB (the length of the Info-CB and L G,g I-CB When the difference between the two is p and the bits constituting the existing Info-CB are c0, c1, c2, c3, ..., the L bits constituting the Info-CB are consecutive starting from the first bit (i.e., c0). G,g I-CB The bits of the dog can be judged as the bits that constitute the Info-CB after puncturing is applied.

[0482] Figure 21 illustrates the positions of bits where puncturing is performed.

[0483] Referring to Fig. 21, when, for example, 4 Info-CBs belong to the gth Info-CB group (Info-CB group g), the lengths of each Info-CB may be different, as in (a) of Fig. 21. In this case, as in (b) of Fig. 21, each Info-CB may be L G,g I-CB The bits (LSBs) at the back of each Info-CB can be punctured to make the length of Info-CB L. As a result, the length of Info-CBs is L as shown in (c) of Fig. 21. G,g I-CB can be sorted by

[0484] Alternatively, consecutive bits can be punctured starting from the first bit of the bits that constitute the Info-CB. For example, consecutive L bits can be punctured in reverse order from the last bit of the existing Info-CB. G,g I-CBThe bits of the dog can be judged as the bits that constitute the Info-CB after puncturing is applied. That is, the number of bits that perform puncturing for a specific Info-CB (the length of the Info-CB and L G,g I-CB Let the difference between the two be p and the bits that constitute the existing Info-CB be c0, c1, c2, c3, ..., then the p+1th bit among the bits that constitute the Info-CB (i.e., c p ) from continuous L G,g I-CB The bits of the dog can be judged as the bits that constitute the Info-CB after puncturing is applied.

[0485] When LDPC code is applied for internal channel coding of information CB, systematic bits are located at the bits located earlier (bits that are input to the encoder first) due to the characteristics of LDPC code, and generally, these bits are connected to more check nodes than parity bits, so there is a possibility that they can be decoded more stably. Considering this, it may be considered to perform puncturing preferentially on the bits in the front part of Info-CB. That is, when LDPC code is applied for internal channel coding of information CB, puncturing may be performed from the bits in the front part of Info-CB as in Method 1-2 or Method 2-2.

[0486] Meanwhile, when a polar code is applied for internal channel coding of an information CB, transmission reliability may vary depending on the position of the transmitted bit due to the characteristics of the polar code. In general, there is a phenomenon in which bits located further back (bits that are input to the encoder later) are transmitted with greater reliability. Considering this, it may be considered to perform puncturing preferentially on bits in the latter part of the Info-CB. That is, when a polar code is applied for internal channel coding of an information CB, puncturing may be performed starting from bits in the latter part of the Info-CB, as in Method 1-1 or Method 2-1.

[0487] C. Combination of zero padding and puncturing

[0488] In order to align the lengths of Info-CBs belonging to the same Info-CB group, the lengths of Info-CBs can be made equal by applying a zero padding or puncturing method to each Info-CB.

[0489] The length of the Info-CB after applying the sorting operation of the Info-CB length to the Info-CBs belonging to the g-th Info-CB group is L. G,g I-CB In this case, the method of zero padding or puncturing can be applied to each Info-CB as follows.

[0490] The length of Info-CB is L G,g I-CB If it is smaller, zero padding is performed. At this time, the zero padding operation can be applied as in the operation in 'A. Zero Padding' described above.

[0491] The length of Info-CB is L G,g I-CB If it is larger, puncturing is performed. At this time, the puncturing operation can be applied to the operation in 'B. Puncturing' described above.

[0492] After applying the alignment operation of Info-CB length to Info-CB, the length of Info-CB is L G,g I-CB If , L G,g I-CB The value can be determined as follows:

[0493] Method 1. L G,g I-CB The value can be set / instructed from the base station to the terminal through RRC, MAC-CE, DCI signaling, etc. In this case, different L for each Info-CB group G,g I-CB The value can be set to L for all Info-CB groups. G,g I-CB The values ​​can be set identically.

[0494] D. Re-mapping of information CBs

[0495] The length of the Info-CB after applying the sorting operation of the Info-CB length to the Info-CBs belonging to the g-th Info-CB group is L G,g I-CB In this case, the following method can be applied as a method that can obtain the same effect as the method of preventing the bit positions where zero padding is performed for each Info-CB from overlapping as much as possible as in method 2 of 'A.2. Positions of bits where zero padding is performed' described above.

[0496] First, for all Info-CBs included in the Info-CB group, the bits constituting each Info-CB are arranged sequentially, and then L G,g I-CB By re-segmenting bits, length-aligned Info-CBs can be reconstructed. At this time, the length of the last Info-CB is L. G,g I-CB If it is smaller than L G,g I-CB Zero padding can be performed to make the length of .

[0497] Figure 22 illustrates a method for re-mapping information CB.

[0498] As shown in (a) of Fig. 22, Info-CB group g may include four Info-CBs (i.e., I-CB a, I-CB b, I-CB c, I-CB d). In this case, as shown in (b) of Fig. 22, the four Info-CBs are arranged sequentially, and then L G,g I-CB can be divided again into bits. If the total number of bits of the four Info-CBs is L G,g I-CB If it is not a multiple of L G,g I-CB Zero bits can be added to make it a multiple of L G,g I-CB Each part consisting of bits of the dog again constitutes each Info-CB (I-CB a', I-CB b', I-CB c', I-CB d').

[0499] D.1. Info-CB length after length alignment

[0500] L G,g I-CB If the value of is smaller than the length of a specific Info-CB, the bits included in the same Info-CB may be divided and mapped to two Info-CBs after the length alignment process of the information CB through the re-mapping operation of the information CB described above. For example, referring to (b) of FIG. 22, I-CB c is divided and mapped to I-CB b' and I-CB c' after the re-mapping operation of the information CB.

[0501] In this case, if an error occurs in the Info-CB (e.g., I-CB c), the probability of recovering the error using the parity CB may be low because the error affects two Info-CBs (e.g., I-CB b', I-CB c') after the Info-CB length alignment process. Considering this, L for the g-th Info-CB group G,g I-CB The value of can be determined as follows:

[0502] Method 1. L G,g I-CB The value may be equal to the length of the longest Info-CB among the Info-CBs belonging to the gth Info-CB group before performing Info-CB length sorting.

[0503] Method 2. L G,g I-CB The value of N is before performing Info-CB length alignment. I-CB It may be equal to the length of the longest Info-CB among all Info-CBs of the dog. In this case, L G,g I-CB The value of Info-CB may be equal to the length of the longest Info-CB among all Info-CBs included in the Info-CB group to which Info-CB belongs, as well as among all Info-CBs included in the entire Info-CB group. In this case, L G,g I-CB The value can be determined equally for all Info-CB groups.

[0504] Method 3. L G,g I-CB The value can be set / instructed from the base station to the terminal through RRC, MAC-CE, DCI signaling, etc. In this case, different L for each Info-CB group G,g I-CB The value can be set to L for all Info-CB groups. G,g I-CB The values ​​can be set identically.

[0505] D.2. Arrangement order of Info-CBs

[0506] To perform this proposed operation, N included within the Info-CB group G,g I-CB When arranging the bits constituting each Info-CB sequentially for each Info-CB, the arrangement order of the Info-CB is proposed.

[0507] Method 1. N G,g I-CB The Info-CBs are arranged in descending order of the index of the info-TB to which the Info-CB belongs, and if the indices of the info-TBs are the same, in descending order of the index of the Info-CB within the info-TB.

[0508] Figure 23 illustrates the arrangement order of Info-CB according to method 1.

[0509] Referring to Fig. 23, let the four Info-CBs (I-CBs) included in the Info-CB group g be I-CB a, I-CB b, I-CB c, and I-CB d, if they are arranged in descending order of the index of the info-TB to which the Info-CB belongs, and if the indexes of the info-TBs are the same, in descending order of the index of the corresponding Info-CB within the info-TB. In this case, I-CB a, I-CB b, I-CB c, and I-CB d are arranged sequentially in that order. This is called L G,g I-CB It is segmented again by bits to form four Info-CBs (i.e., I-CB a', I-CB b', I-CB c', I-CB d').

[0510] Method 2. N G,g I-CBFor each Info-CB, the bits for the longest Info-CB (if there are multiple longest Info-CBs, those Info-CBs) are arranged first, and then the bits for the remaining Info-CBs are arranged sequentially in order.

[0511] Figure 24 illustrates the arrangement order of Info-CB according to method 2.

[0512] Referring to Fig. 24, among the four Info-CBs included in the Info-CB group g, the longest I-CB a and I-CB c are arranged first, and then Info-CB b and Info-CB d are arranged sequentially in order. This is called L G,g I-CB It is divided again into four Info-CBs (I-CB a', I-CB b', I-CB c', I-CB d') by bits.

[0513] Method 3. N G,g I-CB For each Info-CB, arrange them sequentially in order of length.

[0514] When using a method such as the above method 2 or method 3, it is possible to minimize the bits included in one Info-CB from being divided into multiple Info-CBs after the process of Info-CB length alignment.

[0515] Parity CB Puncture

[0516] In the parity CB generation process, N is generated through the gth Info-CB group. G,g P-CB A dog's parity CB can be generated.

[0517] When zero-padding is performed on the Info-CB(s) that constitute the Info-CB group, the bit positions where zero-padding is performed have a higher probability of recovering from errors compared to bit positions where zero-padding is not performed. Therefore, while p parities were required to recover errors that occurred in k pieces of information in the past, if zero-padding is performed on some of the k pieces of information, the required performance can be satisfied even with fewer parities than p.

[0518] Taking this into account, if zero padding is applied to some Info-CBs, it may be considered to reduce the overhead of unnecessary parity by performing puncturing on some parity CBs after generating them.

[0519] In this disclosure, after generating a parity CB, an operation is proposed of puncturing some bits of the parity CB to exclude them from the bits constituting the parity CB.

[0520] For example, for the gth Info-CB group, L G,g I-CB N having length G,g I-CB Using the Info-CBs of the dog, L G,g P-CB N having length G,g P-CB A parity CB of 1 can be generated. At this time, L G,g P-CB The value of L G,g I-CB It can be like this.

[0521] At this time, the nth bit of each parity CB is N G,g I-CB can be generated using the nth bits of each of the Info-CBs. At this time, a total of N corresponding to the generation of the nth bit of the parity CB G,g I-CB bits (i.e. N G,g I-CBFor each of the n-th bits of the Info-CBs, the n-th bit of some parity CB(s) may be punctured depending on the number of bits on which zero padding is performed (or depending on the number of bits on which zero padding is not performed).

[0522] For example, if there are A or more zero-padded bits among the nth bits of the Info-CBs for the gth Info-CB group (or if zero-padded bits are not performed and thus there are A' or fewer bits mapped with information), the nth bit for the B parity CBs can be punctured and excluded from the configuration of the corresponding parity CB.

[0523] <Method for determining the number of punctured parity CBs>

[0524] For example, if the number of bits zero-padded among the n-th bits of the Info-CBs included in the g-th Info-CB group is A or more (or if the number of bits to which information is mapped is A' or less because zero-padding is not performed), and the n-th bit is punctured for B parity CBs, the number B of parity CBs to which puncturing is performed for the n-th bit can be determined as follows. In general, the larger the value of A (or the smaller the value of A'), the larger the value of B can be determined.

[0525] Method 1. The value of B may be a value determined by the value of A (or A'). Alternatively, the value of B may be a value determined by a range of values ​​of A (or A'). The value of B may be defined as a specific value depending on the value or range of values ​​of A (or A').

[0526] Method 2. The value of B may be a value set / indicated from the base station to the terminal by RRC, MAC-CE, and / or DCI signaling. In this case, the value of A (or A') and the corresponding value of B may be set / indicated together.

[0527] <Method for determining parity CBs where puncturing is performed>

[0528] For example, L generated through the gth Info-CB group G,g P-CB N having length G,g P-CB For the parity CBs of the dog, L G,g P-CB Parity CB where the nth bit of the bits is punctured is B n When it is like a dog, puncturing is performed B n The parity CB(s) of the dog can be determined as follows:

[0529] Method 1. N G,g P-CB Consecutive B's in reverse order of index starting from the parity CB with the highest index among the parity CB's n The parity CB of the dog may be punctured. Or N G,g P-CB Consecutive B from the parity CB with the lowest index among the parity CBs n The parity CB of the dog can be punctured.

[0530] For example, if zero padding is performed on one Info-CB for the nth bit, puncturing may be performed on one parity CB, and if zero padding is performed on two Info-CBs, puncturing may be performed on two parity CBs.

[0531] Figure 25 illustrates a parity CB in which puncturing is performed.

[0532] Referring to FIG. 25, puncturing is performed on two parity CBs for bit positions where zero padding is performed on I-CB b and I-CB d. Accordingly, puncturing is performed on two parity CBs, namely parity CB 2 and parity CB 1, starting from the parity CB having the highest index. In addition, since puncturing is performed on only one parity CB for bit positions where zero padding is performed only on Info-CB b, puncturing is performed on parity CB 2, which is the parity CB having the highest index. No puncturing is performed on parity CBs for bit positions where zero padding is not performed on Info-CBs.

[0533] Figure 26 is another example of a parity CB in which puncturing is performed.

[0534] Referring to Fig. 26, zero padding is applied to at most one Info-CB. Accordingly, puncturing is performed on parity CB 2 for bit positions where zero padding is performed on one Info-CB.

[0535] When applying the proposed method of the present disclosure, the following advantages can be obtained.

[0536] For each Info-CB group, the lengths of the information CBs included in the Info-CB group are adjusted to be the same, so that outer coding can be performed even if the lengths of the Info-CBs are different.

[0537] When there are Info-CBs with zero padding, the overhead of parity can be reduced while maintaining the performance of the external code by performing puncturing on some parity CB(s).

[0538] Figure 27 illustrates an operation method of a terminal according to the present disclosure.

[0539] Referring to FIG. 27, the terminal generates a plurality of transport blocks (TBs) (S271).

[0540] The terminal segments each of the plurality of transmission blocks to generate code blocks (S272).

[0541] The terminal performs zero padding on a group of code blocks included in different transmission blocks among the plurality of transmission blocks to generate aligned code blocks, wherein the aligned code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different aligned code blocks (S273).

[0542] For example, if a specific code block group includes multiple code blocks, at least some of the multiple code blocks may have different bit lengths (e.g., see (a) of FIG. 20). In this case, the multiple code blocks included in the specific code block group may have a constant length (e.g., L G,g I-CB ) may be zero-padding performed on at least some of the plurality of code blocks. The code blocks after zero-padding may be referred to as aligned code blocks. At this time, the zero-padding is performed so that the overlap of the positions of zero-padded bits in different aligned code blocks is minimized (e.g., see (b) of FIG. 20).

[0543] The terminal performs encoding on the above alignment code blocks to generate a parity code block (S274).

[0544] The terminal transmits the plurality of transmission blocks and the parity code block to the base station (S275).

[0545] According to an embodiment, a first alignment code block included in the alignment code blocks includes z1 zero bits starting from a least significant bit (LSB), and a second code block included in the alignment code blocks includes z2 zero bits at bit positions that do not overlap with bit positions of the z1 zero bits, wherein z1 and z2 can each be a natural number.

[0546] According to an embodiment, a third code block included in the alignment code blocks includes z3 zero bits starting from the most significant bit (MSB), and a fourth code block included in the alignment code blocks includes z4 zero bits at bit positions that do not overlap with bit positions of the z3 zero bits, wherein z3 and z4 can each be a natural number.

[0547] The above alignment code blocks have the same bit length through the above zero padding, and the bit length may be the same as the longest bit length among the bit lengths of the code blocks included in the group of code blocks included in different transmission blocks.

[0548] In some embodiments, the bit length may be equal to the longest bit length among the bit lengths of all code blocks included in the plurality of transmission blocks.

[0549] In some embodiments, the step of receiving information indicating the bit length from the base station may be further included. For example, the base station may provide the information indicating the bit length to the terminal based on at least one of RRC, MAC-CE, and DCI signaling.

[0550] The bits of the parity code block corresponding to the bit positions of the zero-padded bits in the bit positions of the above-mentioned alignment code blocks may be punctured. This process has been described above with reference to FIGS. 25 and 26.

[0551] Zero padding may not be performed on a code block having a bit length equal to the bit length of the aligned code blocks among the code blocks included in a group of code blocks included in different transmission blocks (i.e., it may be skipped).

[0552] An error occurring in one of the code blocks included in a group of code blocks included in different transmission blocks can be recovered based on the parity code block.

[0553] The method of Fig. 27 can be applied, for example, to uplink. The method of Fig. 27 exemplifies a case where the transmitter is a terminal and the receiver is a base station.

[0554] According to the method described above, for each code block group, outer coding can be performed even if the lengths of the code blocks included in the code block group are different by aligning the lengths of the code blocks. Furthermore, when there are code blocks to which zero padding has been performed, puncturing can be performed on some parity code blocks to reduce the overhead of parity while maintaining the performance of the outer code.

[0555] Figure 28 illustrates an operation method of a base station according to the present disclosure.

[0556] Referring to FIG. 28, the base station generates a plurality of transport blocks (TBs) (S281).

[0557] The base station segments each of the plurality of transmission blocks to generate code blocks (S282).

[0558] The base station performs zero padding on a group of code blocks included in different transmission blocks among the plurality of transmission blocks to generate aligned code blocks, wherein the aligned code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different aligned code blocks (S283).

[0559] The base station performs encoding on the above alignment code blocks to generate a parity code block (S284).

[0560] The base station transmits the plurality of transmission blocks and the parity code block to the terminal (S285).

[0561] For example, a first sorting code block included in the sorting code blocks includes z1 zero bits starting from the least significant bit (LSB), and a second code block included in the sorting code blocks includes z2 zero bits at bit positions that do not overlap with bit positions of the z1 zero bits, wherein z1 and z2 can each be a natural number.

[0562] According to an embodiment, a third code block included in the alignment code blocks includes z3 zero bits starting from the most significant bit (MSB), and a fourth code block included in the alignment code blocks includes z4 zero bits at bit positions that do not overlap with bit positions of the z3 zero bits, wherein z3 and z4 can each be a natural number.

[0563] The above alignment code blocks have the same bit length through the above zero padding, and the bit length may be the same as the longest bit length among the bit lengths of the code blocks included in the group of code blocks included in different transmission blocks.

[0564] In some embodiments, the bit length may be equal to the longest bit length among the bit lengths of all code blocks included in the plurality of transmission blocks.

[0565] Depending on the embodiment, the base station may further include a step of transmitting information indicating the bit length to the terminal. For example, the base station may provide the information indicating the bit length to the terminal based on at least one of RRC, MAC-CE, and DCI signaling.

[0566] The bits of the parity code block corresponding to the bit positions of the zero-padded bits in the bit positions of the above alignment code blocks can be punctured.

[0567] Zero padding may not be performed on a code block having a bit length equal to the bit length of the aligned code blocks among the code blocks included in a group of code blocks included in different transmission blocks (i.e., it may be skipped).

[0568] An error occurring in one of the code blocks included in a group of code blocks included in different transmission blocks can be recovered based on the parity code block.

[0569] The method of Fig. 28 can be applied, for example, to downlink. The method of Fig. 28 exemplifies a case where the transmitter is a base station and the receiver is a terminal.

[0570] Figure 29 illustrates the signaling process and operation between a base station and a terminal.

[0571] Referring to FIG. 29, a terminal generates a plurality of transport blocks (TBs) (S291), segments each of the plurality of transport blocks to generate code blocks (S292), and performs zero padding on groups of code blocks included in different transport blocks among the plurality of transport blocks to generate aligned code blocks, wherein the aligned code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different aligned code blocks (S293).

[0572] The terminal performs encoding on the alignment code blocks to generate a parity code block (S294), and then transmits the plurality of transmission blocks and the parity code block to the base station (S295).

[0573] Figure 30 illustrates a wireless device applicable to the present specification.

[0574] Referring to FIG. 30, the first wireless device (100) and the second wireless device (200) can transmit and receive wireless signals through various wireless access technologies (e.g., LTE, NR).

[0575] A first wireless device (100) includes at least one processor (102) and at least one memory (104), and may further include at least one transceiver (106) and / or at least one antenna (108). The at least one processor (102, hereinafter simply referred to as a processor) controls at least one memory (104, hereinafter simply referred to as a memory) and / or at least one transceiver (106, hereinafter simply referred to as a transceiver or a transceiver), and may be configured to implement the descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed in this document. For example, the processor (102) may process information in the memory (104) to generate first information / signal, and then transmit a wireless signal including the first information / signal via the transceiver (106). In addition, the processor (102) may receive a wireless signal including second information / signal through the transceiver (106), and then store information obtained from signal processing of the second information / signal in the memory (104). The memory (104) may be connected to the processor (102) and may store various information related to the operation of the processor (102). For example, the memory (104) may perform some or all of the processes controlled by the processor (102), or may store software code including commands for performing the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. Here, the processor (102) and the memory (104) may be part of a communication modem / circuit / chip designed to implement a wireless communication technology (e.g., LTE, NR). The transceiver (106) may be connected to the processor (102) and may transmit and / or receive a wireless signal through one or more antennas (108). The transceiver (106) may include a transmitter and / or a receiver. The transceiver (106) may be used interchangeably with an RF (Radio Frequency) unit.In this specification, wireless device may also mean a communication modem / circuit / chip.

[0576] The processor (102) generates a plurality of transport blocks, divides each of the plurality of transport blocks to generate code blocks, performs zero padding on a group of code blocks included in different transport blocks among the plurality of transport blocks to generate alignment code blocks, performs encoding on the alignment code blocks to generate a parity code block, and transmits the plurality of transport blocks and the parity code block to a base station, wherein the alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

[0577] The specific operation has been described with reference to Figures 20 to 29.

[0578] A second wireless device (200) includes at least one processor (202), at least one memory (204), and may further include at least one transceiver (206) and / or at least one antenna (208). The processor (202) controls the memory (204) and / or the transceiver (206), and may be configured to implement the descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed in this document. For example, the processor (202) may process information in the memory (204) to generate third information / signal, and then transmit a wireless signal including the third information / signal via the transceiver (206). In addition, the processor (202) may receive a wireless signal including fourth information / signal via the transceiver (206), and then store information obtained from signal processing of the fourth information / signal in the memory (204). The memory (204) may be connected to the processor (202) and may store various information related to the operation of the processor (202). For example, the memory (204) may perform some or all of the processes controlled by the processor (202), or may store software code including commands for performing the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. Here, the processor (202) and the memory (204) may be part of a communication modem / circuit / chip designed to implement wireless communication technology (e.g., LTE, NR). The transceiver (206) may be connected to the processor (202) and may transmit and / or receive wireless signals via one or more antennas (208). The transceiver (206) may include a transmitter and / or a receiver. The transceiver (206) may be used interchangeably with an RF unit. In this specification, a wireless device may also mean a communication modem / circuit / chip.

[0579] The processor (202) generates a plurality of transport blocks, divides each of the plurality of transport blocks to generate code blocks, performs zero padding on a group of code blocks included in different transport blocks among the plurality of transport blocks to generate alignment code blocks, performs encoding on the alignment code blocks to generate a parity code block, and transmits the plurality of transport blocks and the parity code block to a terminal, wherein the alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

[0580] The specific operation has been described with reference to Figures 20 to 29.

[0581] Hereinafter, the hardware elements of the wireless device (100, 200) will be described in more detail. Although not limited thereto, one or more protocol layers may be implemented by one or more processors (102, 202). For example, one or more processors (102, 202) may implement one or more layers (e.g., functional layers such as PHY, MAC, RLC, PDCP, RRC, SDAP). One or more processors (102, 202) may generate one or more Protocol Data Units (PDUs) and / or one or more Service Data Units (SDUs) according to the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. One or more processors (102, 202) may generate messages, control information, data, or information according to the descriptions, functions, procedures, proposals, methods, and / or operation flowcharts disclosed in this document. One or more processors (102, 202) can generate signals (e.g., baseband signals) including PDUs, SDUs, messages, control information, data or information according to the functions, procedures, proposals and / or methods disclosed herein, and provide the signals to one or more transceivers (106, 206). One or more processors (102, 202) can receive signals (e.g., baseband signals) from one or more transceivers (106, 206) and obtain PDUs, SDUs, messages, control information, data or information according to the descriptions, functions, procedures, proposals, methods and / or operational flowcharts disclosed herein.

[0582] The one or more processors (102, 202) may be referred to as a controller, a microcontroller, a microprocessor, or a microcomputer. The one or more processors (102, 202) may be implemented by hardware, firmware, software, or a combination thereof. For example, one or more Application Specific Integrated Circuits (ASICs), one or more Digital Signal Processors (DSPs), one or more Digital Signal Processing Devices (DSPDs), one or more Programmable Logic Devices (PLDs), or one or more Field Programmable Gate Arrays (FPGAs) may be included in the one or more processors (102, 202). The one or more processors (102, 202) may also be implemented by at least one computer-readable medium (CRM) containing instructions based on which at least one processor is executed.

[0583] For example, at least one computer readable medium (CRM) including instructions based on being executed by at least one processor performs the following operations: generating a plurality of transport blocks, dividing each of the plurality of transport blocks to generate code blocks, performing zero padding on groups of code blocks included in different transport blocks among the plurality of transport blocks to generate alignment code blocks, performing encoding on the alignment code blocks to generate parity code blocks, and transmitting the plurality of transport blocks and the parity code blocks to a receiver, wherein the alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks. The specific operations have been described with reference to FIGS. 20 to 29.

[0584] The descriptions, functions, procedures, suggestions, methods and / or operation flowcharts disclosed in this document may be implemented using firmware or software, and the firmware or software may be implemented to include modules, procedures, functions, etc. The descriptions, functions, procedures, suggestions, methods and / or operation flowcharts disclosed in this document may be implemented using firmware or software in the form of codes, instructions and / or sets of instructions. The firmware or software configured to perform the descriptions, functions, procedures, suggestions, methods and / or operation flowcharts disclosed in this document may be included in one or more processors (102, 202) or stored in one or more memories (104, 204) and executed by one or more processors (102, 202). The descriptions, functions, procedures, suggestions, methods and / or operation flowcharts disclosed in this document may be implemented using firmware or software in the form of codes, instructions and / or sets of instructions.

[0585] One or more memories (104, 204) may be coupled to one or more processors (102, 202) and may store various forms of data, signals, messages, information, programs, codes, instructions, and / or commands. The one or more memories (104, 204) may be configured as ROM, RAM, EPROM, flash memory, hard drives, registers, cache memory, computer-readable storage media, and / or combinations thereof. The one or more memories (104, 204) may be located internally and / or externally to the one or more processors (102, 202). Additionally, the one or more memories (104, 204) may be coupled to the one or more processors (102, 202) via various technologies, such as wired or wireless connections.

[0586] One or more transceivers (106, 206) can transmit user data, control information, wireless signals / channels, etc., as mentioned in the methods and / or flowcharts of this document, to one or more other devices. One or more transceivers (106, 206) can receive user data, control information, wireless signals / channels, etc., as mentioned in the descriptions, functions, procedures, proposals, methods and / or flowcharts of this document, from one or more other devices. For example, one or more transceivers (106, 206) can be connected to one or more processors (102, 202) and can transmit and receive wireless signals. For example, one or more processors (102, 202) can control one or more transceivers (106, 206) to transmit user data, control information, or wireless signals to one or more other devices. Additionally, one or more processors (102, 202) may control one or more transceivers (106, 206) to receive user data, control information, or wireless signals from one or more other devices. Additionally, one or more transceivers (106, 206) may be coupled to one or more antennas (108, 208), and one or more transceivers (106, 206) may be configured to transmit and receive user data, control information, wireless signals / channels, or the like, as referred to in the descriptions, functions, procedures, proposals, methods, and / or operational flowcharts disclosed herein, via one or more antennas (108, 208). In this document, one or more antennas may be multiple physical antennas or multiple logical antennas (e.g., antenna ports). One or more transceivers (106, 206) can convert received user data, control information, 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 one or more processors (102, 202).One or more transceivers (106, 206) may convert user data, control information, wireless signals / channels, etc. processed by one or more processors (102, 202) from baseband signals to RF band signals. For this purpose, one or more transceivers (106, 206) may include an (analog) oscillator and / or filter.

[0587] Figure 31 illustrates another example of a wireless device.

[0588] According to FIG. 31, the wireless device may include at least one processor (102, 202), at least one memory (104, 204), at least one transceiver (106, 206), and one or more antennas (108, 208).

[0589] The difference between the example of the wireless device described in FIG. 30 and the example of the wireless device in FIG. 31 is that in FIG. 30, the processor (102, 202) and the memory (104, 204) are separated, whereas in the example of FIG. 31, the memory (104, 204) is included in the processor (102, 202). For example, the processor and the memory may constitute a single chipset.

[0590] Fig. 32 illustrates an example of a signal processing module structure. Here, signal processing may be performed in the processor (102, 202) of Fig. 30.

[0591] Referring to FIG. 32, a transmission device (e.g., a processor, a processor and a memory, or a processor and a transceiver) within a terminal or a base station may include a scrambler (301), a modulator (302), a layer mapper (303), an antenna port mapper (304), a resource block mapper (305), and a signal generator (306).

[0592] A transmitting device can transmit one or more codewords. The coded bits within each codeword are scrambled by a scrambler (301) and transmitted over a physical channel. A codeword may also be referred to as a data string and may be equivalent to a transport block, which is a data block provided by the MAC layer.

[0593] The scrambled bits are modulated into complex-valued modulation symbols by a modulator (302). The modulator (302) can modulate the scrambled bits according to a modulation scheme and arrange them into complex-valued modulation symbols that represent positions on a signal constellation. There is no limitation on the modulation scheme, and m-PSK (m-Phase Shift Keying) or m-QAM (m-Quadrature Amplitude Modulation) can be used to modulate the encoded data. The modulator may be referred to as a modulation mapper.

[0594] The complex modulation symbols may be mapped to one or more transmission layers by a layer mapper (303). The complex modulation symbols on each layer may be mapped by an antenna port mapper (304) for transmission on an antenna port.

[0595] The resource block mapper (305) can map the complex modulation symbol for each antenna port to an appropriate resource element within a virtual resource block (VRB) allocated for transmission. The resource block mapper can map the VRB to a physical resource block (PRB) according to an appropriate mapping scheme. The resource block mapper (305) can assign the complex modulation symbol for each antenna port to an appropriate subcarrier and multiplex it according to the user.

[0596] The signal generator (306) can generate a complex-valued time domain OFDM symbol signal by modulating a complex modulation symbol, for example, an antenna-specific symbol, for each antenna port, with a specific modulation method, for example, an Orthogonal Frequency Division Multiplexing (OFDM) method. The signal generator can perform an Inverse Fast Fourier Transform (IFFT) on the antenna-specific symbol, and a Cyclic Prefix (CP) can be inserted into the time domain symbol on which the IFFT is performed. The OFDM symbol is transmitted to a receiving device through each transmitting antenna through digital-to-analog conversion, frequency uplink conversion, etc. The signal generator can include an IFFT module, a CP inserter, a Digital-to-Analog Converter (DAC), a frequency uplink converter, etc.

[0597] Fig. 33 illustrates another example of a signal processing module structure within a transmission device. Here, signal processing may be performed in a processor of a terminal / base station, such as the processor (102, 202) of Fig. 30.

[0598] Referring to FIG. 33, a transmission device (e.g., a processor, a processor and a memory, or a processor and a transceiver) in a terminal or a base station may include a scrambler (401), a modulator (402), a layer mapper (403), a precoder (404), a resource block mapper (405), and a signal generator (406).

[0599] The transmitting device can transmit coded bits within a codeword through a physical channel after scrambling the coded bits within the codeword by a scrambler (401).

[0600] The scrambled bits are modulated into complex modulation symbols by a modulator (402). The modulator can modulate the scrambled bits according to a predetermined modulation scheme and arrange them into complex modulation symbols representing positions on a signal constellation. There is no limitation on the modulation scheme, and pi / 2-BPSK (pi / 2-Binary Phase Shift Keying), m-PSK (m-Phase Shift Keying), or m-QAM (m-Quadrature Amplitude Modulation) can be used to modulate the encoded data.

[0601] The above complex modulation symbol can be mapped to one or more transmission layers by the layer mapper (403).

[0602] The complex modulation symbols on each layer can be precoded by the precoder (404) for transmission on the antenna ports. Here, the precoder may perform the precoding after performing transform precoding on the complex modulation symbols. Alternatively, the precoder may perform the precoding without performing the transform precoding. The precoder (404) may process the complex modulation symbols in a MIMO manner according to multiple transmission antennas to output antenna-specific symbols and distribute the antenna-specific symbols to the corresponding resource block mapper (405). The output z of the precoder (404) can be obtained by multiplying the output y of the layer mapper (403) by the precoding matrix W of NХM. Here, N is the number of antenna ports and M is the number of layers.

[0603] The resource block mapper (405) maps the demodulation modulation symbol for each antenna port to the appropriate resource element within the virtual resource block allocated for transmission.

[0604] The resource block mapper (405) can assign complex modulation symbols to appropriate subcarriers and multiplex them according to the user.

[0605] The signal generator (406) can generate a complex-valued time domain OFDM (Orthogonal Frequency Division Multiplexing) symbol signal by modulating a complex modulation symbol with a specific modulation method, for example, OFDM. The signal generator (406) can perform an Inverse Fast Fourier Transform (IFFT) on an antenna-specific symbol, and a Cyclic Prefix (CP) can be inserted into the time domain symbol on which the IFFT has been performed. The OFDM symbol is transmitted to a receiving device through each transmitting antenna after going through digital-to-analog conversion, frequency upconversion, etc. The signal generator (406) can include an IFFT module, a CP inserter, a Digital-to-Analog Converter (DAC), a frequency uplink converter, etc.

[0606] The signal processing process of the receiving device may be configured in reverse order of the signal processing process of the transmitter. Specifically, the processor of the receiving device performs decoding and demodulation on a wireless signal received externally through the antenna port(s) of the transceiver. The receiving device may include a plurality of multiple receiving antennas, and each signal received through the receiving antenna is restored to a baseband signal and then multiplexed and MIMO demodulated to be restored to a data sequence originally intended to be transmitted by the transmitting device. The receiving device (1820) may include a signal restorer for restoring the received signal to a baseband signal, a multiplexer for combining and multiplexing the received and processed signals, and a channel demodulator for demodulating the multiplexed signal sequence into a corresponding codeword. The signal restorer, the multiplexer, and the channel demodulator may be configured as an integrated module performing their functions or as individual modules. More specifically, the signal restorer may include an analog-to-digital converter (ADC) that converts an analog signal into a digital signal, a CP remover that removes a CP from the digital signal, an FFT module that applies an FFT (fast Fourier transform) to a signal from which the CP has been removed to output a frequency domain symbol, and a resource element demapper / equalizer that restores the frequency domain symbol to an antenna-specific symbol. The antenna-specific symbol is restored to a transmission layer by a multiplexer, and the transmission layer is restored to a codeword that the transmitter intended to transmit by a channel demodulator.

[0607] FIG. 34 illustrates an example of a wireless communication device according to an implementation example of the present disclosure.

[0608] Referring to FIG. 34, a wireless communication device, for example, a terminal, may include at least one of a processor (2310) such as a digital signal processor (DSP) or a microprocessor, a transceiver (2335), a power management module (2305), an antenna (2340), a battery (2355), a display (2315), a keypad (2320), a global positioning system (GPS) chip (2360), a sensor (2365), a memory (2330), a subscriber identification module (SIM) card (2325), a speaker (2345), and a microphone (2350). There may be a plurality of antennas and processors.

[0609] The processor (2310) can implement the functions, procedures, and methods described in this specification. The processor (2310) of FIG. 34 may be the processor (102, 202) of FIG. 30.

[0610] Memory (2330) is connected to the processor (2310) and stores information related to the processor's operation. The memory may be located internally or externally to the processor and may be connected to the processor via various technologies, such as wired or wireless connections. The memory (2330) of FIG. 34 may be the memory (104, 204) of FIG. 30.

[0611] A user may input various types of information, such as a phone number, using various techniques, such as pressing buttons on a keypad (2320) or activating sound using a microphone (2350). The processor (2310) may receive and process the user's information and perform an appropriate function, such as dialing the entered phone number. In some scenarios, data may be retrieved from a SIM card (2325) or memory (2330) to perform the appropriate function. In some scenarios, the processor (2310) may display various types of information and data on a display (2315) for the user's convenience.

[0612] A transceiver (2335) is coupled to a processor (2310) and transmits and / or receives wireless signals, such as radio frequency (RF) signals. The processor may control the transceiver to initiate communication or transmit wireless signals containing various types of information or data, such as voice communication data. The transceiver includes a transmitter and a receiver for transmitting and receiving wireless signals. An antenna (2340) may facilitate the transmission and reception of wireless signals. In some implementations, upon receiving a wireless signal, the transceiver may forward and convert the signal to a baseband frequency for processing by the processor. The processed signal may be processed by various techniques, such as being converted into audible or readable information for output through a speaker (2345). The transceiver of FIG. 34 may be the transceiver (106, 206) of FIG. 30.

[0613] Although not shown in FIG. 34, various components, such as a camera and a Universal Serial Bus (USB) port, may be additionally included in the terminal. For example, the camera may be connected to the processor (2310).

[0614] Figure 34 is only one implementation example for a terminal, and the implementation examples are not limited thereto. The terminal does not necessarily have to include all the elements of Figure 34. For example, some components, such as a keypad (2320), a Global Positioning System (GPS) chip (2360), a sensor (2365), and a SIM card (2325), may not be essential elements, and in such cases, may not be included in the terminal.

[0615] Fig. 35 illustrates a communication system (1) applicable to this specification.

[0616] Referring to FIG. 35, a communication system (1) applied to the present specification includes a wireless device, a base station, and a network. Here, the wireless device refers to a device that performs communication using a wireless access technology (e.g., 5G NR (New RAT), LTE (Long Term Evolution)) and may be referred to as a communication / wireless / 5G device. Although not limited thereto, the wireless device may include a robot (100a), a vehicle (100b-1, 100b-2), an XR (eXtended Reality) device (100c), a hand-held device (100d), a home appliance (100e), an IoT (Internet of Things) device (100f), and an AI device / server (400). For example, the vehicle may include a vehicle equipped with a wireless communication function, an autonomous vehicle, a vehicle capable of performing vehicle-to-vehicle communication, etc. Here, the vehicle may include an Unmanned Aerial Vehicle (UAV) (e.g., a drone). XR devices include AR (Augmented Reality) / VR (Virtual Reality) / MR (Mixed Reality) devices, and can be implemented in the form of HMD (Head-Mounted Device), HUD (Head-Up Display) installed in a vehicle, television, smartphone, computer, wearable device, home appliance, digital signage, vehicle, robot, etc. Mobile devices can include smartphone, smart pad, wearable device (e.g., smart watch, smart glass), computer (e.g., laptop, etc.), etc. Home appliances can include TV, refrigerator, washing machine, etc. IoT devices can include sensors, smart meters, etc. For example, base stations and networks can also be implemented as wireless devices, and a specific wireless device (200a) can act as a base station / network node to other wireless devices.

[0617] Wireless devices (100a to 100f) can be connected to a network (300) via a base station (200). Artificial Intelligence (AI) technology can be applied to the wireless devices (100a to 100f), and the wireless devices (100a to 100f) can be connected to an AI server (400) via the network (300). The network (300) can be configured using a 3G network, a 4G (e.g., LTE) network, a 5G (e.g., NR) network, etc. The wireless devices (100a to 100f) can communicate with each other via the base station (200) / network (300), but can also communicate directly (e.g., sidelink communication) without going through the base station / network. For example, vehicles (100b-1, 100b-2) can communicate directly (e.g., V2V (Vehicle to Vehicle) / V2X (Vehicle to Everything) communication). In addition, IoT devices (e.g., sensors) can communicate directly with other IoT devices (e.g., sensors) or other wireless devices (100a to 100f).

[0618] Wireless communication / connection (150a, 150b, 150c) can be established between wireless devices (100a~100f) / base stations (200), and base stations (200) / base stations (200). Here, wireless communication / connection can be achieved through various wireless access technologies (e.g., 5G NR) such as uplink / downlink communication (150a), sidelink communication (150b) (or, D2D communication), and communication between base stations (150c) (e.g., relay, IAB (Integrated Access Backhaul). Through wireless communication / connection (150a, 150b, 150c), wireless devices and base stations / wireless devices, and base stations and base stations can transmit / receive wireless signals to each other. For example, wireless communication / connection (150a, 150b, 150c) can transmit / receive signals through various physical channels. To this end, at least some of various configuration information setting processes for transmitting / receiving wireless signals, various signal processing processes (e.g., channel encoding / decoding, modulation / demodulation, resource mapping / demapping, etc.), and resource allocation processes can be performed based on various proposals of the present specification.

[0619] Meanwhile, NR supports multiple numerologies (or subcarrier spacing (SCS)) to support various 5G services. For example, an SCS of 15 kHz supports a wide area in traditional cellular bands; an SCS of 30 kHz / 60 kHz supports dense urban areas, lower latency, and wider carrier bandwidth; and an SCS of 60 kHz or higher supports a bandwidth greater than 24.25 GHz to overcome phase noise.

[0620] The NR frequency band can be defined by two types of frequency ranges (FR1, FR2). The numerical values ​​of the frequency ranges can be changed, and for example, the frequency ranges of the two types (FR1, FR2) can be as shown in Table 10 below. For convenience of explanation, among the frequency ranges used in the NR system, FR1 can mean the "sub 6 GHz range", and FR2 can mean the "above 6 GHz range" and can be called millimeter wave (mmW).

[0621] [Table 10]

[0622]

[0623] As described above, the numerical value of the frequency range of the NR system can be changed. For example, FR1 may include a band from 410 MHz to 7125 MHz, as shown in Table 11 below. For example, FR1 may include a frequency band above 6 GHz (or 5850, 5900, 5925 MHz, etc.). For example, the frequency band above 6 GHz (or 5850, 5900, 5925 MHz, etc.) included within FR1 may include an unlicensed band. The unlicensed band may be used for various purposes, such as for vehicle communications (e.g., autonomous driving).

[0624] [Table 11]

[0625]

[0626] The claims set forth in this specification may be combined in various ways. For example, the technical features of the method claims of this specification may be combined and implemented as a device, and the technical features of the device claims of this specification may be combined and implemented as a method. Furthermore, the technical features of the method claims and the technical features of the device claims of this specification may be combined and implemented as a device, and the technical features of the method claims and the technical features of the device claims of this specification may be combined and implemented as a method.

Claims

1. In the method, The terminal generates multiple transport blocks, The terminal segments each of the plurality of transmission blocks to generate code blocks, The terminal performs zero padding on a group of code blocks included in different transmission blocks among the plurality of transmission blocks to generate aligned code blocks, The terminal performs encoding on the alignment code blocks to generate a parity code block, and The terminal transmits the plurality of transmission blocks and the parity code block to the base station, A method characterized in that the above alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

2. A method according to claim 1, wherein a first sorting code block included in the sorting code blocks includes z1 zero bits starting from the least significant bit (LSB), and a second code block included in the sorting code blocks includes z2 zero bits at bit positions that do not overlap with bit positions of the z1 zero bits, wherein z1 and z2 are each natural numbers.

3. A method according to claim 1, wherein a third code block included in the alignment code blocks includes z3 zero bits starting from the most significant bit (MSB), and a fourth code block included in the alignment code blocks includes z4 zero bits at bit positions that do not overlap with bit positions of the z3 zero bits, wherein z3 and z4 are each natural numbers.

4. A method according to claim 1, characterized in that the bit length is equal to the longest bit length among the bit lengths of the code blocks included in the group.

5. A method according to claim 1, characterized in that the bit length is equal to the longest bit length among the bit lengths of all code blocks included in the plurality of transmission blocks.

6. A method characterized in that, in the first paragraph, information indicating the bit length is received from the base station.

7. A method according to claim 1, characterized in that the bits of the parity code block corresponding to the bit positions of the zero-padded bits in the bit positions of the alignment code blocks are punctured.

8. A method characterized in that, in the first paragraph, zero padding is skipped in a code block having a bit length equal to the bit length of the sorted code blocks among the code blocks included in the group.

9. A method characterized in that, in the first paragraph, an error occurring in one of the code blocks included in the group is recovered based on the parity code block.

10. The terminal is, At least one transceiver; At least one memory; and At least one processor operably coupled with said at least one memory and said at least one transceiver, wherein said at least one memory comprises instructions that are executed by said at least one processor to perform operations, The above actions are, Generate multiple transport blocks, Each of the above plurality of transmission blocks is segmented to generate code blocks, Performing zero padding on a group of code blocks included in different transmission blocks among the plurality of transmission blocks to generate aligned code blocks, Encoding the above sorting code blocks to generate a parity code block, and Including transmitting the plurality of transmission blocks and the parity code block to the base station, A terminal characterized in that the above alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

11. A terminal according to claim 10, wherein a first sorting code block included in the sorting code blocks includes z1 zero bits starting from the least significant bit (LSB), and a second code block included in the sorting code blocks includes z2 zero bits at bit positions that do not overlap with bit positions of the z1 zero bits, wherein z1 and z2 are each natural numbers.

12. A terminal according to claim 10, wherein a third code block included in the alignment code blocks includes z3 zero bits starting from the most significant bit (MSB), and a fourth code block included in the alignment code blocks includes z4 zero bits at bit positions that do not overlap with bit positions of the z3 zero bits, wherein z3 and z4 are each natural numbers.

13. A terminal characterized in that in the 10th paragraph, the bit length is equal to the longest bit length among the bit lengths of the code blocks included in the group.

14. A terminal characterized in that in the 10th paragraph, the bit length is equal to the longest bit length among the bit lengths of all code blocks included in the plurality of transmission blocks.

15. A terminal characterized in that, in the 10th paragraph, information indicating the bit length is received from the base station.

16. A terminal characterized in that in the 10th paragraph, the bits of the parity code block corresponding to the bit positions of the zero-padded bits in the bit positions of the alignment code blocks are punctured.

17. A terminal characterized in that, in the 10th paragraph, zero padding is skipped in a code block having a bit length equal to the bit length of the sorting code blocks among the code blocks included in the group.

18. A terminal characterized in that, in the 10th paragraph, an error occurring in one of the code blocks included in the group is recovered based on the parity code block.

19. The device, At least one memory; and At least one processor operably coupled to at least one memory, wherein said at least one memory comprises instructions that are executed by said at least one processor to perform operations, The above actions are, Generate multiple transport blocks, Each of the above plurality of transmission blocks is segmented to generate code blocks, Performing zero padding on a group of code blocks included in different transmission blocks among the plurality of transmission blocks to generate aligned code blocks, Encoding the above sorting code blocks to generate a parity code block, and Including transmitting the plurality of transmission blocks and the parity code block to the base station, A device characterized in that the above alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

20. At least one computer readable medium (CRM) containing instructions based on being executed by at least one processor, The action of generating multiple transport blocks, An operation of segmenting each of the above plurality of transmission blocks to generate code blocks, An operation of generating aligned code blocks by performing zero padding on a group of code blocks included in different transmission blocks among the plurality of transmission blocks, An operation of generating a parity code block by performing encoding on the above sorting code blocks, and An operation of transmitting the plurality of transmission blocks and the parity code block to a base station is performed, A CRM characterized in that the above alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

21. In the method, The base station generates multiple transport blocks, The base station segments each of the plurality of transmission blocks to generate code blocks, The base station performs zero padding on a group of code blocks included in different transmission blocks among the plurality of transmission blocks to generate aligned code blocks, The base station performs encoding on the alignment code blocks to generate a parity code block, and The base station transmits the plurality of transmission blocks and the parity code block to the terminal, A method characterized in that the above alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

22. The base station, At least one transceiver; At least one memory; and At least one processor operably coupled with said at least one memory and said at least one transceiver, wherein said at least one memory comprises instructions that are executed by said at least one processor to perform operations, The above actions are, Generate multiple transport blocks, Each of the above plurality of transmission blocks is segmented to generate code blocks, Performing zero padding on a group of code blocks included in different transmission blocks among the plurality of transmission blocks to generate aligned code blocks, Encoding the above sorting code blocks to generate a parity code block, and Transmitting the above plurality of transmission blocks and the parity code block to the terminal, A base station characterized in that the above alignment code blocks have the same bit length through the zero padding, and the zero padding minimizes the overlap of positions of zero-padded bits in different alignment code blocks.

Images