Method and apparatus for encoding and decoding using CRC bits in wireless communication system

Abstract

The present disclosure relates to a 5G communication system or a 6G communication system for supporting higher data rates beyond 4G communication systems such as Long Term Evolution (LTE). A method performed by a transmitting node in a wireless communication system may include encoding a plurality of information bits using a plurality of cyclic redundancy check (CRC) bits, interleaving the plurality of information bits and the plurality of CRC bits using an interleaving pattern, generating a codeword by convolutional encoding and polarization encoding the interleaved plurality of information bits and the interleaved plurality of CRC bits, and transmitting the codeword to a receiving node. The interleaving pattern may correspond to a matrix generated based on a size of the plurality of information bits and a size of the plurality of CRC bits.

Description

Technical Field

[0001] The present disclosure relates to a wireless communication system (or a mobile communication system). Specifically, the present disclosure relates to a method for encoding and decoding using cyclic redundancy check (CRC) bits. Background Art

[0002] Wireless communication has evolved generation by generation, and these technologies have been mainly developed for human-targeted services such as voice calls, multimedia services, and data services. With the commercialization of the 5G (fifth generation) communication system, the number of connected devices is expected to grow exponentially. More and more of these devices will be connected to the communication network. Examples of connected things can include vehicles, robots, drones, household appliances, displays, smart sensors connected to various infrastructures, construction machines, and factory equipment. Mobile devices are expected to evolve in various forms such as augmented reality glasses, virtual reality headsets, and holographic devices. In the 6G (sixth generation) era, in order to provide various services by connecting hundreds of billions of devices and things, efforts have been made to develop an improved 6G communication system. For these reasons, the 6G communication system is called the ultra 5G system.

[0003] The 6G communication system, which is expected to be commercialized around 2030, will have a peak data rate of trillions (1000 gigabits) of bits per second (bps) and a radio latency of less than 100 μsec, and thus the speed will be 50 times that of the 5G communication system, and the radio latency will be 1 / 10 of it.

[0004] To achieve such a high data rate and ultra-low latency, it has been considered to implement the 6G communication system in the terahertz (THz) band (e.g., the 95 gigahertz (GHz) to 3 THz band). It is expected that since the path loss and atmospheric absorption in the terahertz band are more severe than those in the millimeter wave band introduced in 5G, technologies capable of ensuring the signal transmission distance (i.e., the coverage range) will become more critical. As the main technology for ensuring the coverage range, it is necessary to develop radio frequency (RF) components, antennas, and new waveforms with better coverage than orthogonal frequency division multiplexing (OFDM), beamforming, and massive multiple input multiple output (MIMO), full-dimensional MIMO (FD-MIMO), array antennas, and multi-antenna transmission technologies such as massive antennas. In addition, new technologies for improving the coverage range of terahertz band signals, such as metasurface-based lenses and antennas, orbital angular momentum (OAM), and reconfigurable intelligent surfaces (RIS), have been discussed.

[0005] In addition, in order to improve spectral efficiency and overall network performance, the following technologies have been developed for 6G communication systems: full-duplex technology that enables uplink transmission and downlink transmission to simultaneously use the same frequency resources; network technologies that integrally utilize satellites, high-altitude platform stations (HAPS), etc.; improved network architectures that support mobile base stations, etc. and enable network operation optimization and automation, etc.; dynamic spectrum sharing technology based on prediction of spectrum usage and via conflict avoidance; use of artificial intelligence (AI) in wireless communication to improve overall network operation by leveraging AI from the design phase of developing 6G and internalizing end-to-end AI support functions; and next-generation distributed computing technology to overcome the limitations of UE computing capabilities through ultra-high-performance communication and computing resources (such as mobile edge computing (MEC), cloud, etc.) reachable over the network. In addition, attempts are continuing to strengthen connections between devices, optimize the network, promote softwareization of network entities, and increase the openness of wireless communication by designing new protocols to be used in 6G communication systems, developing mechanisms for implementing hardware-based secure environments and secure use of data, and developing technologies for maintaining privacy.

[0006] Research and development of 6G communication systems in hyper-connectivity (including person-to-machine (P2M) and machine-to-machine (M2M)) are expected to bring the next hyper-connectivity experience. In particular, services such as truly immersive extended reality (XR), high-fidelity mobile holograms, and digital replicas are expected to be provided through 6G communication systems. In addition, services such as remote surgery, industrial automation, and emergency response for security and reliability enhancement will be provided through 6G communication systems, enabling these technologies to be applied to various fields such as industry, healthcare, automotive, and household appliances. Summary of the Invention

[0007] Solution to the Problem

[0008] According to an embodiment of the present disclosure, a method performed by a transmitting node in a wireless communication system may include encoding a plurality of information bits using a plurality of cyclic redundancy check (CRC) bits, interleaving the plurality of information bits and the plurality of CRC bits using an interleaving pattern, generating a codeword by performing convolutional coding and polar coding on the interleaved plurality of information bits and the interleaved plurality of CRC bits, and transmitting the codeword to a receiving node. The interleaving pattern may correspond to a matrix generated based on the sizes of the plurality of information bits and the plurality of CRC bits.

[0009] According to an embodiment of the present disclosure, a transmitting node in a wireless communication system may include a transceiver and a controller. The controller may be configured to encode a plurality of information bits using a plurality of CRC bits, interleave the plurality of information bits and the plurality of CRC bits using an interleaving pattern, generate a codeword by performing convolutional coding and polar coding on the interleaved plurality of information bits and the interleaved plurality of CRC bits, and transmit the codeword to a receiving node. The interleaving pattern may correspond to a matrix generated based on the sizes of the plurality of information bits and the plurality of CRC bits.

[0010] According to an embodiment of the present disclosure, a method performed by a receiving node in a wireless communication system may include receiving, from a transmitting node, a codeword including a plurality of information bits and a plurality of CRC bits, and decoding the plurality of CRC bits included in the received codeword and interleaved using an interleaving pattern. The plurality of information bits and the plurality of CRC bits may be interleaved using the interleaving pattern. The interleaving pattern may correspond to a matrix generated based on the sizes of the plurality of information bits and the plurality of CRC bits.

[0011] According to an embodiment of the present disclosure, a receiving node in a wireless communication system may include a transceiver and a controller. The controller may be configured to receive, from a transmitting node, a codeword including a plurality of information bits and a plurality of CRC bits, and decode the plurality of CRC bits included in the received codeword and interleaved using an interleaving pattern. The plurality of information bits and the plurality of CRC bits may be interleaved using the interleaving pattern. The interleaving pattern may correspond to a matrix generated based on the sizes of the plurality of information bits and the plurality of CRC bits. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] To more fully understand the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:

[0013] Figure 1 A wireless communication system according to an embodiment of the present disclosure is shown;

[0014] Figure 2 The structure of a terminal according to an embodiment of the present disclosure is shown;

[0015] Figure 3 The structure of a base station according to an embodiment of the present disclosure is shown;

[0016] Figure 4 Polarization-adjusted convolution (PAC) encoding and decoding according to an embodiment of the present disclosure is shown;

[0017] Figure 5 Shown according to an embodiment of the present disclosure Figure 4 The encoding and decoding shown;

[0018] Figure 6Shows a decoding method based on a search tree scheme according to an embodiment of the present disclosure;

[0019] Figure 7A Shows a transmitting node that encodes based on a PAC encoding and decoding scheme and a receiving node that decodes based on a PAC encoding and decoding scheme according to an embodiment of the present disclosure;

[0020] Figure 7B Shows an encoding based on a PAC encoding and decoding scheme according to an embodiment of the present disclosure;

[0021] Figure 8 Shows a method of a transmitting node for generating a codeword and transmitting the codeword to a receiving node according to an embodiment of the present disclosure;

[0022] Figure 9 Shows a method of a transmitting node for identifying a specific matrix corresponding to the size of a plurality of information bits and the size of a plurality of cyclic redundancy check (CRC) bits according to an embodiment of the present disclosure;

[0023] Figure 10 Shows a method for identifying a matrix to determine an interleaving pattern using a specific matrix according to an embodiment of the present disclosure;

[0024] Figure 11 Shows a method for identifying an interleaving pattern based on a CRC generation matrix according to an embodiment of the present disclosure;

[0025] Figure 12 Shows a change in the parity check relationship (PCR) set according to an embodiment of the present disclosure;

[0026] Figure 13 Shows a method for decoding at a receiving node according to an embodiment of the present disclosure; and

[0027] Figure 14 Shows a method for decoding at a receiving node according to an embodiment of the present disclosure;

[0028] In the description with reference to the accompanying drawings, the same or similar reference numerals can be used for the same or similar elements. Detailed Description of the Embodiments

[0029] The following discussion of Figures 1 to 14 and the various embodiments used in this patent document to describe the principles of the present disclosure are merely exemplary and should not be construed in any way as limiting the scope of the present disclosure. Those skilled in the art will understand that the principles of the present disclosure can be implemented in any suitably arranged system or device.

[0030] In the following, various embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that the present disclosure is not limited to specific embodiments, but includes various modifications, equivalents, and / or alternatives of various embodiments of the present disclosure.

[0031] A receiving node may decode an encoded signal received from a transmitting node. For example, the signal encoded at the transmitting node may include a plurality of information bits and redundant bits concatenated with the plurality of information bits, and the receiving node may decode the plurality of information bits and the redundant bits.

[0032] Meanwhile, the receiving node may use a search tree scheme for decoding. In the case where the receiving node decodes the encoded bits using the search tree scheme and performs a re-search due to a failure in one search path, the receiving node may need to return to a node that has already been searched. In addition, in the case where the redundant bits are concatenated after the plurality of information bits, the search space in the search tree scheme increases.

[0033] When the receiving node performs decoding, the search space increases, and the time spent re-searching the search path increases, resulting in high latency and a high block error rate (BLER).

[0034] According to an embodiment, the transmitting node or the receiving node may reduce or minimize latency or BLER.

[0035] In addition, various effects directly or indirectly obtained from this document may be provided.

[0036] Before proceeding with the following detailed description, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document: The terms "include" and "comprise," and their synonyms, mean inclusion without limitation; the term "or" is inclusive and means and / or; the phrases "associated with" and "associated therewith," and their synonyms, may mean to include, be included within, be interconnected with, contain, be contained within, be connected to or connected therewith, be coupled to or coupled therewith, be capable of communicating with, cooperate with, interleave, juxtapose, be proximate to, be bound to or bound therewith, have, have properties, etc.; the term "controller" refers to any device, system, or part thereof that controls at least one operation, and such a device may be implemented in hardware, firmware, software, or some combination of at least two of them. It should be noted that the functions associated with any particular controller may be centralized or distributed, whether local or remote.

[0037] In addition, the various functions described below can be implemented or supported by one or more computer programs, each of which is formed of computer-readable program code and is included in a computer-readable medium. The terms "application" and "program" refer to one or more computer programs, software components, instruction sets, procedures, functions, objects, classes, instances, associated data, or a portion thereof suitable for implementation in appropriate computer-readable program code. The phrase "computer-readable program code" includes any type of computer code, including source code, object code, and executable code. The phrase "computer-readable medium" includes any type of medium that can be accessed by a computer, such as read-only memory (ROM), random access memory (RAM), hard disk drives, optical discs (CDs), digital video discs (DVDs), or any other type of memory. A "non-transitory" computer-readable medium does not include wired, wireless, optical, or other communication links that transmit transitory electrical signals or other signals. Non-transitory computer-readable media include media in which data can be permanently stored and media in which data can be stored and rewritten later, such as rewritable optical discs or erasable memory devices.

