KR20250046855A - Method and apparatus for dual coding in wireless communication system - Google Patents

Abstract

The present disclosure relates to a 6G communication system for achieving high data transmission speed and ultra-low latency after a 5G communication system.

Description

METHOD AND APPARATUS FOR DUAL CODING IN WIRELESS COMMUNICATION SYSTEM

The present disclosure relates to a method and device for coding data or a channel in a wireless communication system. More specifically, it relates to a method for double coding data in a physical layer.

Looking back at the development process over the generations of wireless communication, technologies have been developed primarily for human-targeted services such as voice, multimedia, and data. After the commercialization of the 5G (5th-generation) communication system, it is expected that connected devices, which are increasing explosively, will be connected to the communication network. Examples of objects connected to the network include vehicles, robots, drones, home appliances, displays, smart sensors installed in various infrastructures, construction equipment, and factory equipment. Mobile devices are expected to evolve into various form factors such as augmented reality glasses, virtual reality headsets, and holographic devices. In the 6G (6th-generation) era, efforts are being made to develop an improved 6G communication system in order to connect hundreds of billions of devices and objects and provide various services. For this reason, the 6G communication system is called a system beyond 5G.

The maximum transmission speed in the 6G communication system, which is expected to be realized around 2030, is tera (i.e., 1,000 giga) bps, and the wireless delay time is 100 microseconds (μsec). In other words, the transmission speed in the 6G communication system is 50 times faster than that of the 5G communication system, and the wireless delay time is reduced to one-tenth.

To achieve these high data rates and ultra-low latency, 6G communication systems are being considered for implementation in terahertz bands (e.g., from 95 gigahertz (95 GHz) to 3 terahertz (3 THz) bands). In the terahertz band, the importance of technologies that can guarantee signal reachability, i.e. coverage, is expected to increase due to more severe path loss and atmospheric absorption phenomena compared to the millimeter wave (mmWave) band introduced in 5G. Key technologies to ensure coverage include the development of new waveforms, beamforming, and multiple antenna transmission technologies such as massive multiple-input and multiple-output (massive MIMO), full dimensional MIMO (FD-MIMO), array antennas, and large scale antennas that are superior to OFDM (orthogonal frequency division multiplexing) in terms of coverage, as well as radio frequency (RF) components, antennas, and OFDM-based orthogonal frequency division multiplexing (RFDM). In addition, new technologies such as metamaterial-based lenses and antennas, high-dimensional spatial multiplexing using orbital angular momentum (OAM), and reconfigurable intelligent surfaces (RIS) are being discussed to improve the coverage of terahertz band signals.

In addition, in order to improve frequency efficiency and system network, 6G communication systems are being developed with full duplex technology that utilizes the same frequency resources for uplink and downlink at the same time, network technology that comprehensively utilizes satellites and HAPS (high-altitude platform stations), network structure innovation technology that supports mobile base stations and enables optimization and automation of network operation, dynamic spectrum sharing technology through collision avoidance based on spectrum usage prediction, AI-based communication technology that utilizes artificial intelligence (AI) from the design stage and internalizes end-to-end AI support functions to realize system optimization, and next-generation distributed computing technology that realizes services with complexity that exceeds the limits of terminal computing capabilities by utilizing ultra-high-performance communication and computing resources (mobile edge computing (MEC), cloud, etc.). In addition, efforts are being made to further strengthen connectivity between devices, further optimize networks, promote softwareization of network entities, and increase the openness of wireless communications by designing new protocols to be used in 6G communication systems, implementing hardware-based security environments, developing mechanisms for safe use of data, and developing technologies for maintaining privacy.

It is expected that the research and development of these 6G communication systems will enable a new level of hyper-connected experience through the hyper-connectivity of 6G communication systems that includes not only connections between things but also connections between people and things. Specifically, it is expected that 6G communication systems will enable the provision of services such as truly immersive extended reality (truly immersive XR), high-fidelity mobile holograms, and digital replicas. In addition, services such as remote surgery, industrial automation, and emergency response through enhanced security and reliability will be provided through 6G communication systems, which will be applied in various fields such as industry, medicine, automobiles, and home appliances.

The size of a transmission block forwarded through each layer may increase due to an increase in data or an increase or change in bandwidth, and thus the number of code blocks or code block groups may also increase. Accordingly, coding and decoding of data or channels may become more important for error detection or correction of data or code blocks at a receiving end, and an embodiment of the present disclosure provides a coding method that reduces overhead due to coding. An embodiment of the present disclosure provides a coding method that can improve communication efficiency.

In addition, resource efficiency and implementation complexity may become issues in cases such as PUSCH (physical uplink shared channel) repetition and PDCP (packet data convergence protocol) duplication. An embodiment of the present disclosure aims to provide a method for improving communication or resource efficiency in such cases.

The technical problems to be achieved in the present invention are not limited to the technical problems mentioned above, and other technical problems not mentioned will be clearly understood by a person having ordinary skill in the technical field to which the present invention belongs from the description below.

In order to solve the above problems, the present disclosure provides a channel coding method performed by a transmitting/receiving device of a wireless communication system, comprising: a step of attaching a CRC (cyclic redundancy check) code to a transport block for data transmission; a step of dividing the transport block to which the CRC code is attached into at least one code block; a step of performing first encoding on the at least one code block; and a step of performing second encoding on the at least one code block that has been first encoded, wherein the first encoding and the second encoding are performed in a physical layer.

In addition, the first encoding is characterized by a linear combination of at least one random coefficient and at least one code block.

In addition, it is characterized in that the size of the transmission block is determined by considering the first encoding.

In addition, the step of performing the second encoding is characterized by including the step of attaching a CRC code to at least one or more of the first encoded code blocks; and the step of performing the second encoding on at least one or more of the first encoded code blocks to which the CRC code is attached.

In addition, the first encoding is characterized in that it is performed on all or part of the at least one code block.

In addition, the transceiver is characterized by including at least one of a terminal and a base station.

In addition, the step of attaching the CRC code is characterized by including a step of selecting an LDCP (low density parity check) graph for determining a parameter related to a size of the transmission block; and a step of attaching the CRC code to the transmission block for the data transmission.

Additionally, the parameter is characterized in that it includes at least one of the number of the at least one code block, the number of the at least one first encoded code block, the code rate, or the parameter for the size of the transport block.

In addition, the first encoding is characterized by being RLNC (random linear network coding) and the second encoding is LDCP (low density parity check).

In order to solve the above problems, the present disclosure is characterized in that, in a transmitting/receiving device of a wireless communication system, a CRC (cyclic redundancy check) code is attached to a transport block for data transmission, the transport block to which the CRC code is attached is divided into at least one code block, first encoding is performed on the at least one code block, and second encoding is performed on the at least one code block that has been first encoded, and the first encoding and the second encoding are performed in a physical layer.

One embodiment of the present disclosure performs both the first and second encodings in the physical layer, so that a process such as exchanging necessary information related to inter-layer coding between the physical layer and the upper layer for error avoidance or additional coding may not be required. Accordingly, the time consumed by unnecessary processing can be reduced, and an additional data movement process between layers for coding or decoding can be omitted, so that there may be a procedural advantage in coding or decoding.

One embodiment of the present disclosure provides a coding method of linearly combining code blocks using random coefficients, which is a method exemplified as a first encoding in a physical layer, thereby enabling coding in a simple and non-complex manner compared to other coding techniques, thereby reducing the burden on the physical layer.

The effects obtainable from the present invention are not limited to the effects mentioned above, and other effects not mentioned will be clearly understood by those skilled in the art to which the present disclosure pertains from the description below.

FIG. 1 is a diagram illustrating a basic structure of a time-frequency domain in a wireless communication system according to an embodiment of the present disclosure.
FIG. 2 is a diagram illustrating a frame, subframe, and slot structure in a wireless communication system according to one embodiment.
FIG. 3 is a diagram illustrating a wireless protocol structure of a base station and a terminal in a single cell, carrier aggregation, and dual connectivity situation in a wireless communication system according to one embodiment.
FIGS. 4a and 4b are diagrams illustrating repeated transmission of a physical uplink shared channel (PUSCH) as an example to provide better coverage or reliability, etc. in a 5G or 6G communication system according to one embodiment.
FIG. 5 is a diagram illustrating PDCP (packet data convergence protocol) replication as an example for providing better coverage or reliability, etc. in a 5G or 6G communication system according to one embodiment.
FIG. 6 is a diagram illustrating Multi-TRP (multiple transmission and reception points) in relation to PUSCH repetition according to one embodiment.
FIG. 7 is a diagram illustrating LDPC (low density parity check) as a channel coding process performed at a physical (PHY) layer during data transmission according to one embodiment.
FIG. 8 is a diagram illustrating a graph in an LDPC graph selection process according to one embodiment.
FIG. 9 is a diagram illustrating an operation or technique for generating a coded packet in relation to a random linear network coding (RLNC) technique according to one embodiment.
FIG. 10 is a diagram illustrating part of the overall process for dual coding of a channel or data according to one embodiment.
FIG. 11 is a diagram illustrating a process of a physical layer according to a dual coding method according to one embodiment.
FIG. 12 is a diagram illustrating a transmission block multiplexing procedure according to an embodiment of the present invention, taking into account a coding process according to an embodiment of the present invention.
FIG. 13 is a diagram illustrating a process of attaching CRC and inserting filler bits to coded code blocks after a first encoding process according to one embodiment.
FIG. 14 is a diagram illustrating a process in which first encoding is performed on all code blocks when code block group HARQ (hybrid automatic repeat request) is not applied and when code block group HARQ is applied to illustrate a decoding process according to an embodiment.
FIG. 15 is a diagram illustrating a process in which first encoding is performed on some code blocks or some code block groups when code block group HARQ is applied to illustrate a decoding process according to one embodiment.
FIG. 16 is a diagram illustrating a process in which first encoding is performed on all code blocks when code block group HARQ is not applied to illustrate a decoding process in a CA, DC, or mTRP environment with multiple PDSCH according to one embodiment.
FIG. 17 is a diagram illustrating the structure of a terminal in a wireless communication system according to one embodiment.
FIG. 18 is a diagram illustrating the structure of a base station in a wireless communication system according to one embodiment.

