WO2018151545A1 - Information transmission method and transmission device - Google Patents

Abstract

In a wireless communication system, a transmission device carries out rate matching with respect to the output bit sequence of a polar code. In the rate matching of the present invention, the order of bits to be punctured and the order of bits to be repeated with respect to the output bit sequence are the same.

Description

Information transmission method and transmission device

The present invention relates to a wireless communication system, and to a method and apparatus for transmitting information.

Various devices and technologies such as machine-to-machine (M2M) communication, machine type communication (MTC), smart phones, tablet PCs, and the like, which require high data transfer rates, have emerged and spread. have. Accordingly, the amount of data required to be processed in cellular networks is growing very rapidly. In order to meet this rapidly increasing data processing demand, carrier aggregation technology, cognitive radio technology, etc. to efficiently use more frequency bands, and the like, increase the data capacity transmitted within a limited frequency. Multi-antenna technology, multi-base station cooperation technology, and the like are developing.

As more communication devices require greater communication capacity, there is a need for enhanced mobile broadband (eMBB) communications over legacy radio access technology (RAT). In addition, massive machine type communication (mMTC) for connecting a plurality of devices and objects to provide various services anytime and anywhere is one of the major issues to be considered in next-generation communication.

In addition, there is a discussion on a communication system to be designed in consideration of a service / UE that is sensitive to reliability and latency. The introduction of next generation radio access technology has been discussed in consideration of eMBB communication, mMTC, ultra-reliable and low latency communication (URLLC), and the like.

With the introduction of a new wireless communication technology, not only the number of UEs that a base station needs to provide service in a predetermined resource area increases, but also the amount of data and control information transmitted / received by UEs that provide service It is increasing. Since the amount of radio resources available for the base station to communicate with the UE (s) is finite, the base station uses finite radio resources to transmit uplink / downlink data and / or uplink / downlink control information to / from the UE (s). There is a need for a new scheme for efficient reception / transmission. In other words, as the density of nodes increases and / or the density of user devices increases, a method for efficiently using high density nodes or high density user devices for communication is required.

In addition, over time, overcoming delay or delay has emerged as an important problem. Increasingly applications are critically dependent on delay / delay. Therefore, there is a need for a scheme for reducing delay / delay than in existing systems.

In addition, according to the development of smart devices, a new method for efficiently transmitting / receiving a small amount of data or transmitting / receiving data occurring at a low frequency is required.

In addition, the use of frequency bands that are not used in the past has been discussed with the development of the technology. Since the newly introduced frequency bands are different from the existing frequency bands, it is difficult to apply existing communication technologies as they are. Therefore, it is required to introduce a communication technology suitable for the frequency band newly used for communication.

Technical problems to be achieved by the present invention are not limited to the above-mentioned technical problems, and other technical problems not mentioned above are apparent to those skilled in the art from the following detailed description. Can be understood.

In a wireless communication system, a transmitter performs rate matching on an output bit sequence of a polar code. In the rate matching of the present invention, the bit order punctured for the output bit sequence and the repeated bit order are the same.

In one aspect of the present invention, a method for transmitting information by a transmitter in a wireless communication system is provided. The method comprises: encoding a input information using a polar code of mother code size N to generate a first output bit sequence of length N; Transmitting the second output bit sequence by rate-matching the first output bit sequence if the number of transmission bits M and the mother code size N are different. Transmitting the second output bit sequence includes: if M> N, further transmitting MN bits in a specific order among the bits of the first output bit sequence together with the first output bit sequence, wherein M < If N, then transmitting M bits other than NM bits in the same order as the specific order of the first output bit sequence.

In another aspect of the present invention, a transmitter for transmitting information in a wireless communication system is provided. The transmitter includes a radio frequency (RF) unit and a processor configured to control the RF unit. The processor is configured to: encode input information using a polar code of mother code size N to generate a first output bit sequence of length N; And if the number of transmit bits M and mother code size N are different, control the RF unit to rate-match the first output bit sequence to transmit a second output bit sequence. The processor controls the RF unit to further transmit MN bits in a specific order among the bits of the first output bit sequence together with the first output bit sequence if M> N, and if M <N, And control the RF unit to transmit the remaining M bits except for the NM bits in the same order as the specific order of the first output bit sequence.

In each aspect of the present invention, the specific order is a descending order of reliability of the input bit positions of the polar code, wherein the MN bits are output bits having the same index as the MN input bit positions having the highest reliability. The NM bits may be output bits corresponding to the NM input bit positions with the highest reliability.

In each aspect of the present invention, the specific order is an ascending order of reliability of the input bit positions of the polar code, wherein the MN bits are output bits having the same index as the MN input bit positions having the lowest reliability. The NM bits may be output bits corresponding to the NM input bit positions with the lowest reliability.

In each aspect of the invention, the specific order may be ascending order from the least significant bit of the first output bit sequence.

In each aspect of the invention, the specific order may be in descending order from the most significant bit of the first output bit sequence.

The problem solving methods are only a part of embodiments of the present invention, and various embodiments reflecting the technical features of the present invention are based on the detailed description of the present invention described below by those skilled in the art. Can be derived and understood.

According to an embodiment of the present invention, the wireless communication signal can be efficiently transmitted / received. Accordingly, the overall throughput of the wireless communication system can be high.

According to an embodiment of the present invention, delays / delays generated in the communication process between the user equipment and the base station may be reduced.

In addition, according to the development of smart devices, a small amount of data can be efficiently transmitted / received or data generated at a low frequency can be efficiently transmitted / received.

Signals can also be transmitted / received efficiently and at low error rates in wireless communication systems.

The effects according to the present invention are not limited to the above-mentioned effects, and other effects not mentioned above may be clearly understood by those skilled in the art from the detailed description of the present invention. There will be.

BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are included as part of the detailed description in order to provide a thorough understanding of the present invention, provide an embodiment of the present invention and together with the description, illustrate the technical idea of the present invention.

1 illustrates a process of a transport block in an LTE / LTE-A system.

2 is a block diagram illustrating performing rate matching by separating the systematic and parity portions of an encoded code block.

3 shows the internal structure of the circular buffer.

4 is a block diagram for a polar code encoder.

5 illustrates the concept of channel combining and channel splitting for channel polarization.

6 illustrates N-th level channel combining for polar code.

7 illustrates the evolution of decoding paths during the List-L decoding process.

8 is illustrated to illustrate the concept of selecting location (s) to which information bit (s) are to be allocated in the polar code.

9 illustrates puncturing and information bit allocation in accordance with the present invention.

FIG. 10 conceptually illustrates an iterative scheme and a puncturing scheme used in an IEEE 802.11n series system, which is a wireless communication system with an LTE / LTE-A system.

11 conceptually illustrates an iterative method and a puncturing method according to the present invention.

12 is a block diagram showing the components of the transmitter 10 and the receiver 20 for carrying out the present invention.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. The detailed description, which will be given below with reference to the accompanying drawings, is intended to explain exemplary embodiments of the present invention and is not intended to represent the only embodiments in which the present invention may be practiced. The following detailed description includes specific details in order to provide a thorough understanding of the present invention. However, one of ordinary skill in the art appreciates that the present invention may be practiced without these specific details.

In some instances, well-known structures and devices may be omitted or shown in block diagram form centering on the core functions of the structures and devices in order to avoid obscuring the concepts of the present invention. In addition, the same components will be described with the same reference numerals throughout the present specification.