[0038] Throughout this patent document, definitions of certain words and phrases are provided. Those of ordinary skill in the art should understand that, in many cases if not most cases, such definitions apply to both the prior and future use of the words and phrases so defined.

[0039] Figure 1 A wireless communication system according to an embodiment of the present disclosure is shown.

[0040] Reference Figure 1 , base station 110, terminal 120, and / or terminal 130 are shown as some of the nodes using radio channels in a wireless communication system. Figure 1 Only one base station is shown, but this is merely an example. Figure 1 The wireless communication system of may also include another base station that is the same as or similar to base station 110.

[0041] Base station 110 is a network infrastructure that provides wireless access to terminals 120 and 130. Base station 110 may have a coverage area defined as a specific geographical area based on the signal transmission distance. In addition to a base station, base station 110 may be referred to as an "access point (AP)", "eNodeB (eNB)", "gNodeB (gNB)", "fifth-generation (5G) node", "wireless point", "transmission / reception point (TRP)", or other terms having an equivalent technical meaning.

[0042] The first terminal 120 and the second terminal 130 are each used by a user and can communicate with the base station 110 via a radio channel. At least one of the first terminal 120 and the second terminal 130 can operate without user participation. For example, at least one of the first terminal 120 or the second terminal 130 can be a device that performs machine type communication (MTC) and can be not carried by a user. In addition to being referred to as a terminal, each of the first terminal 120 and the second terminal 130 can be referred to as a "user equipment (UE)", "mobile station", "user station", "customer premise equipment (CPE)", "remote terminal", "wireless terminal", "electronic device" or "user device", or other terms having the same technical meaning.

[0043] The base station 110, the first terminal 120, and the second terminal 130 can send and / or receive radio signals in a millimeter wave (mmWave) frequency band (e.g., 28 GHz, 30 GHz, 38 GHz, 60 GHz). In doing so, to improve the channel gain, the base station 110, the first terminal 120, and / or the second terminal 130 can perform beamforming. For example, the first terminal 120 can send a radio frequency (RF) signal to the base station 110 or receive an RF signal from the base station 110 based on the first beam 121. For example, the base station 110 can send an RF signal to the first terminal 120 or receive an RF signal from the first terminal 120 based on the second beam 112. For example, the base station 110 can send an RF signal to the second terminal 130 or receive an RF signal from the second terminal 130 based on the third beam 113. For example, the second terminal 130 can send an RF signal to the base station 110 or receive an RF signal from the base station 110 based on the third beam 131.

[0044] Beamforming can include transmit beamforming and / or receive beamforming. That is, the base station 110, the first terminal 120, and / or the second terminal 130 can give directionality to a transmitted signal or a received signal. To give directionality to a received signal, the base station 110 and / or the terminals 120 and 130 can select service beams 112, 113, 121, and 131 through a beam search or beam management process. After the service beams 112, 113, 121, and 131 are selected, communication can be performed through resources that are quasi co-located (QCL) with the resources of the transmitted service beams 112, 113, 121, and 131.

[0045] Base station 110, first terminal 120, and second terminal 130 of the present disclosure may each be a transmitting device, a transmitting node, a receiving device, and / or a receiving node. For example, base station 110 may transmit an RF signal to first terminal 120. For example, base station 110 may receive an RF signal from first terminal 120. As another example, first terminal 120 may transmit an RF signal to base station 110 or second terminal 130. First terminal 120 may receive an RF signal from base station 110 or second terminal 130.

[0046] Figure 2 The structure of a terminal according to an embodiment of the present disclosure is shown.

[0047] Reference Figure 2 , according to an embodiment, terminal 200 may include transceiver 210, memory 220, and / or processor 230. The present disclosure describes terminal 200 including transceiver 210, memory 220, and / or processor 230, but this is merely an example. For example, terminal 200 may further include other components in addition to transceiver 210, memory 220, and processor 230. For example, processor 230 may be replaced by a controller.

[0048] According to an embodiment, transceiver 210, memory 220, and processor 230 may each be implemented or formed as separate chips. However, this is merely an example, and transceiver 210, memory 220, and / or processor 230 may be implemented or formed as a single chip.

[0049] According to an embodiment, transceiver 210 may accommodate at least one transmitter and / or at least one receiver. For example, transceiver 210 may include an RF transmitter for amplifying and up-converting the frequency of a transmission signal. Transceiver 210 may include an RF receiver for down-converting the frequency of a received signal and low-noise amplifying the signal.

[0050] The components of transceiver 210 described in the present disclosure are merely exemplary, and the components of transceiver 210 are not limited to an RF transmitter and an RF receiver. For example, transceiver 210 may further include a coupler for obtaining isolation between the RF transmitter and the RF receiver.

[0051] According to an embodiment, transceiver 210 may send a signal to processor 230 or receive a signal from the processor. For example, transceiver 210 may send or deliver an RF signal received through a wireless communication channel to processor 230. Transceiver 210 may receive an RF signal from processor 230.

[0052] According to an embodiment, transceiver 210 may be referred to as a UE transmitter or a UE receiver.

[0053] According to an embodiment, the transceiver 210 may send a signal to a base station (e.g., Figure 1 the base station 110) or a network entity (e.g., a user plane function (UPF) entity), or receive a signal from the base station or the network entity. In an embodiment, the signal sent or received may include a control signal and data.

[0054] According to an embodiment, the memory 220 may include or store programs or data required for the operation of the terminal 200. For example, the memory 220 may be a non-transitory memory, and the programs stored in the non-transitory memory may be tightly coupled to the hardware configuration of the terminal 200 (e.g., the processor 230 or the transceiver 210). The memory 220 may store control information or data included in the signals obtained by the terminal 200. In an embodiment, the memory 220 may include a read-only memory (ROM), a random access memory (RAM), a hard disk, a compact disc (CD)-ROM, a digital versatile disc (DVD), and / or a storage medium.

[0055] According to an embodiment, the processor 230 may include one processor or multiple processors. For example, the processor 230 may include a communication processor. For example, the processor 230 may include a communication processor and / or an application processor.

[0056] According to an embodiment, the processor 230 may control a series of processes performed by the terminal 200. For example, the transceiver 210 may receive a data signal including control information sent by a base station or a network entity. The processor 230 may process the received control signal and data signal.

[0057] The term "processor" in the present disclosure may be replaced by various terms for performing the operations of the terminal 200. For example, the processor may be replaced by a controller or a computing circuit.

[0058] The terminal 200 of the present disclosure may correspond to Figure 1 the first terminal 120 and / or the second terminal 130.

[0059] Figure 3 The structure of a base station according to an embodiment of the present disclosure is shown.

[0060] Referring to Figure 3 , according to an embodiment, the base station 300 may include a transceiver 310, a memory 320, and / or a processor 330. The present disclosure describes that the base station 300 includes a transceiver 310, a memory 320, and / or a processor 330, but this is only an example. For example, the base station 300 may further include other components in addition to the transceiver 310, the memory 320, and the processor 330. As another example, the processor 330 may be replaced by a controller.

[0061] According to an embodiment, the transceiver 310, the memory 320, and the processor 330 may each be implemented or formed as separate chips. However, this is merely an example, and the transceiver 310, the memory 320, and / or the processor 330 may be implemented or formed as a single chip.

[0062] According to an embodiment, the transceiver 310 may accommodate at least one transmitter and / or at least one receiver. For example, the transceiver 310 may include an RF transmitter for amplifying and up-converting the frequency of a transmission signal. The transceiver 310 may include an RF receiver for down-converting the frequency of a received signal and low-noise amplifying the signal.

[0063] The components of the transceiver 310 described in this disclosure are merely exemplary, and the components of the transceiver 310 are not limited to an RF transmitter and an RF receiver. For example, the transceiver 310 may further include a coupler for obtaining isolation between the RF transmitter and the RF receiver.

[0064] According to an embodiment, the transceiver 310 may send a signal to the processor 330 or receive a signal from the processor. For example, the transceiver 310 may send or deliver an RF signal received through a wireless communication channel to the processor 330. The transceiver 310 may receive an RF signal from the processor 330.

[0065] According to an embodiment, the transceiver 310 may be referred to as a base station transmitter or a base station receiver.

[0066] According to an embodiment, the transceiver 310 may send a signal to the terminal 200 or receive a signal from the terminal 200. In an embodiment, the signal sent or received may include a control signal and data.

[0067] According to an embodiment, the memory 320 may include or store programs or data required for the operation of the base station 300. For example, the memory 320 may be a non-transitory memory, and the programs stored in the non-transitory memory may be tightly coupled to the hardware configuration of the base station 300 (e.g., the processor 330 or the transceiver 310). The memory 320 may store control information or data included in the signals obtained by the base station 300. In an embodiment, the memory 320 may include a ROM, a RAM, a hard disk, a CD-ROM, a DVD, and / or a storage medium.

[0068] According to an embodiment, the processor 330 may include one processor or multiple processors. For example, the processor 330 may include a communication processor. For example, the processor 330 may include a communication processor and / or an application processor.

[0069] According to an embodiment, the processor 330 may control a series of processes performed by the base station 300. For example, the transceiver 310 may receive a data signal including control information sent by the base station or a network entity. The processor 330 may process the received control signal and data signal.

[0070] The term "processor" in the present disclosure may be replaced by various terms that perform the operations of the base station 300. For example, the processor may be replaced by a controller or a computing unit.

[0071] Figure 4 Polarization-adjusted convolution (PAC) encoding and decoding according to an embodiment of the present disclosure is shown.

[0072] Reference Figure 4 , a wireless communication network 400 according to an embodiment may include a transmitting node 410 and / or a receiving node 420.

[0073] According to an embodiment, the transmitting node 410 and the receiving node 420 may correspond to a terminal (e.g., Figure 2 the terminal 200) or a base station (e.g., Figure 3 the base station 300), respectively. For example, the transmitting node 410 may correspond to the base station 300, and the receiving node 420 may correspond to the terminal 200. The transmitting node 410 may send an RF signal to the receiving node 420 through a radio communication channel, and the receiving node 420 may receive the RF signal from the transmitting node 410 through the radio communication channel.

[0074] For example, the transmitting node 410 may correspond to a first terminal (e.g., Figure 1 the first terminal 120), and the receiving node 420 may correspond to a second terminal (e.g., Figure 1 the second terminal 130). The transmitting node 410 may perform sidelink communication by sending an RF signal to the receiving node 420.

[0075] According to an embodiment, the RF signal sent from the transmitting node 410 to the receiving node 420 may include encoded bits, and the encoded bits may be decoded at the receiving node 420. Thereafter, decoding of the encoded bits using the PAC encoding and decoding scheme is described.

[0076] According to an embodiment, the transmitting node 410 may include a rate profile block 411, a convolutional transform block 412, and / or a polarization transform block 413.

[0077] According to an embodiment, data may be input to the rate profile block 411. For example, the data vector may be input to the rate profile block 411, and the data vector may be referred to as a specific number of bits. For example, the data vector may be referred to as The number of bits of the data vector may be A.

[0078] According to an embodiment, the rate profiling block 411 may perform rate profiling on the input data vector For example, the rate profiling block 411 may transform the data vector into a rate profiling vector based on (or using) a preset sequence The rate profiling vector includes information bits containing the information to be transmitted and frozen bits of information without a specific rule (or order).

[0079] According to an embodiment, the rate profiling vector including the inserted frozen bits may be referred to as The number of bits of the rate profiling vector may be N, and the number of inserted frozen bits may be N - A. In an embodiment, the number of at least one inserted or concatenated frozen bit may be preset. For example, the number of at least one inserted or concatenated frozen bit may correspond to the information bits included in the data vector Or the type of information bits. According to an embodiment, since the rate profiling block 411 inserts frozen bits into the data vector Even if some of the bits included in the RF signal transmitted from the transmitting node 410 are lost due to the wireless communication channel, the loss of data bits included in the RF signal can be minimized or reduced.