Hereinafter, embodiments of the present disclosure will be described in detail with reference to the attached drawings.

In describing the embodiments, description of technical contents that are well known in the technical field to which the present disclosure belongs and are not directly related to the present disclosure will be omitted.

This is to convey the gist of the present disclosure more clearly without obscuring it by omitting unnecessary explanations.

For the same reason, some components in the attached drawings are exaggerated, omitted, or schematically illustrated. Also, the size of each component does not entirely reflect the actual size. The same or corresponding components in each drawing are given the same reference numbers.

The advantages and features of the present disclosure and the methods of achieving them will become apparent by reference to the embodiments described below in detail together with the accompanying drawings.

However, the present disclosure is not limited to the embodiments disclosed below and may be implemented in various different forms, and the present embodiments are provided only to complete the composition of the present disclosure and to fully inform a person having ordinary skill in the art to which the present disclosure belongs of the scope of the disclosure, and the present disclosure is defined only by the scope of the claims. Like reference numerals refer to like elements throughout the specification.

At this time, it will be understood that each block of the processing flow diagrams and combinations of the flow diagrams can be performed by computer program instructions. These computer program instructions can be loaded onto a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing equipment, so that the instructions executed by the processor of the computer or other programmable data processing equipment create a means for performing the functions described in the flow diagram block(s). These computer program instructions can also be stored in a computer-available or computer-readable memory that can be directed to a computer or other programmable data processing equipment for implementation in a specific manner, so that the instructions stored in the computer-available or computer-readable memory can also produce an article of manufacture that includes an instruction means for performing the functions described in the flow diagram block(s). Since the computer program instructions can also be installed on a computer or other programmable data processing apparatus, the instructions that cause a series of operational steps to be performed on the computer or other programmable data processing apparatus to produce a computer-executable process, thereby causing the computer or other programmable data processing apparatus to perform the steps for performing the functions described in the flowchart block(s), can also provide steps for performing the functions described in the flowchart block(s).

Additionally, each block may represent a module, segment, or portion of code that contains one or more executable instructions for performing a particular logical function(s). It should also be noted that in some alternative implementation examples, the functions mentioned in the blocks may occur out of order. For example, two blocks shown in succession may in fact be performed substantially concurrently, or the blocks may sometimes be performed in reverse order, depending on the functionality they perform.

Here, the term '~ part' used in the present embodiment means software or hardware components such as FPGA (field programmable gate array) or ASIC (application-specific integrated circuit), and the '~ part' performs certain roles. However, the '~ part' is not limited to software or hardware. The '~ part' may be configured to be in an addressable storage medium, and may be configured to reproduce one or more processors. Accordingly, as an example, the '~ part' includes components such as software components, object-oriented software components, class components, and task components, and processes, functions, properties, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables. The functions provided in the components and '~ parts' may be combined into a smaller number of components and '~ parts' or further separated into additional components and '~ parts'. In addition, the components and '~parts' may be implemented to play one or more central processing units (CPUs) within the device or secure multimedia card.

For the convenience of the following description, some of the terms and names defined in the 3rd generation partnership project (3GPP) standards (standards for 5G, NR, LTE or similar systems) may be used. In addition, terms and names newly defined in the next-generation communication system (e.g., 6G, Beyond 5G system) to which the present disclosure can be applied, or terms and names used in existing communication systems may be used. The use of these terms is not limited by the terms and names of the present disclosure, and may be equally applied to systems conforming to other standards, and may be changed into other forms without departing from the technical spirit of the present disclosure. Embodiments of the present disclosure may be easily modified and applied to other communication systems.

Additionally, it will be understood that singular expressions such as “a” and “the above” include plural expressions, unless the context clearly dictates otherwise in one embodiment of the present disclosure.

Additionally, in one embodiment of the present disclosure, the size with respect to blocks and the like may be expressed identically in length or size.

Also, in one embodiment of the present disclosure, terms including ordinal numbers such as first, second, etc. may be used to describe various components, but the components are not limited by the terms. The terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present disclosure, the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component.

Additionally, in one embodiment of the present disclosure, the term “and/or” includes a combination of a plurality of related described items or any item among a plurality of related described items.

In addition, the terminology used in the exemplary embodiments of the present disclosure is only used to describe specific embodiments and is not intended to limit the present disclosure. The singular expression includes the plural expression unless the context clearly indicates otherwise. In this specification, it should be understood that the terms "comprises" or "has" and the like are intended to specify that a feature, number, step, operation, component, part or combination thereof described in the specification is present, but do not exclude in advance the possibility of the presence or addition of one or more other features, numbers, steps, operations, components, parts or combinations thereof.

Additionally, the terms "associated with" and "associated therewith" and their derivatives used in the embodiments of the present disclosure can mean include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicated with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, and the like.

In addition, in the present disclosure, the expressions "more than" and "less than" are used to determine whether a specific condition is satisfied or fulfilled, but this is only a description for expressing an example and does not exclude descriptions of more than or less than. A condition described as "more than" may be replaced with "more than," a condition described as "less than" may be replaced with "less than," and a condition described as "more than and less than" may be replaced with "more than and less than."

In addition, although the present disclosure describes embodiments using terms used in some communication standards (e.g., long term evolution (LTE), new radio (NR) defined by 3rd generation partnership project (3GPP)), these are only examples for explanation. The embodiments of the present disclosure can be easily modified and applied to other communication systems.

Before going into a detailed description of the present disclosure, examples of possible interpretations of some terms used in this specification are provided. However, it should be noted that the interpretation examples provided below are not limited to these.

In the present disclosure, a terminal (or a communication terminal) is an entity that communicates with a base station or another terminal, and may be referred to as a node, a UE (user equipment), an NG UE (next generation UE), an MS (mobile station), a device, or a terminal. In addition, the terminal may include at least one of a smart phone, a tablet PC, a mobile phone, a video phone, an e-book reader, a desktop PC, a laptop PC, a netbook computer, a PDA, a PMP (portable multimedia player), an MP3 player, a medical device, a camera, or a wearable device. In addition, the terminal may include at least one of a television, a DVD (digital video disk) player, an audio player, a refrigerator, an air conditioner, a vacuum cleaner, an oven, a microwave oven, a washing machine, an air purifier, a set-top box, a home automation control panel, a security control panel, a media box, a game console, an electronic dictionary, an electronic key, a camcorder, or an electronic picture frame. In addition, the terminal may include at least one of various medical devices (e.g., various portable medical measuring devices (such as a blood sugar meter, a heart rate meter, a blood pressure meter, or a body temperature meter), magnetic resonance angiography (MRA), magnetic resonance imaging (MRI), computed tomography (CT), a camera, or an ultrasound machine), a navigation device, a global navigation satellite system (GNSS), an event data recorder (EDR), a flight data recorder (FDR), an automobile infotainment device, electronic equipment for ships (e.g., a navigation device for ships, a gyrocompass, etc.), avionics, a security device, a head unit for vehicles, an industrial or household robot, a drone, an ATM of a financial institution, a POS (point of sales) of a store, or an Internet of Things device (e.g., a light bulb, various sensors, a sprinkler device, a fire alarm, a thermostat, a streetlight, a toaster, exercise equipment, a hot water tank, a heater, a boiler, etc.). In addition, the terminal may include various types of multimedia systems capable of performing communication functions. Meanwhile, the present disclosure is not limited to the above, and the terminal may also be referred to by terms having the same or similar meaning.

In addition, in the present disclosure, the base station is an entity that communicates with a terminal and performs resource allocation of the terminal, and may have various forms and may be referred to as a BS (base station), a NodeB (NB), an NG RAN (next generation radio access network), an AP (access point), a TRP (transmission reception point), a wireless access unit, a base station controller, or a node on a network. Or, it may be referred to as a CU (central unit) or a DU (distributed unit) depending on functional separation. Meanwhile, the present disclosure is not limited thereto, and the base station may be referred to by a term having the same or similar meaning thereto.

Additionally, in the present disclosure, a radio resource control (RRC) message may be referred to as a higher level information, a higher level message, a higher level signal, a higher level signaling, a higher layer signaling, or a higher layer signaling, and the present disclosure is not limited thereto, and may also be referred to by terms having the same or similar meaning.

Additionally, in the present disclosure, data may be referred to as user data, UP (user plane) data, or application data, or may be referred to by terms having the same or similar meaning as signals transmitted and received via DRB (data radio bearer).

In addition, in the present disclosure, the direction of data transmitted from a terminal may be referred to as uplink (UL), and the direction of data transmitted to the terminal may be referred to as downlink (DL). Accordingly, in the case of uplink transmission, a transmitter may refer to a terminal, and a receiver may refer to a base station or a specific network entity of a communication system. Alternatively, in the case of downlink transmission, a transmitter may refer to a base station or a specific network entity of a communication system, and a receiver may refer to a terminal.

Below, the frame structure of the 5G system is described in more detail with reference to the drawings.

Figure 1 is a diagram illustrating the basic structure of the time-frequency domain, which is a radio resource domain in which data or control channels are transmitted in a 5G system.

The horizontal axis of Fig. 1 represents the time domain, and the vertical axis represents the frequency domain. The basic unit of resources in the time and frequency domains is a resource element (RE, 101), which can be defined as 1 OFDM (orthogonal frequency division multiplexing) symbol (102) in the time axis and 1 subcarrier (103) in the frequency axis. In the frequency domain (For example, 12) consecutive REs can form one resource block (RB, 104).