The techniques, devices, and systems described below can be applied to various wireless multiple access systems. Examples of multiple access systems include code division multiple access (CDMA) systems, frequency division multiple access (FDMA) systems, time division multiple access (TDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, and single carrier frequency division multiple access (SC-FDMA) systems. And a multi-carrier frequency division multiple access (MC-FDMA) system. CDMA may be implemented in a radio technology such as Universal Terrestrial Radio Access (UTRA) or CDMA2000. TDMA may be implemented in radio technologies such as Global System for Mobile Communication (GSM), General Packet Radio Service (GPRS), Enhanced Data Rates for GSM Evolution (EDGE) (i.e., GERAN), and the like. OFDMA may be implemented in wireless technologies such as Institute of Electrical and Electronics Engineers (IEEE) 802.11 (WiFi), IEEE 802.16 (WiMAX), IEEE802-20, evolved-UTRA (E-UTRA), and the like. UTRA is part of Universal Mobile Telecommunication System (UMTS), and 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) is part of E-UMTS using E-UTRA. 3GPP LTE employs OFDMA in downlink (DL) and SC-FDMA in uplink (UL). LTE-advanced (LTE-A) is an evolution of 3GPP LTE. For convenience of explanation, hereinafter, the present invention will be described on the assumption that the present invention is applied to a 3GPP based communication system, for example, LTE / LTE-A, NR. However, the technical features of the present invention are not limited thereto. For example, although the following detailed description is described based on a mobile communication system corresponding to a 3GPP LTE / LTE-A / NR system, except for the matters specific to 3GPP LTE / LTE-A / NR, Applicable to any mobile communication system.

In the following embodiments of the present invention, the expression "assuming" may mean that the subject transmitting the channel transmits the channel so as to correspond to the "assuming". The subject receiving the channel may mean that the channel is received or decoded in a form conforming to the "home", provided that the channel is transmitted to conform to the "home".

In the present invention, the UE may be fixed or mobile, and various devices which communicate with a base station (BS) to transmit and receive user data and / or various control information belong to the same. UE (Terminal Equipment), MS (Mobile Station), MT (Mobile Terminal), UT (User Terminal), SS (Subscribe Station), wireless device, PDA (Personal Digital Assistant), wireless modem ), A handheld device, or the like. In addition, in the present invention, a BS generally refers to a fixed station communicating with the UE and / or another BS, and communicates with the UE and another BS to exchange various data and control information. The BS may be referred to in other terms such as ABS (Advanced Base Station), Node-B (NB), evolved-NodeB (NB), Base Transceiver System (BTS), Access Point, and Processing Server (PS). In particular, the base station of the UTRAN is called Node-B, the base station of the E-UTRAN is called eNB, and the base station of the new radio access technology network is called gNB. Hereinafter, for convenience of description, the BS is collectively referred to as eNB.

In the present invention, a node refers to a fixed point capable of transmitting / receiving a radio signal by communicating with a UE. Various forms of eNBs may be used as nodes regardless of their names. For example, a node may be a BS, an NB, an eNB, a pico-cell eNB (PeNB), a home eNB (HeNB), a relay, a repeater, or the like. Also, the node may not be an eNB. For example, it may be a radio remote head (RRH), a radio remote unit (RRU). RRH, RRU, etc. generally have a power level lower than the power level of the eNB. Since RRH or RRU, RRH / RRU) is generally connected to the eNB by a dedicated line such as an optical cable, RRH / RRU and eNB are generally compared to cooperative communication by eNBs connected by a wireless line. By cooperative communication can be performed smoothly. At least one antenna is installed at one node. The antenna may mean a physical antenna or may mean an antenna port, a virtual antenna, or an antenna group. Nodes are also called points.

In the present invention, a cell refers to a certain geographic area in which one or more nodes provide communication services. Therefore, in the present invention, communication with a specific cell may mean communication with an eNB or a node that provides a communication service to the specific cell. In addition, the downlink / uplink signal of a specific cell means a downlink / uplink signal from / to an eNB or a node that provides a communication service to the specific cell. The cell providing uplink / downlink communication service to the UE is particularly called a serving cell. In addition, the channel state / quality of a specific cell means a channel state / quality of a channel or communication link formed between an eNB or a node providing a communication service to the specific cell and a UE. In a 3GPP based communication system, a UE may transmit a downlink channel state from a specific node to a CRS (s) in which antenna port (s) of the specific node are transmitted on a Cell-specific Reference Signal (CRS) resource allocated to the specific node; / Or can be measured using the CSI-RS (s) transmitted on the Channel State Information Reference Signal (CSI-RS) resources.

In the present invention, the input information to the encoder is a transport block (TB) provided from the medium access control layer (TB), CRC additional TB obtained by adding a cyclic redundancy check (CRC) code to the TB The CRC addition TB may be one CB when a TB is segmented into a plurality of code blocks, or a CRC addition CB when a CRC code is added to the CB.

Meanwhile, the 3GPP-based communication system uses the concept of a cell to manage radio resources. Cells associated with radio resources are distinguished from cells in a geographic area.

A "cell" in a geographic area may be understood as coverage in which a node can provide services using a carrier, and a "cell" of radio resources is a bandwidth (frequency) that is a frequency range configured by the carrier. bandwidth, BW). Downlink coverage, which is a range in which a node can transmit valid signals, and uplink coverage, which is a range in which a valid signal can be received from a UE, depends on a carrier carrying the signal, so that the coverage of the node is determined by the radio resources used by the node. It is also associated with the coverage of the "cell". Thus, the term "cell" can sometimes be used to mean coverage of a service by a node, sometimes a radio resource, and sometimes a range within which a signal using the radio resource can reach a valid strength.

Meanwhile, the 3GPP communication standard uses the concept of a cell to manage radio resources. A "cell" associated with a radio resource is defined as a combination of DL resources and UL resources, that is, a combination of a DL component carrier (CC) and a UL CC. The cell may be configured with DL resources alone or with a combination of DL resources and UL resources. If carrier aggregation is supported, the linkage between the carrier frequency of the DL resource (or DL CC) and the carrier frequency of the UL resource (or UL CC) is indicated by system information. Can be. For example, a combination of DL and UL resources may be indicated by a System Information Block Type 2 (SIB2) linkage. Here, the carrier frequency means a center frequency of each cell or CC. Hereinafter, a cell operating on a primary frequency is referred to as a primary cell (Pcell) or a PCC, and a cell operating on a secondary frequency (or SCC) is referred to as a secondary cell. cell, Scell) or SCC. The carrier corresponding to the Pcell in downlink is called a DL primary CC (DL PCC), and the carrier corresponding to the Pcell in the uplink is called a UL primary CC (DL PCC). Scell refers to a cell that can be configured after RRC (Radio Resource Control) connection establishment is made and can be used for providing additional radio resources. Depending on the capabilities of the UE, the Scell may form a set of serving cells for the UE with the Pcell. The carrier corresponding to the Scell in downlink is called a DL secondary CC (DL SCC), and the carrier corresponding to the Scell in the uplink is called a UL secondary CC (UL SCC). In case of the UE that is in the RRC_CONNECTED state but the carrier aggregation is not configured or does not support the carrier aggregation, there is only one serving cell configured only for the Pcell.

