Dual coding method and apparatus in wireless communication system

Abstract

The present invention relates to a channel decoding method executed in a 6G communication system for achieving a high data transmission rate and ultra-low delay after a 5G communication system. More specifically, the present invention relates to a channel decoding method performed by a transmitting / receiving device of a wireless communication system, and the method for data dual decoding in a physical layer comprises the steps of: attaching a cyclic redundancy check (CRC) code to a transport block for data transmission; dividing the transmission block to which the CRC code has been attached into at least one code block; performing main coding on the at least one code block; and performing secondary coding on the code block of the at least one primary coding, where the primary coding and the secondary coding are performed at the physical layer.

Description

Technical Field

[0001] This disclosure relates to methods and apparatus for decoding data or channels in a wireless communication system. More specifically, this disclosure relates to a method for double decoding data at the physical layer. Background Technology

[0002] Looking back at the evolution of wireless communication, the technologies have primarily been developed for human-centric services such as voice, multimedia, and data. Following the commercialization of fifth-generation (5G) communication systems, a rapid increase in interconnected devices is expected to connect to the communication networks. Examples of things connected to the network can include vehicles, robots, drones, home appliances, displays, smart sensors installed in various infrastructures, construction equipment, factory equipment, and more. Mobile devices are expected to evolve into various forms, such as augmented reality glasses, virtual reality headsets, and holographic devices. In the sixth-generation (6G) era, efforts are focused on developing enhanced 6G communication systems that will connect hundreds of billions of devices and things to provide a wide range of services. Therefore, 6G communication systems are referred to as "beyond 5G."

[0003] In the 6G communication system, which is expected to be realized around 2030, the maximum transmission rate will be T (i.e., 1000 gigabits per second) bps (trillion bits per second), and the wireless latency will be 100 microseconds (μsec). In other words, compared with the 5G communication system, the 6G communication system will achieve a data transmission speed 50 times faster and reduce the wireless latency to one-tenth of the original.

[0004] To achieve the aforementioned high data rates and ultra-low latency, 6G communication systems are considered for implementation in the terahertz (THz) band (e.g., the 95 GHz to 3 THz band). In the terahertz band, more severe path loss and atmospheric absorption occur compared to the millimeter-wave (mmWave) band introduced in 5G systems. Therefore, the importance of technologies that can ensure signal propagation distance (i.e., coverage) is expected to increase further. As key technologies for ensuring coverage, radio frequency (RF) components, antennas, novel waveforms providing better coverage than orthogonal frequency division multiplexing (OFDM), beamforming, and multi-antenna transmission technologies such as massive MIMO, full-dimensional MIMO (FD-MIMO), array antennas, and massive MIMO are being developed. Furthermore, several new technologies are currently being discussed, such as metamaterial-based lenses and antennas, high-dimensional spatial multiplexing using orbital angular momentum (OAM), and reconfigurable smart surfaces (RIS) to enhance the coverage of terahertz band signals.

[0005] Furthermore, to improve frequency efficiency and system networks, 6G communication systems are developing innovative network architectures, including full-duplex technology that allows both uplink and downlink to use the same frequency resources simultaneously; network technologies that fully utilize satellites, High Altitude Platform Stations (HAPS), etc.; network architecture innovations that support mobile base stations and optimize and automate network operations; dynamic spectrum sharing technology that avoids collisions based on spectrum usage prediction; AI-based communication technologies that utilize artificial intelligence (AI) from the design stage and embed end-to-end AI support functions to achieve system optimization; and next-generation distributed computing technologies that utilize ultra-high-performance communication and computing resources (Mobile Edge Computing (MEC), cloud, etc.) to achieve complex services that exceed the limits of terminal computing capabilities. In addition, efforts are being made to further strengthen connectivity between devices, optimize networks more effectively, promote the software-defined networking of network entities, and enhance the openness of wireless communication by developing technologies related to the design of new protocols used in 6G communication systems, implementing hardware-based security environments, developing secure data utilization mechanisms, and maintaining privacy methods.

[0006] Through the research and development of 6G communication systems, it is anticipated that the next generation of hyper-connected experiences will become possible through the hyper-connectivity of 6G communication systems (including connections between things and between people and things). Specifically, it is expected that 6G communication systems will provide services such as truly immersive extended reality (XR), high-fidelity mobile holograms, and digital replicas. In addition, 6G communication systems will provide services with enhanced security and reliability for various industries (including industrial, medical, automotive, and home appliance sectors), such as remote surgery, industrial automation, and emergency response. Summary of the Invention

[0007] [Technical Issues]

[0008] Due to increases in data or bandwidth, the size of transport blocks forwarded at each layer may increase, potentially further increasing the number of code blocks or code block groups. Therefore, on the receiving side, the decoding of data or channels may be more critical for error detection or correction of data, code blocks, or similar content. One embodiment of this disclosure aims to provide a decoding method that reduces the overhead caused by decoding. Another embodiment of this disclosure provides a decoding method that can improve communication efficiency.

[0009] Furthermore, issues related to resource efficiency and implementation complexity may arise in situations such as repeated Physical Uplink Shared Channel (PUSCH) and duplicated Packet Data Convergence Protocol (PDCP). One embodiment of this disclosure also provides a method for improving communication or resource efficiency in such situations.

[0010] The technical problem to be solved by this disclosure is not limited to the above-mentioned objectives. That is to say, those skilled in the art involved in this specification will clearly understand other objects not mentioned.

[0011] [Technical Solution]

[0012] According to one aspect of this disclosure, a channel decoding method performed by a transmitting / receiving device of a wireless communication system includes: appending a cyclic redundancy check (CRC) code to a transport block for data transmission; segmenting the transport block with the CRC code appended into one or more code blocks; performing primary encoding on the one or more code blocks; and performing secondary encoding on the one or more primary-encoded code blocks, wherein the primary encoding and secondary encoding are performed at the physical layer.

[0013] The master code can linearly combine one or more arbitrary coefficients with one or more code blocks.

[0014] The size of the transport block can be determined with the main encoding taken into account.

[0015] Performing secondary encoding may include: appending CRC codes to one or more main encoding blocks; and performing secondary encoding on one or more main encoding blocks with appended CRC codes.

[0016] The master code can be executed on all or part of one or more code blocks.

[0017] The transmitting / receiving device may include at least one of a terminal and a base station.

[0018] The addition of CRC codes may include: selecting a low-density parity check (LDCP) graph to determine parameters related to the transport block size; and appending CRC codes to the transport block for data transmission.

[0019] The parameters may include at least one of the following: the number of one or more code blocks, the number of one or more main coded code blocks, the code rate, and the size of the transport block.

[0020] The primary codec can be random linear network decoding (RLNC), and the secondary codec is low-density parity-check (LDPC).

[0021] According to another aspect of this disclosure, a transmitting / receiving device for a wireless communication system includes: a controller that performs the following operations: appending a cyclic redundancy check (CRC) code to a transport block for data transmission; segmenting the transport block with the CRC code appended into one or more code blocks; performing primary coding on one or more code blocks; and performing secondary coding on one or more code blocks with primary coding, wherein the primary coding and secondary coding are performed at the physical layer.

[0022]

Advantages and Effects

[0023] The embodiments of this disclosure perform both primary and secondary encoding at the physical layer, thus eliminating the need for various processes, such as exchanging necessary information related to inter-layer decoding to avoid errors or additional decoding between the physical layer and higher layers. Therefore, the time consumed by unnecessary processing can be reduced, and procedural advantages in decoding or decoding can be gained because additional data transmission processes for decoding or decoding between layers can be omitted.

[0024] Embodiments of this disclosure provide a decoding method in which random coefficients are used to linearly combine code blocks, such as in master coding at the physical layer, thereby enabling decoding to be performed in a simple manner with lower complexity compared to other decoding techniques and reducing the burden on the physical layer.

[0025] The effects that this disclosure may achieve are not limited to those described in the various embodiments. Other effects not mentioned will be clearly understood by those skilled in the art involved in this specification. Attached Figure Description

[0026] Figure 1 This is a diagram illustrating the basic structure of the time-frequency domain in a wireless communication system according to an embodiment of the present disclosure;

[0027] Figure 2 This is a diagram illustrating the structure of frames, subframes, and time slots in a wireless communication system according to embodiments of the present disclosure;

[0028] Figure 3 This is a diagram illustrating the wireless protocol structure of a base station and a UE in a wireless communication system under single-cell, carrier aggregation, and dual connectivity scenarios according to embodiments of the present disclosure;

[0029] Figure 4a and Figure 4b This is a diagram illustrating repeated transmissions of the Physical Uplink Shared Channel (PUSCH), which serves as an example for providing better coverage or reliability, etc., in 5G or 6G communication systems according to embodiments.

[0030] Figure 5 This is a diagram illustrating a copy of the Packet Data Convergence Protocol (PDCP) as an example of providing better coverage or reliability in a 5G or 6G communication system, according to an embodiment.

[0031] Figure 6 This is a diagram illustrating multiple transmit and receive points (multiple TRPs) associated with PUSCH repetition, based on an example.

[0032] Figure 7This is a diagram illustrating low-density parity checking (LDPC) performed at the physical (PHY) layer as a channel decoding process during data transmission according to an embodiment.

[0033] Figure 8 This is a diagram illustrating the graphic process of selecting LDPC diagrams according to an embodiment.

[0034] Figure 9 This is a diagram illustrating the operations or techniques used, according to an embodiment, to generate post-decoded packets related to the Random Linear Network Decoding (RLNC) technique.

[0035] Figure 10 This is a diagram illustrating a portion of the overall process of dual decoding of a channel or data according to an embodiment.

[0036] Figure 11 This is a diagram illustrating the physical layer process according to a dual decoding scheme based on an embodiment.

[0037] Figure 12 This is a diagram illustrating a transport block multiplexing process performed according to an embodiment, taking into account the decoding process described in the embodiments of this disclosure.

[0038] Figure 13 This is a diagram illustrating the CRC appending and padding bit insertion process performed on the decoded code block after the main encoding process, according to an embodiment.