[0080] According to an embodiment, the rate profiling block 411 may output the rate profiling vector to the convolutional transform block 412

[0081] According to an embodiment, the rate profiling vector May be sent or delivered from the rate profiling block 411 to the convolutional transform block 412. The convolutional transform block 412 may obtain a convolutional transform (CT) vector using [Equation 1]:

[0082] [Equation 1].

[0083] In [Equation 1], Is the CT vector, and Is the rate profiling vector. Is a conventional generating polynomial and may be obtained or acquired from the conventional generating polynomial

[0084] According to an embodiment, the convolutional transform block 412 may output the obtained CT vector To the polarization transform block 413.

[0085] According to an embodiment, the polarization transformation block 413 may receive the CT vector from the convolutional transformation block 412 . The polarization transformation block 413 may transform the received CT vector into a codeword (or codeword vector) . For example, the polarization transformation block 413 may use [Equation 2] to transform the CT vector into a codeword . For example, the polarization transformation block 413 may obtain a codeword based on the CT vector : :

[0086] [Equation 2].

[0087] In [Equation 2], is the codeword, is the CT vector, and is a specific polarization code generation matrix. For example, the polarization code generation matrix may be obtained using , and the Arikan kernel is . In an embodiment, may be referred to as the nth Kronecker product of the matrix .

[0088] According to an embodiment, the polarization transformation block 413 may output the obtained codeword (or codeword vector) , and send the output codeword (or codeword vector) to the receiving node 420

[0089] According to an embodiment, the polarization-transformed codeword may be sent to the receiving node 420 through a wireless communication channel. For example, the codeword may be referred to as a message including data bits or information including data bits

[0090] According to an embodiment, the receiving node 420 may include a successive cancellation decoding block 421, a tree search block 422, and / or a message extraction block 423

[0091] According to an embodiment, the receiving node 420 may receive a codeword (or codeword vector) through a wireless communication channel from the sending node 410 . The codeword received through the wireless communication channel may be different from the codeword . For example, during the transmission to the receiving node 420 through the wireless communication channel, the codeword sent from the sending node 410 may be affected by the channel environment, and the codeword may be different from the codeword transmitted by the transmitting node 410 . For example, the channel environment may change according to the change in the position of the transmitting node 410 or the receiving node 420.

[0092] According to an embodiment, the codeword received at the receiving node 420 may be input to the successive cancellation decoding block 421 of the receiving node 420. The successive cancellation decoding block 421 may calculate the reliability value of each bit among the bits required to decode the input codeword in a tree search manner, and thus deliver or transmit the reliability value to the tree search block 422. For example, the reliability value of each bit among the bits delivered to the tree search block 422 may be used for Fano decoding. In an embodiment, the successive cancellation decoding block 421 may operate as a polar code decoder.

[0093] According to an embodiment, the tree search block 422 may perform decoding using a search tree scheme having the reliability value of the received specific bit . The tree search block 422 may deliver the decoded bits to the successive cancellation decoding block 421.

[0094] According to an embodiment, the successive cancellation decoding block 421 and the tree search block 422 may repeat the above operations until the decoding is completed, and decode the received codeword . In the case where the decoding is completed based on a specific criterion, the tree search block 422 may output a vector including the decoded bits to the message extraction block 423 .

[0095] According to an embodiment, the message extraction block 423 may receive a vector including the decoded bits from the tree search block 422 . The message extraction block 423 may extract a message from the vector including the decoded bits .

[0096] According to an embodiment, the message extraction block 423 may extract an estimated data vector from the vector including the decoded bits . The message extraction block 423 may deliver the estimated data vector to the processor or controller of the receiving node 420.

[0097] It can be understood that the blocks of the transmitting node 410 of the present disclosure are substantially executed by at least one processor or controller of the transmitting node 410. For example, it can be understood that the function of the rate profiling block 411 of the transmitting node 410 is substantially executed by at least one processor or controller of the transmitting node 410.

[0098] ​It can be understood that the blocks of the receiving node 420 of the present disclosure are substantially executed by at least one processor or controller of the receiving node 420. For example, it can be understood that the function of the successive cancellation decoding block 421 of the receiving node 420 is substantially executed by at least one processor or controller of the receiving node 420.

[0099] It can be understood that the blocks of the present disclosure indicate layers or modules that perform specific functions. Therefore, the term "block" of the present disclosure can be replaced by a layer or a module. For example, the rate profiling block 411 can be referred to as a rate profiling layer or a rate profiling module. For example, the successive cancellation decoding block 421 can be referred to as a successive cancellation layer or a successive cancellation module.

[0100] The transmitting node 410 of the present disclosure can be replaced by a transmitting device, a transmitter, or a transmitting equipment. The receiving node 420 can be replaced by a receiving device, a receiver, or a receiving equipment.

[0101] Figure 5 Illustrated is according to an embodiment of the present disclosure Figure 4 encoding and decoding as explained in

[0102] Referring to Figure 5 , according to an embodiment, the data vector may include a plurality of information bits and / or a plurality of CRC bits. The transmitting node 410 may perform rate profiling on the data vector . According to the rate profiling, the rate profiling vector may include a plurality of information bits (or data bits) and a plurality of frozen bits.

[0103] According to an embodiment, the transmitting node 410 may obtain a CT vector by performing a convolutional transform on the rate profiling vector . The transmitting node 410 may obtain a codeword by performing a polarization transform on the CT vector . In an embodiment, the transmitting node 410 may transmit the obtained codeword to the receiving node 420.

[0104] According to an embodiment, the receiving node 420 may decode the received codeword . The decoding may be sequentially performed by the receiving node 420 starting from a specific column. For example, the receiving node 420 may decode the first bit among the bits included in the received codeword .

[0105] According to an embodiment, the receiving node 420 may decode the received codeword only once. For example, the receiving node 420 may sequentially decode only once multiple bits of the codeword .

[0106] Figure 6 shows a decoding method based on a search tree scheme according to an embodiment of the present disclosure.

[0107] Referring Figure 6 , a search tree 600 for decoding 4 bits is depicted according to an embodiment. The search tree 600 may be configured with multiple nodes. As another example, the search tree 600 may include multiple nodes.

[0108] According to an embodiment, the search tree 600 may include nodes with various bit levels. For example, the search tree 600 may include a first node 601 at bit level 0. The search tree 600 may include a second node 602 and a third node 603 at bit level 1. The search tree 600 may include a fourth node 604, a fifth node 605, a sixth node 606, and a seventh node 607 at bit level 2. The search tree 600 may include an eighth node 608, a ninth node 609, a tenth node 610, an eleventh node 611, a twelfth node 612, a thirteenth node 613, a fourteenth node 614, and a fifteenth node 615 at bit level 3. The search tree 600 may include a sixteenth node 616, a seventeenth node 617, an eighteenth node 618, a nineteenth node 619, a twentieth node 620, a twenty-first node 621, a twenty-second node 622, and a twenty-third node 623 at bit level 4. The number and levels of the nodes of the search tree 600 may vary based on or according to the code length. As another example, the number and levels of the nodes of the search tree 600 may be determined based on the code length.

[0109] According to an embodiment, the first node 601 may be a root node. The nodes of the search tree 600 may be connected by paths.

[0110] According to an embodiment, the receiving node 420 may perform decoding according to a depth-first search (DFS) scheme or algorithm. For example, the successive cancellation decoding block 421 and the tree search block 422 of the receiving node 420 may perform decoding according to the DFS scheme. In an embodiment, the DFS scheme may indicate a search scheme that first searches the depth in the search tree. For example, the DFS scheme may start from the root node (e.g., the first node 601) or any node, search to the maximum depth (e.g., bit level 4), return to that node, and then search another node.

[0111] of the present disclosure Figure 6 is explained based on the DFS scheme, but this is merely an example. For example, the receiving node 420 may perform decoding through a search tree scheme using a breadth-first search (BFS) scheme. The BFS scheme may first explore the breadth.

[0112] According to an embodiment, the receiving node 420 may decode the first bit (e.g., 4 bits) among the received bits, and determine a search path to the second node 602 in the case where the first bit is determined or estimated to be "0" as a result of the first bit decoding. In the case where the second bit is determined or estimated to be "0" as a result of the second bit decoding, the receiving node 420 may determine a search path to the fourth node 604.

[0113] If the third bit is decoded, but it is determined that the third bit is not "0" or "1", the receiving node 420 may return to the second node 602. For example, the receiving node 420 may compare the reliability value of the third bit with the threshold of the third bit, and return to the second node 602 in the case where the result of the comparison is that the reliability value of the third bit is lower than the threshold of the third bit.

[0114] As another example, in the case where the third bit is determined to be "0", the receiving node 420 may compare the reliability value of the determined third bit with the threshold of the third bit, and determine or estimate the third bit to be "1" in the case where the reliability value of the determined third bit is lower than the threshold of the third bit. The receiving node 420 may compare the reliability value of the third bit determined to be "1" with the threshold of the third bit, and return to the second node 602 in the case where the reliability value of the determined third bit determined to be "1" is lower than the threshold of the third bit. In an embodiment, returning from the fourth node 604 to the second node 602 may be referred to as "backward".

[0115] According to an embodiment, the receiving node 420 may return to the second node 602, and then determine a search path to the fifth node 605.

[0116] According to an embodiment, the receiving node 420 may determine the tenth node 610, the sixteenth node 616, the seventeenth node 617, the eleventh node 611, and the nineteenth node 619 as search paths in the above manner. Thus, the receiving node 420 may decode the multiple bits (e.g., 4 bits) received from the sending node 410 as "0111".

[0117] In the present disclosure, determining a search path (or paths) from a node at a lower bit level to a node at a higher bit level may be substantially referred to as "forward". For example, determining a search path from the second node 602 to the fourth node 604 at the receiving node 420 may be substantially referred to as making the search path forward from the second node 602 to the fourth node 604.

[0118] In the present disclosure, determining a search path (or paths) from a node of a higher bit level to a node of a lower bit level can be substantially referred to as "backward". For example, determining a search path from the fourth node 604 to the second node 602 at the receiving node 420 can be substantially referred to as making the search path backward from the fourth node 604 to the second node 602.

[0119] In the present disclosure, determining a search path between nodes of the same bit level can be substantially referred to as "lateral (or finding an alternative option)". For example, determining a search path from the fourth node 604 to the fifth node 605 at the receiving node 420 can be substantially referred to as advancing the search path from the fourth node 604 to the fifth node 605 in "an alternative option".

[0120] If multiple received bits are decoded according to the tree search scheme explained in the Figure 6 present disclosure, a wide search space can be formed. For example, meta-nodes can be generated to decode the nth bit, and the receiving node 420 may need to identify all meta-nodes at each bit level.

[0121] An n-ary bit can include multiple information bits and CRC bits. In the case where the CRC bits are concatenated to the multiple information bits and the decoding order of the CRC bits is determined to be after the multiple information bits, decoding is required by constructing a search tree (e.g., search tree 600) for all the multiple information bits.

[0122] Therefore, solutions for reducing or minimizing the search space by interleaving multiple CRC bits based on an interleaving pattern are described below.

[0123] Figure 7A A transmitting node encoded based on a PAC encoding and decoding scheme and a receiving node decoded based on a PAC encoding and decoding scheme according to an embodiment of the present disclosure are shown.