The 3GPP-based communication standard provides downlink physical channels corresponding to resource elements carrying information originating from an upper layer and downlink corresponding to resource elements used by the physical layer but not carrying information originating from an upper layer. Physical signals are defined. For example, a physical downlink shared channel (PDSCH), a physical broadcast channel (PBCH), a physical multicast channel (PMCH), a physical control format indicator channel (physical control format) indicator channel (PCFICH), physical downlink control channel (PDCCH) and physical hybrid ARQ indicator channel (PHICH) are defined as downlink physical channels, reference signal and synchronization signal It is defined as downlink physical signals. A reference signal (RS), also referred to as a pilot, refers to a signal of a predetermined special waveform known to the eNB and the UE. For example, a cell specific RS, UE- UE-specific RS, positioning RS (PRS), and channel state information RS (CSI-RS) are defined as downlink reference signals. The 3GPP-based communication standard includes uplink physical channels corresponding to resource elements carrying information originating from an upper layer and uplink corresponding to resource elements used by the physical layer but not carrying information originating from an upper layer. It defines physical signals. For example, a physical uplink shared channel (PUSCH), a physical uplink control channel (PUCCH), and a physical random access channel (PRACH) are the uplink physical channels. A demodulation reference signal (DMRS) for uplink control / data signals and a sounding reference signal (SRS) used for uplink channel measurement are defined.

In the present invention, Physical Downlink Control CHannel (PDCCH) / Physical Control Format Indicator CHannel (PCFICH) / PHICH (Physical Hybrid automatic retransmit request Indicator CHannel) / PDSCH (Physical Downlink Shared CHannel) are respectively DCI (Downlink Control Information) / CFI (Control). Format Indicator) / Downlink ACK / NACK (ACKnowlegement / Negative ACK) / Downlink Means a set of time-frequency resources or a set of resource elements that carry downlink data, and also includes a physical uplink control channel (PUCCH) and a physical uplink (PUSCH). Shared CHannel) / PRACH (Physical Random Access CHannel) means a set of time-frequency resources or a set of resource elements that carry uplink control information (UCI) / uplink data / random access signals, respectively. PDCCH / PCFICH / PHICH / PDSCH / PUCCH / PUSCH / PRACH RE or time-frequency resource or resource element (RE) assigned to or belonging to PDCCH / PCFICH / PHICH / PDSCH / PUCCH / PUSCH / PRACH. The PDCCH / PCFICH / PHICH / PDSCH / PUCCH / PUSCH / PRACH resource is referred to below: The expression that the user equipment transmits the PUCCH / PUSCH / PRACH is hereinafter referred to as uplink control information / uplink on or through PUSCH / PUCCH / PRACH, respectively. It is used in the same sense as transmitting a data / random access signal, and the expression that the eNB transmits PDCCH / PCFICH / PHICH / PDSCH is used for downlink data / control information on or through PDCCH / PCFICH / PHICH / PDSCH, respectively. It is used in the same sense as sending it.

For terms and techniques not specifically described among the terms and techniques used in the present invention, 3GPP LTE / LTE-A standard document, for example, 3GPP TS 36.211, 3GPP TS 36.212, 3GPP TS 36.213, 3GPP TS 36.321 and 3GPP TS 36.331 and the like, and 3GPP NR standard documents, such as 3GPP TS 38.xxx. In addition, the principles of encoding and decoding using polar codes and polar codes are described in 'E. Arikan, "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels," in IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, July2009).

As more communication devices require larger communication capacities, there is a need for improved mobile broadband communication as compared to conventional radio access technology (RAT). Massive MTC, which connects multiple devices and objects to provide various services anytime and anywhere, is also one of the major issues to be considered in next-generation communication. In addition, a communication system design considering a service / UE that is sensitive to reliability and latency has been discussed. The introduction of next generation RAT considering such advanced mobile broadband communication, Massive MTC, and Ultra-Reliable and Low Latency Communication (URLLC) is being discussed. Currently, 3GPP is working on the next generation mobile communication system after EPC. In the present invention, for convenience, the technology is referred to as a new RAT (new RAT, NR) or 5G RAT.

NR communication systems are required to support significantly better performance than existing fourth generation (4G) systems in terms of data rate, capacity, latency, energy consumption and cost. Thus, NR systems need to make significant advances in the area of bandwidth, spectral, energy, signaling efficiency, and cost per bit. NR needs to utilize efficient waveforms to meet these needs.

1 illustrates a process of a transport block in an LTE / LTE-A system.

In order to correct an error occurring in a channel at the receiving end, information transmitted from the transmitting end is encoded and then transmitted using a forward error correction code. The receiving end demodulates the received signal and then decodes the error correcting code to restore the transmission information. In this decoding process, an error in the received signal caused by the channel is corrected.

Data arrives at a coding block in the behavior of up to two transport blocks per TTI per DL / UL cell. The following coding steps may be applied for each transport block of a DL / UL cell:

Adding CRC to the transport block;

Code block segmentation and code block CRC attachment;

Channel coding;

Rate matching;

Code block concatenation.

There are various kinds of error correction codes, but Turbo codes are mainly used in the existing LTE / LTE-A system. The turbo code is composed of a recursive systematic convolution encoder and an interleaver. In the actual implementation of the turbo code, there is an interleaver to facilitate parallel decoding, a kind of which is quadratic polynomial permutation (QPP). Such a QPP interleaver is known to maintain good performance only for certain data block sizes. The performance of the turbo code is known to be good as the data block size increases. In the actual communication system, for the convenience of the actual implementation, the data block having a predetermined size or more is divided into several small data blocks and encoded. A small divided data block is called a code block. The code blocks generally have the same size, but due to the size limitation of the QPP interleaver, one code block of several code blocks may have a different size. Interleaving is performed to reduce the effects of burst errors that occur during transmission on a wireless channel after an error correction encoding process in units of code blocks having a predetermined interleaver size. And, it is mapped to the actual radio resource and transmitted. Since the amount of radio resources used during the actual transmission is constant, rate matching must be performed on the encoded code block in order to match them. Generally, rate matching consists of puncturing or repetition. For example, if the amount of radio resources, that is, the number of transmission bits that can be transmitted by the corresponding radio resource is M, and the coded bit sequence, i.e., the number of output bits of the encoder is N, M and N are different. Rate matching is performed to adjust the length of the coded bit sequence to match M. If M> N, then all or some of the bits of the coded bit sequence are repeated so that the length of the rate matched sequence is equal to M. If M <N, some of the bits of the coded bit sequence are punctured so that the length of the rate matched sequence is equal to M, and the punctured bits are excluded from the transmission.

In the LTE / LTE-A system, after encoding data to be transmitted by using channel coding having a specific code rate (for example, 1/3), a rate matching process consisting of puncturing and repetition is used to adjust the code rate of data to be transmitted. do. When a turbo code is used as a channel code in LTE / LTE-A, a process of channel coding and rate matching each code block in a transport channel processing process as shown in FIG. 1 is illustrated in FIG. 2.

2 is a block diagram illustrating performing rate matching by separating the systematic and parity portions of an encoded code block.

As shown in FIG. 2, the mother code rate of the LTE / LTE turbo encoder is 1/3. To obtain other code rates, iteration or puncturing must be performed if necessary, which is done by the rate matching module. The rate matching module comprises three so-called sub-block interleavers for the three output streams of the turbo encoder and a bit selection and pruning (realized) by a circular buffer. pruning). The sub-block interleaver is based on a classic row-column interleaver with 32 rows and a length-32 intra-column permutation. The bits of each of the three streams are written in a matrix of 32 columns, row-by-row (the number of rows depends on the stream size). Dummy bits are padded in front of each stream to completely fill the matrix. After column permutation bits are read from the matrix in column-by-column.

3 shows the internal structure of the circular buffer.