[0039] Figure 14 The diagram illustrates the process according to an embodiment for the purpose of demonstrating the decoding process, wherein the main encoding process is performed on all blocks when block group HARQ (Hybrid Automatic Repeat Request) is not applied and when block group HARQ is applied.

[0040] Figure 15 The diagrams illustrating the decoding process according to the embodiments are shown for illustrative purposes, wherein a main encoding process is performed on some code blocks or some code block groups when applying code block group HARQ.

[0041] Figure 16 The diagram illustrates the process according to an embodiment for the purpose of illustrating the decoding process in a CA, DC, or mTRP environment with multiple PDSCHs, wherein master encoding is performed on all code blocks when code block group HARQ is not applied.

[0042] Figure 17 This is a diagram illustrating the structure of a terminal in a wireless communication system according to an embodiment.

[0043] Figure 18 This is a diagram illustrating the structure of a base station in a wireless communication system according to an embodiment. Detailed Implementation

[0044] The embodiments of this disclosure will be described in detail below with reference to the accompanying drawings.

[0045] In describing the embodiments, descriptions of techniques well-known in the art, whether related to or not directly related to this disclosure, will be omitted.

[0046] This is so as to clearly convey the essence of this disclosure by omitting unnecessary explanations.

[0047] For the same reason, some components in the accompanying drawings may be enlarged, omitted, or shown schematically. Furthermore, the size of each component does not perfectly reflect its actual size. The same reference numerals are used to denote the same or corresponding components in each drawing.

[0048] Various advantages and features of this disclosure and its implementation methods will become apparent from the following detailed description of embodiments taken in conjunction with the accompanying drawings.

[0049] However, this disclosure is not limited to the embodiments described below, but may be implemented in various different forms. These embodiments are provided only to make the configuration of this disclosure complete and to enable those skilled in the art to fully understand the scope of this disclosure, which will be defined by the scope of the claims. Throughout the specification, the same reference numerals denote the same elements.

[0050] In this context, it should be understood that each block and combination of blocks in the flowchart can be executed by computer program instructions. Since these computer program instructions can be mounted on the processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, these computer program instructions, executed by a process of the computer or other programmable data processing device, generate components for performing the functions described in the combination of the blocks(s) in the flowchart. Since these computer program instructions can also be stored in a computer-usable or computer-readable memory of the computer or other programmable data processing device to implement the functions in a particular embodiment, the computer program instructions stored in computer-usable or computer-readable memory can also generate an article of art including instructions for performing the functions described in the blocks(s) in the flowchart. Since the computer program instructions can also be mounted on a computer or other programmable data processing device, these instructions perform a series of operational steps on the computer or other programmable data processing device to construct a process executed by the computer, thereby performing steps that the computer or other programmable data processing device can also provide for performing the functions described in the blocks(s) in the flowchart.

[0051] Furthermore, each box may indicate a module, segment, or portion of code that includes one or more executable instructions for performing the specified logical function(s). It should also be noted that in some alternative embodiments, the order in which the functions mentioned in the boxes occur is irrelevant. For example, the two consecutive boxes illustrated may actually be executed simultaneously, or they may be executed in reverse order according to their respective functions.

[0052] In this context, the term "~unit" as used in this embodiment refers to a software or hardware component such as a Field-Programmable Gate Array (FPGA) or Application-Specific Integrated Circuit (ASIC), and the "~unit" performs a specific function. However, the "~unit" is not intended to be limited to software or hardware. A "~unit" can be configured to be stored in a storage medium that can be addressed or configured to reproduce one or more processors. Accordingly, as examples, a "~unit" includes components such as software components, object-oriented software components, class components and task components, processes, functions, attributes, programs, subroutines, program code segments, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables. The components and functions provided in a "unit" can be combined into a smaller number of components and "units," or further broken down into additional components and "units." Furthermore, elements and "~units" can be implemented as one or more central processing units (CPUs) in a device or secure multimedia card.

[0053] In the following text, for ease of description, some terms and names defined in the 3GPP standards (standards for 5G, NR, LTE, or similar systems) may be used. Furthermore, terms and names newly defined in next-generation communication systems (e.g., 6G, beyond 5G systems) that can be applied to this disclosure, or terms and names used in existing communication systems, may be used. The use of such terms is not limited to those of this disclosure and can be equally applied to systems conforming to other standards, and can be modified to other forms without departing from the spirit of this disclosure. Embodiments of this disclosure can be readily modified and even applied to other communication systems.

[0054] Furthermore, unless explicitly indicated by a particular embodiment of this disclosure, singular expressions such as “a” and “the” should be understood to include plural forms.

[0055] Furthermore, in one embodiment of this disclosure, the dimensions of blocks, etc., can be interchanged in terms of length or size.

[0056] Furthermore, in one embodiment of this disclosure, terms including ordinal numbers such as "first," "second," etc., may be used to describe various components, but these components should not be construed as being limited to these terms. These terms are used to distinguish one component from another. For example, a first component may be named a second component, and a second component may similarly be named a first component, without departing from the scope of this disclosure.

[0057] Furthermore, in one embodiment of this disclosure, the term "and / or" includes a combination of multiple related descriptive terms or any one of the multiple related descriptive terms mentioned above.

[0058] Furthermore, the terminology used in the embodiments of this disclosure is for the purpose of describing specific exemplary embodiments only and is not intended to limit this disclosure. Unless the context clearly indicates otherwise, singular expressions are intended to include plural expressions. It should also be further understood that the terms "comprising," "having," or similar terms as used herein refer to the presence of features, values, steps, operations, components, parts, or combinations thereof mentioned in this specification, but do not exclude the presence or addition of one or more other features, values, steps, operations, components, parts, or combinations thereof.

[0059] Furthermore, the terms “associated with” and “associated with” and their derivatives as used in the embodiments of this disclosure include, include, interconnect, contain, contain, connect to or connect with, couple to or couple with, communicate with, collaborate with, intersect with, juxtapose with, approach with, bind to or bind with, possess, have its nature or similar meaning.

[0060] Furthermore, in this disclosure, expressions such as "greater than" or "less than" are used to determine whether a specific condition is met; however, this is merely illustrative and does not exclude expressions such as "greater than or equal to" or "less than or equal to". A condition described as "greater than or equal to" can be replaced with "greater than", a condition described as "less than or equal to" can be replaced with "less than", and a condition described as "greater than or equal to and less than" can be replaced with "greater than and less than or equal to".

[0061] Furthermore, although this disclosure uses terms used in certain communication standards (e.g., the 3rd Generation Partnership Project (3GPP)) to describe embodiments, these are merely illustrative examples. Embodiments of this disclosure can be readily modified and even applied to other communication systems.

[0062] Before providing a detailed description of this disclosure, examples of interpretable meanings for several terms used in this specification are provided. However, it should be noted that this disclosure is not limited to the examples of interpretation shown below.

[0063] In this disclosure, a terminal (or communication terminal) is an entity that communicates with a base station or other terminal, and may be referred to as a node, user equipment (UE), next-generation user equipment (NG UE), mobile station (MS), device, or terminal, etc. Furthermore, the terminal may include at least one of the following: smartphone, tablet computer, mobile phone, video phone, e-book reader, desktop computer, laptop computer, netbook, workstation, server, personal digital assistant (PDA), portable multimedia player (PMP), MP3 player, medical device, camera, and wearable device. Additionally, the terminal may include at least one of the following: television, digital video disc (DVD) player, stereo, refrigerator, air conditioner, washing machine, oven, microwave oven, washing machine, air purifier, set-top box, home automation control panel, security control panel, media box, game console, electronic dictionary, electronic key, camera, and digital photo frame. In addition, the terminal may include at least one of the following: various medical devices (e.g., various portable medical measuring devices (e.g., blood glucose meters, heart rate monitors, blood pressure monitors, thermometers), magnetic resonance angiography (MRA), magnetic resonance imaging (MRI), computed tomography (CT), imaging equipment, ultrasound equipment, etc.), navigation devices, global navigation satellite systems (GNSS), event data recorders (EDR), flight data recorders (FDR), automotive infotainment devices, marine electronic equipment (e.g., marine navigation equipment, gyrocompasses, etc.), avionics equipment, security equipment, vehicle-mounted mainframes, industrial or household robots, drones, ATMs of financial institutions, point-of-sale (POS) terminals in stores, and Internet of Things (IoT) devices (e.g., light bulbs, various sensors, electricity or gas meters, sprinkler systems, fire alarms, thermostats, streetlights, toasters, fitness equipment, hot water tanks, heating systems, boilers, etc.). Furthermore, the terminal may include various types of multimedia systems capable of performing communication functions. This disclosure is not limited to the above description, and the term "terminal" may be used with the same or similar meanings.

[0064] Furthermore, in this disclosure, a base station is an entity that communicates with and allocates resources to terminals, and can take various forms. A base station may be referred to as a base station (BS), NodeB (NB), Next Generation Radio Access Network (NG RAN), Access Point (AP), Transmit / Receive Point (TRP), Radio Access Unit, Base Station Controller, Network Node, etc. Alternatively, depending on functional division, a base station may be referred to as a Central Unit (CU) or Distributed Unit (DU). However, this disclosure is not limited to these terms, and base stations may be referred to as terms with the same or similar meanings.

[0065] Furthermore, in this disclosure, Radio Resource Control (RRC) messages may be referred to as advanced information messages, advanced signals, advanced signaling, advanced signaling, high-level signaling, or high-level signaling. This disclosure is not limited thereto, and the terms may also be used with the same or similar meanings.

[0066] Furthermore, in this disclosure, data may be referred to as user data, user plane (UP) data, or application data, or may be referred to as a term having the same or similar meaning as signals transmitted and received via data radio bearers (DRB).

[0067] Furthermore, in this disclosure, the direction of data transmission from the terminal can be referred to as uplink (UL), while the direction of data transmission to the terminal can be referred to as downlink (DL). Therefore, for uplink transmission, the transmitter can refer to the terminal, and the receiver can refer to the base station or a specific network entity in the communication system. Alternatively, for downlink transmission, the transmitter can refer to the base station or a specific network entity in the communication system, and the receiver can refer to the terminal.