[0124] Referring Figure 7A to, the transmitting node 710 according to an embodiment may include a rate profiling block 711, a convolutional transformation block 712, a polarization transformation block 713, a CRC encoding block 714, and / or an interleaving block 715.

[0125] The Figure 7A transmitting node 710 of the present disclosure can encode bits according to the PAC encoding and decoding scheme, and compared with Figure 4 the transmitting node 410 of, Figure 7A the transmitting node 710 of the present disclosure may further include a CRC encoding block 714 and / or an interleaving block 715. The rate profiling block 711, the convolutional transformation block 712, and the polarization transformation block 713 of the Figure 7A present disclosure may correspond toFigure 4 Rate profiling block 411, convolutional transformation block 412, and polarization transformation block 413.

[0126] According to an embodiment, data can be input to the CRC encoding block 714 of the transmitting node 710. For example, a data vector can be input to the CRC encoding block 714.

[0127] According to an embodiment, the CRC encoding block 714 can encode multiple CRC bits into multiple information bits for transmission to the receiving node 720. For example, the CRC encoding block 714 can concatenate, insert, or add multiple CRC bits to the last bit among multiple information bits. For example, the CRC-encoded vector can be the CRC-encoded vector . That is, the CRC encoding block 714 can output the CRC-encoded vector in response to the input data vector .

[0128] According to an embodiment, the CRC encoding block 714 of the transmitting node 710 can identify or generate a specific matrix (e.g., a CRC generation matrix) based on a CRC generation polynomial.

[0129] According to an embodiment, the specific matrix (e.g., a CRC generation matrix) can be a matrix for identifying or generating an interleaving pattern for interleaving multiple information bits and multiple CRC bits.

[0130] According to an embodiment, the specific matrix (e.g., a CRC generation matrix) can include an identity matrix and a parity check matrix. In an embodiment, the identity matrix can be a square matrix in which the main diagonal components are all 1 and the other components are 0. The parity check matrix can be a matrix in which the matrix components or elements are values corresponding to the parity checks of the CRC bits.

[0131] The identity matrix of the present disclosure can be referred to as the identity matrix part of the specific matrix, and the parity check matrix can be referred to as the parity check matrix part of the specific matrix.

[0132] According to an embodiment, the specific matrix can be defined by [Equation 3]:

[0133] [Equation 3].

[0134] For example, assuming that the identity matrix has a size of , and the parity check matrix has a size of , then in [Equation 3], and .

[0135] According to an embodiment, the CRC encoding block 710 of the transmitting node 710 may generate a matrix corresponding to an interleaving pattern based on a specific matrix (e.g., a CRC generation matrix). For example, the CRC encoding block 714 may be based on the size of a plurality of information bits (e.g., ), and the size of a plurality of CRC bits (e.g., ), to identify or generate a specific matrix (e.g., a CRC generation matrix). In an embodiment, the specific matrix (e.g., a CRC generation matrix) may be .

[0136] For example, the CRC encoding block 714 may identify or generate a matrix corresponding to an interleaving pattern by permuting a specific matrix (e.g., a CRC generation matrix). In an embodiment, the identified or generated matrix may be . The identified or generated matrix may be a matrix that permutes at least some columns of the specific matrix .

[0137] According to an embodiment, the CRC encoding block 714 may identify an interleaving pattern using a matrix generated based on a specific matrix. For example, the CRC encoding block 714 may use the generated matrix to identify the interleaving pattern .

[0138] According to an embodiment, the interleaving block 715 may interleave a plurality of information bits and a plurality of CRC bits based on the identified interleaving pattern . For example, the interleaving block 715 may use the interleaving pattern to interleave the bits included in the CRC encoding vector , and output an interleaved vector . The determination of the interleaving pattern at the interleaving block 715 is described in detail. For example, Figure 10 explains the determination of the interleaving pattern.

[0139] The term "interleave" in the present disclosure may indicate changing the arrangement (or order of arrangement) or order of a plurality of bits. Thus, the term "interleave" may be replaced by arrangement, rearrangement, or distribution.

[0140] According to an embodiment, the rate profiling block 711 may receive the interleaved vector from the interleaving block 715, and perform rate profiling on the interleaved vector . The convolutional transform block 712 and the polarization transform block 713 may perform the convolutional transform and the polarization transform as shown in Figure 4 .

[0141] According to an embodiment, the receiving node 720 may include a successive cancellation decoding block 721, a tree search block 722, a message extraction block 723, and / or an additional message extraction block 724.

[0142] Compared with Figure 4 the receiving node 420 of Figure 7A this disclosure, the receiving node 720 of Figure 7A this disclosure may further include an additional message extraction block 724. The successive cancellation decoding block 721, the tree search block 722, and the message extraction block 723 of Figure 4 this disclosure may correspond to the successive cancellation decoding block 421, the tree search block 422, and the message extraction block 423 of

[0143] According to an embodiment, the receiving node 720 may receive a parity check relationship (PCR) set from the transmitting node 710 . In an embodiment, the receiving node 720 may use the PCR set for decoding. For example, the codeword received from the transmitting node 710 may include a plurality of bits, and the plurality of bits may be interleaved by an interleaving pattern identified at the transmitting node 710. Therefore, in order to decode based on the codeword received from the transmitting node 710, the receiving node 720 may need to receive the PCR set that includes information about the order or permutation (or permutation order) of the plurality of bits included in the received codeword .

[0144] Obtaining the PCR set identified or received by the receiving node 720 of this disclosure may be set forth in Figure 12 .

[0145] According to an embodiment, the additional message extraction block 724 of the receiving node 720 may extract a vector including first decoded data from a data vector decoded using an information set . For example, the information set may include information indicating the order or permutation (or permutation order) of a plurality of information bits for interleaving, a plurality of CRC bits for interleaving, and a plurality of interleaved frozen bits. The additional message extraction block 724 may extract a vector including first decoded data from the decoded data vector

[0146] .

[0146] According to an embodiment, the message extraction block 723 may output a second decoded vector using an interleaving pattern or a deinterleaving pattern. The interleaving pattern or the deinterleaving pattern obtained at the message extraction block 723 may be set forth.

[0147] The present disclosure explains that the CRC encoding block 714 generates a matrix corresponding to an interleaving pattern based on a specific matrix (e.g., a CRC generation matrix) and identifies the interleaving pattern. However, this is merely an example, and the functions performed by the CRC encoding block 714 can be performed by other blocks (e.g., the interleaving block 715) of the transmitting node 710.

[0148] The operations performed by the blocks of the transmitting node 710 of the present disclosure can be referred to as operations performed by the transmitting node 710 or a controller included in the transmitting node 710. For example, it can be understood that the CRC encoding of the CRC encoding block 714 of the transmitting node 710 is substantially performed by the controller of the transmitting node 710.

[0149] The operations performed by the blocks of the receiving node 720 of the present disclosure can be referred to as operations performed by the receiving node 720 or a controller included in the receiving node 720. For example, it can be understood that the operations of the successive cancellation decoding block 721 of the receiving node 720 are substantially performed by the controller of the receiving node 720.

[0150] Figure 7B Encoding based on the PAC encoding and decoding scheme according to an embodiment of the present disclosure is shown.

[0151] Reference Figure 7B , according to an embodiment, the transmitting node 710 may input a data vector (e.g., 8 bits) in length to the encoder of the receiving node 720.

[0152] According to an embodiment, the transmitting node 710 may concatenate CRC bits to the data vector . For example, the length (or size) of the CRC bits may be (e.g., 4 bits), and the length (or size) of the CRC encoded vector may be (e.g., 12 bits). For example, the length of the CRC encoded vector may be

[0153] According to an embodiment, the transmitting node 710 may interleave the CRC encoded vector . For example, the receiving node 720 may interleave the bits of the CRC encoded vector based on the identified interleaving pattern.

[0154] According to an embodiment, the transmitting node 710 may perform an operation on the interleaved vector Perform rate profiling. For example, the transmitting node 710 may concatenate a plurality of frozen bits to an interleaving vector. For example, the transmitting node 710 may concatenate a plurality of frozen bits to a plurality of information bits and a plurality of CRC bits. The rate profiling interleaving vector may be referred to as an information vector .

[0155] According to an embodiment, the length of the information vector may be the sum of the interleaving vector length (e.g., ), and the number of concatenated frozen bits.

[0156] According to an embodiment, the transmitting node 710 may perform convolutional coding on the information vector . For example, the transmitting node 710 may use Figure 4 of [Equation 1] corresponding to to transform the information vector into a convolutional vector .

[0157] According to an embodiment, the transmitting node 710 may perform polar coding on the convolutional vector . For example, the transmitting node 710 may use Figure 4 of [Equation 2] corresponding to to transform the convolutional vector into a codeword vector .

[0158] The CRC coding, convolutional coding, and polar coding described in the present disclosure may indicate a transformation of encoding a data vector including a plurality of information bits into a codeword vector . Thus, CRC coding may be replaced by CRC concatenation, and convolutional coding may be replaced by convolutional transformation, and polar coding may be replaced by polar transformation.

[0159] Figure 8 Illustrates a method of a transmitting node for generating a codeword and transmitting the codeword to a receiving node according to an embodiment of the present disclosure.

[0160] Refer to Figure 8 , according to an embodiment, in operation 801, the transmitting node 710 may encode a plurality of information bits using a plurality of CRC bits. For example, the controller of the transmitting node 710 may identify a plurality of information bits (or data bits) to be transmitted to the receiving node 720. The controller of the transmitting node 710 may concatenate, insert, or add CRC bits to the plurality of information bits. For example, the transmitting node 710 may concatenate CRC bits to the last bit among the information bits.

[0161] According to an embodiment, CRC bits concatenated to a plurality of information bits may be preset. For example, CRC bits concatenated to a plurality of information bits may be stored in a memory, preconfigured in the transmitting node 710 and the receiving node 720, or generated according to a notified polynomial.

[0162] According to an embodiment, in operation 803, the transmitting node 710 may use an interleaving pattern to interleave a plurality of information bits and a plurality of CRC bits. The interleaving pattern may correspond to a matrix generated based on the size of the plurality of information bits and the size of the plurality of CRC bits. According to an embodiment, the transmitting node 710 may use an interleaving pattern to interleave at least some of the plurality of information bits and the plurality of CRC bits. For example, the transmitting node 710 may use an interleaving pattern to interleave all of the plurality of information bits and the plurality of CRC bits. For example, the transmitting node 710 may use an interleaving pattern to interleave only some of the plurality of information bits and the plurality of CRC bits.

[0163] For example, the transmitting node 710 may use an interleaving pattern to interleave only the plurality of CRC bits among the plurality of bits. For example, the transmitting node 710 may use an interleaving pattern to interleave only the plurality of information bits among the plurality of bits. For example, the transmitting node 710 may use an interleaving pattern to interleave some of the information bits and some of the CRC bits among the plurality of bits.

[0164] For example, the transmitting node 710 may identify a transport block size (TBS) carrying a plurality of information bits and a plurality of CRC bits. The transmitting node 710 may identify the size of the plurality of information bits (e.g., A) and the size of the plurality of CRC bits (e.g., L) based on the TBS.

[0165] In an embodiment, the transmitting node 710 may identify a specific matrix based on the size of the plurality of information bits (e.g., A) and the size of the plurality of CRC bits (e.g., L). The transmitting node 710 may generate a matrix by permuting the specific matrix (e.g., CRC generation matrix), and use the generated matrix to determine the interleaving pattern. Determining the interleaving pattern by permuting the specific matrix may be Figure 8 clarified in.