The circular buffer is the most important part of the rate matching module, which enables puncturing and repetition of mother code. Referring to FIG. 2, interleaved systematic bits are written to the circular buffer in sequence, with the first bit of the interleaved systematic bit streams at the beginning of the circular buffer. Interleaved and interlaced parity bit streams are sequentially written to the circular buffer, putting the first bit of the stream after the last bit of the interleaved systematic bit stream. Coded bits are read sequentially from any start point specified by redundancy version (RV) points in the circular buffer (depending on the code rate). If the end of the circular buffer is reached and more coded bits are needed for transmission (e.g., for code rates less than one third), the transmitter wraps around and continues from the beginning of the circular buffer. continue).

HARQ, which stands for hybrid ARQ, is an error correction mechanism based on retransmission of packets detected as being in error. The transmitted packet arrives after some propagation delay at the receiving device. The receiver produces an ACK in the case of an error-free transmission and produces a NACK when an error is detected. The ACK / NACK is produced after some processing time and sent to the transmitter, and reaches the transmitter after a propagation delay. In the case of NACK, after some processing delay at the transmitter, the desired packet will be sent again. The bits read from the circular buffer and sent in each retransmission are different and depend on the location of the RV. There are four RVs (0, 1, 2, 3) that define the location of the starting point at which bits are read from the circular buffer. Referring to FIG. 3, as the number of retransmissions progresses, the RV increases, so fewer systematic bits and more parity bits are read from the circular buffer for retransmission.

NR currently offers better speed and coverage than 4G, operates in high frequency bands, speeds up to 1 Gb / s for dozens of connections, or speeds up to tens of Mb / s for tens of thousands of connections. It is required to do In order to meet the requirements of the NR system, the introduction of an advanced coding scheme is being discussed. Since data communication occurs in an inverted channel environment, channel coding plays an important role in achieving higher data rates for fast, error-free communication. The selected channel code should have excellent block error ratio (BLER) performance over a certain range of block lengths and code rates. Here, BLER is defined as the ratio of the number of erroneous receiving blocks to the total number of blocks sent. In NR, low computational complexity, low latency, low cost and higher flexibility are required for the coding scheme. Furthermore, reduced energy per bit and improved region efficiency are required to support higher data rates. eMBB, Massive IoT, URLLC, etc. are considered to be examples of NR networks. eMBB covers rich media applications, cloud storage and applications, and internet connections with high data rates to enable augmented reality for entertainment. Massive IoT applications include dense sensor networks for smart homes / buildings, remote health monitoring, logistics tracking, and the like. URLLC covers critical applications that require ultra-high reliability and low latency, such as industrial automation, driverless cars, remote surgery, and smart grids.

Many coding schemes with high capacity performance at large block lengths are available, but many of them do not consistently show good performance over a wide range of block lengths and code rates. However, turbo code, low density parity check (LDPC) code and polar code show BLER performance promising over a wide range of coding rates and code lengths, and thus for NR systems. Use is under consideration. As the demand for various cases such as eMBB, Massive IoT and URLLC increases, there is a need for a coding scheme that provides stronger channel coding efficiency than turbo codes. There is also a need for an increase in the maximum number of subscribers that the channel can currently accommodate, i.e. an increase in capacity.

Polar code is a code that provides a new framework to solve the problems of existing channel codes and was invented by Arikan of Bikent University (see E. Arikan, "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels, "in IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, July2009). Polar codes are mathematically proven, first capacity-achieving codes with low encoding and decoding complexity. Polar code outperforms turbo code at large block lengths without any error flow. Hereinafter, channel coding using a polar code is called polar coding.

Polar codes are known as achieve number codes in a given binary discrete memoryless channel. This can only be done when the block size is large enough. That is, a polar code is a code that can achieve channel capacity if the code size N is infinitely large. Polar codes are less complex to encode and decode and can be successfully decoded. Polar code is a type of linear block error correcting code, and a number of recursive concatenations are the basic building blocks for polar code and the basis for code construction. A physical transformation of the channel occurs that transforms the physical channels into virtual channels, which is based on a recursive multiple concatenation. When multiple channels are multiplied and accumulated, most of the channels get better or worse, and the idea behind the polar code is to use good channels. For example, sending data at rate 1 on good channels and rate 0 on bad channels. In other words, through channel polarization, channels enter a polarized state from a normal state.

4 is a block diagram for a polar code encoder.

4 (a) shows a base module of polar code, and in particular, illustrates a first level channel combining for polar coding. In FIG. 4 (a), W ₂ denotes an entire equivalent channel obtained by combining two binary discrete memory channels (B-DMC) and W. Where u ₁ and u ₂ are binary-input source bits and y ₁ and y ₂ are output coded bits. Channel combining is a process of parallel concatenating B-DMC channels.

4 (b) shows a base matrix F for the base module, wherein the binary-input source bits u ₁ , u ₂ and corresponding outputs x ₁ , x ₂ into the base matrix F have the following relationship.

Channel W ₂ may achieve symmetric capacity I (W), which is the highest rate. Symmetric capacity is an important parameter in the B-DMC W, which is used for the measurement of rate, and is the highest rate at which reliable communication can occur across the channel W. B-DMC may be defined as follows.

It is possible to synthesize or create a second set of N binary input channels from N independent copies of a given B-DMC W, wherein the channels have properties {W _N ⁽ⁱ⁾ : 1 ≦ ⁱ ≦ N}. If N becomes large, some of the channels tend to be channels having a capacity close to one, and others are channels having a capacity close to zero. This is called channel polarization. In other words, channel polarization is the process of creating a second set of N channels {W _N ⁽ⁱ⁾ : 1≤i≤N} using N independent copies of a given B-DMC W, where the channel polarization effect is N This increase means that all symmetric capacity terms {I (W _N ⁽ⁱ⁾ )} tend to be zero or one except for the vanishing fraction of the indices i. In other words, the concept behind channel polarization in polar codes is that N copies (i.e., N transmissions) of a channel (eg, additive white Gaussian noise channel) with symmetric capacity of I (W). S) to extreme channels of close capacity of one or zero. Of the N channels, the I (W) fraction will be perfect channels and the 1-I (W) portion will be completely noisy channels. Then the information bits are sent only through good channels, and inputs to other channels are frozen to 1 or 0. The amount of channel polarization increases with block length. Channel polarization consists of two phases: the channel combining phase and the channel splitting phase.

5 illustrates the concept of channel combining and channel splitting for channel polarization. As illustrated in FIG. 5, when N copies of the original channel W are properly combined to form a vector channel W _vec and then split into polarized new channels, in case of sufficiently large N, the polarized new channels are respectively Channel capacity C (W) = 1 and C (W) = 0 is divided. In this case, the bits passing through the channel with channel capacity C (W)) = 1 can be transmitted without error, so the information bits are transmitted to the channel with channel capacity C (W) = 1, and the channel capacity C (W) = 1. Bits passing through the in-channel cannot transmit information, so it is better to transmit frozen bits, which are meaningless bits.

Referring to FIG. 5, by combining the copies of a given B-DMC W in a recursive manner, the vector channel W _vec given by W _N : X _N → Y _N may be output. Where N = 2 ⁿ and n is an integer greater than or equal to 0. Recursion always starts at the 0th level, where W ₁ = W. n = 1 means the first level of regression where two independent copies of W ₁ combine together. Combining the two copies yields channel W ₂ : X ₂ → Y ₂ . The transitional probability of this new channel W ₂ can be expressed by the following equation.

Once the channel W ₂ is obtained, a single copy of channel W ₄ can be obtained by combining two copies of W ₂ . This regression can be represented by W ₄ : X ₄ → Y ₄ with the next transition probability.

In FIG. 5, G _N is a generator matrix of size N. G ₂ corresponds to the base matrix F shown in FIG. 4 (b). G ₄ may be represented by the following matrix.