[0068] The frame structure of the 5G system will be described in more detail below with reference to the accompanying drawings.

[0069] Figure 1 This is a diagram showing the basic structure of the time-frequency domain, which is the radio resource area used for transmitting data or control channels in a 5G system.

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

[0071] Figure 2 This is a diagram illustrating the structure of frames, subframes, and time slots in a wireless communication system according to an embodiment.

[0072] Figure 2 An example of the structure of frame 200, subframe 201, and time slot 202 is shown. One frame 200 can be defined as 10 ms. One subframe 201 can be defined as 1 ms. Therefore, one frame 200 can consist of a total of 10 subframes 201. One time slot 202 and 203 can be defined as 14 OFDM symbols (i.e., the number of symbols per time slot). =14). A subframe 201 can consist of one or more time slots 202 and 203, and the number of time slots 202 and 203 in each subframe 201 can vary according to the configuration values ​​μ 204 and 205 of the subcarrier spacing. Figure 2 The example shows the cases where the subcarrier spacing configuration value μ = 0 (204) and μ = 1 (205). When μ = 0 (204), one subframe 201 can consist of one time slot 202, and when μ = 1 (205), one subframe 201 can consist of two time slots 203. That is, the number of time slots per subframe depends on the subcarrier spacing configuration value μ. They may differ, and correspondingly, the number of time slots per frame. It may differ. It depends on the configuration value μ of the spacing between each subcarrier. and It can be defined as shown in Table 1 below.

[0073] [Table 1]

[0074]

[0075] Rate matching and puncturing operations will be described in detail below. When any symbol sequence A is transmitted on time and frequency resource A, which overlaps with any time and frequency resource B, the transmission and reception operations of channel A may involve rate matching or puncturing operations, taking into account resource C corresponding to the region where resources A and B overlap. The specific operations can follow the following steps.

[0076] Rate matching operation