[0166] In an embodiment, the specific matrix may be referred to as a matrix for determining the interleaving pattern. The transmitting node 710 may use the CRC generation matrix (e.g., )、the size of the plurality of information bits (e.g., A) and the size of the plurality of CRC bits (e.g., L) to obtain the specific matrix.

[0167] In [Equation 4], the specific matrix obtained using , and may be :

[0168] [Equation 4].

[0169] According to an embodiment, a plurality of interleaved information bits and a plurality of interleaved CRC bits may be referred to as an interleaved vector. For example, the interleaved vector may include a plurality of interleaved information bits and a plurality of interleaved CRC bits.

[0170] According to an embodiment, the transmitting node 710 may perform rate profiling on the interleaved vector. For example, the rate profiling block 711 of the transmitting node 710 may perform rate profiling on the interleaved vector. According to the rate profiling, the interleaved vector may be transformed into a rate profiling vector, which includes information bits containing information to be transmitted from the transmitting node 710 and frozen bits of information not in a specified rule (or order).

[0171] According to an embodiment, the rate-profiled interleaved vector may be referred to as an information vector. For example, the information vector may include a plurality of information bits, a plurality of CRC bits, and a plurality of frozen bits.

[0172] According to an embodiment, in operation 805, the transmitting node 710 may generate a codeword (or codeword vector) by performing convolutional coding and polar coding on a plurality of interleaved information bits and a plurality of interleaved CRC bits.

[0173] For example, the convolutional transformation block 712 of the transmitting node 710 may perform convolutional coding on the information vector. In an embodiment, the convolutional coding vector may be referred to as a convolutional transformation vector. Performing a convolutional transformation on the information vector of the present disclosure may be understood as coding based on the convolutional transformation.

[0174] For example, the polarization transformation block 713 of the transmitting node 710 may perform polarization coding on the convolutional transformation vector. In an embodiment, the polarization coding vector may be referred to as a codeword. In the present disclosure, performing a polarization transformation on the convolutional transformation vector may be understood as coding the convolutional transformation vector based on the polarization transformation.

[0175] According to an embodiment, in operation 807, the transmitting node 710 may transmit the codeword to the receiving node 720. For example, the codeword may include a plurality of information bits, a plurality of CRC bits, and a plurality of frozen bits. The transmitting node 710 may transmit the codeword to the receiving node 720, and the receiving node 720 may decode the received codeword.

[0176] The codeword of the present disclosure may be referred to as a word generated by an encoding algorithm. As another example, the codeword may be referred to as an independently decodable unit.

[0177] In the present disclosure, the term "cascade" may be replaced by insertion, addition, or combination.

[0178] In the present disclosure, the term "identify" may be replaced by verify, determine, or estimate.

[0179] The operations of the transmitting node 710 of the present disclosure may be performed by at least one processor or controller of the transmitting node 710.

[0180] The sequence of operations 801 to 807 is an example, and operations 801 to 807 may be performed in parallel or simultaneously.

[0181] Figure 9 A method of a transmitting node for identifying a specific matrix corresponding to the size of a plurality of information bits and the size of a plurality of CRC bits according to an embodiment of the present disclosure is shown.

[0182] Reference Figure 9 , according to an embodiment, in operation 901, the transmitting node 710 may identify the size of a plurality of information bits and the size of a plurality of CRC bits. For example, the transmitting node 710 may establish a communication connection with the receiving node 720 and identify the TBS for transmitting a plurality of information bits and a plurality of CRC bits. Based on the TBS, the transmitting node 710 may identify the size of a plurality of information bits (e.g., A) and the size of a plurality of CRC bits (e.g., L).

[0183] According to an embodiment, in operation 903, the transmitting node 710 may identify an interleaving pattern corresponding to the size of a plurality of information bits and the size of a plurality of CRC bits.

[0184] For example, the transmitting node 710 may store a look-up table of interleaving patterns. In an embodiment, one interleaving pattern (e.g., ) may correspond to a first size of a plurality of information bits (e.g., A = 13) and a second size of a plurality of CRC bits (e.g., L = 6).

[0185] [Table 1]

[0186]

[0187] According to an embodiment, in the case of storing a lookup table of the interleaving pattern, the transmitting node 710 may determine the interleaving pattern using the size of a plurality of information bits (e.g., A) and the size of a plurality of CRC bits (e.g., L). According to an embodiment, the receiving node 720 may store a lookup table of the interleaving pattern and obtain the interleaving pattern from the lookup table. The receiving node 720 may identify the size of a plurality of information bits (e.g., A) and the size of a plurality of CRC bits (e.g., L), determine the interleaving pattern corresponding to the size of the information bits and the size of the CRC bits, and use the interleaving pattern to perform decoding. The receiving node 720 may obtain the size of the information bits and the size of the CRC bits based on the information transmitted from the transmitting node 710, and the information may be directly indicated by control information (e.g., downlink control information (DCI)) transmitted from the transmitting node and the receiving node, or may be indirectly derived from other information or data.

[0188] of the present disclosure Figure 9 Operations 901 and 903 of Figure 8 may be performed between operation 801 and operation 803 of Figure 9 Therefore, embodiments of Figure 8 may be combined with embodiments of Figure 9 and Figure 8 However, the combination of Figure 9 and Figure 8 is merely exemplary, and the combination order of the operations of

[0189] The sequence of operations 901 to 903 is an example, and operations 901 to 903 may be performed in parallel or simultaneously.

[0190] Figure 10 shows a method for identifying a matrix to determine an interleaving pattern using a specific matrix according to an embodiment of the present disclosure.

[0191] Referring to Figure 10 , according to an embodiment, in operation 1001, the transmitting node 710 may identify a specific matrix based on the size of a plurality of information bits (e.g., A) and the size of a plurality of CRC bits (e.g., L). The transmitting node 710 may determine the interleaving pattern by permuting the specific matrix (e.g., the CRC generation matrix). In an embodiment, the specific matrix (e.g., the CRC generation matrix or the parity check matrix) may include an identity matrix and a parity check matrix.

[0192] According to an embodiment, the specific matrix (e.g., the CRC generation matrix) may be obtained from the parity check matrix.

[0193] According to an embodiment, in operation 1003, the sending node 710 may identify a first column among the columns of the parity check matrix of a specific matrix (e.g., a CRC generation matrix) that satisfies a first condition. For example, the first condition may be the column with the lowest Hamming weight among the columns of the parity check matrix, the column with the highest Hamming weight among the columns of the parity check matrix, the column with the lowest column index among the columns of the parity check matrix, and / or any criterion, and any other criterion may be adopted. For example, the sending node 710 identifies the column with the lowest Hamming weight among the columns of the parity check matrix, and in the case where all columns of the parity check matrix have the same Hamming weight, the column with the lowest column index may be determined as the first column.

[0194] In an embodiment, the Hamming weight may be referred to as the number of non-zero components in a column. In an embodiment, the columns of a matrix may be indexed from the left, and a low column index may indicate that the column is closer to the left side among the matrix columns. For example, the column index of the leftmost column in the matrix columns may be 0. A specific matrix (e.g., a CRC generation matrix) may be a 6-row 9-column matrix, a 6×6 matrix may be an identity matrix, and a 6×3 matrix may be a parity check matrix. The first column of the 6×3 parity check matrix may have a column index of 6, the column index of the second column of the parity check matrix may be 7, and the column index of the third column of the parity check matrix may be 8.

[0195] According to an embodiment, in operation 1005, the sending node 710 may sequentially determine one or more columns from the first column based on a second condition, and thus generate a PCR set. For example, the second condition may include at least one of a maximum inner product, a minimum inner product, or any criterion, and any other criterion may be adopted.

[0196] For example, by comparing the first column with other columns in the parity check matrix columns, the second condition may be the column with the largest inner product (e.g., maximum inner product). By comparing the first column with other columns in the parity check matrix columns, the second condition may be the column with the smallest inner product (e.g., minimum inner product). The generation of the PCR set may be illustrated in Figure 12 this.

[0197] The second condition may be the column with the largest inner product and a relatively low column index. For example, in a 6×3 parity check matrix, the inner product of the first column and the second column may be the same as the inner product of the first column and the third column. In the case where the inner products are substantially the same, the sending node 710 may determine the second column with a relatively low column index as the column that satisfies the second condition.

[0198] Operations 1001 to 1005 of the present disclosure may be indicated by the pseudocode as shown in [Table 2].

[0199] [Table 2]

[0200]

[0201] According to an embodiment, in operation 1007, the transmitting node 710 may identify a matrix corresponding to an interleaving pattern. For example, the transmitting node 710 may identify a first column that satisfies a first condition among the columns of a parity check matrix, and identify a matrix with permuted columns by sequentially determining at least one column based on a second condition. In the case where a specific matrix (e.g., a CRC generation matrix) is [Equation 5], the matrix generated or identified by permuting the columns of the specific matrix may be [Equation 6]:

[0202] [Equation 5]

[0203] [Equation 6].

[0204] According to an embodiment, the transmitting node 710 may generate or identify an interleaving pattern based on the generated or identified matrix. For example, the transmitting node 710 may identify an interleaving pattern through the matrix of [Equation 6] to identify an interleaving pattern . Thereafter, the interleaving pattern identified through the matrix identifying the interleaving pattern may be set forth in Figure 11 .

[0205] Operations 1001, 1003, 1005, and 1007 of the present disclosure may be performed between operation 801 and operation 803 of Figure 10 . Accordingly, Figure 8 embodiments of may be combined with embodiments of Figure 10 . However, the combination of Figure 8 and Figure 10 and Figure 8 operations is merely exemplary, and the present disclosure is not limited to the above combination order.

[0206] The sequence of operations 1001 to 1007 is an example, and operations 1001 to 1007 may be performed in parallel or simultaneously.

[0207] Figure 11 Illustrates a method of identifying (or determining) an interleaving pattern based on a CRC generation matrix according to an embodiment of the present disclosure.

[0208] Referring to Figure 11 , in operation 1101, according to an embodiment, the transmitting node 710 may identify a first matrix based on a specific matrix (e.g., a CRC generation matrix) to identify a first matrix For example, the transmitting node 710 may identify a column in a parity check matrix of a specific matrix (e.g., a CRC generation matrix) that satisfies a first condition.

[0209] In an embodiment, the Hamming weight of the first column in the parity check matrix columns is 4, the Hamming weight of the second column is 4, and the Hamming weight of the third column is 4. Since the columns of the parity check matrix all have the same Hamming weight, the transmitting node 710 may identify the first column with the lowest column index as the column that satisfies the first condition.

[0210] In an embodiment, since the first column is the 7th column from the left column of a specific matrix the column index of the first column may be 6. Thus, the first PCR set may be determined as .

[0211] In an embodiment, the transmitting node 710 may extract the 0th column, the 2nd column, the 3rd column, the 4th column, and the 6th column of a specific matrix based on the first PCR set and identify the first matrix .

[0212] According to an embodiment, the transmitting node 710 may determine a first interleaving pattern based on the first parity bit (or first parity check component) of the first column in the parity check matrix columns. For example, the first parity check bit of the first column may be referred to as the first PCR set , and may be determined as the first interleaving pattern. In an embodiment, the first interleaving pattern may indicate an arrangement (or arrangement order) of a plurality of information bits and a plurality of CRC bits.

[0213] According to an embodiment, in operation 1102, the transmitting node 710 may identify a second matrix based on the first matrix . For example, the transmitting node 710 may identify the first parity check bit of the first column and a second column including a second parity check bit that satisfies a second condition.

[0214] In an embodiment, the inner product of the first parity check bit of the first column and the second parity check bit of the second column may be 3, and the inner product of the first parity check bit of the first column and the third parity check bit of the third column may be 2.