Where ⓧ is the Kronecker product, A ^ⓧn = AⓧA ^{ⓧ (n- 1)} , and A ^ⓧ0 = 1 for all n1.

The relationship between the input u ^N ₁ and the output x ^N ₁ to G _N in FIG. 5B may be represented by x ^N ₁ = u ^N ₁ G _N. Where x ^N ₁ = {x ₁ , ..., x _N }, u ^N ₁ = {u ₁ , ..., u _N }.

When combining N B-DMCs, each B-DMC may be expressed in a recursive form. That is, G _N may be expressed by the following equation.

Here, N = ²ⁿ , n1, ^Fⓧn = FⓧFⓧ ^{(n- 1)} , and ^Fⓧ0 = 1. B _N is a permutation matrix known as bit-reversal and can be recursively computed as B _N = R _N (I ₂ ⓧB _{N / 2} ). I ₂ is a 2-dimensional identity matrix, and this recursion is initialized to B ₂ = I ₂ . R _N is a bit-reversal interleaver and outputs input s ^N ₁ = {s ₁ , ..., s _N } x ^N ₁ = {s ₁ , s ₃ , ..., s _{N -1} , s ₂ , ..., s _N } is used to map. R _N first expands to Basic-2. The bit-reversing interleaver may not be included in the transmitting end. The relationship of equation (6) is shown in FIG.

6 illustrates N-th level channel combining for polar code.

The process of defining an equivalent channel for a specific input after combining the N B-DMCs W is called channel splitting. Channel splitting may be expressed as a channel transition probability as shown in the following equation.

Channel polarization has the following characteristics:

^{> Conservation: C (W -)} + C (W +) = 2C (W),

> Extremization: C (W ⁻ ) C (W) C (W ⁺ ).

After channel combining and channel splitting, the following theorem can be obtained.

* Theorem: For any B-DMC W, channels {W _N ⁽ⁱ⁾ } are polarized in the following sense. For any fixed δ∈ {0,1}, indices of I (W _N ⁽ⁱ⁾ ) ∈ (1-δ, 1] as N goes to infinity through a power of 2 The fraction of i∈ {1, ..., N} goes to I (W), and the fraction of I (W _N ⁽ⁱ⁾ ) ∈ [0, δ) goes to 1-I (W). Therefore, if N → ∞, the channels are completely noisy or are freely polarized in noise, and these channels are exactly known at the transmitting end. Thus, it is possible to fix bad channels and to send the unsolidified bits on the good channels.

That is, when the size N of the polar code becomes infinity, the channel becomes a noisy or noisy channel for a specific input bit. This means that the equivalent channel capacity for a particular input bit is divided by 0 or I (W).

An input of a polar encoder is divided into a bit channel to which information data is mapped and a bit channel not to it. As described above, according to the theory of polar codes, input bit channels may be divided into a noiseless channel and a noise channel as the codeword of the polar code becomes infinity. Therefore, by allocating information to a noiseless bit channel, channel capacity can be obtained. However, since it is impossible to construct an infinite length codeword, the reliability of the input bit channel is calculated and the data bits are allocated in that order. In the present invention, a bit channel to which data bits are allocated is referred to as a good bit channel. A good bit channel is an input bit channel to which data bits are mapped. The bit channel to which data is not mapped is called a frozen bit channel, and encoding is performed by inputting a known value (eg, 0) to the frozen bit channel. Any value known to the transmitter and receiver can be mapped to the frozen bit channel. When performing puncturing or repetition, information about good bit channels can be utilized. For example, a codeword bit (ie, output bit) location corresponding to an input bit location that is not assigned to an information bit may be punctured.

The decoding method of the polar code is a successive cancellation (SC) decoding method. SC decoding is a method of obtaining a channel transition probability and calculating a likelihood ratio (LLR) for an input bit. In this case, the channel transition probability may be calculated in a recursive manner by using a characteristic in which the channel combining and channel splitting processes are recursive. Thus, finally, the LLR value can also be calculated in a recursive fashion. First, the channel transition probability W _N ⁽ⁱ⁾ (y ₁ ^N , u ₁ ^i-1 | u ₁ ) for the input bit u _i can be obtained as follows. u ₁ ⁱ is divided into an odd index and an even index, It can be expressed as u _{1, o} ⁱ , u _{1, e} ⁱ . The channel transition probability may be expressed as the following equations.

The polar decoder retrieves the information and generates an estimate u ^ ^N ₁ of u ^N ₁ with values known to the polar code (eg, received bits, frozen bits, etc.). LLR is defined as follows.

LLR can be calculated recursively as follows.

The recursive calculation of LLRs is traced back to code length 1, where LLR L ⁽¹⁾ ₁ (y _i ) = W (y _i | 0) / W (y _i | 1). L ⁽¹⁾ ₁ (y _i ) is the soft information observed from the channel.

The complexity of the polar encoder and the SC decoder depends on the length N of the polar code, which is known to have a complexity of O (NlogN). Assuming K input bits in a polar code of length N, the coding rate is N / K. If the generator matrix of the polar encoder of data payload size N is G _N , the encoded bit may be represented as x ^N ₁ = u ^N ₁ G _N , where K bits of u ^N ₁ are pay la corresponds to the load bit and the i-line (row) of the index G _N corresponding to the payload bits, and it is assumed that the row index of G _N corresponding to the remaining bits NK F. The minimum distance of such a polar code may be given as d _min (C) = min _{i∈ I} 2 ^{wt (i)} . Where wt (i) is the number of 1s in the binary extension of i, where i = 0,1, ..., N-1.

SC List (SCL) decoding is an extension of the basic SC decoder. In this kind of decoder, the L decoding paths are considered simultaneously in each stage of decoding. Where L is an integer. In other words, in the case of the polar code, the list-L decoding algorithm is an algorithm that simultaneously tracks L paths in the decoding process.

7 illustrates the evolution of decoding paths in the List-L decoding process. For convenience of explanation, it is assumed that the number of bits to be determined is n and not all bits are frozen. If the list size L = 4, each level has at most four nodes with paths that continue downwards. Discontinue paths are indicated by dashed lines in FIG. 7. Referring to FIG. 7, a process of evolution of decoding paths in list-L decoding is as follows. i) List-L decoding starts, and the first unfrozen bit may be zero or one. ii) List-L decoding continues. The second unfrozen bits may be zero or one. Since the number of paths is not greater than L = 4, there is no need to prune yet. iii) Considering all options for the first bit (that is, the bit of the first level), the second bit (that is, the bit of the second level), and the third bit (that is, the bit of the third level) is eight This results in a decoding path and there are too many eight decoding paths since L = 4. iv) Prune the eight decoding paths into L = 4 promising paths. v) Continue the four active paths by considering two options of the fourth unprepared bit. In this case, the number of paths is doubled to eight, and since L = 4, the number of paths is too large. vi) Again, pruning with L = 4 best paths. In the example of FIG. 7, four candidate codewords 0100, 0110, 0111, and 1111 are obtained, one of which is determined as the codeword most similar to the original codeword. As in the general decoding process, for example, in a pruning process or determining a final codeword, a path having the largest sum of LLR absolute values may be selected as a surviving path. If there is a CRC, the survival path may be selected via the CRC.

Meanwhile, CRC aided SCL decoding is SCL decoding using CRC, which improves the performance of the polar code. CRC is the most widely used technique for error detection and error correction in the field of information theory and coding. For example, if the input block to the error correction encoder is K bits, the length of the information bits is k, and the length of the CRC sequence is m bits, then K = k + m. The CRC bits are part of the source bits for the error correction code, and if the size of the channel code used for encoding is N, the code rate R is defined as R = K / N. CRC assisted SCL decoding aims to detect an error-free path while checking a cyclic redundancy check (CRC) code for each path at a receiver. The SCL decoder outputs candidate sequences to the CRC detector which feeds back the check result to aid in codeword determination.