[0077] A base station can transmit channel A by mapping it only to the remaining resource area within resource A, which is intended for transmitting symbol sequence A to the UE, excluding resource C, the region overlapping with resource B. For example, when symbol sequence A consists of {symbol #1, symbol #2, symbol #3, symbol #4}, resource A consists of {resource #1, resource #2, resource #3, resource #4}, and resource B consists of {resource #3 and resource #5}, the base station can transmit symbol sequence A by mapping it sequentially to {resource #1, resource #2, resource #4}, that is, to the remaining resources in resource A excluding {resource #3}, the region corresponding to resource C. Therefore, the base station can map and transmit the symbol sequence {symbol #1, symbol #2, symbol #3} to {resource #1, resource #2, resource #4} respectively.

[0078] The UE can determine resources A and B based on scheduling information about symbol sequence A from the base station, and therefore determine resource C corresponding to the area overlapping with resources A and B. The UE can receive symbol sequence A under the assumption that symbol sequence A is mapped and transmitted in the remaining area of ​​resource A, excluding resource C. For example, when symbol sequence A consists of {symbol #1, symbol #2, symbol #3, symbol #4}, resource A consists of {resource #1, resource #2, resource #3, resource #4}, and resource B consists of {resource #3, resource #5}, the UE can receive symbol sequence A under the assumption that symbol sequence A is mapped sequentially to {resource #1, resource #2, resource #4}, i.e., the remaining resources in resource A excluding {resource #3} corresponding to resource C. Therefore, the UE can perform a series of subsequent reception operations under the assumption that symbol sequence {symbol #1, symbol #2, symbol #3} is mapped and transmitted in {resource #1, resource #2, resource #4}, respectively.

[0079] [Drilling operation]

[0080] When a base station intends to send symbol sequence A to a UE, and there exists a resource C in the entire resource A that overlaps with resource B, the base station maps symbol sequence A to the entire resource A. However, it cannot perform transmission in the resource area corresponding to resource C, and can only perform transmission in the remaining resource areas of resource A outside of resource C. For example, when symbol sequence A consists of {symbol #1, symbol #2, symbol #3, symbol #4}, resource A consists of {resource #1, resource #2, resource #3, resource #4}, and resource B consists of {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. It only transmits the symbol sequence {symbol #1, symbol #2, symbol #4} corresponding to the remaining resources {resource #1, resource #2, resource #4} in resource A, excluding {resource #3} corresponding to resource C, and cannot transmit {symbol #3} mapped to {resource #3} corresponding to resource C. Therefore, the base station can map the symbol sequence {symbol #1, symbol #2, symbol #4} and send it to {resource #1, resource #2, resource #4} respectively.

[0081] The UE can determine resources A and B based on scheduling information about symbol sequence A from the base station, and therefore determine resource C corresponding to the area overlapping resources A and B. The UE can receive symbol sequence A under the following assumptions: symbol sequence A is mapped to the entire resource A, but in practice, only the remaining area of ​​resource C is excluded from transmission within resource region A. For example, when symbol sequence A consists of {symbol #1, symbol #2, symbol #3, symbol #4}, resource A consists of {resource #1, resource #2, resource #3, resource #4}, and resource B consists of {resource #3, resource #5}, it can be assumed 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 will not be transmitted. Therefore, the UE can receive the symbol sequence {symbol #1, symbol #2, symbol #4} under the following assumption: the symbol sequence {symbol #1, symbol #2, symbol #4} of the remaining resources {resource #1, resource #2, resource #4} in resource A, excluding {resource #3} corresponding to resource C, has been mapped and transmitted. Therefore, the UE can perform a series of subsequent reception operations under the following assumption: the symbol sequence {symbol #1, symbol #2, symbol #4} is mapped to {resource #1, resource #2, resource #4} and transmitted, respectively.

[0082] Figure 3 The wireless protocol structures of a base station and a UE in single-cell, carrier aggregation, and dual-connectivity scenarios are illustrated according to embodiments of the present disclosure.

[0083] See Figure 3 The next-generation mobile communication system's radio protocols consist of the following: NR Service Data Adaptation Protocol (NR SDAP) for User Equipment (UE) and NR base stations (S25, S70), NR Packet Data Convergence Protocol (NR PDCP) (S30, S65), NR Radio Link Control (NR RLC) (S35, S60), and NR Media Access Control (NR MAC) (S40, S55).

[0084] The main functions of NR SDAP (S25, S60) may include some of the following functions:

[0085] - User data transmission function (user plane data transmission)

[0086] - Mapping functionality between QoS flows and data bearers for both uplink and downlink (mapping between QoS flows and DRB for both DL and UL).

[0087] - QoS flow ID tagging functionality in both uplink and downlink (tag QoS flow ID in DL and UL data packets)

[0088] - The function of mapping reflected QoS streams to data bearers of uplink SDAP PDUs (Reflected QoS stream to DRB mapping of UL SDAP PDUs).

[0089] For SDAP layer entities, the UE can receive configuration via RRC messages. This configuration indicates whether to use the SDAP layer entity header or functionality on a per-PDCP layer entity, per-bearer, or per-logical-channel basis. When the SDAP header is configured, the UE can update or reconfigure the mapping information between QoS flows and data bearers in the uplink and downlink, indicated by a 1-bit indicator for NAS reflective QoS configuration and a 1-bit indicator for AS reflective QoS configuration in the SDAP header. The SDAP header may include QoS flow ID information representing QoS. QoS information can be used for data processing priority, scheduling information, etc., to support smooth service.

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

[0091] - Header compression and decompression function (Header compression and decompression: ROHC only)

[0092] - User data transmission function (transmission of user data)

[0093] -- Sequential delivery function (sequential delivery of upper-layer PDUs);

[0094] - Out-of-order delivery function (out-of-order delivery of upper-layer PDUs)

[0095] - Reordering function (reordering received PDCP PDUs)

[0096] - Duplicate detection function (duplicate detection of lower-level SDUs)

[0097] - Retransmission function (retransmission of PDCP SDU)

[0098] - Encryption and decryption functions (encryption and decryption)

[0099] - Timer-based SDU dropping function (timer-based SDU dropping in the uplink)

[0100] The NR PDCP reordering function refers to the function of reordering PDCPPDUs received sequentially from the lower layer based on the PDCP sequence number (SN), and may include the function of transmitting data to the higher layer in the rearranged order. Alternatively, the NR PDCP reordering function may include the function of directly transmitting PDCPs regardless of order, the function of recording lost PDCP PDUs through reordering, the function of reporting the status of lost PDCP PDUs to the transmitting side, and the function of requesting retransmission of lost PDCP PDUs.

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

[0102] - Data transmission function (transmission of upper-layer PDUs)

[0103] -- Sequential delivery function (sequential delivery of upper-layer PDUs);

[0104] - Out-of-order delivery function (out-of-order delivery of upper-layer PDUs)

[0105] - ARQ function (error correction via ARQ)

[0106] - Cascading, splitting, and reassembling functions (connecting, splitting, and reassembling RLC SDUs)

[0107] - Resegmentation function (resegmentation of RLC data RDU);

[0108] - Reordering function (reordering RLC data PDUs)

[0109] - Duplicate detection function (duplicate detection)

[0110] - Error detection function (protocol error detection)

[0111] - RLC SDU discard function (RLC SDU discard)

[0112] - RLC Re-establishment Functionality (RLC Re-establishment)

[0113] The sequential delivery function of an NR RLC entity refers to the function of sequentially delivering RLC SDUs received from a lower layer to a higher layer. This function may include the following: reassembling and transmitting RLC SDUs when an original RLC SDU is received after being split into multiple RLC SDUs; reordering received RLC PDUs based on the RLC sequence number (SN) or PDCP sequence number (SN); recording lost RLC PDUs by reordering them; reporting the status of lost RLC PDUs to the transmitting side; and requesting retransmission of lost RLC PDUs. The sequential delivery function of an NR RLC entity may also include the following: when a lost RLC SDU exists, only RLC SDUs preceding the lost RLC SDU are sequentially delivered to the higher layer; or, when a predetermined timer expires, even if a lost RLC SDU exists, all RLC SDUs received before the timer started are sequentially delivered to the higher layer. Alternatively, the in-order delivery function of the NR RLC entity may include the ability to sequentially deliver all received RLC SDUs to the higher layer when a predetermined timer expires, even in the event of lost RLCSDUs. Furthermore, RLC PDUs can be processed in the order of reception (regardless of the sequence number, but in the order of arrival) and delivered out of order to the PDCP entity. In the case of fragmentation, fragments stored in a buffer or to be received later can be received, reconstructed into a complete RLC PDU, processed, and delivered to the PDCP entity. The NR RLC layer may not include concatenation functionality, which can be implemented in the NR MAC layer or replaced by multiplexing functionality of the NR MAC layer.

[0114] The out-of-order delivery function of the NR RLC entity described above refers to the function of directly transmitting RLC SDUs received from the lower layer out of order to the higher layer. When an original RLC SDU is divided into multiple RLC SDUs and received, the out-of-order delivery function may include the function of reassembling and transmitting multiple RLC SDUs, and includes the function of storing the RLC SN or PDCP SN of the received RLC SDUs, sorting the RLC SN or PDCP SN, and recording the lost RLC SDUs.

[0115] NR MAC (S40, S55) can connect to multiple NR RLC layer entities configured in a UE, and the main functions of NR MAC can include some of the following functions:

[0116] - Mapping function (mapping between logical channels and transport channels)

[0117] - Multiplexing and demultiplexing functions (multiplexing / demultiplexing of MAC SDU)

[0118] - Scheduling information reporting function (Scheduling Information Report)

[0119] - HARQ functionality (error correction via HARQ)

[0120] - Priority handling function between logical channels (priority handling between logical channels of a UE)

[0121] - Functionality for priority handling between UEs (priority handling between dynamically scheduled UEs)

[0122] - MBMS service identification function (MBMS service identification)

[0123] - Transmission format selection function (Transmission format selection)

[0124] - Fill function (Fill)

[0125] The NR PHY layer (S45, S50) can perform functions such as channel decoding and modulation of higher-layer data, conversion of higher-layer data into OFDM symbols for transmission via a radio channel, demodulation and channel decoding of OFDM symbols received via a radio channel, and transmission of these OFDM symbols to higher layers.

[0126] The detailed structure of a radio protocol architecture may vary depending on the carrier (or cell) operation scheme. For example, when a base station transmits data to a UE based on a single carrier (or cell), the base station and UE use a protocol architecture with a single structure at each layer, such as S00. On the other hand, when a base station uses multiple carriers in a single TRP to transmit data to a UE based on carrier aggregation (CA), the base station and UE use a protocol architecture with a single structure up to the RLC layer, but multiplexing the PHY layer through the MAC layer, as in S10. Furthermore, when a base station uses multiple carriers in multiple TRPs to transmit data to a UE based on dual connectivity, the base station and UE use a protocol architecture with a single structure up to the RLC layer, but multiplexing the PHY layer through the MAC layer, as in S20.

[0127] Furthermore, this disclosure describes the above examples through multiple embodiments, but these embodiments are not independent, and one or more embodiments may be applied simultaneously or in combination.

[0128] Embodiments of this disclosure will be described in detail below with reference to the accompanying drawings. In this context, a base station is an entity that performs resource allocation for a UE and can be at least one of a gNode B, eNode B, Node B, base station (BS), radio access unit, base station controller, or node on a network. A terminal may include a user equipment (UE), mobile station (MS), cellular phone, smartphone, computer, or multimedia system capable of performing communication functions. Although this disclosure is described below using a 5G system as an example, embodiments of this disclosure can also be applied to other communication systems with similar technical backgrounds or channel types. For example, it may include LTE or LTE-A mobile communications, as well as mobile communication technologies developed after 5G. Therefore, embodiments of this disclosure can be applied to other communication systems with modifications determined by those skilled in the art without significantly departing from the scope of this disclosure. This disclosure applies to both FDD and TDD systems.

[0129] Furthermore, in describing this disclosure, detailed descriptions of functions or configurations related to this disclosure will be omitted if it is determined that such detailed descriptions would unnecessarily obscure the essential points of this disclosure. Additionally, the following terms are defined with reference to the functions in this disclosure and may be interpreted differently depending on the intent, practice, etc., of the user and operator. Therefore, their definitions should be understood based on the entire contents of this specification.

[0130] In the following description of public information, higher-level signaling may correspond to at least one or a combination of the following signaling types:

[0131] - MIB (Master Message Block)

[0132] - SIB (System Information Block) or SIB X (X=1, 2, ...)

[0133] - RRC (Radio Resource Control)

[0134] - MAC (Media Access Control) CE (Control Element)

[0135] Furthermore, L1 signaling can be signaling corresponding to a signaling method using a physical layer channel or at least one or more combinations of the following signaling methods:

[0136] - PDCCH (Physical Downlink Control Channel)

[0137] - DCI (Downlink Control Information)

[0138] - UE-specific DCI

[0139] - Group Public DCI

[0140] - Public DCI

[0141] - Scheduling DCI (e.g., DCI used to schedule downlink or uplink data)

[0142] - Non-scheduled DCI (e.g., DCI not used for scheduling downlink or uplink data);

[0143] - PUCCH (Physical Uplink Control Channel)

[0144] - UCI (Uplink Control Information)

[0145] Furthermore, in this disclosure, determining the priority between A and B can be mentioned in different ways, such as: selecting the one with higher priority according to a predetermined priority rule and performing the corresponding operation, or omitting or discarding the operation with lower priority, etc.

[0146] Furthermore, this disclosure describes the above examples through multiple embodiments, but these embodiments are not independent, and one or more embodiments may be applied simultaneously or in combination.

[0147] Figure 4a and Figure 4b This is a diagram illustrating repeated transmissions of the Physical Uplink Shared Channel (PUSCH) as an example of providing better coverage or reliability in 5G or 6G communication systems, according to an embodiment.

[0148] Figure 4a An embodiment of PUSCH repetition type A is shown, in which the PUSCH is repeatedly transmitted in each time slot. According to this method, by repeatedly transmitting the same PUSCH, the reliability of data transmission can be guaranteed even in the event of partial data loss.

[0149] Figure 4b An example of PUSCH repetition type B is shown, in which PUSCH is transmitted once repeatedly within a time slot.

[0150] Figure 5 This is a diagram illustrating a copy of the Packet Data Convergence Protocol (PDCP) as an example of providing better coverage or reliability in a 5G or 6G communication system, according to an embodiment.

[0151] Reference Figure 5 PDCP protocol data units (PDUs) generated at the PDCP layer can be sent or forwarded to one or more Radio Link Control (RLC) entities or layers. Specifically, this can correspond to carrier aggregation (CA) (when the same MAC entity exists) or dual-connectivity (DC) replication (when different MAC entities exist). This method can improve the reliability of data transmission and achieve frequency diversity. Figure 5The structure is shown, in which data is copied into two primary and secondary (RLC) copies before being forwarded, and then forwarded to two logical channels (LCH).

[0152] Figure 6 This is a diagram illustrating multiple transmit and receive points (multiple TRPs) associated with PUSCH repetition, based on an example.

[0153] Figure 6 This illustrates the process of two TRPs receiving the same data from the same UE. The UE can use the beam corresponding to TRP A to send a PUSCH containing data to TRP A, and the UE can use the beam corresponding to TRP B to send a PUSCH containing the same data to TRP B. In this case, the reliability of the UE's uplink data transmission can be improved. This can also be applied to different TRPs A and B that send the same downlink data to the UE.

[0154] Figure 7 This is a diagram illustrating low-density parity checking (LDPC) performed at the physical (PHY) layer as a channel decoding process during data transmission according to an embodiment. Figure 8 This is a diagram illustrating the graphic process of selecting LDPC diagrams according to an embodiment.

[0155] See Figure 7 According to an embodiment, a series of processes (700) for processing transport blocks in the physical layer are shown. This example may correspond to a part of a PDSCH transport process or a PUSCH transport process. Furthermore, regarding... Figure 7 For details of the process or procedure, examples of its calculation process, etc., please refer to Clause 5 and subsequent clauses of 3GPP TS 38.212.

[0156] According to embodiments of this disclosure, transport block (TB) 710 may correspond to a transport block received from a higher layer of the physical layer, and the higher layer may be, for example, the media access control (MAC) layer.

[0157] In step 720, a cyclic redundancy check (CRC) append process can be performed on the transport block received from the higher layer for error detection.

[0158] In step 730, after the CRC appending process in step 720, the LDPC basemap selection process can be performed.

[0159] The LDPC graph selection process may include steps such as determining the size or length of the transport block and the code rate. For example... Figure 8 As shown, the LDPC diagram can be specifically divided into LDPC bases. Figure 1 or LDPC base Figure 2The selection process can be carried out by considering various factors related to the communication system, and is usually determined by considering performance, complexity, etc.

[0160] In step 740, a code block (CB) segmentation operation may be performed on the transport block or the transport block with an additional CRC.

[0161] According to one embodiment, the code block segmentation step can be performed in a 5G or 6G communication system, and can be exemplified as a process of segmenting and transmitting a transport block, i.e. a data unit, into multiple code block groups (CBGs) that consist of multiple code blocks, taking into account the data size, in order to improve communication efficiency.

[0162] According to an embodiment, code block segmentation can refer to the process of dividing a transport block into smaller code blocks.

[0163] According to an embodiment, the size or length of the code block can always remain constant, regardless of the number of code blocks, and the size or length can correspond to a bit unit.

[0164] According to the embodiment, all code blocks can be the same size. To this end, specific bits called empty or padding bits can be added to each code block. Empty or padding bits typically correspond to the value 0, but are not necessarily limited to this, and can also consist of any predetermined specific bits. When the value is 0, this can be called zero-padding.

[0165] According to an embodiment, the size or length of the code block can correspond to a predetermined value and can be dynamically allocated or indicated.

[0166] According to the embodiments, the unit or length of the code block group can be fixed or variable.

[0167] In step 740, the code block CRC appending operation can be performed together with the code block segmentation operation.

[0168] According to an embodiment, the code block CRC appending step can be illustrated as a step of appending a CRC to all or part of each of a plurality of code blocks.

[0169] In step 750, a channel decoding process can be performed. In a typical communication system, information transmitted from the transmitting side can be encoded or decoded using forward error correction codes so that the receiving side can correct errors experienced on the channel, and the information will be transmitted. The receiving side can recover the transmitted information by decrypting or decoding the error correction codes after demodulating the received signal. This decryption process can correct errors in the received signal caused by the channel.

[0170] According to an embodiment, the channel decoding process can be performed by an LDPC scheme. The LDPC scheme can be illustrated as an error correction decoding scheme.

[0171] According to embodiments, the boosting in the LDPC scheme is not only used for the efficient design of LDPC codes, but can also refer to methods for generating parity-check matrices of various lengths or generating LDPC codewords using a given base matrix and exponent matrix. That is, the boosting can be applied by setting a Z value to efficiently design very large parity-check matrices, where the Z value determines the size of the cyclic permutation matrix or zero matrix from a given small mother matrix according to specific rules; or it can refer to methods for generating parity-check matrices of various lengths or generating LDPC codewords by applying an appropriate Z value to a given exponent matrix or its corresponding sequence.

[0172] [Table 2] The following can be referred to as the table used to set the lift size Z in the LDPC process.

[0173] [Table 2]

[0174]

[0175] In new communication systems, including 6G systems, to support backward compatibility with existing systems (such as 5G systems), the existing set of boost dimensions can remain unchanged, or a new set of boost dimensions can be added. In step 760, a rate matching process can be performed.

[0176] Rate matching can refer to adjusting the amplitude of a signal while taking into account the amount of resources available for signal transmission. For example, rate matching of a data channel can refer to adjusting the size of the data without mapping and transmitting data channels in specific time and frequency resource areas.

[0177] In step 770, the code block concatenation process can be performed.

[0178] According to an embodiment, the code block concatenation process can be a step of combining multiple code blocks generated in previous processing steps into a data stream.

[0179] According to an embodiment, code block concatenation can be performed in a specific order.

[0180] In step 780, a scrambling process can be performed.

[0181] According to an embodiment, scrambling can be a step of introducing randomness into the transmitted data to ensure uniform power distribution, interference management, data privacy, and accurate channel estimation.

[0182] According to an embodiment, scrambling and descrambling operations can be performed on the transmitting and receiving sides using the same cell-specific scrambling sequence, respectively.

[0183] Figure 9 This is a diagram illustrating the operations or techniques used, according to an embodiment, to generate post-decoded packets related to the Random Linear Network Decoding (RLNC) technique.

[0184] RLNC technology can be exemplified as a network decoding technique. Network decoding can be a method based on information theory used to improve network traffic efficiency. In a conventional network, data packets are routed from the communication source to the destination. In network decoding, data packets from multiple sources can be linearly combined and transmitted at specific intermediate nodes.

[0185] According to an embodiment, RLNC technology can correspond to random linear network decoding technology, which combines data packets by randomly selecting coefficients from a finite field of a specific size.

[0186] For example, RLNC can be a technique used to linearly combine data packets using randomly selected coefficients at all nodes that encode the data packets.

[0187] exist Figure 9 In the embodiment, the decoding coefficient A can correspond to the randomly selected decoding coefficient 910.

[0188] exist Figure 9 In this embodiment, the original data packet X 920 is an existing data packet and may correspond to a data packet to be subjected to RLNC or other decoding processing.

[0189] According to Figure 9 In related embodiments, the decoding coefficients can be selected or configured to be up to akn, such as a11, a12, a13, ..., a1n and a21, a31, ..., ak1, and this configuration can be configured in matrix form.

[0190] Each decoding coefficient (e.g., a11, a12, a21, ...) may have the same number of bits (e.g., m bits), and therefore correspond to having the same size or length. Furthermore, the length of the entire decoding coefficient may correspond to n. m position.

[0191] According to Figure 9 In one related embodiment, existing data groups can be selected or configured as sub-data groups up to xkn, such as x11, x12, x13, ..., x1n and x21, x31, ..., xk1, and this configuration can be configured in matrix form.

[0192] According to an embodiment, existing data packets can be applied by replacing them with transport blocks (TBs).

[0193] According to an embodiment, a transport block may correspond to a transport block in the physical layer process used to send PDSCH or PUSCH.

[0194] According to the embodiments, with Figure 9 The relevant RLNC technology can be applied to transport blocks in the physical layer.

[0195] According to an embodiment, each existing data packet (e.g., x11, x12, x21, ...) can correspond to having the same number of bits (e.g., m bits), and therefore correspond to having the same size or length. Furthermore, the length of the entire existing data packet can correspond to q. m position.

[0196] According to Figure 9 In related embodiments, the length of each decoding coefficient (e.g., a11, a12, a21, ...) and sub-group (e.g., x11, x12, x21, ...) can be configured to be the same m bits.

[0197] exist Figure 9 In this embodiment, the encoded data packet (Y) 930 can correspond to a linear combination of the decoding coefficients 910 and the existing data packet 920.

[0198] According to an embodiment, the encoded data packets can correspond to the matrix product of matrix A and matrix X, and according to... Figure 9 In a related embodiment, the length of the encoded data packet can correspond to q. m position.

[0199] According to an embodiment, a Galois domain (GF) can be used for efficient computation in an RLNC implementation.

[0200] According to an embodiment, in RLNC, data packets can be considered as finite fields (specifically GF(2)). m The vectors on the domain can be used for addition and multiplication operations when performing linear combinations of data groups.

[0201] According to the embodiment, in RLNC, the decoding coefficient a uv (u ∈ {1, 2,..., k} and v ∈ {1, 2,..., n}) can be of size 2 m The data can be selected from the Galois domain, and all sub-data groups can have the same length or size.

[0202] To execute and Figure 7 With the related LDPC technology, all code blocks may require the same bit length.

[0203] To execute Figure 9 As shown in the RLNC technique, all sub-data packets may require the same bit length.

[0204] Please note that all of the above requirements require the same bit length. This disclosure discloses a process for performing RLNC technology on the layer where LDPC is implemented, which corresponds to the existing network decoding technology described or illustrated above.

[0205] According to the embodiments, this reasoning or application method can be partially or fully applied in the existing RLNC decoding steps.

[0206] Figure 10 This illustrates a portion of the overall process of dual decoding of a channel or data according to an embodiment.

[0207] exist Figure 10 In order to describe relevant examples, specific procedures or detailed processes may be omitted.

[0208] exist Figure 10 In this context, process A 1010 can be exemplified as a decoding process in an NR or other communication system. Furthermore, in the case of process A 1010, the encoding or decoding process can be exemplified as being performed once at a specific layer.

[0209] According to an embodiment, a transport block 1011 that has been multiplexed at a higher layer can be transmitted or forwarded to a specific lower layer. This specific lower layer can be exemplified as the physical layer.

[0210] According to an embodiment, the multiplexed transport block 1011 can be divided into one or more code blocks 1012 through a code block segmentation process.

[0211] According to an embodiment, the CRC appending process, etc., can be performed on the multiplexed transport block 1011 before the code block segmentation process is executed.

[0212] The size or length of each of the code blocks 1012 can always be constant, and this size or length can correspond to a bit unit.

[0213] According to an embodiment, code block 1012 can be encoded. The encoding process can be exemplified as a decoding process or a channel decoding process.

[0214] According to an embodiment, the CRC appending process, etc., can be performed before the code block 1012 is encoded.

[0215] According to an embodiment, the decoded code block 1013 can refer to the code block decoded relative to code block 1012. According to an embodiment, LDPC can be implemented as a decoding scheme or technique.

[0216] exist Figure 10 In this context, process B 1020 can be illustrated as an embodiment of this disclosure. Furthermore, in the case of process B 1020, the encoding or decoding process can be illustrated as being performed two or more times at a particular layer.

[0217] According to an embodiment, a transport block 1021 that has already been multiplexed at a higher layer can be transmitted or forwarded to a specific lower layer. According to an embodiment, the specific lower layer can be exemplified as the physical layer.

[0218] According to an embodiment, the transport block 1021 can be divided into one or more code blocks 1022 through a code block segmentation process.

[0219] According to an embodiment, the CRC appending process, etc., can be performed on transport block 1021 before the code block segmentation process is executed.

[0220] Furthermore, the size or length of each of the code blocks 1022 can always be constant, and this size or length can correspond to a bit unit.

[0221] According to an embodiment, a main encoding process can be performed on the segmented code block 1022 so that the encoded code block 1023 can be illustrated.

[0222] According to the embodiments, the main encoding process may correspond to a decoding scheme that applies part or all of the RLNC decoding technology.

[0223] According to an embodiment, the main encoding process can correspond to the process of linearly combining code blocks 1022 using randomly selected coefficients.

[0224] Furthermore, the main coded code block 1023 can correspond to a block that linearly combines randomly selected coefficients with code block 1022.

[0225] According to the embodiments, the main encoding process can be applied to... Figure 9 Part or all of the related process.

[0226] According to an embodiment, the CRC appending process, etc., can be performed before the auxiliary encoding process is performed on the main encoded code block 1023.

[0227] According to an embodiment, the encoding process can also be performed on the main encoding code block 1023.

[0228] The additional encoding process can be illustrated as a secondary encoding process.

[0229] The auxiliary encoding process may correspond to Figure 7 The LDPC decoding scheme shown is illustrated.

[0230] According to an embodiment, the secondary encoding process can be performed on the primary encoding code block 1023. The secondary encoding code block 1024 represents the code block used for secondary encoding of the primary encoding code block 1012. According to an embodiment, LDPC can be implemented as a secondary decoding scheme.

[0231] Figure 11This is a diagram illustrating the physical layer process of a dual decoding scheme according to an embodiment.

[0232] Reference Figure 11 The LDPC graph selection process can be performed in step 1110. The LDPC graph selection process can be a step used to determine the size or length of the transport block size (TBS) and the code rate.

[0233] According to an embodiment, step 1110 may determine the number of source code blocks or the number of code blocks in the main code, taking into account the main code, and may also determine the code rate and transport block size, taking into account the secondary code. The code rate may correspond to the ratio between the number of code blocks in the main code and the number of code blocks in the secondary code. Furthermore, this may correspond to the steps of determining the code block size and the LDPC diagram.

[0234] According to an embodiment, step 1110 may include a parameter or information selection process for determining the transport block size.

[0235] According to an embodiment, step 1110 may correspond to a step performed at a higher level of the physical layer (e.g., the MAC layer).

[0236] According to an embodiment, the transport block size can be determined based on the license size. Factors determining the license size can be based on modulation-decoding scheme (MCS) level, the number of allocated resource blocks (RBs), the number of layers, demodulation reference signal (DMRS) mode, etc.

[0237] According to embodiments, a transport block multiplexing process corresponding to the transport block size can be performed. Furthermore, the transport block multiplexing process can correspond to steps performed at higher levels of the physical layer (e.g., the MAC layer). Figure 11 In step 1120, the transport block may correspond to a transport block on which a multiplexing process has been performed.

[0238] According to an embodiment, since master coding can increase n source code blocks to k encoded code blocks, it may not be possible to map all encoded code blocks to actual physical resources. Therefore, when performing master coding according to embodiments of this disclosure, transport block multiplexing can be performed in advance, taking into account the above situation.

[0239] According to the embodiment, considering that n source code blocks will be increased into k encoded code blocks through encoding, the process of pre-performing transport block multiplexing in consideration of the main encoding can correspond to the process of configuring some resources that need to be reserved in advance.

[0240] According to an embodiment, n and k can be predetermined in step 1110. Furthermore, n and k can correspond to parameters used to determine the transport block size in step 1110.

[0241] In step 1120, transport blocks that have been multiplexed to a higher layer (e.g., the MAC layer) can be forwarded to a lower layer (e.g., the physical layer).

[0242] After the CRC appending process is performed in step 1130, subsequent steps can be performed at a lower layer (e.g., the physical layer).

[0243] In step 1130, a CRC appending process may be performed on the transport block transmitted in step 1120.

[0244] In step 1140, a block segmentation step may be performed on the transport block or the transport block with an attached CRC. Although in communication systems such as 5G NR, the block segmentation step (step 1140) can usually be performed together with the block CRC attachment step (step 1160), embodiments of this disclosure may perform the main coding step (step 1150) after separately performing the block segmentation step (step 1140) and the block CRC attachment step (step 1160).

[0245] In step 1150, the main encoding step can be performed, followed by the code block CRC appending step (step 1160).

[0246] Step 1140 may correspond to the process of dividing a data unit called a transport block into a block group (CBG) or multiple blocks of code to improve communication efficiency.

[0247] According to an embodiment, step 1140 can be performed based on the transport block length.

[0248] According to an embodiment, step 1140 can be performed based on the transport block length, rather than based on the total length or size as the sum of MAC PDUs.

[0249] Regardless of the number of code blocks, the size or length of the code blocks can always be constant, and the size or length can correspond to a bit unit.

[0250] According to an embodiment, the main encoding process (step 1150) can correspond to the process of linearly combining the segmented code blocks by using a code block segmentation process (step 1140) with randomly selected coefficients.

[0251] According to an embodiment, the main encoding process (step 1150) can be applied as a decoding technique capable of generating decoded code blocks from source code blocks and providing error detection functionality for each code block. Furthermore, according to an embodiment, when a portion of the decoded code blocks experiences a CRC error (e.g., when error correction is performed via secondary encoding, but the decoded code blocks fail to be successfully decoded), the main encoding process (step 1150) can correspond to a process that provides full recovery of the source code blocks.

[0252] According to an embodiment, the main encoding process (step 1150) can be performed based on a preset value. The preset value can correspond to at least one of the number of code blocks including one or more MAC PDUs as source code blocks (e.g., n) or the number of code blocks decoded during decoding (e.g., k). According to an embodiment, the preset value can include the decoding coefficients (e.g., a) described in the previous examples. uv In addition, preset values ​​may include coefficients, random coefficients, or matrices containing these coefficients for linear combination operations in the main encoding process.

[0253] According to the embodiment, once the value of k is determined, the value of n can be determined using a link adaptive algorithm, etc. The link adaptive algorithm can correspond to techniques for adjusting various parameters based on changes in communication channel quality, and can correspond to adjusting the MCS level based on HARQ feedback or Channel Quality Indicator (CQI) feedback.

[0254] According to embodiments, by taking into account the requirements of the secondary coding process (step 1170) (e.g., conditions such as the code blocks should have the same length or size), specific bits, such as padding bits, empty bits, or filler bits, can be added before or after the main coding process. According to embodiments, the process of adding bits such as padding bits, empty bits, or filler bits can be omitted before the main coding process. This omission can be illustrated by examples where, for instance, the parameter for the transport block length is determined in a previous step to meet coding requirements (such as the code blocks should have the same length), and empty bits or padding bits are not added according to embodiments of this disclosure before the main coding process.

[0255] According to an embodiment, the main encoding process (step 1150) can be applied as a decoding technique that allows some or all of the RLNC decoding techniques to be applied at the physical layer.

[0256] In step 1160, the code block CRC appending step can be performed on the code block that has already been master-decoded.

[0257] In step 1170, an auxiliary encoding process can be performed on the code block that has been master-decoded or the code block that has been appended with CRC.

[0258] According to an embodiment, the auxiliary encoding process (step 1170) can be a decoding technique that adds parity bits to each code block to provide error correction for error bits in the code block.

[0259] According to an embodiment, the auxiliary encoding process (step 1170) can be performed using the LDPC scheme. The LDPC scheme can be illustrated as an error correction decoding scheme.

[0260] In step 1180, a rate matching process may be performed.

[0261] In step 1190, the code block concatenation process can be performed.

[0262] According to an embodiment, the code block concatenation process (step 1190) may be a step of combining multiple code blocks generated in previous processing steps into a data stream.

[0263] Furthermore, code block concatenation can be performed in a specific order.

[0264] In addition, a scrambling process can be performed.

[0265] Figure 12 This is a diagram illustrating a transport block multiplexing process performed according to an embodiment, taking into account the decoding process according to an embodiment of this disclosure.

[0266] Reference Figure 12 In step 1210, the MAC protocol data unit (PDU) may include part or all of the data units related to higher layers, RLC sequence number (SN), header, MAC logical channel ID (LCID) related information, and payload, etc.

[0267] According to an embodiment, a transport block multiplexing process corresponding to the transport block size can be executed. Furthermore, the transport block multiplexing process can correspond to a program executed at a higher level of the physical layer (e.g., the MAC layer).

[0268] exist Figure 12 In steps 1210 and 1220, considering that n source code blocks will be increased into k encoded code blocks through encoding, the process of performing transport block multiplexing with consideration of the main encoding can be configured to reserve some resources in advance.

[0269] According to an embodiment, some resources can be reserved in advance by considering the length or size of the encoded code block based on the license size, and then the transport block multiplexing process can be performed on the remaining resources.

[0270] exist Figure 12 In this context, the length of the transport block, based on the authorized size, can be exemplified as B, while the size or length of the remaining resources after reserving some resources can be exemplified as B'. According to an embodiment, B' may correspond to the length of the transport block including the actual MACPDU.

[0271] In step 1210, the transport block multiplexing process can be performed on the MAC PDU.

[0272] According to an embodiment, the transport block size of the transport block multiplexing operation can correspond to B', and transport block multiplexing can be performed up to the maximum size B'.

[0273] In step 1220, a code block segmentation step may be performed on the transport block or the transport block with CRC attached.

[0274] In step 1230, a transmission block of length B' can be divided into n code blocks.

[0275] Figure 13 This is a diagram illustrating the CRC appending and padding bit insertion process performed on the decoded code block after the main encoding process, according to an embodiment.

[0276] See Figure 13 In step 1310, the length of the transport block based on the authorized size can be exemplified as B, while the size or length of the remaining resources after reserving a portion of the resources can be exemplified as B'. According to an embodiment, B' may correspond to the length of the transport block including the actual MAC PDU. Furthermore, the transport block may include a CRC.

[0277] In step 1310, a code block segmentation step may be performed on the transport block or the transport block with CRC attached.

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

[0279] According to an embodiment, the main encoding process can be performed in step 1330.

[0280] Furthermore, step 1330 illustrates a main coded block generated by linearly combining n code blocks using coefficients or a coefficient matrix.

[0281] The example in step 1340 illustrates the k code blocks of the main code.

[0282] In step 1340, specific positions, such as padding bits, may be added or inserted during the CRC appending process, taking into account the requirements of the auxiliary coding process (e.g., the code blocks should have the same length or size).

[0283] According to an embodiment, in step 1350, a code block of a main code can be illustrated.

[0284] According to an embodiment, the code block of a master code may include at least one of the following: a portion 1351 of a MAC PDU of length K'-L, a CRC of length L, and padding bits 1353 of length K-K'. According to an embodiment, the number of padding bits 1353 may be increased based on LDPC.

[0285] According to an embodiment, the authorized size may correspond to a value obtained by multiplying the size or length of the transport block or the transport block with an attached CRC by a value (k / n), or may be close to that product value, or may have some error within an allowable range.

[0286] Figure 14 The diagram illustrates the process according to an embodiment for the purpose of demonstrating the decoding process, in which a main encoding process 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.

[0287] According to an embodiment, code block group HARQ can refer to a scheme for performing HARQ, i.e., retransmission request, on each code block group.

[0288] Figure 14 This is a diagram used to describe the decoding process of the main encoding. Therefore, the auxiliary encoding or decoding process can be omitted.

[0289] According to an embodiment, in 1410, which may correspond to an authorized size, at least one of a transport block, resources reserved for some portions, and a CRC may be included. The transport block may correspond to a transport block that includes an actual MAC PDU.

[0290] In 1420, it can be illustrated that when HARQ is applied to each block group (CBG) consisting of one or more code blocks, master coding can be performed on all block groups. Therefore, in 1420, the number of code blocks can be illustrated as k, and the number of block groups can also be illustrated as m.

[0291] According to an embodiment, n can be exemplified as the number of source code blocks obtained by segmenting the transport block, while k can be exemplified as the number of code blocks for main coding.

[0292] In 1430, independent of 1420, when the code block group HARQ, i.e., HARQ is not performed per code block group, all code blocks that are primary encoded for 1410 can be exemplified as a code block group CBG0.

[0293] According to an embodiment, as shown in 1420, when HARQ is applied to a block group on the transmitting side, if master coding is performed on all blocks (e.g., all source blocks or all block groups), the receiving side can determine the decoding result as OK or NOK based on the conditions illustrated by the decoding example below.

[0294] - "OK": When the number of code blocks with CRC errors in each received decoded code block is less than or equal to (k - n), and the receiver successfully decodes n source code blocks from n decoded code blocks with CRC OK, the receiving side can determine the decoding result of the transmission block as "OK". In this case, the HARQ feedback can be determined as "ACK".

[0295] - "NOK": When the number of code blocks with CRC errors in each received decoded code block is greater than (k-n), the decoding result associated with the state of the code block group (CBG) to which the decoded code blocks with CRC errors belong can be determined as "NOK". In this case, the HARQ feedback can be determined as "negative acknowledgment (ACK)".

[0296] According to the embodiment, the example of 1420 can also be illustrated by a single PDSCH in a non-CA, DC, or mTRP scenario.

[0297] According to an embodiment, as shown in 1430, when no code block group HARQ is applied on the transmitting side, if master coding is performed on all code blocks (e.g., all source code blocks or all code block groups), the receiving side can determine the decoding result as OK or NOK based on the conditions illustrated by the decoding example below.

[0298] - "OK": When the number of code blocks with CRC errors in each received decoded code block is less than or equal to (k - n), and the receiver successfully decodes n source code blocks from n decoded code blocks with CRC OK, the receiving side can determine the decoding result of the transmission block as "OK". In this case, the HARQ feedback can be determined as "(ACK)".

[0299] - "NOK": When the number of code blocks with CRC errors in each received decoded code block is greater than (k-n), the decoding result of the transport block can be determined as "NOK". In this case, the HARQ feedback can be determined as "(NACK)".

[0300] According to the embodiment, the example of 1430 can also be illustrated by a single PDSCH in a non-CA, DC, or mTRP scenario.

[0301] Figure 15 The diagrams illustrating the decoding process according to the embodiments are shown for illustrative purposes, wherein a main encoding process is performed on some code blocks or some code block groups when applying code block group HARQ.

[0302] Figure 15 A diagram is shown to describe the decoding process used for the main encoding. Therefore, the secondary encoding or decoding process can be omitted.

[0303] According to an embodiment, in 1510, which may correspond to an authorized size, it may include at least one of a transport block, resources reserved for a specific portion, and a CRC. The transport block may correspond to a transport block that includes an actual MAC PDU.

[0304] According to an embodiment, in 1520, when HARQ is applied to each block group (CBG) consisting of one or more code blocks, this can be illustrated by source code blocks belonging to certain block groups before the main encoding of the respective group. Therefore, in 1520, the number of code blocks can be illustrated as n, where the number of code blocks belonging to the block group (CBG) to which the main encoding is performed can be illustrated as n'. (Refer to...) Figure 15 , n' can be illustrated as 2.

[0305] In 1530, the number of code blocks for which primary coding is performed can be illustrated as m, while the number of code blocks belonging to code blocks that have already undergone primary coding can be illustrated as k'. (See reference...) Figure 15 k' can be illustrated as 3.

[0306] According to an embodiment, when in such Figure 15 When the transmitting side applies block group HARQ as shown, if master encoding is performed on some blocks (e.g., some source blocks or some block groups), the receiving side can determine the decoding result as OK or NOK based on the conditions illustrated in the following decoding example.

[0307] - "OK": When the number of code blocks with CRC errors in the decoded 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 from n' decoded code blocks with CRC OK, the receiving side can determine the decoding result of the corresponding code block group as "OK". In this case, the HARQ feedback can be determined as "(ACK)".

[0308] - "NOK": When the number of code blocks with CRC errors in the decoded 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)".

[0309] According to an embodiment, Figure 15 Examples can also be illustrated using a single PDSCH in non-CA, DC, or mTRP scenarios.

[0310] Figure 16The diagram illustrates the process according to an embodiment for the purpose of illustrating the decoding process in a CA, DC, or mTRP environment with multiple PDSCHs, wherein master encoding is performed on all code blocks when code block group HARQ is not applied.

[0311] According to an embodiment, the receiving side can perform a decoding procedure by combining the encoded code blocks received from TRP A and TRP B.

[0312] According to embodiments, in 1611 and 1621, which may correspond to authorized sizes, at least one of a transport block, resources reserved for some portions, and a CRC may be included. The transport block may correspond to a transport block that includes an actual MAC PDU.

[0313] Furthermore, when the code block group HARQ, i.e., HARQ is not performed separately in TRP A and TRP B for each code block group, for each of all code blocks on which the main coding is performed on 1611 and 1621, 1612 and 1622 can be illustrated as code block group CBG0 (CBG0 on the TRP A side, CBG0 on the TRP B side).

[0314] Reference Figure 16 1612 can correspond to a code block that has already been master-coded in TRP A, and the number of code blocks can be illustrated by k. A .

[0315] Furthermore, 1622 can correspond to a decoded code block that has already been master-coded in TRP B, and its number can be illustrated as k. B .

[0316] Reference Figure 16 1613 and 1623 can be illustrated as source blocks prior to the main encoding in TRP A and TRP B, respectively.

[0317] Reference Figure 16 1613 can correspond to the source code block that is primarily encoded in TRP A, and its number can be illustrated by the example as n. A .

[0318] Furthermore, 1623 can correspond to the source code block before the main encoding is performed in TRP B, and the number of source code blocks can be illustrated as n. B .

[0319] According to the embodiment, the main code can be applied to n A + n B It can correspond to the entire source code block of the transport blocks of TRP A and TRP B, that is, it applies to the whole.

[0320] According to an embodiment, the decoding process or operation can be performed collaboratively (e.g., between TRP A and TRP B) rather than decoding the physical channels transmitted in each TRP separately.

[0321] According to the embodiments, the length or number of transport blocks, CRCs, or reserved resources illustrated in examples 1611 and 1621 may differ.

[0322] According to the embodiments, the number of code blocks decoded in the examples illustrated in 1612 and 1622 may be different.

[0323] According to the embodiments, the code blocks (source code blocks) illustrated in examples 1613 and 1623 may have the same length or size.

[0324] According to the embodiments, the number of code blocks decoded in the examples illustrated in 1613 and 1623 may be different.

[0325] According to the embodiments, such as Figure 16 As shown, when performing master encoding on TRP A and TRP B, the receiving side can determine whether the decoding result is OK or NOK based on the decoding result under the conditions described in the following example.

[0326] - "OK": When the number of CRC errors in each received decoded code block is less than or equal to {(k A + k B ) - (n A + n B When the decoding result is "OK", the HARQ feedback can be determined as "(ACK)".

[0327] - "NOK": When the number of CRC errors in each received decoded code block is greater than {(k A +k B ) - (n A + n B When the decoding result is "NOK", the HARQ feedback can be determined as "(NACK)".

[0328] Figure 16 An example is shown where master encoding is performed on all code blocks without the application of code block group HARQ to illustrate the decoding process in a CA, DC, or mTRP environment with multiple PDSCHs. However, the decoding process can also be illustrated even when code block group HARQ is applied.

[0329] According to an embodiment, when HARQ is applied to code block groups on the transmitting side TRP A and TRP B, if master encoding is performed on all code blocks (e.g., all source code blocks or all code block groups), the receiving side can determine the decoding result as OK or NOK based on the conditions illustrated by the decoding example below.

[0330] - "OK": When the number of CRC errors in each received decoded code block is less than or equal to {(k A + k B ) - (n A + n B When )}, the decoding result can be determined as "OK". In this case, the HARQ feedback can be determined as "(ACK)".

[0331] - "NOK": When the number of CRC errors in each received decoded code block is greater than {(k A +k B ) - (n A + n B When the decoded block has a CRC error, the decoding result related to the state of the block group (CBG) to which it belongs can be determined as "NOK". In this case, the HARQ feedback can be determined as "(NACK)".

[0332] According to an embodiment, specifically, when HARQ of code block groups is applied on the transmitting side TRP A and TRP B, if master encoding is performed on all code blocks (e.g., some source code blocks or some code block groups), the receiving side can determine the decoding result of the corresponding code block group as OK or NOK based on the conditions illustrated by the decoding example below.

[0333] - "OK": When the number of code blocks with CRC errors in the decoded code blocks within the received decoded code blocks is less than or equal to {(k A '+ k B ') - (n A ' + n B When ')}, the decoding result of the corresponding code block can be determined as "OK". In this case, the HARQ feedback can be determined as "(ACK)".

[0334] - "NOK": When the number of code blocks with CRC errors in the decoded code blocks within the received decoded code blocks is greater than {(k A '+ k B ') - (n A ' + n BWhen the code block with a CRC error is decoded, the decoding result of the code block group to which the code block belongs can be determined as 'NOK'. In this case, the HARQ feedback can be determined as "Negative Response (NACK)".

[0335] According to embodiments of this disclosure, the number of code blocks belonging to the code block group (CBG) performing main coding can be illustrated as n. A 'or n B ', and the number of code blocks belonging to the code block group that has been master-coded can be illustrated by k. A 'or k B '.

[0336] Figure 4 and Figure 5 The resource efficiency of the PUSCH repeating technique, PDCP replication technique, and network decoding scheme illustrated in the examples is compared with an embodiment of this disclosure.

[0337] According to an embodiment, under the condition of allowing a certain error within an acceptable range, resource efficiency can be calculated as "the amount of source data transmitted / (the amount of source data transmitted + the amount of data repeated or copied)".

[0338] According to an embodiment, for the PUSCH repetition technique, resource efficiency can be calculated as 1 / r based on the repetition count r (r > 1).

[0339] According to the embodiment, for the PDCP replication scheme, data can usually be forwarded to two RLC layers through data replication at the PDCP layer, so the resource efficiency can be calculated as 1 / 2.

[0340] According to an embodiment, network decoding at the PDCP layer, exemplified as a network decoding technology, can be calculated to have a resource efficiency of [missing information]. / The above. This can be illustrated by an example of the number of source PDCP PDUs, and This can also be illustrated by an example of the number of PDCP PDUs decoded.

[0341] According to an embodiment, the double decoding technique performed at the physical layer can be calculated as n / k. Assuming n < k, n can be illustrated by the number of source code blocks, and k can also be illustrated by the number of decoded code blocks. When comparing the various resource efficiencies calculated above, it can be determined that the double decoding technique performed at the physical layer has the highest resource efficiency.

[0342] Furthermore, according to the embodiments, resource efficiency can be considered as a different indicator than “(actual information bit length) / (decoded codeword length)”, which can correspond to code rate or decoding rate.

[0343] Figure 17 The structure of a terminal in a wireless communication system according to an embodiment is shown.

[0344] Reference Figure 17 According to one embodiment of the present disclosure, a terminal 1700 may be configured to include a controller 1701, a transceiver 1702, and a memory 1703. In this disclosure, the controller 1701 of the terminal 1700 may be defined as a circuit, an application-specific integrated circuit, or at least one processor.

[0345] The controller 1701 can control the overall operation of the terminal 1700 according to one embodiment of the present disclosure. For example, the controller 1701 can control the signal flow between the modules to perform operations according to the above figures (or flowcharts).

[0346] Transceiver 1702 can transmit and receive signals. For example, transceiver 1702 can transmit signals to a node or base station and receive signals from the node or base station according to one embodiment of this disclosure.

[0347] Transceiver 1702 may include a baseband processing unit or perform the same function. For example, the baseband processing unit may perform conversion between baseband signals and bit streams according to the system's physical layer specifications. For instance, during data transmission, the baseband processing unit may encode and modulate the transmitted bit string to generate complex symbols. Furthermore, during data reception, the baseband processing unit may demodulate and decode the baseband signal to recover the received bit string. Additionally, the baseband processing unit may be included within controller 1701, may be included separately within a terminal, or may be replaced by other devices with the same functionality.

[0348] The memory 1703 can store at least one of the information transmitted and received by the transceiver 1702 and the information generated by the controller 1701. Furthermore, the memory 1703 can be defined as a storage unit.

[0349] Figure 18 The structure of a base station in a wireless communication system according to an embodiment is shown.

[0350] Reference Figure 18 According to one embodiment of the present disclosure, a base station 1800 may be configured to include a controller 1801, a transceiver 1802, and a memory 1803. In this disclosure, the controller 1801 of the base station 1800 may be defined as a circuit, an application-specific integrated circuit, or at least one processor.

[0351] According to one embodiment presented in this disclosure, controller 1801 can control the overall operation of the base station. For example, controller 1801 can control the signal flow between modules to perform operations according to the above-described figures (or flowchart).

[0352] Transceiver 1802 can send and receive signals. For example, transceiver 1802 can send signals to a terminal or node and receive signals from the terminal or node according to one embodiment of this disclosure.

[0353] Transceiver 1802 may include a baseband processing unit or perform the same function. For example, the baseband processing unit may perform conversion between baseband signals and bit streams according to the system's physical layer specifications. For instance, during data transmission, the baseband processing unit may encode and modulate the transmitted bit string to generate complex symbols. Furthermore, during data reception, the baseband processing unit may demodulate and decode the baseband signal to recover the received bit string. Additionally, the baseband processing unit may be included within controller 1801, may be included separately within the base station, or may be replaced by other devices with the same functionality.

[0354] The memory 1803 can store at least one of the information transmitted and received by the transceiver 1802 and the information generated by the controller 1801. Furthermore, the memory 1803 can be defined as a storage unit.

[0355] Furthermore, the embodiments disclosed above can be executed by terminal 1700 or base station 1800.

[0356] The methods described in the embodiments according to the specification or claims of this disclosure can be implemented in hardware, software, or a combination of hardware and software.

[0357] When implemented in software, a computer-readable storage medium may be provided for storing one or more programs (e.g., software modules). The one or more programs stored in the computer-readable storage medium may be configured to be executed by one or more processors within an electronic device. The one or more programs include instructions that enable the electronic device to perform methods according to the embodiments described in the claims or specification of this disclosure.

[0358] Such programs (software modules, software) may be stored in random access memory, including non-volatile memory such as flash memory, read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), disk storage devices, compact disc ROM (CD-ROM), digital versatile disc (DVD), any other form of optical storage device, and magnetic tape. Alternatively, such programs may be stored in a memory consisting of all or part of them. Furthermore, each storage component may be in multiple forms.

[0359] Furthermore, the program can be stored in an attachable storage device, which can be accessed via a communication network such as the Internet, intranet, local area network (LAN), wide area network (WLAN), and storage area network (SAN), or a combination thereof. Such storage devices can be connected to a device executing embodiments of this disclosure via an external port.

[0360] Furthermore, a separate storage device on the communication network can be connected to the device executing embodiments of this disclosure.

[0361] In the specific embodiments of this disclosure described above, components included in this disclosure are represented in a singular or plural form according to specific embodiments of this disclosure. However, for ease of description, the singular or plural expression is appropriately chosen based on the presented context, and this disclosure is not limited to singular or plural components, and even if a component is represented in a plural form, it may be configured in a singular form, or even if a component is represented in a singular form, it may be configured in a plural form.

[0362] Furthermore, the embodiments disclosed in the specification and accompanying drawings are merely specific examples provided to facilitate the description of the technical content of this disclosure and to promote understanding of this disclosure, and are not intended to limit the scope of this disclosure. That is to say, it will be apparent to those skilled in the art that other modifications can be made based on the technical spirit of this disclosure.

[0363] Furthermore, each embodiment can be combined with the others and operated as needed.

[0364] Furthermore, the order of description in the accompanying drawings illustrating the methods of this disclosure does not necessarily correspond to the order of execution, and the priority order can be changed or executed in parallel.

[0365] Alternatively, the accompanying drawings used to describe the methods of this disclosure may omit certain components and include only a portion of the components without departing from the essence of this disclosure.

[0366] Furthermore, the methods of this disclosure can be performed by combining some or all of the contents included in the various embodiments without departing from the essence of this disclosure.

[0367] Furthermore, the embodiments disclosed in the specification and accompanying drawings are merely specific examples provided to facilitate the description of the technical content of this disclosure and to promote understanding of this disclosure, and are not intended to limit the scope of this disclosure. That is, it will be apparent to those skilled in the art that other modifications can be made based on the technical spirit of this disclosure. Moreover, each embodiment can be combined with each other and operated as needed. For example, all embodiments of this disclosure can be operated by combining their parts with each other.

Claims

1. A channel decoding method performed by a transmitting / receiving device in a wireless communication system, the method comprising: A Cyclic Redundancy Check (CRC) code is appended to the transport block used for data transmission; The transmission block with the CRC code appended is divided into one or more code blocks; Perform main encoding on one or more code blocks; and Perform secondary encoding on one or more primary encoded code blocks. The primary and secondary coding are executed at the physical layer.

2. The channel decoding method according to claim 1, wherein, The master code is a linear combination of one or more arbitrary coefficients and one or more code blocks.

3. The channel decoding method according to claim 1, wherein, The size of the transport block is determined with reference to the main coding.

4. The channel decoding method according to claim 1, wherein, The auxiliary code includes: Append the CRC code to one or more main code blocks; and Perform secondary coding on one or more main coding blocks with additional CRC codes.

5. The channel decoding method according to claim 1, wherein, The main code is executed on all or part of one or more code blocks.

6. The channel decoding method according to claim 1, wherein, The transmitting / receiving device includes at least one of a terminal and a base station, and The primary code is random linear network decoding (RLNC), and the secondary code is low-density parity check (LDPC).

7. The channel decoding method according to claim 1, wherein, Additional CRC codes include: Select a low-density parity-check (LDCP) plot to determine parameters related to the size of the transport block; and CRC codes are appended to the transport blocks used for data transmission. The parameters include at least one of the following: the number of one or more code blocks, the number of one or more main coded code blocks, the code rate, and the size of the transport block.

8. A transmitting / receiving device in a wireless communication system, the transmitting / receiving device comprising: transceiver; and The processor, coupled to the transceiver, is configured as follows: A Cyclic Redundancy Check (CRC) code is appended to the transport block used for data transmission; The transmission block with the CRC code appended is divided into one or more code blocks; Perform main encoding on one or more code blocks; and Perform secondary encoding on one or more primary encoded code blocks. The primary and secondary coding are executed at the physical layer.

9. The transmitting / receiving device according to claim 8, wherein, The master code is a linear combination of one or more arbitrary coefficients and one or more code blocks.

10. The transmitting / receiving device according to claim 8, wherein, The size of the transport block is determined with reference to the main coding.

11. The transmitting / receiving device according to claim 8, wherein, The processing is also configured as follows: Append the CRC code to one or more main code blocks; and Perform secondary coding on one or more main coding blocks with additional CRC codes.

12. The transmitting / receiving device according to claim 8, wherein, The main code is executed on all or part of one or more code blocks.

13. The transmitting / receiving device according to claim 8, wherein, The transmitting / receiving device includes at least one of a terminal and a base station.

14. The transmitting / receiving device according to claim 8, wherein, The processor is also configured as follows: Select a low-density parity-check (LDCP) plot to determine parameters related to the size of the transport block; and CRC codes are appended to the transport blocks used for data transmission. The parameters include at least one of the following: the number of one or more code blocks, the number of one or more main coded code blocks, the code rate, and the size of the transport block.

15. The transmitting / receiving device according to claim 8, wherein, The primary code is random linear network decoding (RLNC), and the secondary code is low-density parity check (LDPC).

Images