[0215] In an embodiment, the transmitting node 710 may identify the second column with a relatively high inner product (or the maximum inner product) as the column that satisfies the second condition.

[0216] In an embodiment, since the second column is from the matrix The 8th column starting from the left column, so the column index of the second column can be 7. Thus, the second PCR set can be determined as .

[0217] In an embodiment, the transmitting node 710 can determine a second interleaving pattern based on the first PCR set (or the first interleaving pattern) and the second PCR set. For example, the components or elements included in the first PCR set and the second PCR set can be determined to be included in the second interleaving pattern. For example, the second interleaving pattern can be determined as . The second interleaving pattern can indicate the arrangement (or arrangement order) of a plurality of information bits and a plurality of CRC bits.

[0218] In an embodiment, the transmitting node 710 can extract a specific matrix based on the second interleaving pattern of the 0th column, the 2nd column, the 3rd column, the 4th column, the 5th column, the 6th column, and the 7th column, and identify the second matrix .

[0219] According to an embodiment, in operation 1103, the transmitting node 710 can identify a matrix based on the second matrix . For example, the transmitting node 710 can identify the 3rd column as the last column of the parity check matrix.

[0220] In an embodiment, since the 3rd column is the 9th column starting from the left column of , the column index of the 3rd column can be 8. Thus, the third PCR set can be determined as .

[0221] In an embodiment, the transmitting node 710 can determine a third interleaving pattern based on the second interleaving pattern and the third PCR set. For example, the components or elements included in the second interleaving pattern and the third PCR set can be determined to be included in the third interleaving pattern. For example, the third interleaving pattern can be determined as . The third interleaving pattern can indicate the arrangement (or arrangement order) of a plurality of information bits and a plurality of CRC bits.

[0222] According to an embodiment, the third interleaving pattern can correspond to Figure 8 the interleaving pattern described in operation 803 of Figure 8 . For example, in operation 803 of

[0223] According to an embodiment, the transmitting node 710 may use an interleaving pattern to interleave at least some of the plurality of information bits and the plurality of CRC bits. For example, the transmitting node 710 may use an interleaving pattern to interleave all of the plurality of information bits and the plurality of CRC bits. For example, the transmitting node 710 may use an interleaving pattern to interleave only some of the plurality of information bits and the plurality of CRC bits.

[0224] For example, the transmitting node 710 may use an interleaving pattern to interleave only the plurality of CRC bits among the plurality of bits. For example, the transmitting node 710 may use an interleaving pattern to interleave only the plurality of information bits among the plurality of bits. For example, the transmitting node 710 may use an interleaving pattern to interleave some of the plurality of information bits and some of the plurality of CRC bits.

[0225] Figure 12 Shows a changed (or modified) PCR set according to an embodiment of the present disclosure.

[0226] Reference Figure 12 According to an embodiment, the transmitting node 710 may identify or generate a CRC-encoded vector by concatenating the plurality of CRC bits to the plurality of information bits. For example, the plurality of information bits may correspond to six bits, and the plurality of CRC bits may correspond to three bits.

[0227] According to an embodiment, the transmitting node 710 may identify an original PCR set from the CRC-encoded vector. For example, the first original PCR set may be and the second original PCR set may be and the third original PCR set may be . In an embodiment, the transmitting node 710 may identify or determine an interleaving pattern. For example, the interleaving pattern may be determined as .

[0228] The original PCR set of the present disclosure Figure 12 may be used only for but not limited to distinguishing from other PCR sets.

[0229] Identifying the original PCR set in the present disclosure may be performed in a substantially same manner as identifying Figure 11 the first PCR set. Identifying the interleaving pattern in the present disclosure may be performed in a substantially same manner as identifying Figure 11 the third interleaving pattern.

[0230] According to an embodiment, the transmitting node 710 may interleave the CRC-encoded vector. For example, the transmitting node 710 may interleave the plurality of bits included in the CRC-encoded vector.

[0231] According to an embodiment, the original PCR set may include information about at least one parity bit included in a column corresponding to a plurality of CRC bits and information about the arrangement order of the columns corresponding to the plurality of CRC bits. For example, the first original PCR set may be , and may include the parity bit information of the eighth column (for example, each of the first column component, the third column component, the fourth column component, and the sixth column component is 1). may indicate that the column corresponding to the first CRC bit of the CRC bits is arranged in the seventh column of the CRC-encoded vector. That is, as a component of the first original PCR set may indicate the column index of the column corresponding to the first CRC bit. The CRC-encoded vector may indicate the vector before the bits are interleaved.

[0232] For example, the second original PCR set may be , and may include the parity bit information of the ninth column (for example, each of the second column component, the fourth column component, the sixth column component, and the seventh column component is 1). may indicate that the column corresponding to the second CRC bit of the CRC bits is arranged in the ninth column of the CRC-encoded vector. That is, as a component of the second original PCR set may indicate the column index of the column corresponding to the second CRC bit.

[0233] For example, the third original PCR set may be , and may include the parity bit information of the 10th column (for example, each of the first column component, the fifth column component, the sixth column component, and the seventh column component is 1). may indicate that the column corresponding to the third CRC bit of the CRC bits is arranged in the 10th column of the CRC-encoded vector. That is, as a component of the original PCR set may indicate the column index of the column corresponding to the third CRC bit.

[0234] According to an embodiment, the transmitting node 710 may identify the modified PCR set based on the original PCR set. In an embodiment, the modified PCR set may be referred to as the PCR set of the interleaved vector.

[0235] For example, the CRC bits in the CRC-encoded vector may be arranged in the eighth column and the eighth to 10th columns. Therefore, the CRC bits may have column indices in sequence.

[0236] In an embodiment, when the CRC-encoded vector is in accordance with When the interleaving pattern is rearranged, the column indices of the bits included in the interleaving vector can be represented starting from the left as .

[0237] In an embodiment, the transmitting node 710 can represent the newly modified column indices starting from the left of the interleaving vector , and the newly modified column indices can be of those starting from the left .

[0238] In an embodiment, the transmitting node 710 can determine a first modified PCR set corresponding to a first original PCR set as . In an embodiment, the transmitting node 710 can determine a second modified PCR set corresponding to a second original PCR set as . The transmitting node 710 can determine a third modified PCR set corresponding to a third original PCR set as .

[0239] According to an embodiment, the modified PCR set can indicate information about the arrangement order of a plurality of information bits and the arrangement of a plurality of CRC bits. For example, the of the first modified PCR set can indicate that the column index of the in the CRC encoding vector of the information bits has a modified column index of in the interleaving vector . For example, the of the first modified PCR set can indicate that the modified column index of the first-order CRC bit (e.g., the first CRC bit) is 4.

[0240] For example, the of the second modified PCR set can indicate that the column index of the in the CRC encoding vector of the information bits has a modified column index of in the interleaving vector . In an embodiment, the information bit having a column index of 1 in the CRC encoding vector can have a modified column index of 5 in the interleaving vector. The information bit having a column index of 3 in the CRC encoding vector can have a modified column index of 2 in the interleaving vector. For example, the of the second modified PCR set can indicate the modified column index of the second CRC bit (e.g., the second CRC bit) It is 7.

[0241] For example, the third modified PCR set of can indicate the column index in the CRC-encoded vector where the information bits have the modified column index in the interleaving vector . For example, the of the third modified PCR set can indicate the modified column index of the third-order CRC bits (e.g., the third CRC bit) which is 8.

[0242] According to an embodiment, the transmitting node 710 can perform rate profiling on the interleaving vector. For example, the transmitting node 710 can concatenate a plurality of frozen bits to the interleaving vector.

[0243] According to an embodiment, the transmitting node 710 can identify the PCR set based on the modified PCR set. The third PCR set can be referred to as the PCR set of the information vector.

[0244] For example, the transmitting node 710 can identify the final column index newly modified from the left side of the information vector . Starting from the left side, the last column index can be .

[0245] In an embodiment, the transmitting node 710 can identify that the information bits having the modified column index in the interleaving vector have the final column index in the information vector . Thus, the transmitting node 710 can determine the first PCR set as .

[0246] According to an embodiment, the PCR set can indicate the arrangement of a plurality of information bits and the arrangement of a plurality of CRC bits for rate profiling. For example, the first PCR set of can indicate the final column index in the information vector of the information bits having the modified column index in the interleaving vector . For example, the of the first PCR set can indicate the final column index in the information vector of the CRC bits having the modified column index in the interleaving vector .

[0247] For example, the second PCR set of can indicate the final column index in the information vector of the information bits having a modified index in the interleaving vector . For example, for the second PCR set can indicate the final column index in the information vector of the information bits having a modified index in the interleaving vector .

[0248] For example, the third PCR set of can indicate the final column index in the information vector of the information bits having a modified index in the interleaving vector . For example, for the third PCR set can indicate the final column index in the information vector of the CRC bits having a modified column index in the interleaving vector .

[0249] Figure 13 shows a method for decoding at a receiving node according to an embodiment of the present disclosure.

[0250] Referring to Figure 13 , according to an embodiment, in operation 1301, the receiving node 720 may receive a codeword including a plurality of information bits and a plurality of CRC bits from the transmitting node 710.

[0251] According to an embodiment, using an interleaving pattern to interleave the plurality of information bits and the plurality of CRC bits may be substantially performed at the transmitting node 710.

[0252] According to an embodiment, the receiving node 720 may receive interleaving pattern information corresponding to the TBS from the transmitting node 710. For example, in order to decode the received codeword, the receiving node 720 may need to identify the interleaving pattern and may receive the interleaving pattern information from the transmitting node 710. As another example, the transmitting node 710 and the receiving node 720 may be configured with an interleaving pattern corresponding to the TBS.

[0253] According to an embodiment, in operation 1303, the receiving node 720 may decode the plurality of CRC bits included in the received codeword and interleaved using the interleaving pattern.

[0254] For example, the receiving node 720 may decode the bits included in the codeword received using a search tree scheme. The receiving node 720 may extract the information bits from the decoded bits based on the interleaving pattern and the PCR set information.

[0255] According to an embodiment, PCR set information can be received from the transmitting node 710. For example, the transmitting node 710 can send the PCR set information when or before sending a codeword to the receiving node 720. As another example, the PCR set information can be preconfigured for the transmitting node 710 and the receiving node 720.

[0256] The sequence of operations 1301 to 1303 is an example, and operations 1301 to 1303 can be performed in parallel or simultaneously.

[0257] Figure 14 A diagram showing a method for decoding at a receiving node according to an embodiment of the present disclosure.

[0258] Reference Figure 14 , according to an embodiment, the receiving node 720 can receive a codeword including any number (e.g., 5) of bits and decode the codeword. For example, the codeword can include a first bit and a second bit corresponding to frozen bits, a third bit and a fifth bit corresponding to information bits, and a fourth bit corresponding to a CRC bit.

[0259] According to an embodiment, the receiving node 720 can generate or identify a search tree 1400 to decode a codeword including at least five bits.

[0260] According to an embodiment, the search tree 1400 can include multiple nodes, and the multiple nodes can have different bit levels. For example, the first node 1401 can have a bit level of 0, the second node 1402 can have a bit level of 1, and the third node 1403 can have a bit level of 2. The fourth node 1404 can have a bit level of 3, and the fifth node 1405 can have a bit level of 4.

[0261] According to an embodiment, the path between nodes can correspond to a bit. For example, the path between the first node 1401 and the second node 1402 can correspond to the first bit. The path between the second node 1402 and the third node 1403 can correspond to the second bit. For example, the path between the third node 1403 and the fourth node 1404 can correspond to the third bit. The path between the fourth node 1404 and the fifth node 1405 can correspond to the fourth bit.