SCL decoding or CRC assisted SCL decoding is more complex than SC algorithm, but has the advantage of superior decoding performance. For more information on the List-X decoding algorithm for polar codes, see 'I. Tal and A. Vardy, "List decoding of polar codes," in Proc. IEEE Int. Symp. Inf. Theory, pp. 1-5, Jul. 2011 '.

Polar code has the disadvantage that the code design is independent of the channel, so that there is no flexibility in the mobile fading channels, and since it is a relatively recently introduced code, it is not yet mature and is only limitedly applied. In other words, the polar coding proposed up to now is not defined in many applications. Accordingly, the present invention is to propose a polar coding method suitable for a wireless communication system.

8 is illustrated to illustrate the concept of selecting location (s) to which information bit (s) are to be allocated in the polar code.

In FIG. 8, it is assumed that the size N = 8 of the mother code, that is, the size N = 8 of the polar code, and the code rate is 1/2.

In FIG. 8, C (W _i ) is the capacity of channel W _i , which corresponds to the reliability of the channels that the input bits of the polar code will experience. If the channel capacities corresponding to the input bit positions of the polar code are as shown in FIG. 8, the reliability of the input bit positions can be ranked as shown in FIG. 8. In this case, in order to transmit data at the code rate 1/2, the transmitter transmits the four bits constituting the data to four input bit positions having a high channel capacity among eight input bit positions of the polar code. Input bit positions u ₄ , u ₆ , u ₇ and u ₄ of input bit positions u ₁ to u ₈ of ₈ ) and frozen the remaining input bit positions. The generator matrix G ₈ corresponding to the polar code of FIG. ₈ is as follows. The generator matrix G ₈ may be obtained based on Equation 6.