FIG. 2 is a diagram illustrating a frame, subframe, and slot structure in a wireless communication system according to one embodiment.

FIG. 2 illustrates an example of a structure of a frame (frame, 200), a subframe (subframe, 201), and a slot (slot, 202). One frame (200) can be defined as 10 ms. One subframe (201) can be defined as 1 ms, and therefore one frame (200) can be composed of a total of 10 subframes (201). One slot (202, 203) can be defined as 14 OFDM symbols (i.e., the number of symbols per slot ( =14). 1 subframe (201) may be composed of one or more slots (202, 203), and the number of slots (202, 203) per 1 subframe (201) may vary depending on the setting value μ (204, 205) for the subcarrier spacing. In an example of FIG. 2, the cases where the subcarrier spacing setting value μ = 0 (204) and μ = 1 (205) are illustrated. When μ = 0 (204), 1 subframe (201) may be composed of one slot (202), and when μ = 1 (205), 1 subframe (201) may be composed of two slots (203). That is, depending on the setting value μ for the subcarrier spacing, the number of slots ( ) may vary, and accordingly the number of slots per frame ( ) may vary. Depending on the subcarrier spacing setting μ and can be defined as shown in [Table 1] below.

μ 0 14 10 1 1 14 20 2 2 14 40 4 3 14 80 8 4 14 160 16 5 14 320 32

Below, the rate matching operation and the puncturing operation are described in detail.

When a time and frequency resource A, through which an arbitrary symbol sequence A is to be transmitted, overlaps with an arbitrary time and frequency resource B, a rate matching or puncturing operation may be considered for transmission and reception operations of channel A that considers resource C in the area where resources A and B overlap. The specific operations may follow the contents below.

Rate matching operation

The base station can map and transmit channel A only for the remaining resource areas excluding resource C corresponding to the overlapping area with resource B among the entire resources A that want to transmit symbol sequence A to the terminal. For example, if symbol sequence A is composed of {symbol #1, symbol #2, symbol #3, symbol #4}, and resource A is {resource #1, resource #2, resource #3, resource #4} and resource B is {resource #3, resource #5}, the base station can sequentially map and transmit symbol sequence A to {resource #1, resource #2, resource #4}, which are the remaining resources among resource A excluding {resource #3} corresponding to resource C. As a result, the base station can transmit symbol sequences {symbol #1, symbol #2, symbol #3} by mapping them to {resource #1, resource #2, resource #4}, respectively.

The terminal can determine resources A and resources B from scheduling information for symbol sequence A from the base station, and can thereby determine resource C, which is an area where resources A and resources B overlap. The terminal can assume that symbol sequence A is mapped and transmitted in the remaining area of the entire resource A except for resource C, and can receive symbol sequence A. For example, if symbol sequence A is composed of {symbol #1, symbol #2, symbol #3, symbol #4}, and resource A is {resource #1, resource #2, resource #3, resource #4}, and resource B is {resource #3, resource #5}, the terminal can assume that symbol sequence A is sequentially mapped to {resource #1, resource #2, resource #4}, which are the remaining resources among resource A except for {resource #3} corresponding to resource C, and can receive it. As a result, the terminal can assume that symbol sequences {symbol #1, symbol #2, symbol #3} are mapped and transmitted to {resource #1, resource #2, resource #4}, respectively, and perform a series of subsequent reception operations.

puncturing action

If a base station wants to transmit symbol sequence A to a terminal, and there is a resource C corresponding to an area overlapping with resource B among the entire resources A, the base station maps symbol sequence A to the entire resource A, but does not perform transmission in the resource area corresponding to resource C, and can perform transmission only for the remaining resource areas of resource A excluding resource C. For example, if symbol sequence A is composed of {Symbol #1, Symbol #2, Symbol #3, Symbol #4}, and resource A is {Resource #1, Resource #2, Resource #3, Resource #4}, and resource B is {Resource #3, Resource #5}, the base station can map symbol sequence A {Symbol #1, Symbol #2, Symbol #3, Symbol #4} to resource A {Resource #1, Resource #2, Resource #3, Resource #4}, respectively, and transmit only symbol sequences {Symbol #1, Symbol #2, Symbol #4} corresponding to the remaining resources {Resource #1, Resource #2, Resource #4} excluding {Resource #3} corresponding to resource C among resources A, and may not transmit {Symbol #3} mapped to {Resource #3} corresponding to resource C. As a result, the base station can transmit symbol sequences {Symbol #1, Symbol #2, Symbol #4} by mapping them to {Resource #1, Resource #2, Resource #4}, respectively.

The terminal can determine resources A and B from scheduling information for symbol sequence A from the base station, and through this, determine resource C, which is an area where resources A and B overlap. The terminal can receive symbol sequence A assuming that symbol sequence A is mapped to the entire resource A, but is transmitted only in the remaining area of resource area A excluding resource C. For example, if symbol sequence A is composed of {Symbol #1, Symbol #2, Symbol #3, Symbol #4}, resource A is {Resource #1, Resource #2, Resource #3, Resource #4}, and resource B is {Resource #3, Resource #5}, the terminal can assume that symbol sequence A {Symbol #1, Symbol #2, Symbol #3, Symbol #4} is mapped to resource A {Resource #1, Resource #2, Resource #3, Resource #4} respectively, but {Symbol #3} mapped to {Resource #3} corresponding to resource C is not transmitted, and can receive the terminal assuming that symbol sequence {Symbol #1, Symbol #2, Symbol #4} corresponding to {Resource #1, Resource #2, Resource #4}, which are the remaining resources among resource A except {Resource #3} corresponding to resource C, are mapped and transmitted. As a result, the terminal can assume that the symbol sequence {symbol #1, symbol #2, symbol #4} is transmitted by being mapped to {resource #1, resource #2, resource #4}, respectively, and perform a series of subsequent receiving operations.

FIG. 3 is a diagram illustrating a wireless protocol structure of a base station and a terminal in a single cell, carrier aggregation, and dual connectivity situation according to one embodiment.

Referring to FIG. 3, the wireless protocol of the next-generation mobile communication system consists of NR SDAP (service data adaptation protocol S25, S70), NR PDCP (packet data convergence protocol S30, S65), NR RLC (radio link control S35, S60), and NR MAC (medium access control S40, S55) in the terminal and NR base station, respectively.

Key features of NR SDAP (S25, S70) may include some of the following:

- Transfer of user plane data

- Mapping between a QoS flow and a DRB for both DL and UL

- Marking QoS flow ID in both DL and UL packets

- Ability to map reflective QoS flow to data bearer for the UL SDAP PDUs (reflective QoS flow to DRB mapping for the UL SDAP PDUs).

For the above SDAP layer device, the terminal can be configured by an RRC message for each PDCP layer device, by bearer, or by logical channel, whether to use the header of the SDAP layer device or whether to use the function of the SDAP layer device, and if the SDAP header is configured, the terminal can instruct the NAS QoS reflection configuration 1-bit indicator (NAS reflective QoS) and the AS QoS reflection configuration 1-bit indicator (AS reflective QoS) of the SDAP header to update or reset the mapping information for the QoS flow and data bearer of the uplink and downlink. The SDAP header can include QoS flow ID information indicating QoS. The QoS information can be used as data processing priority, scheduling information, etc. to support a desired service.

The main functions of NR PDCP (S30, S65) may include some of the following functions:

- Header compression and decompression (ROHC only)

- Transfer of user data function

- In-sequence delivery of upper layer PDUs

- Out-of-sequence delivery of upper layer PDUs

- Reordering function (PDCP PDU reordering for reception)

- Duplicate detection of lower layer SDUs

- Retransmission function (retransmission of PDCP SDUs)

- Encryption and deciphering functions (ciphering and deciphering)

- Timer-based SDU discard in uplink.

The reordering function of the NR PDCP device above refers to a function of reordering PDCP PDUs received from a lower layer in order based on a PDCP SN (sequence number), and may include a function of transmitting data to an upper layer in the reordered order. Alternatively, the reordering function of the NR PDCP device may include a function of directly transmitting data without considering the order, a function of recording lost PDCP PDUs by reordering the order, a function of reporting a status of lost PDCP PDUs to the transmitting side, and a function of requesting retransmission of lost PDCP PDUs.

The main functions of NR RLC (S35, S60) may include some of the following functions:

- Data transfer function (transfer of upper layer PDUs)

- In-sequence delivery of upper layer PDUs

- Out-of-sequence delivery of upper layer PDUs

- ARQ function (error correction through ARQ)

- Concatenation, segmentation and reassembly of RLC SDUs

- Re-segmentation of RLC data PDUs

- Reordering of RLC data PDUs

- Duplicate detection function

- Error detection function (protocol error detection)

- RLC SDU discard function

- RLC re-establishment function

In the above, the in-sequence delivery function of the NR RLC device means the function of sequentially delivering RLC SDUs received from a lower layer to an upper layer. The in-sequence delivery function of the NR RLC device may include a function of reassembling and delivering a single RLC SDU that is originally divided into multiple RLC SDUs and received, a function of reordering received RLC PDUs based on an RLC SN (sequence number) or a PDCP SN (sequence number), a function of recording lost RLC PDUs by rearranging the order, a function of reporting a status of lost RLC PDUs to the transmitting side, and a function of requesting retransmission of lost RLC PDUs. The in-sequence delivery function of the NR RLC device may include a function to sequentially deliver to the upper layer only the RLC SDUs up to the lost RLC SDU if there is a lost RLC SDU, or may include a function to sequentially deliver to the upper layer all RLC SDUs received before the timer starts if a predetermined timer has expired even if there is a lost RLC SDU. Alternatively, the in-sequence delivery function of the NR RLC device may include a function to sequentially deliver to the upper layer all RLC SDUs received up to the present if a predetermined timer has expired even if there is a lost RLC SDU. In addition, the RLC PDUs may be processed in the order they are received (in the order of arrival, regardless of the order of the sequence number) and delivered to the PDCP device regardless of the order (out-of sequence delivery), or in the case of segments, the segments stored in the buffer or to be received later may be received, reconstructed into a single complete RLC PDU, processed, and delivered to the PDCP device. The above NR RLC layer may not include a concatenation function and the function may be performed in the NR MAC layer or replaced with a multiplexing function of the NR MAC layer.

The out-of-sequence delivery function of the NR RLC device mentioned above refers to the function of directly delivering RLC SDUs received from a lower layer to an upper layer regardless of the order, and may include a function of reassembling and delivering multiple RLC SDUs when an original RLC SDU is received divided into multiple RLC SDUs, and may include a function of storing and arranging the RLC SN or PDCP SN of received RLC PDUs to record lost RLC PDUs.

NR MAC (S40, S55) can be connected to multiple NR RLC layer devices configured in one terminal, and the main functions of NR MAC can include some of the following functions.

- Mapping function (mapping between logical channels and transport channels)

- Multiplexing/demultiplexing of MAC SDUs

- Scheduling information reporting function

- HARQ function (error correction through HARQ)

- Priority handling between logical channels of one UE

- Priority handling between UEs by means of dynamic scheduling

- MBMS service identification function

- Transport format selection function

-Padding function

The NR PHY layer (S45, S50) can perform operations of channel coding and modulating upper layer data, converting it into OFDM symbols and transmitting it over a wireless channel, or demodulating and channel decoding OFDM symbols received over a wireless channel and transmitting them to a higher layer.

The above wireless protocol structure can have various detailed structures changed depending on the carrier (or cell) operation method. For example, if a base station transmits data to a terminal based on a single carrier (or cell), the base station and the terminal use a protocol structure having a single structure for each layer, such as S00. On the other hand, if the base station transmits data to a terminal based on CA (carrier aggregation) that uses multiple carriers in a single TRP, the base station and the terminal use a protocol structure that has a single structure up to RLC, but multiplexes the PHY layer through the MAC layer, such as S10. As another example, if the base station transmits data to a terminal based on DC (dual connectivity) that uses multiple carriers in multiple TRPs, the base station and the terminal use a protocol structure that has a single structure up to RLC, but multiplexes the PHY layer through the MAC layer, such as S20.

In the following, the present disclosure explains the above examples through a number of embodiments, but these are not independent and one or more embodiments may be applied simultaneously or in combination.

Hereinafter, embodiments of the present disclosure will be described in detail with reference to the attached drawings. Hereinafter, a base station is a subject that performs resource allocation of a terminal, and may be at least one of a gNode B, a gNB, an eNode B, a Node B, a BS (Base Station), a wireless access unit, a base station controller, or a node on a network. The terminal may include a UE (user equipment), an MS (mobile station), a cellular phone, a smartphone, a computer, or a multimedia system capable of performing a communication function. Hereinafter, embodiments of the present disclosure will be described using a 5G system as an example, but embodiments of the present disclosure may be applied to other communication systems having similar technical backgrounds or channel types. For example, LTE or LTE-A mobile communication and mobile communication technologies developed after 5G may be included here. Therefore, embodiments of the present disclosure may be applied to other communication systems with some modifications without significantly departing from the scope of the present disclosure as judged by a person skilled in the art. The contents of the present disclosure can be applied to FDD and TDD systems.

In addition, when describing the present disclosure, if it is judged that a specific description of a related function or configuration may unnecessarily obscure the gist of the present disclosure, the detailed description will be omitted. In addition, the terms described below are terms defined in consideration of the functions in the present disclosure, and these may vary depending on the intention or custom of the user or operator. Therefore, the definitions should be made based on the contents throughout this specification.

In describing the present disclosure below, upper layer signaling may be signaling corresponding to at least one or a combination of one or more of the following signaling.

- MIB (master information block)

- SIB (system information block) or SIB

- RRC (radio resource control)

- MAC (medium access control) CE (control element)

In addition, L1 signaling may be signaling corresponding to at least one or a combination of one or more of the following physical layer channels or signaling methods.

- PDCCH (physical downlink control channel)

- DCI (downlink control information)

- UE-specific DCI

- Group common DCI

- Common DCI

- Scheduling DCI (DCI used for scheduling downlink or uplink data, for example)

- Non-scheduled DCI (e.g. DCI not intended for scheduling downlink or uplink data)

- PUCCH (physical uplink control channel)

- UCI (uplink control information)

In the present disclosure below, determining the priority between A and B can be referred to in various ways, such as selecting a higher priority according to a predetermined priority rule and performing an action corresponding to it, or omitting or dropping an action for a lower priority.

In the following, the present disclosure explains the above examples through a number of embodiments, but these are not independent and one or more embodiments may be applied simultaneously or in combination.

FIGS. 4a and 4b are diagrams illustrating repeated transmission of a physical uplink shared channel (PUSCH) as an example to provide better coverage or reliability, etc. in a 5G or 6G communication system according to one embodiment.

Fig. 4a illustrates an exemplary embodiment of PUSCH repetition type A, in which a PUSCH is repeatedly transmitted in each slot. According to this method, the reliability of data transmission can be secured even when some data is lost due to repeated transmission of the same PUSCH.

FIG. 4b illustrates an example of an embodiment of PUSCH repetition type B, which illustrates transmitting a PUSCH repeatedly one or more times within one slot.

FIG. 5 is a diagram illustrating PDCP (packet data convergence protocol) replication as an example for providing better coverage or reliability, etc. in a 5G or 6G communication system according to one embodiment.

According to FIG. 5, a PDCP PDU (protocol data unit) generated in a PDCP layer can be transmitted or forwarded to at least one RLC (radio link control) entity or layer. Specifically, it can correspond to CA (carrier aggregation) (in case of the same MAC entity) or DC (dual connectivity) (in case of different MAC entities) replication. Through this, the reliability of data transmission can be improved and frequency diversity can be obtained. FIG. 5 exemplifies a structure in which data, etc. replicated to two RLCs (primary, secondary) are forwarded and then forwarded to two LCHs (logical channels).

FIG. 6 is a diagram illustrating Multi-TRP (multiple transmission and reception points) in relation to PUSCH repetition according to one embodiment.

According to FIG. 6, a process in which two TRPs receive the same data from a terminal is illustrated. The terminal can transmit a PUSCH containing data to TRP A using a beam corresponding to TRP A, and the terminal can transmit a PUSCH containing the same data to TRP B using a beam corresponding to TRP B. In this case, the reliability of uplink data transmission of the terminal can be increased. This can also be applied to different TRPs A and TRP B transmitting the same downlink data to the terminal.

FIG. 7 is a diagram exemplifying LDPC (low density parity check) as a channel coding process performed at a physical (PHY) layer during data transmission according to an embodiment. FIG. 8 is a diagram exemplifying a graph in an LDPC graph selection process according to an embodiment.

With respect to FIG. 7, according to one embodiment, a series of processes (700) for processing a transmission block in a physical layer are illustrated, and the example may correspond to a part of a PDSCH transmission process or a PUSCH transmission process. In addition, specific contents of the process or process related to FIG. 7 or examples of calculation processes may be referred to from section 5 onwards in 3GPP TS document 38.212.

According to one embodiment of the present disclosure, a transport block (TB) (710) may correspond to a transport block received from a higher layer of a physical layer, and the upper layer may be exemplified by a medium access control (MAC) layer.

And at step 720, a CRC (cyclic redundancy check) attachment process for error detection can be performed on the transmission block coming down from the upper layer.

In step 730, after the CRC attachment process of step 720, an LDPC graph selection process (LDPC base graph selection) can be performed.

The above LDPC graph selection process may include a step for determining the size or length of a transmission block and a code rate, and as illustrated in FIG. 8, the LDPC graph may be divided into a specific range of LDPC base graph 1 or LDPC base graph 2. The above selection process may be performed by considering various factors related to a communication system, and may generally be determined by considering performance and complexity, etc.

At step 740, a code block (CB) segmentation operation may be performed on a transport block or a transport block with a CRC attached.

According to one embodiment, the code block division step may be performed in a 5G or 6G communication system, and may be exemplified as a process for dividing a data unit called a transmission block into a code block group (CBG) composed of multiple code blocks for transmission for communication efficiency, taking into consideration the size of the data.

In one embodiment, code block splitting may refer to the process of dividing a transmission block into smaller code blocks.

According to one embodiment, the size or length of a code block may always be constant regardless of the number of code blocks, and the size or length may correspond to a unit of bits.

According to an embodiment, the sizes of the code blocks may all be the same, and for this purpose, specific bits called null bits or filler bits may be added to each code block. The null bits or filler bits usually correspond to a value of 0, but are not necessarily limited to this, and may be configured with any specific bits determined in advance. If the values are 0, it may be called zero-padding.

According to one embodiment, the size or length of the code block may correspond to a pre-determined value and may be dynamically allocated or indicated.

According to one embodiment, the unit or length of the code block group may be constant or variable.

At step 740, a code block CRC attachment operation can be performed together with the above code block division operation.

In one embodiment, the code block CRC attachment step may be exemplified as a step of attaching a CRC to all or part of each of a plurality of code blocks.

In step 750, a channel coding process can be performed. In a general communication system, in order to correct errors occurring in the channel at the receiver, information sent from the transmitter can be encoded or coded using a forward error correction code and then transmitted. At the receiver, the transmission information can be restored after demodulating the received signal and then decoding or decoding the error correction code. In this decoding process, errors in the received signal caused by the channel can be corrected.

According to one embodiment, the channel coding process can be performed by an LDPC scheme. The LDPC scheme can be exemplified as an error correction coding scheme.

According to one embodiment, in the LDPC scheme, lifting may not only be used for the efficient design of an LDPC code, but may also mean a method for generating parity check matrices of various lengths or generating an LDPC codeword using given base matrices and exponent matrices. That is, the lifting may be applied to efficiently design a very large parity check matrix by setting a Z value, which determines the size of a cyclic permutation matrix or a 0-matrix from a given small parent matrix, according to a specific rule, or may mean a method for generating parity check matrices of various lengths or generating an LDPC codeword by applying an appropriate Z value to a given exponent matrix or a sequence corresponding thereto.

The following [Table 2] may correspond to a table that can be used to set the lifting size Z in the LDPC process.

Set index ( ) Set of lifting sizes ( ) 0 {2, 4, 8, 16, 32, 64, 128, 256} 1 {3, 6, 12, 24, 48, 96, 192, 384} 2 {5, 10, 20, 40, 80, 160, 320} 3 {7, 14, 28, 56, 112, 224} 4 {9, 18, 36, 72, 144, 288} 5 {11, 22, 44, 88, 176, 352} 6 {13, 26, 52, 104, 208} 7 {15, 30, 60, 120, 240}

In new communication systems, including 6G systems, the existing set of lifting sizes may be maintained to support backward compatibility with existing systems (e.g., 5G systems), or a new set of lifting sizes may be added.

At step 760, a rate matching process can be performed.

The above rate matching may mean that the size of a signal is adjusted in consideration of the amount of resources that can transmit the signal. For example, rate matching of a data channel may mean that the size of data is adjusted accordingly without mapping and transmitting the data channel for a specific time and frequency resource area.

At step 770, a code block concatenation process can be performed.

In one embodiment, the code block concatenation process may be a step of combining multiple code blocks generated in a previous processing step into a data stream.

According to one embodiment, the code block connections may be performed in a specific order.

At step 780, a scrambling process can be performed.

In one embodiment, the scrambling may be a step for introducing randomness into the transmitted data to ensure uniform power distribution, interference management, data privacy, and accurate channel estimation.

In one embodiment, the scrambling and descrambling operations may be performed at the transmitter and the receiver respectively using the same cell-specific scrambling sequence.

FIG. 9 is a diagram illustrating an operation or technique for generating a coded packet in relation to a random linear network coding (RLNC) technique according to one embodiment.

The RLNC technique can be exemplified as a network coding technique. Network coding can be an information theory-based method for improving the efficiency of network traffic. In traditional networks, data packets are routed from a source to a destination, but in network coding, packets from multiple sources can be linearly combined and transmitted at a specific intermediate node.

In one embodiment, the RLNC technique may correspond to a random linear network coding technique that combines packets by randomly selecting coefficients from a finite field having a specific size.

For example, RLNC could correspond to a technique that linearly combines packets using randomly selected coefficients at every node encoding the packet.

In Fig. 9, the coding coefficient (A) according to one embodiment may correspond to a randomly selected coding coefficient (910).

In FIG. 9, the original packets (X) according to one embodiment may correspond to data packets on which RLNC or other coding processes are to be performed as existing packets (920).

According to one embodiment related to FIG. 9, the coding coefficients may be selected or configured as coding coefficients up to akn, such as a11, a12, a13, ..., a1n and a21, a31, ..., ak1, and the configuration may be configured in the form of a matrix.

Each coding coefficient (e.g., a11, a12, a21, ...) may correspond to having the same number of bits (e.g., m bits) and thus having the same size or length. In addition, the length of the entire coding coefficient may correspond to n*m bits.

According to one embodiment related to FIG. 9, an existing packet can be selected or configured with sub-packets such as x11, x12, x13, ..., x1n and x21, x31, ..., xk1 up to xkn, and the configuration can be configured in the form of a matrix.

In one embodiment, the existing packet can be applied by replacing it with a transport block (TB).

According to one embodiment, the transport block may correspond to a transport block in a processing process for transmission of a PDSCH or PUSCH in a physical layer.

According to one embodiment, the RLNC technique related to FIG. 9 can be applied to a transport block in the physical layer.

In one embodiment, each existing packet (e.g., x11, x12, x21, ...) may correspond to having the same number of bits (e.g., m bits) and thus having the same size or length. Additionally, the length of the entire existing packet may correspond to q*m bits.

According to an embodiment related to FIG. 9, the length of each coding coefficient (e.g., a11, a12, a21, ...) and subpacket (e.g., x11, x12, x21, ...) can be configured to be identically m bits.

In FIG. 9, encoded packets (Y) (930) according to one embodiment may correspond to a linear combination of coding coefficients (910) and existing packets (920).

According to one embodiment, the encoded packet may correspond to the matrix product of matrix A and matrix X, and with respect to one embodiment with respect to FIG. 9, the length of the encoded packet may correspond to q*m bits.

According to an embodiment, a Galois Field (GF) can be used for efficient operation in implementing RLNC.

In an embodiment, packets in RLNC can be viewed as vectors over a finite field (specifically, GF(2 ^m )), and addition and multiplication operations over this field can be used when linearly combining packets.

According to an embodiment, in RLNC, the coding coefficients a _uv ( and ) can be selected within a Galois Field of size 2 ^m , and all subpackets can have the same length or size.

To perform the LDPC technique related to Fig. 7, all code blocks may be required to have the same bit length.

To perform the RLNC technique related to Fig. 9, the length of all subpackets may be required to be the same bit length.

The present invention, taking into account the fact that all of the above requirements require the same bit length, can initiate a process of inferring or applying the RLNC technique corresponding to the existing network coding technique discussed or explained as an example above to be performed in a layer where LDPC is formed.

According to one embodiment, the above method of inferring or applying may be applied in part or in whole during the existing RLNC coding steps.

FIG. 10 is a diagram illustrating part of the overall process for dual coding of a channel or data according to one embodiment.

In Fig. 10, certain procedures or detailed processes may be omitted and expressed to explain a related example.

In Fig. 10, process A (1010) may be exemplified as a coding process of NR or other communication systems. In addition, process A (1010) may be exemplified as an encoding or coding process performed once in a specific layer.

According to one embodiment, a transport block (1011) that has completed multiplexing in an upper layer may be transmitted or forwarded to a specific lower layer. The specific lower layer may be exemplified as a physical layer.

According to one embodiment, a transmission block (1011) in which multiplexing is completed may be divided into at least one code block (1012) through a code block division process.

According to one embodiment, a CRC attachment process, etc. may be performed before a code block division process is performed on a transmission block (1011) for which multiplexing has been completed.

The size or length of each of the above code blocks (1012) may always be constant, and the size or length may correspond to a bit unit.

According to one embodiment, the code blocks (1012) may undergo an encoding process. The encoding process may be exemplified as a coding process or a channel coding process.

According to one embodiment, a CRC attachment process, etc. may be performed before the encoding process is performed on the code blocks (1012).

According to one embodiment, the coded code blocks (1013) may mean encoded code blocks for the code blocks (1012). LDPC may be performed as a coding method or technique according to one embodiment.

In Fig. 10, process B (1020) may be exemplified as an explanation of one embodiment of the present invention. In addition, process B (1020) may be exemplified as an encoding or coding process being performed at least twice in a specific layer.

According to one embodiment, a transport block (1021) that has undergone multiplexing in a higher layer may be transmitted or forwarded to a specific lower layer. According to one embodiment, the specific lower layer may be exemplified as a physical layer.

According to an embodiment, a transmission block (1021) may be divided into at least one code block (1022) through a code block division process.

According to an embodiment, a CRC attachment process, etc. may be performed before a code block division process is performed for a transmission block (1021).

Additionally, the size or length of each of the code blocks (1022) may always be constant, and the size or length may correspond to a bit unit.

In one embodiment, a first encoding process may be performed on the segmented code blocks (1022) to produce encoded code blocks (1023).

In one embodiment, the first encoding process may correspond to a coding method in which part or all of the processes of the RLNC coding technique are applied.

According to one embodiment, the first encoding process may correspond to a process of linearly combining code blocks (1022) using randomly selected coefficients.

Additionally, the first encoded code blocks (1023) may correspond to blocks in which randomly selected coefficients and code blocks (1022) are linearly combined.

According to an embodiment, the first encoding process may apply part or all of the processes related to FIG. 9.

According to one embodiment, a CRC attachment process, etc. may be performed before the second encoding process is performed on the first encoded code blocks (1023).

According to one embodiment, an additional encoding process may be performed on the first encoded code blocks (1023).

The encoding process performed additionally can be exemplified as a second encoding process.

The above second encoding process may correspond to the LDPC coding method exemplified in relation to Fig. 7.

According to one embodiment, a second encoding process may be performed on the first encoded code blocks (1023). The second encoded code blocks (1024) mean second encoded code blocks for the first encoded blocks (1012). According to one embodiment, LDPC may be performed as a second coding method.

FIG. 11 is a diagram illustrating a process of a physical layer according to a dual coding method according to one embodiment.

Referring to FIG. 11, an LDPC graph selection process may be performed at step 1110. The LDPC graph selection process may be a step for determining the transport block size (TBS) or length and code rate.

According to one embodiment, step 1110 may determine the number of source code blocks or the number of first encoded code blocks by considering the first encoding, and may also determine a code rate and a size of a transport block by considering the second encoding. The code rate may correspond to a ratio of the number of first encoded code blocks to the number of second encoded code blocks. In addition, it may correspond to a step of determining a code block size and an LDPC graph.

In one embodiment, step 1110 may include a parameter or information selection process for determining a transmission block size.

In one embodiment, step 1110 may correspond to being performed at a higher layer of the physical layer (e.g., the MAC layer).

According to one embodiment, the transmission block size may be determined based on the grant size. Factors determining the grant size may be determined by the MCS (modulation coding scheme) Level, the number of allocated RBs, the number of layers, the DMRS (demodulation reference signal) pattern, etc.

According to one embodiment, a transport block multiplexing procedure may be performed corresponding to a transport block size. In addition, the transport block multiplexing procedure may correspond to something performed in a higher layer of the physical layer (e.g., a MAC layer), and in step 1120 according to FIG. 11, the transport block may correspond to a transport block on which the multiplexing procedure is performed.

According to one embodiment, since n source code blocks are expanded into k encoded code blocks by the first encoding, and it may not be possible to map all encoded code blocks within an actual physical resource, when performing the first encoding according to one embodiment of the present invention, transport block multiplexing may be performed by taking the above circumstances into consideration in advance.

In one embodiment, the process of performing transport block multiplexing by considering the first encoding in advance may correspond to setting some resources to be reserved by considering in advance that n source code blocks will increase into k encoded code blocks through encoding.

According to one embodiment, n and k may be determined in advance in step 1110. Additionally, n and k may correspond to parameters for determining a transmission block size in step 1110.

At step 1120, multiplexed transport blocks from an upper layer (e.g., MAC layer) can be forwarded to a lower layer (e.g., physical layer).

The subsequent steps, starting from the CRC attachment process performed at step 1130, may be performed at a lower layer (e.g., the physical layer).

At step 1130, a CRC attachment process can be performed on the transmission block transmitted at step 1120.

In step 1140, a code block segmentation step may be performed for a transport block or a transport block to which a CRC is attached. The code block segmentation step (step 1140) may generally be performed together with the code block CRC attachment step (step 1160) in a communication system such as 5G NR, but in one embodiment of the present invention, the first encoding process (step 1150) may be performed after the code block segmentation step (step 1140) is performed separately from the code block CRC attachment step (step 1160).

At step 1150, after the first encoding process is performed, a code block CRC attachment step can be performed at step 1160.

Step 1140 may correspond to the process of dividing a data unit called a transmission block into a code block group (CBG) consisting of multiple code blocks or multiple code blocks for communication efficiency.

According to one embodiment, step 1140 may be performed depending on the transmission block length.

In one embodiment, step 1140 may be performed based on the transport block length rather than the total length or size of the sum of MAC PDUs.

Regardless of the number of code blocks, the size or length of a code block may always be constant, and the size or length may correspond to a unit of bits.

According to one embodiment, the first encoding process (step 1150) may correspond to a process of linearly combining code blocks divided through the code block division process (step 1140) using randomly selected coefficients.

According to one embodiment, the first encoding process (step 1150) may be applied as a coding technique capable of generating coded code blocks using source code blocks and providing an error detection function for each code block unit. In addition, with respect to one embodiment, if a CRC error occurs for some coded code blocks (for example, if error correction is performed through second encoding but decoding is not possible, etc.), the first encoding process (step 1150) may correspond to a process that provides a function capable of completely restoring the source code blocks.

According to one embodiment, the first encoding process (step 1150) may be performed based on preset values. The preset values may correspond to at least one of the number of code blocks (e.g., n) containing at least one MAC PDU as a source code block or the number of coded code blocks (e.g., k) when coded. According to one embodiment, the preset values may include coding coefficients (e.g., a _uv ) previously exemplified. In addition, the preset values may include coefficients used for linear combination operation in the first encoding process, random coefficients, or a matrix including the same.

According to one embodiment, when the value of k is determined, the value of n may be determined by a link adaptation algorithm, etc. The link adaptation algorithm may correspond to a technology for adjusting various parameters according to changes in communication channel quality, and may correspond to adjusting the MCS level based on HARQ feedback or CQI (channel quality indicator) feedback.

In one embodiment, considering the requirements of the second encoding process (step 1170) (for example, the condition that the lengths or sizes of the code blocks must be the same), specific bits such as padding bits, null bits, or filler bits may be added before and after the first encoding process. In one embodiment, the process of adding bits such as padding bits, null bits, or filler bits may be omitted before the first encoding process. The omission can be exemplified by a case in which parameters such as the transport block length are determined in a previous step so as to satisfy the encoding requirements (for example, the condition that the lengths of the code blocks must be the same) without adding null bits or filler bits before the first encoding through one embodiment of the present invention.

According to one embodiment, the first encoding process (step 1150) may be applied as a coding technique that allows some or all of the RLNC coding techniques to be applied at the physical layer.

At step 1160, a code block CRC attachment step may be performed on the code block on which the first coding has been performed.

At step 1170, a second encoding process may be performed on a code block for which first coding has been completed or a code block to which a CRC has been attached.

In relation to one embodiment, the second encoding process (step 1170) may be a coding technique that adds parity bits to each code block for all code blocks, thereby providing an error correction function for bits in which errors occur within the code blocks.

In relation to one embodiment, the second encoding process (step 1170) may be performed by an LDPC method. The LDPC method may be exemplified as an error correction coding method.

At step 1180, a rate matching process can be performed.

At step 1190, a code block concatenation process can be performed.

According to one embodiment, the code block linking process (step 1190) may be a step of combining multiple code blocks generated in a previous processing step into a data stream.

Additionally, the above code block connections can be performed in a specific order.

Additionally, a scrambling process can be performed.

FIG. 12 is a diagram illustrating a transmission block multiplexing procedure according to an embodiment of the present invention, taking into account a coding process according to an embodiment of the present invention.

Referring to FIG. 12, in step 1210, a MAC PDU (protocol data unit) may include some or all of a data unit related to an upper layer, an RLC SN (sequence number), a header, MAC LCID (logical channel ID) related information, a payload, etc.

According to one embodiment, the transport block multiplexing procedure may be performed corresponding to the transport block size. In addition, the transport block multiplexing procedure may correspond to being performed in a higher layer of the physical layer (e.g., MAC layer).

In steps 1210 to 1220 of Fig. 12, the process of performing transport block multiplexing by considering the first encoding in advance can be set to reserve some resources by considering in advance that n source code blocks will increase into k encoded code blocks through encoding.

According to one embodiment, a transport block multiplexing process may be performed on the remaining resources after reserve for some resources in advance by considering the length or size of encoded code blocks based on the grant size.

In Fig. 12, the transport block length according to the grant size can be exemplified as B, and the size or length of the remaining resources after reserving some of the resources can be exemplified as B'. According to one embodiment, the B' can correspond to the length of transport blocks containing actual MAC PDUs.

At step 1210, a transport block multiplexing process may be performed on MAC PDUs.

According to one embodiment, the size of the transport block size for the transport block multiplexing operation may correspond to B', and transport block multiplexing may be performed up to the maximum size B'.

At step 1220, a code block splitting step may be performed for a transport block or a transport block with a CRC attached.

At step 1230, it can be exemplified that a transmission block of length B' is divided into n code blocks.

FIG. 13 is a diagram illustrating a process of attaching CRC and inserting filler bits to coded code blocks after a first encoding process according to one embodiment.

Referring to FIG. 13, in step 1310, the transport block length according to the grant size may be exemplified as B, and the size or length of the remaining resources after reserving some of the resources may be exemplified as B'. According to one embodiment, the B' may correspond to the length of transport blocks including actual MAC PDUs. In addition, the transport blocks may include a CRC.

At step 1310, a code block splitting step may be performed for a transport block or a transport block with a CRC attached.

In steps 1320 to 1330, a transmission block of length B' can be divided into n code blocks.

According to one embodiment, a first encoding process according to one embodiment may be performed at step 1330.

Additionally, at step 1330, n code blocks are illustrated for the first coded code blocks generated through linear combination with coefficients or coefficient matrices.

At step 1340, the first encoded k code blocks are illustrated.

At step 1340, specific bits such as filler bits may be added or inserted along with the CRC attachment process, taking into account the requirements of the second encoding process (e.g., the condition that the length or size of the code blocks must be the same).

In one embodiment, step 1350 may be exemplified by one first coded code block.

According to one embodiment, a first coded code block may include a portion (1351) including MAC PDUs having a length of K'- L, a CRC (1352) having a length of L, and at least one of filler bits (1353) having a length of K-K'. According to one embodiment, the number of filler bits (1353) may be based on an LDPC lifting size.

In one embodiment, the grant size may be equal to the (k/n) value multiplied by the transport block or transport block size or length with CRC attached, or may be close to the multiplied value or may have some error within the tolerance.

FIG. 14 is a diagram illustrating a process in which first encoding is performed on all code blocks when code block group HARQ (hybrid automatic repeat request) is not applied and when code block group HARQ is applied to illustrate a decoding process according to one embodiment.

In one embodiment, code block group HARQ may mean a method in which HARQ, i.e., retransmission requests, are made on a per code block group basis.

Figure 14 is a diagram for explaining the decoding process for the first encoding, and the second encoding or the decoding process therefor may be omitted.

In one embodiment, 1410, which may correspond to a grant size, may include at least one of a transport block and a resource reserved for some resources and a CRC. The transport block may correspond to a transport block including actual MAC PDUs.

In 1420, it can be exemplified that first encoding is performed for all code block groups when HARQ is applied for each code block group (CBG) consisting of at least one code block. Accordingly, in 1420, the number of code blocks can be exemplified as k, and the number of code block groups can be exemplified as m.

In one embodiment, n may be exemplified as the number of source code blocks into which a transmission block is divided, and k may be exemplified as the number of first encoded code blocks.

In 1430, separate from 1420, in the case where code block group HARQ, that is, HARQ is not performed by code block group, the entire code blocks for which the first encoding was performed for 1410 can be exemplified as one code block group CBG ₀ .

According to one embodiment, in the case where the code block group HARQ is applied at the transmitter side, such as 1420, if the first encoding is performed for all code blocks (e.g., all source code blocks or all code block groups), the receiver side can determine OK or NOK for the decoding result through decoding under the conditions exemplified below.

- "OK": If the number of code blocks in which CRC errors occur in each received coded code block is less than or equal to (k - n), and the receiver successfully decodes n source code blocks with CRC OK through n coded code blocks, the receiver can determine the decoding result of the transmission block as "OK". In this case, the HARQ feedback can be determined as "ACK" (acknowledgement).

- "NOK": If the number of code blocks in which CRC errors occur in each received coded code block is greater than (k - n), the decoding result regarding the state of the code block group (CBG) to which the coded code block with CRC errors belongs can be determined as "NOK". In this case, the HARQ feedback can be determined as "NACK" (negative acknowledgement).

According to one embodiment, the example of 1420 above can also be exemplified as a case where the environment is not CA, DC, or mTRP with a single PDSCH.

In one embodiment, when the code block group HARQ is not applied at the transmitter side, such as 1430, and the first encoding is performed for all code blocks (e.g., all source code blocks or a single code block group), the receiver side can determine OK or NOK for the decoding result through decoding under the conditions exemplified below.

- "OK": If the number of code blocks in which CRC errors occur in each received coded code block is less than or equal to (k - n), and the receiver successfully decodes n source code blocks with CRC OK through n coded code blocks, the receiver can determine the decoding result of the transmission block as "OK". In this case, the HARQ feedback can be determined as "ACK".

- "NOK": If the number of code blocks in which CRC errors occur in each received coded code block is greater than (k - n), the decoding result of the transmission block can be determined as "NOK". In this case, the HARQ feedback can be determined as "NACK".

According to one embodiment, the example of 1430 above can also be exemplified as a case where the environment is not CA, DC, or mTRP with a single PDSCH.

FIG. 15 is a diagram illustrating a process in which first encoding is performed on some code blocks or some code block groups when code block group HARQ is applied to illustrate a decoding process according to one embodiment.

Figure 15 is a diagram for explaining the decoding process for the first encoding, and the second encoding or the decoding process therefor may be omitted.

In one embodiment, 1510, which may correspond to a grant size, may include at least one of a transport block and a resource reserved for some resources and a CRC. The transport block may correspond to a transport block including actual MAC PDUs.

According to one embodiment, in 1520, when HARQ is applied to a code block group (CBG) consisting of at least one code block, some code block groups may be exemplified as source code blocks belonging to the group before the first encoding is performed. Accordingly, in 1520, the number of code blocks may be exemplified as n, and the number of code blocks belonging to the code block group (CBG) on which the first encoding is performed may be exemplified as n'. With respect to FIG. 15, n' may be exemplified as 2.

In 1530, the number of code block groups for which the first encoding has been performed can be exemplified as m, and the number of encoded code blocks belonging to the code block groups for which the first encoding has been performed can be exemplified as k'. With respect to Fig. 15, k' can be exemplified as 3.

According to one embodiment, when the code block group HARQ is applied on the transmitter side as shown in FIG. 15, if the first encoding is performed on some code blocks (e.g., some source code blocks or some code block groups), the receiver side can determine OK or NOK based on the decoding result through decoding under the conditions exemplified below.

- "OK": If the number of code blocks in which CRC errors occur in the coded code blocks within the received code block group is less than or equal to (k'- n'), and the receiver successfully decodes n' source code blocks with CRC OK through n' coded code blocks, the receiver can determine the decoding result of the corresponding code block group as "OK". In this case, the HARQ feedback can be determined as "ACK".

- "NOK": If the number of code blocks in which CRC errors occur in the coded code blocks within the received code block group is greater than (k'- n'), the decoding result of the corresponding code block group can be determined as "NOK". In this case, the HARQ feedback can be determined as "NACK".

According to one embodiment, it can also be exemplified as a case where there is no CA, DC, or mTRP environment with a single PDSCH as an example in FIG. 15.

FIG. 16 is a diagram illustrating a process in which first encoding is performed on all code blocks when code block group HARQ is not applied to illustrate a decoding process in a CA, DC, or mTRP environment with multiple PDSCH according to one embodiment.

According to one embodiment, a decoding procedure can be performed at the receiving end by combining encoded code blocks received from TRP A and TRP B.

According to one embodiment, 1611, 1621, which may correspond to the grant size, may include at least one of a transport block and a resource reserved for some resources and a CRC. The transport block may correspond to a transport block including actual MAC PDUs.

In addition, 1612 and 1622 can be exemplified as a single code block group CBG 0 (CBG 0 on TRP A side and CBG ₀ on TRP B side ₎ for the entire code blocks for which the first encoding was performed for 1611 and 1621 in the case where HARQ is not performed by code block group in each of TRP A _and TRP B, respectively.

According to Fig. 16, 1612 may correspond to coded code blocks in which the first encoding is performed in TRP A, and the number thereof may be exemplified as k _A.

Additionally, 1622 may correspond to coded code blocks in which the first encoding is performed in TRP B, and the number of these may be exemplified as k _B .

According to FIG. 16, 1613 and 1623 can be exemplified as source code blocks before the first encoding is performed in TRP A and TRP B, respectively.

According to FIG. 16, 1613 may correspond to source code blocks before the first encoding is performed in TRP A, the number of which may be exemplified as n _A.

Additionally, 1623 may correspond to source code blocks before the first encoding in TRP B, the number of which may be exemplified as n _B .

In one embodiment, the first encoding can be applied to n _A + n _B , which can correspond to the entire source code block, i.e., the entire transport block of TRP A and the transport block of TRP B.

In one embodiment, the decoding task or operation can be performed cooperatively (e.g., between TRP A and TRP B) rather than individually decoding the physical channels transmitted in each TRP.

According to one embodiment, the length or number of transport blocks or CRCs or reserved resources exemplified in 1611 and 1621 may be different.

According to one embodiment, the number of coded code blocks exemplified in 1612 and 1622 may be different.

In one embodiment, each of the code blocks (source code blocks) exemplified in 1613 and 1623 may have the same length or size.

According to one embodiment, the number of code blocks exemplified in 1613 and 1623 may be different.

According to one embodiment, when the first encoding is performed on TRP A and TRP B as in FIG. 16, the receiver can determine OK or NOK based on the decoding result through decoding under the conditions exemplified below.

- "OK": If the number of code blocks in which CRC errors occur in each received coded code block is less than or equal to {(k _A + k _B ) - (n _A + n _B )}, the decoding result can be determined as "OK". In this case, the HARQ feedback can be determined as "ACK".

- "NOK": If the number of code blocks in which CRC errors occur in each received coded code block is greater than {(k _A + k _B ) - (n _A + n _B )}, the decoding result can be determined as "NOK". In this case, the HARQ feedback can be determined as "NACK".

FIG. 16 illustrates an example in which first encoding is performed on all code blocks when code block group HARQ is not applied to illustrate the decoding process in a CA, DC, or mTRP environment with multiple PDSCHs; however, the decoding process can also be illustrated when code block group HARQ is applied.

According to one embodiment, when code block group HARQ is applied at the transmitter side (TRP A, TRP B), if the first encoding is performed for all code blocks (e.g., all source code blocks or all code block groups), the receiver side can determine OK or NOK for the decoding result through decoding under the conditions exemplified below.

- "OK": If the number of code blocks in which CRC errors occur in each received coded code block is less than or equal to {(k _A + k _B ) - (n _A + n _B )}, the decoding result can be determined as "OK". In this case, the HARQ feedback can be determined as "ACK".

- "NOK": If the number of code blocks in which CRC errors occur in each received coded code block is greater than {(k _A + k _B ) - (n _A + n _B )}, the decoding result regarding the state of the code block group (CBG) to which the coded code block with CRC errors belongs can be determined as "NOK". In this case, the HARQ feedback can be determined as "NACK".

According to one embodiment, when code block group HARQ is applied specifically on the transmitting side (TRP A, TRP B), if the first encoding is performed on some code blocks (e.g., some source code blocks or some code block groups), the receiving side can determine OK or NOK for the decoding result of the corresponding code block group through decoding under the conditions exemplified below.

- "OK": If the number of code blocks in which CRC errors occur in the coded code blocks within the received code block group is less than or equal to {(k _A '+ k _B ') - (n _A ' + n _B ')}, the decoding result of the corresponding code block can be determined as "OK". In this case, the HARQ feedback can be determined as "ACK".

- "NOK": If the number of code blocks in which CRC errors occur in the coded code blocks within the received code block group is greater than {(k _A '+ k _B ') - (n _A ' + n _B ')}, the decoding result of the code block group to which the coded code block with CRC errors belongs can be determined as "NOK". In this case, the HARQ feedback can be determined as "NACK".

According to one embodiment of the present disclosure, the number of code blocks belonging to a code block group (CBG) in which the first encoding is performed may be exemplified as n _A ' or n _B ', and the number of encoded code blocks belonging to the code block group that has been first encoded may be exemplified as k _A ' or k _B '.

The PUSCH repetition technique, PDCP replication technique, and network coding technique exemplified in FIGS. 4 and 5, and the resource efficiency according to an embodiment of the present invention can be compared.

In one embodiment, resource efficiency may be calculated as "amount of source data transmitted / (amount of source data transmitted + amount of repeated or duplicated data)", allowing for some error within an acceptable range.

According to one embodiment, for the PUSCH repetition technique, the resource efficiency can be calculated as 1/r depending on the number of repetitions (r) (r > 1).

According to one embodiment, in the case of the PDCP replication technique, since data replication of the PDCP layer can generally be forwarded to two RLC layers, the resource efficiency can be calculated as 1/2.

/

로 계산될 수 있다. 상기 는 소스 PDCP PDU들의 개수로 예시될 수 있고, 는 코딩된 PDCP PDU들의 개수로 예시될 수 있다.According to one embodiment, for network coding at the PDCP layer, which can be exemplified by a network coding technique,

/

can be calculated as above can be exemplified by the number of source PDCP PDUs, can be exemplified by the number of coded PDCP PDUs.

According to one embodiment, in the case of a dual coding technique performed in the physical layer, it can be calculated as n / k. Assuming n < k, n can be exemplified as the number of source code blocks, and k can be exemplified as the number of coded code blocks, and when comparing the previously calculated resource efficiencies, the resource efficiency of the dual coding technique performed in the physical layer can be calculated to be the highest.

Additionally, according to one embodiment, the resource efficiency may be viewed as a separate indicator from “(actual information bit length)/(encoded codeword length)”, which may correspond to a code rate or coding rate.

FIG. 17 is a diagram illustrating the structure of a terminal in a wireless communication system according to one embodiment.

Referring to FIG. 17, a terminal (1700) according to an embodiment of the present disclosure may be configured to include a control unit (1701), a transceiver unit (1702), and a memory (1703). In the present disclosure, the control unit (1701) of the terminal (1700) may be defined as a circuit or an application-specific integrated circuit or at least one processor.

The control unit (1701) can control the overall operation of the terminal (1700) according to one embodiment proposed in the present disclosure. For example, the control unit (1701) can control the signal flow between each block to perform an operation according to the drawing (or, flow chart, flow diagram) described above.

The transceiver (1702) can transmit and receive signals. The transceiver (1702) can transmit signals to a node or a base station according to an embodiment of the present disclosure, and receive signals from the node or the base station, for example.

The transceiver (1702) may include a baseband processing unit or perform the same role. For example, it may perform a conversion function between a baseband signal and a bit stream according to a physical layer specification of the system. For example, when transmitting data, the baseband processing unit may generate complex symbols by encoding and modulating a transmission bit stream. In addition, when receiving data, the baseband processing unit may restore a reception bit stream by demodulating and decoding a baseband signal. In addition, the baseband processing unit may be included in the control unit (1701) or may be included separately in the terminal, and may be replaced by another device having the same function.

The memory (1703) can store at least one of information transmitted and received through the transceiver (1702) and information generated through the control unit (1701). In addition, the memory (1703) can be defined as a storage unit.

FIG. 18 is a diagram illustrating the structure of a base station in a wireless communication system according to one embodiment.

Referring to FIG. 18, a base station (1800) according to an embodiment of the present disclosure may be configured to include a control unit (1801), a transceiver unit (1802), and a memory (1803). In the present disclosure, the control unit (1801) of the base station (1800) may be defined as a circuit or an application specific integrated circuit or at least one processor.

The control unit (1801) can control the overall operation according to an embodiment proposed in the present disclosure. For example, the control unit (1801) can control the signal flow between each block to perform the operation according to the drawing (or, flow chart, flow diagram) described above.

The transceiver (1802) can transmit and receive signals. The transceiver (1802) can transmit signals to a terminal or node according to an embodiment of the present disclosure, for example, and receive signals from the terminal or node.

The transceiver (1802) may include a baseband processing unit or perform the same role. For example, it may perform a conversion function between a baseband signal and a bit stream according to a physical layer specification of the system. For example, when transmitting data, the baseband processing unit may generate complex symbols by encoding and modulating a transmission bit stream. In addition, when receiving data, the baseband processing unit may restore a reception bit stream by demodulating and decoding a baseband signal. In addition, the baseband processing unit may be included in the control unit (1801) or may be included separately in the base station, and may be replaced by another device having the same function.

The memory (1803) can store at least one of information transmitted and received through the transceiver (1802) and information generated through the control unit (1801). In addition, the memory (1803) can be defined as a storage unit.

Additionally, the embodiments of the present invention disclosed above can be performed by the terminal (1700) or the base station (1800).

The methods according to the embodiments described in the claims or specification of the present disclosure may be implemented in the form of hardware, software, or a combination of hardware and software.

In the case of software implementation, a computer-readable storage medium storing one or more programs (software modules) may be provided. The one or more programs stored in the computer-readable storage medium are configured for execution by one or more processors in an electronic device. The one or more programs include instructions that cause the electronic device to execute methods according to the embodiments described in the claims or specification of the present disclosure.

These programs (software modules, software) may be stored in a random access memory, a non-volatile memory including a flash memory, a ROM (Read Only Memory), an Electrically Erasable Programmable Read Only Memory (EEPROM), a magnetic disc storage device, a Compact Disc-ROM (CD-ROM), a Digital Versatile Discs (DVDs) or other forms of optical storage devices, a magnetic cassette. Or, they may be stored in a memory composed of a combination of some or all of these. In addition, each configuration memory may be included in multiple numbers.

Additionally, the program may be stored in an attachable storage device that is accessible via a communication network, such as the Internet, an Intranet, a Local Area Network (LAN), a Wide LAN (WLAN), or a Storage Area Network (SAN), or a combination thereof. The storage device may be connected to a device implementing an embodiment of the present disclosure via an external port.

Additionally, a separate storage device on the communications network may be connected to a device performing an embodiment of the present disclosure.

In the specific embodiments of the present disclosure described above, the components included in the present disclosure are expressed in the singular or plural form according to the specific embodiments presented. However, the singular or plural expressions are selected appropriately for the presented situation for the convenience of explanation, and the present disclosure is not limited to the singular or plural components, and even if a component is expressed in the plural form, it may be composed of the singular form, or even if a component is expressed in the singular form, it may be composed of the plural form.

Meanwhile, the embodiments of the present disclosure disclosed in this specification and drawings are only specific examples presented to easily explain the technical content of the present disclosure and help in understanding the present disclosure, and are not intended to limit the scope of the present disclosure. In other words, it is obvious to a person having ordinary skill in the technical field to which the present disclosure belongs that other modified examples based on the technical idea of the present disclosure are possible.

Additionally, each of the above embodiments can be combined and operated as needed.

Meanwhile, the order of description in the drawings explaining the method of the present disclosure does not necessarily correspond to the order of execution, and the order of precedence may be changed or executed in parallel.

Alternatively, the drawings illustrating the method of the present disclosure may omit some components and include only some components without damaging the essence of the present disclosure.

In addition, the method of the present disclosure may be implemented by combining part or all of the contents included in each embodiment within a scope that does not harm the essence of the present disclosure.

Meanwhile, the embodiments of the present disclosure disclosed in this specification and drawings are only specific examples presented to easily explain the technical content of the present disclosure and help understand the present disclosure, and are not intended to limit the scope of the present disclosure. That is, it is obvious to a person having ordinary knowledge in the technical field to which the present disclosure belongs that other modified examples based on the technical idea of the present disclosure are possible. In addition, each of the above embodiments can be combined and operated with each other as needed. For example, all of the embodiments of the present disclosure can be operated with parts combined with each other.

Claims (18)

In a channel coding method performed by a transmitting/receiving device of a wireless communication system,
A step of attaching a CRC (cyclic redundancy check) code to a transport block for data transmission;
A step of dividing a transmission block having the CRC code attached into at least one code block;
performing a first encoding on at least one of the above code blocks; and
Comprising a step of performing a second encoding on at least one or more of the first encoded code blocks,
A method characterized in that the first encoding and the second encoding are performed in a physical layer. In the first paragraph,
A method characterized in that the first encoding comprises a linear combination of at least one random coefficient and at least one code block. In the first paragraph,
A method characterized in that the size of the above transmission block is determined by considering the first encoding. In the first paragraph, the step of performing the second encoding comprises:
a step of attaching a CRC code to at least one of the first encoded code blocks; and
A method comprising the step of performing said second encoding on at least one or more of said first encoded code blocks having said CRC code attached thereto. In the first paragraph,
A method characterized in that the first encoding is performed on all or part of the at least one code block. In the first paragraph,
A method characterized in that the above transceiver device includes at least one of a terminal or a base station. In the first paragraph, the step of attaching the CRC code is:
A low density parity check (LDCP) graph selection step for determining parameters related to the size of the above transmission block; and
A method characterized by comprising the step of attaching the CRC code to the transmission block for the data transmission. In Article 7,
A method characterized in that the above parameters include at least one of a number of the at least one code block, a number of the at least one first encoded code block, a code rate, or a parameter for the size of the transport block. In the first paragraph,
A method characterized in that the first encoding is RLNC (random linear network coding) and the second encoding is LDCP (low density parity check). In a transmitter/receiver device of a wireless communication system,
Transmitter and receiver; and
A control unit connected to the above transceiver, attaching a CRC (cyclic redundancy check) code to a transport block for data transmission, dividing the transport block to which the CRC code is attached into at least one code block, performing first encoding on the at least one code block, and performing second encoding on the at least one code block that has been first encoded,
A transceiver device, characterized in that the first encoding and the second encoding are performed in a physical layer. In Article 10,
A transceiver, characterized in that the first encoding comprises a linear combination of at least one random coefficient and at least one code block. In Article 10,
A transceiver device, characterized in that the size of the above transmission block is determined in consideration of the first encoding. In the 10th paragraph, the control unit,
A transceiver device characterized in that it attaches a CRC code to at least one or more of the first encoded code blocks and performs the second encoding on the at least one or more of the first encoded code blocks to which the CRC code is attached. In Article 10,
A transceiver device, characterized in that the first encoding is performed on all or part of the at least one code block. In the 10th paragraph, the transmitting and receiving device,
A transceiver characterized by comprising at least one of a terminal and a base station. In the 10th paragraph, the control unit,
A transceiver characterized by performing LDCP (low density parity check) graph selection to determine parameters related to the size of the transmission block and attaching the CRC code to the transmission block for the data transmission. In Article 16,
A transceiver device, characterized in that the above parameters include at least one of the number of the at least one code block, the number of the at least one first encoded code block, a code rate, or a parameter for the size of the transport block. In Article 10,
A transceiver device, characterized in that the first encoding is RLNC (random linear network coding) and the second encoding is LDCP (low density parity check).

Images