[0262] According to an embodiment, the receiving node 720 can identify that the first bit and the second bit are frozen bits and determine or estimate that the values corresponding to the first bit and the second bit are "0".

[0263] According to an embodiment, the receiving node 720 may identify that the third bit is an information bit and decode the information bit. For example, the receiving node 720 may estimate a reliability value of the third bit and compare the reliability value with a first threshold. In a case where the reliability value is greater than the first threshold, the receiving node 720 may determine the bit value of the third bit.

[0264] In Figure 14 the example shown, the receiving node 720 may estimate the third bit as "0" and compare a first reliability value of the estimated "0" with the first threshold. In a case where the first reliability value is greater than the first threshold, the receiving node 720 may estimate or determine the third bit value as "0".

[0265] Unlike Figure 14 the example shown, in a case where the first reliability value is less than the first threshold, the receiving node 720 may estimate the third bit as "1". The receiving node 720 may compare a second reliability value of the estimated value "1" with the first threshold. In a case where the second reliability value is greater than the first threshold, the receiving node 720 may estimate or determine the third bit value as "1".

[0266] According to an embodiment, the receiving node 720 may identify that the fourth bit is a CRC bit and decode the fourth bit as a CRC bit. In an embodiment, the receiving node 720 may perform CRC at the fourth node 1404. For example, the receiving node 720 may decode the fourth bit and then perform CRC using the first bit value, the second bit value, the third bit value, and the fourth bit value. For example, the receiving node 720 may perform CRC in response to decoding the CRC bit (e.g., the fourth bit). For example, the receiving node 720 may perform CRC in response to identifying the CRC bit (e.g., the fourth bit) value.

[0267] According to an embodiment, in a case where the CRC is successfully decoded (e.g., early CRC), the receiving node 720 may decode the bits included in the received codeword that are arranged after the CRC bit (e.g., the fourth bit). For example, the decoding result of the fourth bit may be determined as "0", the decoded bits are "0000", and thus the CRC result may be successful. Since the early CRC is successful, the receiving node 720 may rely on the decoded value "0000" and decode the fifth bit.

[0268] Thus, the receiving node 720 can minimize or reduce the search space by performing an early CRC (or early CRC). For example, the decoding result of the fifth bit, which is the information bit and the fifth-order bit, can be estimated or determined as "0", and the decoding result of the sixth bit, which is the information bit and the sixth-order bit, can be estimated or determined as "1". The decoding result of the seventh-order bit, which is the CRC bit and the seventh-order bit, can be determined as "0". In this example, the receiving node 720 can perform an early CRC, and the CRC result of "0000010" can be a failure.

[0269] In an embodiment, the receiving node 720 can return and decode the fifth bit or the sixth bit. That is, since the CRC result of the first to fourth bits is successful, the receiving node 720 may not need to return to the first to fourth bits. Thus, the receiving node 720 can minimize or reduce the search space.

[0270] However, the above example merely simplifies the explanation, and the present disclosure is not limited to the above example. For example, even if the first CRC based on "0000" is successful, but the second CRC based on "0000010" fails, the receiving node 720 can return to the first to fourth bits. For example, if a specified condition is satisfied, the receiving node 720 can return to the first to fourth bits. The specified condition can indicate that the receiving node 720 returns to the fifth and sixth bits for decoding, but a decoding result that satisfies a specific reliability value is not obtained.

[0271] In an embodiment, a CRC failure indication includes that the path including the fourth bit in the search tree is incorrect. For example, since the decoding result of the fourth bit may be determined as "1", and the decoded bits are "0001", the CRC result may be a failure.

[0272] According to an embodiment, in response to a CRC failure, the receiving node 720 can re-attempt to decode the bits (e.g., the fourth bit) arranged before the CRC bit. For example, in the case where the CRC result fails, the receiving node 720 can return to the first component of the PCR set received from the sending node 710 and re-attempt to decode. That is, in the case where the CRC result fails, the receiving node 720 can return to the first node to re-attempt to decode.

[0273] In the present disclosure, the bits arranged before the CRC bit can be referred to as the bits decoded before the CRC bit among the multiple bits. In the present disclosure, the bits arranged after or subsequent to the CRC bit can be referred to as the bits decoded after the CRC bit among the multiple bits.

[0274] According to an embodiment, when the CRC result is successful, in the next decoding, it may not be necessary to return or move backward to a node with a lower bit level than the fourth node 1404 (e.g., the third node 1403). Alternatively, when the CRC result is successful, in the next decoding, it may not be necessary to re-decode the bits arranged before the CRC bit (e.g., the fourth bit). However, even if the CRC is successful, the receiving node 720 may return or move backward to a node with a lower bit level than the fourth node 1404.

[0275] Accordingly, as the CRC bits are interleaved, the receiving node 720 can reduce the search space and minimize or reduce the latency.

[0276] For example, since the CRC bits are not interleaved, it can be assumed that the decoded bits from the first node 1401 to the nth node are all information bits, and the bit decoded at the (n + 1)th node is the CRC bit. In this example, the decoded bits from the first node 1401 to the nth node can be "0001...1", and the receiving node 720 performs CRC based on "0001...1", but the CRC result can be "failed". That is, when the CRC bits are not interleaved, the receiving node 720 can decode from the first node 1401 to the nth node, and then perform CRC, and in the case of CRC failure, search all nodes from the first node 1401 to the nth node. Therefore, when the CRC bits are not interleaved, a considerable amount of time may be consumed in decoding.

[0277] In contrast, when the CRC bits are interleaved in the interleaving pattern according to the embodiment, the receiving node 720 can perform early CRC in response to decoding the CRC bit (e.g., the fourth bit), and in the case of CRC failure, can re-decode the first bit to the fourth bit without decoding at a node with a lower bit level than the fourth node 1404. That is, by performing early CRC, the receiving node 720 can reduce or minimize the search space. That is, by early identifying the decoding error through early CRC, the receiving node 720 can reduce or minimize unnecessary decoding.

[0278] Accordingly, according to an embodiment, the receiving node 720 can reduce the search space and latency by interleaving the CRC bits in an interleaving pattern. For example, as the CRC bits are interleaved, the receiving node 720 can perform early CRC. When early CRC is performed, the receiving node 720 can reduce the search space and latency.

[0279] According to an embodiment, the receiving node 720 may decode the fifth node. For example, the receiving node 720 may identify a third reliability of the fifth bit as an information bit and compare the third reliability with a second threshold. In a case where the third reliability value is greater than the second threshold, the receiving node 720 may determine the fifth bit value. In an embodiment, the second threshold may be higher than the first threshold.

[0280] In the present disclosure, a CRC success may indicate that the bits decoded by the receiving node 720 substantially correspond to or match the bits encoded by the transmitting node 710. In the present disclosure, a CRC failure may indicate that the bits decoded by the receiving node 720 do not substantially correspond to or at least partially match the bits encoded by the transmitting node 710. According to an embodiment, in a case of a CRC failure, the receiving node 720 may re-decode the received bits in various ways and perform correction.

[0281] In the present disclosure, in a case of a CRC (or early CRC) failure, the receiving node 720 may use various methods to perform decoding, which will be described below.

[0282] According to an embodiment, in a case of a CRC failure, the receiving node 720 may identify a node at the highest bit level among the nodes included in the search path and return to a node at a bit level lower than the identified highest bit level.

[0283] For example, the receiving node 720 may determine the fourth bit as a CRC bit to be "1" and determine a search path to the sixth node 1406. In response to a CRC failure, the receiving node 720 may return to the fourth node 1404. In this example, returning from the sixth node 1406 to the fourth node 1404 may be referred to as "backward". In this example, the receiving node 720 may perform decoding again starting from the fourth node 1404.

[0284] For example, the receiving node 720 may determine the fourth bit as a CRC bit to be "1" and determine a search path to the sixth node 1406. In response to a CRC failure, the receiving node 720 may return to the first node 1401. In this example, the receiving node 720 may perform decoding again starting from the first node 1401. In this example, returning to the first node 1401 may substantially indicate that the receiving node 720 returns to the first component of the PCR set it received. In other words, the first component of the PCR set received by the receiving node 720 from the transmitting node 710 may substantially correspond to the first bit of the received codeword. Therefore, returning to the first node 1401 may have substantially the same meaning as returning to the first component of the PCR set.

[0285] According to an embodiment, in the case of a CRC failure, the receiving node 720 may identify the node with the highest bit level among the nodes included in the search path, and change the search path to a node at a bit level substantially the same as the identified highest bit level.

[0286] For example, the receiving node 720 may determine the fourth bit, which is a CRC bit, as "1". The search path to the sixth node 1406 may be determined. In response to the CRC failure, the receiving node 720 may change the search path to the fifth node 1405 having a bit level substantially the same as that of the sixth node 1604. The receiving node 720 may decode back from the fifth node 1405. Changing the search path between nodes with substantially the same bit level may be substantially referred to as "lateral (or finding another option)".

[0287] According to an embodiment, the receiving node 720 may flip the bit value of the lowest branch metric in the search tree 1400. For example, in the case of a CRC failure and the bit value of the lowest branch metric in the search tree 1400 is estimated as "0", the receiving node 720 may change the bit value to "1". For example, in the case of the lowest bit value being estimated as "1", the receiving node 720 may change the bit value to "0".

[0288] The present disclosure Figure 14 describes correcting the bit value based on the nodes of the search tree, but this is merely exemplary. The correction of the bit value may be described based on bits.

[0289] For example, in the case of a CRC failure, the receiving node 720 may re-decode the bits lower than the CRC bit. For example, if CRC is performed on the fourth bit, which is a CRC bit, but the CRC fails, the receiving node 720 may return to the third bit lower than the fourth bit. In this example, returning to the third bit may be substantially referred to as "backward". For example, in the case of performing CRC on the fourth bit, which is a CRC bit, but the CRC fails, the receiving node 720 may return to the first bit. In the present disclosure, the bits lower than the CRC bit may indicate the bits arranged before the CRC bit in the substantially received codeword.

[0290] According to an embodiment of the present disclosure, a method performed by a transmitting node in a wireless communication system may include encoding a plurality of information bits using a plurality of CRC bits, interleaving the plurality of information bits and the plurality of CRC bits using an interleaving pattern, generating a codeword by performing convolutional coding and polar coding on the interleaved plurality of information bits and the interleaved plurality of CRC bits, and transmitting the codeword to a receiving node. The interleaving pattern may correspond to a matrix generated based on the size of the plurality of information bits and the size of the plurality of CRC bits.

[0291] According to an embodiment, a matrix can be generated by permuting columns of a specific matrix including an identity matrix and a parity check matrix. Permuting the columns can include identifying a first column among the columns of the parity check matrix that satisfies a first condition, and generating a PCR set by sequentially determining one or more columns starting from the first column based on a second condition.

[0292] According to an embodiment, the first condition can include at least one of a minimum Hamming weight, a maximum Hamming weight, a lowest column index, or any criterion. The second condition can include at least one of a maximum inner product, a minimum inner product, or any criterion.

[0293] According to an embodiment, the method can further include determining a first interleaving pattern based on a first parity check component in the first column among the columns of the parity check matrix, identifying a second column including a second parity check component that satisfies the second condition with the first parity check component of the first column, and determining a second interleaving pattern based on the second parity check component of the second column. The first interleaving pattern can indicate a first arrangement of a plurality of information bits and a plurality of CRC bits. The second interleaving pattern can include the first interleaving pattern.