The input bit positions indicated by u ₁ to u _{8 in} FIG. 8 correspond one-to-one to rows from the lowest row to the highest row of G ₈ . Referring to FIG. 8, it can be seen that an input bit corresponding to u ₈ affects all output coded bits. On the other hand, it can be seen that the input bit corresponding to u ₁ only affects y ₁ (ie, x ₁ ) of the output coded bits. Referring to Equation 12, when the binary-input source bits u ₁ to u ₈ and G ₈ are multiplied, a row that causes the corresponding input bit to appear in all the output bits is represented by all elements of the rows of G ₈ . Lowest row [1, 1, 1, 1, 1, 1, 1, 1]. On the other hand, a row that causes the corresponding binary-input source bit to appear in only one output bit is a row where one element of the rows of G ₈ is 1, that is, the row weight is 1 [1, 0, 0, 0 , 0, 0, 0, 0]. Similarly, a row having a row weight of 2 reflects the input bits corresponding to the rows in the two output bits. Referring to FIG. 8) and (12, u ₁ ~ u ₈ corresponds one-to-one to the rows of the G _8, u ₁ ~ input position _{u. 8,} that is, to distinguish between the input position to the rows of the G ₈ Bit indexes may be given.

In the following, the present invention is mainly described on the assumption that bit indices are sequentially assigned from N to N-1, starting from the highest row having the smallest row weight, for the N input bits to G _N. For example, referring to Figure 8, the input position of u _1, that is, to be a bit index 0 given to the first row of the G _8, the input of u _8-position, that is, the bits in the last row of G ₈ index 7 Is given. However, since the bit indices are used to indicate the input positions of the polar code, they may be allocated differently. For example, bit indexes 0 to N-1 may be allocated starting from the lowest row having the largest row weight.

In the case of the output bit index, as illustrated in FIG. 8 and Equation 12, bit indexes 0 to N-1 from the first column having the largest column weight to the last column having the smallest column weight among the columns of G _N , or The invention is described assuming that bit indices 1 through N are assigned.

In polar code, setting the information bit and the frozen bit is one of the most important factors in the configuration and performance of the polar code. In other words, ranking the input bit positions is an important factor in the performance and configuration of the polar code. In the present invention, the bit indices may distinguish input or output positions of the polar code. In the present invention, a sequence obtained by arranging in ascending or descending order of reliability of bit positions is referred to as a bit index sequence. That is, the bit index sequence indicates the reliability of the input or output bit positions of the polar code in ascending or descending order. The transmitter inputs information bits into highly reliable input bits based on the input bit index sequence and performs encoding using a polar code, and the receiving apparatus allocates information bits using the same or corresponding input bit index sequence. Know the input positions or input positions to which the frozen bit is assigned. That is, the receiving device may perform polar decoding by using the same or corresponding input bit sequence and the corresponding polar code as the input bit index sequence used by the transmitting device. In the following description it is assumed that the input bit sequence is predetermined so that the information bit (s) can be assigned to the input bit position (s) of high reliability.

In the case of encoding / decoding of the polar code, since the mother code size, that is, the size of the polar code is determined, rate matching is required to map the coded bits to resources allocated for transmission of the transport block. Unlike input bits whose reliability is different for each input bit position, the reliability according to the output positions may not be clearly distinguished in the case of coded bits. Thus, for example, performance when the output bits of the lower coded bit index are punctured (eg, BLER), performance when the output bits of the higher coded bit index are punctured, and randomly It can be mistaken that the performance when the output bits are punctured will have almost similar characteristics. However, due to the structure of the polar code, there is a characteristic of input bit connection for each output position. For example, in the case of a polar code, there are output bits connected to only one input bit, and output bits connected to all inputs. In addition, the output bit position punctured according to the code rate of the polar code also affects BLER performance. Therefore, the present invention proposes a rate matching technique utilizing the same.

FIG. 10 conceptually illustrates an iterative scheme and a puncturing scheme used in an IEEE 802.11n series system, which is a wireless communication system with an LTE / LTE-A system. In particular, FIG. 10 conceptually illustrates the selection order of the bit (s) to be repeated for rate matching and the selection order of the bit (s) to be punctured.

In the IEEE 802.11n series system, a low density parity check (LDPC) code is used for channel coding. An order in which iteration for rate matching is performed and puncturing is performed on a bit sequence coded by the LDPC code. The order is reversed as shown in FIG. For example, when puncturing for rate matching is to be performed on an output sequence of a channel code, the end bit that is the least significant bit (LSB) among the bits of the output sequence is excluded from the transmission target. On the other hand, when puncturing for rate matching is to be performed on an output sequence of a channel code, the punctuation for rate matching is repeatedly transmitted from the first bit, which is the most significant bit (MSB) of bits of the output sequence. If the total amount of radio resources used for transmission of the output sequence is larger than the entire output sequence is repeated by a positive integer multiple, the output sequence is cyclically repeated from the beginning of the output sequence.

The present invention proposes a rate matching method in which the order of selecting the bit (s) to be repeated and the order of selecting the bit (s) to be punctured are the same.

11 conceptually illustrates an iterative method and a puncturing method according to the present invention. In particular, FIG. 11 conceptually illustrates the bit (s) selection order to be repeated and the bit (s) selection order to be punctured according to the present invention.

In polar code, it is difficult to say that bit positions with high importance and bits with low importance within an output bit sequence are inverted. That is, in polar code, channel coding performance is not high when the repetition bit order and the puncturing bit order are reversed. Thus, in the case of polar code, it is possible to make the bit selection order for repetition and the bit selection order for puncturing the same according to the purpose of use (eg, BLER performance). 11A shows puncturing in descending order from the most significant bit of the output bit sequence when puncturing is to be performed on the output bit sequence (that is, when the number of bits that can be transmitted is smaller than the number of output bits of the encoder). And iteratively performing an iteration on an output bit sequence (i.e., when the number of bits that can be transmitted is greater than the number of output bits of the encoder). will be. 11B illustrates puncturing in ascending order from the least significant bit of the output bit sequence when puncturing is to be performed on an output bit sequence, and when iteration is to be performed on the output bit sequence. It illustrates a rate matching method of performing repetition in ascending order from the least significant bit.

Hereinafter, with reference to FIG. 8, the reason or effect of puncturing bit selection order and repetition bit selection order in accordance with the present invention will be described. 8 shows a connection between input bits included in each coded bit. Since x ₈ contains only u ₈ , it only affects the performance for u ₈ . On the other hand, x ₁ is connected to all input bits, which affects the performance of all input bits. The puncturing on the output bit may have the following characteristics according to the puncturing method.

* Method 1. ₈ x from punctured from the coded bit reliability to low reliability bits of the input are connected to a high input-bit is punctured sequentially. For example, in FIG. 8, since the reliability order of the input bit indices is {u ₈ , u ₇ , x ₆ , x ₄ , x ₅ , x ₃ , x ₂ , x ₁ } in descending order, x ₈ , x ₇ , x ₆ The puncturing may be performed in the order of x ₄ , x ₅ ,... That is, the input bit index sequence arranged in descending order based on the reliability may be the same as the output bit index sequence listing the order of the output bit index punctured. Alternatively, a bit index sequence according to a bit-reversal scheme such as a quasi-uniform puncturing (QUP) algorithm may be utilized as a sequence indicating an order in which output bits of a polar code are punctured. Bit-reversal is an algorithm that reverses the order of the most significant bit (MSB) and the least significant bit (LSB). For example, the bit index sequences x0, x1, x2, x3, x4, x5, x6, x7 with N = 8 are bit-reversed to be x0, x4, x2, x6, x1, x5, x3, x7. In the puncturing according to the bit-reversal method, since the input bit (s) having a lot of connections with the output bits are punctured, the decoder of the receiving apparatus uses another coded bit even if the corresponding coded bit is not transmitted. The corresponding input bits of the untransmitted coded bits may be recovered.

Method 2. Puncture from x ₁ : This is a method of using the opposite (input bit) index order from Method 1. In other words, in ascending order of reliability of the input bits, they are punctured sequentially from coded bits connected to input bits of low reliability. For example, the input bit index sequence arranged in ascending order based on the reliability and the output bit index sequence listing the order of the output bit index punctured may be the same. The output bits associated with the various input bits contain information of the various input bits coupled with them, but the input bits in the coded bits can act as interference. Method 2 may puncture from coded bit (s) with high interference between input bits or from coded bit (s) with low reliability input bits. Method 2 may have the effect of lowering interference of the frozen bit with each input bit, in particular with the information bit.

Repeating the output bits for rate matching can also have features similar to puncturing.

* Method a. Repetition from x ₈ : In descending order of reliability of the input bits, iteratively repeats from the coded bits connected to the high reliability input bits. For example, in FIG. 8, since the reliability order of the input bit indices is {u ₈ , u ₇ , x ₆ , x ₄ , x ₅ , x ₃ , x ₂ , x ₁ } in descending order, x ₈ , x ₇ , x ₆ Iteration may be performed in the order of x ₄ , x ₅ ,... That is, the input bit index sequence arranged in descending order based on the reliability may be the same as the output bit index sequence listing the order of repeated output bit indexes. Alternatively, a bit-reversal scheme such as a QUP algorithm may be utilized. In polar code, the more reliable input bits are connected to more coded bits than the lower input bits. Method a repeats from the output bit (s) corresponding to the high-reliability input bit (s), thus allowing the high-reliability input bits to be recovered better, due to the iteration over the coded bits connected to the high-reliability input bits. Since the reliability of the corresponding input bit (s) can be further increased, the performance of other bits that interfere with the input bits having high reliability can be improved.

* Method b. Repeat from x ₁ : This is the opposite of (a) index order. In other words, in ascending order of reliability of the input bits, they are punctured sequentially from coded bits connected to input bits of low reliability. For example, the input bit index sequence arranged in ascending order based on the reliability may be the same as the output bit index sequence enumerating the order of repeated output bit indexes. Method b may repeat from coded bit (s) with high interference between input bits or from coded bit (s) with high reliability input bits. Method b may improve the overall block error ratio (BLER) by improving performance for low reliability input bits.

That is, Method 1 and Method a have the same or similar purpose or effect, and Method and Method b have the same or similar purpose or effect. In consideration of this, it is preferable that the order of repeat bit selection and puncturing selection for rate matching in a polar code is the same. Whether the bit index is repeated or punctured from the large output bit or the bit index is repeated or punctured from the small output bit can be determined differently depending on the purpose of use. For example, N = 8 in polar for code output bits x ₁ ~ x ₈ of Figure 11 (a) and the FIG. 11 (b) in the x ₁ located at the left side x ₈ on the right side in each position Assuming that the effects according to the method 2 and the method b are required, the rate matching of FIG. 11 (a) is determined to be used, and when the effects according to the method 1 and the method a are required, the rate matching of FIG. Can be arranged to use.

However, to the communication system I would like to better protect a highly reliable input bit (for example, u ₈ in FIG. 8), the puncturing by using a circular buffer, such as performing a random puncturing (e. G., Implementation complexity surface If it is advantageous, the iterative order and puncturing order may be applied to rate matching (rather than the same rate matching scheme) where the iteration order and puncturing order are the same.

If the mother code size is smaller than the desired coded bit size or if the bit size coded by the encoder is smaller than the transmit bit size that can be transmitted, iteration is applied to the coded bits. If the mother code size is larger than the desired coded bit size or if the bit size coded by the encoder is larger than the transmit bit size that can be transmitted, puncturing is performed on the coded bits.

12 is a block diagram showing the components of the transmitter 10 and the receiver 20 for carrying out the present invention.

The transmitter 10 and the receiver 20 are radio frequency (RF) units 13 and 23 capable of transmitting or receiving radio signals carrying information and / or data, signals, messages, and the like, and in a wireless communication system. The device is operatively connected to components such as the memory 12 and 22, the RF unit 13 and 23, and the memory 12 and 22, which store various types of information related to communication, and controls the components. And a processor (11, 21) configured to control the memory (12, 22) and / or the RF unit (13, 23), respectively, to perform at least one of the embodiments of the invention described above.

The memories 12 and 22 may store a program for processing and controlling the processors 11 and 21, and may temporarily store input / output information. The memories 12 and 22 may be utilized as buffers.

The processors 11 and 21 typically control the overall operation of the various modules in the transmitter or receiver. In particular, the processors 11 and 21 may perform various control functions for carrying out the present invention. The processors 11 and 21 may also be called controllers, microcontrollers, microprocessors, microcomputers, or the like. The processors 11 and 21 may be implemented by hardware or firmware, software, or a combination thereof. When implementing the present invention using hardware, application specific integrated circuits (ASICs) or digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), FPGAs ( field programmable gate arrays) may be provided in the processors 400a and 400b. Meanwhile, when implementing the present invention using firmware or software, the firmware or software may be configured to include a module, a procedure, or a function for performing the functions or operations of the present invention, and configured to perform the present invention. The firmware or software may be provided in the processors 11 and 21 or stored in the memory 12 and 22 to be driven by the processors 11 and 21.

The processor 11 of the transmission apparatus 10 is predetermined from the processor 11 or a scheduler connected to the processor 11 and has a predetermined encoding and modulation on a signal and / or data to be transmitted to the outside. After performing the transmission to the RF unit 13. For example, the processor 11 converts the data sequence to be transmitted into K layers through demultiplexing, channel encoding, scrambling, and modulation. The coded data string is also called a codeword and is equivalent to a transport block, which is a data block provided by the MAC layer. One transport block (TB) is encoded into one codeword, and each codeword is transmitted to a receiving device in the form of one or more layers. The RF unit 13 may include an oscillator for frequency upconversion. The RF unit 13 may include N _t transmit antennas, where N _t is a positive integer of 1 or more.

The signal processing of the receiver 20 is the reverse of the signal processing of the transmitter 10. Under the control of the processor 21, the RF unit 23 of the receiving device 20 receives a radio signal transmitted by the transmitting device 10. The RF unit 23 may include N _r receive antennas, and the RF unit 23 frequency down-converts each of the signals received through the receive antennas to restore the baseband signal. . The RF unit 23 may include an oscillator for frequency downconversion. The processor 21 may decode and demodulate a radio signal received through a reception antenna to restore data originally transmitted by the transmission apparatus 10.

The RF units 13, 23 have one or more antennas. The antenna transmits a signal processed by the RF units 13 and 23 to the outside under the control of the processors 11 and 21, or receives a radio signal from the outside to receive the RF unit 13. , 23). Antennas are also called antenna ports. Each antenna may correspond to one physical antenna or may be configured by a combination of more than one physical antenna elements. The signal transmitted from each antenna can no longer be decomposed by the receiver 20. A reference signal (RS) transmitted in correspondence with the corresponding antenna defines the antenna as viewed from the perspective of the receiver 20, and whether the channel is a single radio channel from one physical antenna or includes the antenna. Regardless of whether it is a composite channel from a plurality of physical antenna elements, the receiver 20 enables channel estimation for the antenna. That is, the antenna is defined such that a channel carrying a symbol on the antenna can be derived from the channel through which another symbol on the same antenna is delivered. In the case of an RF unit that supports a multi-input multi-output (MIMO) function for transmitting and receiving data using a plurality of antennas, two or more antennas may be connected.

The transmitter 10 may be configured to include a polar encoder according to the present invention, and the receiver 20 may be configured to include a polar decoder according to the present invention. For example, processor 11 of transmitter 10 may be configured to perform polar encoding according to the present invention, and processor 21 of receiver 20 is configured to perform polar decoding according to the present invention. Can be. That is, the polar encoder according to the present invention may be configured as part of the processor 11 of the transmitter 10, and the polar decoder according to the present invention may be configured as part of the processor 21 of the receiver 20. have.

In the present invention, the processor 11 of the transmitter 10 may apply rate matching to the output bit sequence of the polar code, that is, the output bit sequence of the polar encoder. The processor 11 may be configured to apply a direction in which repetition for rate matching is performed and a direction in which puncturing for rate matching is performed with respect to the output bit sequence. In detail, the processor 11 may generate a first output bit sequence having a length N by encoding the input information using a polar code having a mother code size N. The processor unit rate-matches the first output bit sequence if the number of transmission bits M and the mother code size N are different, and transmits the second output bit sequence obtained by rate matching the first input sequence. To control. If M> N, the second output bit sequence may correspond to a sequence in which some or all of the first output bit sequence is added to the first output bit sequence. For example, the processor 11 further transmits MN bits in a specific order of bits of the first output bit sequence together with the first output bit sequence, that is, in a sequence direction, when M> N. The RF unit 13 can be controlled to If M <N, the second output bit sequence may correspond to a sequence in which some of the first output bit sequences are excluded. That is, if M> N, the processor 11 is configured to exclude NM bits in the same order as the specific order of the first output bit sequence, that is, in the same direction, and to transmit the remaining M bits. The RF unit 13 may be controlled.

In the present invention, the RF unit 23 of the receiving device 20 receives a signal from the transmitting device 10 and transmits the signal to the processor 21 of the receiving device 20. The processor 21 restores the original signal by decoding the received signal using a polar code having a mother code size N. Since the processor 21 knows the punctured bit portion and the repeated bit portion since the processor 21 knows the specific order used by the transmission apparatus 10, the processor 21 may provide information about the punctured bit portion or the repeated bit portion. It can be used to decode the received signal.

The detailed description of the preferred embodiments of the invention disclosed as described above is provided to enable those skilled in the art to implement and practice the invention. Although the above has been described with reference to preferred embodiments of the present invention, those skilled in the art will variously modify and change the present invention without departing from the spirit and scope of the invention as set forth in the claims below. I can understand that you can. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Embodiments of the present invention may be used in a base station or user equipment or other equipment in a wireless communication system.

Claims (10)

1. In transmitting information in a wireless communication system,

   Encoding input information using a polar code of mother code size N to generate a first output bit sequence of length N;

   Transmitting the second output bit sequence by rate-matching the first output bit sequence if the number of transmission bits M and the mother code size N are different;

   Transmitting the second output bit sequence is:

   If M> N, then transmitting M-N bits in a specific order among the bits of the first output bit sequence together with the first output bit sequence;

   If M <N, then transmitting the remaining M bits except N-M bits in the same order as the specific order of the first output bit sequence,

   How to send information.
2. The method of claim 1,

   The specific order is a descending order of reliability of input bit positions of the polar code,

   The M-N bits are output bits having the same index as the M-N input bit positions with the highest reliability, and the N-M bits are output bits corresponding to the N-M input bit positions with the highest reliability;

   How to send information.
3. The method of claim 1,

   The specific order is an ascending order of reliability of input bit positions of the polar code,

   The M-N bits are output bits with the same index as the M-N input bit positions with the lowest reliability, and the N-M bits are output bits corresponding to the N-M input bit positions with the lowest reliability,

   How to send information.
4. The method of claim 1,

   The specific order is ascending from the least significant bit of the first output bit sequence;

   How to send information.
5. The method of claim 1,

   The specific order is descending from the most significant bit of the first output bit sequence;

   How to send information.
6. In transmitting information in a wireless communication system,

   A radio frequency (RF) unit, and

   A processor configured to control the RF unit, the processor comprising:

   Encoding input information using a polar code of mother code size N to generate a first output bit sequence of length N;

   Control the RF unit to rate-match the first output bit sequence to transmit a second output bit sequence if the number of transmit bits M and the mother code size N are different, wherein the processor is configured to:

   If M> N, then control the RF unit to further transmit M-N bits in a specific order among the bits of the first output bit sequence together with the first output bit sequence, and

   And if M <N, control the RF unit to transmit the remaining M bits except N-M bits in the same order as the particular order of the first output bit sequence;

   Information transmission device.
7. The method of claim 6,

   The specific order is a descending order of reliability of input bit positions of the polar code,

   The M-N bits are output bits having the same index as the M-N input bit positions with the highest reliability, and the N-M bits are output bits corresponding to the N-M input bit positions with the highest reliability;

   Information transmission device.
8. The method of claim 6,

   The specific order is an ascending order of reliability of input bit positions of the polar code,

   The M-N bits are output bits with the same index as the M-N input bit positions with the lowest reliability, and the N-M bits are output bits corresponding to the N-M input bit positions with the lowest reliability,

   Information transmission device.
9. The method of claim 6,

   The specific order is ascending from the least significant bit of the first output bit sequence;

   Information transmission device.
10. The method of claim 6,

    The specific order is descending from the most significant bit of the first output bit sequence;

    Information transmission device.

Images