[0294] According to an embodiment, the plurality of information bits and the plurality of CRC bits can be interleaved based on a second arrangement order indicated by the second interleaving pattern.

[0295] According to an embodiment, the method can further include identifying columns corresponding to the plurality of CRC bits among the plurality of columns of the matrix, identifying a first PCR set including information about parity check components of columns corresponding to the plurality of CRC bits and information about an arrangement order of columns corresponding to the plurality of CRC bits, identifying a second PCR set including information about an arrangement of the plurality of information bits and an arrangement of the interleaved plurality of CRC bits based on the first PCR set, and identifying a third PCR set including information about an arrangement of the plurality of information bits and an arrangement of the rate-profile plurality of CRC bits based on the second PCR set.

[0296] According to an embodiment of the present disclosure, a transmitting node in a wireless communication system can include a transceiver and a controller. The controller can be configured to encode a plurality of information bits using a plurality of CRC bits, interleave the plurality of information bits and the plurality of CRC bits using an interleaving pattern, generate a codeword by convolutional coding and polar coding the interleaved plurality of information bits and the interleaved plurality of CRC bits, and transmit the codeword to a receiving node. The interleaving pattern can correspond to a matrix generated based on the size of the plurality of information bits and the size of the plurality of CRC bits.

[0297] According to an embodiment, a matrix may be generated by permuting columns of a specific matrix including an identity matrix and a parity-check matrix. The columns may be permuted by: identifying a first column among the columns of the parity-check matrix that satisfies a first condition; and generating a PCR set by sequentially determining one or more columns starting from the first column based on a second condition.

[0298] According to an embodiment, the first condition may include at least one of a minimum Hamming weight, a maximum Hamming weight, a lowest column index, or any criterion. The second condition may include at least one of a maximum inner product, a minimum inner product, or any criterion.

[0299] According to an embodiment, a controller may be configured to determine (or identify) a first interleaving pattern based on a first parity-check component in a first column among the columns of the parity-check matrix, and the first interleaving pattern may indicate a first arrangement of a plurality of information bits and a plurality of CRC bits. The controller may be configured to: identify a second column including a second parity-check component that satisfies the second condition with the first parity-check component of the first column; and determine a second interleaving pattern based on the second parity-check component of the second column. The plurality of information bits and the plurality of CRC bits may be interleaved based on a second arrangement order indicated by the second interleaving pattern. The second interleaving pattern may include the first interleaving pattern.

[0300] According to an embodiment, a controller may be configured to identify columns corresponding to a plurality of CRC bits among a plurality of columns of a matrix, and identify a first PCR set including parity-check bit information about the columns corresponding to the plurality of CRC bits and arrangement information about the columns corresponding to the plurality of CRC bits. The controller may be configured to identify a second PCR set including information about an arrangement of a plurality of information bits and an arrangement of interleaved CRC bits based on the first PCR set, and identify a third PCR set including information about an arrangement of a plurality of information bits and an arrangement of rate-profile CRC bits based on the second PCR set.

[0301] According to an embodiment of the present disclosure, a method performed by a receiving node in a wireless communication system may include receiving, from a transmitting node, a codeword including a plurality of information bits and a plurality of CRC bits, and decoding the plurality of CRC bits included in the received codeword and interleaved using an interleaving pattern. The plurality of information bits and the plurality of CRC bits may be interleaved using the interleaving pattern. The interleaving pattern may correspond to a matrix generated based on the sizes of the plurality of information bits and the plurality of CRC bits.

[0302] According to an embodiment, the codeword may be generated by performing convolutional coding and polar coding on the interleaved plurality of information bits and the interleaved plurality of CRC bits.

[0303] According to an embodiment, multiple CRC bits can be decoded using a search tree scheme. The tree in the search tree scheme can include multiple nodes.

[0304] According to an embodiment, decoding multiple CRC bits can include decoding a first CRC bit among the multiple CRC bits, and in response to a successful CRC result upon decoding the first CRC bit, decoding bits arranged after the first CRC bit among the bits included in the received codeword, and in the case where the CRC result of the first CRC bit fails, decoding bits arranged before the first CRC bit among the bits included in the received codeword.

[0305] According to an embodiment, the method may further include decoding multiple information bits. Decoding the multiple information bits can include comparing a first reliability of a first information bit with a first threshold, and in the case where the first reliability is higher than the first threshold, comparing a second reliability of a second information bit with a second threshold. The second threshold can be higher than the first threshold.

[0306] According to an embodiment of the present disclosure, a receiving node in a wireless communication system can include a transceiver and a controller. The controller can be configured to receive, from a sending node, a codeword including multiple information bits and multiple CRC bits, and decode the multiple CRC bits included in the received codeword and interleaved using an interleaving pattern. The multiple information bits and the multiple CRC bits can be interleaved using the interleaving pattern. The interleaving pattern can correspond to a matrix generated based on the size of the multiple information bits and the size of the multiple CRC bits.

[0307] According to an embodiment, the codeword can be generated by performing convolutional coding and polar coding on the interleaved multiple information bits and the interleaved multiple CRC bits.

[0308] According to an embodiment, multiple CRC bits can be decoded using a search tree scheme. The tree in the search tree scheme can include multiple nodes.

[0309] According to an embodiment, the controller can be configured to decode a first CRC bit among the multiple CRC bits, and in response to a successful CRC result upon decoding the first CRC bit, decode bits arranged after the first CRC bit among the bits included in the received codeword, and in the case where the CRC result of the first CRC bit fails, decode bits arranged before the first CRC bit among the bits included in the received codeword.

[0310] According to an embodiment, the controller can be configured to decode multiple information bits, compare a first reliability of a first information bit with a first threshold, and in the case where the first reliability is higher than the first threshold, compare a second reliability of a second information bit with a second threshold. The second threshold can be higher than the first threshold.

[0311] Meanwhile, this specification and the accompanying drawings disclose the preferred content of the present disclosure, and specific terms are used. These terms are only used in a general sense to easily explain the technical details of the present disclosure and help understand the present disclosure, rather than limiting the scope of the present disclosure. It is obvious to those skilled in the art that other modifications can be made based on the technical idea of the present disclosure in addition to the embodiments disclosed herein.

Claims

1. A method performed by a transmitting node in a wireless communication system, the method comprising: Encoding a plurality of information bits based on a plurality of cyclic redundancy check (CRC) bits; Interleaving the plurality of information bits and the plurality of CRC bits based on an interleaving pattern, the interleaving pattern corresponding to a matrix generated based on the sizes of the plurality of information bits and the plurality of CRC bits; Generating a codeword by performing convolutional coding and polar coding on the interleaved plurality of information bits and the interleaved plurality of CRC bits; And Transmitting the codeword to a receiving node.

2. The method according to claim 1, wherein, The matrix is generated by permuting columns of a specific matrix including an identity matrix and a parity check matrix, and wherein, the permuting of columns includes: Identifying a first column in the columns of the parity check matrix that satisfies a first condition, and Generating a parity check relation (PCR) set by sequentially determining one or more columns starting from the first column based on a second condition.

3. The method according to claim 2, wherein The first condition includes at least one of minimum Hamming weight, maximum Hamming weight, lowest column index, or any criterion, and wherein, the second condition includes at least one of maximum inner product, minimum inner product, or any criterion.

4. The method according to claim 2, further comprising: Identifying a first interleaving pattern based on a first parity check component in the first column among the columns of the parity check matrix, wherein the first interleaving pattern indicates a first permutation order of the plurality of information bits and the plurality of CRC bits; Identifying a second column including a second parity check component that satisfies the second condition using the first parity check component of the first column; And Determining a second interleaving pattern based on the second parity check component of the second column, wherein, the second interleaving pattern includes the first interleaving pattern, and wherein, the plurality of information bits and the plurality of CRC bits are interleaved based on a second permutation order indicated by the second interleaving pattern.

5. A transmitting node in a wireless communication system, the transmitting node comprising: A transceiver; And A controller, coupled to the transceiver and configured to: Encode a plurality of information bits based on a plurality of cyclic redundancy check (CRC) bits, Interleave the plurality of information bits and the plurality of CRC bits based on an interleaving pattern, the interleaving pattern corresponding to a matrix generated based on the sizes of the plurality of information bits and the plurality of CRC bits, Generate a codeword by performing convolutional coding and polar coding on the interleaved plurality of information bits and the interleaved plurality of CRC bits, and Transmit the codeword to a receiving node.

6. The sending node according to claim 5, wherein, The matrix is generated by permuting columns of a specific matrix including an identity matrix and a parity check matrix, and wherein, the controller is further configured to identify a first column in the columns of the parity check matrix that satisfies the first condition, and generate a parity check relation (PCR) set by sequentially determining one or more columns starting from the first column based on the second condition.

7. The transmitting node according to claim 6, wherein, The first condition includes at least one of minimum Hamming weight, maximum Hamming weight, lowest column index, or any criterion, and wherein, the second condition includes at least one of maximum inner product, minimum inner product, or any criterion.

8. The transmitting node according to claim 6, wherein, The controller is further configured to: Identifying a first interleaving pattern based on a first parity check component in a first column among columns of a parity check matrix, wherein the first interleaving pattern indicates a first permutation order of a plurality of information bits and a plurality of CRC bits Identifying a second column including a second parity check component satisfying a second condition using the first parity check component of the first column, and Determining a second interleaving pattern based on the second parity check component of the second column wherein the plurality of information bits and the plurality of CRC bits are interleaved based on a second permutation order indicated by the second interleaving pattern, and wherein the second interleaving pattern includes the first interleaving pattern 9. A method performed by a receiving node in a wireless communication system, the method comprising: Receiving, from a transmitting node, a codeword including a plurality of information bits and a plurality of cyclic redundancy check (CRC) bits, wherein the plurality of information bits and the plurality of CRC bits are interleaved based on an interleaving pattern, and wherein the interleaving pattern corresponding to a matrix is generated based on a size of the plurality of information bits and a size of the plurality of CRC bits; And Decoding the plurality of CRC bits included in and interleaved in the received codeword based on the interleaving pattern 10. The method according to claim 9, wherein, The codeword is generated by performing convolutional coding and polar coding on the interleaved plurality of information bits and the interleaved plurality of CRC bits 11. The method according to claim 9, wherein, The plurality of CRC bits are decoded using a search tree scheme, and wherein the tree in the search tree scheme includes a plurality of nodes 12. The method according to claim 9, wherein, Decoding the plurality of CRC bits includes: Decoding a first CRC bit among the plurality of CRC bits; In response to decoding the first CRC bit and the CRC result being identified as a successful result, decoding bits arranged after the first CRC bit among the bits included in the received codeword; and In the case where the CRC result of the first CRC bit is identified as a failure result, decoding bits arranged before the first CRC bit among the bits included in the received codeword 13. A receiving node in a wireless communication system, the receiving node comprising: A transceiver; And A controller, coupled to the transceiver and configured to: Receive, from a transmitting node, a codeword including a plurality of information bits and a plurality of cyclic redundancy check (CRC) bits, wherein the plurality of information bits and the plurality of CRC bits are interleaved based on an interleaving pattern, and wherein the interleaving pattern corresponding to a matrix is generated based on a size of the plurality of information bits and a size of the plurality of CRC bits, and Decode the plurality of CRC bits included in and interleaved in the received codeword based on the interleaving pattern 14. The receiving node according to claim 13, wherein, The codeword is generated by performing convolutional coding and polar coding on the interleaved plurality of information bits and the interleaved plurality of CRC bits 15. The receiving node according to claim 13, wherein, The plurality of CRC bits are decoded using a search tree scheme, and wherein the tree in the search tree scheme includes a plurality of nodes

Images